* Only URLs that don't already exist will be added.
     *
     * @param sessionId The session ID.
     * @param urlQueueList The list of URL queue entries to offer.
     */
    @Override
    public void offerAll(final String sessionId, final List<OpenSearchUrlQueue> urlQueueList) {
        if (logger.isDebugEnabled()) {
            logger.debug("Offering URL: Session ID: {}, UrlQueue: {}", sessionId, urlQueueList);
        }

            // Do nothing in test
        }

        @Override
        public void deleteAll() {
            // Do nothing in test
        }

        @Override
        public void offerAll(String sessionId, List<OpenSearchUrlQueue> list) {
            // Do nothing in test
        }

        @Override
        public OpenSearchUrlQueue poll(String sessionId) {
            return null;
        }

            urlQueue.setSessionId(sessionId);
            urlQueue.setUrl("http://www.example.com/page" + i);
            urlQueueList.add(urlQueue);
        }

        urlQueueService.offerAll(sessionId, urlQueueList);

        // Poll all items
        int count = 0;
        while (true) {
            final OpenSearchUrlQueue polled = urlQueueService.poll(sessionId);
            if (polled == null) {

                    uq.setUrl(d.getUrl());
                    uq.setWeight(d.getWeight());
                    return uq;
                })
                .collect(Collectors.toList());
        urlQueueService.offerAll(crawlerContext.sessionId, childList);
    }

    /**
     * Stores a single child URL to the crawling queue.
     * @param childUrl The child URL to store.
     * @param parentUrl The parent URL.

        list.subList(k, list.size()).clear();
      }
      list.trimToSize();
      return unmodifiableList(list);
    } else {
      TopKSelector<E> selector = TopKSelector.least(k, this);
      selector.offerAll(iterator);
      return selector.topK();
    }
  }

  /**
   * Returns the {@code k} greatest elements of the given iterable according to this ordering, in

        list.subList(k, list.size()).clear();
      }
      list.trimToSize();
      return unmodifiableList(list);
    } else {
      TopKSelector<E> selector = TopKSelector.least(k, this);
      selector.offerAll(iterator);
      return selector.topK();
    }
  }

  /**
   * Returns the {@code k} greatest elements of the given iterable according to this ordering, in