}

  /** https://github.com/google/guava/issues/1791 */
  public void testInfinity_bustyTimeElapsed() {
    RateLimiter limiter = RateLimiter.create(Double.POSITIVE_INFINITY, stopwatch);
    stopwatch.instant += 1000000;
    limiter.setRate(2.0);
    for (int i = 0; i < 5; i++) {
      limiter.acquire();
    }
    assertEvents(
        "R0.00", // First comes the saved-up burst, which defaults to a 1-second burst (2 requests).

        if (timeout < 0) {
            throw new IllegalArgumentException(fieldName + " cannot be negative: " + timeout);
        }
        if (timeout > 3600000L) { // Max 1 hour
            throw new IllegalArgumentException(fieldName + " exceeds maximum (1 hour): " + timeout);
        }
    }

    /**
     * Sanitizes a string for safe logging (removes control characters)

  @GwtIncompatible // Too slow in GWT (~3min fully optimized)
  public void testDivideRemainderEuclideanProperty() {
    // Use a seed so that the test is deterministic:
    Random r = new Random(0L);
    for (int i = 0; i < 1000000; i++) {
      int dividend = r.nextInt();
      int divisor = r.nextInt();
      // Test that the Euclidean property is preserved:
      assertThat(
              dividend

    public DirectoryLeaseContext(Smb2LeaseKey key, int leaseState, DirectoryCacheScope scope) {
        this.leaseKey = key;
        this.leaseState = leaseState;
        this.cacheScope = scope;
        this.maxCacheAge = 30000; // 30 seconds default
        this.notificationEnabled = true;
        this.notificationFilter = 0;
    }

    @Override
    public byte[] getName() {
        return CONTEXT_NAME_BYTES;
    }

    /**

        lenient().when(mockConfig.isUseWitness()).thenReturn(true);
        lenient().when(mockConfig.getWitnessHeartbeatTimeout()).thenReturn(120000L);
        lenient().when(mockConfig.getWitnessRegistrationTimeout()).thenReturn(300000L);
        lenient().when(mockConfig.getWitnessReconnectDelay()).thenReturn(1000L);
        lenient().when(mockConfig.isWitnessServiceDiscovery()).thenReturn(true);
    }

    @AfterEach
    void tearDown() {

			fields: fields{
				value: []byte("\t+1\t"),
			},
			want:   1,
			wantOK: true,
		},
		{
			name: "scientific",
			fields: fields{
				value: []byte("3e5"),
			},
			want:   300000,
			wantOK: true,
		},
		{
			// No support for prefixes
			name: "hex",
			fields: fields{
				value: []byte("0xff"),
			},
			want:   0,
			wantOK: false,
		},
	}

    <OutputSerialization>
        <JSON>
        </JSON>
    </OutputSerialization>
    <RequestProgress>
        <Enabled>FALSE</Enabled>
    </RequestProgress>
	<ScanRange><Start>2600000</Start><End>2600001</End></ScanRange>
</SelectObjectContentRequest>`),
		},
	}

	for _, testCase := range testTable {
		t.Run(testCase.name, func(t *testing.T) {
			testReq := testCase.requestXML

        String name;
        int level;

        /* Set jcifs.smb1 properties we know we want; soTimeout and cachePolicy to 30min.
         */
        Config.setProperty("jcifs.smb1.smb.client.soTimeout", "1800000");
        Config.setProperty("jcifs.smb1.netbios.cachePolicy", "1200");
        /* The Filter can only work with NTLMv1 as it uses a man-in-the-middle
         * techinque that NTLMv2 specifically thwarts. A real NTLM Filter would

    for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
      int x = 1 << exponent;
      intValues.add(x, x + 1, x - 1);
    }
    intValues.add(9999).add(10000).add(10001).add(1000000); // near powers of 10
    intValues.add(5792).add(5793); // sqrt(2^25) rounded up and down
    POSITIVE_INTEGER_CANDIDATES = intValues.build();
    NEGATIVE_INTEGER_CANDIDATES =
        ImmutableList.copyOf(

	}, {
		in: []sparseEntry{{0, 3000}}, size: 5000,
		wantValid:    true,
		wantAligned:  []sparseEntry{{0, 2560}},
		wantInverted: []sparseEntry{{3000, 2000}},
	}, {
		in: []sparseEntry{{3000, 2000}}, size: 5000,
		wantValid:    true,
		wantAligned:  []sparseEntry{{3072, 1928}},
		wantInverted: []sparseEntry{{0, 3000}, {5000, 0}},
	}, {
		in: []sparseEntry{{2000, 2000}}, size: 5000,