Class ConcurrentHashMultiset<E>
- All Implemented Interfaces:
- Multiset<E>,- Serializable,- Iterable<E>,- Collection<E>
Multiset operations (exceptions where noted). Null elements are not supported.
 See the Guava User Guide article on Multiset.
- Since:
- 2.0
- Author:
- Cliff L. Biffle, mike nonemacher
- See Also:
- 
Nested Class SummaryNested classes/interfaces inherited from interface com.google.common.collect.MultisetMultiset.Entry<E extends @Nullable Object>
- 
Method SummaryModifier and TypeMethodDescriptionfinal booleanAdds a single occurrence of the specified element to this multiset.intAdds a number of occurrences of the specified element to this multiset.final booleanaddAll(Collection<? extends E> elementsToAdd) voidclear()booleanDetermines whether this multiset contains the specified element.intReturns the number of occurrences ofelementin this multiset.static <E> ConcurrentHashMultiset<E> create()Creates a new, emptyConcurrentHashMultisetusing the default initial capacity, load factor, and concurrency settings.static <E> ConcurrentHashMultiset<E> Creates a newConcurrentHashMultisetcontaining the specified elements, using the default initial capacity, load factor, and concurrency settings.static <E> ConcurrentHashMultiset<E> create(ConcurrentMap<E, AtomicInteger> countMap) Creates a new, emptyConcurrentHashMultisetusingcountMapas the internal backing map.Deprecated.Returns the set of distinct elements contained in this multiset.entrySet()Returns a view of the contents of this multiset, grouped intoMultiset.Entryinstances, each providing an element of the multiset and the count of that element.final booleanCompares the specified object with this multiset for equality.final inthashCode()Returns the hash code for this multiset.booleanisEmpty()iterator()final booleanRemoves a single occurrence of the specified element from this multiset, if present.intRemoves a number of occurrences of the specified element from this multiset.final booleanremoveAll(Collection<?> elementsToRemove) booleanremoveExactly(@Nullable Object element, int occurrences) Removes exactly the specified number of occurrences ofelement, or makes no change if this is not possible.final booleanretainAll(Collection<?> elementsToRetain) intAdds or removes occurrences ofelementsuch that thecount(java.lang.Object)of the element becomescount.booleanSets the number of occurrences ofelementtonewCount, but only if the count is currentlyexpectedOldCount.intsize()Returns the total number of all occurrences of all elements in this multiset.Object[]toArray()toArray(T[] array) final StringtoString()Methods inherited from class java.util.AbstractCollectioncontainsAllMethods inherited from class java.lang.Objectclone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.CollectionparallelStream, removeIf, spliterator, stream, toArrayMethods inherited from interface com.google.common.collect.MultisetcontainsAll
- 
Method Details- 
createCreates a new, emptyConcurrentHashMultisetusing the default initial capacity, load factor, and concurrency settings.
- 
createCreates a newConcurrentHashMultisetcontaining the specified elements, using the default initial capacity, load factor, and concurrency settings.This implementation is highly efficient when elementsis itself aMultiset.- Parameters:
- elements- the elements that the multiset should contain
 
- 
createCreates a new, emptyConcurrentHashMultisetusingcountMapas the internal backing map.This instance will assume ownership of countMap, and other code should not maintain references to the map or modify it in any way.The returned multiset is serializable if the input map is. - Parameters:
- countMap- backing map for storing the elements in the multiset and their counts. It must be empty.
- Throws:
- IllegalArgumentException- if- countMapis not empty
- Since:
- 20.0
 
- 
count
- 
sizepublic int size()Returns the total number of all occurrences of all elements in this multiset.Note: this method does not return the number of distinct elements in the multiset, which is given by entrySet().size().If the data in the multiset is modified by any other threads during this method, it is undefined which (if any) of these modifications will be reflected in the result. - Specified by:
- sizein interface- Collection<E>
- Specified by:
- sizein interface- Multiset<E>
- Specified by:
- sizein class- AbstractCollection<E>
 
- 
toArray- Specified by:
- toArrayin interface- Collection<E>
- Overrides:
- toArrayin class- AbstractCollection<E>
 
