|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanMap
it.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanSortedMap
it.unimi.dsi.fastutil.doubles.Double2BooleanRBTreeMap
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 inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanMap |
AbstractDouble2BooleanMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Double2BooleanRBTreeMap()
Creates a new empty tree map. |
|
Double2BooleanRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Double2BooleanRBTreeMap(Double2BooleanMap m)
Creates a new tree map copying a given map. |
|
Double2BooleanRBTreeMap(Double2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Double2BooleanRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Double2BooleanRBTreeMap(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(boolean v)
Checks whether the given value is contained in values(). |
Set |
entrySet()
|
double |
firstDoubleKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
boolean |
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.
|
Double2BooleanSortedMap |
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. |
boolean |
put(double k,
boolean 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.
|
boolean |
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()
|
Double2BooleanSortedMap |
subMap(double from,
double to)
|
Double2BooleanSortedMap |
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.AbstractDouble2BooleanSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2BooleanMap |
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.doubles.Double2BooleanMap |
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 Double2BooleanRBTreeMap()
public Double2BooleanRBTreeMap(Comparator c)
c - a Comparator.public Double2BooleanRBTreeMap(Map m)
m - a Map to be copied into the new tree map.public Double2BooleanRBTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Double2BooleanRBTreeMap(Double2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Double2BooleanRBTreeMap(Double2BooleanSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final boolean put(double k,
boolean v)
Double2BooleanMap
put in interface Double2BooleanMapput in class AbstractDouble2BooleanMappublic final boolean remove(double k)
Double2BooleanMap
remove in interface Double2BooleanMapremove in class AbstractDouble2BooleanMap
public Object put(Object ok,
Object ov)
AbstractDouble2BooleanMapnull 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 AbstractDouble2BooleanMappublic Object remove(Object ok)
AbstractDouble2BooleanMapnull 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 AbstractDouble2BooleanMappublic boolean containsValue(boolean v)
AbstractDouble2BooleanMapAbstractDouble2BooleanMap.values().
containsValue in interface Double2BooleanMapcontainsValue in class AbstractDouble2BooleanMappublic void clear()
clear in interface Mapclear in class AbstractDouble2BooleanMappublic boolean containsKey(double k)
AbstractDouble2BooleanMapAbstractDouble2BooleanMap.keySet().
containsKey in interface Double2BooleanMapcontainsKey in class AbstractDouble2BooleanMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractDouble2BooleanMappublic boolean get(double k)
Double2BooleanMap
get in interface Double2BooleanMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractDouble2BooleanMapnull 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 AbstractDouble2BooleanMappublic double firstDoubleKey()
firstDoubleKey in interface Double2BooleanSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2BooleanSortedMapSortedMap.lastKey()public Object firstKey()
AbstractDouble2BooleanSortedMap
firstKey in interface SortedMapfirstKey in class AbstractDouble2BooleanSortedMappublic Object lastKey()
AbstractDouble2BooleanSortedMap
lastKey in interface SortedMaplastKey in class AbstractDouble2BooleanSortedMappublic 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 AbstractDouble2BooleanSortedMappublic 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 AbstractDouble2BooleanMappublic Comparator comparator()
comparator in interface SortedMappublic Double2BooleanSortedMap headMap(double to)
headMap in interface Double2BooleanSortedMapSortedMap.headMap(Object)public Double2BooleanSortedMap tailMap(double from)
tailMap in interface Double2BooleanSortedMapSortedMap.tailMap(Object)
public Double2BooleanSortedMap subMap(double from,
double to)
subMap in interface Double2BooleanSortedMapSortedMap.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 | |||||||||