public class Int2LongAVLTreeMap extends AbstractInt2LongSortedMap 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.
AbstractInt2LongMap.BasicEntryInt2LongSortedMap.FastSortedEntrySetInt2LongMap.FastEntrySet| Constructor and Description |
|---|
Int2LongAVLTreeMap()
Creates a new empty tree map.
|
Int2LongAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2LongAVLTreeMap(int[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2LongAVLTreeMap(int[] k,
long[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2LongAVLTreeMap(Int2LongMap m)
Creates a new tree map copying a given map.
|
Int2LongAVLTreeMap(Int2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2LongAVLTreeMap(Map<? extends Integer,? extends Long> m)
Creates a new tree map copying a given map.
|
Int2LongAVLTreeMap(SortedMap<Integer,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).
|
Int2LongAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractInt2LongMap.values(). |
int |
firstIntKey() |
long |
get(int k)
Returns the value to which the given key is mapped.
|
Int2LongSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
ObjectSortedSet<Int2LongMap.Entry> |
int2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey() |
Long |
put(Integer ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
put(int k,
long v)
Adds a pair to the map.
|
long |
remove(int k)
Removes the mapping with the given key.
|
Long |
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.
|
Int2LongSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2LongSortedMap |
tailMap(int 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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Int2LongAVLTreeMap()
public Int2LongAVLTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2LongAVLTreeMap(Map<? extends Integer,? extends Long> m)
m - a Map to be copied into the new tree map.public Int2LongAVLTreeMap(SortedMap<Integer,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2LongAVLTreeMap(Int2LongMap m)
m - a type-specific map to be copied into the new tree map.public Int2LongAVLTreeMap(Int2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2LongAVLTreeMap(int[] k,
long[] v,
Comparator<? super Integer> 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 Int2LongAVLTreeMap(int[] 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(int k,
long v)
Int2LongFunctionput in interface Int2LongFunctionput in class AbstractInt2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(int k)
Int2LongFunctionremove in interface Int2LongFunctionremove in class AbstractInt2LongFunctionk - the key.Function.remove(Object)public Long put(Integer ok, Long ov)
AbstractInt2LongFunctionnull 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.
put in interface Function<Integer,Long>put in interface Map<Integer,Long>put in class AbstractInt2LongFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Long remove(Object ok)
AbstractInt2LongFunctionnull 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)
AbstractInt2LongMapAbstractInt2LongMap.values().containsValue in interface Int2LongMapcontainsValue in class AbstractInt2LongMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(int k)
AbstractInt2LongMapAbstractInt2LongMap.keySet().containsKey in interface Int2LongFunctioncontainsKey in class AbstractInt2LongMapFunction.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 get(int k)
Int2LongFunctionget in interface Int2LongFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2LongSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2LongMap.Entry> int2LongEntrySet()
Int2LongSortedMapint2LongEntrySet in interface Int2LongMapint2LongEntrySet in interface Int2LongSortedMapInt2LongSortedMap.entrySet()public IntSortedSet 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 Int2LongMapkeySet in interface Int2LongSortedMapkeySet in interface Map<Integer,Long>keySet in interface SortedMap<Integer,Long>keySet in class AbstractInt2LongSortedMapMap.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 Int2LongMapvalues in interface Int2LongSortedMapvalues in interface Map<Integer,Long>values in interface SortedMap<Integer,Long>values in class AbstractInt2LongSortedMapMap.values()public IntComparator comparator()
Int2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Int2LongSortedMapcomparator in interface SortedMap<Integer,Long>SortedMap.comparator()public Int2LongSortedMap headMap(int to)
Int2LongSortedMaptoKey.headMap in interface Int2LongSortedMapSortedMap.headMap(Object)public Int2LongSortedMap tailMap(int from)
Int2LongSortedMapfromKey.tailMap in interface Int2LongSortedMapSortedMap.tailMap(Object)public Int2LongSortedMap subMap(int from, int to)
Int2LongSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2LongSortedMapSortedMap.subMap(Object,Object)public Int2LongAVLTreeMap 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.