|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2LongFunction
it.unimi.dsi.fastutil.doubles.AbstractDouble2LongMap
it.unimi.dsi.fastutil.doubles.AbstractDouble2LongSortedMap
it.unimi.dsi.fastutil.doubles.Double2LongRBTreeMap
public class Double2LongRBTreeMap
A type-specific red-black 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.AbstractDouble2LongMap |
|---|
AbstractDouble2LongMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongSortedMap |
|---|
Double2LongSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2LongMap |
|---|
Double2LongMap.FastEntrySet |
| Constructor Summary | |
|---|---|
Double2LongRBTreeMap()
Creates a new empty tree map. |
|
Double2LongRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
Creates a new empty tree map with the given comparator. |
|
Double2LongRBTreeMap(double[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Double2LongRBTreeMap(double[] k,
long[] v,
java.util.Comparator<? super java.lang.Double> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Double2LongRBTreeMap(Double2LongMap m)
Creates a new tree map copying a given map. |
|
Double2LongRBTreeMap(Double2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Double2LongRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Long> m)
Creates a new tree map copying a given map. |
|
Double2LongRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Long> 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). |
Double2LongRBTreeMap |
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 AbstractDouble2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in AbstractDouble2LongMap.values(). |
ObjectSortedSet<Double2LongMap.Entry> |
double2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
double |
firstDoubleKey()
|
long |
get(double k)
Returns the value to which the given key is mapped. |
Double2LongSortedMap |
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()
|
long |
put(double k,
long v)
Adds a pair to the map. |
java.lang.Long |
put(java.lang.Double ok,
java.lang.Long ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
long |
remove(double k)
Removes the mapping with the given key. |
java.lang.Long |
remove(java.lang.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. |
Double2LongSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Double2LongSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
LongCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2LongSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2LongMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2LongFunction |
|---|
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.Double2LongFunction |
|---|
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 |
| Constructor Detail |
|---|
public Double2LongRBTreeMap()
public Double2LongRBTreeMap(java.util.Comparator<? super java.lang.Double> c)
c - a (possibly type-specific) comparator.public Double2LongRBTreeMap(java.util.Map<? extends java.lang.Double,? extends java.lang.Long> m)
m - a Map to be copied into the new tree map.public Double2LongRBTreeMap(java.util.SortedMap<java.lang.Double,java.lang.Long> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Double2LongRBTreeMap(Double2LongMap m)
m - a type-specific map to be copied into the new tree map.public Double2LongRBTreeMap(Double2LongSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Double2LongRBTreeMap(double[] k,
long[] v,
java.util.Comparator<? super java.lang.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.
java.lang.IllegalArgumentException - if k and v have different lengths.
public Double2LongRBTreeMap(double[] k,
long[] 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 long put(double k,
long v)
Double2LongFunction
put in interface Double2LongFunctionput in class AbstractDouble2LongFunctionk - the key.v - the value.
Function.put(Object,Object)public long remove(double k)
Double2LongFunction
remove in interface Double2LongFunctionremove in class AbstractDouble2LongFunctionFunction.remove(Object)
public java.lang.Long put(java.lang.Double ok,
java.lang.Long ov)
AbstractDouble2LongFunctionnull 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<java.lang.Double,java.lang.Long>put in interface java.util.Map<java.lang.Double,java.lang.Long>put in class AbstractDouble2LongFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public java.lang.Long remove(java.lang.Object ok)
AbstractDouble2LongFunctionnull 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<java.lang.Double,java.lang.Long>remove in interface java.util.Map<java.lang.Double,java.lang.Long>remove in class AbstractDouble2LongFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(long v)
AbstractDouble2LongMapAbstractDouble2LongMap.values().
containsValue in interface Double2LongMapcontainsValue in class AbstractDouble2LongMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<java.lang.Double,java.lang.Long>clear in interface java.util.Map<java.lang.Double,java.lang.Long>clear in class AbstractDouble2LongFunctionMap.clear()public boolean containsKey(double k)
AbstractDouble2LongMapAbstractDouble2LongMap.keySet().
containsKey in interface Double2LongFunctioncontainsKey in class AbstractDouble2LongMapFunction.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<java.lang.Double,java.lang.Long>size in interface java.util.Map<java.lang.Double,java.lang.Long>public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Double,java.lang.Long>isEmpty in class AbstractDouble2LongMappublic long get(double k)
Double2LongFunction
get in interface Double2LongFunctionk - the key.
Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2LongSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2LongMap.Entry> double2LongEntrySet()
Double2LongSortedMap
double2LongEntrySet in interface Double2LongMapdouble2LongEntrySet in interface Double2LongSortedMapDouble2LongSortedMap.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 Double2LongMapkeySet in interface Double2LongSortedMapkeySet in interface java.util.Map<java.lang.Double,java.lang.Long>keySet in interface java.util.SortedMap<java.lang.Double,java.lang.Long>keySet in class AbstractDouble2LongSortedMapMap.keySet()public LongCollection 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 Double2LongMapvalues in interface Double2LongSortedMapvalues in interface java.util.Map<java.lang.Double,java.lang.Long>values in interface java.util.SortedMap<java.lang.Double,java.lang.Long>values in class AbstractDouble2LongSortedMapMap.values()public DoubleComparator comparator()
Double2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2LongSortedMapcomparator in interface java.util.SortedMap<java.lang.Double,java.lang.Long>SortedMap.comparator()public Double2LongSortedMap headMap(double to)
Double2LongSortedMaptoKey.
headMap in interface Double2LongSortedMapSortedMap.headMap(Object)public Double2LongSortedMap tailMap(double from)
Double2LongSortedMapfromKey.
tailMap in interface Double2LongSortedMapSortedMap.tailMap(Object)
public Double2LongSortedMap subMap(double from,
double to)
Double2LongSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Double2LongSortedMapSortedMap.subMap(Object,Object)public Double2LongRBTreeMap 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 | ||||||||