public class Char2BooleanRBTreeMap extends AbstractChar2BooleanSortedMap 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.
AbstractChar2BooleanMap.BasicEntryChar2BooleanSortedMap.FastSortedEntrySetChar2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Char2BooleanRBTreeMap()
Creates a new empty tree map.
|
Char2BooleanRBTreeMap(char[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2BooleanRBTreeMap(char[] k,
boolean[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Char2BooleanRBTreeMap(Char2BooleanMap m)
Creates a new tree map copying a given map.
|
Char2BooleanRBTreeMap(Char2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2BooleanRBTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2BooleanRBTreeMap(Map<? extends Character,? extends Boolean> m)
Creates a new tree map copying a given map.
|
Char2BooleanRBTreeMap(SortedMap<Character,Boolean> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Char2BooleanMap.Entry> |
char2BooleanEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2BooleanRBTreeMap |
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
AbstractChar2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractChar2BooleanMap.values(). |
char |
firstCharKey() |
boolean |
get(char k)
Returns the value to which the given key is mapped.
|
Char2BooleanSortedMap |
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() |
Boolean |
put(Character ok,
Boolean ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
boolean |
put(char k,
boolean v)
Adds a pair to the map.
|
boolean |
remove(char 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.
|
Char2BooleanSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2BooleanSortedMap |
tailMap(char 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 Char2BooleanRBTreeMap()
public Char2BooleanRBTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2BooleanRBTreeMap(Map<? extends Character,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Char2BooleanRBTreeMap(SortedMap<Character,Boolean> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2BooleanRBTreeMap(Char2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Char2BooleanRBTreeMap(Char2BooleanSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2BooleanRBTreeMap(char[] k,
boolean[] 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 Char2BooleanRBTreeMap(char[] 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(char k,
boolean v)
Char2BooleanFunctionput in interface Char2BooleanFunctionput in class AbstractChar2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(char k)
Char2BooleanFunctionremove in interface Char2BooleanFunctionremove in class AbstractChar2BooleanFunctionk - the key.Function.remove(Object)@Deprecated public Boolean put(Character 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<Character,Boolean>put in interface Map<Character,Boolean>put in class AbstractChar2BooleanFunctionok - 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.
remove in interface Function<Character,Boolean>remove in interface Map<Character,Boolean>remove in class AbstractChar2BooleanFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(boolean v)
AbstractChar2BooleanMapAbstractChar2BooleanMap.values().containsValue in interface Char2BooleanMapcontainsValue in class AbstractChar2BooleanMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(char k)
AbstractChar2BooleanMapAbstractChar2BooleanMap.keySet().containsKey in interface Char2BooleanFunctioncontainsKey in class AbstractChar2BooleanMapFunction.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(char k)
Char2BooleanFunctionget in interface Char2BooleanFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2BooleanSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2BooleanMap.Entry> char2BooleanEntrySet()
Char2BooleanSortedMapchar2BooleanEntrySet in interface Char2BooleanMapchar2BooleanEntrySet in interface Char2BooleanSortedMapChar2BooleanSortedMap.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 Char2BooleanMapkeySet in interface Char2BooleanSortedMapkeySet in interface Map<Character,Boolean>keySet in interface SortedMap<Character,Boolean>keySet in class AbstractChar2BooleanSortedMapMap.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 Char2BooleanMapvalues in interface Char2BooleanSortedMapvalues in interface Map<Character,Boolean>values in interface SortedMap<Character,Boolean>values in class AbstractChar2BooleanSortedMapMap.values()public CharComparator comparator()
Char2BooleanSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Char2BooleanSortedMapcomparator in interface SortedMap<Character,Boolean>SortedMap.comparator()public Char2BooleanSortedMap headMap(char to)
Char2BooleanSortedMaptoKey.headMap in interface Char2BooleanSortedMapSortedMap.headMap(Object)public Char2BooleanSortedMap tailMap(char from)
Char2BooleanSortedMapfromKey.tailMap in interface Char2BooleanSortedMapSortedMap.tailMap(Object)public Char2BooleanSortedMap subMap(char from, char to)
Char2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2BooleanSortedMapSortedMap.subMap(Object,Object)public Char2BooleanRBTreeMap 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.