<la:option value="100">100</la:option>
                                            <la:option value="200">500</la:option>
                                            <la:option value="1000">1000</la:option>
                                        </la:select>
                                    </div>
                                </div>
                                <div class="form-group row">

        });
    }

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

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

        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

            // 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

    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(

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

        assertEquals(0x00040000, SmbConstants.WRITE_DAC);
        assertEquals(0x00080000, SmbConstants.WRITE_OWNER);
        assertEquals(0x00100000, SmbConstants.SYNCHRONIZE);
        assertEquals(0x10000000, SmbConstants.GENERIC_ALL);
        assertEquals(0x20000000, SmbConstants.GENERIC_EXECUTE);
        assertEquals(0x40000000, SmbConstants.GENERIC_WRITE);
        assertEquals(0x80000000, SmbConstants.GENERIC_READ);
    }

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

  };

  @GwtIncompatible // TODO
  @VisibleForTesting
  static final long[] powersOf10 = {
    1L,
    10L,
    100L,
    1000L,
    10000L,
    100000L,
    1000000L,
    10000000L,
    100000000L,
    1000000000L,
    10000000000L,
    100000000000L,
    1000000000000L,
    10000000000000L,
    100000000000000L,
    1000000000000000L,
    10000000000000000L,