* ValueGraph#adjacentNodes(Object)}, {@link ValueGraph#predecessors(Object)}, {@link
   * ValueGraph#successors(Object)} and {@link ValueGraph#incidentEdges(Object)}.
   *
   * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
   * immutable graphs, this value is ignored; they always have a {@link ElementOrder#stable()
   * stable} order.

 *
 * The primary entry point is the {@link #execute()} method, which encapsulates
 * the behavior of the Mojo and serves as the integration point with Maven. This
 * method may throw an {@link Exception} to signal any issues that prevent
 * successful execution of the Mojo.
 *
 * <p>
 * Annotations:
 * </p>
 * <ul>
 * <li>{@link Experimental}: Indicates that this interface or its implementation

        }
    }

    /**
     * Creates a {@link Schema} using the specified {@link SchemaFactory}.
     *
     * @param factory
     *            {@link SchemaFactory}. Must not be {@literal null}.
     * @param schema
     *            {@link Source} to load the schema. Must not be {@literal null}.
     * @return {@link Schema}
     */

     * @param activeProjectSelectors A {@link List} of project selectors that must be activated.
     * @deprecated Use {@link #activateOptionalProject(String)} or {@link #activateRequiredProject(String)} instead.
     */
    @Deprecated
    public void overwriteActiveProjects(List<String> activeProjectSelectors) {
        List<ProjectActivationSettings> projects =

        }

        @Test
        @DisplayName("Should set link")
        void testSetLink() {
            String link = "\\\\server\\share\\link";

            // Test with mock
            doNothing().when(mockReferralData).setLink(link);
            mockReferralData.setLink(link);
            verify(mockReferralData, times(1)).setLink(link);

            // Test with concrete implementation

 * <li>{@link #roleFieldName} - Role field name.</li>
 * <li>{@link #langFieldName} - Language field name.</li>
 * <li>{@link #badWords} - List of bad words.</li>
 * <li>{@link #parallel} - Flag for parallel processing.</li>
 * <li>{@link #readingConverter} - Reading converter.</li>
 * <li>{@link #contentsReadingConverter} - Contents reading converter.</li>
 * <li>{@link #normalizer} - Normalizer.</li>
 * <li>{@link #analyzer} - Suggest analyzer.</li>

     * {@link RemoteRepository#getUrl()} root.
     *
     * @throws RuntimeException If PUT fails for any reason.
     */
    void put(@Nonnull Path source, @Nonnull URI relativeTarget);

    /**
     * PUTs the source byte array to target URI. The target MUST BE relative from the
     * {@link RemoteRepository#getUrl()} root.
     *

   * that this method <i>also</i> throws if this future is not done.
   *
   * <p>This method computes its result based on the internal state of {@link AbstractFuture}, so it
   * does not necessarily return the same result as {@link #get()} if {@link #get()} has been
   * overridden. Thus, it should be called only on instances of {@link Trusted} or from within
   * {@link #get()} itself.

     * Creates and returns a new instance of {@link ArrayDeque}.
     *
     * @param <E> the element type of {@link ArrayDeque}
     * @return a new instance of {@link ArrayDeque}
     * @see ArrayDeque#ArrayDeque()
     */
    public static <E> ArrayDeque<E> newArrayDeque() {
        return new ArrayDeque<>();
    }

    /**
     * Creates and returns a new instance of {@link ArrayDeque}.
     *

    /** Array of {@link Iterator}s. */
    protected final Iterator<E>[] iterators;

    /** Index of the currently iterated {@link Iterator}. */
    protected int index;

    /**
     * Returns an {@link Iterable} that wraps a {@link MultiIterator} for use in a for-each statement.
     *
     * @param <E> the element type
     * @param iterables the array of {@link Iterable} (must not be {@literal null})