public class Char2IntArrayMap extends AbstractChar2IntMap implements Serializable, 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.
AbstractChar2IntMap.BasicEntry
Char2IntMap.Entry, Char2IntMap.FastEntrySet
Constructor and Description |
---|
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.
|
Char2IntArrayMap(Map<? extends Character,? extends Integer> m)
Creates a new empty array map copying the entries of a given map.
|
Modifier and Type | Method and Description |
---|---|
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).
|
Char2IntArrayMap |
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.
|
containsValue, entrySet, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
containsKey, get, put, remove
containsKey, get, put, remove
public Char2IntArrayMap(char[] 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 Char2IntArrayMap()
public Char2IntArrayMap(int capacity)
capacity
- the initial capacity.public Char2IntArrayMap(Char2IntMap m)
m
- a map.public Char2IntArrayMap(Map<? extends Character,? extends Integer> m)
m
- a map.public Char2IntArrayMap(char[] 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 Char2IntMap.FastEntrySet char2IntEntrySet()
Char2IntMap
This 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 Map.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
char2IntEntrySet
in interface Char2IntMap
Char2IntMap.entrySet()
public int get(char k)
Char2IntFunction
get
in interface Char2IntFunction
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.
public void clear()
Function
public boolean containsKey(char k)
AbstractChar2IntMap
AbstractChar2IntMap.keySet()
.containsKey
in interface Char2IntFunction
containsKey
in class AbstractChar2IntMap
Function.containsKey(Object)
public boolean containsValue(int v)
AbstractChar2IntMap
AbstractChar2IntMap.values()
.containsValue
in interface Char2IntMap
containsValue
in class AbstractChar2IntMap
Map.containsValue(Object)
public boolean isEmpty()
public int put(char k, int v)
Char2IntFunction
put
in interface Char2IntFunction
put
in class AbstractChar2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(char k)
Char2IntFunction
remove
in interface Char2IntFunction
remove
in class AbstractChar2IntFunction
k
- the key.Function.remove(Object)
public CharSet keySet()
AbstractChar2IntMap
The 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 Char2IntMap
keySet
in interface Map<Character,Integer>
keySet
in class AbstractChar2IntMap
Map.keySet()
public IntCollection values()
AbstractChar2IntMap
The 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 Char2IntMap
values
in interface Map<Character,Integer>
values
in class AbstractChar2IntMap
Map.values()
public Char2IntArrayMap 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.