|| !(uncontended = a.cas(v = a.value, v + x))) retryUpdate(x, hc, uncontended);
    }
  }

  /** Equivalent to {@code add(1)}. */
  @Override
  public void increment() {
    add(1L);
  }

  /** Equivalent to {@code add(-1)}. */
  public void decrement() {
    add(-1L);
  }

  /**
   * Returns the current sum. The returned value is NOT an atomic snapshot; invocation in

         */
        public int increment() {
            return count.incrementAndGet();
        }

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

    abstract void compareAndSetSeenExceptions(
        AggregateFutureState<?> state, @Nullable Set<Throwable> expect, Set<Throwable> update);

    /** Performs an atomic decrement-and-get of {@link AggregateFutureState#remainingField}. */
    abstract int decrementAndGetRemainingCount(AggregateFutureState<?> state);

    abstract String atomicHelperTypeForTest();
  }

        // Test increment
        assertEquals(1L, crawlerContext.incrementAndGetAccessCount());
        assertEquals(1L, crawlerContext.getAccessCount());

        assertEquals(2L, crawlerContext.incrementAndGetAccessCount());
        assertEquals(2L, crawlerContext.getAccessCount());

        // Test decrement
        assertEquals(1L, crawlerContext.decrementAndGetAccessCount());

        @Test
        @DisplayName("acquire should increment usage count")
        void shouldIncrementUsageCount() {
            long initial = transport.getUsageCount();
            transport.acquire();
            assertEquals(initial + 1, transport.getUsageCount());
        }

        @Test
        @DisplayName("release should decrement usage count")
        void shouldDecrementUsageCount() {

  private strictfp double trueLog2(double d) {
    double trueLog2 = StrictMath.log(d) / StrictMath.log(2);
    // increment until it's >= the true value
    while (StrictMath.pow(2.0, trueLog2) < d) {
      trueLog2 = StrictMath.nextUp(trueLog2);
    }
    // decrement until it's <= the true value
    while (StrictMath.pow(2.0, trueLog2) > d) {
      trueLog2 = StrictMath.nextAfter(trueLog2, Double.NEGATIVE_INFINITY);

            // Arrange
            byte[] ident = new byte[] { 0, 0, 0, 0, 0, 5 };
            rpc.sid_t st = buildSidT((byte) 1, ident, 10, 20, 30);

            // Act: type USER, decrement true
            SID sid = new SID(st, jcifs.SID.SID_TYPE_USER, "DOM", "alice", true);

            // Assert: last element dropped
            assertEquals("S-1-5-10-20", sid.toString());

     * @param sid the RPC sid_t structure
     * @param type the SID type
     * @param domainName the domain name for this SID
     * @param acctName the account name for this SID
     * @param decrementAuthority whether to decrement the authority count
     */
    public SID(final rpc.sid_t sid, final int type, final String domainName, final String acctName, final boolean decrementAuthority) {
        this.revision = sid.revision;

     * @param sid the RPC sid_t structure
     * @param type the SID type
     * @param domainName the domain name for this SID
     * @param acctName the account name for this SID
     * @param decrementAuthority whether to decrement the authority count
     */
    public SID(final rpc.sid_t sid, final int type, final String domainName, final String acctName, final boolean decrementAuthority) {
        this.revision = sid.revision;

    /**
     * Removes an entry from within a table. All entries following the removed node can stay, but
     * all preceding ones need to be cloned.
     *
     * <p>This method does not decrement count for the removed entry, but does decrement count for
     * all partially collected entries which are skipped. As such callers which are modifying count
     * must re-read it after calling removeFromChain.
     *