public class Int2ByteRBTreeMap extends AbstractInt2ByteSortedMap implements java.io.Serializable, java.lang.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.
AbstractInt2ByteMap.BasicEntry, AbstractInt2ByteMap.BasicEntrySetInt2ByteSortedMap.FastSortedEntrySetInt2ByteMap.FastEntrySet| Constructor and Description |
|---|
Int2ByteRBTreeMap()
Creates a new empty tree map.
|
Int2ByteRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ByteRBTreeMap(int[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ByteRBTreeMap(int[] k,
byte[] v,
java.util.Comparator<? super java.lang.Integer> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Int2ByteRBTreeMap(Int2ByteMap m)
Creates a new tree map copying a given map.
|
Int2ByteRBTreeMap(Int2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2ByteRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Byte> m)
Creates a new tree map copying a given map.
|
Int2ByteRBTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(int 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).
|
Int2ByteRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses
its keys' natural ordering.
|
boolean |
containsKey(int 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. |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
byte |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ByteSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less
than
toKey. |
ObjectSortedSet<Int2ByteMap.Entry> |
int2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey()
Returns the last (highest) key currently in this map.
|
byte |
put(int k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Int2ByteSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2ByteSortedMap |
tailMap(int 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, defaultReturnValueentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntpublic Int2ByteRBTreeMap()
public Int2ByteRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c - a (possibly type-specific) comparator.public Int2ByteRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Byte> m)
m - a Map to be copied into the new tree map.public Int2ByteRBTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2ByteRBTreeMap(Int2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Int2ByteRBTreeMap(Int2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2ByteRBTreeMap(int[] k,
byte[] v,
java.util.Comparator<? super java.lang.Integer> 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.java.lang.IllegalArgumentException - if k and v have different lengths.public Int2ByteRBTreeMap(int[] k,
byte[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.java.lang.IllegalArgumentException - if k and v have different lengths.public byte addTo(int 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(int k,
byte v)
Int2ByteFunctionput in interface Int2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(int k)
Int2ByteFunctionremove in interface Int2ByteFunctionk - the key.Function.remove(Object)public boolean containsValue(byte v)
Int2ByteMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Int2ByteMapcontainsValue in class AbstractInt2ByteMapMap.containsValue(Object)public void clear()
Int2ByteMapclear in interface Int2ByteMapclear in interface java.util.Map<java.lang.Integer,java.lang.Byte>Map.clear()public boolean containsKey(int k)
Int2ByteMapcontainsKey in interface Int2ByteFunctioncontainsKey in interface Int2ByteMapcontainsKey in class AbstractInt2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Int2ByteMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.size in interface Int2ByteMapsize in interface java.util.Map<java.lang.Integer,java.lang.Byte>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Integer,java.lang.Byte>isEmpty in class AbstractInt2ByteMappublic byte get(int k)
Int2ByteFunctionget in interface Int2ByteFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2ByteSortedMapfirstIntKey in interface Int2ByteSortedMapSortedMap.firstKey()public int lastIntKey()
Int2ByteSortedMaplastIntKey in interface Int2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2ByteMap.Entry> int2ByteEntrySet()
Int2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2ByteEntrySet in interface Int2ByteMapint2ByteEntrySet in interface Int2ByteSortedMapInt2ByteSortedMap.entrySet()public IntSortedSet 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 Int2ByteMapkeySet in interface Int2ByteSortedMapkeySet in interface java.util.Map<java.lang.Integer,java.lang.Byte>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>keySet in class AbstractInt2ByteSortedMapMap.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 Int2ByteMapvalues in interface Int2ByteSortedMapvalues in interface java.util.Map<java.lang.Integer,java.lang.Byte>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>values in class AbstractInt2ByteSortedMapMap.values()public IntComparator comparator()
Int2ByteSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Int2ByteSortedMapcomparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>SortedMap.comparator()public Int2ByteSortedMap headMap(int to)
Int2ByteSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Int2ByteSortedMapSortedMap.headMap(Object)public Int2ByteSortedMap tailMap(int from)
Int2ByteSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Int2ByteSortedMapSortedMap.tailMap(Object)public Int2ByteSortedMap subMap(int from, int to)
Int2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Int2ByteSortedMapSortedMap.subMap(Object,Object)public Int2ByteRBTreeMap 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.
clone in class java.lang.Object