public class Byte2ByteAVLTreeMap extends AbstractByte2ByteSortedMap 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.
AbstractByte2ByteMap.BasicEntryByte2ByteSortedMap.FastSortedEntrySetByte2ByteMap.FastEntrySet| Constructor and Description |
|---|
Byte2ByteAVLTreeMap()
Creates a new empty tree map.
|
Byte2ByteAVLTreeMap(byte[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ByteAVLTreeMap(byte[] k,
byte[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2ByteAVLTreeMap(Byte2ByteMap m)
Creates a new tree map copying a given map.
|
Byte2ByteAVLTreeMap(Byte2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2ByteAVLTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ByteAVLTreeMap(Map<? extends Byte,? extends Byte> m)
Creates a new tree map copying a given map.
|
Byte2ByteAVLTreeMap(SortedMap<Byte,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Byte2ByteMap.Entry> |
byte2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ByteAVLTreeMap |
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
AbstractByte2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractByte2ByteMap.values(). |
byte |
firstByteKey() |
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() |
byte |
put(byte k,
byte v)
Adds a pair to the map.
|
Byte |
put(Byte ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(byte k)
Removes the mapping with the given key.
|
Byte |
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.
|
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.
|
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 Byte2ByteAVLTreeMap()
public Byte2ByteAVLTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2ByteAVLTreeMap(Map<? extends Byte,? extends Byte> m)
m - a Map to be copied into the new tree map.public Byte2ByteAVLTreeMap(SortedMap<Byte,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2ByteAVLTreeMap(Byte2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Byte2ByteAVLTreeMap(Byte2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2ByteAVLTreeMap(byte[] k,
byte[] 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 Byte2ByteAVLTreeMap(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.IllegalArgumentException - if k and v have different lengths.public byte put(byte k,
byte v)
Byte2ByteFunctionput in interface Byte2ByteFunctionput in class AbstractByte2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(byte k)
Byte2ByteFunctionremove in interface Byte2ByteFunctionremove in class AbstractByte2ByteFunctionk - the key.Function.remove(Object)public Byte put(Byte ok, Byte ov)
AbstractByte2ByteFunctionnull 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 Byte remove(Object ok)
AbstractByte2ByteFunctionnull 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(byte v)
AbstractByte2ByteMapAbstractByte2ByteMap.values().containsValue in interface Byte2ByteMapcontainsValue in class AbstractByte2ByteMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(byte k)
AbstractByte2ByteMapAbstractByte2ByteMap.keySet().containsKey in interface Byte2ByteFunctioncontainsKey in class AbstractByte2ByteMapFunction.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 byte get(byte k)
Byte2ByteFunctionget in interface Byte2ByteFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2ByteSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2ByteMap.Entry> byte2ByteEntrySet()
Byte2ByteSortedMapbyte2ByteEntrySet in interface Byte2ByteMapbyte2ByteEntrySet in interface Byte2ByteSortedMapByte2ByteSortedMap.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 Byte2ByteMapkeySet in interface Byte2ByteSortedMapkeySet in interface Map<Byte,Byte>keySet in interface SortedMap<Byte,Byte>keySet in class AbstractByte2ByteSortedMapMap.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 Byte2ByteMapvalues in interface Byte2ByteSortedMapvalues in interface Map<Byte,Byte>values in interface SortedMap<Byte,Byte>values in class AbstractByte2ByteSortedMapMap.values()public ByteComparator comparator()
Byte2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2ByteSortedMapcomparator in interface SortedMap<Byte,Byte>SortedMap.comparator()public Byte2ByteSortedMap headMap(byte to)
Byte2ByteSortedMaptoKey.headMap in interface Byte2ByteSortedMapSortedMap.headMap(Object)public Byte2ByteSortedMap tailMap(byte from)
Byte2ByteSortedMapfromKey.tailMap in interface Byte2ByteSortedMapSortedMap.tailMap(Object)public Byte2ByteSortedMap subMap(byte from, byte to)
Byte2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Byte2ByteSortedMapSortedMap.subMap(Object,Object)public Byte2ByteAVLTreeMap 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.