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

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

    }

    @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();

     * @param event the log notification event to add
     */
    public void offer(final LogNotificationEvent event) {
        int maxBufferSize;
        try {
            maxBufferSize = ComponentUtil.getFessConfig().getLogNotificationBufferSizeAsInteger();
        } catch (final Exception e) {
            maxBufferSize = 1000;
        }
        queue.offer(event);
        if (size.incrementAndGet() > maxBufferSize) {

   */
  @CanIgnoreReturnValue
  @Override
  public boolean add(E element) {
    offer(element);
    return true;
  }

  @CanIgnoreReturnValue
  @Override
  public boolean addAll(Collection<? extends E> newElements) {
    boolean modified = false;
    for (E element : newElements) {
      offer(element);
      modified = true;
    }
    return modified;
  }

  /**

   */
  @CanIgnoreReturnValue
  @Override
  public boolean add(E element) {
    offer(element);
    return true;
  }

  @CanIgnoreReturnValue
  @Override
  public boolean addAll(Collection<? extends E> newElements) {
    boolean modified = false;
    for (E element : newElements) {
      offer(element);
      modified = true;
    }
    return modified;
  }

  /**

  /** The queued items */
  final E[] items;

  /** items index for next take, poll or remove */
  int takeIndex;

  /** items index for next put, offer, or add. */
  int putIndex;

  /** Number of items in the queue */
  private int count;

  /*
   * Concurrency control uses the classic two-condition algorithm
   * found in any textbook.
   */

      this License, each Contributor hereby grants to You a perpetual,
      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
      (except as stated in this section) patent license to make, have made,
      use, offer to sell, sell, import, and otherwise transfer the Work,
      where such license applies only to those patent claims licensable
      by such Contributor that are necessarily infringed by their

    if (!requestQueue.offer(new Request(methodName, arguments), TIMEOUT_MILLIS, MILLISECONDS)) {
      throw new TimeoutException();
    }
  }

  /**
   * Receives a response from this thread.
   *
   * @throws TimeoutException if this thread does not offer a response within a reasonable amount of
   *     time