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

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

216
217
218
219
220
221
222
223
224
225
226
            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;
                }
                public boolean visit(DependencyNode node) {
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
            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
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
     */
    private String serializeDependencyTree( DependencyNode rootNode )
    {
        StringWriter writer = new StringWriter();

        DependencyNodeVisitor visitor = getSerializingDependencyNodeVisitor( writer );

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

        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 );
        }
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
            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
288
289
290
291
292
293
294
295
296
297
298
            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
128
129
130
131
132
133
134
135
136
137
138
    final Set<Artifact> resolvedArtifacts = new HashSet<Artifact>();

    try {
      // we have to do this because Aether does not work.
      dependencyTreeBuilder.buildDependencyTree(project, localRepository, artifactFactory,
        artifactMetadataSource, artifactCollector).getRootNode().accept(new DependencyNodeVisitor() {
        @Override
        public boolean visit(DependencyNode dependencyNode) {
          Artifact artifact = dependencyNode.getArtifact();

          if (dependencyNode.getState() != DependencyNode.INCLUDED)
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
        {
            throw new ConsumerException( e.getMessage(), e );
        }

        Document document = DocumentHelper.createDocument();
        DependencyNodeVisitor visitor = new XmlSerializingDependencyNodeVisitor( document );

        // 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 );
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
        {
            throw new ConsumerException( e.getMessage(), e );
        }

        Document document = DocumentHelper.createDocument();
        DependencyNodeVisitor visitor = new XmlSerializingDependencyNodeVisitor( document );

        // 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 );
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
            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;
                }
                public boolean visit(DependencyNode node) {
View Full Code Here
295
296
297
298
299
300
301
302
303
304
305
            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
TOP

Related Classes of org.apache.maven.shared.dependency.tree.traversal.DependencyNodeVisitor

  • com.bluetrainsoftware.maven.ReleasePomMojo
  • org.apache.archiva.consumers.dependencytree.DependencyTreeGeneratorConsumer
  • org.apache.archiva.dependency.tree.maven2.DefaultDependencyTreeBuilder
  • org.apache.archiva.dependency.tree.maven2.DependencyTreeBuilderTest
  • org.apache.felix.karaf.tooling.features.GenerateFeaturesXmlMojo
  • org.apache.felix.karaf.tooling.features.ValidateFeaturesMojo
  • org.apache.karaf.tooling.features.GenerateFeaturesXmlMojo
  • org.apache.karaf.tooling.features.ValidateDescriptorMojo
  • org.apache.karaf.tooling.features.ValidateFeaturesMojo
  • org.apache.maven.plugin.dependency.TreeMojo
    • 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.