public class Int2IntArrayMap extends AbstractInt2IntMap implements java.io.Serializable, java.lang.Cloneable
The main purpose of this implementation is that of wrapping cleanly the brute-force approach to the storage of a very small number of pairs: just put them into two parallel arrays and scan linearly to find an item.
AbstractInt2IntMap.BasicEntry, AbstractInt2IntMap.BasicEntrySetInt2IntMap.Entry, Int2IntMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected Int2IntMap.FastEntrySet |
entries
Cached set of entries.
|
protected int[] |
key
The keys (valid up to
size, excluded). |
protected it.unimi.dsi.fastutil.ints.IntSet |
keys
Cached set of keys.
|
protected int |
size
|
protected int[] |
value
The values (parallel to
key). |
protected it.unimi.dsi.fastutil.ints.IntCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Int2IntArrayMap()
Creates a new empty array map.
|
Int2IntArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2IntArrayMap(int[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2IntArrayMap(int[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2IntArrayMap(Int2IntMap m)
Creates a new empty array map copying the entries of a given map.
|
Int2IntArrayMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2IntArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int 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. |
int |
get(int k) |
Int2IntMap.FastEntrySet |
int2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
it.unimi.dsi.fastutil.ints.IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
int |
put(int k,
int v) |
int |
remove(int k) |
int |
size()
Returns the number of key/value mappings in this map.
|
it.unimi.dsi.fastutil.ints.IntCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, mergeInt, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceandThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, identityprotected transient int[] key
size, excluded).protected transient int[] value
key).protected int size
protected transient Int2IntMap.FastEntrySet entries
protected transient it.unimi.dsi.fastutil.ints.IntSet keys
protected transient it.unimi.dsi.fastutil.ints.IntCollection values
public Int2IntArrayMap(int[] key,
int[] value)
It is responsibility of the caller that the elements of key are distinct.
key - the key array.value - the value array (it must have the same length as key).public Int2IntArrayMap()
public Int2IntArrayMap(int capacity)
capacity - the initial capacity.public Int2IntArrayMap(Int2IntMap m)
m - a map.public Int2IntArrayMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> m)
m - a map.public Int2IntArrayMap(int[] key,
int[] value,
int size)
It is responsibility of the caller that the first size elements of key are distinct.
key - the key array.value - the value array (it must have the same length as key).size - the number of valid elements in key and value.public Int2IntMap.FastEntrySet int2IntEntrySet()
Int2IntMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.entrySet()
so that it returns an ObjectSet
of type-specific entries (the latter makes it possible to
access keys and values with type-specific methods).
int2IntEntrySet in interface Int2IntMapMap.entrySet()public int get(int k)
get in interface it.unimi.dsi.fastutil.ints.Int2IntFunctionpublic int size()
Int2IntMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.size in interface Int2IntMapsize in interface java.util.Map<java.lang.Integer,java.lang.Integer>Size64public void clear()
Int2IntMapclear in interface Int2IntMapclear in interface java.util.Map<java.lang.Integer,java.lang.Integer>public boolean containsKey(int k)
AbstractInt2IntMapcontainsKey in interface it.unimi.dsi.fastutil.ints.Int2IntFunctioncontainsKey in interface Int2IntMapcontainsKey in class AbstractInt2IntMapk - the key.key.Map.containsKey(Object)public boolean containsValue(int v)
AbstractInt2IntMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2IntMapcontainsValue in class AbstractInt2IntMapMap.containsValue(Object)public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Integer,java.lang.Integer>isEmpty in class AbstractInt2IntMappublic int put(int k,
int v)
put in interface it.unimi.dsi.fastutil.ints.Int2IntFunctionpublic int remove(int k)
remove in interface it.unimi.dsi.fastutil.ints.Int2IntFunctionpublic it.unimi.dsi.fastutil.ints.IntSet keySet()
AbstractInt2IntMapThe 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.
keySet in interface Int2IntMapkeySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>keySet in class AbstractInt2IntMapMap.keySet()public it.unimi.dsi.fastutil.ints.IntCollection values()
AbstractInt2IntMapThe 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.
values in interface Int2IntMapvalues in interface java.util.Map<java.lang.Integer,java.lang.Integer>values in class AbstractInt2IntMapMap.values()public Int2IntArrayMap clone()
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.
clone in class java.lang.Object