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

Examples of org.apache.maven.archiva.dependency.graph.functors.EdgeFromPredicate

174
175
176
177
178
179
180
181
     * @return the edges from the provided node.
     */
    public List getEdgesFrom( DependencyGraphNode node )
    {
        List ret = new ArrayList();
        CollectionUtils.select( this.edges, new EdgeFromPredicate( node.getArtifact() ), ret );
        return ret;
    }
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
        // Gather up the transient nodes from the DependencyGraph.
        List actualEdges = new ArrayList();

        DependencyGraphNode rootNode = graph.getRootNode();

        Predicate transientDep = NotPredicate.getInstance( new EdgeFromPredicate( rootNode.getArtifact() ) );
        Predicate edgeByExactScope = new EdgeExactScopePredicate( scope );
        Predicate transitiveEdgesByScopePredicate = AndPredicate.getInstance( transientDep, edgeByExactScope );

        CollectionUtils.select( graph.getEdges(), transitiveEdgesByScopePredicate, actualEdges );
View Full Code Here
51
52
53
54
55
56
57
    }

    public void discoverGraph( DependencyGraph graph )
    {
        super.discoverGraph( graph );
        rootEdgePredicate = new EdgeFromPredicate( graph.getRootNode() );
    }
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
        // Gather up the transient nodes from the DependencyGraph.
        List actualEdges = new ArrayList();

        DependencyGraphNode rootNode = graph.getRootNode();

        Predicate transientDep = NotPredicate.getInstance( new EdgeFromPredicate( rootNode.getArtifact() ) );
        Predicate edgeByExactScope = new EdgeExactScopePredicate( scope );
        Predicate transitiveEdgesByScopePredicate = AndPredicate.getInstance( transientDep, edgeByExactScope );

        CollectionUtils.select( graph.getEdges(), transitiveEdgesByScopePredicate, actualEdges );
View Full Code Here
51
52
53
54
55
56
57
    }

    public void discoverGraph( DependencyGraph graph )
    {
        super.discoverGraph( graph );
        rootEdgePredicate = new EdgeFromPredicate( graph.getRootNode() );
    }
View Full Code Here
174
175
176
177
178
179
180
181
     * @return the edges from the provided node.
     */
    public List getEdgesFrom( DependencyGraphNode node )
    {
        List ret = new ArrayList();
        CollectionUtils.select( this.edges, new EdgeFromPredicate( node.getArtifact() ), ret );
        return ret;
    }
View Full Code Here
275
276
277
278
279
280
281
282
283
284
285
        // Gather up the transient nodes from the DependencyGraph.
        ArrayList<DependencyGraphEdge> actualEdges = new ArrayList<DependencyGraphEdge>();

        DependencyGraphNode rootNode = graph.getRootNode();

        Predicate transientDep = NotPredicate.getInstance( new EdgeFromPredicate( rootNode.getArtifact() ) );
        Predicate edgeByExactScope = new EdgeExactScopePredicate( scope );
        Predicate transitiveEdgesByScopePredicate = AndPredicate.getInstance( transientDep, edgeByExactScope );

        CollectionUtils.select( graph.getEdges(), transitiveEdgesByScopePredicate, actualEdges );
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
        // Gather up the transient nodes from the DependencyGraph.
        List actualEdges = new ArrayList();

        DependencyGraphNode rootNode = graph.getRootNode();

        Predicate transientDep = NotPredicate.getInstance( new EdgeFromPredicate( rootNode.getArtifact() ) );
        Predicate edgeByExactScope = new EdgeExactScopePredicate( scope );
        Predicate transitiveEdgesByScopePredicate = AndPredicate.getInstance( transientDep, edgeByExactScope );

        CollectionUtils.select( graph.getEdges(), transitiveEdgesByScopePredicate, actualEdges );
View Full Code Here
174
175
176
177
178
179
180
181
     * @return the edges from the provided node.
     */
    public List<DependencyGraphEdge> getEdgesFrom( DependencyGraphNode node )
    {
        List<DependencyGraphEdge> ret = new ArrayList<DependencyGraphEdge>();
        CollectionUtils.select( this.edges, new EdgeFromPredicate( node.getArtifact() ), ret );
        return ret;
    }
View Full Code Here
50
51
52
53
54
55
56
    }

    public void discoverGraph( DependencyGraph graph )
    {
        super.discoverGraph( graph );
        rootEdgePredicate = new EdgeFromPredicate( graph.getRootNode() );
    }
View Full Code Here
TOP

Related Classes of org.apache.maven.archiva.dependency.graph.functors.EdgeFromPredicate

  • org.apache.maven.archiva.dependency.graph.AbstractDependencyGraphFactoryTestCase
  • org.apache.maven.archiva.dependency.graph.DependencyGraph
  • org.apache.maven.archiva.dependency.graph.DependencyGraphEdge
  • org.apache.maven.archiva.dependency.graph.tasks.UpdateScopesVisitor
    • 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.