|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2FloatFunction
it.unimi.dsi.fastutil.doubles.AbstractDouble2FloatMap
it.unimi.dsi.fastutil.doubles.AbstractDouble2FloatSortedMap
it.unimi.dsi.fastutil.doubles.Double2FloatAVLTreeMap
public class Double2FloatAVLTreeMap
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.AbstractDouble2FloatMap |
---|
AbstractDouble2FloatMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2FloatSortedMap |
---|
Double2FloatSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2FloatMap |
---|
Double2FloatMap.FastEntrySet |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Double2FloatAVLTreeMap()
Creates a new empty tree map. |
|
Double2FloatAVLTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator. |
|
Double2FloatAVLTreeMap(double[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Double2FloatAVLTreeMap(double[] k,
float[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Double2FloatAVLTreeMap(Double2FloatMap m)
Creates a new tree map copying a given map. |
|
Double2FloatAVLTreeMap(Double2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Double2FloatAVLTreeMap(Map<? extends Double,? extends Float> m)
Creates a new tree map copying a given map. |
|
Double2FloatAVLTreeMap(SortedMap<Double,Float> 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). |
Object |
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 AbstractDouble2FloatMap.keySet() . |
boolean |
containsValue(float v)
Checks whether the given value is contained in AbstractDouble2FloatMap.values() . |
ObjectSortedSet<Double2FloatMap.Entry> |
double2FloatEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
double |
firstDoubleKey()
|
float |
get(double k)
Returns the value to which the given key is mapped. |
Double2FloatSortedMap |
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()
|
float |
put(double k,
float v)
Adds a pair to the map. |
Float |
put(Double ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
float |
remove(double k)
Removes the mapping with the given key. |
Float |
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. |
Double2FloatSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Double2FloatSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey . |
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2FloatSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2FloatMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2FloatFunction |
---|
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.Double2FloatFunction |
---|
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 |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Double2FloatAVLTreeMap()
public Double2FloatAVLTreeMap(Comparator<? super Double> c)
c
- a (possibly type-specific) comparator.public Double2FloatAVLTreeMap(Map<? extends Double,? extends Float> m)
m
- a Map
to be copied into the new tree map.public Double2FloatAVLTreeMap(SortedMap<Double,Float> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Double2FloatAVLTreeMap(Double2FloatMap m)
m
- a type-specific map to be copied into the new tree map.public Double2FloatAVLTreeMap(Double2FloatSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Double2FloatAVLTreeMap(double[] k, float[] 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 Double2FloatAVLTreeMap(double[] k, float[] 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 float put(double k, float v)
Double2FloatFunction
put
in interface Double2FloatFunction
put
in class AbstractDouble2FloatFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public float remove(double k)
Double2FloatFunction
remove
in interface Double2FloatFunction
remove
in class AbstractDouble2FloatFunction
Function.remove(Object)
public Float put(Double ok, Float ov)
AbstractDouble2FloatFunction
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,Float>
put
in interface Map<Double,Float>
put
in class AbstractDouble2FloatFunction
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public Float remove(Object ok)
AbstractDouble2FloatFunction
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,Float>
remove
in interface Map<Double,Float>
remove
in class AbstractDouble2FloatFunction
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(float v)
AbstractDouble2FloatMap
AbstractDouble2FloatMap.values()
.
containsValue
in interface Double2FloatMap
containsValue
in class AbstractDouble2FloatMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<Double,Float>
clear
in interface Map<Double,Float>
clear
in class AbstractDouble2FloatFunction
Map.clear()
public boolean containsKey(double k)
AbstractDouble2FloatMap
AbstractDouble2FloatMap.keySet()
.
containsKey
in interface Double2FloatFunction
containsKey
in class AbstractDouble2FloatMap
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,Float>
size
in interface Map<Double,Float>
public boolean isEmpty()
isEmpty
in interface Map<Double,Float>
isEmpty
in class AbstractDouble2FloatMap
public float get(double k)
Double2FloatFunction
get
in interface Double2FloatFunction
k
- the key.
Function.get(Object)
public double firstDoubleKey()
firstDoubleKey
in interface Double2FloatSortedMap
SortedMap.firstKey()
public double lastDoubleKey()
lastDoubleKey
in interface Double2FloatSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Double2FloatMap.Entry> double2FloatEntrySet()
Double2FloatMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2FloatMap.entrySet()
so that it returns an ObjectSet
of objects of type Double2FloatMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
double2FloatEntrySet
in interface Double2FloatMap
double2FloatEntrySet
in interface Double2FloatSortedMap
Double2FloatMap.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 Double2FloatMap
keySet
in interface Double2FloatSortedMap
keySet
in interface Map<Double,Float>
keySet
in class AbstractDouble2FloatSortedMap
Map.keySet()
public FloatCollection 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 Double2FloatMap
values
in interface Double2FloatSortedMap
values
in interface Map<Double,Float>
values
in class AbstractDouble2FloatSortedMap
Map.values()
public DoubleComparator comparator()
Double2FloatSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Double2FloatSortedMap
comparator
in interface SortedMap<Double,Float>
SortedMap.comparator()
public Double2FloatSortedMap headMap(double to)
Double2FloatSortedMap
toKey
.
headMap
in interface Double2FloatSortedMap
SortedMap.headMap(Object)
public Double2FloatSortedMap tailMap(double from)
Double2FloatSortedMap
fromKey
.
tailMap
in interface Double2FloatSortedMap
SortedMap.tailMap(Object)
public Double2FloatSortedMap subMap(double from, double to)
Double2FloatSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Double2FloatSortedMap
SortedMap.subMap(Object,Object)
public Object 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 |