- 
toArray- Specified by:
- toArrayin interface- Collection<E>
- Overrides:
- toArrayin class- AbstractCollection<E>
 
- 
addAdds a number of occurrences of the specified element to this multiset.- Specified by:
- addin interface- Multiset<E>
- Parameters:
- element- the element to add
- occurrences- the number of occurrences to add
- Returns:
- the previous count of the element before the operation; possibly zero
- Throws:
- IllegalArgumentException- if- occurrencesis negative, or if the resulting amount would exceed- Integer.MAX_VALUE
 
- 
removeRemoves a number of occurrences of the specified element from this multiset. If the multiset contains fewer than this number of occurrences to begin with, all occurrences will be removed.- Specified by:
- removein interface- Multiset<E>
- Parameters:
- element- the element whose occurrences should be removed
- occurrences- the number of occurrences of the element to remove
- Returns:
- the count of the element before the operation; possibly zero
- Throws:
- IllegalArgumentException- if- occurrencesis negative
 
- 
removeExactlyRemoves exactly the specified number of occurrences ofelement, or makes no change if this is not possible.This method, in contrast to remove(Object, int), has no effect when the element count is smaller thanoccurrences.- Parameters:
- element- the element to remove
- occurrences- the number of occurrences of- elementto remove
- Returns:
- trueif the removal was possible (including if- occurrencesis zero)
- Throws:
- IllegalArgumentException- if- occurrencesis negative
 
- 
setCountAdds or removes occurrences ofelementsuch that thecount(java.lang.Object)of the element becomescount.- Specified by:
- setCountin interface- Multiset<E>
- Parameters:
- element- the element to add or remove occurrences of; may be null only if explicitly allowed by the implementation
- count- the desired count of the element in this multiset
- Returns:
- the count of elementin the multiset before this call
- Throws:
- IllegalArgumentException- if- countis negative
 
- 
setCountSets the number of occurrences ofelementtonewCount, but only if the count is currentlyexpectedOldCount. Ifelementdoes not appear in the multiset exactlyexpectedOldCounttimes, no changes will be made.- Specified by:
- setCountin interface- Multiset<E>
- Parameters:
- element- the element to conditionally set the count of; may be null only if explicitly allowed by the implementation
- expectedOldCount- the expected present count of the element in this multiset
- newCount- the desired count of the element in this multiset
- Returns:
- trueif the change was successful. This usually indicates that the multiset has been modified, but not always: in the case that- expectedOldCount == newCount, the method will return- trueif the condition was met.
- Throws:
- IllegalArgumentException- if- expectedOldCountor- newCountis negative
 
- 
createEntrySetDeprecated.Internal method, useMultiset.entrySet().
- 
isEmptypublic boolean isEmpty()- Specified by:
- isEmptyin interface- Collection<E>
 
- 
iteratorDescription copied from interface:MultisetElements that occur multiple times in the multiset will appear multiple times in this iterator, though not necessarily sequentially. 
- 
clearpublic void clear()- Specified by:
- clearin interface- Collection<E>
 
- 
containsDescription copied from interface:MultisetDetermines whether this multiset contains the specified element.This method refines Collection.contains(java.lang.Object)to further specify that it may not throw an exception in response toelementbeing null or of the wrong type.- Specified by:
- containsin interface- Collection<E extends @Nullable Object>
- Specified by:
- containsin interface- Multiset<E extends @Nullable Object>
- Overrides:
- containsin class- AbstractCollection<E extends @Nullable Object>
- Parameters:
- element- the element to check for
- Returns:
- trueif this multiset contains at least one occurrence of the element
 
- 
addDescription copied from interface:MultisetAdds a single occurrence of the specified element to this multiset.This method refines Collection.add(E), which only ensures the presence of the element, to further specify that a successful call must always increment the count of the element, and the overall size of the collection, by one.To both add the element and obtain the previous count of that element, use add(element, 1)instead.- Specified by:
- addin interface- Collection<E extends @Nullable Object>
- Specified by:
- addin interface- Multiset<E extends @Nullable Object>
- Overrides:
- addin class- AbstractCollection<E extends @Nullable Object>
- Parameters:
- element- the element to add one occurrence of; may be null only if explicitly allowed by the implementation
- Returns:
- truealways, since this call is required to modify the multiset, unlike other- Collectiontypes
 
