Class Reference2LongLinkedOpenHashMap<K>
- java.lang.Object
-
- it.unimi.dsi.fastutil.objects.AbstractReference2LongFunction<K>
-
- it.unimi.dsi.fastutil.objects.AbstractReference2LongMap<K>
-
- it.unimi.dsi.fastutil.objects.AbstractReference2LongSortedMap<K>
-
- it.unimi.dsi.fastutil.objects.Reference2LongLinkedOpenHashMap<K>
-
- All Implemented Interfaces:
Function<K,java.lang.Long>
,Hash
,Reference2LongFunction<K>
,Reference2LongMap<K>
,Reference2LongSortedMap<K>
,java.io.Serializable
,java.lang.Cloneable
,java.util.function.Function<K,java.lang.Long>
,java.util.function.ToLongFunction<K>
,java.util.Map<K,java.lang.Long>
,java.util.SortedMap<K,java.lang.Long>
public class Reference2LongLinkedOpenHashMap<K> extends AbstractReference2LongSortedMap<K> implements java.io.Serializable, java.lang.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.objects.AbstractReference2LongMap
AbstractReference2LongMap.BasicEntry<K>, AbstractReference2LongMap.BasicEntrySet<K>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
Hash.Strategy<K>
-
Nested classes/interfaces inherited from interface java.util.Map
java.util.Map.Entry<K extends java.lang.Object,V extends java.lang.Object>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2LongMap
Reference2LongMap.Entry<K>, Reference2LongMap.FastEntrySet<K>
-
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2LongSortedMap
Reference2LongSortedMap.FastSortedEntrySet<K>
-
-
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 Reference2LongLinkedOpenHashMap()
Creates a new hash map with initial expectedHash.DEFAULT_INITIAL_SIZE
entries andHash.DEFAULT_LOAD_FACTOR
as load factor.Reference2LongLinkedOpenHashMap(int expected)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor.Reference2LongLinkedOpenHashMap(int expected, float f)
Creates a new hash map.Reference2LongLinkedOpenHashMap(Reference2LongMap<K> m)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given type-specific one.Reference2LongLinkedOpenHashMap(Reference2LongMap<K> m, float f)
Creates a new hash map copying a given type-specific one.Reference2LongLinkedOpenHashMap(java.util.Map<? extends K,? extends java.lang.Long> m)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given one.Reference2LongLinkedOpenHashMap(java.util.Map<? extends K,? extends java.lang.Long> m, float f)
Creates a new hash map copying a given one.Reference2LongLinkedOpenHashMap(K[] k, long[] v)
Creates a new hash map withHash.DEFAULT_LOAD_FACTOR
as load factor using the elements of two parallel arrays.Reference2LongLinkedOpenHashMap(K[] k, long[] v, float f)
Creates a new hash map using the elements of two parallel arrays.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description long
addTo(K k, long incr)
Adds an increment to value currently associated with a key.void
clear()
Removes all of the mappings from this map (optional operation).Reference2LongLinkedOpenHashMap<K>
clone()
Returns a deep copy of this map.java.util.Comparator<? super K>
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.long
computeLong(K k, java.util.function.BiFunction<? super K,? super java.lang.Long,? extends java.lang.Long> remappingFunction)
Attempts to compute a mapping for the specified key and its current mapped value (ornull
if there is no current mapping).long
computeLongIfAbsent(K k, java.util.function.ToLongFunction<? super K> 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.long
computeLongIfPresent(K k, java.util.function.BiFunction<? super K,? super java.lang.Long,? extends java.lang.Long> 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(java.lang.Object k)
Returns true if this function contains a mapping for the specified key.boolean
containsValue(long v)
Returnstrue
if this map maps one or more keys to the specified value.K
firstKey()
Returns the first key of this map in iteration order.long
getAndMoveToFirst(K 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.long
getAndMoveToLast(K 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.long
getLong(java.lang.Object k)
Returns the value to which the given key is mapped.long
getOrDefault(java.lang.Object k, long 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.Reference2LongSortedMap<K>
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey
.boolean
isEmpty()
ReferenceSortedSet<K>
keySet()
Returns a type-specific-set view of the keys of this map.K
lastKey()
Returns the last key of this map in iteration order.long
mergeLong(K k, long v, java.util.function.BiFunction<? super java.lang.Long,? super java.lang.Long,? extends java.lang.Long> remappingFunction)
If the specified key is not already associated with a value, associates it with the givenvalue
.long
put(K k, long v)
Adds a pair to the map (optional operation).void
putAll(java.util.Map<? extends K,? extends java.lang.Long> m)
long
putAndMoveToFirst(K k, long v)
Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.long
putAndMoveToLast(K k, long v)
Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.long
putIfAbsent(K k, long 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.Reference2LongSortedMap.FastSortedEntrySet<K>
reference2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.boolean
remove(java.lang.Object k, long v)
Removes the entry for the specified key only if it is currently mapped to the specified value.long
removeFirstLong()
Removes the mapping associated with the first key in iteration order.long
removeLastLong()
Removes the mapping associated with the last key in iteration order.long
removeLong(java.lang.Object k)
Removes the mapping with the given key (optional operation).long
replace(K k, long v)
Replaces the entry for the specified key only if it is currently mapped to some value.boolean
replace(K k, long oldValue, long v)
Replaces the entry for the specified key only if currently mapped to the specified value.int
size()
Returns the number of key/value mappings in this map.Reference2LongSortedMap<K>
subMap(K from, K to)
Returns a view of the portion of this sorted map whose keys range fromfromKey
, inclusive, totoKey
, exclusive.Reference2LongSortedMap<K>
tailMap(K 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.LongCollection
values()
Returns a type-specific-set view of the values of this map.-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2LongMap
equals, toString
-
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2LongFunction
defaultReturnValue, defaultReturnValue
-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, forEach, get, put, remove, replaceAll
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2LongFunction
applyAsLong
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2LongMap
computeLongIfAbsentPartial, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
-
Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2LongSortedMap
entrySet
-
-
-
-
Constructor Detail
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(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.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(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.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap()
Creates a new hash map with initial expectedHash.DEFAULT_INITIAL_SIZE
entries andHash.DEFAULT_LOAD_FACTOR
as load factor.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(java.util.Map<? extends K,? extends java.lang.Long> 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.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(java.util.Map<? extends K,? extends java.lang.Long> 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.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(Reference2LongMap<K> 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.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(Reference2LongMap<K> 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.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(K[] k, long[] 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:
java.lang.IllegalArgumentException
- ifk
andv
have different lengths.
-
Reference2LongLinkedOpenHashMap
public Reference2LongLinkedOpenHashMap(K[] k, long[] 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:
java.lang.IllegalArgumentException
- ifk
andv
have different lengths.
-
-
Method Detail
-
putAll
public void putAll(java.util.Map<? extends K,? extends java.lang.Long> m)
Description copied from class:AbstractReference2LongMap
- Specified by:
putAll
in interfacejava.util.Map<K,java.lang.Long>
- Overrides:
putAll
in classAbstractReference2LongMap<K>
-
put
public long put(K k, long v)
Description copied from interface:Reference2LongFunction
Adds a pair to the map (optional operation).- Specified by:
put
in interfaceReference2LongFunction<K>
- 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)
-
addTo
public long addTo(K k, long incr)
Adds an increment to value currently associated with a key.Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
- Parameters:
k
- the key.incr
- the increment.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
removeLong
public long removeLong(java.lang.Object k)
Description copied from interface:Reference2LongFunction
Removes the mapping with the given key (optional operation).- Specified by:
removeLong
in interfaceReference2LongFunction<K>
- 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)
-
removeFirstLong
public long removeFirstLong()
Removes the mapping associated with the first key in iteration order.- Returns:
- the value previously associated with the first key in iteration order.
- Throws:
java.util.NoSuchElementException
- is this map is empty.
-
removeLastLong
public long removeLastLong()
Removes the mapping associated with the last key in iteration order.- Returns:
- the value previously associated with the last key in iteration order.
- Throws:
java.util.NoSuchElementException
- is this map is empty.
-
getAndMoveToFirst
public long getAndMoveToFirst(K 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 long getAndMoveToLast(K 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 long putAndMoveToFirst(K k, long 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 long putAndMoveToLast(K k, long 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.
-
getLong
public long getLong(java.lang.Object k)
Description copied from interface:Reference2LongFunction
Returns the value to which the given key is mapped.- Specified by:
getLong
in interfaceReference2LongFunction<K>
- 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(java.lang.Object k)
Description copied from interface:Reference2LongMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceFunction<K,java.lang.Long>
- Specified by:
containsKey
in interfacejava.util.Map<K,java.lang.Long>
- Specified by:
containsKey
in interfaceReference2LongMap<K>
- Overrides:
containsKey
in classAbstractReference2LongMap<K>
- Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
Map.containsKey(Object)
-
containsValue
public boolean containsValue(long v)
Description copied from interface:Reference2LongMap
Returnstrue
if this map maps one or more keys to the specified value.- Specified by:
containsValue
in interfaceReference2LongMap<K>
- Overrides:
containsValue
in classAbstractReference2LongMap<K>
- See Also:
Map.containsValue(Object)
-
getOrDefault
public long getOrDefault(java.lang.Object k, long 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 interfaceReference2LongMap<K>
- 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 long putIfAbsent(K k, long 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 interfaceReference2LongMap<K>
- 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(java.lang.Object k, long v)
Removes the entry for the specified key only if it is currently mapped to the specified value.- Specified by:
remove
in interfaceReference2LongMap<K>
- 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(K k, long oldValue, long v)
Replaces the entry for the specified key only if currently mapped to the specified value.- Specified by:
replace
in interfaceReference2LongMap<K>
- 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 long replace(K k, long v)
Replaces the entry for the specified key only if it is currently mapped to some value.- Specified by:
replace
in interfaceReference2LongMap<K>
- 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)
-
computeLongIfAbsent
public long computeLongIfAbsent(K k, java.util.function.ToLongFunction<? super K> 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:
computeLongIfAbsent
in interfaceReference2LongMap<K>
- 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)
-
computeLongIfPresent
public long computeLongIfPresent(K k, java.util.function.BiFunction<? super K,? super java.lang.Long,? extends java.lang.Long> 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:
computeLongIfPresent
in interfaceReference2LongMap<K>
- 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)
-
computeLong
public long computeLong(K k, java.util.function.BiFunction<? super K,? super java.lang.Long,? extends java.lang.Long> 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:
computeLong
in interfaceReference2LongMap<K>
- 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)
-
mergeLong
public long mergeLong(K k, long v, java.util.function.BiFunction<? super java.lang.Long,? super java.lang.Long,? extends java.lang.Long> remappingFunction)
If the specified key is not already associated with a value, associates it with the givenvalue
. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result isnull
.- Specified by:
mergeLong
in interfaceReference2LongMap<K>
- Parameters:
k
- key with which the resulting value is to be associated.v
- the 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:Reference2LongMap
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:Reference2LongMap
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()
- Specified by:
isEmpty
in interfacejava.util.Map<K,java.lang.Long>
- Overrides:
isEmpty
in classAbstractReference2LongMap<K>
-
firstKey
public K firstKey()
Returns the first key of this map in iteration order.- Specified by:
firstKey
in interfacejava.util.SortedMap<K,java.lang.Long>
- Returns:
- the first key in iteration order.
-
lastKey
public K lastKey()
Returns the last key of this map in iteration order.- Specified by:
lastKey
in interfacejava.util.SortedMap<K,java.lang.Long>
- Returns:
- the last key in iteration order.
-
tailMap
public Reference2LongSortedMap<K> tailMap(K 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 interfaceReference2LongSortedMap<K>
- Specified by:
tailMap
in interfacejava.util.SortedMap<K,java.lang.Long>
- See Also:
SortedMap.tailMap(Object)
-
headMap
public Reference2LongSortedMap<K> headMap(K 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 interfaceReference2LongSortedMap<K>
- Specified by:
headMap
in interfacejava.util.SortedMap<K,java.lang.Long>
- See Also:
SortedMap.headMap(Object)
-
subMap
public Reference2LongSortedMap<K> subMap(K from, K 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 interfaceReference2LongSortedMap<K>
- Specified by:
subMap
in interfacejava.util.SortedMap<K,java.lang.Long>
- See Also:
SortedMap.subMap(Object,Object)
-
comparator
public java.util.Comparator<? super K> 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 interfaceReference2LongSortedMap<K>
- Specified by:
comparator
in interfacejava.util.SortedMap<K,java.lang.Long>
- See Also:
SortedMap.comparator()
-
reference2LongEntrySet
public Reference2LongSortedMap.FastSortedEntrySet<K> reference2LongEntrySet()
Description copied from interface:Reference2LongSortedMap
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:
reference2LongEntrySet
in interfaceReference2LongMap<K>
- Specified by:
reference2LongEntrySet
in interfaceReference2LongSortedMap<K>
- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
Reference2LongSortedMap.entrySet()
-
keySet
public ReferenceSortedSet<K> keySet()
Description copied from class:AbstractReference2LongSortedMap
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 interfacejava.util.Map<K,java.lang.Long>
- Specified by:
keySet
in interfaceReference2LongMap<K>
- Specified by:
keySet
in interfaceReference2LongSortedMap<K>
- Specified by:
keySet
in interfacejava.util.SortedMap<K,java.lang.Long>
- Overrides:
keySet
in classAbstractReference2LongSortedMap<K>
- 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 LongCollection values()
Description copied from class:AbstractReference2LongSortedMap
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 interfacejava.util.Map<K,java.lang.Long>
- Specified by:
values
in interfaceReference2LongMap<K>
- Specified by:
values
in interfaceReference2LongSortedMap<K>
- Specified by:
values
in interfacejava.util.SortedMap<K,java.lang.Long>
- Overrides:
values
in classAbstractReference2LongSortedMap<K>
- 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 Reference2LongLinkedOpenHashMap<K> 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.- Specified by:
hashCode
in interfacejava.util.Map<K,java.lang.Long>
- Overrides:
hashCode
in classAbstractReference2LongMap<K>
- Returns:
- a hash code for this map.
-
-