Modifier and Type | Class and Description |
---|---|
class |
Long2ObjectHashMap.KeyIterator
Adds an unboxed next() method to the standard Iterator interface.
|
class |
Long2ObjectHashMap.KeySet
Adds non-boxing methods to the standard Set interface.
|
Modifier and Type | Field and Description |
---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The default initial capacity for constructors not explicitly supplying it
|
static double |
DEFAULT_LOAD_FACTOR
The default load factor for constructors not explicitly supplying it
|
Constructor and Description |
---|
Long2ObjectHashMap() |
Long2ObjectHashMap(int initialCapacity) |
Long2ObjectHashMap(int initialCapacity,
double loadFactor)
Construct a new map allowing a configuration for initial capacity and load factor.
|
Modifier and Type | Method and Description |
---|---|
int |
capacity()
Get the total capacity for the map to which the load factor with be a fraction of.
|
void |
clear() |
void |
compact()
Compact the
Map backing arrays by rehashing with a capacity just larger than current size
and giving consideration to the load factor. |
V |
computeIfAbsent(long key,
LongFunction<? extends V> mappingFunction)
Get a value for a given key, or if it does ot exist then default the value via a
LongFunction
and put it in the map. |
boolean |
containsKey(long key)
Overloaded version of
Map.containsKey(Object) that takes a primitive long key. |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
Set<Map.Entry<Long,V>> |
entrySet()
This set's iterator also implements
Map.Entry
so the next() method can just return the iterator
instance itself with no heap allocation. |
V |
get(long key)
Overloaded version of
Map.get(Object) that takes a primitive long key. |
V |
get(Object key) |
boolean |
isEmpty() |
Long2ObjectHashMap.KeySet |
keySet() |
double |
loadFactor()
Get the load factor beyond which the map will increase size.
|
V |
put(long key,
V value)
Overloaded version of
Map.put(Object, Object) that takes a primitive long key. |
V |
put(Long key,
V value) |
void |
putAll(Map<? extends Long,? extends V> map) |
V |
remove(long key)
Overloaded version of
Map.remove(Object) that takes a primitive long key. |
V |
remove(Object key) |
int |
resizeThreshold()
Get the actual threshold which when reached the map resize.
|
int |
size() |
String |
toString() |
Collection<V> |
values() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll
public static final double DEFAULT_LOAD_FACTOR
public static final int DEFAULT_INITIAL_CAPACITY
public Long2ObjectHashMap()
public Long2ObjectHashMap(int initialCapacity)
public Long2ObjectHashMap(int initialCapacity, double loadFactor)
initialCapacity
- for the backing arrayloadFactor
- limit for resizing on putspublic double loadFactor()
public int capacity()
public int resizeThreshold()
public boolean containsKey(Object key)
containsKey
in interface Map<Long,V>
public boolean containsKey(long key)
Map.containsKey(Object)
that takes a primitive long key.key
- for indexing the Map
public boolean containsValue(Object value)
containsValue
in interface Map<Long,V>
public V get(long key)
Map.get(Object)
that takes a primitive long key.key
- for indexing the Map
public V computeIfAbsent(long key, LongFunction<? extends V> mappingFunction)
LongFunction
and put it in the map.key
- to search on.mappingFunction
- to provide a value if the get returns null.public V put(long key, V value)
Map.put(Object, Object)
that takes a primitive long key.public V remove(long key)
Map.remove(Object)
that takes a primitive long key.key
- for indexing the Map
public void compact()
Map
backing arrays by rehashing with a capacity just larger than current size
and giving consideration to the load factor.public Long2ObjectHashMap.KeySet keySet()
public Set<Map.Entry<Long,V>> entrySet()
Map.Entry
so the next()
method can just return the iterator
instance itself with no heap allocation. This characteristic
makes the set unusable wherever the returned entries are
retained (such as coll.addAll(entrySet)
.Copyright © 2020 Hazelcast, Inc.. All Rights Reserved.