|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap
it.unimi.dsi.fastutil.ints.AbstractInt2DoubleSortedMap
it.unimi.dsi.fastutil.ints.Int2DoubleAVLTreeMap
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.ints.AbstractInt2DoubleMap |
AbstractInt2DoubleMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Int2DoubleAVLTreeMap()
Creates a new empty tree map. |
|
Int2DoubleAVLTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Int2DoubleAVLTreeMap(Int2DoubleMap m)
Creates a new tree map copying a given map. |
|
Int2DoubleAVLTreeMap(Int2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Int2DoubleAVLTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Int2DoubleAVLTreeMap(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(int 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()
|
int |
firstIntKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
double |
get(int 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.
|
Int2DoubleSortedMap |
headMap(int to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
int |
lastIntKey()
|
Object |
lastKey()
Delegates to the corresponding type-specific method. |
double |
put(int 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.
|
double |
remove(int 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()
|
Int2DoubleSortedMap |
subMap(int from,
int to)
|
Int2DoubleSortedMap |
tailMap(int from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleSortedMap |
headMap, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap |
containsKey, 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.ints.Int2DoubleMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
Methods inherited from interface java.util.Map |
containsKey, containsValue, equals, hashCode, putAll |
Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public Int2DoubleAVLTreeMap()
public Int2DoubleAVLTreeMap(Comparator c)
c
- a Comparator
.public Int2DoubleAVLTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Int2DoubleAVLTreeMap(SortedMap m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Int2DoubleAVLTreeMap(Int2DoubleMap m)
m
- a type-specific map to be copied into the new tree map.public Int2DoubleAVLTreeMap(Int2DoubleSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.Method Detail |
public final double put(int k, double v)
Int2DoubleMap
put
in interface Int2DoubleMap
put
in class AbstractInt2DoubleMap
public final double remove(int k)
Int2DoubleMap
remove
in interface Int2DoubleMap
remove
in class AbstractInt2DoubleMap
public Object put(Object ok, Object ov)
AbstractInt2DoubleMap
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 AbstractInt2DoubleMap
public Object remove(Object ok)
AbstractInt2DoubleMap
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 AbstractInt2DoubleMap
public boolean containsValue(double v)
AbstractInt2DoubleMap
AbstractInt2DoubleMap.values()
.
containsValue
in interface Int2DoubleMap
containsValue
in class AbstractInt2DoubleMap
public void clear()
clear
in interface Map
clear
in class AbstractInt2DoubleMap
public boolean containsKey(int k)
AbstractInt2DoubleMap
AbstractInt2DoubleMap.keySet()
.
containsKey
in interface Int2DoubleMap
containsKey
in class AbstractInt2DoubleMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractInt2DoubleMap
public double get(int k)
Int2DoubleMap
get
in interface Int2DoubleMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractInt2DoubleMap
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 AbstractInt2DoubleMap
public int firstIntKey()
firstIntKey
in interface Int2DoubleSortedMap
SortedMap.firstKey()
public int lastIntKey()
lastIntKey
in interface Int2DoubleSortedMap
SortedMap.lastKey()
public Object firstKey()
AbstractInt2DoubleSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractInt2DoubleSortedMap
public Object lastKey()
AbstractInt2DoubleSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractInt2DoubleSortedMap
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 AbstractInt2DoubleSortedMap
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 AbstractInt2DoubleMap
public Comparator comparator()
comparator
in interface SortedMap
public Int2DoubleSortedMap headMap(int to)
headMap
in interface Int2DoubleSortedMap
SortedMap.headMap(Object)
public Int2DoubleSortedMap tailMap(int from)
tailMap
in interface Int2DoubleSortedMap
SortedMap.tailMap(Object)
public Int2DoubleSortedMap subMap(int from, int to)
subMap
in interface Int2DoubleSortedMap
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |