}
  }

  // TODO: test adding element of wrong type

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

   *
   * @param anElement one of the elements the set should contain
   * @param otherElements the rest of the elements the set should contain
   * @return an immutable set containing those elements, minus duplicates
   */
  public static <E extends Enum<E>> ImmutableSet<E> immutableEnumSet(
      E anElement, E... otherElements) {
    return ImmutableEnumSet.asImmutable(EnumSet.of(anElement, otherElements));
  }

  /**

 * During this process only the most relevant version of each artifact
 * (based on group ID and artifact ID) is retained, resolving conflicts and eliminating duplicates to ensure
 * that each dependency is included only once in the final build.</p>
 *
 * <p><dfn>Dependency resolution</dfn> is the process of collecting dependencies, flattening the result graph,

   * @param columnKeys column keys that may be stored in the generated table
   * @throws NullPointerException if any of the provided keys is null
   * @throws IllegalArgumentException if {@code rowKeys} or {@code columnKeys} contains duplicates
   *     or if exactly one of {@code rowKeys} or {@code columnKeys} is empty.
   */
  public static <R, C, V> ArrayTable<R, C, V> create(
      Iterable<? extends R> rowKeys, Iterable<? extends C> columnKeys) {

     */
    public static PathMappingHelper getPathMappingHelper() {
        return getComponent(PATH_MAPPING_HELPER);
    }

    /**
     * Gets the duplicate host helper component.
     * @return The duplicate host helper.
     */
    public static DuplicateHostHelper getDuplicateHostHelper() {
        return getComponent(DUPLICATE_HOST_HELPER);
    }

    /**

	for _, zep := range *l {
		for _, ep := range zep.Endpoints {
			existSet.Add(ep.String())
		}
	}
	// Validate if there are duplicate endpoints across serverPools
	for _, ep := range zeps.Endpoints {
		if existSet.Contains(ep.String()) {
			return fmt.Errorf("duplicate endpoints found")
		}
	}
	*l = append(*l, zeps)
	return nil
}

// Localhost - returns the local hostname from list of endpoints

                if (field.getType().equals(HtmlNext.class)) {
                    HtmlNext htmlNext = (HtmlNext) field.get(null);
                    String path = htmlNext.getRoutingPath();
                    assertFalse("Duplicate path found: " + path + " in field " + field.getName(), paths.contains(path));
                    paths.add(path);
                }
            }
        }
        assertTrue("Should have unique paths", paths.size() > 0);

   */

  /*
   * These generators also rely on consecutive integer inputs (not necessarily in order, but no
   * holes).
   */

  // SetCreationTester has some tests that pass in duplicates. Dedup them.
  private static <E extends Comparable<? super E>> SortedSet<E> nullCheckedTreeSet(E[] elements) {
    SortedSet<E> set = newTreeSet();
    for (E element : elements) {

        queryContext = new QueryContext("test", true);
        queryContext.addHighlightedQuery("text1");
        queryContext.addHighlightedQuery("text2");
        queryContext.addHighlightedQuery("text1"); // Duplicate

        Set<String> highlightedSet = (Set<String>) getMockRequest().getAttribute(Constants.HIGHLIGHT_QUERIES);
        assertNotNull(highlightedSet);
        assertEquals(2, highlightedSet.size());

            decodedContext.decode(buffer, 0, encoded);

            assertArrayEquals(ciphers, decodedContext.getCiphers());
        }

        @Test
        @DisplayName("Should handle duplicate ciphers")
        void testDuplicateCiphers() throws SMBProtocolDecodingException {
            int[] ciphers = { EncryptionNegotiateContext.CIPHER_AES128_CCM, EncryptionNegotiateContext.CIPHER_AES128_CCM,