@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

  @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++) {
      long dividend = r.nextLong();
      long divisor = r.nextLong();
      // Test that the Euclidean property is preserved:
      assertThat(
              dividend

        // Integer
        assertEquals(42, groovyEngine.evaluate("return 42", params));

        // Long
        assertEquals(1000000L, groovyEngine.evaluate("return 1000000L", params));

        // Double
        final Object doubleResult = groovyEngine.evaluate("return 3.14159", params);
        assertTrue(doubleResult instanceof Number);

            assertEquals("2001:db8::1", method.invoke(null, "2001:db8::1"));

            // Expanded forms should be compressed
            assertEquals("::1", method.invoke(null, "0:0:0:0:0:0:0:1"));
            assertEquals("2001:db8::1", method.invoke(null, "2001:0db8:0000:0000:0000:0000:0000:0001"));
            assertEquals("fe80::1", method.invoke(null, "fe80:0000:0000:0000:0000:0000:0000:0001"));

        byte[] buffer = new byte[30];
        int bufferIndex = 5; // Start at offset 5
        int idFileSystem = 0xFFFFFFFF;
        int sectPerAlloc = 16;
        long alloc = 2000000L;
        long free = 1500000L;
        int bytesPerSect = 1024;

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

    assertCorrectSlice(0, 0, 0, 0);
    assertCorrectSlice(0, 0, 1, 0);
    assertCorrectSlice(100, 0, 10, 10);
    assertCorrectSlice(100, 0, 100, 100);
    assertCorrectSlice(100, 5, 10, 10);
    assertCorrectSlice(100, 5, 100, 95);
    assertCorrectSlice(100, 100, 0, 0);
    assertCorrectSlice(100, 100, 10, 0);
    assertCorrectSlice(100, 101, 10, 0);
  }

  /**

                "value": null
              },
              {
                "color": "dark-yellow",
                "value": 75000000
              },
              {
                "color": "dark-red",
                "value": 100000000
              }
            ]
          },
          "unit": "short"
        },
        "overrides": []
      },
      "gridPos": {

    }

    override fun cancel() {
      canceled = true
      delegate.cancel()
    }
  }

  companion object {
    private fun ns(millis: Long): Long = millis * 1000000L
  }

						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 // TODO
  @VisibleForTesting
  static final long[] powersOf10 = {
    1L,
    10L,
    100L,
    1000L,
    10000L,
    100000L,
    1000000L,
    10000000L,
    100000000L,
    1000000000L,
    10000000000L,
    100000000000L,
    1000000000000L,
    10000000000000L,
    100000000000000L,
    1000000000000000L,
    10000000000000000L,