Add several instances of this value to the set.
Add several instances of this value to the set.
Add an instance of this value to the set.
Add an instance of this value to the set.
Return the number of instances of the value in the set.
Return the number of instances of the value in the set.
Creates a list of (element, count) pairs.
Creates a list of (element, count) pairs. Order is arbitrary.
Creates a list of elements, where each element may appear multiple times.
Creates a list of elements, where each element may appear multiple times. Order is arbitrary.
Returns true if the counts are the same.
Returns true if the counts are the same.
Iterate over instances in this set and apply the given function.
Iterate over instances in this set and apply the given function.
Map this set to another set by applying the supplied function.
Map this set to another set by applying the supplied function.
Remove all instances of this value from the set.
Remove all instances of this value from the set.
Remove one instance of this value from the set.
Remove one instance of this value from the set.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
Return the union of another set with this set.
Return the union of another set with this set.
An implementation of a MultiSet backed by a HashMap.