* returns a {@link SortedSet}, instead of the {@link Collection} specified in the {@link
   * Multimap} interface.
   *
   * <p>Any duplicates in {@code values} will be stored in the multimap once.
   */
  @CanIgnoreReturnValue
  @Override
  public SortedSet<V> replaceValues(@ParametricNullness K key, Iterable<? extends V> values) {

    assertFalse(getMultiset().retainAll(singleton(e0())));
    expectContents(contents);
  }

  /**
   * Returns {@link Method} instances for the remove tests that assume multisets support duplicates
   * so that the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection
  public static List<Method> getRemoveDuplicateInitializingMethods() {

    assertFalse(getMultiset().retainAll(singleton(e0())));
    expectContents(contents);
  }

  /**
   * Returns {@link Method} instances for the remove tests that assume multisets support duplicates
   * so that the test of {@code Multisets.forSet()} can suppress them.
   */
  @J2ktIncompatible
  @GwtIncompatible // reflection
  public static List<Method> getRemoveDuplicateInitializingMethods() {

     * q-quantile.
     *
     * @param indexes the quantile indexes, each of which must be in the inclusive range [0, q] for
     *     q-quantiles; the order of the indexes is unimportant, duplicates will be ignored, and the
     *     set will be snapshotted when this method is called
     * @throws IllegalArgumentException if {@code indexes} is empty
     */
    public ScaleAndIndexes indexes(int... indexes) {

        }
      }
    }
  }

  /**
   * If the graph is undirected, each unordered [node, otherNode] pair (except self-loops) will be
   * visited twice if there is an edge connecting them. To avoid returning duplicate {@link
   * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint
   * pairs, we skip if the "other node" is in the visited set, as shown below:
   *
   * <pre>

    return C2 * Integer.rotateLeft(hashCode * C1, 15);
  }

  private boolean checkFilter(int c) {
    return ((filter >> c) & 1) == 1;
  }

  // This is all essentially copied from ImmutableSet, but we have to duplicate because
  // of dependencies.

  // Represents how tightly we can pack things, as a maximum.
  private static final double DESIRED_LOAD_FACTOR = 0.5;

  /**

            "The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
            "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",
            "The parameter is incorrect.", "Too many Uids active on this session.",

            "The process cannot access the file because another process has locked a portion of the file.", "The disk is full.",
            "A duplicate name exists on the network.", "The network name cannot be found.", "ERRnomoreconn.", "The file exists.",
            "The parameter is incorrect.", "Too many Uids active on this session.",

                                <c:if test="${editable}"><la:link styleClass="btn btn-info"
                                                                  href="/admin/webconfig/duplicate/${f:u(id)}">
                                    <i class="fa fa-copy" aria-hidden="true"></i>
                                    <la:message key="labels.crud_button_duplicate"/>
                                </la:link></c:if>

                                <c:if test="${editable}"><la:link styleClass="btn btn-info"
                                                                  href="/admin/fileconfig/duplicate/${f:u(id)}">
                                    <i class="fa fa-copy" aria-hidden="true"></i>
                                    <la:message key="labels.crud_button_duplicate"/>
                                </la:link></c:if>