Byte2ObjectFunction<V>
, Byte2ObjectMap<V>
, Byte2ObjectSortedMap<V>
, Function<java.lang.Byte,V>
, java.io.Serializable
, java.lang.Cloneable
, java.util.function.Function<java.lang.Byte,V>
, java.util.function.IntFunction<V>
, java.util.Map<java.lang.Byte,V>
, java.util.SortedMap<java.lang.Byte,V>
public class Byte2ObjectAVLTreeMap<V> extends AbstractByte2ObjectSortedMap<V> 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.
AbstractByte2ObjectMap.BasicEntry<V>, AbstractByte2ObjectMap.BasicEntrySet<V>
Byte2ObjectMap.FastEntrySet<V>
Byte2ObjectSortedMap.FastSortedEntrySet<V>
Constructor | Description |
---|---|
Byte2ObjectAVLTreeMap() |
Creates a new empty tree map.
|
Byte2ObjectAVLTreeMap(byte[] k,
V[] v) |
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ObjectAVLTreeMap(byte[] k,
V[] 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.
|
Byte2ObjectAVLTreeMap(Byte2ObjectMap<? extends V> m) |
Creates a new tree map copying a given map.
|
Byte2ObjectAVLTreeMap(Byte2ObjectSortedMap<V> m) |
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Byte2ObjectAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c) |
Creates a new empty tree map with the given comparator.
|
Byte2ObjectAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends V> m) |
Creates a new tree map copying a given map.
|
Byte2ObjectAVLTreeMap(java.util.SortedMap<java.lang.Byte,V> m) |
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method | Description |
---|---|---|
ObjectSortedSet<Byte2ObjectMap.Entry<V>> |
byte2ObjectEntrySet() |
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).
|
Byte2ObjectAVLTreeMap<V> |
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(java.lang.Object v) |
|
byte |
firstByteKey() |
Returns the first (lowest) key currently in this map.
|
V |
get(byte k) |
Returns the value to which the given key is mapped.
|
Byte2ObjectSortedMap<V> |
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.
|
V |
put(byte k,
V v) |
Adds a pair to the map (optional operation).
|
V |
remove(byte k) |
Removes the mapping with the given key (optional operation).
|
int |
size() |
Returns the number of key/value mappings in this map.
|
Byte2ObjectSortedMap<V> |
subMap(byte from,
byte to) |
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Byte2ObjectSortedMap<V> |
tailMap(byte from) |
Returns a view of the portion of this sorted map whose keys are greater than
or equal to
fromKey . |
ObjectCollection<V> |
values() |
Returns a type-specific collection view of the values contained in this map.
|
defaultReturnValue, defaultReturnValue
equals, hashCode, putAll, toString
apply
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
public Byte2ObjectAVLTreeMap()
public Byte2ObjectAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2ObjectAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends V> m)
m
- a Map
to be copied into the new tree map.public Byte2ObjectAVLTreeMap(java.util.SortedMap<java.lang.Byte,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Byte2ObjectAVLTreeMap(Byte2ObjectMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Byte2ObjectAVLTreeMap(Byte2ObjectSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Byte2ObjectAVLTreeMap(byte[] k, V[] 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 Byte2ObjectAVLTreeMap(byte[] k, V[] 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 V put(byte k, V v)
Byte2ObjectFunction
put
in interface Byte2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(byte k)
Byte2ObjectFunction
remove
in interface Byte2ObjectFunction<V>
k
- the key.Function.remove(Object)
public boolean containsValue(java.lang.Object v)
containsValue
in interface java.util.Map<java.lang.Byte,V>
containsValue
in class AbstractByte2ObjectMap<V>
public void clear()
Byte2ObjectMap
public boolean containsKey(byte k)
Byte2ObjectMap
containsKey
in interface Byte2ObjectFunction<V>
containsKey
in interface Byte2ObjectMap<V>
containsKey
in class AbstractByte2ObjectMap<V>
k
- the key.key
.Map.containsKey(Object)
public int size()
Byte2ObjectMap
Integer.MAX_VALUE
elements, returns
Integer.MAX_VALUE
.public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Byte,V>
isEmpty
in class AbstractByte2ObjectMap<V>
public V get(byte k)
Byte2ObjectFunction
get
in interface Byte2ObjectFunction<V>
k
- the key.Function.get(Object)
public byte firstByteKey()
Byte2ObjectSortedMap
firstByteKey
in interface Byte2ObjectSortedMap<V>
SortedMap.firstKey()
public byte lastByteKey()
Byte2ObjectSortedMap
lastByteKey
in interface Byte2ObjectSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Byte2ObjectMap.Entry<V>> byte2ObjectEntrySet()
Byte2ObjectSortedMap
Note that this specification strengthens the one given in the corresponding type-specific unsorted map.
byte2ObjectEntrySet
in interface Byte2ObjectMap<V>
byte2ObjectEntrySet
in interface Byte2ObjectSortedMap<V>
Byte2ObjectSortedMap.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 Byte2ObjectMap<V>
keySet
in interface Byte2ObjectSortedMap<V>
keySet
in interface java.util.Map<java.lang.Byte,V>
keySet
in interface java.util.SortedMap<java.lang.Byte,V>
keySet
in class AbstractByte2ObjectSortedMap<V>
Map.keySet()
public ObjectCollection<V> 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 Byte2ObjectMap<V>
values
in interface Byte2ObjectSortedMap<V>
values
in interface java.util.Map<java.lang.Byte,V>
values
in interface java.util.SortedMap<java.lang.Byte,V>
values
in class AbstractByte2ObjectSortedMap<V>
Map.values()
public ByteComparator comparator()
Byte2ObjectSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator()
.
comparator
in interface Byte2ObjectSortedMap<V>
comparator
in interface java.util.SortedMap<java.lang.Byte,V>
SortedMap.comparator()
public Byte2ObjectSortedMap<V> headMap(byte to)
Byte2ObjectSortedMap
toKey
.
Note that this specification strengthens the one given in
SortedMap.headMap(Object)
.
headMap
in interface Byte2ObjectSortedMap<V>
SortedMap.headMap(Object)
public Byte2ObjectSortedMap<V> tailMap(byte from)
Byte2ObjectSortedMap
fromKey
.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object)
.
tailMap
in interface Byte2ObjectSortedMap<V>
SortedMap.tailMap(Object)
public Byte2ObjectSortedMap<V> subMap(byte from, byte to)
Byte2ObjectSortedMap
fromKey
, inclusive, to toKey
, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object)
.
subMap
in interface Byte2ObjectSortedMap<V>
SortedMap.subMap(Object,Object)
public Byte2ObjectAVLTreeMap<V> 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.