Class AbstractMapMultiSet<E>
- Type Parameters:
E
- the type held in the multiset
- All Implemented Interfaces:
Iterable<E>
,Collection<E>
,MultiSet<E>
- Direct Known Subclasses:
HashMultiSet
MultiSet
interface 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
Modifier and TypeClassDescriptionprotected static class
Inner class EntrySetIterator.protected static class
Inner class MultiSetEntry.protected static class
Mutable integer class for storing the data.protected static class
Inner class UniqueSetIterator.Nested classes/interfaces inherited from class org.apache.commons.collections4.multiset.AbstractMultiSet
AbstractMultiSet.AbstractEntry<E>, AbstractMultiSet.EntrySet<E>, AbstractMultiSet.UniqueSet<E>
Nested classes/interfaces inherited from interface org.apache.commons.collections4.MultiSet
MultiSet.Entry<E>
-
Constructor Summary
ModifierConstructorDescriptionprotected
Constructor needed for subclass serialisation.protected
Constructor that assigns the specified Map as the backing store. -
Method Summary
Modifier and TypeMethodDescriptionint
Adds a number of occurrences of the specified object to the MultiSet.void
clear()
Clears the multiset by clearing the underlying map.boolean
Determines if the multiset contains the given element by checking if the underlying map contains the element as a key.protected Iterator<MultiSet.Entry<E>>
Creates an entry set iterator.Creates a unique set iterator.protected void
Read the multiset in using a custom routine.protected void
Write the multiset out using a custom routine.boolean
Compares this MultiSet to another object.int
Returns the number of occurrence of the given element in this multiset by looking up its count in the underlying map.protected Map<E,
AbstractMapMultiSet.MutableInteger> getMap()
Utility method for implementations to access the map that backs this multiset.int
hashCode()
Gets a hash code for the MultiSet compatible with the definition of equals.boolean
isEmpty()
Returns true if the underlying map is empty.iterator()
Gets an iterator over the multiset elements.int
Removes a number of occurrences of the specified object from the MultiSet.protected void
Sets the map being wrapped.int
size()
Returns the number of elements in this multiset.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.protected int
Returns the number of unique elements in this multiset.Methods inherited from class org.apache.commons.collections4.multiset.AbstractMultiSet
add, createEntrySet, createUniqueSet, entrySet, remove, removeAll, setCount, toString, uniqueSet
Methods inherited from class java.util.AbstractCollection
addAll, containsAll, retainAll
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.util.Collection
addAll, parallelStream, removeIf, spliterator, stream
Methods inherited from interface org.apache.commons.collections4.MultiSet
containsAll, retainAll
-
Constructor Details
-
AbstractMapMultiSet
protected AbstractMapMultiSet()Constructor needed for subclass serialisation. -
AbstractMapMultiSet
Constructor that assigns the specified Map as the backing store. The map must be empty and non-null.- Parameters:
map
- the map to assign
-
-
Method Details
-
add
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
.- Specified by:
add
in interfaceMultiSet<E>
- Overrides:
add
in 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
Clears the multiset by clearing the underlying map.- Specified by:
clear
in interfaceCollection<E>
- Overrides:
clear
in classAbstractMultiSet<E>
-
contains
Determines if the multiset contains the given element by checking if the underlying map contains the element as a key.- Specified by:
contains
in interfaceCollection<E>
- Overrides:
contains
in classAbstractMultiSet<E>
- Parameters:
object
- the object to search for- Returns:
- true if the multiset contains the given element
-
createEntrySetIterator
Description copied from class:AbstractMultiSet
Creates an entry set iterator. Subclasses can override this to return iterators with different properties.- Specified by:
createEntrySetIterator
in classAbstractMultiSet<E>
- Returns:
- the entrySet iterator
-
createUniqueSetIterator
Description copied from class:AbstractMultiSet
Creates a unique set iterator. Subclasses can override this to return iterators with different properties.- Overrides:
createUniqueSetIterator
in classAbstractMultiSet<E>
- Returns:
- the uniqueSet iterator
-
doReadObject
Read the multiset in using a custom routine.- Overrides:
doReadObject
in classAbstractMultiSet<E>
- Parameters:
in
- the input stream- Throws:
IOException
- any of the usual I/O related exceptionsClassNotFoundException
- if the stream contains an object which class can not be loadedClassCastException
- if the stream does not contain the correct objects
-
doWriteObject
Write the multiset out using a custom routine.- Overrides:
doWriteObject
in classAbstractMultiSet<E>
- Parameters:
out
- the output stream- Throws:
IOException
- any of the usual I/O related exceptions
-
equals
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.
- Specified by:
equals
in interfaceCollection<E>
- Specified by:
equals
in interfaceMultiSet<E>
- Overrides:
equals
in classAbstractMultiSet<E>
- Parameters:
object
- the object to compare to- Returns:
- true if equal
-
getCount
Returns the number of occurrence of the given element in this multiset by looking up its count in the underlying map. -
getMap
Utility method for implementations to access the map that backs this multiset. Not intended for interactive use outside of subclasses.- Returns:
- the map being used by the MultiSet
-
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()) ^ noOccurrences)
.- Specified by:
hashCode
in interfaceCollection<E>
- Specified by:
hashCode
in interfaceMultiSet<E>
- Overrides:
hashCode
in classAbstractMultiSet<E>
- Returns:
- the hash code of the MultiSet
-
isEmpty
Returns true if the underlying map is empty.- Specified by:
isEmpty
in interfaceCollection<E>
- Overrides:
isEmpty
in classAbstractCollection<E>
- Returns:
- true if multiset is empty
-
iterator
Gets an iterator over the multiset elements. Elements present in the MultiSet more than once will be returned repeatedly. -
remove
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.
- Specified by:
remove
in interfaceMultiSet<E>
- Overrides:
remove
in 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
-
setMap
Sets the map being wrapped.NOTE: this method should only be used during deserialization
- Parameters:
map
- the map to wrap
-
size
Returns the number of elements in this multiset.- Specified by:
size
in interfaceCollection<E>
- Specified by:
size
in interfaceMultiSet<E>
- Overrides:
size
in classAbstractMultiSet<E>
- Returns:
- current size of the multiset
-
toArray
Returns an array of all of this multiset's elements.- Specified by:
toArray
in interfaceCollection<E>
- Overrides:
toArray
in classAbstractCollection<E>
- Returns:
- an array of all of this multiset's elements
-
toArray
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:
toArray
in interfaceCollection<E>
- Overrides:
toArray
in classAbstractCollection<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:
ArrayStoreException
- if the runtime type of the specified array is not a supertype of the runtime type of the elements in this listNullPointerException
- if the specified array is null
-
uniqueElements
Description copied from class:AbstractMultiSet
Returns the number of unique elements in this multiset.- Specified by:
uniqueElements
in classAbstractMultiSet<E>
- Returns:
- the number of unique elements
-