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
    public void test_offer_noMatchingGenerator() {
        TestThumbnailGenerator generator = new TestThumbnailGenerator();
        generator.available = true;

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

            }
        }
        return cipher;
    }

    /**
     * Offers an encryption cipher back to the queue.
     *
     * @param cipher
     *            the cipher to offer
     */
    protected void offerEncryptoCipher(final Cipher cipher) {
        encryptoQueue.offer(cipher);
    }

    /**

                RdmaMemoryRegion region = provider.registerMemory(buffer, EnumSet.of(RdmaAccess.LOCAL_READ, RdmaAccess.REMOTE_READ));
                availableSendRegions.offer(region);
                totalAllocated.incrementAndGet();
            } catch (IOException e) {
                log.warn("Failed to pre-allocate send buffer", e);
            }
        }

    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

    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

                        responseData.setResponseBody(outputFile, true);
                    }
                    ftpClientQueue.offer(client);
                } catch (final CrawlingAccessException e) {
                    ftpClientQueue.offer(client);
                    throw e;
                } catch (final Exception e) {
                    logger.warn("I/O Exception.", e);

        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")

                RdmaMemoryRegion region = provider.registerMemory(buffer,
                    EnumSet.of(RdmaAccess.LOCAL_READ, RdmaAccess.REMOTE_READ));
                availableSendRegions.offer(region);
                totalAllocated.incrementAndGet();
            } catch (IOException e) {
                log.warn("Failed to pre-allocate send buffer", e);
            }
        }