type MonitoredReader struct {
	r        io.Reader
	throttle *bucketThrottle
	ctx      context.Context // request context
	lastErr  error           // last error reported, if this non-nil all reads will fail.
	m        *Monitor
	opts     *MonitorReaderOptions
}

// BucketOptions represents the bucket and optionally its replication target pair.
type BucketOptions struct {

        assertEquals(engine2, scriptEngineFactory.getScriptEngine("engine2"));
        assertEquals(customEngine, scriptEngineFactory.getScriptEngine("custom"));

        // Verify class name access - last added engine of same class wins
        assertEquals(engine2, scriptEngineFactory.getScriptEngine("testscriptengine"));
        assertEquals(customEngine, scriptEngineFactory.getScriptEngine("customscriptengine"));
    }

   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] successor;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
  private transient int firstEntry;

  /** Pointer to the last node in the linked list, or {@code ENDPOINT} if there are no entries. */

  public void testExceptionThrown_whileClosingLastCloseable() throws IOException {
    Closer closer = new Closer(suppressor);

    IOException exception = new IOException();

    // c1 is added first, closed last
    TestCloseable c1 = closer.register(TestCloseable.throwsOnClose(exception));
    TestCloseable c2 = closer.register(TestCloseable.normal());

    try {
      closer.close();
    } catch (Throwable caught) {

        toRemove = mapEntry;
        return mapEntry.getKey();
      }

      @Override
      public void remove() {
        checkState(toRemove != null, "no calls to next() since the last call to remove()");
        size -= toRemove.getValue().getAndSet(0);
        backingEntries.remove();
        toRemove = null;
      }
    };
  }

  @Override
  Iterator<Entry<E>> entryIterator() {

   * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
   */
  private transient int @Nullable [] successor;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
  private transient int firstEntry;

  /** Pointer to the last node in the linked list, or {@code ENDPOINT} if there are no entries. */

         */
        public void setBreaking(boolean breaking) {
            this.breaking = breaking;
        }

        /**
         * Gets the timestamp of the last lease access
         * @return last access time in milliseconds
         */
        public long getLastAccessTime() {
            return lastAccessTime;
        }
    }

    /**
     * Request a lease for a file path

            }
            updateCompatibilityDoc(
                compatibilityDocFile,
                "Gradle is tested with Kotlin",
                latestKotlinVersions.first(),
                latestKotlinVersions.last()
            )
        }

    private
    fun fetchLatestKotlinVersions() =
        fetchAndSelectKotlinVersions(
            minimumSupported.get(),

)

// bucketMeasurement captures the bandwidth details for one bucket
type bucketMeasurement struct {
	lock                 sync.Mutex
	bytesSinceLastWindow uint64    // Total bytes since last window was processed
	startTime            time.Time // Start time for window
	expMovingAvg         float64   // Previously calculate sliding window
}

  }

  public void testLast() {
    assertEquals(3, ContiguousSet.create(Range.closed(1, 3), integers()).last().intValue());
    assertEquals(3, ContiguousSet.create(Range.open(0, 4), integers()).last().intValue());
    assertEquals(
        Integer.MAX_VALUE,
        ContiguousSet.create(Range.<Integer>all(), integers()).last().intValue());
  }

  public void testContains() {