// Given - disk with no free space
            ByteBuffer buffer = ByteBuffer.allocate(24);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(1000000L);
            buffer.putLong(0L);
            buffer.putInt(8);
            buffer.putInt(512);

            // When
            fileFsSizeInfo.decode(buffer.array(), 0, 24);

            // Then

    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"
}

        });
    }

    @Test
    public void testArrayAllocationInvalidElementSize() throws Exception {
        assertThrows(SmbException.class, () -> {
            validator.validateArrayAllocation(100, 0, 1000);
        });
    }

    @Test
    public void testArrayAllocationExceedsMax() throws Exception {
        assertThrows(SmbException.class, () -> {

    assertThat(InetAddresses.toAddrString(InetAddresses.forString("0:0:3:0:0:0:0:ffff")))
        .isEqualTo("0:0:3::ffff");
    assertThat(InetAddresses.toAddrString(InetAddresses.forString("0:0:0:4:0:0:0:ffff")))
        .isEqualTo("::4:0:0:0:ffff");
    assertThat(InetAddresses.toAddrString(InetAddresses.forString("0:0:0:0:5:0:0:ffff")))
        .isEqualTo("::5:0:0:ffff");

// ADR
	ADR	next, R11     // ADR R11 // 2b000010
next:
	NOP
	ADR -2(PC), R10    // 0a000010
	ADR 2(PC), R16     // 10000010
	ADR -26(PC), R1    // 01000010
	ADR 12(PC), R2     // 02000010
	ADRP -2(PC), R10   // 0a000090
	ADRP 2(PC), R16    // 10000090
	ADRP -26(PC), R1   // 01000090
	ADRP 12(PC), R2    // 02000090

// LDP/STP
	LDP	(R0), (R0, R1)      // 000440a9
	LDP	(R0), (R1, R2)      // 010840a9

            // Given - disk with no free space
            ByteBuffer buffer = ByteBuffer.allocate(32);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(1000000L);
            buffer.putLong(0L);
            buffer.putLong(0L);
            buffer.putInt(8);
            buffer.putInt(512);

            // When

  @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

            TestCreateContextResponse response = new TestCreateContextResponse("LARGE_BUFFER_TEST".getBytes(StandardCharsets.UTF_8));

            int result = response.decode(largeBuffer, 1000, 5000);
            assertEquals(5000, result);
            assertEquals(5000, response.getData().length);
        }

        @Test
        @DisplayName("Should handle empty name array")

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

  /**