- 
removeDescription copied from interface:MultisetRemoves a single occurrence of the specified element from this multiset, if present.This method refines Collection.remove(java.lang.Object)to further specify that it may not throw an exception in response toelementbeing null or of the wrong type.To both remove the element and obtain the previous count of that element, use remove(element, 1)instead.- Specified by:
- removein interface- Collection<E extends @Nullable Object>
- Specified by:
- removein interface- Multiset<E extends @Nullable Object>
- Overrides:
- removein class- AbstractCollection<E extends @Nullable Object>
- Parameters:
- element- the element to remove one occurrence of
- Returns:
- trueif an occurrence was found and removed
 
- 
addAllThis implementation is highly efficient when elementsToAddis itself aMultiset.- Specified by:
- addAllin interface- Collection<E extends @Nullable Object>
- Overrides:
- addAllin class- AbstractCollection<E extends @Nullable Object>
 
- 
removeAllDescription copied from interface:MultisetNote: This method ignores how often any element might appear in c, and only cares whether or not an element appears at all. If you wish to remove one occurrence in this multiset for every occurrence inc, seeMultisets.removeOccurrences(Multiset, Multiset).This method refines Collection.removeAll(java.util.Collection<?>)to further specify that it may not throw an exception in response to any ofelementsbeing null or of the wrong type.
- 
retainAllDescription copied from interface:MultisetNote: This method ignores how often any element might appear in c, and only cares whether or not an element appears at all. If you wish to remove one occurrence in this multiset for every occurrence inc, seeMultisets.retainOccurrences(Multiset, Multiset).This method refines Collection.retainAll(java.util.Collection<?>)to further specify that it may not throw an exception in response to any ofelementsbeing null or of the wrong type.
- 
elementSetDescription copied from interface:MultisetReturns the set of distinct elements contained in this multiset. The element set is backed by the same data as the multiset, so any change to either is immediately reflected in the other. The order of the elements in the element set is unspecified.If the element set supports any removal operations, these necessarily cause all occurrences of the removed element(s) to be removed from the multiset. Implementations are not expected to support the add operations, although this is possible. A common use for the element set is to find the number of distinct elements in the multiset: elementSet().size().- Specified by:
- elementSetin interface- Multiset<E extends @Nullable Object>
- Returns:
- a view of the set of distinct elements in this multiset
 
- 
entrySetDescription copied from interface:MultisetReturns a view of the contents of this multiset, grouped intoMultiset.Entryinstances, each providing an element of the multiset and the count of that element. This set contains exactly one entry for each distinct element in the multiset (thus it always has the same size as theMultiset.elementSet()). The order of the elements in the element set is unspecified.The entry set is backed by the same data as the multiset, so any change to either is immediately reflected in the other. However, multiset changes may or may not be reflected in any Entryinstances already retrieved from the entry set (this is implementation-dependent). Furthermore, implementations are not required to support modifications to the entry set at all, and theEntryinstances themselves don't even have methods for modification. See the specific implementation class for more details on how its entry set handles modifications.
- 
equalsCompares the specified object with this multiset for equality. Returnstrueif the given object is also a multiset and contains equal elements with equal counts, regardless of order.This implementation returns trueifobjectis a multiset of the same size and if, for each element, the two multisets have the same count.
- 
hashCodepublic final int hashCode()Returns the hash code for this multiset. This is defined as the sum of((element == null) ? 0 : element.hashCode()) ^ count(element)over all distinct elements in the multiset. It follows that a multiset and its entry set always have the same hash code. This implementation returns the hash code of Multiset.entrySet().
- 
toStringIt is recommended, though not mandatory, that this method return the result of invoking Multiset.toString()on theMultiset.entrySet(), yielding a result such as[a x 3, c, d x 2, e].This implementation returns the result of invoking toStringonMultiset.entrySet().
 
- 
Multiset.entrySet().