@Generated(date="2016-02-06T03:13:45+0000", value="HPPC generated from: ByteIntMap.java") public interface ByteIntMap extends ByteIntAssociativeContainer
Modifier and Type | Method and Description |
---|---|
int |
addTo(byte key,
int additionValue)
An equivalent of calling
|
boolean |
equals(java.lang.Object obj)
Compares the specified object with this set for equality.
|
int |
get(byte key) |
int |
getOrDefault(byte key,
int defaultValue) |
int |
hashCode() |
int |
put(byte key,
int value)
Place a given key and value in the container.
|
int |
putAll(ByteIntAssociativeContainer 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 ByteIntCursor> iterable)
Puts all keys from an iterable cursor to this map, replacing the values
of existing keys, if such keys are present.
|
int |
putOrAdd(byte key,
int putValue,
int additionValue)
Trove-inspired API method.
|
int |
remove(byte key)
Remove all values at the given key.
|
int put(byte key, int value)
int addTo(byte key, int additionValue)
putOrAdd(key, additionValue, additionValue);
key
- The key of the value to adjust.additionValue
- The value to put or add to the existing value if key
exists.key
(after changes).int putOrAdd(byte key, int putValue, int additionValue)
if (containsKey(key)) { int v = (int) (lget() + additionValue); lset(v); return v; } else { put(key, putValue); return putValue; }
key
- The key of the value to adjust.putValue
- The value to put if key
does not exist.additionValue
- The value to add to the existing value if key
exists.key
(after changes).int get(byte key)
int getOrDefault(byte key, int defaultValue)
int putAll(ByteIntAssociativeContainer container)
int putAll(java.lang.Iterable<? extends ByteIntCursor> iterable)
int remove(byte key)
boolean equals(java.lang.Object obj)
ByteIntMap
and both objects contains exactly the same key-value pairs.equals
in class java.lang.Object
int hashCode()
hashCode
in class java.lang.Object
Copyright © 2016 Carrot Search s.c.. All rights reserved.