Class Short2ObjectLinkedOpenHashMap<V>
- java.lang.Object
-
- it.unimi.dsi.fastutil.shorts.AbstractShort2ObjectFunction<V>
-
- it.unimi.dsi.fastutil.shorts.AbstractShort2ObjectMap<V>
-
- it.unimi.dsi.fastutil.shorts.AbstractShort2ObjectSortedMap<V>
-
- it.unimi.dsi.fastutil.shorts.Short2ObjectLinkedOpenHashMap<V>
-
- All Implemented Interfaces:
Function<Short,V>
,Hash
,Short2ObjectFunction<V>
,Short2ObjectMap<V>
,Short2ObjectSortedMap<V>
,Serializable
,Cloneable
,Function<Short,V>
,IntFunction<V>
,Map<Short,V>
,SortedMap<Short,V>
public class Short2ObjectLinkedOpenHashMap<V> extends AbstractShort2ObjectSortedMap<V> implements Serializable, Cloneable, Hash
A type-specific linked hash map with with a fast, small-footprint implementation.Instances of this class use a hash table to represent a map. The table is filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size; however, the table is never reduced to a size smaller than that at creation time: this approach makes it possible to create maps with a large capacity in which insertions and deletions do not cause immediately rehashing. Moreover, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.
Note that
clear()
does not modify the hash table size. Rather, a family of trimming methods lets you control the size of the table; this is particularly useful if you reuse instances of this class.Iterators generated by this map will enumerate pairs in the same order in which they have been added to the map (addition of pairs whose key is already present in the map does not change the iteration order). Note that this order has nothing in common with the natural order of the keys. The order is kept by means of a doubly linked list, represented via an array of longs parallel to the table.
This class implements the interface of a sorted map, so to allow easy access of the iteration order: for instance, you can get the first key in iteration order with
firstKey()
without having to create an iterator; however, this class partially violates theSortedMap
contract because all submap methods throw an exception andcomparator()
returns alwaysnull
.Additional methods, such as
getAndMoveToFirst()
, make it easy to use instances of this class as a cache (e.g., with LRU policy).The iterators provided by the views of this class using are type-specific list iterators, and can be started at any element which is a key of the map, or a
NoSuchElementException
exception will be thrown. If, however, the provided element is not the first or last key in the map, the first access to the list index will require linear time, as in the worst case the entire key set must be scanned in iteration order to retrieve the positional index of the starting key. If you use just the methods of a type-specificBidirectionalIterator
, however, all operations will be performed in constant time.- See Also:
Hash
,HashCommon
, Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ObjectMap
AbstractShort2ObjectMap.BasicEntry<V>, AbstractShort2ObjectMap.BasicEntrySet<V>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
Hash.Strategy<K>
-
Nested classes/interfaces inherited from interface java.util.Map
Map.Entry<K extends Object,V extends Object>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2ObjectMap
Short2ObjectMap.Entry<V>, Short2ObjectMap.FastEntrySet<V>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2ObjectSortedMap
Short2ObjectSortedMap.FastSortedEntrySet<V>
-
-
Field Summary
-
Fields inherited from interface it.unimi.dsi.fastutil.Hash
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR
-
-
Constructor Summary
Constructors Constructor Description Short2ObjectLinkedOpenHashMap()
Creates a new hash map with initial expectedHash.DEFAULT_INITIAL_SIZE
entries andHash.DEFAULT_LOAD_FACTOR
as load factor.Short2ObjectLinkedOpenHashMap(int expected)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor.Short2ObjectLinkedOpenHashMap(int expected, float f)
Creates a new hash map.Short2ObjectLinkedOpenHashMap(short[] k, V[] v)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor using the elements of two parallel arrays.Short2ObjectLinkedOpenHashMap(short[] k, V[] v, float f)
Creates a new hash map using the elements of two parallel arrays.Short2ObjectLinkedOpenHashMap(Short2ObjectMap<V> m)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given type-specific one.Short2ObjectLinkedOpenHashMap(Short2ObjectMap<V> m, float f)
Creates a new hash map copying a given type-specific one.Short2ObjectLinkedOpenHashMap(Map<? extends Short,? extends V> m)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given one.Short2ObjectLinkedOpenHashMap(Map<? extends Short,? extends V> m, float f)
Creates a new hash map copying a given one.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
Removes all of the mappings from this map (optional operation).Short2ObjectLinkedOpenHashMap<V>
clone()
Returns a deep copy of this map.ShortComparator
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.V
compute(short k, BiFunction<? super Short,? super V,? extends V> remappingFunction)
Attempts to compute a mapping for the specified key and its current mapped value (ornull
if there is no current mapping).V
computeIfAbsent(short k, IntFunction<? extends V> mappingFunction)
If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.V
computeIfPresent(short k, BiFunction<? super Short,? super V,? extends V> remappingFunction)
If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.boolean
containsKey(short k)
Returns true if this function contains a mapping for the specified key.boolean
containsValue(Object v)
short
firstShortKey()
Returns the first key of this map in iteration order.V
get(short k)
Returns the value to which the given key is mapped.V
getAndMoveToFirst(short k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.V
getAndMoveToLast(short k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.V
getOrDefault(short k, V defaultValue)
Returns the value to which the specified key is mapped, or thedefaultValue
if this map contains no mapping for the key.int
hashCode()
Returns a hash code for this map.Short2ObjectSortedMap<V>
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.boolean
isEmpty()
ShortSortedSet
keySet()
Returns a type-specific-set view of the keys of this map.short
lastShortKey()
Returns the last key of this map in iteration order.V
merge(short k, V v, BiFunction<? super V,? super V,? extends V> remappingFunction)
If the specified key is not already associated with a value or is associated with null, associates it with the given non-nullvalue
.V
put(short k, V v)
Adds a pair to the map (optional operation).void
putAll(Map<? extends Short,? extends V> m)
V
putAndMoveToFirst(short k, V v)
Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.V
putAndMoveToLast(short k, V v)
Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.V
putIfAbsent(short k, V v)
If the specified key is not already associated with a value, associates it with the given value and returns the default return value, else returns the current value.V
remove(short k)
Removes the mapping with the given key (optional operation).boolean
remove(short k, Object v)
Removes the entry for the specified key only if it is currently mapped to the specified value.V
removeFirst()
Removes the mapping associated with the first key in iteration order.V
removeLast()
Removes the mapping associated with the last key in iteration order.V
replace(short k, V v)
Replaces the entry for the specified key only if it is currently mapped to some value.boolean
replace(short k, V oldValue, V v)
Replaces the entry for the specified key only if currently mapped to the specified value.Short2ObjectSortedMap.FastSortedEntrySet<V>
short2ObjectEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.int
size()
Returns the number of key/value mappings in this map.Short2ObjectSortedMap<V>
subMap(short from, short to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Short2ObjectSortedMap<V>
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.boolean
trim()
Rehashes the map, making the table as small as possible.boolean
trim(int n)
Rehashes this map if the table is too large.ObjectCollection<V>
values()
Returns a type-specific-set view of the values of this map.-
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ObjectMap
equals, toString
-
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ObjectFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface java.util.Map
containsKey, equals, forEach, get, put, remove, replaceAll
-
Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2ObjectFunction
apply
-
Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2ObjectMap
compute, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
-
-
-
-
Constructor Detail
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(int expected, float f)
Creates a new hash map.The actual table size will be the least power of two greater than
expected
/f
.- Parameters:
expected
- the expected number of elements in the hash map.f
- the load factor.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(int expected)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor.- Parameters:
expected
- the expected number of elements in the hash map.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap()
Creates a new hash map with initial expectedHash.DEFAULT_INITIAL_SIZE
entries andHash.DEFAULT_LOAD_FACTOR
as load factor.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(Map<? extends Short,? extends V> m, float f)
Creates a new hash map copying a given one.- Parameters:
m
- aMap
to be copied into the new hash map.f
- the load factor.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(Map<? extends Short,? extends V> m)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given one.- Parameters:
m
- aMap
to be copied into the new hash map.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(Short2ObjectMap<V> m, float f)
Creates a new hash map copying a given type-specific one.- Parameters:
m
- a type-specific map to be copied into the new hash map.f
- the load factor.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(Short2ObjectMap<V> m)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given type-specific one.- Parameters:
m
- a type-specific map to be copied into the new hash map.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(short[] k, V[] v, float f)
Creates a new hash map using the elements of two parallel arrays.- Parameters:
k
- the array of keys of the new hash map.v
- the array of corresponding values in the new hash map.f
- the load factor.- Throws:
IllegalArgumentException
- ifk
andv
have different lengths.
-
Short2ObjectLinkedOpenHashMap
public Short2ObjectLinkedOpenHashMap(short[] k, V[] v)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor using the elements of two parallel arrays.- Parameters:
k
- the array of keys of the new hash map.v
- the array of corresponding values in the new hash map.- Throws:
IllegalArgumentException
- ifk
andv
have different lengths.
-
-
Method Detail
-
putAll
public void putAll(Map<? extends Short,? extends V> m)
Description copied from class:AbstractShort2ObjectMap
-
put
public V put(short k, V v)
Description copied from interface:Short2ObjectFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceShort2ObjectFunction<V>
- Parameters:
k
- the key.v
- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
Function.put(Object,Object)
-
remove
public V remove(short k)
Description copied from interface:Short2ObjectFunction
Removes the mapping with the given key (optional operation).- Specified by:
remove
in interfaceShort2ObjectFunction<V>
- Parameters:
k
- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
Function.remove(Object)
-
removeFirst
public V removeFirst()
Removes the mapping associated with the first key in iteration order.- Returns:
- the value previously associated with the first key in iteration order.
- Throws:
NoSuchElementException
- is this map is empty.
-
removeLast
public V removeLast()
Removes the mapping associated with the last key in iteration order.- Returns:
- the value previously associated with the last key in iteration order.
- Throws:
NoSuchElementException
- is this map is empty.
-
getAndMoveToFirst
public V getAndMoveToFirst(short k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
-
getAndMoveToLast
public V getAndMoveToLast(short k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
-
putAndMoveToFirst
public V putAndMoveToFirst(short k, V v)
Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.- Parameters:
k
- the key.v
- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
putAndMoveToLast
public V putAndMoveToLast(short k, V v)
Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.- Parameters:
k
- the key.v
- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
get
public V get(short k)
Description copied from interface:Short2ObjectFunction
Returns the value to which the given key is mapped.- Specified by:
get
in interfaceShort2ObjectFunction<V>
- Parameters:
k
- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
- See Also:
Function.get(Object)
-
containsKey
public boolean containsKey(short k)
Description copied from interface:Short2ObjectMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceShort2ObjectFunction<V>
- Specified by:
containsKey
in interfaceShort2ObjectMap<V>
- Overrides:
containsKey
in classAbstractShort2ObjectMap<V>
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
Map.containsKey(Object)
-
containsValue
public boolean containsValue(Object v)
- Specified by:
containsValue
in interfaceMap<Short,V>
- Overrides:
containsValue
in classAbstractShort2ObjectMap<V>
-
getOrDefault
public V getOrDefault(short k, V defaultValue)
Returns the value to which the specified key is mapped, or thedefaultValue
if this map contains no mapping for the key.- Specified by:
getOrDefault
in interfaceShort2ObjectMap<V>
- Parameters:
k
- the key.defaultValue
- the default mapping of the key.- Returns:
- the value to which the specified key is mapped, or the
defaultValue
if this map contains no mapping for the key. - See Also:
Map.getOrDefault(Object, Object)
-
putIfAbsent
public V putIfAbsent(short k, V v)
If the specified key is not already associated with a value, associates it with the given value and returns the default return value, else returns the current value.- Specified by:
putIfAbsent
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is to be associated.v
- value to be associated with the specified key.- Returns:
- the previous value associated with the specified key, or the default return value if there was no mapping for the key.
- See Also:
Map.putIfAbsent(Object, Object)
-
remove
public boolean remove(short k, Object v)
Removes the entry for the specified key only if it is currently mapped to the specified value.- Specified by:
remove
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is associated.v
- value expected to be associated with the specified key.- Returns:
true
if the value was removed.- See Also:
Map.remove(Object, Object)
-
replace
public boolean replace(short k, V oldValue, V v)
Replaces the entry for the specified key only if currently mapped to the specified value.- Specified by:
replace
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is associated.oldValue
- value expected to be associated with the specified key.v
- value to be associated with the specified key.- Returns:
true
if the value was replaced.- See Also:
Map.replace(Object, Object, Object)
-
replace
public V replace(short k, V v)
Replaces the entry for the specified key only if it is currently mapped to some value.- Specified by:
replace
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is associated.v
- value to be associated with the specified key.- Returns:
- the previous value associated with the specified key, or the default return value if there was no mapping for the key.
- See Also:
Map.replace(Object, Object)
-
computeIfAbsent
public V computeIfAbsent(short k, IntFunction<? extends V> mappingFunction)
If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.Note that contrarily to the default computeIfAbsent(), it is not possible to not add a value for a given key, since the
mappingFunction
cannot returnnull
. If such a behavior is needed, please use the corresponding nullable version.- Specified by:
computeIfAbsent
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is to be associated.mappingFunction
- the function to compute a value.- Returns:
- the current (existing or computed) value associated with the specified key.
- See Also:
Map.computeIfAbsent(Object, java.util.function.Function)
-
computeIfPresent
public V computeIfPresent(short k, BiFunction<? super Short,? super V,? extends V> remappingFunction)
If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.- Specified by:
computeIfPresent
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is to be associated.remappingFunction
- the function to compute a value.- Returns:
- the new value associated with the specified key, or the default return value if none.
- See Also:
Map.computeIfPresent(Object, java.util.function.BiFunction)
-
compute
public V compute(short k, BiFunction<? super Short,? super V,? extends V> remappingFunction)
Attempts to compute a mapping for the specified key and its current mapped value (ornull
if there is no current mapping).If the function returns
null
, the mapping is removed (or remains absent if initially absent). If the function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.- Specified by:
compute
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the specified value is to be associated.remappingFunction
- the function to compute a value.- Returns:
- the new value associated with the specified key, or the default return value if none.
- See Also:
Map.compute(Object, java.util.function.BiFunction)
-
merge
public V merge(short k, V v, BiFunction<? super V,? super V,? extends V> remappingFunction)
If the specified key is not already associated with a value or is associated with null, associates it with the given non-nullvalue
. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result isnull
.- Specified by:
merge
in interfaceShort2ObjectMap<V>
- Parameters:
k
- key with which the resulting value is to be associated.v
- the non-null
value to be merged with the existing value associated with the key or, if no existing value is associated with the key, to be associated with the key.remappingFunction
- the function to recompute a value if present.- Returns:
- the new value associated with the specified key, or the default return value if no value is associated with the key.
- See Also:
Map.merge(Object, Object, java.util.function.BiFunction)
-
clear
public void clear()
Description copied from interface:Short2ObjectMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
size
public int size()
Description copied from interface:Short2ObjectMap
Returns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
.
-
isEmpty
public boolean isEmpty()
-
firstShortKey
public short firstShortKey()
Returns the first key of this map in iteration order.- Specified by:
firstShortKey
in interfaceShort2ObjectSortedMap<V>
- Returns:
- the first key in iteration order.
- See Also:
SortedMap.firstKey()
-
lastShortKey
public short lastShortKey()
Returns the last key of this map in iteration order.- Specified by:
lastShortKey
in interfaceShort2ObjectSortedMap<V>
- Returns:
- the last key in iteration order.
- See Also:
SortedMap.lastKey()
-
tailMap
public Short2ObjectSortedMap<V> tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey
.Note that this specification strengthens the one given in
SortedMap.tailMap(Object)
.This implementation just throws an
UnsupportedOperationException
.- Specified by:
tailMap
in interfaceShort2ObjectSortedMap<V>
- See Also:
SortedMap.tailMap(Object)
-
headMap
public Short2ObjectSortedMap<V> headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.Note that this specification strengthens the one given in
SortedMap.headMap(Object)
.This implementation just throws an
UnsupportedOperationException
.- Specified by:
headMap
in interfaceShort2ObjectSortedMap<V>
- See Also:
SortedMap.headMap(Object)
-
subMap
public Short2ObjectSortedMap<V> subMap(short from, short to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object)
.This implementation just throws an
UnsupportedOperationException
.- Specified by:
subMap
in interfaceShort2ObjectSortedMap<V>
- See Also:
SortedMap.subMap(Object,Object)
-
comparator
public ShortComparator comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.Note that this specification strengthens the one given in
SortedMap.comparator()
.This implementation just returns
null
.- Specified by:
comparator
in interfaceShort2ObjectSortedMap<V>
- Specified by:
comparator
in interfaceSortedMap<Short,V>
- See Also:
SortedMap.comparator()
-
short2ObjectEntrySet
public Short2ObjectSortedMap.FastSortedEntrySet<V> short2ObjectEntrySet()
Description copied from interface:Short2ObjectSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map.Note that this specification strengthens the one given in the corresponding type-specific unsorted map.
- Specified by:
short2ObjectEntrySet
in interfaceShort2ObjectMap<V>
- Specified by:
short2ObjectEntrySet
in interfaceShort2ObjectSortedMap<V>
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Short2ObjectSortedMap.entrySet()
-
keySet
public ShortSortedSet keySet()
Description copied from class:AbstractShort2ObjectSortedMap
Returns a type-specific-set view of the keys of this map.The view is backed by the set returned by
Map.entrySet()
. Note that no attempt is made at caching the result of this method, as this would require adding some attributes that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient ad-hoc implementations.The view is backed by the sorted set returned by
Map.entrySet()
. Note that no attempt is made at caching the result of this method, as this would require adding some attributes that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient ad-hoc implementations.- Specified by:
keySet
in interfaceMap<Short,V>
- Specified by:
keySet
in interfaceShort2ObjectMap<V>
- Specified by:
keySet
in interfaceShort2ObjectSortedMap<V>
- Specified by:
keySet
in interfaceSortedMap<Short,V>
- Overrides:
keySet
in classAbstractShort2ObjectSortedMap<V>
- Returns:
- a sorted set view of the keys of this map; it may be safely cast to a type-specific interface.
- See Also:
Map.keySet()
-
values
public ObjectCollection<V> values()
Description copied from class:AbstractShort2ObjectSortedMap
Returns a type-specific-set view of the values of this map.The view is backed by the set returned by
Map.entrySet()
. Note that no attempt is made at caching the result of this method, as this would require adding some attributes that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient ad-hoc implementations.The view is backed by the sorted set returned by
Map.entrySet()
. Note that no attempt is made at caching the result of this method, as this would require adding some attributes that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient ad-hoc implementations.- Specified by:
values
in interfaceMap<Short,V>
- Specified by:
values
in interfaceShort2ObjectMap<V>
- Specified by:
values
in interfaceShort2ObjectSortedMap<V>
- Specified by:
values
in interfaceSortedMap<Short,V>
- Overrides:
values
in classAbstractShort2ObjectSortedMap<V>
- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
Map.values()
-
trim
public boolean trim()
Rehashes the map, making the table as small as possible.This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimize access speed and size.
If the table size is already the minimum possible, this method does nothing.
- Returns:
- true if there was enough memory to trim the map.
- See Also:
trim(int)
-
trim
public boolean trim(int n)
Rehashes this map if the table is too large.Let N be the smallest table size that can hold
max(n,
entries, still satisfying the load factor. If the current table size is smaller than or equal to N, this method does nothing. Otherwise, it rehashes this map in a table of size N.size()
)This method is useful when reusing maps. Clearing a map leaves the table size untouched. If you are reusing a map many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient maps.
- Parameters:
n
- the threshold for the trimming.- Returns:
- true if there was enough memory to trim the map.
- See Also:
trim()
-
clone
public Short2ObjectLinkedOpenHashMap<V> clone()
Returns a deep copy of this map.This method performs a deep copy of this hash map; the data stored in the map, however, is not cloned. Note that this makes a difference only for object keys.
- Returns:
- a deep copy of this map.
-
hashCode
public int hashCode()
Returns a hash code for this map. This method overrides the generic method provided by the superclass. Sinceequals()
is not overriden, it is important that the value returned by this method is the same value as the one returned by the overriden method.
-
-