Class PredicatedMultiSet<E>
- java.lang.Object
-
- org.apache.commons.collections4.collection.AbstractCollectionDecorator<E>
-
- org.apache.commons.collections4.collection.PredicatedCollection<E>
-
- org.apache.commons.collections4.multiset.PredicatedMultiSet<E>
-
- Type Parameters:
E
- the type held in the multiset
- All Implemented Interfaces:
Serializable
,Iterable<E>
,Collection<E>
,MultiSet<E>
public class PredicatedMultiSet<E> extends PredicatedCollection<E> implements MultiSet<E>
Decorates anotherMultiSet
to validate that additions match a specified predicate.This multiset exists to provide validation for the decorated multiset. It is normally created to decorate an empty multiset. If an object cannot be added to the multiset, an
IllegalArgumentException
is thrown.One usage would be to ensure that no null entries are added to the multiset.
MultiSet<E> set = PredicatedMultiSet.predicatedMultiSet(new HashMultiSet<E>(), NotNullPredicate.notNullPredicate());
- Since:
- 4.1
- See Also:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class org.apache.commons.collections4.collection.PredicatedCollection
PredicatedCollection.Builder<E>
-
Nested classes/interfaces inherited from interface org.apache.commons.collections4.MultiSet
MultiSet.Entry<E>
-
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description int
add(E object, int count)
Adds a number of occurrences of the specified object to the MultiSet.Set<MultiSet.Entry<E>>
entrySet()
Returns aSet
of all entries contained in the MultiSet.boolean
equals(Object object)
Compares this MultiSet to another object.int
getCount(Object object)
Returns the number of occurrences of the given object currently in the MultiSet.int
hashCode()
Gets a hash code for the MultiSet compatible with the definition of equals.static <E> PredicatedMultiSet<E>
predicatedMultiSet(MultiSet<E> multiset, Predicate<? super E> predicate)
Factory method to create a predicated (validating) multiset.int
remove(Object object, int count)
Removes a number of occurrences of the specified object from the MultiSet.int
setCount(E object, int count)
Sets the number of occurrences of the specified object in the MultiSet to the given count.Set<E>
uniqueSet()
Returns aSet
of unique elements in the MultiSet.-
Methods inherited from class org.apache.commons.collections4.collection.PredicatedCollection
add, addAll, builder, notNullBuilder, predicatedCollection
-
Methods inherited from class org.apache.commons.collections4.collection.AbstractCollectionDecorator
clear, contains, containsAll, isEmpty, iterator, remove, removeAll, removeIf, retainAll, size, toArray, toArray, toString
-
Methods inherited from interface java.util.Collection
addAll, clear, contains, isEmpty, parallelStream, removeIf, spliterator, stream, toArray, toArray, toArray
-
-
-
-
Method Detail
-
predicatedMultiSet
public static <E> PredicatedMultiSet<E> predicatedMultiSet(MultiSet<E> multiset, Predicate<? super E> predicate)
Factory method to create a predicated (validating) multiset.If there are any elements already in the multiset being decorated, they are validated.
- Type Parameters:
E
- the type of the elements in the multiset- Parameters:
multiset
- the multiset to decorate, must not be nullpredicate
- the predicate to use for validation, must not be null- Returns:
- a new predicated MultiSet
- Throws:
NullPointerException
- if multiset or predicate is nullIllegalArgumentException
- if the multiset contains invalid elements
-
equals
public boolean equals(Object object)
Description copied from interface:MultiSet
Compares this MultiSet to another object.This MultiSet equals another object if it is also a MultiSet that contains the same number of occurrences of the same elements.
-
hashCode
public int hashCode()
Description copied from interface:MultiSet
Gets a hash code for the MultiSet compatible with the definition of equals. The hash code is defined as the sum total of a hash code for each element. The per element hash code is defined as(e==null ? 0 : e.hashCode()) ^ noOccurances)
.
-
add
public int add(E object, int count)
Description copied from interface:MultiSet
Adds a number of occurrences of the specified object to the MultiSet.If the object is already in the
MultiSet.uniqueSet()
then increment its count as reported byMultiSet.getCount(Object)
. Otherwise add it to theMultiSet.uniqueSet()
and report its count asoccurrences
.
-
remove
public int remove(Object object, int count)
Description copied from interface:MultiSet
Removes a number of occurrences of the specified object from the MultiSet.If the number of occurrences to remove is greater than the actual number of occurrences in the multiset, the object will be removed from the multiset.
-
getCount
public int getCount(Object object)
Description copied from interface:MultiSet
Returns the number of occurrences of the given object currently in the MultiSet. If the object does not exist in the multiset, return 0.
-
setCount
public int setCount(E object, int count)
Description copied from interface:MultiSet
Sets the number of occurrences of the specified object in the MultiSet to the given count.If the provided count is zero, the object will be removed from the
MultiSet.uniqueSet()
.
-
uniqueSet
public Set<E> uniqueSet()
Description copied from interface:MultiSet
Returns aSet
of unique elements in the MultiSet.Uniqueness constraints are the same as those in
Set
.The returned set is backed by this multiset, so any change to either is immediately reflected in the other. Only removal operations are supported, in which case all occurrences of the element are removed from the backing multiset.
-
entrySet
public Set<MultiSet.Entry<E>> entrySet()
Description copied from interface:MultiSet
Returns aSet
of all entries contained in the MultiSet.The returned set is backed by this multiset, so any change to either is immediately reflected in the other.
-
-