|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.AbstractCollection<E>
com.google.common.collect.ConcurrentHashMultiset<E>
public final class ConcurrentHashMultiset<E>
A multiset that supports concurrent modifications and that provides atomic
versions of most Multiset operations (exceptions where noted). Null
elements are not supported.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from interface com.google.common.collect.Multiset |
|---|
Multiset.Entry<E> |
| Method Summary | ||
|---|---|---|
boolean |
add(E element)
Adds a single occurrence of the specified element to this multiset. |
|
int |
add(E element,
int occurrences)
Adds a number of occurrences of the specified element to this multiset. |
|
boolean |
addAll(java.util.Collection<? extends E> elementsToAdd)
|
|
void |
clear()
|
|
boolean |
contains(java.lang.Object element)
Determines whether this multiset contains the specified element. |
|
boolean |
containsAll(java.util.Collection<?> elements)
Returns true if this multiset contains at least one occurrence of
each element in the specified collection. |
|
int |
count(java.lang.Object element)
Returns the number of occurrences of element in this multiset. |
|
static
|
create()
Creates a new, empty ConcurrentHashMultiset using the default
initial capacity, load factor, and concurrency settings. |
|
static
|
create(java.lang.Iterable<? extends E> elements)
Creates a new ConcurrentHashMultiset containing the specified
elements, using the default initial capacity, load factor, and concurrency
settings. |
|
java.util.Set<E> |
elementSet()
Returns the set of distinct elements contained in this multiset. |
|
java.util.Set<Multiset.Entry<E>> |
entrySet()
Returns a view of the contents of this multiset, grouped into Multiset.Entry instances, each providing an element of the multiset and
the count of that element. |
|
boolean |
equals(java.lang.Object object)
Compares the specified object with this multiset for equality. |
|
int |
hashCode()
Returns the hash code for this multiset. |
|
boolean |
isEmpty()
|
|
java.util.Iterator<E> |
iterator()
|
|
boolean |
remove(java.lang.Object element)
Removes a single occurrence of the specified element from this multiset, if present. |
|
int |
remove(java.lang.Object element,
int occurrences)
Removes a number of occurrences of the specified element from this multiset. |
|
boolean |
removeAll(java.util.Collection<?> elementsToRemove)
|
|
boolean |
removeExactly(java.lang.Object element,
int occurrences)
Removes exactly the specified number of occurrences of element, or
makes no change if this is not possible. |
|
boolean |
retainAll(java.util.Collection<?> elementsToRetain)
|
|
int |
setCount(E element,
int count)
Adds or removes occurrences of element such that the count(java.lang.Object)
of the element becomes count. |
|
boolean |
setCount(E element,
int oldCount,
int newCount)
Sets the number of occurrences of element to newCount, but
only if the count is currently oldCount. |
|
int |
size()
|
|
java.lang.Object[] |
toArray()
|
|
|
toArray(T[] array)
|
|
java.lang.String |
toString()
|
|
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Method Detail |
|---|
public static <E> ConcurrentHashMultiset<E> create()
ConcurrentHashMultiset using the default
initial capacity, load factor, and concurrency settings.
public static <E> ConcurrentHashMultiset<E> create(java.lang.Iterable<? extends E> elements)
ConcurrentHashMultiset containing the specified
elements, using the default initial capacity, load factor, and concurrency
settings.
elements - the elements that the multiset should contain
public int count(@Nullable
java.lang.Object element)
element in this multiset.
count in interface Multiset<E>element - the element to look for
public int 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.
size in interface java.util.Collection<E>public java.lang.Object[] toArray()
toArray in interface java.util.Collection<E>toArray in class java.util.AbstractCollection<E>public <T> T[] toArray(T[] array)
toArray in interface java.util.Collection<E>toArray in class java.util.AbstractCollection<E>
public int add(E element,
int occurrences)
add in interface Multiset<E>element - the element to addoccurrences - the number of occurrences to add
java.lang.IllegalArgumentException - if occurrences is negative, or if
the resulting amount would exceed Integer.MAX_VALUE
public int remove(@Nullable
java.lang.Object element,
int occurrences)
remove in interface Multiset<E>element - the element whose occurrences should be removedoccurrences - the number of occurrences of the element to remove
java.lang.IllegalArgumentException - if occurrences is negative
public boolean removeExactly(@Nullable
java.lang.Object element,
int occurrences)
element, 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 than occurrences.
element - the element to removeoccurrences - the number of occurrences of element to remove
true if the removal was possible (including if occurrences is zero)
public int setCount(E element,
int count)
element such that the count(java.lang.Object)
of the element becomes count.
setCount in interface Multiset<E>element - the element to add or remove occurrences of; may be null
only if explicitly allowed by the implementationcount - the desired count of the element in this multiset
element in the multiset before this call
java.lang.IllegalArgumentException - if count is negative
public boolean setCount(E element,
int oldCount,
int newCount)
element to newCount, but
only if the count is currently oldCount. If element does
not appear in the multiset exactly oldCount times, no changes will
be made.
setCount in interface Multiset<E>element - the element to conditionally set the count of; may be null
only if explicitly allowed by the implementationoldCount - the expected present count of the element in this multisetnewCount - the desired count of the element in this multiset
true if the change was successful. This usually indicates
that the multiset has been modified, but not always: in the case that
oldCount == newCount, the method will return true if
the condition was met.
java.lang.IllegalArgumentException - if oldCount or newCount is
negativepublic java.util.Set<Multiset.Entry<E>> entrySet()
MultisetMultiset.Entry instances, 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 the
Multiset.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 Entry instances 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 the Entry instances themselves don't
even have methods for modification. See the specific implementation class
for more details on how its entry set handles modifications.
entrySet in interface Multiset<E>public boolean isEmpty()
isEmpty in interface java.util.Collection<E>isEmpty in class java.util.AbstractCollection<E>
public boolean contains(@Nullable
java.lang.Object element)
MultisetThis method refines Collection.contains(java.lang.Object) to further specify that
it may not throw an exception in response to element being
null or of the wrong type.
contains in interface Multiset<E>contains in interface java.util.Collection<E>contains in class java.util.AbstractCollection<E>element - the element to check for
true if this multiset contains at least one occurrence of
the elementpublic java.util.Iterator<E> iterator()
MultisetElements that occur multiple times in the multiset will appear multiple times in this iterator, though not necessarily sequentially.
iterator in interface Multiset<E>iterator in interface java.lang.Iterable<E>iterator in interface java.util.Collection<E>iterator in class java.util.AbstractCollection<E>
public boolean add(@Nullable
E element)
MultisetThis 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.
add in interface Multiset<E>add in interface java.util.Collection<E>add in class java.util.AbstractCollection<E>element - the element to add one occurrence of; may be null only if
explicitly allowed by the implementation
true always, since this call is required to modify the
multiset, unlike other Collection typespublic boolean remove(java.lang.Object element)
MultisetThis method refines Collection.remove(java.lang.Object) to further specify that it
may not throw an exception in response to element being null
or of the wrong type.
remove in interface Multiset<E>remove in interface java.util.Collection<E>remove in class java.util.AbstractCollection<E>element - the element to remove one occurrence of
true if an occurrence was found and removedpublic boolean containsAll(java.util.Collection<?> elements)
Multisettrue if this multiset contains at least one occurrence of
each element in the specified collection.
This method refines Collection.containsAll(java.util.Collection>) to further specify
that it may not throw an exception in response to any of elements being null or of the wrong type.
Note: this method does not take into account the occurrence
count of an element in the two collections; it may still return true even if elements contains several occurrences of an element
and this multiset contains only one. This is no different than any other
collection type like List, but it may be unexpected to the user of
a multiset.
containsAll in interface Multiset<E>containsAll in interface java.util.Collection<E>containsAll in class java.util.AbstractCollection<E>elements - the collection of elements to be checked for containment in
this multiset
true if this multiset contains at least one occurrence of
each element contained in elementspublic boolean addAll(java.util.Collection<? extends E> elementsToAdd)
addAll in interface java.util.Collection<E>addAll in class java.util.AbstractCollection<E>public boolean removeAll(java.util.Collection<?> elementsToRemove)
MultisetThis method refines Collection.removeAll(java.util.Collection>) to further specify that
it may not throw an exception in response to any of elements
being null or of the wrong type.
removeAll in interface Multiset<E>removeAll in interface java.util.Collection<E>removeAll in class java.util.AbstractCollection<E>public boolean retainAll(java.util.Collection<?> elementsToRetain)
MultisetThis method refines Collection.retainAll(java.util.Collection>) to further specify that
it may not throw an exception in response to any of elements
being null or of the wrong type.
retainAll in interface Multiset<E>retainAll in interface java.util.Collection<E>retainAll in class java.util.AbstractCollection<E>public void clear()
clear in interface java.util.Collection<E>clear in class java.util.AbstractCollection<E>public java.util.Set<E> elementSet()
MultisetIf 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().
elementSet in interface Multiset<E>
public boolean equals(@Nullable
java.lang.Object object)
true if the given object is also a multiset and contains equal
elements with equal counts, regardless of order.
TODO: caveats about equivalence-relation.
This implementation returns true if other is a multiset
of the same size and if, for each element, the two multisets have the same
count.
equals in interface Multiset<E>equals in interface java.util.Collection<E>equals in class java.lang.Objectpublic int hashCode()
(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().
hashCode in interface Multiset<E>hashCode in interface java.util.Collection<E>hashCode in class java.lang.Objectpublic java.lang.String toString()
It is recommended, though not mandatory, that this method return the
result of invoking Multiset.toString() on the Multiset.entrySet(), yielding a
result such as
[a x 3, c, d x 2, e]
This implementation returns the result of invoking toString on
Multiset.entrySet().
toString in interface Multiset<E>toString in class java.util.AbstractCollection<E>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||