Class AbstractMapMultiSet<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- org.apache.commons.collections4.multiset.AbstractMultiSet<E>
-
- org.apache.commons.collections4.multiset.AbstractMapMultiSet<E>
-
- Type Parameters:
E- the type held in the multiset
- All Implemented Interfaces:
java.lang.Iterable<E>,java.util.Collection<E>,MultiSet<E>
- Direct Known Subclasses:
HashMultiSet
public abstract class AbstractMapMultiSet<E> extends AbstractMultiSet<E>
Abstract implementation of theMultiSetinterface to simplify the creation of subclass implementations.Subclasses specify a Map implementation to use as the internal storage. The map will be used to map multiset elements to a number; the number represents the number of occurrences of that element in the multiset.
- Since:
- 4.1
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface org.apache.commons.collections4.MultiSet
MultiSet.Entry<E>
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description intadd(E object, int occurrences)Adds a number of occurrences of the specified object to the MultiSet.voidclear()Clears the multiset by clearing the underlying map.booleancontains(java.lang.Object object)Determines if the multiset contains the given element by checking if the underlying map contains the element as a key.booleanequals(java.lang.Object object)Compares this MultiSet to another object.intgetCount(java.lang.Object object)Returns the number of occurrence of the given element in this multiset by looking up its count in the underlying map.inthashCode()Gets a hash code for the MultiSet compatible with the definition of equals.booleanisEmpty()Returns true if the underlying map is empty.java.util.Iterator<E>iterator()Gets an iterator over the multiset elements.intremove(java.lang.Object object, int occurrences)Removes a number of occurrences of the specified object from the MultiSet.intsize()Returns the number of elements in this multiset.java.lang.Object[]toArray()Returns an array of all of this multiset's elements.<T> T[]toArray(T[] array)Returns an array of all of this multiset's elements.-
Methods inherited from class org.apache.commons.collections4.multiset.AbstractMultiSet
add, entrySet, remove, removeAll, setCount, toString, uniqueSet
-
Methods inherited from interface java.util.Collection
addAll, parallelStream, removeIf, spliterator, stream, toArray
-
Methods inherited from interface org.apache.commons.collections4.MultiSet
containsAll, retainAll
-
-
-
-
Method Detail
-
size
public int size()
Returns the number of elements in this multiset.
-
isEmpty
public boolean isEmpty()
Returns true if the underlying map is empty.
-
getCount
public int getCount(java.lang.Object object)
Returns the number of occurrence of the given element in this multiset by looking up its count in the underlying map.
-
contains
public boolean contains(java.lang.Object object)
Determines if the multiset contains the given element by checking if the underlying map contains the element as a key.- Specified by:
containsin interfacejava.util.Collection<E>- Overrides:
containsin classAbstractMultiSet<E>- Parameters:
object- the object to search for- Returns:
- true if the multiset contains the given element
-
iterator
public java.util.Iterator<E> iterator()
Gets an iterator over the multiset elements. Elements present in the MultiSet more than once will be returned repeatedly.
-
add
public int add(E object, int occurrences)
Description copied from interface:MultiSetAdds 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.- Specified by:
addin interfaceMultiSet<E>- Overrides:
addin classAbstractMultiSet<E>- Parameters:
object- the object to addoccurrences- the number of occurrences to add, may be zero, in which case no change is made to the multiset- Returns:
- the number of occurrences of the object in the multiset before this operation; possibly zero
-
clear
public void clear()
Clears the multiset by clearing the underlying map.- Specified by:
clearin interfacejava.util.Collection<E>- Overrides:
clearin classAbstractMultiSet<E>
-
remove
public int remove(java.lang.Object object, int occurrences)Description copied from interface:MultiSetRemoves 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.
- Specified by:
removein interfaceMultiSet<E>- Overrides:
removein classAbstractMultiSet<E>- Parameters:
object- the object to removeoccurrences- the number of occurrences to remove, may be zero, in which case no change is made to the multiset- Returns:
- the number of occurrences of the object in the multiset before the operation; possibly zero
-
toArray
public java.lang.Object[] toArray()
Returns an array of all of this multiset's elements.
-
toArray
public <T> T[] toArray(T[] array)
Returns an array of all of this multiset's elements. If the input array has more elements than are in the multiset, trailing elements will be set to null.- Specified by:
toArrayin interfacejava.util.Collection<E>- Overrides:
toArrayin classjava.util.AbstractCollection<E>- Type Parameters:
T- the type of the array elements- Parameters:
array- the array to populate- Returns:
- an array of all of this multiset's elements
- Throws:
java.lang.ArrayStoreException- if the runtime type of the specified array is not a supertype of the runtime type of the elements in this listjava.lang.NullPointerException- if the specified array is null
-
equals
public boolean equals(java.lang.Object object)
Description copied from interface:MultiSetCompares 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:MultiSetGets 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).
-
-