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.BasicEntrySet
Int2ByteSortedMap.FastSortedEntrySet
Int2ByteMap.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, toString
defaultReturnValue, defaultReturnValue
entrySet, firstKey, headMap, lastKey, subMap, tailMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeByte, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public 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)
Int2ByteFunction
put
in interface Int2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(int k)
Int2ByteFunction
remove
in interface Int2ByteFunction
k
- the key.Function.remove(Object)
public boolean containsValue(byte v)
AbstractInt2ByteMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Int2ByteMap
containsValue
in class AbstractInt2ByteMap
Map.containsValue(Object)
public void clear()
Int2ByteMap
clear
in interface Int2ByteMap
clear
in interface java.util.Map<java.lang.Integer,java.lang.Byte>
Map.clear()
public boolean containsKey(int k)
AbstractInt2ByteMap
containsKey
in interface Int2ByteFunction
containsKey
in interface Int2ByteMap
containsKey
in class AbstractInt2ByteMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Int2ByteMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Int2ByteMap
size
in interface java.util.Map<java.lang.Integer,java.lang.Byte>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Integer,java.lang.Byte>
isEmpty
in class AbstractInt2ByteMap
public byte get(int k)
Int2ByteFunction
get
in interface Int2ByteFunction
k
- the key.Function.get(Object)
public int firstIntKey()
Int2ByteSortedMap
firstIntKey
in interface Int2ByteSortedMap
SortedMap.firstKey()
public int lastIntKey()
Int2ByteSortedMap
lastIntKey
in interface Int2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Int2ByteMap.Entry> int2ByteEntrySet()
Int2ByteSortedMap
int2ByteEntrySet
in interface Int2ByteMap
int2ByteEntrySet
in interface Int2ByteSortedMap
Int2ByteSortedMap.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 Int2ByteMap
keySet
in interface Int2ByteSortedMap
keySet
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 AbstractInt2ByteSortedMap
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 Int2ByteMap
values
in interface Int2ByteSortedMap
values
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 AbstractInt2ByteSortedMap
Map.values()
public IntComparator comparator()
Int2ByteSortedMap
comparator
in interface Int2ByteSortedMap
comparator
in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>
SortedMap.comparator()
public Int2ByteSortedMap headMap(int to)
Int2ByteSortedMap
toKey
.headMap
in interface Int2ByteSortedMap
SortedMap.headMap(Object)
public Int2ByteSortedMap tailMap(int from)
Int2ByteSortedMap
fromKey
.tailMap
in interface Int2ByteSortedMap
SortedMap.tailMap(Object)
public Int2ByteSortedMap subMap(int from, int to)
Int2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2ByteSortedMap
SortedMap.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