org.jvnet.maven.plugin.antrun
Class ExcludeArtifactsTransitivelyFilter
java.lang.Object
org.apache.tools.ant.ProjectComponent
org.jvnet.maven.plugin.antrun.GraphFilter
org.jvnet.maven.plugin.antrun.ListFilter
org.jvnet.maven.plugin.antrun.AbstractArtifactsExclusionFilter
org.jvnet.maven.plugin.antrun.ExcludeArtifactsTransitivelyFilter
- All Implemented Interfaces:
- Cloneable, GraphVisitor
public final class ExcludeArtifactsTransitivelyFilter
- extends AbstractArtifactsExclusionFilter
Filter DependencyGraph
by excluding the specified set of artifacts. Any artifacts made
unreachable by this process will be also excluded.
Informally, a node will remain in the graph
only when it's reachable from the root without going through
any of the excluded artifacts.
Here's the format definition.
Let normalize(G={r,V,E}) -> G'={r,V',E'} be defined as follows.
This is an operation to remove unreachable nodes and edges.
V' = { v | \exists r ->* v in G }
E' = { (u,v) | u \in V' and v \in V' }
Given the graph G=(r,V,E) and exclusion nodes N,
the new graph G' is defined as follows:
G'=normalize(r,V-N),E)
- Author:
- Paul Sterk, Kohsuke Kawaguchi
- See Also:
RemoveSpecificArtifactsFilter
Fields inherited from class org.apache.tools.ant.ProjectComponent |
description, location, project |
Methods inherited from class org.apache.tools.ant.ProjectComponent |
clone, getDescription, getLocation, getProject, log, log, setDescription, setLocation, setProject |
ExcludeArtifactsTransitivelyFilter
public ExcludeArtifactsTransitivelyFilter(Collection<String> artifactIds)
throws IOException
- Throws:
IOException
ExcludeArtifactsTransitivelyFilter
public ExcludeArtifactsTransitivelyFilter(String... artifactIds)
throws IOException
- Throws:
IOException
ExcludeArtifactsTransitivelyFilter
public ExcludeArtifactsTransitivelyFilter(String artifactId)
throws IOException
- Throws:
IOException
ExcludeArtifactsTransitivelyFilter
public ExcludeArtifactsTransitivelyFilter()
visit
public boolean visit(DependencyGraph.Node node)
- Description copied from interface:
GraphVisitor
- Visits a node.
- Returns:
- false to cut the traversal here and don't visit
any of forward edges from this node.
Copyright © 2011. All Rights Reserved.