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.
AbstractByte2ObjectSortedMap.KeySetIterator<V>, AbstractByte2ObjectSortedMap.ValuesCollection, AbstractByte2ObjectSortedMap.ValuesIterator<V>AbstractByte2ObjectMap.BasicEntry<V>, AbstractByte2ObjectMap.BasicEntrySet<V>Byte2ObjectSortedMap.FastSortedEntrySet<V>Byte2ObjectMap.FastEntrySet<V>| Modifier and Type | Field and Description |
|---|---|
protected it.unimi.dsi.fastutil.bytes.ByteComparator |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected it.unimi.dsi.fastutil.objects.ObjectSortedSet<Byte2ObjectMap.Entry<V>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.bytes.Byte2ObjectAVLTreeMap.Entry<V> |
firstEntry
The first key in this map.
|
protected it.unimi.dsi.fastutil.bytes.ByteSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.bytes.Byte2ObjectAVLTreeMap.Entry<V> |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected java.util.Comparator<? super java.lang.Byte> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.bytes.Byte2ObjectAVLTreeMap.Entry<V> |
tree
A reference to the root entry.
|
protected it.unimi.dsi.fastutil.objects.ObjectCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and 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 and Description |
|---|---|
it.unimi.dsi.fastutil.objects.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.
|
it.unimi.dsi.fastutil.bytes.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) |
Byte2ObjectSortedMap<V> |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
it.unimi.dsi.fastutil.bytes.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) |
V |
remove(byte k) |
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. |
it.unimi.dsi.fastutil.objects.ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replaceandThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortprotected transient it.unimi.dsi.fastutil.bytes.Byte2ObjectAVLTreeMap.Entry<V> tree
protected int count
protected transient it.unimi.dsi.fastutil.bytes.Byte2ObjectAVLTreeMap.Entry<V> firstEntry
protected transient it.unimi.dsi.fastutil.bytes.Byte2ObjectAVLTreeMap.Entry<V> lastEntry
protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<Byte2ObjectMap.Entry<V>> entries
protected transient it.unimi.dsi.fastutil.bytes.ByteSortedSet keys
protected transient it.unimi.dsi.fastutil.objects.ObjectCollection<V> values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected java.util.Comparator<? super java.lang.Byte> storedComparator
protected transient it.unimi.dsi.fastutil.bytes.ByteComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.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)
put in interface it.unimi.dsi.fastutil.bytes.Byte2ObjectFunction<V>public V remove(byte k)
remove in interface it.unimi.dsi.fastutil.bytes.Byte2ObjectFunction<V>public boolean containsValue(java.lang.Object v)
AbstractByte2ObjectMapcontainsValue in interface java.util.Map<java.lang.Byte,V>containsValue in class AbstractByte2ObjectMap<V>public void clear()
Byte2ObjectMapclear in interface Byte2ObjectMap<V>clear in interface java.util.Map<java.lang.Byte,V>public boolean containsKey(byte k)
AbstractByte2ObjectMapcontainsKey in interface it.unimi.dsi.fastutil.bytes.Byte2ObjectFunction<V>containsKey in interface Byte2ObjectMap<V>containsKey in class AbstractByte2ObjectMap<V>k - the key.key.Map.containsKey(Object)public int size()
Byte2ObjectMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.size in interface Byte2ObjectMap<V>size in interface java.util.Map<java.lang.Byte,V>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Byte,V>isEmpty in class AbstractByte2ObjectMap<V>public V get(byte k)
get in interface it.unimi.dsi.fastutil.bytes.Byte2ObjectFunction<V>public byte firstByteKey()
Byte2ObjectSortedMapfirstByteKey in interface Byte2ObjectSortedMap<V>SortedMap.firstKey()public byte lastByteKey()
Byte2ObjectSortedMaplastByteKey in interface Byte2ObjectSortedMap<V>SortedMap.lastKey()public it.unimi.dsi.fastutil.objects.ObjectSortedSet<Byte2ObjectMap.Entry<V>> byte2ObjectEntrySet()
Byte2ObjectSortedMapbyte2ObjectEntrySet in interface Byte2ObjectMap<V>byte2ObjectEntrySet in interface Byte2ObjectSortedMap<V>Byte2ObjectSortedMap.entrySet()public it.unimi.dsi.fastutil.bytes.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 it.unimi.dsi.fastutil.objects.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 it.unimi.dsi.fastutil.bytes.ByteComparator comparator()
Byte2ObjectSortedMapcomparator in interface Byte2ObjectSortedMap<V>comparator in interface java.util.SortedMap<java.lang.Byte,V>SortedMap.comparator()public Byte2ObjectSortedMap<V> headMap(byte to)
Byte2ObjectSortedMaptoKey.headMap in interface Byte2ObjectSortedMap<V>SortedMap.headMap(Object)public Byte2ObjectSortedMap<V> tailMap(byte from)
Byte2ObjectSortedMapfromKey.tailMap in interface Byte2ObjectSortedMap<V>SortedMap.tailMap(Object)public Byte2ObjectSortedMap<V> subMap(byte from, byte to)
Byte2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.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.
clone in class java.lang.Object