public class Char2CharArrayMap extends AbstractChar2CharMap 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.
AbstractChar2CharMap.BasicEntry, AbstractChar2CharMap.BasicEntrySetChar2CharMap.Entry, Char2CharMap.FastEntrySetdefRetValue| Constructor and Description |
|---|
Char2CharArrayMap()
Creates a new empty array map.
|
Char2CharArrayMap(char[] key,
char[] value)
Creates a new empty array map with given key and value backing arrays.
|
Char2CharArrayMap(char[] key,
char[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Char2CharArrayMap(Char2CharMap m)
Creates a new empty array map copying the entries of a given map.
|
Char2CharArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Char2CharArrayMap(Map<? extends Character,? extends Character> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Char2CharMap.FastEntrySet |
char2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Char2CharArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(char k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(char v)
Returns
true if this map maps one or more keys to the specified value. |
char |
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.
|
char |
put(char k,
char v)
Adds a pair to the map (optional operation).
|
char |
remove(char k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
CharCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntandThen, compose, identityforEach, replaceAllpublic Char2CharArrayMap(char[] 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 Char2CharArrayMap()
public Char2CharArrayMap(int capacity)
capacity - the initial capacity.public Char2CharArrayMap(Char2CharMap m)
m - a map.public Char2CharArrayMap(Map<? extends Character,? extends Character> m)
m - a map.public Char2CharArrayMap(char[] 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 Char2CharMap.FastEntrySet char2CharEntrySet()
Char2CharMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.entrySet()
so that it returns an ObjectSet
of type-specific entries (the latter makes it possible to
access keys and values with type-specific methods).
char2CharEntrySet in interface Char2CharMapMap.entrySet()public char get(char k)
Char2CharFunctionget in interface Char2CharFunctionk - the key.Function.get(Object)public int size()
Char2CharMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Char2CharMapclear in interface Char2CharMapclear in interface Map<Character,Character>Map.clear()public boolean containsKey(char k)
Char2CharMapcontainsKey in interface Char2CharFunctioncontainsKey in interface Char2CharMapcontainsKey in class AbstractChar2CharMapk - the key.key.Map.containsKey(Object)public boolean containsValue(char v)
Char2CharMaptrue if this map maps one or more keys to the specified value.containsValue in interface Char2CharMapcontainsValue in class AbstractChar2CharMapMap.containsValue(Object)public boolean isEmpty()
public char put(char k,
char v)
Char2CharFunctionput in interface Char2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(char k)
Char2CharFunctionremove in interface Char2CharFunctionk - the key.Function.remove(Object)public CharSet keySet()
AbstractChar2CharMapThe view is backed by the set returned by Map.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 Char2CharMapkeySet in interface Map<Character,Character>keySet in class AbstractChar2CharMapMap.keySet()public CharCollection values()
AbstractChar2CharMapThe view is backed by the set returned by Map.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 Char2CharMapvalues in interface Map<Character,Character>values in class AbstractChar2CharMapMap.values()public Char2CharArrayMap 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.
Copyright © 2020. All rights reserved.