/**
   * Returns a {@code Collector} that accumulates the input elements into a new {@code
   * ImmutableSortedSet}, ordered by the specified comparator.
   *
   * <p>If the elements contain duplicates (according to the comparator), only the first duplicate
   * in encounter order will appear in the result.
   *
   * @since 21.0
   */
  public static <E> Collector<E, ?, ImmutableSortedSet<E>> toImmutableSortedSet(

                    merged.put(key, element);
                }
            }

            target.setPluginRepositories(new ArrayList<>(merged.values()));
        }
    }

    /*
     * TODO: Whether duplicates should be removed looks like an option for the generated merger.
     */
    @Override
    protected void mergeBuildBase_Filters(

     * Displays the form for duplicating an existing file crawler configuration.
     *
     * @param id the ID of the file config to duplicate
     * @return HTML response for the file config creation form pre-populated with duplicated values
     */
    @Execute
    @Secured({ ROLE })
    public HtmlResponse duplicate(final String id) {
        saveToken();

                current.println('---')
                if (test.name != null && test.name.isBlank() == false) {
                    if(names.add(test.name) == false) {
                        throw new InvalidUserDataException("Duplicated snippet name '$test.name': $test")
                    }
                    current.println("\"$test.name\":")
                } else {
                    current.println("\"line_$test.start\":")
                }

	if v == nil {
		bugLogIf(ctx, errInvalidArgument)
		return errInvalidArgument
	}

	nv := make(textproto.MIMEHeader, len(v))
	for k, kv := range v {
		// Canonicalize all headers, to remove any duplicates.
		nv[http.CanonicalHeaderKey(k)] = kv
	}

	// Save all supported headers.
	for _, supportedHeader := range supportedHeaders {
		value, ok := nv[http.CanonicalHeaderKey(supportedHeader)]
		if ok {

   * input is not modified. The returned list is serializable and has random access.
   *
   * <p>Unlike {@link Sets#newTreeSet(Iterable)}, this method does not discard elements that are
   * duplicates according to the comparator. The sort performed is <i>stable</i>, meaning that such
   * elements will appear in the returned list in the same order they appeared in {@code elements}.
   *

     * Displays the form for duplicating an existing web crawler configuration.
     *
     * @param id the ID of the web config to duplicate
     * @return HTML response for the web config creation form pre-populated with duplicated values
     */
    @Execute
    @Secured({ ROLE })
    public HtmlResponse duplicate(final String id) {
        saveToken();
        return asEditHtml().useForm(CreateForm.class, op -> {

   * elements are the result of applying {@code elementFunction} to the inputs, with counts equal to
   * the result of applying {@code countFunction} to the inputs.
   *
   * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the first
   * occurrence in encounter order appears in the resulting multiset, with count equal to the sum of

			expectedValidationErr: nil,
		},
		{ // lifecycle config with rules having duplicate ID

   * elements are the result of applying {@code elementFunction} to the inputs, with counts equal to
   * the result of applying {@code countFunction} to the inputs.
   *
   * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the first
   * occurrence in encounter order appears in the resulting multiset, with count equal to the sum of