/** Returns a {@link Weigher} that uses the integer key as the weight. */
  static Weigher<Integer, Object> intKeyWeigher() {
    return new IntKeyWeigher();
  }

  /** Returns a {@link Weigher} that uses the integer value as the weight. */
  static Weigher<Object, Integer> intValueWeigher() {
    return new IntValueWeigher();
  }

  static final class ConstantWeigher implements Weigher<Object, Object> {
    private final int constant;

    checkArgument(maximumSize >= 0, "maximum size must not be negative");
    this.maximumSize = maximumSize;
    return this;
  }

  /**
   * Specifies the maximum weight of entries the cache may contain. Weight is determined using the
   * {@link Weigher} specified with {@link #weigher}, and use of this method requires a

     * @param childUrl The child URL to store.
     * @param parentUrl The parent URL.
     * @param weight The weight of the child URL.
     * @param depth The depth of the child URL.
     */
    protected void storeChildUrl(final String childUrl, final String parentUrl, final float weight, final int depth) {
        if (crawlerContext.getMaxDepth() >= 0 && depth > crawlerContext.getMaxDepth()) {
            return;

    display: block;
    float: left;
    width: 300px;
    height: 50px;
    padding: 2px;
    font-family: Verdana, sans-serif;
    font-size: 10pt;
    color: #000000;
    text-decoration: none
}
a.plain {
    display: inline;
    float: none;
    width: auto;
    height: auto
}
a.sort {
    display: block;
    float: left;
    width: 100px;
    height: 15px;
    font-family: Verdana, sans-serif;

     * @param parentUrl the parent URL that referenced this child URL
     * @param weight the weight/priority of the child URL
     * @param depth the crawling depth of the child URL
     */
    @Override
    protected void storeChildUrl(final String childUrl, final String parentUrl, final float weight, final int depth) {
        if (StringUtil.isNotBlank(childUrl)) {

     */
    public void setNormalizer(final Normalizer normalizer) {
        this.normalizer = normalizer;
    }

    /**
     * Sets the prefix match weight.
     * @param prefixMatchWeight The prefix match weight.
     */
    public void setPrefixMatchWeight(final float prefixMatchWeight) {
        this.prefixMatchWeight = prefixMatchWeight;
    }

    /**

  @Override
  public void write(char[] cbuf, int off, int len) throws IOException {
    checkNotClosed();
    // It turns out that creating a new String is usually as fast, or faster
    // than wrapping cbuf in a light-weight CharSequence.
    target.append(new String(cbuf, off, len));
  }

  /*
   * Override a few functions for performance reasons to avoid creating unnecessary strings.
   */

  @Override

        }
        return leastLoadedChannel != null ? leastLoadedChannel : channels.iterator().next();
    }

    private ChannelInfo selectWeightedRandom(Collection<ChannelInfo> channels) {
        // Calculate total weight
        int totalWeight = 0;
        for (ChannelInfo channel : channels) {
            totalWeight += channel.getScore();
        }

        if (totalWeight == 0) {

    protected List<OpenSearchUrlQueue> fetchUrlQueueList(final String sessionId) {
        return getList(OpenSearchUrlQueue.class, sessionId, null, 0, pollingFetchSize,
                SortBuilders.fieldSort(OpenSearchUrlQueue.WEIGHT).order(SortOrder.DESC),
                SortBuilders.fieldSort(CREATE_TIME).order(SortOrder.ASC));
    }

    /**
     * Saves the session state (currently not implemented).
     *

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a
   * href="https://github.com/google/guava/wiki/GraphsExplained#Graph-traversal">"Graph traversal"