public class Double2BooleanRBTreeMap extends AbstractDouble2BooleanSortedMap implements Serializable, Cloneable
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.
AbstractDouble2BooleanMap.BasicEntryDouble2BooleanSortedMap.FastSortedEntrySetDouble2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Double2BooleanRBTreeMap()
Creates a new empty tree map.
|
Double2BooleanRBTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2BooleanRBTreeMap(double[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2BooleanRBTreeMap(double[] k,
boolean[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and 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<? extends Double,? extends Boolean> m)
Creates a new tree map copying a given map.
|
Double2BooleanRBTreeMap(SortedMap<Double,Boolean> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Double2BooleanRBTreeMap |
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
AbstractDouble2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractDouble2BooleanMap.values(). |
ObjectSortedSet<Double2BooleanMap.Entry> |
double2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
firstDoubleKey() |
boolean |
get(double k)
Returns the value to which the given key is mapped.
|
Double2BooleanSortedMap |
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() |
boolean |
put(double k,
boolean v)
Adds a pair to the map.
|
Boolean |
put(Double ok,
Boolean 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.
|
Boolean |
remove(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.
|
Double2BooleanSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2BooleanSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
BooleanCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Double2BooleanRBTreeMap()
public Double2BooleanRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2BooleanRBTreeMap(Map<? extends Double,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Double2BooleanRBTreeMap(SortedMap<Double,Boolean> 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.public Double2BooleanRBTreeMap(double[] k,
boolean[] v,
Comparator<? super 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.IllegalArgumentException - if k and v have different lengths.public Double2BooleanRBTreeMap(double[] k,
boolean[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.IllegalArgumentException - if k and v have different lengths.public boolean put(double k,
boolean v)
Double2BooleanFunctionput in interface Double2BooleanFunctionput in class AbstractDouble2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(double k)
Double2BooleanFunctionremove in interface Double2BooleanFunctionremove in class AbstractDouble2BooleanFunctionk - the key.Function.remove(Object)public Boolean put(Double ok, Boolean ov)
AbstractDouble2BooleanFunctionnull 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<Double,Boolean>put in interface Map<Double,Boolean>put in class AbstractDouble2BooleanFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Boolean remove(Object ok)
AbstractDouble2BooleanFunctionnull 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<Double,Boolean>remove in interface Map<Double,Boolean>remove in class AbstractDouble2BooleanFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(boolean v)
AbstractDouble2BooleanMapAbstractDouble2BooleanMap.values().containsValue in interface Double2BooleanMapcontainsValue in class AbstractDouble2BooleanMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2BooleanMapAbstractDouble2BooleanMap.keySet().containsKey in interface Double2BooleanFunctioncontainsKey in class AbstractDouble2BooleanMapFunction.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.
public boolean isEmpty()
public boolean get(double k)
Double2BooleanFunctionget in interface Double2BooleanFunctionk - the key.Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2BooleanSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2BooleanMap.Entry> double2BooleanEntrySet()
Double2BooleanSortedMapdouble2BooleanEntrySet in interface Double2BooleanMapdouble2BooleanEntrySet in interface Double2BooleanSortedMapDouble2BooleanSortedMap.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 Double2BooleanMapkeySet in interface Double2BooleanSortedMapkeySet in interface Map<Double,Boolean>keySet in interface SortedMap<Double,Boolean>keySet in class AbstractDouble2BooleanSortedMapMap.keySet()public BooleanCollection 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 Double2BooleanMapvalues in interface Double2BooleanSortedMapvalues in interface Map<Double,Boolean>values in interface SortedMap<Double,Boolean>values in class AbstractDouble2BooleanSortedMapMap.values()public DoubleComparator comparator()
Double2BooleanSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Double2BooleanSortedMapcomparator in interface SortedMap<Double,Boolean>SortedMap.comparator()public Double2BooleanSortedMap headMap(double to)
Double2BooleanSortedMaptoKey.headMap in interface Double2BooleanSortedMapSortedMap.headMap(Object)public Double2BooleanSortedMap tailMap(double from)
Double2BooleanSortedMapfromKey.tailMap in interface Double2BooleanSortedMapSortedMap.tailMap(Object)public Double2BooleanSortedMap subMap(double from, double to)
Double2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Double2BooleanSortedMapSortedMap.subMap(Object,Object)public Double2BooleanRBTreeMap 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.