// Add events to buffer
        ComponentUtil.getLogNotificationHelper()
                .offer(new LogNotificationEvent(System.currentTimeMillis(), "ERROR", "org.test", "msg1", null));
        ComponentUtil.getLogNotificationHelper()
                .offer(new LogNotificationEvent(System.currentTimeMillis(), "WARN", "org.test", "msg2", null));

   */
  @CanIgnoreReturnValue // pushed down from class to method
  @Override
  public boolean add(E e) {
    return offer(e);
  }

  /**
   * Inserts the specified element into this priority queue.
   *
   * @param e the element to add
   * @return {@code true} (as specified by {@link Queue#offer})
   * @throws ClassCastException if the specified element cannot be compared with elements currently

    private final Queue<E> delegate = new LinkedList<>();
    private final Object mutex = new Object[0]; // something Serializable

    @Override
    public boolean offer(E o) {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.offer(o);
    }

    @Override
    public @Nullable E poll() {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.poll();
    }

    @Override

        Map<String, Object> docMap = new HashMap<>();
        docMap.put("_id", "docid1");
        docMap.put("url", "http://example.com");

        boolean result = thumbnailManager.offer(docMap);
        assertTrue(result);
    }

    // Test offer with no matching generator
    @Test
    public void test_offer_noMatchingGenerator() {
        TestThumbnailGenerator generator = new TestThumbnailGenerator();

    private final Queue<E> delegate = new LinkedList<>();
    private final Object mutex = new Object[0]; // something Serializable

    @Override
    public boolean offer(E o) {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.offer(o);
    }

    @Override
    public @Nullable E poll() {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.poll();
    }

    @Override

    private final Deque<E> delegate = new LinkedList<>();
    private final Object mutex = new Object[0]; // something Serializable

    @Override
    public boolean offer(E o) {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.offer(o);
    }

    @Override
    public @Nullable E poll() {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.poll();
    }

    @Override

 *
 * <p>This uses the same efficient implementation as {@link Ordering#leastOf(Iterable, int)},
 * offering expected O(n + k log k) performance (worst case O(n log k)) for n calls to {@link
 * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
 * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log

    }

    @Test
    public void test_offer_and_drainAll() {
        LogNotificationHelper helper = new LogNotificationHelper();
        helper.offer(new LogNotificationEvent(1000L, "ERROR", "com.example.Foo", "message1", "throwable1"));
        helper.offer(new LogNotificationEvent(2000L, "WARN", "com.example.Bar", "message2", null));

        List<LogNotificationEvent> events = helper.drainAll();

    private final Deque<E> delegate = new LinkedList<>();
    private final Object mutex = new Object[0]; // something Serializable

    @Override
    public boolean offer(E o) {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.offer(o);
    }

    @Override
    public @Nullable E poll() {
      assertTrue(Thread.holdsLock(mutex));
      return delegate.poll();
    }

    @Override

        delegate.put(element)
        editCount++
      }
    }

    override fun iterator() = error("unsupported")

    override fun offer(e: T) = error("unsupported")

    override fun peek(): T = error("unsupported")

    override fun offer(
      element: T,
      timeout: Long,
      unit: TimeUnit,
    ) = error("unsupported")

    override fun take() = error("unsupported")