buf.push(hashStr);
    }
  });

  $result.on("click", "a.favorite", function(e) {
    var $favorite = $(this),
        values = $favorite.attr("href").split("#"),
        actionUrl,
        docId;
    if (values.length === 2 && $queryId.length > 0) {
      docId = values[1];
      actionUrl = contextPath + "/api/v1/documents/" + docId + "/favorite";
      $.ajax({
        dataType: "json",
        cache: false,

  }

  public void testValues() {
    Map<String, Integer> map = create();
    Collection<Integer> values = map.values();
    assertTrue(values instanceof SynchronizedCollection);
    assertSame(mutex, ((SynchronizedCollection<?>) values).mutex);
  }

  public void testEntrySet() {
    Map<String, Integer> map = create();
    Set<Entry<String, Integer>> entrySet = map.entrySet();

        assertEquals(TransPeekNamedPipeResponse.STATUS_DISCONNECTED, response.getStatus());
    }

    @Test
    @DisplayName("Test boundary conditions for available value")
    void testBoundaryAvailableValues() {
        // Test minimum value (0)
        byte[] buffer = new byte[10];
        SMBUtil.writeInt2(0, buffer, 0);
        SMBUtil.writeInt2(0, buffer, 2);

  }

  /** Returns a PublicSuffixType of the right type according to the given code */
  static PublicSuffixType fromCode(char code) {
    for (PublicSuffixType value : values()) {
      if (value.getInnerNodeCode() == code || value.getLeafNodeCode() == code) {
        return value;
      }
    }
    throw new IllegalArgumentException("No enum corresponding to given code: " + code);
  }

    /** Property key for default label value configuration. */
    public static final String DEFAULT_LABEL_VALUE_PROPERTY = "label.value";

    /** Property key for default sort value configuration. */
    public static final String DEFAULT_SORT_VALUE_PROPERTY = "sort.value";

    /** Property key for virtual host value configuration. */

  }

  /**
   * Returns a hash table for the specified keys and values, and ensures that neither keys nor
   * values are null. This method may update {@code alternatingKeysAndValues} if there are duplicate
   * keys. If so, the return value will indicate how many entries are still valid, and will also

  private static final long[] VALUES = {MIN_VALUE, -1L, 0L, 1L, MAX_VALUE};

  // We need to test that our method behaves like the JDK method.
  @SuppressWarnings("InlineMeInliner")
  public void testHashCode() {
    for (long value : VALUES) {
      assertWithMessage("hashCode for " + value)
          .that(Longs.hashCode(value))
          .isEqualTo(Long.hashCode(value));
    }
  }

  @Override
  public boolean containsValue(@Nullable Object value) {
    return delegate().containsValue(value);
  }

  @Override
  public @Nullable V get(@Nullable Object key) {
    return delegate().get(key);
  }

  @CanIgnoreReturnValue
  @Override
  public @Nullable V put(@ParametricNullness K key, @ParametricNullness V value) {
    return delegate().put(key, value);
  }

  @Override

     */
    NODE_AVAILABLE(7);

    private final int value;

    /**
     * Creates a new WitnessEventType with the specified value.
     *
     * @param value the numeric event type value
     */
    WitnessEventType(int value) {
        this.value = value;
    }

    /**
     * Gets the numeric event type value.
     *
     * @return the event type value
     */
    public int getValue() {

            final Pair<String, Float> pair = new Pair<>();
            final String[] values = s.split(":");
            if (values.length == 1) {
                pair.setFirst(values[0].trim());
                pair.setSecond(1.0f);
            } else if (values.length > 1) {
                pair.setFirst(values[0]);
                pair.setSecond(Float.parseFloat(values[1]));
            } else {
                return null;
            }