|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2DoubleFunction<K>
it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap<K>
it.unimi.dsi.fastutil.objects.AbstractObject2DoubleSortedMap<K>
it.unimi.dsi.fastutil.objects.Object2DoubleAVLTreeMap<K>
public class Object2DoubleAVLTreeMap<K>
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.objects.AbstractObject2DoubleMap |
|---|
AbstractObject2DoubleMap.BasicEntry<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleSortedMap |
|---|
Object2DoubleSortedMap.FastSortedEntrySet<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleMap |
|---|
Object2DoubleMap.FastEntrySet<K> |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Object2DoubleAVLTreeMap()
Creates a new empty tree map. |
|
Object2DoubleAVLTreeMap(java.util.Comparator<? super K> c)
Creates a new empty tree map with the given comparator. |
|
Object2DoubleAVLTreeMap(K[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Object2DoubleAVLTreeMap(K[] k,
double[] v,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Object2DoubleAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Double> m)
Creates a new tree map copying a given map. |
|
Object2DoubleAVLTreeMap(Object2DoubleMap<? extends K> m)
Creates a new tree map copying a given map. |
|
Object2DoubleAVLTreeMap(Object2DoubleSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Object2DoubleAVLTreeMap(java.util.SortedMap<K,java.lang.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). |
java.lang.Object |
clone()
Returns a deep copy of this tree map. |
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(java.lang.Object k)
Checks whether the given value is contained in AbstractObject2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in AbstractObject2DoubleMap.values(). |
K |
firstKey()
|
java.lang.Double |
get(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
double |
getDouble(java.lang.Object k)
Returns the value to which the given key is mapped. |
Object2DoubleSortedMap<K> |
headMap(K to)
Delegates to the corresponding type-specific method. |
boolean |
isEmpty()
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
K |
lastKey()
|
ObjectSortedSet<Object2DoubleMap.Entry<K>> |
object2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
double |
put(K k,
double v)
Adds a pair to the map. |
java.lang.Double |
put(K ok,
java.lang.Double ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
java.lang.Double |
remove(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
double |
removeDouble(java.lang.Object k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Object2DoubleSortedMap<K> |
subMap(K from,
K to)
Delegates to the corresponding type-specific method. |
Object2DoubleSortedMap<K> |
tailMap(K from)
Delegates to the corresponding type-specific method. |
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleSortedMap |
|---|
entrySet |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface java.util.Map |
|---|
containsValue, equals, hashCode, putAll |
| Methods inherited from interface java.util.Map |
|---|
containsValue, equals, hashCode, putAll |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
public Object2DoubleAVLTreeMap()
public Object2DoubleAVLTreeMap(java.util.Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2DoubleAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Double> m)
m - a Map to be copied into the new tree map.public Object2DoubleAVLTreeMap(java.util.SortedMap<K,java.lang.Double> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Object2DoubleAVLTreeMap(Object2DoubleMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2DoubleAVLTreeMap(Object2DoubleSortedMap<K> m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Object2DoubleAVLTreeMap(K[] k,
double[] v,
java.util.Comparator<? super K> 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.
java.lang.IllegalArgumentException - if k and v have different lengths.
public Object2DoubleAVLTreeMap(K[] k,
double[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.
java.lang.IllegalArgumentException - if k and v have different lengths.| Method Detail |
|---|
public double put(K k,
double v)
Object2DoubleFunction
put in interface Object2DoubleFunction<K>put in class AbstractObject2DoubleFunction<K>k - the key.v - the value.
Function.put(Object,Object)public double removeDouble(java.lang.Object k)
Object2DoubleFunction
removeDouble in interface Object2DoubleFunction<K>removeDouble in class AbstractObject2DoubleFunction<K>Function.remove(Object)
public java.lang.Double put(K ok,
java.lang.Double ov)
AbstractObject2DoubleFunctionnull 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<K,java.lang.Double>put in interface java.util.Map<K,java.lang.Double>put in class AbstractObject2DoubleFunction<K>ok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public java.lang.Double remove(java.lang.Object ok)
AbstractObject2DoubleFunctionnull 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<K,java.lang.Double>remove in interface java.util.Map<K,java.lang.Double>remove in class AbstractObject2DoubleFunction<K>null if no value was present for the given key.Map.remove(Object)public boolean containsValue(double v)
AbstractObject2DoubleMapAbstractObject2DoubleMap.values().
containsValue in interface Object2DoubleMap<K>containsValue in class AbstractObject2DoubleMap<K>Map.containsValue(Object)public void clear()
Function
clear in interface Function<K,java.lang.Double>clear in interface java.util.Map<K,java.lang.Double>clear in class AbstractObject2DoubleFunction<K>Map.clear()public boolean containsKey(java.lang.Object k)
AbstractObject2DoubleMapAbstractObject2DoubleMap.keySet().
containsKey in interface Function<K,java.lang.Double>containsKey in interface java.util.Map<K,java.lang.Double>containsKey in class AbstractObject2DoubleMap<K>k - the key.
key.Map.containsKey(Object)public int size()
FunctionMost 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<K,java.lang.Double>size in interface java.util.Map<K,java.lang.Double>public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Double>isEmpty in class AbstractObject2DoubleMap<K>public double getDouble(java.lang.Object k)
Object2DoubleFunction
getDouble in interface Object2DoubleFunction<K>k - the key.
Function.get(Object)public java.lang.Double get(java.lang.Object ok)
AbstractObject2DoubleFunctionnull 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 Function<K,java.lang.Double>get in interface java.util.Map<K,java.lang.Double>get in class AbstractObject2DoubleFunction<K>ok - the key.
null if no value was present for the given key.Map.get(Object)public K firstKey()
firstKey in interface java.util.SortedMap<K,java.lang.Double>public K lastKey()
lastKey in interface java.util.SortedMap<K,java.lang.Double>public ObjectSortedSet<Object2DoubleMap.Entry<K>> object2DoubleEntrySet()
Object2DoubleMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Object2DoubleMap.entrySet()
so that it returns an ObjectSet
of objects of type Object2DoubleMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
object2DoubleEntrySet in interface Object2DoubleMap<K>object2DoubleEntrySet in interface Object2DoubleSortedMap<K>Object2DoubleMap.entrySet()public ObjectSortedSet<K> 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 Object2DoubleMap<K>keySet in interface Object2DoubleSortedMap<K>keySet in interface java.util.Map<K,java.lang.Double>keySet in class AbstractObject2DoubleSortedMap<K>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 Object2DoubleMap<K>values in interface Object2DoubleSortedMap<K>values in interface java.util.Map<K,java.lang.Double>values in class AbstractObject2DoubleSortedMap<K>Map.values()public java.util.Comparator<? super K> comparator()
Object2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2DoubleSortedMap<K>comparator in interface java.util.SortedMap<K,java.lang.Double>SortedMap.comparator()public Object2DoubleSortedMap<K> headMap(K to)
AbstractObject2DoubleSortedMap
headMap in interface Object2DoubleSortedMap<K>headMap in interface java.util.SortedMap<K,java.lang.Double>headMap in class AbstractObject2DoubleSortedMap<K>SortedMap.headMap(Object)public Object2DoubleSortedMap<K> tailMap(K from)
AbstractObject2DoubleSortedMap
tailMap in interface Object2DoubleSortedMap<K>tailMap in interface java.util.SortedMap<K,java.lang.Double>tailMap in class AbstractObject2DoubleSortedMap<K>SortedMap.tailMap(Object)
public Object2DoubleSortedMap<K> subMap(K from,
K to)
AbstractObject2DoubleSortedMap
subMap in interface Object2DoubleSortedMap<K>subMap in interface java.util.SortedMap<K,java.lang.Double>subMap in class AbstractObject2DoubleSortedMap<K>SortedMap.subMap(Object,Object)public java.lang.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 java.lang.Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||