public class Byte2ByteRBTreeMap extends AbstractByte2ByteSortedMap 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.
AbstractByte2ByteMap.BasicEntry, AbstractByte2ByteMap.BasicEntrySet
Byte2ByteSortedMap.FastSortedEntrySet
Byte2ByteMap.FastEntrySet
Constructor and Description |
---|
Byte2ByteRBTreeMap()
Creates a new empty tree map.
|
Byte2ByteRBTreeMap(byte[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ByteRBTreeMap(byte[] k,
byte[] v,
java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2ByteRBTreeMap(Byte2ByteMap m)
Creates a new tree map copying a given map.
|
Byte2ByteRBTreeMap(Byte2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Byte2ByteRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ByteRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Byte> m)
Creates a new tree map copying a given map.
|
Byte2ByteRBTreeMap(java.util.SortedMap<java.lang.Byte,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(byte k,
byte incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Byte2ByteMap.Entry> |
byte2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Byte2ByteRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(byte 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. |
byte |
firstByteKey()
Returns the first (lowest) key currently in this map.
|
byte |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2ByteSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
byte |
lastByteKey()
Returns the last (highest) key currently in this map.
|
byte |
put(byte k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(byte k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Byte2ByteSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Byte2ByteSortedMap |
tailMap(byte 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, identity
public Byte2ByteRBTreeMap()
public Byte2ByteRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2ByteRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Byte> m)
m
- a Map
to be copied into the new tree map.public Byte2ByteRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Byte> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Byte2ByteRBTreeMap(Byte2ByteMap m)
m
- a type-specific map to be copied into the new tree map.public Byte2ByteRBTreeMap(Byte2ByteSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Byte2ByteRBTreeMap(byte[] k, byte[] v, java.util.Comparator<? super java.lang.Byte> 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 Byte2ByteRBTreeMap(byte[] 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(byte 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(byte k, byte v)
Byte2ByteFunction
put
in interface Byte2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(byte k)
Byte2ByteFunction
remove
in interface Byte2ByteFunction
k
- the key.Function.remove(Object)
public boolean containsValue(byte v)
AbstractByte2ByteMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Byte2ByteMap
containsValue
in class AbstractByte2ByteMap
Map.containsValue(Object)
public void clear()
Byte2ByteMap
clear
in interface Byte2ByteMap
clear
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
Map.clear()
public boolean containsKey(byte k)
AbstractByte2ByteMap
containsKey
in interface Byte2ByteFunction
containsKey
in interface Byte2ByteMap
containsKey
in class AbstractByte2ByteMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Byte2ByteMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Byte2ByteMap
size
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
isEmpty
in class AbstractByte2ByteMap
public byte get(byte k)
Byte2ByteFunction
get
in interface Byte2ByteFunction
k
- the key.Function.get(Object)
public byte firstByteKey()
Byte2ByteSortedMap
firstByteKey
in interface Byte2ByteSortedMap
SortedMap.firstKey()
public byte lastByteKey()
Byte2ByteSortedMap
lastByteKey
in interface Byte2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Byte2ByteMap.Entry> byte2ByteEntrySet()
Byte2ByteSortedMap
byte2ByteEntrySet
in interface Byte2ByteMap
byte2ByteEntrySet
in interface Byte2ByteSortedMap
Byte2ByteSortedMap.entrySet()
public ByteSortedSet 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 Byte2ByteMap
keySet
in interface Byte2ByteSortedMap
keySet
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
keySet
in interface java.util.SortedMap<java.lang.Byte,java.lang.Byte>
keySet
in class AbstractByte2ByteSortedMap
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 Byte2ByteMap
values
in interface Byte2ByteSortedMap
values
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
values
in interface java.util.SortedMap<java.lang.Byte,java.lang.Byte>
values
in class AbstractByte2ByteSortedMap
Map.values()
public ByteComparator comparator()
Byte2ByteSortedMap
comparator
in interface Byte2ByteSortedMap
comparator
in interface java.util.SortedMap<java.lang.Byte,java.lang.Byte>
SortedMap.comparator()
public Byte2ByteSortedMap headMap(byte to)
Byte2ByteSortedMap
toKey
.headMap
in interface Byte2ByteSortedMap
SortedMap.headMap(Object)
public Byte2ByteSortedMap tailMap(byte from)
Byte2ByteSortedMap
fromKey
.tailMap
in interface Byte2ByteSortedMap
SortedMap.tailMap(Object)
public Byte2ByteSortedMap subMap(byte from, byte to)
Byte2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Byte2ByteSortedMap
SortedMap.subMap(Object,Object)
public Byte2ByteRBTreeMap 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