accessQueue = map.usesAccessQueue() ? new AccessQueue<>() : LocalCache.discardingQueue();
    }

    AtomicReferenceArray<ReferenceEntry<K, V>> newEntryArray(int size) {
      return new AtomicReferenceArray<>(size);
    }

    void initTable(AtomicReferenceArray<ReferenceEntry<K, V>> newTable) {
      this.threshold = newTable.length() * 3 / 4; // 0.75

      accessQueue = map.usesAccessQueue() ? new AccessQueue<>() : LocalCache.discardingQueue();
    }

    AtomicReferenceArray<ReferenceEntry<K, V>> newEntryArray(int size) {
      return new AtomicReferenceArray<>(size);
    }

    void initTable(AtomicReferenceArray<ReferenceEntry<K, V>> newTable) {
      this.threshold = newTable.length() * 3 / 4; // 0.75

   * AtomicReferenceArray of size 2^k. To map a user key into a stripe, we take a k-bit slice of the
   * user key's (smeared) hashCode(). The stripes are lazily initialized and are weakly referenced.
   */
  @VisibleForTesting
  static final class SmallLazyStriped<L> extends PowerOfTwoStriped<L> {
    final AtomicReferenceArray<@Nullable ArrayReference<? extends L>> locks;

  private static <K> List<Object> doConcurrentGet(
      LoadingCache<K, ?> cache, K key, int nThreads, CountDownLatch gettersStartedSignal)
      throws InterruptedException {

    AtomicReferenceArray<Object> result = new AtomicReferenceArray<>(nThreads);
    CountDownLatch gettersComplete = new CountDownLatch(nThreads);
    for (int i = 0; i < nThreads; i++) {
      int index = i;
      Thread thread =
          new Thread(

  private static <K> List<Object> doConcurrentGet(
      LoadingCache<K, ?> cache, K key, int nThreads, CountDownLatch gettersStartedSignal)
      throws InterruptedException {

    AtomicReferenceArray<Object> result = new AtomicReferenceArray<>(nThreads);
    CountDownLatch gettersComplete = new CountDownLatch(nThreads);
    for (int i = 0; i < nThreads; i++) {
      int index = i;
      Thread thread =
          new Thread(