public class Float2BooleanRBTreeMap extends AbstractFloat2BooleanSortedMap 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.
AbstractFloat2BooleanMap.BasicEntryFloat2BooleanSortedMap.FastSortedEntrySetFloat2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Float2BooleanRBTreeMap()
Creates a new empty tree map.
|
Float2BooleanRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2BooleanRBTreeMap(float[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2BooleanRBTreeMap(float[] k,
boolean[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Float2BooleanRBTreeMap(Float2BooleanMap m)
Creates a new tree map copying a given map.
|
Float2BooleanRBTreeMap(Float2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2BooleanRBTreeMap(Map<? extends Float,? extends Boolean> m)
Creates a new tree map copying a given map.
|
Float2BooleanRBTreeMap(SortedMap<Float,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).
|
Float2BooleanRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
FloatComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(float k)
Checks whether the given value is contained in
AbstractFloat2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractFloat2BooleanMap.values(). |
float |
firstFloatKey() |
ObjectSortedSet<Float2BooleanMap.Entry> |
float2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
boolean |
get(float k)
Returns the value to which the given key is mapped.
|
Float2BooleanSortedMap |
headMap(float to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
FloatSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
float |
lastFloatKey() |
boolean |
put(float k,
boolean v)
Adds a pair to the map.
|
Boolean |
put(Float ok,
Boolean ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
boolean |
remove(float k)
Removes the mapping with the given key.
|
Boolean |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Float2BooleanSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2BooleanSortedMap |
tailMap(float 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 Float2BooleanRBTreeMap()
public Float2BooleanRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2BooleanRBTreeMap(Map<? extends Float,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Float2BooleanRBTreeMap(SortedMap<Float,Boolean> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2BooleanRBTreeMap(Float2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Float2BooleanRBTreeMap(Float2BooleanSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2BooleanRBTreeMap(float[] k,
boolean[] v,
Comparator<? super Float> 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 Float2BooleanRBTreeMap(float[] 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(float k,
boolean v)
Float2BooleanFunctionput in interface Float2BooleanFunctionput in class AbstractFloat2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(float k)
Float2BooleanFunctionremove in interface Float2BooleanFunctionremove in class AbstractFloat2BooleanFunctionk - the key.Function.remove(Object)@Deprecated public Boolean put(Float ok, Boolean ov)
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 Function<Float,Boolean>put in interface Map<Float,Boolean>put in class AbstractFloat2BooleanFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Boolean remove(Object ok)
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.
public boolean containsValue(boolean v)
AbstractFloat2BooleanMapAbstractFloat2BooleanMap.values().containsValue in interface Float2BooleanMapcontainsValue in class AbstractFloat2BooleanMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2BooleanMapAbstractFloat2BooleanMap.keySet().containsKey in interface Float2BooleanFunctioncontainsKey in class AbstractFloat2BooleanMapFunction.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(float k)
Float2BooleanFunctionget in interface Float2BooleanFunctionk - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2BooleanSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2BooleanMap.Entry> float2BooleanEntrySet()
Float2BooleanSortedMapfloat2BooleanEntrySet in interface Float2BooleanMapfloat2BooleanEntrySet in interface Float2BooleanSortedMapFloat2BooleanSortedMap.entrySet()public FloatSortedSet 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 Float2BooleanMapkeySet in interface Float2BooleanSortedMapkeySet in interface Map<Float,Boolean>keySet in interface SortedMap<Float,Boolean>keySet in class AbstractFloat2BooleanSortedMapMap.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 Float2BooleanMapvalues in interface Float2BooleanSortedMapvalues in interface Map<Float,Boolean>values in interface SortedMap<Float,Boolean>values in class AbstractFloat2BooleanSortedMapMap.values()public FloatComparator comparator()
Float2BooleanSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Float2BooleanSortedMapcomparator in interface SortedMap<Float,Boolean>SortedMap.comparator()public Float2BooleanSortedMap headMap(float to)
Float2BooleanSortedMaptoKey.headMap in interface Float2BooleanSortedMapSortedMap.headMap(Object)public Float2BooleanSortedMap tailMap(float from)
Float2BooleanSortedMapfromKey.tailMap in interface Float2BooleanSortedMapSortedMap.tailMap(Object)public Float2BooleanSortedMap subMap(float from, float to)
Float2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Float2BooleanSortedMapSortedMap.subMap(Object,Object)public Float2BooleanRBTreeMap 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.