Package com.carrotsearch.hppc
Interface LongByteMap
- All Superinterfaces:
Iterable<LongByteCursor>
,LongByteAssociativeContainer
- All Known Implementing Classes:
LongByteHashMap
,LongByteScatterMap
@Generated(date="2023-10-26T04:33:10+0000",
value="KTypeVTypeMap.java")
public interface LongByteMap
extends LongByteAssociativeContainer
An associative container with unique binding from keys to a single value.
-
Method Summary
Modifier and TypeMethodDescriptionbyte
addTo
(long key, byte additionValue) An equivalent of callingvoid
clear()
Clear all keys and values in the container.boolean
Compares the specified object with this set for equality.byte
get
(long key) byte
getOrDefault
(long key, byte defaultValue) int
hashCode()
boolean
indexExists
(int index) byte
indexGet
(int index) Returns the value associated with an existing key.void
indexInsert
(int index, long key, byte value) Inserts a key-value pair for a key that is not present in the map.int
indexOf
(long key) Returns a logical "index" of a given key that can be used to speed up follow-up value setters or getters in certain scenarios (conditional logic).byte
indexReplace
(int index, byte newValue) Replaces the value associated with an existing key and returns any previous value stored for that key.byte
put
(long key, byte value) Place a given key and value in the container.int
putAll
(LongByteAssociativeContainer container) Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.int
putAll
(Iterable<? extends LongByteCursor> iterable) Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.byte
putOrAdd
(long key, byte putValue, byte incrementValue) Ifkey
exists,putValue
is inserted into the map, otherwise any existing value is incremented byadditionValue
.void
release()
Removes all elements from the collection and additionally releases any internal buffers.byte
remove
(long key) Remove all values at the given key.visualizeKeyDistribution
(int characters) Visually depict the distribution of keys.Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Method Details
-
get
byte get(long key) - Returns:
- Returns the value associated with the given key or the default value for the key type, if the key is not associated with any value. Important note: For primitive type values, the value returned for a non-existing key may not be the default value of the primitive type (it may be any value previously assigned to that slot).
-
getOrDefault
byte getOrDefault(long key, byte defaultValue) - Returns:
- Returns the value associated with the given key or the provided default value if the key is not associated with any value.
-
put
byte put(long key, byte value) Place a given key and value in the container.- Returns:
- The value previously stored under the given key in the map is returned.
-
putAll
Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.- 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
Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.- 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.
-
putOrAdd
byte putOrAdd(long key, byte putValue, byte incrementValue) Ifkey
exists,putValue
is inserted into the map, otherwise any existing value is incremented byadditionValue
.- Parameters:
key
- The key of the value to adjust.putValue
- The value to put ifkey
does not exist.incrementValue
- The value to add to the existing value ifkey
exists.- Returns:
- Returns the current value associated with
key
(after changes).
-
addTo
byte addTo(long key, byte additionValue) An equivalent of callingputOrAdd(key, additionValue, additionValue);
- Parameters:
key
- The key of the value to adjust.additionValue
- The value to put or add to the existing value ifkey
exists.- Returns:
- Returns the current value associated with
key
(after changes).
-
remove
byte remove(long key) Remove all values at the given key. The default value for the key type is returned if the value does not exist in the map. -
equals
Compares the specified object with this set for equality. Returns true if and only if the specified object is also aLongByteMap
and both objects contains exactly the same key-value pairs. -
hashCode
int hashCode() -
indexOf
int indexOf(long key) Returns a logical "index" of a given key that can be used to speed up follow-up value setters or getters in certain scenarios (conditional logic). The semantics of "indexes" are not strictly defined. Indexes may (and typically won't be) contiguous. The index is valid only between map modifications (it will not be affected by read-only operations like iteration or value retrievals).- Parameters:
key
- The key to locate in the map.- Returns:
- A non-negative value of the logical "index" of the key in the map or a negative value if the key did not exist.
- See Also:
-
indexExists
boolean indexExists(int index) - Parameters:
index
- The index of a given key, as returned fromindexOf(long)
.- Returns:
- Returns
true
if the index corresponds to an existing key or false otherwise. This is equivalent to checking whether the index is a positive value (existing keys) or a negative value (non-existing keys). - See Also:
-
indexGet
byte indexGet(int index) Returns the value associated with an existing key.- Parameters:
index
- The index of an existing key.- Returns:
- Returns the value currently associated with the key.
- Throws:
AssertionError
- If assertions are enabled and the index does not correspond to an existing key.- See Also:
-
indexReplace
byte indexReplace(int index, byte newValue) Replaces the value associated with an existing key and returns any previous value stored for that key.- Parameters:
index
- The index of an existing key.- Returns:
- Returns the previous value associated with the key.
- Throws:
AssertionError
- If assertions are enabled and the index does not correspond to an existing key.- See Also:
-
indexInsert
void indexInsert(int index, long key, byte value) Inserts a key-value pair for a key that is not present in the map. This method may help in avoiding double recalculation of the key's hash.- Parameters:
index
- The index of a previously non-existing key, as returned fromindexOf(long)
.- Throws:
AssertionError
- If assertions are enabled and the index corresponds to an existing key.- See Also:
-
clear
void clear()Clear all keys and values in the container.- See Also:
-
release
void release()Removes all elements from the collection and additionally releases any internal buffers. Typically, if the object is to be reused, a simpleclear()
should be a better alternative since it'll avoid reallocation.- See Also:
-
visualizeKeyDistribution
Visually depict the distribution of keys.- Parameters:
characters
- The number of characters to "squeeze" the entire buffer into.- Returns:
- Returns a sequence of characters where '.' depicts an empty fragment of the internal buffer and 'X' depicts full or nearly full capacity within the buffer's range and anything between 1 and 9 is between.
-