public class Byte2ReferenceAVLTreeMap<V> extends AbstractByte2ReferenceSortedMap<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.
AbstractByte2ReferenceMap.BasicEntry<V>, AbstractByte2ReferenceMap.BasicEntrySet<V>
Byte2ReferenceSortedMap.FastSortedEntrySet<V>
Byte2ReferenceMap.FastEntrySet<V>
Constructor and Description |
---|
Byte2ReferenceAVLTreeMap()
Creates a new empty tree map.
|
Byte2ReferenceAVLTreeMap(byte[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ReferenceAVLTreeMap(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.
|
Byte2ReferenceAVLTreeMap(Byte2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.
|
Byte2ReferenceAVLTreeMap(Byte2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Byte2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends V> m)
Creates a new tree map copying a given map.
|
Byte2ReferenceAVLTreeMap(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 and Description |
---|---|
ObjectSortedSet<Byte2ReferenceMap.Entry<V>> |
byte2ReferenceEntrySet()
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).
|
Byte2ReferenceAVLTreeMap<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.
|
Byte2ReferenceSortedMap<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.
|
Byte2ReferenceSortedMap<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. |
Byte2ReferenceSortedMap<V> |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ReferenceCollection<V> |
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, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Byte2ReferenceAVLTreeMap()
public Byte2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Byte,? extends V> m)
m
- a Map
to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Byte,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(Byte2ReferenceMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(Byte2ReferenceSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(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 Byte2ReferenceAVLTreeMap(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)
Byte2ReferenceFunction
put
in interface Byte2ReferenceFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(byte k)
Byte2ReferenceFunction
remove
in interface Byte2ReferenceFunction<V>
k
- the key.Function.remove(Object)
public boolean containsValue(java.lang.Object v)
AbstractByte2ReferenceMap
containsValue
in interface java.util.Map<java.lang.Byte,V>
containsValue
in class AbstractByte2ReferenceMap<V>
public void clear()
Byte2ReferenceMap
clear
in interface Byte2ReferenceMap<V>
clear
in interface java.util.Map<java.lang.Byte,V>
Map.clear()
public boolean containsKey(byte k)
AbstractByte2ReferenceMap
containsKey
in interface Byte2ReferenceFunction<V>
containsKey
in interface Byte2ReferenceMap<V>
containsKey
in class AbstractByte2ReferenceMap<V>
k
- the key.key
.Map.containsKey(Object)
public int size()
Byte2ReferenceMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Byte2ReferenceMap<V>
size
in interface java.util.Map<java.lang.Byte,V>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Byte,V>
isEmpty
in class AbstractByte2ReferenceMap<V>
public V get(byte k)
Byte2ReferenceFunction
get
in interface Byte2ReferenceFunction<V>
k
- the key.Function.get(Object)
public byte firstByteKey()
Byte2ReferenceSortedMap
firstByteKey
in interface Byte2ReferenceSortedMap<V>
SortedMap.firstKey()
public byte lastByteKey()
Byte2ReferenceSortedMap
lastByteKey
in interface Byte2ReferenceSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Byte2ReferenceMap.Entry<V>> byte2ReferenceEntrySet()
Byte2ReferenceSortedMap
byte2ReferenceEntrySet
in interface Byte2ReferenceMap<V>
byte2ReferenceEntrySet
in interface Byte2ReferenceSortedMap<V>
Byte2ReferenceSortedMap.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 Byte2ReferenceMap<V>
keySet
in interface Byte2ReferenceSortedMap<V>
keySet
in interface java.util.Map<java.lang.Byte,V>
keySet
in interface java.util.SortedMap<java.lang.Byte,V>
keySet
in class AbstractByte2ReferenceSortedMap<V>
Map.keySet()
public ReferenceCollection<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 Byte2ReferenceMap<V>
values
in interface Byte2ReferenceSortedMap<V>
values
in interface java.util.Map<java.lang.Byte,V>
values
in interface java.util.SortedMap<java.lang.Byte,V>
values
in class AbstractByte2ReferenceSortedMap<V>
Map.values()
public ByteComparator comparator()
Byte2ReferenceSortedMap
comparator
in interface Byte2ReferenceSortedMap<V>
comparator
in interface java.util.SortedMap<java.lang.Byte,V>
SortedMap.comparator()
public Byte2ReferenceSortedMap<V> headMap(byte to)
Byte2ReferenceSortedMap
toKey
.headMap
in interface Byte2ReferenceSortedMap<V>
SortedMap.headMap(Object)
public Byte2ReferenceSortedMap<V> tailMap(byte from)
Byte2ReferenceSortedMap
fromKey
.tailMap
in interface Byte2ReferenceSortedMap<V>
SortedMap.tailMap(Object)
public Byte2ReferenceSortedMap<V> subMap(byte from, byte to)
Byte2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Byte2ReferenceSortedMap<V>
SortedMap.subMap(Object,Object)
public Byte2ReferenceAVLTreeMap<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.
clone
in class java.lang.Object