Package org.eclipse.aether.util.filter
Class AndDependencyFilter
java.lang.Object
org.eclipse.aether.util.filter.AndDependencyFilter
- All Implemented Interfaces:
DependencyFilter
A dependency filter that combines zero or more other filters using a logical
AND
. The resulting filter
accepts a given dependency node if and only if all constituent filters accept it.-
Constructor Summary
ConstructorDescriptionAndDependencyFilter
(Collection<DependencyFilter> filters) Creates a new filter from the specified filters.AndDependencyFilter
(DependencyFilter... filters) Creates a new filter from the specified filters. -
Method Summary
Modifier and TypeMethodDescriptionboolean
accept
(DependencyNode node, List<DependencyNode> parents) Indicates whether the specified dependency node shall be included or excluded.boolean
int
hashCode()
static DependencyFilter
newInstance
(DependencyFilter filter1, DependencyFilter filter2) Creates a new filter from the specified filters.
-
Constructor Details
-
AndDependencyFilter
Creates a new filter from the specified filters. PrefernewInstance(DependencyFilter, DependencyFilter)
if any of the input filters might benull
.- Parameters:
filters
- The filters to combine, may benull
but must not containnull
elements.
-
AndDependencyFilter
Creates a new filter from the specified filters.- Parameters:
filters
- The filters to combine, may benull
but must not containnull
elements.
-
-
Method Details
-
newInstance
Creates a new filter from the specified filters.- Parameters:
filter1
- The first filter to combine, may benull
.filter2
- The second filter to combine, may benull
.- Returns:
- The combined filter or
null
if both filter werenull
.
-
accept
Description copied from interface:DependencyFilter
Indicates whether the specified dependency node shall be included or excluded.- Specified by:
accept
in interfaceDependencyFilter
- Parameters:
node
- The dependency node to filter, must not benull
.parents
- The (read-only) chain of parent nodes that leads to the node to be filtered, must not benull
. Iterating this (possibly empty) list walks up the dependency graph towards the root node, i.e. the immediate parent node (if any) is the first node in the list. The size of the list also denotes the zero-based depth of the filtered node.- Returns:
true
to include the dependency node,false
to exclude it.
-
equals
-
hashCode
-