Package org.apache.maven.archiva.dependency.graph

Examples of org.apache.maven.archiva.dependency.graph.DependencyGraphNode

67
68
69
70
71
72
73
74
75
76
77
78
79
80
    }

    public void finishNode( DependencyGraphNode node )
    {
        super.finishNode( node );
        DependencyGraphNode pathNode = (DependencyGraphNode) nodePath.pop();
        if ( !node.equals( pathNode ) )
        {
            String pathNodeKey = ArtifactReference.toKey( pathNode.getArtifact() );
            String finishNodeKey = ArtifactReference.toKey( node.getArtifact() );
            throw new IllegalStateException( "Encountered bad visitor state.  Expected finish on node " + pathNodeKey
                + ", but instead got notified of node " + finishNodeKey );
        }
    }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
        copyEdge( edge );
    }

    public void copyEdge( DependencyGraphEdge edge )
    {
        DependencyGraphNode nodeFrom = graph.getNode( edge.getNodeFrom() );
        DependencyGraphNode nodeTo = graph.getNode( edge.getNodeTo() );

        this.copiedGraph.addNode( nodeFrom );
        this.copiedGraph.addNode( nodeTo );
        this.copiedGraph.addEdge( edge );
    }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphNode )
        {
            DependencyGraphNode node = (DependencyGraphNode) object;
            satisfies = ref.equals( node.getArtifact() );
        }

        return satisfies;
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphNode )
        {
            DependencyGraphNode node = (DependencyGraphNode) object;
            satisfies = CollectionUtils.isEmpty( graph.getEdgesTo( node ) );
        }

        return satisfies;
    }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
    public boolean evaluate( Object object )
    {
        boolean satisfies = false;
        if ( object instanceof DependencyGraphNode )
        {
            DependencyGraphNode node = (DependencyGraphNode) object;
            satisfies = node.isFromParent();
        }
        return satisfies;
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
        boolean done = false;

        while ( !done )
        {
            DependencyGraphNode node = findUnresolvedNode( graph );
            if ( node == null )
            {
                done = true;
                break;
            }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
    }

    public void finishNode( DependencyGraphNode node )
    {
        super.finishNode( node );
        DependencyGraphNode pathNode = (DependencyGraphNode) nodePath.pop();
        if ( !node.equals( pathNode ) )
        {
            String pathNodeKey = ArtifactReference.toKey( pathNode.getArtifact() );
            String finishNodeKey = ArtifactReference.toKey( node.getArtifact() );
            throw new IllegalStateException( "Encountered bad visitor state.  Expected finish on node " + pathNodeKey
                + ", but instead got notified of node " + finishNodeKey );
        }
    }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
        copyEdge( edge );
    }

    public void copyEdge( DependencyGraphEdge edge )
    {
        DependencyGraphNode nodeFrom = graph.getNode( edge.getNodeFrom() );
        DependencyGraphNode nodeTo = graph.getNode( edge.getNodeTo() );

        this.copiedGraph.addNode( nodeFrom );
        this.copiedGraph.addNode( nodeTo );
        this.copiedGraph.addEdge( edge );
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
        boolean done = false;

        while ( !done )
        {
            DependencyGraphNode node = findUnresolvedNode( graph );
            if ( node == null )
            {
                done = true;
                break;
            }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
    private void visitEdge( DependencyGraph graph, DependencyGraphEdge e, DependencyGraphVisitor visitor )
    {
        visitor.discoverEdge( e );

        DependencyGraphNode node = graph.getNode( e.getNodeTo() );

        if ( getNodeVisitState( node ) == UNSEEN )
        {
            setNodeVisitState( node, PROCESSING );
        }
View Full Code Here
TOP

Related Classes of org.apache.maven.archiva.dependency.graph.DependencyGraphNode

  • org.apache.maven.archiva.dependency.graph.functors.NodeFromParentPredicate
  • org.apache.maven.archiva.dependency.graph.functors.NodePredicate
  • org.apache.maven.archiva.dependency.graph.functors.OrphanedNodePredicate
  • org.apache.maven.archiva.dependency.graph.functors.UnresolvedGraphNodePredicate
  • org.apache.maven.archiva.dependency.graph.tasks.DependencyManagementApplier
  • org.apache.maven.archiva.dependency.graph.tasks.DependencyManagementStack
  • org.apache.maven.archiva.dependency.graph.tasks.DependencyManagementStackTest
  • org.apache.maven.archiva.dependency.graph.tasks.FlagExcludedEdgesVisitor
  • org.apache.maven.archiva.dependency.graph.tasks.GraphCopier
  • org.apache.maven.archiva.dependency.graph.tasks.RefineConflictsTask
    • Copyright © 2018 www.massapicom. 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.