}

        CacheEntry<DfsReferralDataInternal> refs = this.referrals;
        synchronized (this.referralsLock) {
            if (refs == null || System.currentTimeMillis() + 10000 > refs.expiration) {
                refs = new CacheEntry<>(tc.getConfig().getDfsTtl());
            }
            this.referrals = refs;
        }
        refs.map.put(key, dri);
    }

            tc.getConfig().getRandom().nextBytes(ntlmClientChallenge);

            long ts = (System.currentTimeMillis() + SmbConstants.MILLISECONDS_BETWEEN_1970_AND_1601) * 10000;
            if (haveTimestamp) {
                ts = ((AvTimestamp) AvPairs.get(avPairs, AvPair.MsvAvTimestamp)).getTimestamp();
            }

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

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

      r.nextBytes(b);

    }

    public void test_calculatePageInfo_largePageRange() {
        // Test when we have more than 11 pages (pageRangeSize * 2 + 1)
        QueryResponseList qrList = new QueryResponseList(null, 50, 10, 0) {
            @Override
            public int size() {
                return 10;
            }
        };
        qrList.allRecordCount = 300; // 30 pages, current page 6

  }

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

    assertThat(Lists.<Object>cartesianProduct(x, y))
        .containsExactly(exp1, exp2, exp3, exp4)
        .inOrder();
  }

  public void testCartesianProductTooBig() {
    List<String> list = nCopies(10000, "foo");
    assertThrows(
        IllegalArgumentException.class, () -> cartesianProduct(list, list, list, list, list));
  }

  public void testTransformHashCodeRandomAccess() {

    assertThat(parse("http://:password@@host/path").encodedPassword)
      .isEqualTo("password%40")
  }

  @Test
  fun unprintableCharactersArePercentEncoded() {
    assertThat(parse("http://host/\u0000").encodedPath).isEqualTo("/%00")
    assertThat(parse("http://host/\u0008").encodedPath).isEqualTo("/%08")
    assertThat(parse("http://host/\ufffd").encodedPath).isEqualTo("/%EF%BF%BD")
  }

  @Test

    }

    @Test
    @DisplayName("Should generate multiple unique nonces without collision")
    void testGenerateMultipleNoncesNoCollision() {
        // Given
        int count = 10000; // Test with larger number for collision detection
        Set<String> nonceSet = new HashSet<>();

        // When
        for (int i = 0; i < count; i++) {
            byte[] nonce = encryptionContext.generateNonce();

        void testVerifyOffsetLengthExceedsBuffer() {
            byte[] data = new byte[100];
            boolean result = digest.verify(data, 50, 60, 0, response);
            assertFalse(result, "Should return false when offset+length > buffer size");
        }

        @Test

      builder.add(i);
    }
    for (int j = 0; j < 1000; j++) {
      builder.add(9);
    }
    ImmutableSortedSet<Integer> unused = builder.build();
    assertThat(compares[0]).isAtMost(10000);
    // hopefully something quadratic would have more digits
  }