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.
AbstractLong2ObjectMap.BasicEntry<V>Long2ObjectSortedMap.FastSortedEntrySet<V>Long2ObjectMap.FastEntrySet<V>| 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 associations from this function (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)
Checks whether the given value is contained in
AbstractLong2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractLong2ObjectMap.values(). |
long |
firstLongKey() |
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() |
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.
|
V |
put(Long ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
remove(long k)
Removes the mapping with the given key.
|
V |
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapequals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic 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>put in class AbstractLong2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(long k)
Long2ObjectFunctionremove in interface Long2ObjectFunction<V>remove in class AbstractLong2ObjectFunction<V>k - the key.Function.remove(Object)public V put(Long ok, V ov)
AbstractLong2ObjectFunctionnull 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 V remove(Object ok)
AbstractLong2ObjectFunctionnull 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(Object v)
AbstractLong2ObjectMapAbstractLong2ObjectMap.values().containsValue in interface Map<Long,V>containsValue in class AbstractLong2ObjectMap<V>public void clear()
Functionpublic boolean containsKey(long k)
AbstractLong2ObjectMapAbstractLong2ObjectMap.keySet().containsKey in interface Long2ObjectFunction<V>containsKey in class AbstractLong2ObjectMap<V>Function.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 V get(long k)
Long2ObjectFunctionget in interface Long2ObjectFunction<V>k - the key.Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2ObjectSortedMap<V>SortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2ObjectSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Long2ObjectMap.Entry<V>> long2ObjectEntrySet()
Long2ObjectSortedMaplong2ObjectEntrySet 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.headMap in interface Long2ObjectSortedMap<V>SortedMap.headMap(Object)public Long2ObjectSortedMap<V> tailMap(long from)
Long2ObjectSortedMapfromKey.tailMap in interface Long2ObjectSortedMap<V>SortedMap.tailMap(Object)public Long2ObjectSortedMap<V> subMap(long from, long to)
Long2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.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.