import java.util.ArrayDeque
import java.util.Deque
import okio.Buffer
import org.junit.jupiter.api.AfterEach
import org.junit.jupiter.api.Test

class ServerSentEventIteratorTest {
  /** Either [Event] or [Long] items for events and retry changes, respectively.  */
  private val callbacks: Deque<Any> = ArrayDeque()

  @AfterEach
  fun after() {
    assertThat(callbacks).isEmpty()
  }

  @Test
  fun multiline() {

/**
 * Exception that wraps {@link InstantiationException}.
 *
 * @author higa
 */
public class InstantiationRuntimeException extends ClRuntimeException {

    private static final long serialVersionUID = 5220902071756706607L;

    /**
     * The target class.
     */
    private final Class<?> targetClass;

    /**
     * Creates a {@link InstantiationRuntimeException}.
     *

package org.codelibs.fess.exception;

/**
 * This exception is thrown when the requested result offset exceeds the limit.
 */
public class ResultOffsetExceededException extends FessSystemException {
    private static final long serialVersionUID = 1L;

    /**
     * Constructor.
     * @param message The exception message.
     */
    public ResultOffsetExceededException(final String message) {
        super(message);
    }

/**
 * Exception that wraps {@link IndexOutOfBoundsException}.
 *
 * @author wyukawa
 */
public class ClIndexOutOfBoundsException extends IndexOutOfBoundsException {

    private static final long serialVersionUID = -824874776607593608L;

    /**
     * Creates a {@link ClIndexOutOfBoundsException}.
     */
    public ClIndexOutOfBoundsException() {
        super();
    }

    /**

                return List.of("Store1");
            }
        };

        // First call to initialize
        testFactory.getDataStoreNames();

        final long[] observedTimes = new long[10];
        final Thread[] threads = new Thread[10];

        // Trigger cache refresh by setting old time
        testFactory.lastLoadedTime = System.currentTimeMillis() - 70000L;

  /**
   * Shortcut for {@code newHasher().putLong(input).hash()}; returns the hash code for the given
   * {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i>
   * perform better than its longhand equivalent, but should not perform worse.
   */
  HashCode hashLong(long input);

  /**
   * Shortcut for {@code newHasher().putBytes(input).hash()}. The implementation <i>might</i>

 */
package org.codelibs.fess.exception;

/**
 * An exception thrown when LDAP configuration is invalid.
 */
public class LdapConfigurationException extends FessSystemException {

    private static final long serialVersionUID = 1L;

    /**
     * Constructs a new LDAP configuration exception with the specified detail message.
     *
     * @param message The detail message.
     */

                    excludeFields, query);
        }

        final long startTime = System.currentTimeMillis();

        try {
            final AtomicLong processedCount = new AtomicLong(0);
            final long count = searchEngineClient.scrollSearch(fessConfig.getIndexDocumentSearchIndex(), requestBuilder -> {

        }
        fail("could not start job.");
    }

    protected static void waitJob(final String namePrefix) {
        Boolean isRunning = false;
        int count = 0;
        long sleepTime = 50; // Start with 50ms

        // Wait until the crawler starts (with exponential backoff)
        while (count < 1500 && !isRunning) {
            ThreadUtil.sleep(sleepTime);
            count++;

    String threadName = "com.google.common.base.internal.Finalizer";
    Thread thread = null;
    if (bigThreadConstructor != null) {
      try {
        boolean inheritThreadLocals = false;
        long defaultStackSize = 0;
        thread =
            bigThreadConstructor.newInstance(
                (ThreadGroup) null, finalizer, threadName, defaultStackSize, inheritThreadLocals);
      } catch (Throwable t) {