Examples of DependencyGraphEdge

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

50
51
52
53
54
55
56
57
58
59
60
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) object;
            satisfies = StringUtils.equals( edge.getScope(), scope );
        }

        return satisfies;
    }
View Full Code Here

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

36
37
38
39
40
41
42
43
44
45
46
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) object;
            satisfies = edge.isDisabled();
        }

        return satisfies;
    }
View Full Code Here

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

43
44
45
46
47
48
49
50
51
52
53
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) object;
            satisfies = ( edge.getNodeFrom().equals( nodeRef ) || edge.getNodeTo().equals( nodeRef ) );
        }

        return satisfies;
    }
View Full Code Here

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

43
44
45
46
47
48
49
50
51
52
53
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) object;
            satisfies = DependencyScope.isWithinScope( edge.getScope(), scope );
        }

        return satisfies;
    }
View Full Code Here

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

43
44
45
46
47
48
49
50
51
52
53
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) object;
            satisfies = ( edge.isDisabled() && ( edge.getDisabledType() == DependencyGraph.DISABLED_EXCLUDED ) );
        }

        return satisfies;
    }
View Full Code Here

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

43
44
45
46
47
48
49
50
51
52
53
    {
        boolean satisfies = false;

        if ( object instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) object;
            satisfies = edge.getNodeTo().equals( nodeRef );
        }

        return satisfies;
    }
View Full Code Here

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

198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
        List edgesFrom = currentGraph.getEdgesFrom( node );
        Iterator it = edgesFrom.iterator();
        while ( it.hasNext() )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) it.next();
            if ( this.conflictingArtifacts.contains( edge.getNodeTo() ) )
            {
                String nodeKey = DependencyGraphKeys.toKey( edge.getNodeTo() );
                // Check for existing NodeLocation with same key
                NodeLocation nodeloc = (NodeLocation) this.foundNodesMap.get( nodeKey );

                if ( ( nodeloc == null ) || ( currentDepth < nodeloc.depth ) )
                {
                    nodeloc = new NodeLocation( edge.getNodeTo(), edge, currentDepth );
                    this.foundNodesMap.put( nodeKey, nodeloc );
                }
            }
        }
    }
View Full Code Here

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

102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
        Iterator edges;
        // First dive down edges.
        edges = graph.getEdgesFrom( node ).iterator();
        while ( edges.hasNext() )
        {
            DependencyGraphEdge e = (DependencyGraphEdge) edges.next();
            if ( this.edgePredicate.evaluate( e ) )
            {
                visitEdge( graph, e, visitor );
            }
        }

        // Next move down edges.
        edges = graph.getEdgesFrom( node ).iterator();
        while ( edges.hasNext() )
        {
            DependencyGraphEdge e = (DependencyGraphEdge) edges.next();

            if ( this.edgePredicate.evaluate( e ) )
            {
                DependencyGraphNode nodeTo = graph.getNode( e.getNodeTo() );
                Integer state = getNodeVisitState( nodeTo );
                if ( ( state == UNSEEN ) || ( state == PROCESSING ) )
                {
                    visitNode( graph, nodeTo, visitor );
                }
View Full Code Here

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

107
108
109
110
111
112
113
114
115
116
117
        visitor.discoverNode( node );

        Iterator edges = graph.getEdgesFrom( node ).iterator();
        while ( edges.hasNext() )
        {
            DependencyGraphEdge e = (DependencyGraphEdge) edges.next();
            if ( this.edgePredicate.evaluate( e ) )
            {
                visitEdge( graph, e, visitor );
            }
        }
View Full Code Here

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

48
49
50
51
52
53
54
55
56
57
58
59
60
            return DependencyGraphKeys.toKey( ((DependencyGraphNode) input).getArtifact() );
        }

        if ( input instanceof DependencyGraphEdge )
        {
            DependencyGraphEdge edge = (DependencyGraphEdge) input;
            // Potentially Confusing, but this is called "To"KeyTransformer after all.
            return DependencyGraphKeys.toKey( edge.getNodeTo() );
        }

        if ( input instanceof ArtifactReference )
        {
            return DependencyGraphKeys.toKey( ((ArtifactReference) input) );
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.