* it being arbitrarily reordered, and you want to avoid that copy, you can use {@code
 * computeInPlace} instead of {@code compute}.
 *
 * <h3>Definition and notes on interpolation</h3>
 *
 * <p>The definition of the kth q-quantile of N values is as follows: define x = k * (N - 1) / q; if
 * x is an integer, the result is the value which would appear at index x in the sorted dataset

    boolean checkStatus ( ServerMessageBlock req, ServerMessageBlock resp ) throws SmbException {
        boolean cont = false;
        if ( resp.getErrorCode() == 0x30002 ) {
            // if using DOS error codes this indicates a DFS referral
            resp.setErrorCode(NtStatus.NT_STATUS_PATH_NOT_COVERED);
        }
        else {
            resp.setErrorCode(SmbException.getStatusByCode(resp.getErrorCode()));
        }

	}

	return fi.ToObjectInfo(minioMetaBucket, key, opts.Versioned || opts.VersionSuspended), nil
}

// PutObject - creates an object upon reading from the input stream
// until EOF, erasure codes the data across all disk and additionally
// writes `xl.meta` which carries the necessary metadata for future
// object operations.

    /**
     * Get the value for the key 'crawler.failure.url.status.codes'. <br>
     * The value is, e.g. 404 <br>
     * @return The value of found property. (NotNull: if not found, exception but basically no way)
     */
    String getCrawlerFailureUrlStatusCodes();

    /**
     * Get the value for the key 'crawler.failure.url.status.codes' as {@link Integer}. <br>
     * The value is, e.g. 404 <br>

    return JavaLowerCase.INSTANCE;
  }

  /**
   * Determines whether a character is an ISO control character as specified by {@link
   * Character#isISOControl(char)}.
   *
   * <p>All ISO control codes are on the BMP and thus supported by this API.
   *
   * @since 19.0 (since 1.0 as constant {@code JAVA_ISO_CONTROL})
   */
  public static CharMatcher javaIsoControl() {
    return JavaIsoControl.INSTANCE;
  }

   * all are provided (an empty list), the resulting Cartesian product has one element, an empty
   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of sets of size {@code m, n, p} is a
   * set of size {@code m x n x p}, its actual memory consumption is much smaller. When the

are dependencies on libraries beyond libc, external linking is likely
to work better. The compilation of a package records the relevant
information to support both linking modes, leaving the decision
to be made when linking the final binary.

Linking Directives

In either linking mode, package-specific directives must be passed

	data := make([]byte, 8)
	binary.LittleEndian.PutUint64(data, writeCount)
	return xattr.LSet(s.formatFile, attr, data)
}

// DiskInfo provides current information about disk space usage,
// total free inodes and underlying filesystem.
func (s *xlStorage) DiskInfo(ctx context.Context, _ DiskInfoOptions) (info DiskInfo, err error) {
	info, err = s.diskInfoCache.GetWithCtx(ctx)
	info.NRRequests = s.nrRequests

pkg text/template/parse, type ListNode struct, Nodes []Node
pkg text/template/parse, type ListNode struct, embedded NodeType
pkg text/template/parse, type Node interface { Copy, String, Type }
pkg text/template/parse, type Node interface, Copy() Node
pkg text/template/parse, type Node interface, String() string
pkg text/template/parse, type Node interface, Type() NodeType
pkg text/template/parse, type NodeType int

</li>
<li>
	Both type parameters have a known type argument
	and the type arguments unify per the given matching modes.
</li>
</ul>

<p>
A single bound type parameter <code>P</code> and another type <code>T</code> unify
per the given matching modes if:
</p>

<ul>
<li>
	<code>P</code> doesn't have a known type argument.