* cache instances created by {@code CacheBuilder} will not perform any type of eviction.
 *
 * <p>Usage example:
 *
 * {@snippet :
 * LoadingCache<Key, Graph> graphs = CacheBuilder.newBuilder()
 *     .maximumSize(10000)
 *     .expireAfterWrite(Duration.ofMinutes(10))
 *     .removalListener(MY_LISTENER)
 *     .build(
 *         new CacheLoader<Key, Graph>() {
 *           public Graph load(Key key) throws AnyException {

        this.group = group;
        this.endpoint = group.createEndpoint();
    }
    
    @Override
    public void connect() throws IOException {
        try {
            endpoint.connect(remoteAddress, 1000);  // 1 second timeout
            state = RdmaConnectionState.CONNECTED;
        } catch (Exception e) {
            throw new IOException("RDMA connection failed", e);
        }
    }
    
    @Override

            buffer = new DfsReferralRequestBuffer(path, 3);

            byte[] dst = new byte[buffer.size()];

            // Perform many rapid encodes
            for (int i = 0; i < 10000; i++) {
                int bytesEncoded = buffer.encode(dst, 0);
                assertEquals(buffer.size(), bytesEncoded);
            }
        }

        @Test

    }

    /** Interval for checking user information in milliseconds (default: 10 minutes). */
    protected long userCheckInterval = 10 * 60 * 1000L; // 10 min

    /** Maximum size of the user information cache. */
    protected int userInfoCacheSize = 10000;

    /** Queue for storing search logs. */
    protected Queue<SearchLog> searchLogQueue = new ConcurrentLinkedQueue<>();

    /** Queue for storing click logs. */

            do {
                if (dc_list_expiration < now) {
                    final NbtAddress[] list = NbtAddress.getAllByName(DOMAIN, 0x1C, null, null);
                    dc_list_expiration = now + CACHE_POLICY * 1000L;
                    if (list != null && list.length > 0) {
                        dc_list = list;
                    } else { /* keep using the old list */

  }

  public void testByteArrayRoundTrips() {
    Random r = new Random(5);
    byte[] b = new byte[Ints.BYTES];

    // total overkill, but, it takes 0.1 sec so why not...
    for (int i = 0; i < 10000; i++) {
      int num = r.nextInt();
      assertThat(Ints.fromByteArray(Ints.toByteArray(num))).isEqualTo(num);

      r.nextBytes(b);
      assertThat(Ints.toByteArray(Ints.fromByteArray(b))).isEqualTo(b);
    }

        auth1.setAuthenticationTTL(1000);
        assertFalse(auth1.isExpired());

        // Test with char[] password constructor
        NtlmPasswordAuthenticator auth2 = new NtlmPasswordAuthenticator("user", "CharPass123!".toCharArray());
        auth2.setAuthenticationTTL(1000);
        assertFalse(auth2.isExpired());

        // Test with domain constructor

		lrgworkers:      make([]chan ReplicationWorkerOperation, 0, maxLWorkers),
		mrfReplicaCh:    make(chan ReplicationWorkerOperation, 100000),
		mrfWorkerKillCh: make(chan struct{}, failedWorkers),
		resyncer:        newresyncer(),
		mrfSaveCh:       make(chan MRFReplicateEntry, 100000),
		mrfStopCh:       make(chan struct{}, 1),
		ctx:             ctx,
		objLayer:        o,
		stats:           stats,

  /**
   * How long to wait when determining that a thread is blocked if we DON'T expect it to be blocked.
   */
  private static final long UNEXPECTED_HANG_DELAY_MILLIS = 10000;

  /**
   * Various scenarios to be generated for each method under test. The actual scenario generation
   * (determining which scenarios are applicable to which methods and what the outcome should be)

    // Defer correctness tests to Long.isPrime

    // Check the first 100,000 integers
    for (int i = 0; i < 100000; i++) {
      assertEquals(LongMath.isPrime(i), IntMath.isPrime(i));
    }

    // Then check 1000 deterministic pseudo-random int values.
    Random rand = new Random(1);
    for (int i = 0; i < 1000; i++) {
      int n = rand.nextInt(Integer.MAX_VALUE);
      assertEquals(LongMath.isPrime(n), IntMath.isPrime(n));