public class Object2LongAVLTreeMap<K> extends AbstractObject2LongSortedMap<K> 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.
AbstractObject2LongMap.BasicEntry<K>Object2LongSortedMap.FastSortedEntrySet<K>Object2LongMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2LongAVLTreeMap()
Creates a new empty tree map.
|
Object2LongAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2LongAVLTreeMap(K[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2LongAVLTreeMap(K[] k,
long[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2LongAVLTreeMap(Map<? extends K,? extends Long> m)
Creates a new tree map copying a given map.
|
Object2LongAVLTreeMap(Object2LongMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2LongAVLTreeMap(Object2LongSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2LongAVLTreeMap(SortedMap<K,Long> 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).
|
Object2LongAVLTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractObject2LongMap.values(). |
K |
firstKey() |
Long |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
getLong(Object k)
Returns the value to which the given key is mapped.
|
Object2LongSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
ObjectSortedSet<Object2LongMap.Entry<K>> |
object2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
long |
put(K k,
long v)
Adds a pair to the map.
|
Long |
put(K ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Long |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
removeLong(Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Object2LongSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2LongSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
LongCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySetcontainsValue, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Object2LongAVLTreeMap()
public Object2LongAVLTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2LongAVLTreeMap(Map<? extends K,? extends Long> m)
m - a Map to be copied into the new tree map.public Object2LongAVLTreeMap(SortedMap<K,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2LongAVLTreeMap(Object2LongMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2LongAVLTreeMap(Object2LongSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2LongAVLTreeMap(K[] k, long[] v, Comparator<? super K> 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 Object2LongAVLTreeMap(K[] k, long[] 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 long put(K k, long v)
Object2LongFunctionput in interface Object2LongFunction<K>put in class AbstractObject2LongFunction<K>k - the key.v - the value.Function.put(Object,Object)public long removeLong(Object k)
Object2LongFunctionremoveLong in interface Object2LongFunction<K>removeLong in class AbstractObject2LongFunction<K>k - the key.Function.remove(Object)public Long put(K ok, Long ov)
AbstractObject2LongFunctionnull 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 Long remove(Object ok)
AbstractObject2LongFunctionnull 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(long v)
AbstractObject2LongMapAbstractObject2LongMap.values().containsValue in interface Object2LongMap<K>containsValue in class AbstractObject2LongMap<K>Map.containsValue(Object)public void clear()
Functionpublic boolean containsKey(Object k)
AbstractObject2LongMapAbstractObject2LongMap.keySet().containsKey in interface Function<K,Long>containsKey in interface Map<K,Long>containsKey in class AbstractObject2LongMap<K>k - the key.key.Map.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 long getLong(Object k)
Object2LongFunctiongetLong in interface Object2LongFunction<K>k - the key.Function.get(Object)public Long get(Object ok)
AbstractObject2LongFunctionnull 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 ObjectSortedSet<Object2LongMap.Entry<K>> object2LongEntrySet()
Object2LongSortedMapobject2LongEntrySet in interface Object2LongMap<K>object2LongEntrySet in interface Object2LongSortedMap<K>Object2LongSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2LongMap<K>keySet in interface Object2LongSortedMap<K>keySet in interface Map<K,Long>keySet in interface SortedMap<K,Long>keySet in class AbstractObject2LongSortedMap<K>Map.keySet()public LongCollection 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 Object2LongMap<K>values in interface Object2LongSortedMap<K>values in interface Map<K,Long>values in interface SortedMap<K,Long>values in class AbstractObject2LongSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2LongSortedMap<K>comparator in interface SortedMap<K,Long>SortedMap.comparator()public Object2LongSortedMap<K> headMap(K to)
Object2LongSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2LongSortedMap<K>headMap in interface SortedMap<K,Long>SortedMap.headMap(Object)public Object2LongSortedMap<K> tailMap(K from)
Object2LongSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2LongSortedMap<K>tailMap in interface SortedMap<K,Long>SortedMap.tailMap(Object)public Object2LongSortedMap<K> subMap(K from, K to)
Object2LongSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2LongSortedMap<K>subMap in interface SortedMap<K,Long>SortedMap.subMap(Object,Object)public Object2LongAVLTreeMap<K> 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.