Execute f
for each item in the set.
Get the value associated with key, k
.
Get the value associated with key, k
. If no value is present, then the
dflt
value will be returned.
Add amount
to the count associated with k
.
Add amount
to the count associated with k
. If the key is not already in the
map a new entry will be created with a count of amount
.
Add one to the count associated with k
.
Add one to the count associated with k
. If the key is not already in the
map a new entry will be created with a count of 1.
Put a long to integer pair into the map.
Put a long to integer pair into the map. The key, k
, should not be
equivalent to the noData
value used for this map. If an entry with the
same key already exists, then the value will be overwritten.
Return the number of items in the set.
Return the number of items in the set. This is a constant time operation.
Converts this set to a Map[Long, Int].
Converts this set to a Map[Long, Int]. Used mostly for debugging and tests.
(Since version ) see corresponding Javadoc for more information.
Mutable long to integer map based on open-addressing. Primary use-case is computing a count for the number of times a particular value was encountered.