* @param targetHost the target host
     * @param root the DFS root
     * @param path the DFS path
     * @return the DFS referral data or null if not found
     * @throws SmbAuthException if authentication fails
     */
    protected DfsReferralDataInternal getReferral(final CIFSContext tf, final SmbTransportInternal trans, final String target,

			// spl interval: [1024B, 1MiB)
			res[szInt.name] = splCount
		case humanize.KiByte <= szInt.start && szInt.end <= humanize.MiByte-1:
			// intervals that fall within the spl interval above; they
			// appear earlier in this array of intervals, see
			// ObjectsHistogramIntervals
			splCount += count
			fallthrough
		default:
			res[szInt.name] = count
		}
	}

        }
    }

    /**
     * Ensures tree connection is established with optimized connection reuse.
     * @return active tree handle
     * @throws CIFSException if connection fails
     *
     */
    synchronized SmbTreeHandleImpl ensureTreeConnected() throws CIFSException {
        // Optimization: Check connection validity more efficiently

### Otras formas de código asíncrono

Este estilo de usar `async` y `await` es relativamente nuevo en el lenguaje.

Pero hace que trabajar con código asíncrono sea mucho más fácil.

Esta misma sintaxis (o casi idéntica) también se incluyó recientemente en las versiones modernas de JavaScript (en el Navegador y NodeJS).

Pero antes de eso, manejar el código asíncrono era mucho más complejo y difícil.

		// clients detect malformed certificates during testing instead of e.g.
		// a self-signed certificate that works while a comparable certificate
		// issued by a trusted CA fails due to the MinIO server being less strict
		// w.r.t. key usage verification.
		//
		// Basically, MinIO is more consistent (from a client perspective) when
		// we verify the key usage all the time.

pkg net/mail, func ReadMessage(io.Reader) (*Message, error)
pkg net/mail, method (*Address) String() string
pkg net/mail, method (Header) AddressList(string) ([]*Address, error)
pkg net/mail, method (Header) Date() (time.Time, error)
pkg net/mail, method (Header) Get(string) string
pkg net/mail, type Address struct
pkg net/mail, type Address struct, Address string

labels.user_given_name=Имя
labels.givenName=Имя (данное имя)
labels.user_surname=Фамилия
labels.surame=Фамилия
labels.user_mail=Электронная почта
labels.mail=Электронная почта
labels.user_employeeNumber=Номер сотрудника
labels.employeeNumber=Номер сотрудника
labels.user_telephoneNumber=Номер телефона
labels.telephoneNumber=Номер телефона
labels.user_homePhone=Домашний телефон

labels.user_given_name=Nome
labels.givenName=Nome (dato)
labels.user_surname=Cognome
labels.surame=Cognome
labels.user_mail=Indirizzo email
labels.mail=Indirizzo email
labels.user_employeeNumber=Numero dipendente
labels.employeeNumber=Numero dipendente
labels.user_telephoneNumber=Numero di telefono
labels.telephoneNumber=Numero di telefono

   *         <li>one plus an index into the keys, values, and entries arrays
   *       </ul>
   *   <li>another java.util.Map delegate implementation. In most modern JDKs, normal java.util hash
   *       collections intelligently fall back to a binary search tree if hash table collisions are
   *       detected. Rather than going to all the trouble of reimplementing this ourselves, we

</p>

<ol>
<li>
	<p>
	The type equations are solved for the bound
	type parameters using <a href="#Type_unification">type unification</a>.
	If unification fails, type inference fails.
	</p>
</li>
<li>
	<p>
	For each bound type parameter <code>P<sub>k</sub></code> for which no type argument
	has been inferred yet and for which one or more pairs