return fmt.Sprintf("ReplicationLastMinute sz= %d, n=%d , dur=%d", t.Size, t.N, t.Total)
}

func (rl *ReplicationLastMinute) getTotal() AccElem {
	return rl.LastMinute.getTotal()
}

// ReplicationLastHour keeps track of replication counts over the last hour
type ReplicationLastHour struct {
	Totals  [60]AccElem
	LastMin int64
}

// Merge data of two ReplicationLastHour structure

Interceptors can be chained. Suppose you have both a compressing interceptor and a checksumming interceptor: you'll need to decide whether data is compressed and then checksummed, or checksummed and then compressed. OkHttp uses lists to track interceptors, and interceptors are called in order.

![Interceptors Diagram](../assets/images/******@****.***)

### Application Interceptors

        return user;
    }

    // Test implementation of AuthenticationChain for testing
    private static class TestAuthenticationChain implements AuthenticationChain {
        // Track method calls
        List<User> updateCalls = new ArrayList<>();
        List<User> deleteCalls = new ArrayList<>();
        List<Map.Entry<String, String>> changePasswordCalls = new ArrayList<>();

        assertFalse(exception.isAuthenticationError());
        assertFalse(exception.isFileSystemError());
        assertTrue(exception.isTransientError());
    }

    @Test
    @DisplayName("Should track elapsed time")
    void testElapsedTime() throws InterruptedException {
        // Given
        exception = new SmbOperationException(SmbOperationException.ErrorCode.BUSY, "Server busy");

        // When

 * because the TLS ecosystem is dynamic and staying up to date is necessary to stay secure. See
 * [OkHttp's TLS Configuration History][tls_history] to track these changes.
 *
 * [tls_history]: https://square.github.io/okhttp/tls_configuration_history/
 */
class ConnectionSpec internal constructor(
  @get:JvmName("isTls") val isTls: Boolean,

  @VisibleForTesting transient @Nullable Object @Nullable [] values;

  /**
   * Keeps track of metadata like the number of hash table bits and modifications of this data
   * structure (to make it possible to throw ConcurrentModificationException in the iterator). Note
   * that we choose not to make this volatile, so we do less of a "best effort" to track such
   * errors, for better performance.
   *

        when(fe2.getFileIndex()).thenReturn(2);

        FileEntry fe3 = mock(FileEntry.class);
        lenient().when(fe3.getName()).thenReturn("file3");
        when(fe3.getFileIndex()).thenReturn(3);

        // Track query count to handle multiple queries properly
        final int[] queryCount = { 0 };

        // Mock send(create) to wire a query response with fe1, fe2
        doAnswer(inv -> {

                }
            }

            SmbCircuitBreaker.CircuitBreakerMetrics metrics = cbWithWindow.getMetrics();
            assertEquals(10, metrics.totalRequests(), "Should track all requests");
            assertTrue(metrics.totalFailures() > 0, "Should have some failures");
            assertTrue(metrics.totalSuccesses() > 0, "Should have some successes");

		// check if erasure distribution order matches the index
		// position if this is not correct we discard the disk
		// and move to collect others
		if distribution[i] != meta.Erasure.Index {
			inconsistent++ // keep track of inconsistent entries
			continue
		}
		shuffledDisks[meta.Erasure.Index-1] = disks[i]
		shuffledPartsMetadata[meta.Erasure.Index-1] = metaArr[i]
	}

	// Inconsistent meta info is with in the limit of

      private val out: Buffer,
    ) {
      /**
       * In the scenario where the dynamic table size changes multiple times between transmission of
       * header blocks, we need to keep track of the smallest value in that interval.
       */
      private var smallestHeaderTableSizeSetting = Integer.MAX_VALUE
      private var emitDynamicTableSizeUpdate: Boolean = false