*
 * <h4>Limited Inference for 4.0.0 Models (Maven 3.x POMs)</h4>
 * <ul>
 *   <li><strong>Child GroupId Removal</strong>: Removes child {@code <groupId>} when it matches parent groupId</li>
 *   <li><strong>Child Version Removal</strong>: Removes child {@code <version>} when it matches parent version</li>
 * </ul>
 *
 * <h4>Full Inference for 4.1.0+ Models</h4>
 * <ul>

     *       </ul></li>
     *   <li>If the configured target path is empty:
     *       <ul><li>Return the output directory as-is</li></ul></li>
     *   <li>If the configured target path is relative (e.g., {@code META-INF/resources}):
     *       <ul><li>Resolve it against the output directory using {@code outputDirectory.resolve(targetPath)}</li></ul></li>
     * </ol>
     * <p>

     * <ul>
     *   <li>The project's artifacts ({@link Project#getArtifacts()}):
     *     <ul>
     *       <li>The POM artifact (always present)</li>
     *       <li>The main project artifact (if applicable based on packaging)</li>
     *     </ul>
     *   </li>
     *   <li>All attached artifacts in the order they were attached</li>
     * </ul>

   *
   * <ul>
   *   <li>{@code view.equals(view)} evaluates to {@code true} (but any other {@code equals()}
   *       expression involving {@code view} will throw)
   *   <li>{@code hashCode()} does not throw
   *   <li>if {@code node} is re-added to the network after having been removed, {@code view}'s
   *       behavior is undefined
   * </ul>
   *

 * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of
 * terms</a>):
 *
 * <ul>
 *   <li>directed graphs
 *   <li>undirected graphs
 *   <li>graphs that do/don't allow self-loops
 *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
 * </ul>
 *
 * <p>{@code Graph} explicitly does not support parallel edges, and forbids implementations or

 * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of
 * terms</a>):
 *
 * <ul>
 *   <li>directed graphs
 *   <li>undirected graphs
 *   <li>graphs that do/don't allow self-loops
 *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
 * </ul>
 *
 * <p>{@code Graph} explicitly does not support parallel edges, and forbids implementations or

            return isTypeOf(parameterizedType.getRawType(), clazz);
        }
        return false;
    }

    /**
     * Returns the raw class of the specified type.
     * <ul>
     * <li>If <code>type</code> is a <code>Class</code>, it is returned as-is.</li>
     * <li>If <code>type</code> is a parameterized type, its raw type is returned.</li>

 * terms</a>):
 *
 * <ul>
 *   <li>directed graphs
 *   <li>undirected graphs
 *   <li>graphs that do/don't allow self-loops
 *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
 *   <li>graphs whose edges have associated values
 * </ul>
 *
 * <p>{@code ValueGraph}, as a subtype of {@code Graph}, explicitly does not support parallel edges,

 * It allows adding, retrieving, and deleting settings based on keys and values.
 *
 * <p>Constructor:
 * <ul>
 * <li>{@link #ArraySettings(SuggestSettings, Client, String, String)}: Initializes the ArraySettings with the provided settings, client, index name, and settings ID.</li>
 * </ul>
 *
 * <p>Public Methods:
 * <ul>
 * <li>{@link #get(String)}: Retrieves an array of values associated with the specified key.</li>

 * </ul>
 *
 * <p>References:</p>
 * <ul>
 * <li><a href="https://datatracker.ietf.org/doc/html/rfc9309">RFC 9309 - Robots Exclusion Protocol</a></li>
 * <li><a href="https://developers.google.com/search/docs/crawling-indexing/robots/robots_txt">
 * Google's robots.txt Specification</a></li>
 * </ul>
 *
 * @author bowez
 * @author shinsuke
 *
 */