assertDoesNotThrow(() -> InputValidator.validateTimeout(1000L, "test"));
        assertDoesNotThrow(() -> InputValidator.validateTimeout(0L, "test"));
        assertDoesNotThrow(() -> InputValidator.validateTimeout(3600000L, "test"));

        assertThrows(IllegalArgumentException.class, () -> InputValidator.validateTimeout(-1L, "test"));
        assertThrows(IllegalArgumentException.class, () -> InputValidator.validateTimeout(3600001L, "test"));

	// Verify supported bdnz/bdz encodings.
	BC 16,0,0(PC)                   // BC $16, CR0LT, 0(PC) // 42000000
	BDNZ 0(PC)                      // 42000000
	BDZ 0(PC)                       // 42400000
	BC 18,0,0(PC)                   // BC $18, CR0LT, 0(PC) // 42400000

	// Verify the supported forms of bcclr[l]
	BC $20,CR0LT,$1,LR              // 4e800820

            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++) {
      long dividend = r.nextLong();
      long divisor = r.nextLong();
      // 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++) {
      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

    assertThat(log).containsExactly("run@100000")

    taskFaker.advanceUntil(150.µs)
    assertThat(log).containsExactly("run@100000", "run@150000")

    taskFaker.advanceUntil(299.µs)
    assertThat(log).containsExactly("run@100000", "run@150000")

    taskFaker.advanceUntil(300.µs)
    assertThat(log).containsExactly("run@100000", "run@150000", "run@300000")

    taskFaker.assertNoMoreTasks()

        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

        int n;
        String name;

        final Properties p = new Properties();
        p.putAll(System.getProperties());
        p.setProperty("jcifs.smb.client.soTimeout", "600000");
        p.setProperty("jcifs.smb.client.attrExpirationPeriod", "300000");

        final Enumeration<String> e = getInitParameterNames();
        while (e.hasMoreElements()) {
            name = e.nextElement();

                // 1000 kilobytes
                Arguments.of(1000L * 1000L, null, "1.0 MB"),
                Arguments.of(1000L * 1000L, ScaleUnit.BYTE, "1000000 B"),
                Arguments.of(1000L * 1000L, ScaleUnit.KILOBYTE, "1000 kB"),
                Arguments.of(1000L * 1000L, ScaleUnit.MEGABYTE, "1.0 MB"),
                Arguments.of(1000L * 1000L, ScaleUnit.GIGABYTE, "0 GB"),