@Generated(date="2017-07-11T19:16:29+0200",
value="KTypeVTypeHashMap.java")
public class CharCharHashMap
extends java.lang.Object
implements CharCharMap, java.lang.Cloneable
char to char, implemented using open
addressing with linear probing for collision resolution.
The internal buffers of this implementation (keys, values),
are always allocated to the nearest size that is a power of two. When
the capacity exceeds the given load factor, the buffer size is doubled.
| Modifier and Type | Class and Description |
|---|---|
class |
CharCharHashMap.EntryIterator
An iterator implementation for
iterator(). |
class |
CharCharHashMap.KeysCollection
A view of the keys inside this map.
|
class |
CharCharHashMap.KeysIterator
An iterator over the set of keys.
|
class |
CharCharHashMap.ValuesCollection
A view over the set of values of this map.
|
class |
CharCharHashMap.ValuesIterator
An iterator over the set of values.
|
| Modifier and Type | Field and Description |
|---|---|
boolean |
allocatedDefaultKey
True if key = 0/null is in the map.
|
char |
allocatedDefaultKeyValue
if allocatedDefaultKey = true, contains the associated V to the key = 0/null
|
protected int |
assigned
Cached number of assigned slots in
keys. |
protected char |
defaultValue |
protected IteratorPool<CharCharCursor,CharCharHashMap.EntryIterator> |
entryIteratorPool
internal pool of EntryIterator
|
char[] |
keys
Hash-indexed array holding all keys.
|
protected double |
loadFactor
The load factor for this map (fraction of allocated slots
before the buffers must be rehashed or reallocated).
|
char[] |
values
Hash-indexed array holding all values associated to the keys.
|
| Constructor and Description |
|---|
CharCharHashMap()
Default constructor: Creates a hash map with the default capacity of
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR. |
CharCharHashMap(CharCharAssociativeContainer container)
Create a hash map from all key-value pairs of another container.
|
CharCharHashMap(int initialCapacity)
Creates a hash map with the given initial capacity, default load factor of
HashContainers.DEFAULT_LOAD_FACTOR. |
CharCharHashMap(int initialCapacity,
double loadFactor)
Creates a hash map with the given initial capacity,
load factor.
|
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(char key,
char incrementValue)
Adds
incrementValue to any existing value for the given key
or inserts incrementValue if key did not previously exist. |
int |
capacity()
Return the maximum number of keys this container is guaranteed to hold without reallocating.
|
void |
clear()
Clear all keys and values in the container.
|
CharCharHashMap |
clone() |
boolean |
containsKey(char key)
Returns
true if this container has an association to a value for
the given key. |
boolean |
equals(java.lang.Object obj) |
<T extends CharCharPredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends CharCharProcedure> |
forEach(T procedure)
Applies a given procedure to all keys-value pairs in this container.
|
static CharCharHashMap |
from(char[] keys,
char[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
|
static CharCharHashMap |
from(CharCharAssociativeContainer container)
Create a hash map from another associative container.
|
char |
get(char key) |
char |
getDefaultValue()
Returns the "default value" value used in containers methods returning
"default value"
|
int |
hashCode() |
boolean |
isEmpty()
Note that an empty container may still contain many deleted keys (that occupy buffer
space).
|
CharCharHashMap.EntryIterator |
iterator()
Returns a cursor over the entries (key-value pairs) in this map.
|
CharCharHashMap.KeysCollection |
keys()
Returns a collection view of keys of this container.
|
static CharCharHashMap |
newInstance()
Create a new hash map without providing the full generic signature
(constructor shortcut).
|
static CharCharHashMap |
newInstance(int initialCapacity,
double loadFactor)
Create a new hash map with initial capacity and load factor control.
|
char |
put(char key,
char value)
Place a given key and value in the container.
|
int |
putAll(CharCharAssociativeContainer container)
Puts all keys from another container to this map, replacing the values
of existing keys, if such keys are present.
|
int |
putAll(java.lang.Iterable<? extends CharCharCursor> iterable)
Puts all keys from an iterable cursor to this map, replacing the values
of existing keys, if such keys are present.
|
boolean |
putIfAbsent(char key,
char value)
Trove-inspired API method.
|
char |
putOrAdd(char key,
char putValue,
char incrementValue)
If
key exists, putValue is inserted into the map,
otherwise any existing value is incremented by additionValue. |
char |
remove(char key)
Remove the (key, value) pair associated with the given key, and returns the assocaited value.
|
int |
removeAll(CharCharPredicate predicate)
Removes all keys (and associated values) for which the predicate on (key, value) pairs returns
true. |
int |
removeAll(CharContainer other)
Removes all keys (and associated values) present in a given container.
|
int |
removeAll(CharPredicate predicate)
Removes all keys (and associated values) for which the predicate on keys returns
true. |
void |
setDefaultValue(char defaultValue)
Set the "default value" value to be used in containers methods returning
"default value"
|
int |
size() |
java.lang.String |
toString()
Convert the contents of this map to a human-friendly string.
|
CharCharHashMap.ValuesCollection |
values()
Returns a collection view of all values present in this container.
|
protected char defaultValue
public char[] keys
Direct map iteration: iterate {keys[i], values[i]} for i in [0; keys.length[ where keys[i] != 0/null, then also
{0/null, allocatedDefaultKeyValue } is in the map if allocatedDefaultKey = true.
public char[] values
keys.public boolean allocatedDefaultKey
public char allocatedDefaultKeyValue
protected int assigned
keys.protected final double loadFactor
protected final IteratorPool<CharCharCursor,CharCharHashMap.EntryIterator> entryIteratorPool
public CharCharHashMap()
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR.
See class notes about hash distribution importance.
public CharCharHashMap(int initialCapacity)
HashContainers.DEFAULT_LOAD_FACTOR.
See class notes about hash distribution importance.
initialCapacity - Initial capacity (greater than zero and automatically
rounded to the next power of two).public CharCharHashMap(int initialCapacity,
double loadFactor)
loadFactor - The load factor (greater than zero and smaller than 1).public CharCharHashMap(CharCharAssociativeContainer container)
public char put(char key,
char value)
put in interface CharCharMappublic int putAll(CharCharAssociativeContainer container)
putAll in interface CharCharMappublic int putAll(java.lang.Iterable<? extends CharCharCursor> iterable)
putAll in interface CharCharMappublic boolean putIfAbsent(char key,
char value)
if (!map.containsKey(key))
map.put(key, value);
putIfAbsent in interface CharCharMapkey - The key of the value to check.value - The value to put if key does not exist.true if key did not exist and value
was placed in the map.public char putOrAdd(char key,
char putValue,
char incrementValue)
key exists, putValue is inserted into the map,
otherwise any existing value is incremented by additionValue.putOrAdd in interface CharCharMapkey - The key of the value to adjust.putValue - The value to put if key does not exist.incrementValue - The value to add to the existing value if key exists.key (after
changes).public char addTo(char key,
char incrementValue)
incrementValue to any existing value for the given key
or inserts incrementValue if key did not previously exist.addTo in interface CharCharMapkey - The key of the value to adjust.incrementValue - The value to put or add to the existing value if key exists.key (after changes).public char remove(char key)
remove in interface CharCharMappublic int removeAll(CharContainer other)
removeAll in interface CharCharAssociativeContainerpublic int removeAll(CharPredicate predicate)
true.removeAll in interface CharCharAssociativeContainerpublic int removeAll(CharCharPredicate predicate)
true.removeAll in interface CharCharAssociativeContainerpublic char get(char key)
get in interface CharCharMappublic boolean containsKey(char key)
true if this container has an association to a value for
the given key.containsKey in interface CharCharAssociativeContainerpublic void clear()
clear in interface CharCharMappublic int size()
size in interface CharCharAssociativeContainerpublic int capacity()
O(n) time.capacity in interface CharCharAssociativeContainerpublic boolean isEmpty()
Note that an empty container may still contain many deleted keys (that occupy buffer space). Adding even a single element to such a container may cause rehashing.
isEmpty in interface CharCharAssociativeContainertrue if this hash map contains no assigned keys.public int hashCode()
hashCode in class java.lang.Objectpublic boolean equals(java.lang.Object obj)
equals in class java.lang.Objectpublic CharCharHashMap.EntryIterator iterator()
Iterator.next(). To read the current key and value use the cursor's
public fields. An example is shown below.
for (IntShortCursor c : intShortMap)
{
System.out.println("index=" + c.index
+ " key=" + c.key
+ " value=" + c.value);
}
The index field inside the cursor gives the internal index inside
the container's implementation. The interpretation of this index depends on
to the container.
iterator in interface CharCharAssociativeContaineriterator in interface java.lang.Iterable<CharCharCursor>public <T extends CharCharProcedure> T forEach(T procedure)
CharCharProcedure. This lets the caller to call methods of the argument
by chaining the call (even if the argument is an anonymous type) to retrieve computed values,
for example.forEach in interface CharCharAssociativeContainerpublic <T extends CharCharPredicate> T forEach(T predicate)
predicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.
Returns the argument (any
subclass of CharCharPredicate. This lets the caller to call methods of the argument
by chaining the call (even if the argument is an anonymous type) to retrieve computed values,
for example.
The iteration is continued as long as the predicate returns true.forEach in interface CharCharAssociativeContainerpublic CharCharHashMap.KeysCollection keys()
keys in interface CharCharAssociativeContainerpublic CharCharHashMap.ValuesCollection values()
values in interface CharCharAssociativeContainerpublic CharCharHashMap clone()
clone in class java.lang.Objectpublic java.lang.String toString()
toString in class java.lang.Objectpublic static CharCharHashMap from(char[] keys, char[] values)
public static CharCharHashMap from(CharCharAssociativeContainer container)
public static CharCharHashMap newInstance()
public static CharCharHashMap newInstance(int initialCapacity, double loadFactor)
public char getDefaultValue()
getDefaultValue in interface CharCharMappublic void setDefaultValue(char defaultValue)
setDefaultValue in interface CharCharMapCopyright © 2017. All rights reserved.