public class Byte2IntRBTreeMap extends AbstractByte2IntSortedMap 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.
AbstractByte2IntMap.BasicEntryByte2IntSortedMap.FastSortedEntrySetByte2IntMap.FastEntrySet| Constructor and Description |
|---|
Byte2IntRBTreeMap()
Creates a new empty tree map.
|
Byte2IntRBTreeMap(byte[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2IntRBTreeMap(byte[] k,
int[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2IntRBTreeMap(Byte2IntMap m)
Creates a new tree map copying a given map.
|
Byte2IntRBTreeMap(Byte2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2IntRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2IntRBTreeMap(Map<? extends Byte,? extends Integer> m)
Creates a new tree map copying a given map.
|
Byte2IntRBTreeMap(SortedMap<Byte,Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Byte2IntMap.Entry> |
byte2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2IntRBTreeMap |
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)
Checks whether the given value is contained in
AbstractByte2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractByte2IntMap.values(). |
byte |
firstByteKey() |
int |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2IntSortedMap |
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() |
int |
put(byte k,
int v)
Adds a pair to the map.
|
Integer |
put(Byte ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
remove(byte k)
Removes the mapping with the given key.
|
Integer |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Byte2IntSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2IntSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
IntCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Byte2IntRBTreeMap()
public Byte2IntRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2IntRBTreeMap(Map<? extends Byte,? extends Integer> m)
m - a Map to be copied into the new tree map.public Byte2IntRBTreeMap(SortedMap<Byte,Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2IntRBTreeMap(Byte2IntMap m)
m - a type-specific map to be copied into the new tree map.public Byte2IntRBTreeMap(Byte2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2IntRBTreeMap(byte[] k,
int[] v,
Comparator<? super 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.IllegalArgumentException - if k and v have different lengths.public Byte2IntRBTreeMap(byte[] k,
int[] 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 int put(byte k,
int v)
Byte2IntFunctionput in interface Byte2IntFunctionput in class AbstractByte2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(byte k)
Byte2IntFunctionremove in interface Byte2IntFunctionremove in class AbstractByte2IntFunctionk - the key.Function.remove(Object)public Integer put(Byte ok, Integer ov)
AbstractByte2IntFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a
more efficient method.
put in interface Function<Byte,Integer>put in interface Map<Byte,Integer>put in class AbstractByte2IntFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Integer remove(Object ok)
AbstractByte2IntFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a
more efficient method.
public boolean containsValue(int v)
AbstractByte2IntMapAbstractByte2IntMap.values().containsValue in interface Byte2IntMapcontainsValue in class AbstractByte2IntMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(byte k)
AbstractByte2IntMapAbstractByte2IntMap.keySet().containsKey in interface Byte2IntFunctioncontainsKey in class AbstractByte2IntMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public int get(byte k)
Byte2IntFunctionget in interface Byte2IntFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2IntSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2IntMap.Entry> byte2IntEntrySet()
Byte2IntSortedMapbyte2IntEntrySet in interface Byte2IntMapbyte2IntEntrySet in interface Byte2IntSortedMapByte2IntSortedMap.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 Byte2IntMapkeySet in interface Byte2IntSortedMapkeySet in interface Map<Byte,Integer>keySet in interface SortedMap<Byte,Integer>keySet in class AbstractByte2IntSortedMapMap.keySet()public IntCollection 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 Byte2IntMapvalues in interface Byte2IntSortedMapvalues in interface Map<Byte,Integer>values in interface SortedMap<Byte,Integer>values in class AbstractByte2IntSortedMapMap.values()public ByteComparator comparator()
Byte2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2IntSortedMapcomparator in interface SortedMap<Byte,Integer>SortedMap.comparator()public Byte2IntSortedMap headMap(byte to)
Byte2IntSortedMaptoKey.headMap in interface Byte2IntSortedMapSortedMap.headMap(Object)public Byte2IntSortedMap tailMap(byte from)
Byte2IntSortedMapfromKey.tailMap in interface Byte2IntSortedMapSortedMap.tailMap(Object)public Byte2IntSortedMap subMap(byte from, byte to)
Byte2IntSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Byte2IntSortedMapSortedMap.subMap(Object,Object)public Byte2IntRBTreeMap 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.