Package arc.struct
Class LongMap<V>
java.lang.Object
arc.struct.LongMap<V>
- All Implemented Interfaces:
Iterable<LongMap.Entry<V>>
An unordered map that uses long keys. This implementation is a cuckoo hash map using 3 hashes, random walking, and a small
stash for problematic keys. Null values are allowed. No allocation is done except when growing the table size.
This map performs very fast get, containsKey, and remove (typically O(1), worst case O(log(n))). Put may be a bit slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances the map will have to rehash to the next higher POT size.
This map performs very fast get, containsKey, and remove (typically O(1), worst case O(log(n))). Put may be a bit slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances the map will have to rehash to the next higher POT size.
-
Nested Class Summary
Modifier and TypeClassDescriptionstatic class
static class
static class
static class
-
Field Summary
-
Constructor Summary
ConstructorDescriptionLongMap()
Creates a new map with an initial capacity of 51 and a load factor of 0.8.LongMap
(int initialCapacity) Creates a new map with a load factor of 0.8.LongMap
(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor.Creates a new map identical to the specified map. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
void
clear
(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.boolean
containsKey
(long key) boolean
containsValue
(Object value, boolean identity) Returns true if the specified value is in the map.void
ensureCapacity
(int additionalCapacity) Increases the size of the backing array to accommodate the specified number of additional items.entries()
Returns an iterator for the entries in the map.boolean
long
Returns the key for the specified value, or notFound if it is not in the map.get
(long key) int
hashCode()
boolean
isEmpty()
Returns true if the map is empty.iterator()
keys()
Returns an iterator for the keys in the map.void
remove
(long key) void
shrink
(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less.toString()
values()
Returns an iterator for the values in the map.Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Field Details
-
size
public int size
-
-
Constructor Details
-
LongMap
public LongMap()Creates a new map with an initial capacity of 51 and a load factor of 0.8. -
LongMap
public LongMap(int initialCapacity) Creates a new map with a load factor of 0.8.- Parameters:
initialCapacity
- If not a power of two, it is increased to the next nearest power of two.
-
LongMap
public LongMap(int initialCapacity, float loadFactor) Creates a new map with the specified initial capacity and load factor. This map will hold initialCapacity items before growing the backing table.- Parameters:
initialCapacity
- If not a power of two, it is increased to the next nearest power of two.
-
LongMap
Creates a new map identical to the specified map.
-
-
Method Details
-
put
-
putAll
-
get
-
get
-
remove
-
isEmpty
public boolean isEmpty()Returns true if the map is empty. -
shrink
public void shrink(int maximumCapacity) Reduces the size of the backing arrays to be the specified capacity or less. If the capacity is already less, nothing is done. If the map contains more items than the specified capacity, the next highest power of two capacity is used instead. -
clear
public void clear(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger. -
clear
public void clear() -
containsValue
Returns true if the specified value is in the map. Note this traverses the entire map and compares every value, which may be an expensive operation. -
containsKey
public boolean containsKey(long key) -
findKey
Returns the key for the specified value, or notFound if it is not in the map. Note this traverses the entire map and compares every value, which may be an expensive operation.- Parameters:
identity
- If true, uses == to compare the specified value with values in the map. If false, usesequals(Object)
.
-
ensureCapacity
public void ensureCapacity(int additionalCapacity) Increases the size of the backing array to accommodate the specified number of additional items. Useful before adding many items to avoid multiple backing array resizes. -
hashCode
public int hashCode() -
equals
-
toString
-
iterator
-
entries
Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use theLongMap.Entries
constructor for nested or multithreaded iteration. -
values
Returns an iterator for the values in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use theLongMap.Entries
constructor for nested or multithreaded iteration. -
keys
Returns an iterator for the keys in the map. Remove is supported. Note that the same iterator instance is returned each time this method is called. Use theLongMap.Entries
constructor for nested or multithreaded iteration.
-