java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...

     * </ul>
     * @throws DuplicateProjectException if any projects are duplicated by id
     */
    // MAVENAPI FIXME: the DAG used is NOT only used to represent the dependency relation,
    // but also for <parent>, <build><plugin>, <reports>. We need multiple DAG's
    // since a DAG can only handle 1 type of relationship properly.
    // Use case:  This is detected as a cycle:

java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...

java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...

java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...

java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...

protected boolean isS(char); protected String printable(char); protected String printable(String); static void <clinit>(); } org/codehaus/plexus/util/dag/DAG.class package org.codehaus.plexus.util.dag; public synchronized class DAG implements Cloneable, java.io.Serializable { private java.util.Map vertexMap; private java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws...

 * This is an inner class, as it must be able to call readRawModel()
 *
 * @since 4.0.0
 */
class DefaultModelTransformerContextBuilder implements ModelTransformerContextBuilder {
    private final Graph dag = new Graph();
    private final DefaultModelBuilder defaultModelBuilder;
    private final DefaultModelTransformerContext context;

    private final Map<String, Set<ModelSource>> mappedSources = new ConcurrentHashMap<>(64);

    // reachable from files that will be compiled, and include files these inline accessors
    // to the set of files that will be compiled (and do the same for these files recursively).
    // As it's basically a DAG traversal, we can keep a queue instead of making recursive calls.
    val allFiles = this
    val filesQueueToAnalyze = ArrayDeque(allFiles)

java.util.List getSuccessorLabels(String); } org/codehaus/plexus/util/dag/TopologicalSorter.class package org.codehaus.plexus.util.dag; public synchronized class TopologicalSorter { private static final Integer NOT_VISTITED; private static final Integer VISITING; private static final Integer VISITED; public void TopologicalSorter(); public static java.util.List sort(DAG); public static java.util.List sort(Vertex); private static java.util.List dfs(DAG); private static boolean isNotVisited(Vertex, java.util.Map);...