Object2IntLinkedOpenCustomHashMap (fastutil-object-common 8.3.1 API)

java.lang.Object
- it.unimi.dsi.fastutil.objects.AbstractObject2IntFunction<K>
- - it.unimi.dsi.fastutil.objects.AbstractObject2IntMap<K>
  - - it.unimi.dsi.fastutil.objects.AbstractObject2IntSortedMap<K>
    - - it.unimi.dsi.fastutil.objects.Object2IntLinkedOpenCustomHashMap<K>

All Implemented Interfaces:

Hash, Object2IntFunction<K>, Object2IntMap<K>, Object2IntSortedMap<K>, Serializable, Cloneable, Function<K,Integer>, ToIntFunction<K>, Map<K,Integer>, SortedMap<K,Integer>
```
public class Object2IntLinkedOpenCustomHashMap<K>
extends AbstractObject2IntSortedMap<K>
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.AbstractObject2IntSortedMap
  AbstractObject2IntSortedMap.KeySetIterator<K>, AbstractObject2IntSortedMap.ValuesCollection, AbstractObject2IntSortedMap.ValuesIterator<K>
- Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2IntMap
  AbstractObject2IntMap.BasicEntry<K>, AbstractObject2IntMap.BasicEntrySet<K>
- 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.Object2IntSortedMap
  Object2IntSortedMap.FastSortedEntrySet<K>
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2IntMap
  Object2IntMap.Entry<K>, Object2IntMap.FastEntrySet<K>

Field Summary

Fields
Modifier and Type	Field and Description
`protected boolean`	`containsNullKey` Whether this map contains the key zero.
`protected Object2IntSortedMap.FastSortedEntrySet<K>`	`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 ObjectSortedSet<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 Hash.Strategy<? super K>`	`strategy` The hash strategy of this custom map.
`protected int[]`	`value` The array of values.
`protected IntCollection`	`values` Cached collection of values.

Fields inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2IntFunction
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
`Object2IntLinkedOpenCustomHashMap(Hash.Strategy<? super K> strategy)` Creates a new hash map with initial expected `Hash.DEFAULT_INITIAL_SIZE` entries and `Hash.DEFAULT_LOAD_FACTOR` as load factor.
`Object2IntLinkedOpenCustomHashMap(int expected, float f, Hash.Strategy<? super K> strategy)` Creates a new hash map.
`Object2IntLinkedOpenCustomHashMap(int expected, Hash.Strategy<? super K> strategy)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor.
`Object2IntLinkedOpenCustomHashMap(K[] k, int[] v, float f, Hash.Strategy<? super K> strategy)` Creates a new hash map using the elements of two parallel arrays.
`Object2IntLinkedOpenCustomHashMap(K[] k, int[] v, Hash.Strategy<? super K> strategy)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor using the elements of two parallel arrays.
`Object2IntLinkedOpenCustomHashMap(Map<? extends K,? extends Integer> m, float f, Hash.Strategy<? super K> strategy)` Creates a new hash map copying a given one.
`Object2IntLinkedOpenCustomHashMap(Map<? extends K,? extends Integer> m, Hash.Strategy<? super K> strategy)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying a given one.
`Object2IntLinkedOpenCustomHashMap(Object2IntMap<K> m, float f, Hash.Strategy<? super K> strategy)` Creates a new hash map copying a given type-specific one.
`Object2IntLinkedOpenCustomHashMap(Object2IntMap<K> m, Hash.Strategy<? super K> strategy)` Creates a new hash map with `Hash.DEFAULT_LOAD_FACTOR` as load factor copying a given type-specific one.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int`	`addTo(K k, int incr)` Adds an increment to value currently associated with a key.
`void`	`clear()` Removes all of the mappings from this map (optional operation).
`Object2IntLinkedOpenCustomHashMap<K>`	`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.
`int`	`computeInt(K k, BiFunction<? super K,? super Integer,? extends Integer> remappingFunction)` Attempts to compute a mapping for the specified key and its current mapped value (or `null` if there is no current mapping).
`int`	`computeIntIfAbsent(K k, ToIntFunction<? 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.
`int`	`computeIntIfPresent(K k, BiFunction<? super K,? super Integer,? extends Integer> 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(Object k)` Returns true if this function contains a mapping for the specified key.
`boolean`	`containsValue(int v)` Returns `true` if this map maps one or more keys to the specified value.
`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.
`int`	`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.
`int`	`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`	`getInt(Object k)` Returns the value to which the given key is mapped.
`int`	`getOrDefault(Object k, int defaultValue)` Returns the value to which the specified key is mapped, or the `defaultValue` if this map contains no mapping for the key.
`int`	`hashCode()` Returns a hash code for this map.
`Object2IntSortedMap<K>`	`headMap(K to)` Returns a view of the portion of this sorted map whose keys are strictly less than `toKey`.
`boolean`	`isEmpty()`
`ObjectSortedSet<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.
`int`	`mergeInt(K k, int v, BiFunction<? super Integer,? super Integer,? extends Integer> remappingFunction)` If the specified key is not already associated with a value, associates it with the given `value`.
`Object2IntSortedMap.FastSortedEntrySet<K>`	`object2IntEntrySet()` Returns a type-specific sorted-set view of the mappings contained in this map.
`int`	`put(K k, int v)` Adds a pair to the map (optional operation).
`void`	`putAll(Map<? extends K,? extends Integer> m)`
`int`	`putAndMoveToFirst(K k, int v)` Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.
`int`	`putAndMoveToLast(K k, int v)` Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.
`int`	`putIfAbsent(K k, int 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.
`protected void`	`rehash(int newN)` Rehashes the map.
`boolean`	`remove(Object k, int v)` Removes the entry for the specified key only if it is currently mapped to the specified value.
`int`	`removeFirstInt()` Removes the mapping associated with the first key in iteration order.
`int`	`removeInt(Object k)` Removes the mapping with the given key (optional operation).
`int`	`removeLastInt()` Removes the mapping associated with the last key in iteration order.
`int`	`replace(K k, int v)` Replaces the entry for the specified key only if it is currently mapped to some value.
`boolean`	`replace(K k, int oldValue, int v)` Replaces the entry for the specified key only if currently mapped to the specified value.
`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.
`Hash.Strategy<? super K>`	`strategy()` Returns the hashing strategy.
`Object2IntSortedMap<K>`	`subMap(K from, K to)` Returns a view of the portion of this sorted map whose keys range from `fromKey`, inclusive, to `toKey`, exclusive.
`Object2IntSortedMap<K>`	`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.
`IntCollection`	`values()` Returns a type-specific-set view of the values of this map.

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

Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2IntFunction
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.Object2IntSortedMap
entrySet

Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2IntMap
computeIntIfAbsentPartial, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace

Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2IntFunction
applyAsInt

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, replaceAll

- Field Detail
  - key
```
protected transient K[] key
```
    The array of keys.
  - value
```
protected transient int[] 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.
  - strategy
```
protected Hash.Strategy<? super K> strategy
```
    The hash strategy of this custom map.
  - 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 Object2IntSortedMap.FastSortedEntrySet<K> entries
```
    Cached set of entries.
  - keys
```
protected transient ObjectSortedSet<K> keys
```
    Cached set of keys.
  - values
```
protected transient IntCollection values
```
    Cached collection of values.
- Constructor Detail
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(int expected,
                                         float f,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(int expected,
                                         Hash.Strategy<? super K> strategy)
```
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
    
    Parameters:
    
    expected - the expected number of elements in the hash map.
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(Hash.Strategy<? super K> strategy)
```
    Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
    
    Parameters:
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(Map<? extends K,? extends Integer> m,
                                         float f,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(Map<? extends K,? extends Integer> m,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(Object2IntMap<K> m,
                                         float f,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(Object2IntMap<K> m,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(K[] k,
                                         int[] v,
                                         float f,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
    
    Throws:
    
    IllegalArgumentException - if k and v have different lengths.
  - Object2IntLinkedOpenCustomHashMap
```
public Object2IntLinkedOpenCustomHashMap(K[] k,
                                         int[] v,
                                         Hash.Strategy<? super K> strategy)
```
    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.
    
    strategy - the strategy.
    
    Throws:
    
    IllegalArgumentException - if k and v have different lengths.
- Method Detail
  - strategy
```
public Hash.Strategy<? super K> strategy()
```
    Returns the hashing strategy.
    
    Returns:
    
    the hashing strategy of this custom hash map.
  - putAll
```
public void putAll(Map<? extends K,? extends Integer> m)
```
    Description copied from class: AbstractObject2IntMap
    
    Specified by:
    
    putAll in interface Map<K,Integer>
    
    Overrides:
    
    putAll in class AbstractObject2IntMap<K>
  - put
```
public int put(K k,
               int v)
```
    Description copied from interface: Object2IntFunction
    
    Adds a pair to the map (optional operation).
    
    Specified by:
    
    put in interface Object2IntFunction<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 int addTo(K k,
                 int 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.
  - 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.
  - removeInt
```
public int removeInt(Object k)
```
    Description copied from interface: Object2IntFunction
    
    Removes the mapping with the given key (optional operation).
    
    Specified by:
    
    removeInt in interface Object2IntFunction<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)
  - removeFirstInt
```
public int removeFirstInt()
```
    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.
  - removeLastInt
```
public int removeLastInt()
```
    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 int 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 int 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 int putAndMoveToFirst(K k,
                             int 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 int putAndMoveToLast(K k,
                            int 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.
  - getInt
```
public int getInt(Object k)
```
    Description copied from interface: Object2IntFunction
    
    Returns the value to which the given key is mapped.
    
    Specified by:
    
    getInt in interface Object2IntFunction<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(Object k)
```
    Description copied from interface: Object2IntMap
    
    Returns true if this function contains a mapping for the specified key.
    
    Specified by:
    
    containsKey in interface Object2IntMap<K>
    
    Specified by:
    
    containsKey in interface Map<K,Integer>
    
    Overrides:
    
    containsKey in class AbstractObject2IntMap<K>
    
    Parameters:
    
    k - the key.
    
    Returns:
    
    true if this function associates a value to key.
    
    See Also:
    
    Map.containsKey(Object)
  - containsValue
```
public boolean containsValue(int v)
```
    Description copied from interface: Object2IntMap
    
    Returns true if this map maps one or more keys to the specified value.
    
    Specified by:
    
    containsValue in interface Object2IntMap<K>
    
    Overrides:
    
    containsValue in class AbstractObject2IntMap<K>
    
    See Also:
    
    Map.containsValue(Object)
  - getOrDefault
```
public int getOrDefault(Object k,
                        int defaultValue)
```
    Returns the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.
    
    Specified by:
    
    getOrDefault in interface Object2IntMap<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 int putIfAbsent(K k,
                       int 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 interface Object2IntMap<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(Object k,
                      int v)
```
    Removes the entry for the specified key only if it is currently mapped to the specified value.
    
    Specified by:
    
    remove in interface Object2IntMap<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,
                       int oldValue,
                       int v)
```
    Replaces the entry for the specified key only if currently mapped to the specified value.
    
    Specified by:
    
    replace in interface Object2IntMap<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 int replace(K k,
                   int v)
```
    Replaces the entry for the specified key only if it is currently mapped to some value.
    
    Specified by:
    
    replace in interface Object2IntMap<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)
  - computeIntIfAbsent
```
public int computeIntIfAbsent(K k,
                              ToIntFunction<? 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 return null. If such a behavior is needed, please use the corresponding nullable version.
    
    Specified by:
    
    computeIntIfAbsent in interface Object2IntMap<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)
  - computeIntIfPresent
```
public int computeIntIfPresent(K k,
                               BiFunction<? super K,? super Integer,? extends Integer> 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:
    
    computeIntIfPresent in interface Object2IntMap<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)
  - computeInt
```
public int computeInt(K k,
                      BiFunction<? super K,? super Integer,? extends Integer> remappingFunction)
```
    Attempts to compute a mapping for the specified key and its current mapped value (or null 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:
    
    computeInt in interface Object2IntMap<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)
  - mergeInt
```
public int mergeInt(K k,
                    int v,
                    BiFunction<? super Integer,? super Integer,? extends Integer> remappingFunction)
```
    If the specified key is not already associated with a value, associates it with the given value. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result is null.
    
    Specified by:
    
    mergeInt in interface Object2IntMap<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: Object2IntMap
    
    Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
    
    Specified by:
    
    clear in interface Object2IntMap<K>
    
    Specified by:
    
    clear in interface Map<K,Integer>
    
    See Also:
    
    Map.clear()
  - size
```
public int size()
```
    Description copied from interface: Object2IntMap
    
    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 Object2IntMap<K>
    
    Specified by:
    
    size in interface Map<K,Integer>
    
    Returns:
    
    the number of key-value mappings in this map.
    
    See Also:
    
    Size64
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface Map<K,Integer>
    
    Overrides:
    
    isEmpty in class AbstractObject2IntMap<K>
  - 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,Integer>
    
    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,Integer>
    
    Returns:
    
    the last key in iteration order.
  - tailMap
```
public Object2IntSortedMap<K> 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 Object2IntSortedMap<K>
    
    Specified by:
    
    tailMap in interface SortedMap<K,Integer>
    
    See Also:
    
    SortedMap.tailMap(Object)
  - headMap
```
public Object2IntSortedMap<K> 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 Object2IntSortedMap<K>
    
    Specified by:
    
    headMap in interface SortedMap<K,Integer>
    
    See Also:
    
    SortedMap.headMap(Object)
  - subMap
```
public Object2IntSortedMap<K> 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 Object2IntSortedMap<K>
    
    Specified by:
    
    subMap in interface SortedMap<K,Integer>
    
    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 Object2IntSortedMap<K>
    
    Specified by:
    
    comparator in interface SortedMap<K,Integer>
    
    See Also:
    
    SortedMap.comparator()
  - object2IntEntrySet
```
public Object2IntSortedMap.FastSortedEntrySet<K> object2IntEntrySet()
```
    Description copied from interface: Object2IntSortedMap
    
    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:
    
    object2IntEntrySet in interface Object2IntMap<K>
    
    Specified by:
    
    object2IntEntrySet in interface Object2IntSortedMap<K>
    
    Returns:
    
    a type-specific sorted-set view of the mappings contained in this map.
    
    See Also:
    
    Object2IntSortedMap.entrySet()
  - keySet
```
public ObjectSortedSet<K> keySet()
```
    Description copied from class: AbstractObject2IntSortedMap
    
    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 Object2IntMap<K>
    
    Specified by:
    
    keySet in interface Object2IntSortedMap<K>
    
    Specified by:
    
    keySet in interface Map<K,Integer>
    
    Specified by:
    
    keySet in interface SortedMap<K,Integer>
    
    Overrides:
    
    keySet in class AbstractObject2IntSortedMap<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 IntCollection values()
```
    Description copied from class: AbstractObject2IntSortedMap
    
    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 Object2IntMap<K>
    
    Specified by:
    
    values in interface Object2IntSortedMap<K>
    
    Specified by:
    
    values in interface Map<K,Integer>
    
    Specified by:
    
    values in interface SortedMap<K,Integer>
    
    Overrides:
    
    values in class AbstractObject2IntSortedMap<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,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 Object2IntLinkedOpenCustomHashMap<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.
    
    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,Integer>
    
    Overrides:
    
    hashCode in class AbstractObject2IntMap<K>
    
    Returns:
    
    a hash code for this map.

Class Object2IntLinkedOpenCustomHashMap<K>

Nested Class Summary

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

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

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

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

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

Field Summary

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

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

Constructor Summary

Method Summary

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

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

Methods inherited from class java.lang.Object

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

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

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

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

strategy

first

last

link

n

maxFill

minN

size

f

entries

keys

values

Constructor Detail

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Object2IntLinkedOpenCustomHashMap

Method Detail

strategy

putAll

put

addTo

shiftKeys

removeInt

removeFirstInt

removeLastInt

getAndMoveToFirst

getAndMoveToLast

putAndMoveToFirst

putAndMoveToLast

getInt

containsKey

containsValue

getOrDefault

putIfAbsent

remove

replace

replace

computeIntIfAbsent

computeIntIfPresent

computeInt

mergeInt

clear

size

isEmpty

fixPointers

fixPointers

firstKey

lastKey