private static long negativeToMaxValue(long value) {
      return (value >= 0) ? value : Long.MAX_VALUE;
    }

    /** Increments all counters by the values in {@code other}. */
    public void incrementBy(StatsCounter other) {
      CacheStats otherStats = other.snapshot();
      hitCount.add(otherStats.hitCount());
      missCount.add(otherStats.missCount());

   * exception is thrown, this exception is used as the result of the output {@code Future}.
   *
   * <p>Usage example:
   *
   * {@snippet :
   * // Falling back to a zero counter in case an exception happens when processing the RPC to fetch
   * // counters.
   * ListenableFuture<Integer> faultTolerantFuture =
   *     fetchCounters().catching(FetchException.class, x -> 0, directExecutor());
   * }
   *

    private static long negativeToMaxValue(long value) {
      return (value >= 0) ? value : Long.MAX_VALUE;
    }

    /** Increments all counters by the values in {@code other}. */
    public void incrementBy(StatsCounter other) {
      CacheStats otherStats = other.snapshot();
      hitCount.add(otherStats.hitCount());
      missCount.add(otherStats.missCount());

// Update replication upload latency with a new value
func (rl *ReplicationLatency) update(size int64, duration time.Duration) {
	rl.UploadHistogram.Add(size, duration)
}

// ReplicationLastMinute has last minute replication counters
type ReplicationLastMinute struct {
	LastMinute lastMinuteLatency
}

func (rl ReplicationLastMinute) merge(other ReplicationLastMinute) (nl ReplicationLastMinute) {

        stats.recordRdmaSend(512, 500000); // 512B in 0.5ms
        stats.recordRdmaReceive(1536, 1500000); // 1.5KB in 1.5ms
        stats.recordError();

        // Verify counters
        assertEquals(1, stats.getRdmaReads(), "Should have 1 read operation");
        assertEquals(1, stats.getRdmaWrites(), "Should have 1 write operation");

        long now = System.currentTimeMillis();
        lastFailureTimes.entrySet().removeIf(entry -> now - entry.getValue() > FAILURE_RECOVERY_TIME * 2);

        // Clean up old consecutive failure counters
        consecutiveFailures.entrySet().removeIf(entry -> {
            String key = entry.getKey();
            Long lastFailure = lastFailureTimes.get(key);

           * modified concurrently), or it might have been only an estimate to begin with (for a
           * collection like ConcurrentHashMap, which sums up several counters that may not be in
           * sync with one another). We accommodate that by resizing as necessary.
           */
          toJoin = Arrays.copyOf(toJoin, expandedCapacity(toJoin.length, toJoin.length + 1));
        }

                openStateStartTime.set(0);
            }

            if (newState == State.OPEN) {
                openStateStartTime.set(System.currentTimeMillis());
            }

            // Reset counters based on transition
            switch (newState) {
            case CLOSED:
                failureCount.set(0);
                successCount.set(0);
                halfOpenAttempts.set(0);
                break;

    private CrawlerPooledObjectFactory<TestComponent> factory;
    private StandardCrawlerContainer container;

    @Override
    protected void setUp() throws Exception {
        super.setUp();

        // Reset counters before each test
        TestComponent.resetCounter();
        SingletonTestComponent.resetInstanceCount();
        CloseableTestComponent.resetCounters();

        // Initialize container with test components

   * Future}.
   *
   * <p>Usage example:
   *
   * {@snippet :
   * ListenableFuture<Integer> fetchCounterFuture = ...;
   *
   * // Falling back to a zero counter in case an exception happens when
   * // processing the RPC to fetch counters.
   * ListenableFuture<Integer> faultTolerantFuture = Futures.catching(
   *     fetchCounterFuture, FetchException.class, x -> 0, directExecutor());
   * }
   *