|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractInt2IntFunction
it.unimi.dsi.fastutil.ints.AbstractInt2IntMap
it.unimi.dsi.fastutil.ints.Int2IntArrayMap
public class Int2IntArrayMap
A simple, brute-force implementation of a map based on two parallel backing arrays.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2IntMap |
---|
AbstractInt2IntMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2IntMap |
---|
Int2IntMap.Entry, Int2IntMap.FastEntrySet |
Constructor Summary | |
---|---|
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. |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(int k)
Checks whether the given value is contained in AbstractInt2IntMap.keySet() . |
boolean |
containsValue(int v)
Checks whether the given value is contained in AbstractInt2IntMap.values() . |
int |
get(int k)
Returns the value to which the given key is mapped. |
Int2IntMap.FastEntrySet |
int2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
boolean |
isEmpty()
|
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map. |
int |
put(int k,
int v)
Adds a pair to the map. |
int |
remove(int k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
IntCollection |
values()
Returns a type-specific-set view of the values of this map. |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2IntMap |
---|
containsValue, entrySet, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2IntFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.ints.Int2IntFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get, put, remove |
Methods inherited from interface java.util.Map |
---|
containsKey, get, put, remove |
Constructor Detail |
---|
public Int2IntArrayMap(int[] key, int[] value)
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(int[] key, int[] value, int size)
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
.Method Detail |
---|
public Int2IntMap.FastEntrySet int2IntEntrySet()
Int2IntMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2IntMap.entrySet()
so that it returns an ObjectSet
of objects of type Int2IntMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
int2IntEntrySet
in interface Int2IntMap
Int2IntMap.entrySet()
public int get(int k)
Int2IntFunction
get
in interface Int2IntFunction
k
- the key.
Function.get(Object)
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
size
in interface Function<Integer,Integer>
size
in interface Map<Integer,Integer>
public void clear()
Function
clear
in interface Function<Integer,Integer>
clear
in interface Map<Integer,Integer>
clear
in class AbstractInt2IntFunction
Map.clear()
public boolean containsKey(int k)
AbstractInt2IntMap
AbstractInt2IntMap.keySet()
.
containsKey
in interface Int2IntFunction
containsKey
in class AbstractInt2IntMap
Function.containsKey(Object)
public boolean containsValue(int v)
AbstractInt2IntMap
AbstractInt2IntMap.values()
.
containsValue
in interface Int2IntMap
containsValue
in class AbstractInt2IntMap
Map.containsValue(Object)
public boolean isEmpty()
isEmpty
in interface Map<Integer,Integer>
isEmpty
in class AbstractInt2IntMap
public int put(int k, int v)
Int2IntFunction
put
in interface Int2IntFunction
put
in class AbstractInt2IntFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public int remove(int k)
Int2IntFunction
remove
in interface Int2IntFunction
remove
in class AbstractInt2IntFunction
Function.remove(Object)
public IntSet keySet()
AbstractInt2IntMap
The view is backed by the set returned by AbstractInt2IntMap.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 Int2IntMap
keySet
in interface Map<Integer,Integer>
keySet
in class AbstractInt2IntMap
Map.keySet()
public IntCollection values()
AbstractInt2IntMap
The view is backed by the set returned by AbstractInt2IntMap.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 Int2IntMap
values
in interface Map<Integer,Integer>
values
in class AbstractInt2IntMap
Map.values()
public Object 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 Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |