value="${f:h(sortOrder)}" class="form-control"
                                               min="0" max="100000">
                                    </div>
                                </div>
                            </div>
                            <div class="card-footer">

    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(

Example: Start MinIO server in a 12 drives setup, using MinIO binary.

```sh
minio server /data{1...12}
```

Example: Start MinIO server in a 8 drives setup, using MinIO Docker image.

```sh
podman run \
  -p 9000:9000 \
  -p 9001:9001 \
  --name minio \
  -v /mnt/data1:/data1 \
  -v /mnt/data2:/data2 \
  -v /mnt/data3:/data3 \
  -v /mnt/data4:/data4 \
  -v /mnt/data5:/data5 \
  -v /mnt/data6:/data6 \

                // override the suite timeout to 30 mins for windows, because it has the most inefficient filesystem known to man
                test.systemProperty("tests.timeoutSuite", "2400000!");
            }

            /*
             *  If this project builds a shadow JAR than any unit tests should test against that artifact instead of

        // System time
        SMBUtil.writeTime(System.currentTimeMillis(), buffer, offset + 40);

        // Server start time
        SMBUtil.writeTime(System.currentTimeMillis() - 3600000, buffer, offset + 48);

        // Security buffer offset and length
        SMBUtil.writeInt2(128, buffer, offset + 56); // Offset
        SMBUtil.writeInt2(0, buffer, offset + 58); // Length

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

    /**

        final Properties p = new Properties();
        /*
         * Set jcifs properties we know we want; soTimeout and cachePolicy to 30min.
         */
        p.setProperty("jcifs.smb.client.soTimeout", "1800000");
        p.setProperty("jcifs.netbios.cachePolicy", "1200");
        /*
         * The Filter can only work with NTLMv1 as it uses a man-in-the-middle

        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

  @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