}

    @Override
    public int weigh(Object key, Object value) {
      return constant;
    }
  }

  static final class IntKeyWeigher implements Weigher<Integer, Object> {
    @Override
    public int weigh(Integer key, Object value) {
      return key;
    }
  }

  static final class IntValueWeigher implements Weigher<Object, Integer> {
    @Override
    public int weigh(Object key, Integer value) {

    assertThat(keySet).containsExactly(0, 1, 2, 3, 4, 5, 6, 7, 8, 9);

    // add an at-the-maximum-weight entry
    getAll(cache, asList(45));
    CacheTesting.drainRecencyQueues(cache);
    assertThat(keySet).containsExactly(0, 45);

    // add an over-the-maximum-weight entry
    getAll(cache, asList(46));
    CacheTesting.drainRecencyQueues(cache);
    assertThat(keySet).contains(0);
  }

/**
 * Calculates the weights of cache entries.
 *
 * @author Charles Fry
 * @since 11.0
 */
@GwtCompatible
@FunctionalInterface
public interface Weigher<K, V> {

  /**
   * Returns the weight of a cache entry. There is no unit for entry weights; rather they are simply
   * relative to each other.
   *
   * @return the weight of the entry; must be non-negative
   */

                                    </div>
                                </div>
                                <div class="form-group row">
                                    <span class="font-weight-bold col-sm-3 text-sm-right col-form-label"><la:message
                                            key="labels.scheduledjob_jobLogging"/></span>
                                    <div class="form-inline col-sm-9">

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

        request.setSuggestDetail(suggestDetail);
        return this;
    }

    /**
     * Sets the prefix match weight.
     * @param prefixMatchWeight The prefix match weight.
     * @return This builder instance.
     */
    public SuggestRequestBuilder setPrefixMatchWeight(final float prefixMatchWeight) {
        request.setPrefixMatchWeight(prefixMatchWeight);

            "five", 5,
            "six", 6,
            "seven", 7,
            "eight", 8),
        "one",
        1,
        "two",
        2,
        "three",
        3,
        "four",
        4,
        "five",
        5,
        "six",
        6,
        "seven",
        7,
        "eight",
        8);
    assertMapEquals(
        ImmutableBiMap.of(
            "one", 1,

     * @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)) {

{
    "properties": {
      "depth": {
        "type": "integer"
      },
      "parentUrl": {
        "type": "keyword"
      },
      "method": {
        "type": "keyword"
      },
      "weight": {
        "type": "float"
      },
      "createTime": {
        "type": "long"
      },
      "lastModified": {
        "type": "long"
      },
      "sessionId": {
        "type": "keyword"
      },

        `tf.keras.mixed_precision.experimental.LossScaleOptimizer`, the weights
        of the `DynanmicLossScale` are copied into the `LossScaleOptimizer`
        instead of being reused. This means modifying the weights of the
        `DynamicLossScale` will no longer affect the weights of the
        LossScaleOptimizer, and vice versa.