}

  /**
   * Creates and returns a new builder, configured to build {@code MinMaxPriorityQueue} instances
   * that are limited to {@code maximumSize} elements. Each time a queue grows beyond this bound, it
   * immediately removes its greatest element (according to its comparator), which might be the
   * element that was just added.
   */
  @SuppressWarnings("rawtypes") // https://github.com/google/guava/issues/989

        assertFalse(cos.done);
        assertFalse(cos.getFile().exists());
    }

    @Test
    public void testThresholdZero() throws IOException {
        // With threshold 0, everything should go to file immediately
        ContentOutputStream cos = new ContentOutputStream(0, Curl.tmpDir);
        cos.write(new byte[] { 1 });
        assertFalse(cos.done);
        assertFalse(cos.isInMemory());
        File file = cos.getFile();

      // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once)
      added += q.drainTo(buffer, numElements - added);
      if (added < numElements) { // not enough elements immediately available; will have to poll
        E e = q.poll(deadline - System.nanoTime(), NANOSECONDS);
        if (e == null) {
          break; // we already waited enough, and there are no more elements in sight
        }

    RateLimiter limiter = RateLimiter.create(5.0, stopwatch);
    limiter.acquire(); // R0.00
    stopwatch.sleepMillis(200); // U0.20, we are ready for the next request...
    limiter.acquire(); // R0.00, ...which is granted immediately
    limiter.acquire(); // R0.20
    assertEvents("R0.00", "U0.20", "R0.00", "R0.20");
  }

  public void testSimpleAcquireReturnValues() {
    RateLimiter limiter = RateLimiter.create(5.0, stopwatch);

    RateLimiter limiter = RateLimiter.create(5.0, stopwatch);
    limiter.acquire(); // R0.00
    stopwatch.sleepMillis(200); // U0.20, we are ready for the next request...
    limiter.acquire(); // R0.00, ...which is granted immediately
    limiter.acquire(); // R0.20
    assertEvents("R0.00", "U0.20", "R0.00", "R0.20");
  }

  public void testSimpleAcquireReturnValues() {
    RateLimiter limiter = RateLimiter.create(5.0, stopwatch);

            // If this CAS succeeds, we know that the provided callable will never be invoked,
            // so when oldFuture completes it is safe to allow the next submitted task to
            // proceed. Doing this immediately here lets the next task run without waiting for
            // the cancelled task's executor to run the noop AsyncCallable.
            //
            // ---
            //

import jcifs.SmbResource;

/**
 * Tests for {@link DirFileEntryAdapterIterator}.
 *
 * This test class verifies the basic functionality of DirFileEntryAdapterIterator.
 * Due to the iterator's constructor calling advance() immediately, which requires
 * the adapt() method to be functional, we test the behavior using simple mock
 * scenarios that don't require complex filter setups.
 */
@ExtendWith(MockitoExtension.class)

export MC_HOST_mytier="http://minioadmin:minioadmin@localhost:9002/"

./mc ready myminio

./mc mb -l myminio/bucket2
./mc mb -l mytier/tiered

## create a tier and set up ilm policy to tier immediately
./mc admin tier add minio myminio TIER1 --endpoint http://localhost:9002 --access-key minioadmin --secret-key minioadmin --bucket tiered --prefix prefix5/

Since HTTP requests frequently happen in parallel, connection pooling must be thread-safe.

  // Views

  /**
   * Returns the set of distinct elements contained in this multiset. The element set is backed by
   * the same data as the multiset, so any change to either is immediately reflected in the other.
   * The order of the elements in the element set is unspecified.
   *
   * <p>If the element set supports any removal operations, these necessarily cause <b>all</b>