LongShortHashMap (HPPC-RT v0.7.5 API Documentation)

java.lang.Object
- com.carrotsearch.hppcrt.maps.LongShortHashMap

All Implemented Interfaces:

LongShortAssociativeContainer, LongShortMap, java.lang.Cloneable, java.lang.Iterable<LongShortCursor>
```
@Generated(date="2017-07-11T19:16:31+0200",
           value="KTypeVTypeHashMap.java")
public class LongShortHashMap
extends java.lang.Object
implements LongShortMap, java.lang.Cloneable
```
A hash map of long to short, 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.

Nested Class Summary

Nested Classes
Modifier and Type	Class and Description
`class`	`LongShortHashMap.EntryIterator` An iterator implementation for `iterator()`.
`class`	`LongShortHashMap.KeysCollection` A view of the keys inside this map.
`class`	`LongShortHashMap.KeysIterator` An iterator over the set of keys.
`class`	`LongShortHashMap.ValuesCollection` A view over the set of values of this map.
`class`	`LongShortHashMap.ValuesIterator` An iterator over the set of values.

Field Summary

Fields
Modifier and Type	Field and Description
`boolean`	`allocatedDefaultKey` True if key = 0/null is in the map.
`short`	`allocatedDefaultKeyValue` if allocatedDefaultKey = true, contains the associated V to the key = 0/null
`protected int`	`assigned` Cached number of assigned slots in `keys`.
`protected short`	`defaultValue`
`protected IteratorPool<LongShortCursor,LongShortHashMap.EntryIterator>`	`entryIteratorPool` internal pool of EntryIterator
`long[]`	`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).
`short[]`	`values` Hash-indexed array holding all values associated to the keys.

Constructor Summary

Constructors
Constructor and Description
`LongShortHashMap()` Default constructor: Creates a hash map with the default capacity of `Containers.DEFAULT_EXPECTED_ELEMENTS`, load factor of `HashContainers.DEFAULT_LOAD_FACTOR`.
`LongShortHashMap(int initialCapacity)` Creates a hash map with the given initial capacity, default load factor of `HashContainers.DEFAULT_LOAD_FACTOR`.
`LongShortHashMap(int initialCapacity, double loadFactor)` Creates a hash map with the given initial capacity, load factor.
`LongShortHashMap(LongShortAssociativeContainer container)` Create a hash map from all key-value pairs of another container.

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`short`	`addTo(long key, short 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.
`LongShortHashMap`	`clone()`
`boolean`	`containsKey(long key)` Returns `true` if this container has an association to a value for the given key.
`boolean`	`equals(java.lang.Object obj)`
`<T extends LongShortPredicate> T`	`forEach(T predicate)` Applies a `predicate` to container elements, as long as the predicate returns `true`.
`<T extends LongShortProcedure> T`	`forEach(T procedure)` Applies a given procedure to all keys-value pairs in this container.
`static LongShortHashMap`	`from(long[] keys, short[] values)` Creates a hash map from two index-aligned arrays of key-value pairs.
`static LongShortHashMap`	`from(LongShortAssociativeContainer container)` Create a hash map from another associative container.
`short`	`get(long key)`
`short`	`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).
`LongShortHashMap.EntryIterator`	`iterator()` Returns a cursor over the entries (key-value pairs) in this map.
`LongShortHashMap.KeysCollection`	`keys()` Returns a collection view of keys of this container.
`static LongShortHashMap`	`newInstance()` Create a new hash map without providing the full generic signature (constructor shortcut).
`static LongShortHashMap`	`newInstance(int initialCapacity, double loadFactor)` Create a new hash map with initial capacity and load factor control.
`short`	`put(long key, short value)` Place a given key and value in the container.
`int`	`putAll(java.lang.Iterable<? extends LongShortCursor> iterable)` Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.
`int`	`putAll(LongShortAssociativeContainer container)` Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.
`boolean`	`putIfAbsent(long key, short value)` Trove-inspired API method.
`short`	`putOrAdd(long key, short putValue, short incrementValue)` If `key` exists, `putValue` is inserted into the map, otherwise any existing value is incremented by `additionValue`.
`short`	`remove(long key)` Remove the (key, value) pair associated with the given key, and returns the assocaited value.
`int`	`removeAll(LongContainer other)` Removes all keys (and associated values) present in a given container.
`int`	`removeAll(LongPredicate predicate)` Removes all keys (and associated values) for which the predicate on keys returns `true`.
`int`	`removeAll(LongShortPredicate predicate)` Removes all keys (and associated values) for which the predicate on (key, value) pairs returns `true`.
`void`	`setDefaultValue(short 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.
`LongShortHashMap.ValuesCollection`	`values()` Returns a collection view of all values present in this container.

Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable
forEach, spliterator

- Field Detail
  - defaultValue
```
protected short defaultValue
```
  - keys
```
public long[] keys
```
    Hash-indexed array holding all 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.
  - values
```
public short[] values
```
    Hash-indexed array holding all values associated to the keys. stored in keys.
  - allocatedDefaultKey
```
public boolean allocatedDefaultKey
```
    True if key = 0/null is in the map.
  - allocatedDefaultKeyValue
```
public short allocatedDefaultKeyValue
```
    if allocatedDefaultKey = true, contains the associated V to the key = 0/null
  - assigned
```
protected int assigned
```
    Cached number of assigned slots in keys.
  - loadFactor
```
protected final double loadFactor
```
    The load factor for this map (fraction of allocated slots before the buffers must be rehashed or reallocated).
  - entryIteratorPool
```
protected final IteratorPool<LongShortCursor,LongShortHashMap.EntryIterator> entryIteratorPool
```
    internal pool of EntryIterator
- Constructor Detail
  - LongShortHashMap
```
public LongShortHashMap()
```
    Default constructor: Creates a hash map with the default capacity of Containers.DEFAULT_EXPECTED_ELEMENTS, load factor of HashContainers.DEFAULT_LOAD_FACTOR.
    See class notes about hash distribution importance.
  - LongShortHashMap
```
public LongShortHashMap(int initialCapacity)
```
    Creates a hash map with the given initial capacity, default load factor of HashContainers.DEFAULT_LOAD_FACTOR.
    See class notes about hash distribution importance.
    
    Parameters:
    
    initialCapacity - Initial capacity (greater than zero and automatically rounded to the next power of two).
  - LongShortHashMap
```
public LongShortHashMap(int initialCapacity,
                        double loadFactor)
```
    Creates a hash map with the given initial capacity, load factor.
    
    Parameters:
    
    loadFactor - The load factor (greater than zero and smaller than 1).
  - LongShortHashMap
```
public LongShortHashMap(LongShortAssociativeContainer container)
```
    Create a hash map from all key-value pairs of another container.
- Method Detail
  - put
```
public short put(long key,
                 short value)
```
    Place a given key and value in the container.
    
    Specified by:
    
    put in interface LongShortMap
    
    Returns:
    
    Returns the value previously stored under the given key, if an equal key is already in the map and replaces the existing value only with the argument value. If the given key was not already in the map, the given (key, value) pair is inserted in the map and the default value is returned.
  - putAll
```
public int putAll(LongShortAssociativeContainer container)
```
    Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.
    
    Specified by:
    
    putAll in interface LongShortMap
    
    Returns:
    
    Returns the number of keys added to the map as a result of this call (not previously present in the map). Values of existing keys are overwritten.
  - putAll
```
public int putAll(java.lang.Iterable<? extends LongShortCursor> iterable)
```
    Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.
    
    Specified by:
    
    putAll in interface LongShortMap
    
    Returns:
    
    Returns the number of keys added to the map as a result of this call (not previously present in the map). Values of existing keys are overwritten.
  - putIfAbsent
```
public boolean putIfAbsent(long key,
                           short value)
```
    Trove-inspired API method. An equivalent of the following code:
```
 if (!map.containsKey(key))
      map.put(key, value);
 
```
    Specified by:
    
    putIfAbsent in interface LongShortMap
    
    Parameters:
    
    key - The key of the value to check.
    
    value - The value to put if key does not exist.
    
    Returns:
    
    true if key did not exist and value was placed in the map.
  - putOrAdd
```
public short putOrAdd(long key,
                      short putValue,
                      short incrementValue)
```
    If key exists, putValue is inserted into the map, otherwise any existing value is incremented by additionValue.
    
    Specified by:
    
    putOrAdd in interface LongShortMap
    
    Parameters:
    
    key - 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.
    
    Returns:
    
    Returns the current value associated with key (after changes).
  - addTo
```
public short addTo(long key,
                   short incrementValue)
```
    Adds incrementValue to any existing value for the given key or inserts incrementValue if key did not previously exist.
    
    Specified by:
    
    addTo in interface LongShortMap
    
    Parameters:
    
    key - The key of the value to adjust.
    
    incrementValue - The value to put or add to the existing value if key exists.
    
    Returns:
    
    Returns the current value associated with key (after changes).
  - remove
```
public short remove(long key)
```
    Remove the (key, value) pair associated with the given key, and returns the assocaited value. The default value is returned if the key did not exist in the map.
    
    Specified by:
    
    remove in interface LongShortMap
  - removeAll
```
public int removeAll(LongContainer other)
```
    Removes all keys (and associated values) present in a given container.
    
    Specified by:
    
    removeAll in interface LongShortAssociativeContainer
    
    Returns:
    
    Returns the number of elements actually removed as a result of this call.
  - removeAll
```
public int removeAll(LongPredicate predicate)
```
    Removes all keys (and associated values) for which the predicate on keys returns true.
    
    Specified by:
    
    removeAll in interface LongShortAssociativeContainer
    
    Returns:
    
    Returns the number of elements actually removed as a result of this call.
  - removeAll
```
public int removeAll(LongShortPredicate predicate)
```
    Removes all keys (and associated values) for which the predicate on (key, value) pairs returns true.
    
    Specified by:
    
    removeAll in interface LongShortAssociativeContainer
    
    Returns:
    
    Returns the number of elements actually removed as a result of this call.
  - get
```
public short get(long key)
```
    Specified by:
    
    get in interface LongShortMap
    
    Returns:
    
    Returns the value associated with the given key, or the default value if the key is not associated with any value.
  - containsKey
```
public boolean containsKey(long key)
```
    Returns true if this container has an association to a value for the given key.
    
    Specified by:
    
    containsKey in interface LongShortAssociativeContainer
  - clear
```
public void clear()
```
    Clear all keys and values in the container.
    
    Specified by:
    
    clear in interface LongShortMap
  - size
```
public int size()
```
    Specified by:
    
    size in interface LongShortAssociativeContainer
    
    Returns:
    
    Returns the current size (number of assigned keys) in the container.
  - capacity
```
public int capacity()
```
    Return the maximum number of keys this container is guaranteed to hold without reallocating. The time for calculating the container's capacity may take O(n) time.
    
    Specified by:
    
    capacity in interface LongShortAssociativeContainer
  - isEmpty
```
public 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.
    
    Specified by:
    
    isEmpty in interface LongShortAssociativeContainer
    
    Returns:
    
    Return true if this hash map contains no assigned keys.
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class java.lang.Object
  - equals
```
public boolean equals(java.lang.Object obj)
```
    Overrides:
    
    equals in class java.lang.Object
  - iterator
```
public LongShortHashMap.EntryIterator iterator()
```
    Returns a cursor over the entries (key-value pairs) in this map. The iterator is implemented as a cursor and it returns the same cursor instance on every call to 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.
    Specified by:
    
    iterator in interface LongShortAssociativeContainer
    
    Specified by:
    
    iterator in interface java.lang.Iterable<LongShortCursor>
  - forEach
```
public <T extends LongShortProcedure> T forEach(T procedure)
```
    Applies a given procedure to all keys-value pairs in this container. Returns the argument (any subclass of LongShortProcedure. 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.
    
    Specified by:
    
    forEach in interface LongShortAssociativeContainer
  - forEach
```
public <T extends LongShortPredicate> T forEach(T predicate)
```
    Applies a predicate to container elements, as long as the predicate returns true. The iteration is interrupted otherwise. Returns the argument (any subclass of LongShortPredicate. 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.
    
    Specified by:
    
    forEach in interface LongShortAssociativeContainer
  - keys
```
public LongShortHashMap.KeysCollection keys()
```
    Returns a collection view of keys of this container. The returned collection is a view over the key set and any modifications (if allowed) introduced to the collection will propagate to the associative container immediately.
    
    Specified by:
    
    keys in interface LongShortAssociativeContainer
    
    Returns:
    
    a new KeysCollection view of the keys of this map.
  - values
```
public LongShortHashMap.ValuesCollection values()
```
    Returns a collection view of all values present in this container. The returned collection is a view over the value set and any modifications (if allowed) introduced to the collection will propagate to the associative container immediately.
    
    Specified by:
    
    values in interface LongShortAssociativeContainer
    
    Returns:
    
    a new ValuesCollection view of the values of this map.
  - clone
```
public LongShortHashMap clone()
```
    Overrides:
    
    clone in class java.lang.Object
  - toString
```
public java.lang.String toString()
```
    Convert the contents of this map to a human-friendly string.
    
    Overrides:
    
    toString in class java.lang.Object
  - from
```
public static LongShortHashMap from(long[] keys,
                                    short[] values)
```
    Creates a hash map from two index-aligned arrays of key-value pairs. Default load factor is used.
  - from
```
public static LongShortHashMap from(LongShortAssociativeContainer container)
```
    Create a hash map from another associative container. (constructor shortcut) Default load factor is used.
  - newInstance
```
public static LongShortHashMap newInstance()
```
    Create a new hash map without providing the full generic signature (constructor shortcut).
  - newInstance
```
public static LongShortHashMap newInstance(int initialCapacity,
                                           double loadFactor)
```
    Create a new hash map with initial capacity and load factor control. (constructor shortcut).
  - getDefaultValue
```
public short getDefaultValue()
```
    Returns the "default value" value used in containers methods returning "default value"
    
    Specified by:
    
    getDefaultValue in interface LongShortMap
  - setDefaultValue
```
public void setDefaultValue(short defaultValue)
```
    Set the "default value" value to be used in containers methods returning "default value"
    
    Specified by:
    
    setDefaultValue in interface LongShortMap

Class LongShortHashMap

Nested Class Summary

Field Summary

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Methods inherited from interface java.lang.Iterable

Field Detail

defaultValue

keys

values

allocatedDefaultKey

allocatedDefaultKeyValue

assigned

loadFactor

entryIteratorPool

Constructor Detail

LongShortHashMap

LongShortHashMap

LongShortHashMap

LongShortHashMap

Method Detail

put

putAll

putAll

putIfAbsent

putOrAdd

addTo

remove

removeAll

removeAll

removeAll

get

containsKey

clear

size

capacity

isEmpty

hashCode

equals

iterator

forEach

forEach

keys

values

clone

toString

from

from

newInstance

newInstance

getDefaultValue

setDefaultValue