* plus the given elements, according to {@link #expectContents(java.util.Collection)}. In other
   * words, for the default {@code expectContents()} implementation, the number of occurrences of
   * each given element has increased by one since the test collection was created, and the number
   * of occurrences of all other elements has not changed.
   *
   * <p>Note: This means that a test like the following will fail if {@code collection} is a {@code

MinIO server allows to throttle incoming requests:

- limit the number of active requests allowed across the cluster
- limit the wait duration for each request in the queue

These values are enabled using server's configuration or environment variables.

## Examples

    }

    /**
     * Sets the minimum number of bytes that must be read for the operation to succeed
     *
     * @param minimumCount
     *            the minimumCount to set
     */
    public void setMinimumCount(final int minimumCount) {
        this.minimumCount = minimumCount;
    }

    /**
     * Sets the number of bytes remaining to be read after this request
     *

- Greater than `REDUCED_REDUNDANCY` parity, if it is set.

Parity blocks can not be higher than data blocks, so `STANDARD` storage class parity can not be higher than N/2. (N being total number of drives)

The default value for the `STANDARD` storage class depends on the number of volumes in the erasure set:

| Erasure Set Size | Default Parity (EC:N) |
|------------------|-----------------------|
| 5 or fewer       |                 EC:2  |

    /**
     * Skips over and discards {@code n} bytes of data from this input stream.
     * This method delegates to {@link FileInputStream#skip(long)}.
     *
     * @param n the number of bytes to be skipped
     * @return the actual number of bytes skipped
     * @throws IOException if an I/O error occurs.
     */
    @Override
    public long skip(final long n) throws IOException {
        return fileInputStream.skip(n);

        // Note: The current implementation does not validate the outer APPLICATION tag number
        // This test documents the actual behavior - any tag number is accepted
        byte[] token =
                buildInitToken(new ASN1ObjectIdentifier[] { OID_KRB }, NegTokenInit.INTEGRITY, new byte[] { 0x42 }, null, false, null, 1, // Non-zero tag number is currently accepted
                        null);

    /**
     * Do not instantiate.
     */
    protected ThreadUtil() {
    }

    /**
     * Causes the currently executing thread to sleep (temporarily cease execution) for the specified number of milliseconds.
     *
     * @param millis
     *            the length of time to sleep in milliseconds
     * @throws InterruptedRuntimeException
     *             if any thread has interrupted the current thread.

 * @param <N> Node parameter type
 */
abstract class AbstractBaseGraph<N> implements BaseGraph<N> {

  /**
   * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}.
   * This implementation requires O(|N|) time. Classes extending this one may manually keep track of
   * the number of edges as the graph is updated, and override this method for better performance.
   */
  protected long edgeCount() {

            type: integer
            minimum: 0
            exclusiveMinimum: false
            default: 0
            example: 0
        - name: num
          in: query
          description: The number of returned documents as a search result
          required: false
          schema:
            type: integer
            minimum: 0
            exclusiveMinimum: false
            maximum: 100

    private int tflags;
    private Referral[] referrals;

    /**
     * Get the number of characters consumed from the path
     *
     * @return the pathConsumed
     */
    public final int getPathConsumed() {
        return this.pathConsumed;
    }

    /**
     * Get the number of referrals in the response
     *
     * @return the numReferrals
     */