}

    /**
     * Test LRU behavior of robotsTxtUrlSet
     */
    public void test_robotsTxtUrlSet_lru() {
        Set<String> urlSet = crawlerContext.getRobotsTxtUrlSet();

        // Add URLs up to capacity (10000)
        for (int i = 0; i < 10000; i++) {
            urlSet.add("http://example" + i + ".com/robots.txt");
        }
        assertEquals(10000, urlSet.size());

            makeSMBKey(key, key8);
            setKey(key8);
        } else {
            setKey(key);
        }
    }

    /**
     * Converts a 7-byte SMB key to an 8-byte DES key with parity bits
     * @param key7 the 7-byte SMB key
     * @param key8 the output 8-byte DES key
     */
    public static void makeSMBKey(final byte[] key7, final byte[] key8) {

        int i;

func (c *LRU[K, V]) removeFromBucket(e *Entry[K, V]) {
	delete(c.buckets[e.ExpireBucket].entries, e.Key)
}

// Cap returns the capacity of the cache
func (c *LRU[K, V]) Cap() int {
	return c.size
}

// Entry is an LRU Entry
type Entry[K comparable, V any] struct {
	// Next and previous pointers in the doubly-linked list of elements.

<p class="rule">
The <i>k</i>th receive from a channel with capacity <i>C</i> is synchronized before the completion of the <i>k</i>+<i>C</i>th send on that channel.
</p>

<p>
This rule generalizes the previous rule to buffered channels.
It allows a counting semaphore to be modeled by a buffered channel:
the number of items in the channel corresponds to the number of active uses,

    LocalCache<?, ?> map = CacheTesting.toLocalCache(cache);
    assertThat(map.segments).hasLength(4); // concurrency level
    assertEquals(4, map.segments[0].table.length()); // capacity / conc level
  }

  @GwtIncompatible // CountDownLatch
  static final class DelayingIdentityLoader<T> extends CacheLoader<T, T> {
    private final AtomicBoolean shouldWait;

    LocalCache<?, ?> map = CacheTesting.toLocalCache(cache);
    assertThat(map.segments).hasLength(4); // concurrency level
    assertEquals(4, map.segments[0].table.length()); // capacity / conc level
  }

  @GwtIncompatible // CountDownLatch
  static final class DelayingIdentityLoader<T> extends CacheLoader<T, T> {
    private final AtomicBoolean shouldWait;

### Storage Capacity Tracking

      checkNonnegative(initialCapacity, "initialCapacity");
      this.contents = new @Nullable Object[initialCapacity];
      this.size = 0;
    }

    /*
     * Expand the absolute capacity of the builder so it can accept at least the specified number of
     * elements without being resized. Also, if we've already built a collection backed by the
     * current array, create a new array.
     */

        } else {
            sb.setLength(0); // Reset length
        }
        return sb;
    }

    private void returnStringBuilder(StringBuilder sb) {
        if (sb != null && sb.capacity() < 2048) { // Avoid keeping very large builders
            stringBuilderPool.offer(sb);
        }
    }

    private Map<String, Object> getContextMap() {
        HashMap<String, Object> map = mapPool.poll();

            .addEqualityGroup(hashFunction2)
            .testEquals();

        assertEquals(hashFunction1a.toString(), hashFunction1b.toString());
      }
    }
  }

  // Parity tests taken from //util/hash/hash_unittest.cc