|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleFunction
it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleMap
it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleSortedMap
it.unimi.dsi.fastutil.doubles.Double2DoubleAVLTreeMap
public class Double2DoubleAVLTreeMap
A type-specific AVL tree map with a fast, small-footprint implementation.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleMap |
---|
AbstractDouble2DoubleMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2DoubleSortedMap |
---|
Double2DoubleSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2DoubleMap |
---|
Double2DoubleMap.FastEntrySet |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Double2DoubleAVLTreeMap()
Creates a new empty tree map. |
|
Double2DoubleAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator. |
|
Double2DoubleAVLTreeMap(double[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Double2DoubleAVLTreeMap(double[] k,
double[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Double2DoubleAVLTreeMap(Double2DoubleMap m)
Creates a new tree map copying a given map. |
|
Double2DoubleAVLTreeMap(Double2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Double2DoubleAVLTreeMap(Map<? extends Double,? extends Double> m)
Creates a new tree map copying a given map. |
|
Double2DoubleAVLTreeMap(SortedMap<Double,Double> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Double2DoubleAVLTreeMap |
clone()
Returns a deep copy of this tree map. |
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(double k)
Checks whether the given value is contained in AbstractDouble2DoubleMap.keySet() . |
boolean |
containsValue(double v)
Checks whether the given value is contained in AbstractDouble2DoubleMap.values() . |
ObjectSortedSet<Double2DoubleMap.Entry> |
double2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
double |
firstDoubleKey()
|
double |
get(double k)
Returns the value to which the given key is mapped. |
Double2DoubleSortedMap |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey . |
boolean |
isEmpty()
|
DoubleSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
double |
lastDoubleKey()
|
double |
put(double k,
double v)
Adds a pair to the map. |
Double |
put(Double ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
double |
remove(double 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. |
Double2DoubleSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Double2DoubleSortedMap |
tailMap(double 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. |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2DoubleFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Double2DoubleAVLTreeMap()
public Double2DoubleAVLTreeMap(Comparator<? super Double> c)
c
- a (possibly type-specific) comparator.public Double2DoubleAVLTreeMap(Map<? extends Double,? extends Double> m)
m
- a Map
to be copied into the new tree map.public Double2DoubleAVLTreeMap(SortedMap<Double,Double> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Double2DoubleAVLTreeMap(Double2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Double2DoubleAVLTreeMap(Double2DoubleSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Double2DoubleAVLTreeMap(double[] k, double[] v, Comparator<? super Double> 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 Double2DoubleAVLTreeMap(double[] 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.Method Detail |
---|
public double put(double k, double v)
Double2DoubleFunction
put
in interface Double2DoubleFunction
put
in class AbstractDouble2DoubleFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public double remove(double k)
Double2DoubleFunction
remove
in interface Double2DoubleFunction
remove
in class AbstractDouble2DoubleFunction
Function.remove(Object)
public Double put(Double ok, Double ov)
AbstractDouble2DoubleFunction
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<Double,Double>
put
in interface Map<Double,Double>
put
in class AbstractDouble2DoubleFunction
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)
AbstractDouble2DoubleFunction
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.
remove
in interface Function<Double,Double>
remove
in interface Map<Double,Double>
remove
in class AbstractDouble2DoubleFunction
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(double v)
AbstractDouble2DoubleMap
AbstractDouble2DoubleMap.values()
.
containsValue
in interface Double2DoubleMap
containsValue
in class AbstractDouble2DoubleMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<Double,Double>
clear
in interface Map<Double,Double>
clear
in class AbstractDouble2DoubleFunction
Map.clear()
public boolean containsKey(double k)
AbstractDouble2DoubleMap
AbstractDouble2DoubleMap.keySet()
.
containsKey
in interface Double2DoubleFunction
containsKey
in class AbstractDouble2DoubleMap
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.
size
in interface Function<Double,Double>
size
in interface Map<Double,Double>
public boolean isEmpty()
isEmpty
in interface Map<Double,Double>
isEmpty
in class AbstractDouble2DoubleMap
public double get(double k)
Double2DoubleFunction
get
in interface Double2DoubleFunction
k
- the key.
Function.get(Object)
public double firstDoubleKey()
firstDoubleKey
in interface Double2DoubleSortedMap
SortedMap.firstKey()
public double lastDoubleKey()
lastDoubleKey
in interface Double2DoubleSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Double2DoubleMap.Entry> double2DoubleEntrySet()
Double2DoubleSortedMap
double2DoubleEntrySet
in interface Double2DoubleMap
double2DoubleEntrySet
in interface Double2DoubleSortedMap
Double2DoubleSortedMap.entrySet()
public DoubleSortedSet 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 Double2DoubleMap
keySet
in interface Double2DoubleSortedMap
keySet
in interface Map<Double,Double>
keySet
in interface SortedMap<Double,Double>
keySet
in class AbstractDouble2DoubleSortedMap
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 Double2DoubleMap
values
in interface Double2DoubleSortedMap
values
in interface Map<Double,Double>
values
in interface SortedMap<Double,Double>
values
in class AbstractDouble2DoubleSortedMap
Map.values()
public DoubleComparator comparator()
Double2DoubleSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Double2DoubleSortedMap
comparator
in interface SortedMap<Double,Double>
SortedMap.comparator()
public Double2DoubleSortedMap headMap(double to)
Double2DoubleSortedMap
toKey
.
headMap
in interface Double2DoubleSortedMap
SortedMap.headMap(Object)
public Double2DoubleSortedMap tailMap(double from)
Double2DoubleSortedMap
fromKey
.
tailMap
in interface Double2DoubleSortedMap
SortedMap.tailMap(Object)
public Double2DoubleSortedMap subMap(double from, double to)
Double2DoubleSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Double2DoubleSortedMap
SortedMap.subMap(Object,Object)
public Double2DoubleAVLTreeMap 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.
clone
in class Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |