private final Map<Key<?>, Object> provided = new HashMap<>();
    }

    private final ThreadLocal<LinkedList<ScopeState>> values = new ThreadLocal<>();

    public MojoExecutionScope() {}

    public void enter() {
        LinkedList<ScopeState> stack = values.get();
        if (stack == null) {
            stack = new LinkedList<>();
            values.set(stack);
        }
        stack.addFirst(new ScopeState());
    }

 */
package org.apache.maven.internal.impl.model;

import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Set;

class Graph {

    final Map<String, Set<String>> graph = new LinkedHashMap<>();

        return visitAll(vertices.values(), new HashMap<>(), new ArrayList<>());
    }

    List<String> findCycle(Vertex vertex) {
        return visitCycle(Collections.singleton(vertex), new HashMap<>(), new LinkedList<>());
    }

    private static List<String> visitAll(
            Collection<Vertex> children, Map<Vertex, DfsState> stateMap, List<String> list) {
        for (Vertex v : children) {

 * under the License.
 */
package org.apache.maven.artifact.resolver;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;

import org.apache.maven.artifact.Artifact;
import org.apache.maven.artifact.repository.ArtifactRepository;
import org.apache.maven.artifact.resolver.filter.ArtifactFilter;

introducesCycle(Vertex, java.util.Map); public static java.util.List introducesCycle(Vertex); private static boolean isNotVisited(Vertex, java.util.Map); private static boolean isVisiting(Vertex, java.util.Map); private static boolean dfsVisit(Vertex, java.util.LinkedList, java.util.Map); 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...

introducesCycle(Vertex, java.util.Map); public static java.util.List introducesCycle(Vertex); private static boolean isNotVisited(Vertex, java.util.Map); private static boolean isVisiting(Vertex, java.util.Map); private static boolean dfsVisit(Vertex, java.util.LinkedList, java.util.Map); 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...

import java.lang.reflect.Array;
import java.lang.reflect.Field;
import java.security.AccessController;
import java.security.PrivilegedAction;
import java.util.ArrayList;
import java.util.Collection;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.WeakHashMap;

import org.apache.maven.model.Model;
import org.apache.maven.project.ProjectBuilderConfiguration;

Implementation-Version: 1.0.4 org/codehaus/plexus/util/xml/PrettyPrintXMLWriter.class package org.codehaus.plexus.util.xml; public synchronized class PrettyPrintXMLWriter implements XMLWriter { private java.io.PrintWriter writer; private java.util.LinkedList elementStack; private boolean tagInProgress; private int depth; private String lineIndenter; private String encoding; private String docType; private boolean readyForNewLine; private boolean tagIsEmpty; public void PrettyPrintXMLWriter(java.io.PrintWriter,...

introducesCycle(Vertex, java.util.Map); public static java.util.List introducesCycle(Vertex); private static boolean isNotVisited(Vertex, java.util.Map); private static boolean isVisiting(Vertex, java.util.Map); private static boolean dfsVisit(Vertex, java.util.LinkedList, java.util.Map); 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...

        return visitAll(vertices.values(), new HashMap<>(), new ArrayList<>());
    }

    List<String> findCycle(Vertex vertex) {
        return visitCycle(Collections.singleton(vertex), new HashMap<>(), new LinkedList<>());
    }

    private static List<String> visitAll(
            Collection<Vertex> children, Map<Vertex, DfsState> stateMap, List<String> list) {
        for (Vertex v : children) {