}
    }

    // subsequent calls should call the loader again, not get the old exception
    assertThrows(UncheckedExecutionException.class, () -> cache.getUnchecked("bar"));
    assertThat(callCount.get()).isEqualTo(2);
  }

  /**
   * Test-helper method that performs {@code nThreads} concurrent calls to {@code cache.get(key)} or

        o -> orElseNull(o), Comparator.nullsLast(valueComparator));
  }

  @IgnoreJRERequirement // helper for emptiesFirst+emptiesLast
  /*
   * If we make these calls inline inside the lambda inside emptiesFirst()/emptiesLast(), we get an
   * Animal Sniffer error, despite the @IgnoreJRERequirement annotation there. For details, see
   * ImmutableSortedMultiset.
   */

 * instance retrieved from the map's {@linkplain Map#entrySet entry set} is a snapshot of that
 * entry's state at the time of retrieval; such entries do, however, support {@link
 * Map.Entry#setValue}, which simply calls {@link Map#put} on the entry's key.
 *
 * <p>The maps produced by {@code MapMaker} are serializable, and the deserialized maps retain all

        int n;
        final NameQueryRequest request = new NameQueryRequest(name);
        final NameQueryResponse response = new NameQueryResponse();

        if (addr != null) { /* UniAddress calls always use this
                             * because it specifies addr
                             */
            request.addr = addr; /* if addr ends with 255 flag it bcast */

        @BeforeEach
        void setup() {
            lenient().when(mockCtx.getSIDResolver()).thenReturn(mockResolver);
        }

        @Test
        @DisplayName("Manual resolve calls resolver with this SID")
        void testResolveManual() throws Exception {
            // Arrange
            SID sid = new SID("S-1-5-21-1");

            // Act
            sid.resolve("server.example", mockCtx);

	r.qCache.bucketStats[bucket] = v

	atomic.AddInt64(&r.qCache.srQueueStats.nowBytes, -1*sz)
	atomic.AddInt64(&r.qCache.srQueueStats.nowCount, -1)
}

// incProxy increments proxy metrics for proxied calls
func (r *ReplicationStats) incProxy(bucket string, api replProxyAPI, isErr bool) {
	if r != nil {
		r.pCache.inc(bucket, api, isErr)
	}
}

func (r *ReplicationStats) getProxyStats(bucket string) ProxyMetric {

// the function finishes executing, Run returns context.DeadlineExceeded to the caller.
// channel so that the work function can attempt to exit gracefully.
// Multiple calls to Run will run independently of each other.
func (d *DeadlineWorker) Run(work func() error) error {
	_, err := WithDeadline[struct{}](context.Background(), d.timeout, func(ctx context.Context) (struct{}, error) {

    }
    return Iterators.contains(iterable.iterator(), element);
  }

  /**
   * Removes, from an iterable, every element that belongs to the provided collection.
   *
   * <p>This method calls {@link Collection#removeAll} if {@code iterable} is a collection, and
   * {@link Iterators#removeAll} otherwise.
   *
   * @param removeFrom the iterable to (potentially) remove elements from

 * tailored to that use case.
 *
 * <p>This uses the same efficient implementation as {@link Ordering#leastOf(Iterable, int)},
 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log

    // This test is the same as testScale_indexes_varargs_compute_doubleCollection except that the
    // array of indexes to be calculated is modified between the calls to indexes and compute: since
    // the contract is that it is snapshotted, this shouldn't make any difference to the result.
    int[] indexes = {0, 10, 5, 1, 8, 10};