public final class ExcludeArtifactsTransitivelyFilter extends AbstractArtifactsExclusionFilter
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)
RemoveSpecificArtifactsFilter
ids
children
Constructor and Description |
---|
ExcludeArtifactsTransitivelyFilter() |
ExcludeArtifactsTransitivelyFilter(Collection<String> artifactIds) |
ExcludeArtifactsTransitivelyFilter(String... artifactIds) |
ExcludeArtifactsTransitivelyFilter(String artifactId) |
Modifier and Type | Method and Description |
---|---|
boolean |
visit(DependencyGraph.Node node)
Visits a node.
|
addArtifact, addConfiguredArtifact, resolve
process, visit
add, evaluateChild, evaluateChild
public ExcludeArtifactsTransitivelyFilter(Collection<String> artifactIds) throws IOException
IOException
public ExcludeArtifactsTransitivelyFilter(String... artifactIds) throws IOException
IOException
public ExcludeArtifactsTransitivelyFilter(String artifactId) throws IOException
IOException
public ExcludeArtifactsTransitivelyFilter()
public boolean visit(DependencyGraph.Node node)
GraphVisitor
Copyright © 2014. All rights reserved.