counters.add(listener);
        assertEquals(expected.count(listener), counters.count(listener));
      }

      @Override
      public String toString() {
        return "incrementing";
      }
    };
  }

  private static <T> ImmutableMultiset<T> multiset(T value, int count) {
    return multiset(ImmutableMap.of(value, count));
  }

        counters.add(listener);
        assertEquals(expected.count(listener), counters.count(listener));
      }

      @Override
      public String toString() {
        return "incrementing";
      }
    };
  }

  private static <T> ImmutableMultiset<T> multiset(T value, int count) {
    return multiset(ImmutableMap.of(value, count));
  }

         *
         * @return the new reference count after incrementing
         */
        public int increment() {
            return count.incrementAndGet();
        }

        /**
         * Decrements the reference count for this statistics object.
         *
         * @return the new reference count after decrementing
         */
        public int decrement() {

    }

    /**
     * Stores a crawling configuration in the session-based storage with a unique identifier.
     * The generated session count ID combines the session ID with an incrementing counter.
     *
     * @param sessionId the session identifier
     * @param crawlingConfig the crawling configuration to store

     */
    protected final Map<Long, Response> response_map = new ConcurrentHashMap<>(10);
    private final AtomicLong usageCount = new AtomicLong(1);

    /**
     * Acquires a reference to this transport, incrementing the usage count.
     *
     * @return session increased usage count
     */
    public Transport acquire() {
        final long usage = this.usageCount.incrementAndGet();
        if (log.isTraceEnabled()) {

            // SMB 3.1.1 GCM: 96-bit random/fixed + 32-bit counter for guaranteed uniqueness
            // Fill first 12 bytes with random data
            secureRandom.nextBytes(nonce);

            // Last 4 bytes: incrementing counter for guaranteed uniqueness
            final long counter = this.nonceCounter.incrementAndGet();
            final ByteBuffer buffer = ByteBuffer.wrap(nonce, 12, 4);

        assertEquals(16, nonce2.length, "GCM nonce should be 16 bytes");
        assertEquals(16, nonce3.length, "GCM nonce should be 16 bytes");

        // For GCM, last 4 bytes should contain incrementing counter
        ByteBuffer buffer1 = ByteBuffer.wrap(nonce1, 12, 4).order(java.nio.ByteOrder.LITTLE_ENDIAN);
        ByteBuffer buffer2 = ByteBuffer.wrap(nonce2, 12, 4).order(java.nio.ByteOrder.LITTLE_ENDIAN);

     * entry must be removed if it is a zombie.
     */
    internal var currentEditor: Editor? = null

    /**
     * Sources currently reading this entry before a write or delete can proceed. When decrementing
     * this to zero, the entry must be removed if it is a zombie.
     */
    internal var lockingSourceCount = 0

    /** The sequence number of the most recently committed edit to this entry. */

initial value // for a single encryption, or 4 or 8 // stitched encryptions implemented // with interleaving vciphers. // // The input value for each encryption // is generated by XORing the counter // from V30 with the first key in VS0 // and incrementing the counter. // // Single encryption in V15 #define GEN_VCIPHER_INPUT \ XXLOR VS0, VS0, V29 \ VXOR V30, V29, V15; \ VADDUWM V30, V31, V30 // 4 encryptions in V15 - V18 #define GEN_VCIPHER_4_INPUTS \ XXLOR VS0, VS0, V29; \ VXOR V30, V29, V15; \...

initial value // for a single encryption, or 4 or 8 // stitched encryptions implemented // with interleaving vciphers. // // The input value for each encryption // is generated by XORing the counter // from V30 with the first key in VS0 // and incrementing the counter. // // Single encryption in V15 #define GEN_VCIPHER_INPUT \ XXLOR VS0, VS0, V29 \ VXOR V30, V29, V15; \ VADDUWM V30, V31, V30 // 4 encryptions in V15 - V18 #define GEN_VCIPHER_4_INPUTS \ XXLOR VS0, VS0, V29; \ VXOR V30, V29, V15; \...