Int2ByteLinkedOpenHashMap (fastutil-reference-char-maps 8.3.1 API)

java.lang.Object
- it.unimi.dsi.fastutil.ints.AbstractInt2ByteFunction
- - it.unimi.dsi.fastutil.ints.AbstractInt2ByteMap
  - - it.unimi.dsi.fastutil.ints.AbstractInt2ByteSortedMap
    - - it.unimi.dsi.fastutil.ints.Int2ByteLinkedOpenHashMap

All Implemented Interfaces:

Hash, Int2ByteFunction, Int2ByteMap, Int2ByteSortedMap, Serializable, Cloneable, Function<Integer,Byte>, IntUnaryOperator, Map<Integer,Byte>, SortedMap<Integer,Byte>
```
public class Int2ByteLinkedOpenHashMap
extends AbstractInt2ByteSortedMap
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.ints.AbstractInt2ByteSortedMap
  AbstractInt2ByteSortedMap.KeySetIterator, AbstractInt2ByteSortedMap.ValuesCollection, AbstractInt2ByteSortedMap.ValuesIterator
- Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteMap
  AbstractInt2ByteMap.BasicEntry, AbstractInt2ByteMap.BasicEntrySet
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
  Hash.Strategy<K>
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteSortedMap
  Int2ByteSortedMap.FastSortedEntrySet
- Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteMap
  Int2ByteMap.Entry, Int2ByteMap.FastEntrySet

Field Summary

Fields
Modifier and Type	Field and Description
`protected boolean`	`containsNullKey` Whether this map contains the key zero.
`protected Int2ByteSortedMap.FastSortedEntrySet`	`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 int[]`	`key` The array of keys.
`protected IntSortedSet`	`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 byte[]`	`value` The array of values.
`protected ByteCollection`	`values` Cached collection of values.

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

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`byte`	`addTo(int k, byte incr)` Adds an increment to value currently associated with a key.
`void`	`clear()` Removes all of the mappings from this map (optional operation).
`Int2ByteLinkedOpenHashMap`	`clone()` Returns a deep copy of this map.
`IntComparator`	`comparator()` Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
`byte`	`compute(int k, BiFunction<? super Integer,? super Byte,? extends Byte> remappingFunction)` Attempts to compute a mapping for the specified key and its current mapped value (or `null` if there is no current mapping).
`byte`	`computeIfAbsent(int k, IntUnaryOperator 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.
`byte`	`computeIfAbsentNullable(int k, IntFunction<? extends Byte> 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 unless it is `null`.
`byte`	`computeIfPresent(int k, BiFunction<? super Integer,? super Byte,? extends Byte> 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(int k)` Returns true if this function contains a mapping for the specified key.
`boolean`	`containsValue(byte v)` Returns `true` if this map maps one or more keys to the specified value.
`int`	`firstIntKey()` 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.
`byte`	`get(int k)` Returns the value to which the given key is mapped.
`byte`	`getAndMoveToFirst(int 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.
`byte`	`getAndMoveToLast(int 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.
`byte`	`getOrDefault(int k, byte 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.
`Int2ByteSortedMap`	`headMap(int to)` Returns a view of the portion of this sorted map whose keys are strictly less than `toKey`.
`Int2ByteSortedMap.FastSortedEntrySet`	`int2ByteEntrySet()` Returns a type-specific sorted-set view of the mappings contained in this map.
`boolean`	`isEmpty()`
`IntSortedSet`	`keySet()` Returns a type-specific-set view of the keys of this map.
`int`	`lastIntKey()` Returns the last key of this map in iteration order.
`byte`	`merge(int k, byte v, BiFunction<? super Byte,? super Byte,? extends Byte> remappingFunction)` If the specified key is not already associated with a value, associates it with the given `value`.
`byte`	`put(int k, byte v)` Adds a pair to the map (optional operation).
`void`	`putAll(Map<? extends Integer,? extends Byte> m)`
`byte`	`putAndMoveToFirst(int k, byte v)` Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.
`byte`	`putAndMoveToLast(int k, byte v)` Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.
`byte`	`putIfAbsent(int k, byte 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.
`byte`	`remove(int k)` Removes the mapping with the given key (optional operation).
`boolean`	`remove(int k, byte v)` Removes the entry for the specified key only if it is currently mapped to the specified value.
`byte`	`removeFirstByte()` Removes the mapping associated with the first key in iteration order.
`byte`	`removeLastByte()` Removes the mapping associated with the last key in iteration order.
`byte`	`replace(int k, byte v)` Replaces the entry for the specified key only if it is currently mapped to some value.
`boolean`	`replace(int k, byte oldValue, byte 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.
`Int2ByteSortedMap`	`subMap(int from, int to)` Returns a view of the portion of this sorted map whose keys range from `fromKey`, inclusive, to `toKey`, exclusive.
`Int2ByteSortedMap`	`tailMap(int 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.
`ByteCollection`	`values()` Returns a type-specific-set view of the values of this map.

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteMap
equals, toString

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteFunction
defaultReturnValue, defaultReturnValue

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

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteMap
compute, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteFunction
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.function.IntUnaryOperator
andThen, compose, identity

Methods inherited from interface java.util.Map
equals, forEach, replaceAll

- Field Detail
  - key
```
protected transient int[] key
```
    The array of keys.
  - value
```
protected transient byte[] 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 Int2ByteSortedMap.FastSortedEntrySet entries
```
    Cached set of entries.
  - keys
```
protected transient IntSortedSet keys
```
    Cached set of keys.
  - values
```
protected transient ByteCollection values
```
    Cached collection of values.
- Constructor Detail
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap()
```
    Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(Map<? extends Integer,? extends Byte> 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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(Map<? extends Integer,? extends Byte> 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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(Int2ByteMap 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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(Int2ByteMap 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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(int[] k,
                                 byte[] 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.
  - Int2ByteLinkedOpenHashMap
```
public Int2ByteLinkedOpenHashMap(int[] k,
                                 byte[] 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 Integer,? extends Byte> m)
```
    Description copied from class: AbstractInt2ByteMap
    
    Specified by:
    
    putAll in interface Map<Integer,Byte>
    
    Overrides:
    
    putAll in class AbstractInt2ByteMap
  - put
```
public byte put(int k,
                byte v)
```
    Description copied from interface: Int2ByteFunction
    
    Adds a pair to the map (optional operation).
    
    Specified by:
    
    put in interface Int2ByteFunction
    
    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 byte addTo(int k,
                  byte 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.
  - remove
```
public byte remove(int k)
```
    Description copied from interface: Int2ByteFunction
    
    Removes the mapping with the given key (optional operation).
    
    Specified by:
    
    remove in interface Int2ByteFunction
    
    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)
  - removeFirstByte
```
public byte removeFirstByte()
```
    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.
  - removeLastByte
```
public byte removeLastByte()
```
    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 byte getAndMoveToFirst(int 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 byte getAndMoveToLast(int 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 byte putAndMoveToFirst(int k,
                              byte 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 byte putAndMoveToLast(int k,
                             byte 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 byte get(int k)
```
    Description copied from interface: Int2ByteFunction
    
    Returns the value to which the given key is mapped.
    
    Specified by:
    
    get in interface Int2ByteFunction
    
    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(int k)
```
    Description copied from interface: Int2ByteMap
    
    Returns true if this function contains a mapping for the specified key.
    
    Specified by:
    
    containsKey in interface Int2ByteFunction
    
    Specified by:
    
    containsKey in interface Int2ByteMap
    
    Overrides:
    
    containsKey in class AbstractInt2ByteMap
    
    Parameters:
    
    k - the key.
    
    Returns:
    
    true if this function associates a value to key.
    
    See Also:
    
    Map.containsKey(Object)
  - containsValue
```
public boolean containsValue(byte v)
```
    Description copied from interface: Int2ByteMap
    
    Returns true if this map maps one or more keys to the specified value.
    
    Specified by:
    
    containsValue in interface Int2ByteMap
    
    Overrides:
    
    containsValue in class AbstractInt2ByteMap
    
    See Also:
    
    Map.containsValue(Object)
  - getOrDefault
```
public byte getOrDefault(int k,
                         byte 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 Int2ByteMap
    
    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 byte putIfAbsent(int k,
                        byte 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 Int2ByteMap
    
    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(int k,
                      byte v)
```
    Removes the entry for the specified key only if it is currently mapped to the specified value.
    
    Specified by:
    
    remove in interface Int2ByteMap
    
    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(int k,
                       byte oldValue,
                       byte v)
```
    Replaces the entry for the specified key only if currently mapped to the specified value.
    
    Specified by:
    
    replace in interface Int2ByteMap
    
    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 byte replace(int k,
                    byte v)
```
    Replaces the entry for the specified key only if it is currently mapped to some value.
    
    Specified by:
    
    replace in interface Int2ByteMap
    
    Parameters:
    
    k - key with which the specified value is associated.
    
    v - value to be associated with the specified key.
    
    Returns:
    
    the previous value associated with the specified key, or the default return value if there was no mapping for the key.
    
    See Also:
    
    Map.replace(Object, Object)
  - computeIfAbsent
```
public byte computeIfAbsent(int k,
                            IntUnaryOperator 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:
    
    computeIfAbsent in interface Int2ByteMap
    
    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)
  - computeIfAbsentNullable
```
public byte computeIfAbsentNullable(int k,
                                    IntFunction<? extends Byte> 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 unless it is null.
    Note that this version of computeIfAbsent() should be used only if you plan to return null in the mapping function.
    
    Specified by:
    
    computeIfAbsentNullable in interface Int2ByteMap
    
    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, or the default return value if the computed value is null.
    
    See Also:
    
    Map.computeIfAbsent(Object, java.util.function.Function)
  - computeIfPresent
```
public byte computeIfPresent(int k,
                             BiFunction<? super Integer,? super Byte,? extends Byte> remappingFunction)
```
    If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.
    
    Specified by:
    
    computeIfPresent in interface Int2ByteMap
    
    Parameters:
    
    k - key with which the specified value is to be associated.
    
    remappingFunction - the function to compute a value.
    
    Returns:
    
    the new value associated with the specified key, or the default return value if none.
    
    See Also:
    
    Map.computeIfPresent(Object, java.util.function.BiFunction)
  - compute
```
public byte compute(int k,
                    BiFunction<? super Integer,? super Byte,? extends Byte> 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:
    
    compute in interface Int2ByteMap
    
    Parameters:
    
    k - key with which the specified value is to be associated.
    
    remappingFunction - the function to compute a value.
    
    Returns:
    
    the new value associated with the specified key, or the default return value if none.
    
    See Also:
    
    Map.compute(Object, java.util.function.BiFunction)
  - merge
```
public byte merge(int k,
                  byte v,
                  BiFunction<? super Byte,? super Byte,? extends Byte> 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:
    
    merge in interface Int2ByteMap
    
    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: Int2ByteMap
    
    Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
    
    Specified by:
    
    clear in interface Int2ByteMap
    
    Specified by:
    
    clear in interface Map<Integer,Byte>
    
    See Also:
    
    Map.clear()
  - size
```
public int size()
```
    Description copied from interface: Int2ByteMap
    
    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 Int2ByteMap
    
    Specified by:
    
    size in interface Map<Integer,Byte>
    
    Returns:
    
    the number of key-value mappings in this map.
    
    See Also:
    
    Size64
  - isEmpty
```
public boolean isEmpty()
```
    Specified by:
    
    isEmpty in interface Map<Integer,Byte>
    
    Overrides:
    
    isEmpty in class AbstractInt2ByteMap
  - 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.
  - firstIntKey
```
public int firstIntKey()
```
    Returns the first key of this map in iteration order.
    
    Specified by:
    
    firstIntKey in interface Int2ByteSortedMap
    
    Returns:
    
    the first key in iteration order.
    
    See Also:
    
    SortedMap.firstKey()
  - lastIntKey
```
public int lastIntKey()
```
    Returns the last key of this map in iteration order.
    
    Specified by:
    
    lastIntKey in interface Int2ByteSortedMap
    
    Returns:
    
    the last key in iteration order.
    
    See Also:
    
    SortedMap.lastKey()
  - tailMap
```
public Int2ByteSortedMap tailMap(int 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 Int2ByteSortedMap
    
    See Also:
    
    SortedMap.tailMap(Object)
  - headMap
```
public Int2ByteSortedMap headMap(int 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 Int2ByteSortedMap
    
    See Also:
    
    SortedMap.headMap(Object)
  - subMap
```
public Int2ByteSortedMap subMap(int from,
                                int 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 Int2ByteSortedMap
    
    See Also:
    
    SortedMap.subMap(Object,Object)
  - comparator
```
public IntComparator 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 Int2ByteSortedMap
    
    Specified by:
    
    comparator in interface SortedMap<Integer,Byte>
    
    See Also:
    
    SortedMap.comparator()
  - int2ByteEntrySet
```
public Int2ByteSortedMap.FastSortedEntrySet int2ByteEntrySet()
```
    Description copied from interface: Int2ByteSortedMap
    
    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:
    
    int2ByteEntrySet in interface Int2ByteMap
    
    Specified by:
    
    int2ByteEntrySet in interface Int2ByteSortedMap
    
    Returns:
    
    a type-specific sorted-set view of the mappings contained in this map.
    
    See Also:
    
    Int2ByteSortedMap.entrySet()
  - keySet
```
public IntSortedSet keySet()
```
    Description copied from class: AbstractInt2ByteSortedMap
    
    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 Int2ByteMap
    
    Specified by:
    
    keySet in interface Int2ByteSortedMap
    
    Specified by:
    
    keySet in interface Map<Integer,Byte>
    
    Specified by:
    
    keySet in interface SortedMap<Integer,Byte>
    
    Overrides:
    
    keySet in class AbstractInt2ByteSortedMap
    
    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 ByteCollection values()
```
    Description copied from class: AbstractInt2ByteSortedMap
    
    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 Int2ByteMap
    
    Specified by:
    
    values in interface Int2ByteSortedMap
    
    Specified by:
    
    values in interface Map<Integer,Byte>
    
    Specified by:
    
    values in interface SortedMap<Integer,Byte>
    
    Overrides:
    
    values in class AbstractInt2ByteSortedMap
    
    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 Int2ByteLinkedOpenHashMap 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<Integer,Byte>
    
    Overrides:
    
    hashCode in class AbstractInt2ByteMap
    
    Returns:
    
    a hash code for this map.

Class Int2ByteLinkedOpenHashMap

Nested Class Summary

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteSortedMap

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteMap

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

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

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

Field Summary

Fields inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteFunction

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

Constructor Summary

Method Summary

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteMap

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2ByteFunction

Methods inherited from class java.lang.Object

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteSortedMap

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteMap

Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2ByteFunction

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

Methods inherited from interface java.util.function.Function

Methods inherited from interface java.util.function.IntUnaryOperator

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

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Int2ByteLinkedOpenHashMap

Method Detail

putAll

put

addTo

shiftKeys

remove

removeFirstByte

removeLastByte

getAndMoveToFirst

getAndMoveToLast

putAndMoveToFirst

putAndMoveToLast

get

containsKey

containsValue

getOrDefault

putIfAbsent

remove

replace

replace

computeIfAbsent

computeIfAbsentNullable

computeIfPresent

compute

merge

clear

size

isEmpty

fixPointers

fixPointers

firstIntKey

lastIntKey