CacheBuilder.newBuilder()
            .removalListener(removalListener)
            .expireAfterWrite(10, MILLISECONDS)
            .ticker(ticker)
            .build(loader);

    // Increment 100 times
    for (int i = 0; i < 100; ++i) {
      cache.getUnchecked(10).incrementAndGet();
      ticker.advance(1, MILLISECONDS);
    }

    assertEquals(evictionCount.get() + 1, applyCount.get());

         */
        public synchronized void updateState(int newState) {
            this.leaseState = newState;
            this.lastAccessTime = System.currentTimeMillis();
        }

        /**
         * Increment the epoch value
         */
        public synchronized void incrementEpoch() {
            this.epoch++;
        }

        /**
         * Check if lease has read caching
         *

        int counter1 = buffer1.getInt();
        int counter2 = buffer2.getInt();

        assertEquals(counter1 + 1, counter2, "Counter should increment between nonces");
    }

    @Test
    @DisplayName("Should generate secure random nonces when requested")
    void testSecureNonceGeneration() {
        // Given

	}
	return l.root.prev
}

// lazyInit lazily initializes a zero List Value.
func (l *LruList[K, V]) lazyInit() {
	if l.root.next == nil {
		l.Init()
	}
}

// insert inserts e after at, increments l.len, and returns e.
func (l *LruList[K, V]) insert(e, at *Entry[K, V]) *Entry[K, V] {
	e.prev = at
	e.next = at.next
	e.prev.next = e
	e.next.prev = e
	e.list = l
	l.len++
	return e
}

        if (sessionKey == null) {
            throw new GeneralSecurityException("Session key not available for automatic rotation");
        }

        // Increment rotation counter for tracking and key derivation
        rotationCount++;

        // SMB3-compliant key rotation: Use rotation counter as per SMB3 specification

*[SeedSize]byte) { // CTR_DRBG_Update, per Section 10.2.1.2. temp := make([]byte, SeedSize) c.c.XORKeyStream(temp, seed[:]) K := temp[:keySize] V := temp[keySize:] // Again, we pre-increment V, like in NewCounter. increment((*[aes.BlockSize]byte)(V)) cipher, err := aes.New(K) if err != nil { panic(err) } c.c = *aes.NewCTR(cipher, V) } func increment(v *[aes.BlockSize]byte) { hi := byteorder.BEUint64(v[:8]) lo := byteorder.BEUint64(v[8:]) lo, c := bits.Add64(lo, 1, 0) hi, _ = bits.Add64(hi, 0, c) byteorder.BEPutUint64(v[:8],...

   *
   * <p>This method refines {@link Collection#add}, which only <i>ensures</i> the presence of the
   * element, to further specify that a successful call must always increment the count of the
   * element, and the overall size of the collection, by one.
   *
   * <p>To both add the element and obtain the previous count of that element, use {@link

   * both IPv4 and IPv6 addresses.
   *
   * @param address the InetAddress to increment
   * @return a new InetAddress that is one more than the passed in address
   * @throws IllegalArgumentException if InetAddress is at the end of its range
   * @since 10.0
   */
  public static InetAddress increment(InetAddress address) {
    byte[] addr = address.getAddress();
    int i = addr.length - 1;

   *
   * <p>This method refines {@link Collection#add}, which only <i>ensures</i> the presence of the
   * element, to further specify that a successful call must always increment the count of the
   * element, and the overall size of the collection, by one.
   *
   * <p>To both add the element and obtain the previous count of that element, use {@link

    // clear absent
    assertFalse(segment.clearValueForTesting(key, hash, valueRef));

    segment.setTableEntryForTesting(0, entry);
    // don't increment count; this is used during computation
    assertTrue(segment.clearValueForTesting(key, hash, valueRef));
    // no notification sent with clearValue
    assertEquals(0, segment.count);
    assertNull(table.get(0));