V
- type of values stored in the Map
public class Int2ObjectHashMap<V> extends Object implements Map<Integer,V>, Serializable
Map
implementation specialised for int keys using open addressing and
linear probing for cache efficient access.Modifier and Type | Class and Description |
---|---|
class |
Int2ObjectHashMap.EntryIterator
Iterator over entries which supports access to unboxed keys via
Int2ObjectHashMap.EntryIterator.getIntKey() . |
class |
Int2ObjectHashMap.EntrySet
Set of entries which supports access via an optionally cached iterator to avoid allocation.
|
class |
Int2ObjectHashMap.KeyIterator
Iterator over keys which supports access to unboxed keys via
Int2ObjectHashMap.KeyIterator.nextInt() . |
class |
Int2ObjectHashMap.KeySet
Set of keys which supports optionally cached iterators to avoid allocation.
|
class |
Int2ObjectHashMap.ValueCollection
Collection of values which supports optionally cached iterators to avoid allocation.
|
class |
Int2ObjectHashMap.ValueIterator
Iterator over values.
|
Constructor and Description |
---|
Int2ObjectHashMap()
Constructs map with
MIN_CAPACITY , Hashing.DEFAULT_LOAD_FACTOR and enables caching of iterators. |
Int2ObjectHashMap(Int2ObjectHashMap<V> mapToCopy)
Copy construct a new map from an existing one.
|
Int2ObjectHashMap(int initialCapacity,
float loadFactor)
Constructs map with given initial capacity and load factory and enables caching of iterators.
|
Int2ObjectHashMap(int initialCapacity,
float loadFactor,
boolean shouldAvoidAllocation)
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 will 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(int key,
IntFunction<? extends V> mappingFunction)
Get a value for a given key, or if it does not exist then default the value via a
IntFunction and put it in the map. |
boolean |
containsKey(int key)
Overloaded version of
Map.containsKey(Object) that takes a primitive int key. |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
Int2ObjectHashMap.EntrySet |
entrySet() |
boolean |
equals(Object o) |
V |
get(int key)
Overloaded version of
Map.get(Object) that takes a primitive int key. |
V |
get(Object key) |
protected V |
getMapped(int key)
Get mapped value without boxing the key.
|
int |
hashCode() |
boolean |
isEmpty() |
Int2ObjectHashMap.KeySet |
keySet() |
float |
loadFactor()
Get the load factor beyond which the map will increase size.
|
protected Object |
mapNullValue(Object value)
Interceptor for masking null values.
|
V |
put(Integer key,
V value) |
V |
put(int key,
V value)
Overloaded version of
Map.put(Object, Object) that takes a primitive int key. |
void |
putAll(Map<? extends Integer,? extends V> map) |
V |
remove(int key)
Overloaded version of
Map.remove(Object) that takes a primitive int key. |
V |
remove(Object key) |
V |
replace(int key,
V value)
Primitive specialised version of
Map.replace(Object, Object) |
boolean |
replace(int key,
V oldValue,
V newValue)
Primitive specialised version of
Map.replace(Object, Object, Object) |
int |
resizeThreshold()
Get the actual threshold which when reached the map will resize.
|
int |
size() |
String |
toString() |
protected V |
unmapNullValue(Object value)
Interceptor for unmasking null values.
|
Int2ObjectHashMap.ValueCollection |
values() |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll
public Int2ObjectHashMap()
MIN_CAPACITY
, Hashing.DEFAULT_LOAD_FACTOR
and enables caching of iterators.public Int2ObjectHashMap(int initialCapacity, float loadFactor)
initialCapacity
- for the backing arrayloadFactor
- limit for resizing on putspublic Int2ObjectHashMap(int initialCapacity, float loadFactor, boolean shouldAvoidAllocation)
initialCapacity
- for the backing arrayloadFactor
- limit for resizing on putsshouldAvoidAllocation
- should allocation be avoided by caching iterators and map entries.public Int2ObjectHashMap(Int2ObjectHashMap<V> mapToCopy)
mapToCopy
- for construction.public float loadFactor()
public int capacity()
public int resizeThreshold()
public boolean containsKey(Object key)
containsKey
in interface Map<Integer,V>
public boolean containsKey(int key)
Map.containsKey(Object)
that takes a primitive int key.key
- for indexing the Map
public boolean containsValue(Object value)
containsValue
in interface Map<Integer,V>
public V get(int key)
Map.get(Object)
that takes a primitive int key.key
- for indexing the Map
protected V getMapped(int key)
key
- to get value by.null
.public V computeIfAbsent(int key, IntFunction<? extends V> mappingFunction)
IntFunction
and put it in the map.
Primitive specialized version of Map.computeIfAbsent(K, java.util.function.Function<? super K, ? extends V>)
.
key
- to search on.mappingFunction
- to provide a value if the get returns null.public V put(int key, V value)
Map.put(Object, Object)
that takes a primitive int key.public V remove(int key)
Map.remove(Object)
that takes a primitive int 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 Int2ObjectHashMap.KeySet keySet()
public Int2ObjectHashMap.ValueCollection values()
public Int2ObjectHashMap.EntrySet entrySet()
public boolean equals(Object o)
public int hashCode()
protected Object mapNullValue(Object value)
value
- value to mask.protected V unmapNullValue(Object value)
value
- value to unmask.public V replace(int key, V value)
Map.replace(Object, Object)
key
- key with which the specified value is associatedvalue
- value to be associated with the specified keynull
if there was no mapping for the key.public boolean replace(int key, V oldValue, V newValue)
Map.replace(Object, Object, Object)
key
- key with which the specified value is associatedoldValue
- value expected to be associated with the specified keynewValue
- value to be associated with the specified keytrue
if the value was replacedCopyright © 2014-2021 Real Logic Limited. All Rights Reserved.