Shinsuke Sugaya <******@****.***> 1730954650 +0900

    assertTrue(queue.add("one"));
    assertTrue(queue.add("two"));
    assertTrue(queue.add("three"));
    assertEquals("one", queue.element());
    assertEquals("one", queue.peek());
    assertEquals(3, queue.size());
    assertEquals(0, queue.remainingCapacity());

    assertTrue(queue.add("four"));
    assertEquals("two", queue.element());
    assertEquals("two", queue.peek());
    assertEquals(3, queue.size());

    /**
     * Adds a URL to the queue.
     *
     * @param sessionId The session ID.
     * @param url The URL.
     */
    void add(String sessionId, String url);

    /**
     * Inserts a URL queue.
     *
     * @param urlQueue The URL queue.
     */
    void insert(QUEUE urlQueue);

    /**
     * Deletes a URL queue.
     *
     * @param sessionId The session ID.
     */

import java.util.Collection;
import java.util.Queue;

/**
 * A non-blocking queue which automatically evicts elements from the head of the queue when
 * attempting to add new elements onto the queue and it is full. This queue orders elements FIFO
 * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e.,
 * cyclic buffer or ring buffer).
 *

    // This dispatcher matches the original dispatch behavior of EventBus.

    /** Per-thread queue of events to dispatch. */
    @SuppressWarnings("ThreadLocalUsage") // Each Dispatcher needs its own state.
    private final ThreadLocal<Queue<Event>> queue =
        new ThreadLocal<Queue<Event>>() {
          @Override
          protected Queue<Event> initialValue() {
            return new ArrayDeque<>();
          }
        };

        this.filterIndex = filterIndex;
    }

    /**
     * Returns the number of queue shards.
     * @return The number of queue shards.
     */
    public int getQueueShards() {
        return queueShards;
    }

    /**
     * Sets the number of queue shards.
     * @param queueShards The number of queue shards.
     */
    public void setQueueShards(final int queueShards) {

     */
    public synchronized void addUrlQueueList(final String sessionId, final Queue<UrlQueueImpl<Long>> urlQueueList) {
        final Queue<UrlQueueImpl<Long>> uqList = getUrlQueueList(sessionId);
        uqList.addAll(urlQueueList);
        urlQueueMap.put(sessionId, uqList);
    }

    /**
     * Removes the URL queue for the specified session ID.
     * @param sessionId the session ID
     */

        UrlQueueImpl<Long> queue = new UrlQueueImpl<>();
        assertNotNull(queue);
        assertNull(queue.getId());
        assertNull(queue.getSessionId());
        assertNull(queue.getMethod());
        assertNull(queue.getUrl());
        assertNull(queue.getMetaData());
        assertNull(queue.getEncoding());
        assertNull(queue.getParentUrl());
        assertNull(queue.getDepth());

    startNs = queue.taskRunner.backend.nanoTime()
    log(task, queue, "starting")
  }

  var completedNormally = false
  try {
    val result = block()
    completedNormally = true
    return result
  } finally {
    if (loggingEnabled) {
      val elapsedNs = queue.taskRunner.backend.nanoTime() - startNs
      if (completedNormally) {
        log(task, queue, "finished run in ${formatDuration(elapsedNs)}")

 * index names, shard counts, and replica counts for queue, data, and filter indices.
 */
public class FessCrawlerConfig extends OpenSearchCrawlerConfig {

    /**
     * Default constructor.
     */
    public FessCrawlerConfig() {
        super();
    }

    /**
     * Gets the name of the queue index for the crawler.
     *
     * @return the queue index name
     */
    @Override