public class Long2ObjectAVLTreeMap<V> extends AbstractLong2ObjectSortedMap<V> 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.
AbstractLong2ObjectSortedMap.KeySetIterator<V>, AbstractLong2ObjectSortedMap.ValuesCollection, AbstractLong2ObjectSortedMap.ValuesIterator<V>AbstractLong2ObjectMap.BasicEntry<V>, AbstractLong2ObjectMap.BasicEntrySet<V>Long2ObjectSortedMap.FastSortedEntrySet<V>Long2ObjectMap.FastEntrySet<V>| Modifier and Type | Field and Description |
|---|---|
protected LongComparator |
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 ObjectSortedSet<Long2ObjectMap.Entry<V>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.longs.Long2ObjectAVLTreeMap.Entry<V> |
firstEntry
The first key in this map.
|
protected LongSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.longs.Long2ObjectAVLTreeMap.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 Comparator<? super Long> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.longs.Long2ObjectAVLTreeMap.Entry<V> |
tree
A reference to the root entry.
|
protected ObjectCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Long2ObjectAVLTreeMap()
Creates a new empty tree map.
|
Long2ObjectAVLTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2ObjectAVLTreeMap(long[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2ObjectAVLTreeMap(long[] k,
V[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2ObjectAVLTreeMap(Long2ObjectMap<? extends V> m)
Creates a new tree map copying a given map.
|
Long2ObjectAVLTreeMap(Long2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2ObjectAVLTreeMap(Map<? extends Long,? extends V> m)
Creates a new tree map copying a given map.
|
Long2ObjectAVLTreeMap(SortedMap<Long,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Long2ObjectAVLTreeMap<V> |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(long k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(Object v) |
long |
firstLongKey()
Returns the first (lowest) key currently in this map.
|
V |
get(long k)
Returns the value to which the given key is mapped.
|
Long2ObjectSortedMap<V> |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
long |
lastLongKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Long2ObjectMap.Entry<V>> |
long2ObjectEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
V |
put(long k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Long2ObjectSortedMap<V> |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2ObjectSortedMap<V> |
tailMap(long 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.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyprotected transient it.unimi.dsi.fastutil.longs.Long2ObjectAVLTreeMap.Entry<V> tree
protected int count
protected transient it.unimi.dsi.fastutil.longs.Long2ObjectAVLTreeMap.Entry<V> firstEntry
protected transient it.unimi.dsi.fastutil.longs.Long2ObjectAVLTreeMap.Entry<V> lastEntry
protected transient ObjectSortedSet<Long2ObjectMap.Entry<V>> entries
protected transient LongSortedSet keys
protected transient ObjectCollection<V> values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Long> storedComparator
protected transient LongComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Long2ObjectAVLTreeMap()
public Long2ObjectAVLTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2ObjectAVLTreeMap(Map<? extends Long,? extends V> m)
m - a Map to be copied into the new tree map.public Long2ObjectAVLTreeMap(SortedMap<Long,V> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2ObjectAVLTreeMap(Long2ObjectMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Long2ObjectAVLTreeMap(Long2ObjectSortedMap<V> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2ObjectAVLTreeMap(long[] k,
V[] v,
Comparator<? super Long> 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 Long2ObjectAVLTreeMap(long[] k,
V[] 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 V put(long k, V v)
Long2ObjectFunctionput in interface Long2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(long k)
Long2ObjectFunctionremove in interface Long2ObjectFunction<V>k - the key.Function.remove(Object)public boolean containsValue(Object v)
containsValue in interface Map<Long,V>containsValue in class AbstractLong2ObjectMap<V>public void clear()
Long2ObjectMapclear in interface Long2ObjectMap<V>clear in interface Map<Long,V>Map.clear()public boolean containsKey(long k)
Long2ObjectMapcontainsKey in interface Long2ObjectFunction<V>containsKey in interface Long2ObjectMap<V>containsKey in class AbstractLong2ObjectMap<V>k - the key.key.Map.containsKey(Object)public int size()
Long2ObjectMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public V get(long k)
Long2ObjectFunctionget in interface Long2ObjectFunction<V>k - the key.Function.get(Object)public long firstLongKey()
Long2ObjectSortedMapfirstLongKey in interface Long2ObjectSortedMap<V>SortedMap.firstKey()public long lastLongKey()
Long2ObjectSortedMaplastLongKey in interface Long2ObjectSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Long2ObjectMap.Entry<V>> long2ObjectEntrySet()
Long2ObjectSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
long2ObjectEntrySet in interface Long2ObjectMap<V>long2ObjectEntrySet in interface Long2ObjectSortedMap<V>Long2ObjectSortedMap.entrySet()public LongSortedSet 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 Long2ObjectMap<V>keySet in interface Long2ObjectSortedMap<V>keySet in interface Map<Long,V>keySet in interface SortedMap<Long,V>keySet in class AbstractLong2ObjectSortedMap<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 Long2ObjectMap<V>values in interface Long2ObjectSortedMap<V>values in interface Map<Long,V>values in interface SortedMap<Long,V>values in class AbstractLong2ObjectSortedMap<V>Map.values()public LongComparator comparator()
Long2ObjectSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2ObjectSortedMap<V>comparator in interface SortedMap<Long,V>SortedMap.comparator()public Long2ObjectSortedMap<V> headMap(long to)
Long2ObjectSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Long2ObjectSortedMap<V>SortedMap.headMap(Object)public Long2ObjectSortedMap<V> tailMap(long from)
Long2ObjectSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Long2ObjectSortedMap<V>SortedMap.tailMap(Object)public Long2ObjectSortedMap<V> subMap(long from, long to)
Long2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Long2ObjectSortedMap<V>SortedMap.subMap(Object,Object)public Long2ObjectAVLTreeMap<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.
Copyright © 2020. All rights reserved.