}

  /** 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).

                // Megabytes tests
                Arguments.of(0L, 5000000L, "0/5.0 MB"),
                Arguments.of(500000L, 5000000L, "0.5/5.0 MB"),
                Arguments.of(1000000L, 5000000L, "1.0/5.0 MB"),
                Arguments.of(5000000L, 5000000L, "5.0 MB"),
                Arguments.of(5000000L, 15000000L, "5.0/15 MB"),
                Arguments.of(15000000L, 15000000L, "15 MB"),

                // Gigabytes tests

        when(response.getHeaderStart()).thenReturn(0);

        // Write FileFsFullSizeInformation data (32 bytes)
        SMBUtil.writeInt8(1000000, buffer, 20); // Total allocation units
        SMBUtil.writeInt8(500000, buffer, 28); // Caller available units
        SMBUtil.writeInt8(600000, buffer, 36); // Actual available units
        SMBUtil.writeInt4(512, buffer, 44); // Sectors per unit

  @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

        byte[] buffer = new byte[22];
        int idFileSystem = 0;
        int sectPerAlloc = 1000;
        int alloc = 1000000; // Large allocation count
        int free = 500000;
        int bytesPerSect = 4096;

        // Encode test data
        int offset = 0;
        SMBUtil.writeInt4(idFileSystem, buffer, offset);
        offset += 4;

    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(

						this.mem = new DataView(this._inst.exports.mem.buffer);
					},

					// func nanotime1() int64
					"runtime.nanotime1": (sp) => {
						sp >>>= 0;
						setInt64(sp + 8, (timeOrigin + performance.now()) * 1000000);
					},

					// func walltime() (sec int64, nsec int32)
					"runtime.walltime": (sp) => {
						sp >>>= 0;
						const msec = (new Date).getTime();
						setInt64(sp + 8, msec / 1000);

  }

  @GwtIncompatible // isPrime is GWT-incompatible
  public void testIsPrime() {
    // 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);

        assertNotNull(resultData.getData());

        // Test with large AccessResultData
        StringBuilder largeString = new StringBuilder();
        for (int i = 0; i < 1000000; i++) {
            largeString.append("Large data content ");
        }
        TestAccessResultData<String> largeAccessData = new TestAccessResultData<>(largeString.toString().getBytes());

     */
    protected long maxCompressionRatio = 100;

    /**
     * Max uncompression size.
     */
    protected long maxUncompressionSize = 1000000;

    /**
     * Initial buffer size.
     */
    protected int initialBufferSize = 10000;

    /**
     * If true, duplicated terms are replaced.
     */
    protected boolean replaceDuplication = false;

    /**