assertEquals(1, statsObject.count.get());

        assertEquals(2, statsObject.increment());
        assertEquals(2, statsObject.count.get());

        assertEquals(1, statsObject.decrement());
        assertEquals(1, statsObject.count.get());

        assertEquals(0, statsObject.decrement());
        assertEquals(0, statsObject.count.get());
    }

          || !(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());

    val relay = edit(file, upstream, metadata, 1024)
    val source1 = relay.newSource()
    val source2 = relay.newSource()
    source1!!.close()
    source1.close() // Unnecessary. Shouldn't decrement the reference count.
    assertThat(relay.isClosed).isFalse()
    source2!!.close()
    assertThat(relay.isClosed).isTrue()
    assertFile(Relay.PREFIX_DIRTY, -1L, -1, null, null)
  }

  @Test

        @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() {

 *   for successful and unsuccessful computations, respectively.
 * </p>
 *
 * <p>
 *   The Deferred class uses a CountDownLatch to allow you to wait for the computation to complete.
 *   The resolve and reject methods decrement the CountDownLatch, allowing the getResponse method
 *   to return the result of the computation.
 * </p>
 *
 * @param <RESPONSE> The type of the response.
 */
public class Deferred<RESPONSE extends Response> {

  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());