assertEquals(0, new BigDecimal("0.00001").compareTo(BigDecimalConversionUtil.toBigDecimal(Double.valueOf(0.00001D))));
        assertEquals(0, new BigDecimal("0.0000001").compareTo(BigDecimalConversionUtil.toBigDecimal(Double.valueOf(0.0000001D))));

        assertEquals(0, new BigDecimal("0.123").compareTo(BigDecimalConversionUtil.toBigDecimal(Double.valueOf(0.123D))));

    public void testWriteParameterWordsWireFormatWithDifferentOffsets() {
        // Given
        smbComTreeDisconnect = new SmbComTreeDisconnect(config);
        byte[] dst = new byte[200];
        int[] offsets = { 0, 10, 50, 100 };

        for (int offset : offsets) {
            // When
            int result = smbComTreeDisconnect.writeParameterWordsWireFormat(dst, offset);

            // Then

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

        // Write FileFsSizeInformation data (24 bytes)
        SMBUtil.writeInt8(1000000, buffer, 20); // Total allocation units
        SMBUtil.writeInt8(500000, buffer, 28); // Available allocation units
        SMBUtil.writeInt4(512, buffer, 36); // Sectors per unit

    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(

	nullTime := sql.NullTime{}
	err := nullTime.Scan(v)
	t.Time = nullTime.Time
	return err
}

func (t EmptyTime) Value() (driver.Value, error) {
	return time.Now() /* pass tests, mysql 8 doesn't support 0000-00-00 by default */, nil
}

type NullString struct {
	sql.NullString
}

type Point struct {
	X, Y int
}

func (point Point) GormDataType() string {
	return "geo"
}

  @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

            processor.setSearcher(new TestSearcher(100));
            processor.init();

            final List<Map<String, Object>> results =
                    processor.search("*", new TestSearchRequestParams(0, 10000, 0), OptionalThing.empty());
            assertNotNull(results);
            // Should return only available documents
            assertEquals(100, results.size());
        }
    }

    /**

  @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

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