public class Char2FloatRBTreeMap extends AbstractChar2FloatSortedMap 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.
AbstractChar2FloatMap.BasicEntryChar2FloatSortedMap.FastSortedEntrySetChar2FloatMap.FastEntrySet| Constructor and Description |
|---|
Char2FloatRBTreeMap()
Creates a new empty tree map.
|
Char2FloatRBTreeMap(char[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2FloatRBTreeMap(char[] k,
float[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Char2FloatRBTreeMap(Char2FloatMap m)
Creates a new tree map copying a given map.
|
Char2FloatRBTreeMap(Char2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2FloatRBTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2FloatRBTreeMap(Map<? extends Character,? extends Float> m)
Creates a new tree map copying a given map.
|
Char2FloatRBTreeMap(SortedMap<Character,Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
float |
addTo(char k,
float incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Char2FloatMap.Entry> |
char2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2FloatRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
CharComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(char k)
Checks whether the given value is contained in
AbstractChar2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractChar2FloatMap.values(). |
char |
firstCharKey() |
float |
get(char k)
Returns the value to which the given key is mapped.
|
Char2FloatSortedMap |
headMap(char to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
CharSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
char |
lastCharKey() |
Float |
put(Character ok,
Float ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
float |
put(char k,
float v)
Adds a pair to the map.
|
float |
remove(char k)
Removes the mapping with the given key.
|
Float |
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.
|
Char2FloatSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2FloatSortedMap |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
FloatCollection |
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 Char2FloatRBTreeMap()
public Char2FloatRBTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2FloatRBTreeMap(Map<? extends Character,? extends Float> m)
m - a Map to be copied into the new tree map.public Char2FloatRBTreeMap(SortedMap<Character,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2FloatRBTreeMap(Char2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Char2FloatRBTreeMap(Char2FloatSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2FloatRBTreeMap(char[] k,
float[] v,
Comparator<? super Character> 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 Char2FloatRBTreeMap(char[] k,
float[] 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 float addTo(char k,
float incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public float put(char k,
float v)
Char2FloatFunctionput in interface Char2FloatFunctionput in class AbstractChar2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(char k)
Char2FloatFunctionremove in interface Char2FloatFunctionremove in class AbstractChar2FloatFunctionk - the key.Function.remove(Object)@Deprecated public Float put(Character ok, Float 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<Character,Float>put in interface Map<Character,Float>put in class AbstractChar2FloatFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Float 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(float v)
AbstractChar2FloatMapAbstractChar2FloatMap.values().containsValue in interface Char2FloatMapcontainsValue in class AbstractChar2FloatMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(char k)
AbstractChar2FloatMapAbstractChar2FloatMap.keySet().containsKey in interface Char2FloatFunctioncontainsKey in class AbstractChar2FloatMapFunction.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 float get(char k)
Char2FloatFunctionget in interface Char2FloatFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2FloatSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2FloatMap.Entry> char2FloatEntrySet()
Char2FloatSortedMapchar2FloatEntrySet in interface Char2FloatMapchar2FloatEntrySet in interface Char2FloatSortedMapChar2FloatSortedMap.entrySet()public CharSortedSet 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 Char2FloatMapkeySet in interface Char2FloatSortedMapkeySet in interface Map<Character,Float>keySet in interface SortedMap<Character,Float>keySet in class AbstractChar2FloatSortedMapMap.keySet()public FloatCollection 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 Char2FloatMapvalues in interface Char2FloatSortedMapvalues in interface Map<Character,Float>values in interface SortedMap<Character,Float>values in class AbstractChar2FloatSortedMapMap.values()public CharComparator comparator()
Char2FloatSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Char2FloatSortedMapcomparator in interface SortedMap<Character,Float>SortedMap.comparator()public Char2FloatSortedMap headMap(char to)
Char2FloatSortedMaptoKey.headMap in interface Char2FloatSortedMapSortedMap.headMap(Object)public Char2FloatSortedMap tailMap(char from)
Char2FloatSortedMapfromKey.tailMap in interface Char2FloatSortedMapSortedMap.tailMap(Object)public Char2FloatSortedMap subMap(char from, char to)
Char2FloatSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2FloatSortedMapSortedMap.subMap(Object,Object)public Char2FloatRBTreeMap 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.