|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2ReferenceFunction<V>
it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap<V>
it.unimi.dsi.fastutil.chars.Char2ReferenceArrayMap<V>
public class Char2ReferenceArrayMap<V>
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.AbstractChar2ReferenceMap |
|---|
AbstractChar2ReferenceMap.BasicEntry<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceMap |
|---|
Char2ReferenceMap.Entry<V>, Char2ReferenceMap.FastEntrySet<V> |
| Constructor Summary | |
|---|---|
Char2ReferenceArrayMap()
Creates a new empty array map. |
|
Char2ReferenceArrayMap(char[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays. |
|
Char2ReferenceArrayMap(char[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements. |
|
Char2ReferenceArrayMap(Char2ReferenceMap<V> m)
Creates a new empty array map copying the entries of a given map. |
|
Char2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity. |
|
| Method Summary | |
|---|---|
Char2ReferenceMap.FastEntrySet<V> |
char2ReferenceEntrySet()
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 AbstractChar2ReferenceMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractChar2ReferenceMap.values(). |
V |
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. |
V |
put(char k,
V v)
Adds a pair to the map. |
V |
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. |
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map. |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap |
|---|
entrySet, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceFunction |
|---|
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.Char2ReferenceFunction |
|---|
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 Char2ReferenceArrayMap(char[] key,
Object[] value)
key - the key array.value - the value array (it must have the same length as key).public Char2ReferenceArrayMap()
public Char2ReferenceArrayMap(int capacity)
capacity - the initial capacity.public Char2ReferenceArrayMap(Char2ReferenceMap<V> m)
m - a map.
public Char2ReferenceArrayMap(char[] key,
Object[] 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 Char2ReferenceMap.FastEntrySet<V> char2ReferenceEntrySet()
Char2ReferenceMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Char2ReferenceMap.entrySet()
so that it returns an ObjectSet
of objects of type Char2ReferenceMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
char2ReferenceEntrySet in interface Char2ReferenceMap<V>Char2ReferenceMap.entrySet()public V get(char k)
Char2ReferenceFunction
get in interface Char2ReferenceFunction<V>k - 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,V>size in interface Map<Character,V>public void clear()
Function
clear in interface Function<Character,V>clear in interface Map<Character,V>clear in class AbstractChar2ReferenceFunction<V>Map.clear()public boolean containsKey(char k)
AbstractChar2ReferenceMapAbstractChar2ReferenceMap.keySet().
containsKey in interface Char2ReferenceFunction<V>containsKey in class AbstractChar2ReferenceMap<V>Function.containsKey(Object)public boolean containsValue(Object v)
AbstractChar2ReferenceMapAbstractChar2ReferenceMap.values().
containsValue in interface Map<Character,V>containsValue in class AbstractChar2ReferenceMap<V>public boolean isEmpty()
isEmpty in interface Map<Character,V>isEmpty in class AbstractChar2ReferenceMap<V>
public V put(char k,
V v)
Char2ReferenceFunction
put in interface Char2ReferenceFunction<V>put in class AbstractChar2ReferenceFunction<V>k - the key.v - the value.
Function.put(Object,Object)public V remove(char k)
Char2ReferenceFunction
remove in interface Char2ReferenceFunction<V>remove in class AbstractChar2ReferenceFunction<V>Function.remove(Object)public CharSet keySet()
AbstractChar2ReferenceMapThe view is backed by the set returned by AbstractChar2ReferenceMap.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 Char2ReferenceMap<V>keySet in interface Map<Character,V>keySet in class AbstractChar2ReferenceMap<V>Map.keySet()public ReferenceCollection<V> values()
AbstractChar2ReferenceMapThe view is backed by the set returned by AbstractChar2ReferenceMap.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 Char2ReferenceMap<V>values in interface Map<Character,V>values in class AbstractChar2ReferenceMap<V>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 | ||||||||