public class Object2ByteRBTreeMap<K> extends AbstractObject2ByteSortedMap<K> implements Serializable, Cloneable
The iterators provided by the views of this class are type-specific bidirectional iterators.
Moreover, the iterator returned by iterator() can be safely cast
to a type-specific list iterator.
AbstractObject2ByteMap.BasicEntry<K>, AbstractObject2ByteMap.BasicEntrySet<K>Object2ByteSortedMap.FastSortedEntrySet<K>Object2ByteMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2ByteRBTreeMap()
Creates a new empty tree map.
|
Object2ByteRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2ByteRBTreeMap(K[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2ByteRBTreeMap(K[] k,
byte[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2ByteRBTreeMap(Map<? extends K,? extends Byte> m)
Creates a new tree map copying a given map.
|
Object2ByteRBTreeMap(Object2ByteMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2ByteRBTreeMap(Object2ByteSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2ByteRBTreeMap(SortedMap<K,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(K k,
byte incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Object2ByteRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(byte v)
Returns
true if this map maps one or more keys to the specified value. |
K |
firstKey() |
byte |
getByte(Object k)
Returns the value to which the given key is mapped.
|
Object2ByteSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
ObjectSortedSet<Object2ByteMap.Entry<K>> |
object2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
byte |
put(K k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
removeByte(Object k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Object2ByteSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2ByteSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ByteCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySetcomputeByte, computeByteIfAbsent, computeByteIfAbsentPartial, computeByteIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, putAll, replaceAllpublic Object2ByteRBTreeMap()
public Object2ByteRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2ByteRBTreeMap(Map<? extends K,? extends Byte> m)
m - a Map to be copied into the new tree map.public Object2ByteRBTreeMap(SortedMap<K,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2ByteRBTreeMap(Object2ByteMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2ByteRBTreeMap(Object2ByteSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2ByteRBTreeMap(K[] k, byte[] v, Comparator<? super K> c)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.c - a (possibly type-specific) comparator.IllegalArgumentException - if k and v have different lengths.public Object2ByteRBTreeMap(K[] k, byte[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.IllegalArgumentException - if k and v have different lengths.public byte addTo(K k, byte incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public byte put(K k, byte v)
Object2ByteFunctionput in interface Object2ByteFunction<K>k - the key.v - the value.Function.put(Object,Object)public byte removeByte(Object k)
Object2ByteFunctionremoveByte in interface Object2ByteFunction<K>k - the key.Function.remove(Object)public boolean containsValue(byte v)
Object2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Object2ByteMap<K>containsValue in class AbstractObject2ByteMap<K>Map.containsValue(Object)public void clear()
Object2ByteMapclear in interface Object2ByteMap<K>clear in interface Map<K,Byte>Map.clear()public boolean containsKey(Object k)
Object2ByteMapcontainsKey in interface Object2ByteMap<K>containsKey in interface Map<K,Byte>containsKey in class AbstractObject2ByteMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public byte getByte(Object k)
Object2ByteFunctiongetByte in interface Object2ByteFunction<K>k - the key.Function.get(Object)public ObjectSortedSet<Object2ByteMap.Entry<K>> object2ByteEntrySet()
Object2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
object2ByteEntrySet in interface Object2ByteMap<K>object2ByteEntrySet in interface Object2ByteSortedMap<K>Object2ByteSortedMap.entrySet()public ObjectSortedSet<K> keySet()
In addition to the semantics of Map.keySet(), you can
safely cast the set returned by this call to a type-specific sorted
set interface.
keySet in interface Object2ByteMap<K>keySet in interface Object2ByteSortedMap<K>keySet in interface Map<K,Byte>keySet in interface SortedMap<K,Byte>keySet in class AbstractObject2ByteSortedMap<K>Map.keySet()public ByteCollection values()
In addition to the semantics of Map.values(), you can
safely cast the collection returned by this call to a type-specific collection
interface.
values in interface Object2ByteMap<K>values in interface Object2ByteSortedMap<K>values in interface Map<K,Byte>values in interface SortedMap<K,Byte>values in class AbstractObject2ByteSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2ByteSortedMap<K>comparator in interface SortedMap<K,Byte>SortedMap.comparator()public Object2ByteSortedMap<K> headMap(K to)
Object2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2ByteSortedMap<K>headMap in interface SortedMap<K,Byte>SortedMap.headMap(Object)public Object2ByteSortedMap<K> tailMap(K from)
Object2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2ByteSortedMap<K>tailMap in interface SortedMap<K,Byte>SortedMap.tailMap(Object)public Object2ByteSortedMap<K> subMap(K from, K to)
Object2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2ByteSortedMap<K>subMap in interface SortedMap<K,Byte>SortedMap.subMap(Object,Object)public Object2ByteRBTreeMap<K> clone()
This method performs a deep copy of this tree map; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.