|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap
it.unimi.dsi.fastutil.objects.AbstractObject2DoubleSortedMap
it.unimi.dsi.fastutil.objects.Object2DoubleAVLTreeMap
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 inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap |
AbstractObject2DoubleMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Object2DoubleAVLTreeMap()
Creates a new empty tree map. |
|
Object2DoubleAVLTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Object2DoubleAVLTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Object2DoubleAVLTreeMap(Object2DoubleMap m)
Creates a new tree map copying a given map. |
|
Object2DoubleAVLTreeMap(Object2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Object2DoubleAVLTreeMap(SortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree map. |
Comparator |
comparator()
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in keySet() . |
boolean |
containsValue(double v)
Checks whether the given value is contained in values() . |
Set |
entrySet()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
double |
getDouble(Object k)
Returns the value to which the given key is mapped. |
SortedMap |
headMap(Object to)
Delegates to the corresponding type-specific method. |
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
Object |
lastKey()
Delegates to the corresponding type-specific method. |
double |
put(Object k,
double v)
Adds a pair to the map. |
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
double |
removeDouble(Object k)
Removes the mapping with the given key. |
int |
size()
|
SortedMap |
subMap(Object from,
Object to)
Delegates to the corresponding type-specific method. |
SortedMap |
tailMap(Object from)
Delegates to the corresponding type-specific method. |
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap |
containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, hashCode, putAll, setDefRetValue, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
Methods inherited from interface java.util.Map |
containsValue, equals, hashCode, putAll |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public Object2DoubleAVLTreeMap()
public Object2DoubleAVLTreeMap(Comparator c)
c
- a Comparator
.public Object2DoubleAVLTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Object2DoubleAVLTreeMap(SortedMap m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Object2DoubleAVLTreeMap(Object2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Object2DoubleAVLTreeMap(Object2DoubleSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.Method Detail |
public final double put(Object k, double v)
Object2DoubleMap
put
in interface Object2DoubleMap
put
in class AbstractObject2DoubleMap
public final double removeDouble(Object k)
Object2DoubleMap
removeDouble
in interface Object2DoubleMap
removeDouble
in class AbstractObject2DoubleMap
public Object put(Object ok, Object ov)
AbstractObject2DoubleMap
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 Map
put
in class AbstractObject2DoubleMap
public Object remove(Object ok)
AbstractObject2DoubleMap
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 Map
remove
in class AbstractObject2DoubleMap
public boolean containsValue(double v)
AbstractObject2DoubleMap
AbstractObject2DoubleMap.values()
.
containsValue
in interface Object2DoubleMap
containsValue
in class AbstractObject2DoubleMap
public void clear()
clear
in interface Map
clear
in class AbstractObject2DoubleMap
public boolean containsKey(Object k)
AbstractObject2DoubleMap
AbstractObject2DoubleMap.keySet()
.
containsKey
in interface Map
containsKey
in class AbstractObject2DoubleMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractObject2DoubleMap
public double getDouble(Object k)
Object2DoubleMap
getDouble
in interface Object2DoubleMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractObject2DoubleMap
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.
get
in interface Map
get
in class AbstractObject2DoubleMap
public Object firstKey()
AbstractObject2DoubleSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractObject2DoubleSortedMap
public Object lastKey()
AbstractObject2DoubleSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractObject2DoubleSortedMap
public Set entrySet()
entrySet
in interface Map
public Set 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 Map
keySet
in class AbstractObject2DoubleSortedMap
public Collection 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 Map
values
in class AbstractObject2DoubleMap
public Comparator comparator()
comparator
in interface SortedMap
public SortedMap headMap(Object to)
AbstractObject2DoubleSortedMap
headMap
in interface SortedMap
headMap
in class AbstractObject2DoubleSortedMap
public SortedMap tailMap(Object from)
AbstractObject2DoubleSortedMap
tailMap
in interface SortedMap
tailMap
in class AbstractObject2DoubleSortedMap
public SortedMap subMap(Object from, Object to)
AbstractObject2DoubleSortedMap
subMap
in interface SortedMap
subMap
in class AbstractObject2DoubleSortedMap
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |