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).
 *

    assertEquals(6, queue.size());
    assertEquals(8, queue.capacity());
    checkUnbounded(queue);
    checkNatural(queue);
  }

  public void testCreation_maximumSize_withContents() {
    MinMaxPriorityQueue<Integer> queue =
        rawtypeToWildcard(MinMaxPriorityQueue.maximumSize(42)).create(NUMBERS);
    assertEquals(6, queue.size());
    assertEquals(11, queue.capacity());
    assertEquals(42, queue.maximumSize);

   *
   * @param queue the queue to be wrapped in a synchronized view
   * @return a synchronized view of the specified queue
   * @since 14.0
   */
  @J2ktIncompatible // Synchronized
  public static <E extends @Nullable Object> Queue<E> synchronizedQueue(Queue<E> queue) {
    return Synchronized.queue(queue, null);
  }

  /**

import java.util.Queue;
import org.jspecify.annotations.Nullable;

/**
 * An Iterator implementation which draws elements from a queue, removing them from the queue as it
 * iterates. This class is not thread safe.
 */
@GwtCompatible
final class ConsumingQueueIterator<T extends @Nullable Object> extends AbstractIterator<T> {
  private final Queue<T> queue;

  ConsumingQueueIterator(Queue<T> queue) {

/**
 * The UrlQueue interface represents a queue of URLs to be processed by a web crawler.
 * It provides methods to get and set various properties of a URL queue entry.
 *
 * @param <IDTYPE> the type of the identifier for the URL queue entry
 */
public interface UrlQueue<IDTYPE> {

    /**
     * Retrieves the unique identifier of the URL queue.
     *
     * @return the unique identifier of type IDTYPE.
     */

 * }
 * </pre>
 */
public class ESSourceReader implements DocumentReader {
    private static final Logger logger = LogManager.getLogger(ESSourceReader.class);

    /** Queue of documents. */
    protected final Queue<Map<String, Object>> queue = new ConcurrentLinkedQueue<>();
    /** Flag indicating if reading is finished. */
    protected final AtomicBoolean isFinished = new AtomicBoolean(false);

    /** OpenSearch client. */

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

    /**
     * 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.
     */

        for (UrlQueueImpl<Long> queue : queueList) {
            assertEquals(sessionId, queue.getSessionId());
            assertEquals(Integer.valueOf(0), queue.getDepth());
            assertNotNull(queue.getCreateTime());

            if ("https://example.com/page1".equals(queue.getUrl())) {
                foundPage1 = true;
                assertEquals("GET", queue.getMethod());

  @Param({"100", "10000"})
  private int size;

  @Param private HeapType heap;

  private Queue<Integer> queue;

  private final Random random = new Random();

  @BeforeExperiment
  void setUp() {
    queue = heap.create(comparator.get());
    for (int i = 0; i < size; i++) {
      queue.add(random.nextInt());
    }
  }

  @Benchmark
  void pollAndAdd(int reps) {