|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap
it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap
it.unimi.dsi.fastutil.doubles.Double2ReferenceAVLTreeMap
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.doubles.AbstractDouble2ReferenceMap |
AbstractDouble2ReferenceMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Double2ReferenceAVLTreeMap()
Creates a new empty tree map. |
|
Double2ReferenceAVLTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Double2ReferenceAVLTreeMap(Double2ReferenceMap m)
Creates a new tree map copying a given map. |
|
Double2ReferenceAVLTreeMap(Double2ReferenceSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Double2ReferenceAVLTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Double2ReferenceAVLTreeMap(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(double k)
Checks whether the given value is contained in keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in values(). |
Set |
entrySet()
|
double |
firstDoubleKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
Object |
get(double k)
Returns the value to which the given key is mapped. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
Double2ReferenceSortedMap |
headMap(double to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
double |
lastDoubleKey()
|
Object |
lastKey()
Delegates to the corresponding type-specific method. |
Object |
put(double k,
Object 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(double k)
Removes the mapping with the given key. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
size()
|
Double2ReferenceSortedMap |
subMap(double from,
double to)
|
Double2ReferenceSortedMap |
tailMap(double from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap |
containsKey, 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.doubles.Double2ReferenceMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
| Methods inherited from interface java.util.Map |
containsKey, equals, hashCode, putAll |
| Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public Double2ReferenceAVLTreeMap()
public Double2ReferenceAVLTreeMap(Comparator c)
c - a Comparator.public Double2ReferenceAVLTreeMap(Map m)
m - a Map to be copied into the new tree map.public Double2ReferenceAVLTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Double2ReferenceAVLTreeMap(Double2ReferenceMap m)
m - a type-specific map to be copied into the new tree map.public Double2ReferenceAVLTreeMap(Double2ReferenceSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final Object put(double k,
Object v)
Double2ReferenceMap
put in interface Double2ReferenceMapput in class AbstractDouble2ReferenceMappublic final Object remove(double k)
Double2ReferenceMap
remove in interface Double2ReferenceMapremove in class AbstractDouble2ReferenceMap
public Object put(Object ok,
Object ov)
AbstractDouble2ReferenceMapnull 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 Mapput in class AbstractDouble2ReferenceMappublic Object remove(Object ok)
AbstractDouble2ReferenceMapnull 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 Mapremove in class AbstractDouble2ReferenceMappublic boolean containsValue(Object v)
AbstractDouble2ReferenceMapAbstractDouble2ReferenceMap.values().
containsValue in interface MapcontainsValue in class AbstractDouble2ReferenceMappublic void clear()
clear in interface Mapclear in class AbstractDouble2ReferenceMappublic boolean containsKey(double k)
AbstractDouble2ReferenceMapAbstractDouble2ReferenceMap.keySet().
containsKey in interface Double2ReferenceMapcontainsKey in class AbstractDouble2ReferenceMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractDouble2ReferenceMappublic Object get(double k)
Double2ReferenceMap
get in interface Double2ReferenceMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractDouble2ReferenceMapnull 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 Mapget in class AbstractDouble2ReferenceMappublic double firstDoubleKey()
firstDoubleKey in interface Double2ReferenceSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2ReferenceSortedMapSortedMap.lastKey()public Object firstKey()
AbstractDouble2ReferenceSortedMap
firstKey in interface SortedMapfirstKey in class AbstractDouble2ReferenceSortedMappublic Object lastKey()
AbstractDouble2ReferenceSortedMap
lastKey in interface SortedMaplastKey in class AbstractDouble2ReferenceSortedMappublic Set entrySet()
entrySet in interface Mappublic 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 MapkeySet in class AbstractDouble2ReferenceSortedMappublic 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 Mapvalues in class AbstractDouble2ReferenceMappublic Comparator comparator()
comparator in interface SortedMappublic Double2ReferenceSortedMap headMap(double to)
headMap in interface Double2ReferenceSortedMapSortedMap.headMap(Object)public Double2ReferenceSortedMap tailMap(double from)
tailMap in interface Double2ReferenceSortedMapSortedMap.tailMap(Object)
public Double2ReferenceSortedMap subMap(double from,
double to)
subMap in interface Double2ReferenceSortedMapSortedMap.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.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||