|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2IntFunction
it.unimi.dsi.fastutil.chars.AbstractChar2IntMap
it.unimi.dsi.fastutil.chars.Char2IntArrayMap
public class Char2IntArrayMap
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.chars.AbstractChar2IntMap |
|---|
AbstractChar2IntMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2IntMap |
|---|
Char2IntMap.Entry, Char2IntMap.FastEntrySet |
| Constructor Summary | |
|---|---|
Char2IntArrayMap()
Creates a new empty array map. |
|
Char2IntArrayMap(char[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays. |
|
Char2IntArrayMap(char[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements. |
|
Char2IntArrayMap(Char2IntMap m)
Creates a new empty array map copying the entries of a given map. |
|
Char2IntArrayMap(int capacity)
Creates a new empty array map of given capacity. |
|
| Method Summary | |
|---|---|
Char2IntMap.FastEntrySet |
char2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(char k)
Checks whether the given value is contained in AbstractChar2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in AbstractChar2IntMap.values(). |
int |
get(char k)
Returns the value to which the given key is mapped. |
boolean |
isEmpty()
|
CharSet |
keySet()
Returns a type-specific-set view of the keys of this map. |
int |
put(char k,
int v)
Adds a pair to the map. |
int |
remove(char 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.chars.AbstractChar2IntMap |
|---|
containsValue, entrySet, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2IntFunction |
|---|
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.chars.Char2IntFunction |
|---|
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 Char2IntArrayMap(char[] key,
int[] value)
key - the key array.value - the value array (it must have the same length as key).public Char2IntArrayMap()
public Char2IntArrayMap(int capacity)
capacity - the initial capacity.public Char2IntArrayMap(Char2IntMap m)
m - a map.
public Char2IntArrayMap(char[] 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 Char2IntMap.FastEntrySet char2IntEntrySet()
Char2IntMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Char2IntMap.entrySet()
so that it returns an ObjectSet
of objects of type Char2IntMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
char2IntEntrySet in interface Char2IntMapChar2IntMap.entrySet()public int get(char k)
Char2IntFunction
get in interface Char2IntFunctionk - the key.
Function.get(Object)public int size()
FunctionMost 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<Character,Integer>size in interface Map<Character,Integer>public void clear()
Function
clear in interface Function<Character,Integer>clear in interface Map<Character,Integer>clear in class AbstractChar2IntFunctionMap.clear()public boolean containsKey(char k)
AbstractChar2IntMapAbstractChar2IntMap.keySet().
containsKey in interface Char2IntFunctioncontainsKey in class AbstractChar2IntMapFunction.containsKey(Object)public boolean containsValue(int v)
AbstractChar2IntMapAbstractChar2IntMap.values().
containsValue in interface Char2IntMapcontainsValue in class AbstractChar2IntMapMap.containsValue(Object)public boolean isEmpty()
isEmpty in interface Map<Character,Integer>isEmpty in class AbstractChar2IntMap
public int put(char k,
int v)
Char2IntFunction
put in interface Char2IntFunctionput in class AbstractChar2IntFunctionk - the key.v - the value.
Function.put(Object,Object)public int remove(char k)
Char2IntFunction
remove in interface Char2IntFunctionremove in class AbstractChar2IntFunctionFunction.remove(Object)public CharSet keySet()
AbstractChar2IntMapThe view is backed by the set returned by AbstractChar2IntMap.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 Char2IntMapkeySet in interface Map<Character,Integer>keySet in class AbstractChar2IntMapMap.keySet()public IntCollection values()
AbstractChar2IntMapThe view is backed by the set returned by AbstractChar2IntMap.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 Char2IntMapvalues in interface Map<Character,Integer>values in class AbstractChar2IntMapMap.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 | ||||||||