public class Int2DoubleAVLTreeMap extends AbstractInt2DoubleSortedMap 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.
AbstractInt2DoubleMap.BasicEntry, AbstractInt2DoubleMap.BasicEntrySetInt2DoubleSortedMap.FastSortedEntrySetInt2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Int2DoubleAVLTreeMap()
Creates a new empty tree map.
|
Int2DoubleAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2DoubleAVLTreeMap(int[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2DoubleAVLTreeMap(int[] k,
double[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2DoubleAVLTreeMap(Int2DoubleMap m)
Creates a new tree map copying a given map.
|
Int2DoubleAVLTreeMap(Int2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2DoubleAVLTreeMap(Map<? extends Integer,? extends Double> m)
Creates a new tree map copying a given map.
|
Int2DoubleAVLTreeMap(SortedMap<Integer,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(int k,
double incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2DoubleAVLTreeMap |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(double v)
Returns
true if this map maps one or more keys to the specified value. |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
double |
get(int k)
Returns the value to which the given key is mapped.
|
Int2DoubleSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
ObjectSortedSet<Int2DoubleMap.Entry> |
int2DoubleEntrySet()
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()
Returns the last (highest) key currently in this map.
|
double |
put(int k,
double v)
Adds a pair to the map (optional operation).
|
double |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Int2DoubleSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2DoubleSortedMap |
tailMap(int from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsDoublepublic Int2DoubleAVLTreeMap()
public Int2DoubleAVLTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2DoubleAVLTreeMap(Map<? extends Integer,? extends Double> m)
m - a Map to be copied into the new tree map.public Int2DoubleAVLTreeMap(SortedMap<Integer,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2DoubleAVLTreeMap(Int2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Int2DoubleAVLTreeMap(Int2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2DoubleAVLTreeMap(int[] k,
double[] 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 Int2DoubleAVLTreeMap(int[] k,
double[] 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 double addTo(int k,
double incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public double put(int k,
double v)
Int2DoubleFunctionput in interface Int2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(int k)
Int2DoubleFunctionremove in interface Int2DoubleFunctionk - the key.Function.remove(Object)public boolean containsValue(double v)
Int2DoubleMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2DoubleMapcontainsValue in class AbstractInt2DoubleMapMap.containsValue(Object)public void clear()
Int2DoubleMapclear in interface Int2DoubleMapclear in interface Map<Integer,Double>Map.clear()public boolean containsKey(int k)
Int2DoubleMapcontainsKey in interface Int2DoubleFunctioncontainsKey in interface Int2DoubleMapcontainsKey in class AbstractInt2DoubleMapk - the key.key.Map.containsKey(Object)public int size()
Int2DoubleMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public double get(int k)
Int2DoubleFunctionget in interface Int2DoubleFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2DoubleSortedMapfirstIntKey in interface Int2DoubleSortedMapSortedMap.firstKey()public int lastIntKey()
Int2DoubleSortedMaplastIntKey in interface Int2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Int2DoubleSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2DoubleEntrySet in interface Int2DoubleMapint2DoubleEntrySet in interface Int2DoubleSortedMapInt2DoubleSortedMap.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 Int2DoubleMapkeySet in interface Int2DoubleSortedMapkeySet in interface Map<Integer,Double>keySet in interface SortedMap<Integer,Double>keySet in class AbstractInt2DoubleSortedMapMap.keySet()public DoubleCollection 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 Int2DoubleMapvalues in interface Int2DoubleSortedMapvalues in interface Map<Integer,Double>values in interface SortedMap<Integer,Double>values in class AbstractInt2DoubleSortedMapMap.values()public IntComparator comparator()
Int2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Int2DoubleSortedMapcomparator in interface SortedMap<Integer,Double>SortedMap.comparator()public Int2DoubleSortedMap headMap(int to)
Int2DoubleSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Int2DoubleSortedMapSortedMap.headMap(Object)public Int2DoubleSortedMap tailMap(int from)
Int2DoubleSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Int2DoubleSortedMapSortedMap.tailMap(Object)public Int2DoubleSortedMap subMap(int from, int to)
Int2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Int2DoubleSortedMapSortedMap.subMap(Object,Object)public Int2DoubleAVLTreeMap 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.