Examples of WalkDepthFirstSearch


Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

    private DependencyManagementApplier depManApplier = new DependencyManagementApplier();

    public void executeTask( DependencyGraph graph )
        throws GraphTaskException
    {
        DependencyGraphWalker walker = new WalkDepthFirstSearch();

        boolean done = false;
        int maxiters = 5;

        while ( !done )
        {
            resolveGraphTask.executeTask( graph );
            walker.visit( graph, depManApplier );

            if ( !depManApplier.hasCreatedNodes() || ( maxiters < 0 ) )
            {
                done = true;
                break;
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

        {
            throw new JspException( "Graph is null." );
        }

        TreeListVisitor treeListVisitor = new TreeListVisitor();
        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        walker.visit( graph, treeListVisitor );

        return treeListVisitor.getList();
    }
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

        {
            throw new ArchivaException( "Graph is unexpectedly null." );
        }

        TreeListVisitor treeListVisitor = new TreeListVisitor();
        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        walker.visit( graph, treeListVisitor );

        return treeListVisitor.getList();
    }
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "jdom:jdom:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "jaxen:jaxen:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( "jdom:jdom:1.0::jar", "jaxen:jaxen:1.0::jar" ) );

        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        WalkCollector walkCollector = new WalkCollector();
        walker.visit( graph, walkCollector );

        String expectedPath[] = new String[] {
            rootKey,
            "org.foo:foo-common:1.0::jar",
            "org.foo:foo-xml:1.0::jar",
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-common:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( rootKey, "org.foo:foo-xml:1.0::jar" ) );
        addEdgeAndNodes( graph, toEdge( "org.foo:foo-xml:1.0::jar", "xerces:xercesImpl:2.2.1::jar" ) );
        addEdgeAndNodes( graph, toEdge( "xerces:xercesImpl:2.2.1::jar", "xerces:xmlParserAPIs:2.2.1::jar" ) );

        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        WalkCollector walkCollector = new WalkCollector();
        walker.visit( graph, walkCollector );

        String expectedPath[] = new String[] {
            rootKey,
            "org.foo:foo-common:1.0::jar",
            "org.foo:foo-xml:1.0::jar",
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

        // introduce cyclic dep. intentional. should only result in walking to foo-xml once.
        addEdgeAndNodes( graph, toEdge( "xerces:xmlParserAPIs:2.2.1::jar", "org.foo:foo-xml:1.0::jar" ) );

        new FlagCyclicEdgesTask().executeTask( graph );

        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        WalkCollector walkCollector = new WalkCollector();
        ArtifactReference startRef = toArtifactReference( "org.foo:foo-xml:1.0::jar" );
        DependencyGraphNode startNode = new DependencyGraphNode( startRef );
        walker.visit( graph, startNode, walkCollector );

        String expectedPath[] = new String[] {
            "org.foo:foo-xml:1.0::jar",
            "jaxen:jaxen:1.0::jar",
            "xerces:xercesImpl:2.2.1::jar",
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

    private DependencyManagementApplier depManApplier = new DependencyManagementApplier();

    public void executeTask( DependencyGraph graph )
        throws GraphTaskException
    {
        DependencyGraphWalker walker = new WalkDepthFirstSearch();

        boolean done = false;
        int maxiters = 5;

        while ( !done )
        {
            resolveGraphTask.executeTask( graph );
            walker.visit( graph, depManApplier );

            if ( !depManApplier.hasCreatedNodes() || ( maxiters < 0 ) )
            {
                done = true;
                break;
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

public class FlagExcludedEdgesTask
    implements GraphTask
{
    public void executeTask( DependencyGraph graph )
    {
        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        FlagExcludedEdgesVisitor excludedEdgeResolver = new FlagExcludedEdgesVisitor();
        walker.visit( graph, excludedEdgeResolver );
    }
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

{

    public void executeTask( DependencyGraph graph )
    {
        Iterator it;
        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        RefineConflictsVisitor refineConflictsVisitor = new RefineConflictsVisitor();
       
        MultiValueMap depMap = new MultiValueMap();

        // Identify deps that need to be resolved.
        it = graph.getNodes().iterator();
        while ( it.hasNext() )
        {
            DependencyGraphNode node = (DependencyGraphNode) it.next();
            String key = DependencyGraphKeys.toManagementKey( node.getArtifact() );
            // This will add this node to the specified key, not replace a previous one.
            depMap.put( key, node );
        }

        // Process those depMap entries with more than 1 value.
        ToArtifactReferenceTransformer nodeToArtifact = new ToArtifactReferenceTransformer();

        it = depMap.entrySet().iterator();
        while ( it.hasNext() )
        {
            Map.Entry entry = (Entry) it.next();
            Collection nodes = (Collection) entry.getValue();
            if ( nodes.size() > 1 )
            {
                List conflictingArtifacts = new ArrayList();
                conflictingArtifacts.addAll( nodes );
                CollectionUtils.transform( conflictingArtifacts, nodeToArtifact );

                refineConflictsVisitor.resetConflictingArtifacts();
                refineConflictsVisitor.addAllConflictingArtifacts( conflictingArtifacts );
                walker.visit( graph, refineConflictsVisitor );
            }
        }
    }
View Full Code Here

Examples of org.apache.maven.archiva.dependency.graph.walk.WalkDepthFirstSearch

    implements GraphTask
{
    public void executeTask( DependencyGraph graph )
        throws GraphTaskException
    {
        DependencyGraphWalker walker = new WalkDepthFirstSearch();
        UpdateScopesVisitor updateScopes = new UpdateScopesVisitor();
        walker.visit( graph, updateScopes );
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.