public class HashMultiSet<E> extends AbstractMapMultiSet<E> implements java.io.Serializable
MultiSet
, using a HashMap
to provide the
data storage. This is the standard implementation of a multiset.
A MultiSet
stores each object in the collection together with a
count of occurrences. Extra methods on the interface allow multiple copies
of an object to be added or removed at once.
MultiSet.Entry<E>
Constructor and Description |
---|
HashMultiSet()
Constructs an empty
HashMultiSet . |
HashMultiSet(java.util.Collection<? extends E> coll)
Constructs a multiset containing all the members of the given collection.
|
add, clear, contains, equals, getCount, hashCode, isEmpty, iterator, remove, size, toArray, toArray
add, entrySet, remove, removeAll, setCount, toString, uniqueSet
containsAll, retainAll
public HashMultiSet()
HashMultiSet
.public HashMultiSet(java.util.Collection<? extends E> coll)
coll
- a collection to copy into this multiset"Copyright © 2010 - 2020 Adobe Systems Incorporated. All Rights Reserved"