@Generated(date="2017-07-11T19:16:30+0200",
value="KTypeVTypeHashMap.java")
public class ShortIntHashMap
extends java.lang.Object
implements ShortIntMap, java.lang.Cloneable
short to int, 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 |
ShortIntHashMap.EntryIterator
An iterator implementation for
iterator(). |
class |
ShortIntHashMap.KeysCollection
A view of the keys inside this map.
|
class |
ShortIntHashMap.KeysIterator
An iterator over the set of keys.
|
class |
ShortIntHashMap.ValuesCollection
A view over the set of values of this map.
|
class |
ShortIntHashMap.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.
|
int |
allocatedDefaultKeyValue
if allocatedDefaultKey = true, contains the associated V to the key = 0/null
|
protected int |
assigned
Cached number of assigned slots in
keys. |
protected int |
defaultValue |
protected IteratorPool<ShortIntCursor,ShortIntHashMap.EntryIterator> |
entryIteratorPool
internal pool of EntryIterator
|
short[] |
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).
|
int[] |
values
Hash-indexed array holding all values associated to the keys.
|
| Constructor and Description |
|---|
ShortIntHashMap()
Default constructor: Creates a hash map with the default capacity of
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR. |
ShortIntHashMap(int initialCapacity)
Creates a hash map with the given initial capacity, default load factor of
HashContainers.DEFAULT_LOAD_FACTOR. |
ShortIntHashMap(int initialCapacity,
double loadFactor)
Creates a hash map with the given initial capacity,
load factor.
|
ShortIntHashMap(ShortIntAssociativeContainer container)
Create a hash map from all key-value pairs of another container.
|
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(short key,
int 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.
|
ShortIntHashMap |
clone() |
boolean |
containsKey(short key)
Returns
true if this container has an association to a value for
the given key. |
boolean |
equals(java.lang.Object obj) |
<T extends ShortIntPredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends ShortIntProcedure> |
forEach(T procedure)
Applies a given procedure to all keys-value pairs in this container.
|
static ShortIntHashMap |
from(short[] keys,
int[] values)
Creates a hash map from two index-aligned arrays of key-value pairs.
|
static ShortIntHashMap |
from(ShortIntAssociativeContainer container)
Create a hash map from another associative container.
|
int |
get(short key) |
int |
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).
|
ShortIntHashMap.EntryIterator |
iterator()
Returns a cursor over the entries (key-value pairs) in this map.
|
ShortIntHashMap.KeysCollection |
keys()
Returns a collection view of keys of this container.
|
static ShortIntHashMap |
newInstance()
Create a new hash map without providing the full generic signature
(constructor shortcut).
|
static ShortIntHashMap |
newInstance(int initialCapacity,
double loadFactor)
Create a new hash map with initial capacity and load factor control.
|
int |
put(short key,
int value)
Place a given key and value in the container.
|
int |
putAll(java.lang.Iterable<? extends ShortIntCursor> iterable)
Puts all keys from an iterable cursor to this map, replacing the values
of existing keys, if such keys are present.
|
int |
putAll(ShortIntAssociativeContainer container)
Puts all keys from another container to this map, replacing the values
of existing keys, if such keys are present.
|
boolean |
putIfAbsent(short key,
int value)
Trove-inspired API method.
|
int |
putOrAdd(short key,
int putValue,
int incrementValue)
If
key exists, putValue is inserted into the map,
otherwise any existing value is incremented by additionValue. |
int |
remove(short key)
Remove the (key, value) pair associated with the given key, and returns the assocaited value.
|
int |
removeAll(ShortContainer other)
Removes all keys (and associated values) present in a given container.
|
int |
removeAll(ShortIntPredicate predicate)
Removes all keys (and associated values) for which the predicate on (key, value) pairs returns
true. |
int |
removeAll(ShortPredicate predicate)
Removes all keys (and associated values) for which the predicate on keys returns
true. |
void |
setDefaultValue(int 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.
|
ShortIntHashMap.ValuesCollection |
values()
Returns a collection view of all values present in this container.
|
protected int defaultValue
public short[] 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 int[] values
keys.public boolean allocatedDefaultKey
public int allocatedDefaultKeyValue
protected int assigned
keys.protected final double loadFactor
protected final IteratorPool<ShortIntCursor,ShortIntHashMap.EntryIterator> entryIteratorPool
public ShortIntHashMap()
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR.
See class notes about hash distribution importance.
public ShortIntHashMap(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 ShortIntHashMap(int initialCapacity,
double loadFactor)
loadFactor - The load factor (greater than zero and smaller than 1).public ShortIntHashMap(ShortIntAssociativeContainer container)
public int put(short key,
int value)
put in interface ShortIntMappublic int putAll(ShortIntAssociativeContainer container)
putAll in interface ShortIntMappublic int putAll(java.lang.Iterable<? extends ShortIntCursor> iterable)
putAll in interface ShortIntMappublic boolean putIfAbsent(short key,
int value)
if (!map.containsKey(key))
map.put(key, value);
putIfAbsent in interface ShortIntMapkey - 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 int putOrAdd(short key,
int putValue,
int incrementValue)
key exists, putValue is inserted into the map,
otherwise any existing value is incremented by additionValue.putOrAdd in interface ShortIntMapkey - 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 int addTo(short key,
int incrementValue)
incrementValue to any existing value for the given key
or inserts incrementValue if key did not previously exist.addTo in interface ShortIntMapkey - 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 int remove(short key)
remove in interface ShortIntMappublic int removeAll(ShortContainer other)
removeAll in interface ShortIntAssociativeContainerpublic int removeAll(ShortPredicate predicate)
true.removeAll in interface ShortIntAssociativeContainerpublic int removeAll(ShortIntPredicate predicate)
true.removeAll in interface ShortIntAssociativeContainerpublic int get(short key)
get in interface ShortIntMappublic boolean containsKey(short key)
true if this container has an association to a value for
the given key.containsKey in interface ShortIntAssociativeContainerpublic void clear()
clear in interface ShortIntMappublic int size()
size in interface ShortIntAssociativeContainerpublic int capacity()
O(n) time.capacity in interface ShortIntAssociativeContainerpublic 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 ShortIntAssociativeContainertrue 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 ShortIntHashMap.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 ShortIntAssociativeContaineriterator in interface java.lang.Iterable<ShortIntCursor>public <T extends ShortIntProcedure> T forEach(T procedure)
ShortIntProcedure. 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 ShortIntAssociativeContainerpublic <T extends ShortIntPredicate> 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 ShortIntPredicate. 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 ShortIntAssociativeContainerpublic ShortIntHashMap.KeysCollection keys()
keys in interface ShortIntAssociativeContainerpublic ShortIntHashMap.ValuesCollection values()
values in interface ShortIntAssociativeContainerpublic ShortIntHashMap clone()
clone in class java.lang.Objectpublic java.lang.String toString()
toString in class java.lang.Objectpublic static ShortIntHashMap from(short[] keys, int[] values)
public static ShortIntHashMap from(ShortIntAssociativeContainer container)
public static ShortIntHashMap newInstance()
public static ShortIntHashMap newInstance(int initialCapacity, double loadFactor)
public int getDefaultValue()
getDefaultValue in interface ShortIntMappublic void setDefaultValue(int defaultValue)
setDefaultValue in interface ShortIntMapCopyright © 2017. All rights reserved.