Examples of org.apache.maven.shared.dependency.tree.DependencyNode.accept()

Package org.apache.maven.shared.dependency.tree

Class org.apache.maven.shared.dependency.tree.DependencyNode

Examples of org.apache.maven.shared.dependency.tree.DependencyNode.accept()

org.apache.maven.shared.dependency.tree.DependencyNode.accept()
Applies the specified dependency node visitor to this dependency node and its children. @param visitor the dependency node visitor to use @return the visitor result of ending the visit to this node @since 1.1

            public boolean include(Artifact artifact) {
                return true;
            }
               
           }, new DefaultArtifactCollector());
           tree.accept(new DependencyNodeVisitor() {
                public boolean endVisit(DependencyNode node) {
                    // we want the next sibling too
                    return true;
                }
                public boolean visit(DependencyNode node) {

View Full Code Here

            public boolean include(Artifact artifact) {
                return true;
            }


        }, new DefaultArtifactCollector());
        tree.accept(new DependencyNodeVisitor() {
            public boolean endVisit(DependencyNode node) {
                // we want the next sibling too
                return true;
            }

View Full Code Here

        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 );

View Full Code Here

        rootNode.accept( firstPassVisitor );


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


        rootNode.accept( visitor );


        FileWriter writer = null;
        try
        {
            Artifact artifact =

View Full Code Here

            public boolean include(Artifact artifact) {
                return true;
            }


        }, collector);
        tree.accept(new DependencyNodeVisitor() {
            public boolean endVisit(DependencyNode node) {
                // we want the next sibling too
                return true;
            }

View Full Code Here

        i18n = (I18N) helper.getComponent(I18N.class);
      }
      DependencyNode node = getNode(helper);
      MavenProject project = (MavenProject) helper.evaluate("${project}");
      DependencyVersionMap visitor = new DependencyVersionMap(project.getArtifact().isRelease(), log);
      node.accept(visitor);
      List<CharSequence> errorMsgs = new ArrayList<CharSequence>();
      errorMsgs.addAll(getConvergenceErrorMsgs(visitor.getConflictedVersionNumbers()));
      for (CharSequence errorMsg : errorMsgs) {
        log.error(errorMsg);
      }

View Full Code Here

      // mode verbose OFF : do not show the same lib many times
      DependencyNodeFilter filter = StateDependencyNodeFilter.INCLUDED;


      CollectingDependencyNodeVisitor collectingVisitor = new CollectingDependencyNodeVisitor();
      DependencyNodeVisitor firstPassVisitor = new FilteringDependencyNodeVisitor(collectingVisitor, filter);
      root.accept(firstPassVisitor);


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


      root.accept(visitor);

View Full Code Here

      root.accept(firstPassVisitor);


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


      root.accept(visitor);


    } catch (DependencyTreeBuilderException e) {
      throw new SonarException("Can not load the graph of dependencies of the project " + project.getKey(), e);
    }
  }

View Full Code Here

            public boolean include(Artifact artifact) {
                return true;
            }


        }, new DefaultArtifactCollector());
        tree.accept(new DependencyNodeVisitor() {
            public boolean endVisit(DependencyNode node) {
                // we want the next sibling too
                return true;
            }

View Full Code Here

            public boolean include(Artifact artifact) {
                return true;
            }
               
           }, new DefaultArtifactCollector());
           tree.accept(new DependencyNodeVisitor() {
                public boolean endVisit(DependencyNode node) {
                    // we want the next sibling too
                    return true;
                }
                public boolean visit(DependencyNode node) {

View Full Code Here

0 1 2 3 4

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.