if (cancel) {
      cancel = false
      eventSource.cancel()
    }
  }

  private fun nextEvent(): Any =
    events.poll(10, TimeUnit.SECONDS)
      ?: throw AssertionError("Timed out waiting for event.")

  fun assertExhausted() {
    assertThat(events).isEmpty()
  }

  fun assertEvent(
    id: String?,
    type: String?,
    data: String,
  ) {

import org.jspecify.annotations.Nullable;

/**
 * A double-ended priority queue, which provides constant-time access to both its least element and
 * its greatest element, as determined by the queue's specified comparator. If no comparator is
 * given at creation time, the natural order of elements is used. If no maximum size is given at
 * creation time, the queue is unbounded.
 *
 * <p>Usage example:
 *
 * {@snippet :

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.crawler.exception;

/**
 * An exception indicating that the execution of a process has timed out.
 * This exception extends {@link org.codelibs.fess.crawler.exception.ExtractException}.
 *
 */
public class ExecutionTimeoutException extends ExtractException {

    private static final long serialVersionUID = 1L;

    }

    /**
     * Verify that writeParameterWordsWireFormat writes the file id and the
     * unsigned time correctly.  The last write time is zero which should be
     * encoded as four 0xFF bytes by {@code writeUTime}.
     */
    @ParameterizedTest(name = "fid={0}, lastWriteTime={1}")
    @MethodSource("validParams")

   *
   * <p>This is guaranteed to return zero if the dataset contains only exactly one finite value. It
   * is not guaranteed to return zero when the dataset consists of the same value multiple times,
   * due to numerical errors. However, it is guaranteed never to return a negative result.
   *
   * <h3>Non-finite values</h3>
   *

      $(this).val(
        picker.startDate.format("YYYY-MM-DD HH:mm") +
          " - " +
          picker.endDate.format("YYYY-MM-DD HH:mm")
      );
    });

  // Time picker
  $("input.form-control.time").timepicker({
    showInputs: false
  });

  // tooltips
  $(function() {
    $('[data-toggle="tooltip"]').tooltip();
  });

   * // returns {"foo", "quux"}
   * }
   *
   * <p>This {@code Collector} uses O(k) memory and takes expected time O(n) (worst-case O(n log
   * k)), as opposed to e.g. {@code Stream.sorted(comparator).limit(k)}, which currently takes O(n
   * log n) time and O(n) space.
   *
   * @throws IllegalArgumentException if {@code k < 0}
   * @since 22.0
   */

   * in the returned list.
   *
   * <p>The function is applied lazily, invoked when needed. This is necessary for the returned list
   * to be a view, but it means that the function will be applied many times for bulk operations
   * like {@link List#contains} and {@link List#hashCode}. For this to perform well, {@code
   * function} should be fast. To avoid lazy evaluation when the returned list doesn't need to be a

import okio.Source
import okio.buffer

internal abstract class BasePublicSuffixList : PublicSuffixList {
  /** True after we've attempted to read the list for the first time. */
  private val listRead = AtomicBoolean(false)

  /** Used for concurrent threads reading the list for the first time. */
  private val readCompleteLatch = CountDownLatch(1)

  // The lists are held as a large array of UTF-8 bytes. This is to avoid allocating lots of strings

     */
    @Override
    public final Integer getOverrideTimeout() {
        return this.overrideTimeout;
    }

    /**
     * Sets an override timeout for this request.
     *
     * @param overrideTimeout
     *            the overrideTimeout to set
     */
    public final void setOverrideTimeout(final Integer overrideTimeout) {