public class Reference2CharArrayMap<K> extends AbstractReference2CharMap<K> 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.
AbstractReference2CharMap.BasicEntry<K>
Reference2CharMap.Entry<K>, Reference2CharMap.FastEntrySet<K>
Constructor and Description |
---|
Reference2CharArrayMap()
Creates a new empty array map.
|
Reference2CharArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Reference2CharArrayMap(Map<? extends K,? extends Character> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2CharArrayMap(Object[] key,
char[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2CharArrayMap(Object[] key,
char[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Reference2CharArrayMap(Reference2CharMap<K> m)
Creates a new empty array map copying the entries of a given map.
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Reference2CharArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractReference2CharMap.keySet() . |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractReference2CharMap.values() . |
char |
getChar(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
char |
put(K k,
char v)
Adds a pair to the map.
|
Reference2CharMap.FastEntrySet<K> |
reference2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
char |
removeChar(Object 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.
|
CharCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
public Reference2CharArrayMap(Object[] key, char[] 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 Reference2CharArrayMap()
public Reference2CharArrayMap(int capacity)
capacity
- the initial capacity.public Reference2CharArrayMap(Reference2CharMap<K> m)
m
- a map.public Reference2CharArrayMap(Map<? extends K,? extends Character> m)
m
- a map.public Reference2CharArrayMap(Object[] key, char[] 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 Reference2CharMap.FastEntrySet<K> reference2CharEntrySet()
Reference2CharMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Reference2CharMap.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).
reference2CharEntrySet
in interface Reference2CharMap<K>
Reference2CharMap.entrySet()
public char getChar(Object k)
Reference2CharFunction
getChar
in interface Reference2CharFunction<K>
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(Object k)
AbstractReference2CharMap
AbstractReference2CharMap.keySet()
.containsKey
in interface Function<K,Character>
containsKey
in interface Map<K,Character>
containsKey
in class AbstractReference2CharMap<K>
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(char v)
AbstractReference2CharMap
AbstractReference2CharMap.values()
.containsValue
in interface Reference2CharMap<K>
containsValue
in class AbstractReference2CharMap<K>
Map.containsValue(Object)
public boolean isEmpty()
public char put(K k, char v)
Reference2CharFunction
put
in interface Reference2CharFunction<K>
put
in class AbstractReference2CharFunction<K>
k
- the key.v
- the value.Function.put(Object,Object)
public char removeChar(Object k)
Reference2CharFunction
removeChar
in interface Reference2CharFunction<K>
removeChar
in class AbstractReference2CharFunction<K>
k
- the key.Function.remove(Object)
public ReferenceSet<K> keySet()
AbstractReference2CharMap
The view is backed by the set returned by AbstractReference2CharMap.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 Reference2CharMap<K>
keySet
in interface Map<K,Character>
keySet
in class AbstractReference2CharMap<K>
Map.keySet()
public CharCollection values()
AbstractReference2CharMap
The view is backed by the set returned by AbstractReference2CharMap.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 Reference2CharMap<K>
values
in interface Map<K,Character>
values
in class AbstractReference2CharMap<K>
Map.values()
public Reference2CharArrayMap<K> 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.