public class Int2DoubleRBTreeMap 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
Int2DoubleSortedMap.FastSortedEntrySet
Int2DoubleMap.FastEntrySet
Constructor and Description |
---|
Int2DoubleRBTreeMap()
Creates a new empty tree map.
|
Int2DoubleRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2DoubleRBTreeMap(int[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2DoubleRBTreeMap(int[] k,
double[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2DoubleRBTreeMap(Int2DoubleMap m)
Creates a new tree map copying a given map.
|
Int2DoubleRBTreeMap(Int2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Int2DoubleRBTreeMap(Map<? extends Integer,? extends Double> m)
Creates a new tree map copying a given map.
|
Int2DoubleRBTreeMap(SortedMap<Integer,Double> 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).
|
Int2DoubleRBTreeMap |
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
AbstractInt2DoubleMap.keySet() . |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractInt2DoubleMap.values() . |
int |
firstIntKey() |
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() |
double |
put(int k,
double v)
Adds a pair to the map.
|
Double |
put(Integer ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
remove(int k)
Removes the mapping with the given key.
|
Double |
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
containsKey, containsValue, equals, get, hashCode, putAll
public Int2DoubleRBTreeMap()
public Int2DoubleRBTreeMap(Comparator<? super Integer> c)
c
- a (possibly type-specific) comparator.public Int2DoubleRBTreeMap(Map<? extends Integer,? extends Double> m)
m
- a Map
to be copied into the new tree map.public Int2DoubleRBTreeMap(SortedMap<Integer,Double> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2DoubleRBTreeMap(Int2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Int2DoubleRBTreeMap(Int2DoubleSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2DoubleRBTreeMap(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 Int2DoubleRBTreeMap(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 put(int k, double v)
Int2DoubleFunction
put
in interface Int2DoubleFunction
put
in class AbstractInt2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(int k)
Int2DoubleFunction
remove
in interface Int2DoubleFunction
remove
in class AbstractInt2DoubleFunction
Function.remove(Object)
public Double put(Integer ok, Double ov)
AbstractInt2DoubleFunction
null
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,Double>
put
in interface Map<Integer,Double>
put
in class AbstractInt2DoubleFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Double remove(Object ok)
AbstractInt2DoubleFunction
null
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(double v)
AbstractInt2DoubleMap
AbstractInt2DoubleMap.values()
.containsValue
in interface Int2DoubleMap
containsValue
in class AbstractInt2DoubleMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(int k)
AbstractInt2DoubleMap
AbstractInt2DoubleMap.keySet()
.containsKey
in interface Int2DoubleFunction
containsKey
in class AbstractInt2DoubleMap
Function.containsKey(Object)
public int size()
Function
Most 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 double get(int k)
Int2DoubleFunction
get
in interface Int2DoubleFunction
k
- the key.Function.get(Object)
public int firstIntKey()
firstIntKey
in interface Int2DoubleSortedMap
SortedMap.firstKey()
public int lastIntKey()
lastIntKey
in interface Int2DoubleSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Int2DoubleMap.Entry> int2DoubleEntrySet()
Int2DoubleSortedMap
int2DoubleEntrySet
in interface Int2DoubleMap
int2DoubleEntrySet
in interface Int2DoubleSortedMap
Int2DoubleSortedMap.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 Int2DoubleMap
keySet
in interface Int2DoubleSortedMap
keySet
in interface Map<Integer,Double>
keySet
in interface SortedMap<Integer,Double>
keySet
in class AbstractInt2DoubleSortedMap
Map.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 Int2DoubleMap
values
in interface Int2DoubleSortedMap
values
in interface Map<Integer,Double>
values
in interface SortedMap<Integer,Double>
values
in class AbstractInt2DoubleSortedMap
Map.values()
public IntComparator comparator()
Int2DoubleSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Int2DoubleSortedMap
comparator
in interface SortedMap<Integer,Double>
SortedMap.comparator()
public Int2DoubleSortedMap headMap(int to)
Int2DoubleSortedMap
toKey
.headMap
in interface Int2DoubleSortedMap
SortedMap.headMap(Object)
public Int2DoubleSortedMap tailMap(int from)
Int2DoubleSortedMap
fromKey
.tailMap
in interface Int2DoubleSortedMap
SortedMap.tailMap(Object)
public Int2DoubleSortedMap subMap(int from, int to)
Int2DoubleSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2DoubleSortedMap
SortedMap.subMap(Object,Object)
public Int2DoubleRBTreeMap 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.