Reference2ReferenceLinkedOpenHashMap (fastutil-object-common 8.3.1 API)

java.lang.Object
- it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceFunction<K,V>
- - it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap<K,V>
  - - it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceSortedMap<K,V>
    - - it.unimi.dsi.fastutil.objects.Reference2ReferenceLinkedOpenHashMap<K,V>

All Implemented Interfaces:

Hash, Reference2ReferenceFunction<K,V>, Reference2ReferenceMap<K,V>, Reference2ReferenceSortedMap<K,V>, Serializable, Cloneable, Function<K,V>, Map<K,V>, SortedMap<K,V>
```
public class Reference2ReferenceLinkedOpenHashMap<K,V>
extends AbstractReference2ReferenceSortedMap<K,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 the SortedMap contract because all submap methods throw an exception and comparator() returns always null.
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-specific BidirectionalIterator, 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.AbstractReference2ReferenceSortedMap
  AbstractReference2ReferenceSortedMap.KeySetIterator<K,V>, AbstractReference2ReferenceSortedMap.ValuesCollection, AbstractReference2ReferenceSortedMap.ValuesIterator<K,V>
- Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap
  AbstractReference2ReferenceMap.BasicEntry<K,V>, AbstractReference2ReferenceMap.BasicEntrySet<K,V>
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
  Hash.Strategy<K>
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceSortedMap
  Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap
  Reference2ReferenceMap.Entry<K,V>, Reference2ReferenceMap.FastEntrySet<K,V>

Field Summary

Fields
Modifier and Type	Field and Description
`protected boolean`	`containsNullKey` Whether this map contains the key zero.
`protected Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>`	`entries` Cached set of entries.
`protected float`	`f` The acceptable load factor.
`protected int`	`first` The index of the first entry in iteration order.
`protected K[]`	`key` The array of keys.
`protected ReferenceSortedSet<K>`	`keys` Cached set of keys.
`protected int`	`last` The index of the last entry in iteration order.
`protected long[]`	`link` For each entry, the next and the previous entry in iteration order, stored as `((prev & 0xFFFFFFFFL) << 32) \| (next & 0xFFFFFFFFL)`.
`protected int`	`mask` The mask for wrapping a position counter.
`protected int`	`maxFill` Threshold after which we rehash.
`protected int`	`minN` We never resize below this threshold, which is the construction-time {#n}.
`protected int`	`n` The current table size.
`protected int`	`size` Number of entries in the set (including the key zero, if present).
`protected V[]`	`value` The array of values.
`protected ReferenceCollection<V>`	`values` Cached collection of values.

Fields inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceFunction
defRetValue

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 and Description
`Reference2ReferenceLinkedOpenHashMap()` Creates a new hash map with initial expected `Hash.DEFAULT_INITIAL_SIZE` entries and `Hash.DEFAULT_LOAD_FACTOR` as load factor.
`Reference2ReferenceLinkedOpenHashMap(int expected)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor.
`Reference2ReferenceLinkedOpenHashMap(int expected, float f)` Creates a new hash map.
`Reference2ReferenceLinkedOpenHashMap(K[] k, V[] v)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor using the elements of two parallel arrays.
`Reference2ReferenceLinkedOpenHashMap(K[] k, V[] v, float f)` Creates a new hash map using the elements of two parallel arrays.
`Reference2ReferenceLinkedOpenHashMap(Map<? extends K,? extends V> m)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying a given one.
`Reference2ReferenceLinkedOpenHashMap(Map<? extends K,? extends V> m, float f)` Creates a new hash map copying a given one.
`Reference2ReferenceLinkedOpenHashMap(Reference2ReferenceMap<K,V> m)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying a given type-specific one.
`Reference2ReferenceLinkedOpenHashMap(Reference2ReferenceMap<K,V> m, float f)` Creates a new hash map copying a given type-specific one.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`clear()` Removes all of the mappings from this map (optional operation).
`Reference2ReferenceLinkedOpenHashMap<K,V>`	`clone()` Returns a deep copy of this map.
`Comparator<? super K>`	`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`boolean`	`containsKey(Object k)` Returns true if this function contains a mapping for the specified key.
`boolean`	`containsValue(Object v)`
`K`	`firstKey()` Returns the first key of this map in iteration order.
`protected void`	`fixPointers(int i)` Modifies the `link` vector so that the given entry is removed.
`protected void`	`fixPointers(int s, int d)` Modifies the `link` vector for a shift from s to d.
`V`	`get(Object k)` Returns the value to which the given key is mapped.
`V`	`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.
`V`	`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.
`int`	`hashCode()` Returns a hash code for this map.
`Reference2ReferenceSortedMap<K,V>`	`headMap(K to)` Returns a view of the portion of this sorted map whose keys are strictly less than `toKey`.
`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.
`V`	`put(K k, V v)` Adds a pair to the map (optional operation).
`void`	`putAll(Map<? extends K,? extends V> m)`
`V`	`putAndMoveToFirst(K 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(K 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.
`Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>`	`reference2ReferenceEntrySet()` Returns a type-specific sorted-set view of the mappings contained in this map.
`protected void`	`rehash(int newN)` Rehashes the map.
`V`	`remove(Object k)` Removes the mapping with the given key (optional operation).
`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.
`protected void`	`shiftKeys(int pos)` Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
`int`	`size()` Returns the number of key/value mappings in this map.
`Reference2ReferenceSortedMap<K,V>`	`subMap(K from, K to)` Returns a view of the portion of this sorted map whose keys range from `fromKey`, inclusive, to `toKey`, exclusive.
`Reference2ReferenceSortedMap<K,V>`	`tailMap(K from)` Returns a view of the portion of this sorted map whose keys are greater than or equal to `fromKey`.
`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.
`ReferenceCollection<V>`	`values()` Returns a type-specific-set view of the values of this map.

Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap
equals, toString

Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceFunction
defaultReturnValue, defaultReturnValue

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceSortedMap
entrySet

Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap
defaultReturnValue, defaultReturnValue

Methods inherited from interface it.unimi.dsi.fastutil.Function
apply

Methods inherited from interface java.util.function.Function
andThen, compose, identity

Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll

- Field Detail
  - key
```
protected transient K[] key
```
    The array of keys.
  - value
```
protected transient V[] value
```
    The array of values.
  - mask
```
protected transient int mask
```
    The mask for wrapping a position counter.
  - containsNullKey
```
protected transient boolean containsNullKey
```
    Whether this map contains the key zero.
  - first
```
protected transient int first
```
    The index of the first entry in iteration order. It is valid iff size is nonzero; otherwise, it contains -1.
  - last
```
protected transient int last
```
    The index of the last entry in iteration order. It is valid iff size is nonzero; otherwise, it contains -1.
  - link
```
protected transient long[] link
```
    For each entry, the next and the previous entry in iteration order, stored as ((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL). The first entry contains predecessor -1, and the last entry contains successor -1.
  - n
```
protected transient int n
```
    The current table size.
  - maxFill
```
protected transient int maxFill
```
    Threshold after which we rehash. It must be the table size times f.
  - minN
```
protected final transient int minN
```
    We never resize below this threshold, which is the construction-time {#n}.
  - size
```
protected int size
```
    Number of entries in the set (including the key zero, if present).
  - f
```
protected final float f
```
    The acceptable load factor.
  - entries
```
protected transient Reference2ReferenceSortedMap.FastSortedEntrySet<K,V> entries
```
    Cached set of entries.
  - keys
```
protected transient ReferenceSortedSet<K> keys
```
    Cached set of keys.
  - values
```
protected transient ReferenceCollection<V> values
```
    Cached collection of values.
- Constructor Detail
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(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.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(int expected)
```
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
    
    Parameters:
    
    expected - the expected number of elements in the hash map.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap()
```
    Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(Map<? extends K,? extends V> m,
                                            float f)
```
    Creates a new hash map copying a given one.
    
    Parameters:
    
    m - a Map to be copied into the new hash map.
    
    f - the load factor.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(Map<? extends K,? extends V> m)
```
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
    
    Parameters:
    
    m - a Map to be copied into the new hash map.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(Reference2ReferenceMap<K,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.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(Reference2ReferenceMap<K,V> m)
```
    Creates a new hash map with Hash.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.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(K[] 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 - if k and v have different lengths.
  - Reference2ReferenceLinkedOpenHashMap
```
public Reference2ReferenceLinkedOpenHashMap(K[] k,
                                            V[] v)
```
    Creates a new hash map with Hash.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 - if k and v have different lengths.
- Method Detail
  - putAll
```
public void putAll(Map<? extends K,? extends V> m)
```
    Description copied from class: AbstractReference2ReferenceMap
    
    Specified by:
    
    putAll in interface Map<K,V>
    
    Overrides:
    
    putAll in class AbstractReference2ReferenceMap<K,V>
  - put
```
public V put(K k,
             V v)
```
    Description copied from interface: Reference2ReferenceFunction
    
    Adds a pair to the map (optional operation).
    
    Specified by:
    
    put in interface Reference2ReferenceFunction<K,V>
    
    Specified by:
    
    put in interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    put in interface Map<K,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)
  - shiftKeys
```
protected final void shiftKeys(int pos)
```
    Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
    
    Parameters:
    
    pos - a starting position.
  - remove
```
public V remove(Object k)
```
    Description copied from interface: Reference2ReferenceFunction
    
    Removes the mapping with the given key (optional operation).
    
    Specified by:
    
    remove in interface Reference2ReferenceFunction<K,V>
    
    Specified by:
    
    remove in interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    remove in interface Map<K,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(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 V 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 V putAndMoveToFirst(K 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(K 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(Object k)
```
    Description copied from interface: Reference2ReferenceFunction
    
    Returns the value to which the given key is mapped.
    
    Specified by:
    
    get in interface Reference2ReferenceFunction<K,V>
    
    Specified by:
    
    get in interface Map<K,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(Object k)
```
    Description copied from interface: Reference2ReferenceMap
    
    Returns true if this function contains a mapping for the specified key.
    
    Specified by:
    
    containsKey in interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    containsKey in interface Map<K,V>
    
    Overrides:
    
    containsKey in class AbstractReference2ReferenceMap<K,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 interface Map<K,V>
    
    Overrides:
    
    containsValue in class AbstractReference2ReferenceMap<K,V>
  - clear
```
public void clear()
```
    Description copied from interface: Reference2ReferenceMap
    
    Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
    
    Specified by:
    
    clear in interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    clear in interface Map<K,V>
    
    See Also:
    
    Map.clear()
  - size
```
public int size()
```
    Description copied from interface: Reference2ReferenceMap
    
    Returns the number of key/value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.
    
    Specified by:
    
    size in interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    size in interface Map<K,V>
    
    Returns:
    
    the number of key-value mappings in this map.
    
    See Also:
    
    Size64
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface Map<K,V>
    
    Overrides:
    
    isEmpty in class AbstractReference2ReferenceMap<K,V>
  - fixPointers
```
protected void fixPointers(int i)
```
    Modifies the link vector so that the given entry is removed. This method will complete in constant time.
    
    Parameters:
    
    i - the index of an entry.
  - fixPointers
```
protected void fixPointers(int s,
                           int d)
```
    Modifies the link vector for a shift from s to d.
    This method will complete in constant time.
    
    Parameters:
    
    s - the source position.
    
    d - the destination position.
  - firstKey
```
public K firstKey()
```
    Returns the first key of this map in iteration order.
    
    Specified by:
    
    firstKey in interface SortedMap<K,V>
    
    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 interface SortedMap<K,V>
    
    Returns:
    
    the last key in iteration order.
  - tailMap
```
public Reference2ReferenceSortedMap<K,V> tailMap(K from)
```
    Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
    Note that this specification strengthens the one given in SortedMap.tailMap(Object).
    This implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    tailMap in interface Reference2ReferenceSortedMap<K,V>
    
    Specified by:
    
    tailMap in interface SortedMap<K,V>
    
    See Also:
    
    SortedMap.tailMap(Object)
  - headMap
```
public Reference2ReferenceSortedMap<K,V> headMap(K to)
```
    Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
    Note that this specification strengthens the one given in SortedMap.headMap(Object).
    This implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    headMap in interface Reference2ReferenceSortedMap<K,V>
    
    Specified by:
    
    headMap in interface SortedMap<K,V>
    
    See Also:
    
    SortedMap.headMap(Object)
  - subMap
```
public Reference2ReferenceSortedMap<K,V> subMap(K from,
                                                K to)
```
    Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
    Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
    This implementation just throws an UnsupportedOperationException.
    
    Specified by:
    
    subMap in interface Reference2ReferenceSortedMap<K,V>
    
    Specified by:
    
    subMap in interface SortedMap<K,V>
    
    See Also:
    
    SortedMap.subMap(Object,Object)
  - comparator
```
public 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 interface Reference2ReferenceSortedMap<K,V>
    
    Specified by:
    
    comparator in interface SortedMap<K,V>
    
    See Also:
    
    SortedMap.comparator()
  - reference2ReferenceEntrySet
```
public Reference2ReferenceSortedMap.FastSortedEntrySet<K,V> reference2ReferenceEntrySet()
```
    Description copied from interface: Reference2ReferenceSortedMap
    
    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:
    
    reference2ReferenceEntrySet in interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    reference2ReferenceEntrySet in interface Reference2ReferenceSortedMap<K,V>
    
    Returns:
    
    a type-specific sorted-set view of the mappings contained in this map.
    
    See Also:
    
    Reference2ReferenceSortedMap.entrySet()
  - keySet
```
public ReferenceSortedSet<K> keySet()
```
    Description copied from class: AbstractReference2ReferenceSortedMap
    
    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 interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    keySet in interface Reference2ReferenceSortedMap<K,V>
    
    Specified by:
    
    keySet in interface Map<K,V>
    
    Specified by:
    
    keySet in interface SortedMap<K,V>
    
    Overrides:
    
    keySet in class AbstractReference2ReferenceSortedMap<K,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 ReferenceCollection<V> values()
```
    Description copied from class: AbstractReference2ReferenceSortedMap
    
    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 interface Reference2ReferenceMap<K,V>
    
    Specified by:
    
    values in interface Reference2ReferenceSortedMap<K,V>
    
    Specified by:
    
    values in interface Map<K,V>
    
    Specified by:
    
    values in interface SortedMap<K,V>
    
    Overrides:
    
    values in class AbstractReference2ReferenceSortedMap<K,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,size()) 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.
    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()
  - rehash
```
protected void rehash(int newN)
```
    Rehashes the map.
    This method implements the basic rehashing strategy, and may be overridden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.
    
    Parameters:
    
    newN - the new size
  - clone
```
public Reference2ReferenceLinkedOpenHashMap<K,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.
    
    Overrides:
    
    clone in class Object
    
    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. Since equals() 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 interface Map<K,V>
    
    Overrides:
    
    hashCode in class AbstractReference2ReferenceMap<K,V>
    
    Returns:
    
    a hash code for this map.

Class Reference2ReferenceLinkedOpenHashMap<K,V>

Nested Class Summary

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceSortedMap

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceSortedMap

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap

Field Summary

Fields inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceFunction

Fields inherited from interface it.unimi.dsi.fastutil.Hash

Constructor Summary

Method Summary

Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap

Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceFunction

Methods inherited from class java.lang.Object

Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceSortedMap

Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap

Methods inherited from interface it.unimi.dsi.fastutil.Function

Methods inherited from interface java.util.function.Function

Methods inherited from interface java.util.Map

Field Detail

key

value

mask

containsNullKey

first

last

link

n

maxFill

minN

size

f

entries

keys

values

Constructor Detail

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Reference2ReferenceLinkedOpenHashMap

Method Detail

putAll

put

shiftKeys

remove

removeFirst

removeLast

getAndMoveToFirst

getAndMoveToLast

putAndMoveToFirst

putAndMoveToLast

get

containsKey

containsValue

clear

size

isEmpty

fixPointers

fixPointers

firstKey

lastKey

tailMap

headMap

subMap

comparator

reference2ReferenceEntrySet

keySet

values

trim

trim

rehash

clone

hashCode