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