Examples of FilteringDependencyNodeVisitor

org.apache.maven.shared.dependency.graph.traversal.FilteringDependencyNodeVisitor
A dependency node visitor that filters nodes and delegates to another visitor. @author Mark Hobson @version $Id: FilteringDependencyNodeVisitor.java 1351166 2012-06-17 21:15:54Z hboutemy $ @since 1.1
org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor
A dependency node visitor that filters nodes and delegates to another visitor. @author Mark Hobson @version $Id: FilteringDependencyNodeVisitor.java 1100703 2011-05-08 08:27:33Z hboutemy $ @since 1.1

Examples of org.apache.maven.shared.dependency.graph.traversal.FilteringDependencyNodeVisitor

        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );


        return writer.toString();

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.traversal.FilteringDependencyNodeVisitor

        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );


        return writer.toString();

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.traversal.FilteringDependencyNodeVisitor

        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );


        return writer.toString();

View Full Code Here

Examples of org.apache.maven.shared.dependency.graph.traversal.FilteringDependencyNodeVisitor

        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );


        return writer.toString();

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor

            // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
            DependencyNodeVisitor visitor = new BuildingDependencyNodeVisitor( nodeVisitor );


            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor =
                new FilteringDependencyNodeVisitor( collectingVisitor, StateDependencyNodeFilter.INCLUDED );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter =
                new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


            rootNode.accept( visitor );
        }
        catch ( ArtifactResolutionException e )
        {

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor

        DependencyNodeFilter filter = createDependencyNodeFilter();


        if ( filter != null )
        {
            CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
            DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, filter );
            rootNode.accept( firstPassVisitor );


            DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
            visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );
        }


        rootNode.accept( visitor );


        return writer.toString();

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor

        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
        DependencyNodeVisitor firstPassVisitor =
            new FilteringDependencyNodeVisitor( collectingVisitor, StateDependencyNodeFilter.INCLUDED );
        rootNode.accept( firstPassVisitor );


        DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
        visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


        rootNode.accept( visitor );


        FileWriter writer = null;
        try

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor

        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
        DependencyNodeVisitor firstPassVisitor =
            new FilteringDependencyNodeVisitor( collectingVisitor, StateDependencyNodeFilter.INCLUDED );
        rootNode.accept( firstPassVisitor );


        DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
        visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


        rootNode.accept( visitor );


        FileWriter writer = null;
        try

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor

    /** Visits a node (and all dependencies) to see if it contains duplicate scala versions */
    private void checkArtifactForScalaVersion(VersionNumber requiredScalaVersion, DependencyNode rootNode) throws Exception {
        final CheckScalaVersionVisitor visitor = new CheckScalaVersionVisitor(requiredScalaVersion, getLog(), getScalaOrganization());


        CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
        DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor( collectingVisitor, createScalaDistroDependencyFilter() );
        rootNode.accept( firstPassVisitor );


        DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
        DependencyNodeVisitor filteredVisitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


        rootNode.accept( filteredVisitor );


        if(visitor.isFailed()) {
            visitor.logScalaDependents();

View Full Code Here

Examples of org.apache.maven.shared.dependency.tree.traversal.FilteringDependencyNodeVisitor

        // TODO: remove the need for this when the serializer can calculate last nodes from visitor calls only
        visitor = new BuildingDependencyNodeVisitor( visitor );


        CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
        DependencyNodeVisitor firstPassVisitor =
            new FilteringDependencyNodeVisitor( collectingVisitor, StateDependencyNodeFilter.INCLUDED );
        rootNode.accept( firstPassVisitor );


        DependencyNodeFilter secondPassFilter = new AncestorOrSelfDependencyNodeFilter( collectingVisitor.getNodes() );
        visitor = new FilteringDependencyNodeVisitor( visitor, secondPassFilter );


        rootNode.accept( visitor );


        FileWriter writer = null;
        try

View Full Code Here

0 1

TOP

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.