public class Char2CharRBTreeMap extends AbstractChar2CharSortedMap 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.
AbstractChar2CharSortedMap.KeySetIterator, AbstractChar2CharSortedMap.ValuesCollection, AbstractChar2CharSortedMap.ValuesIteratorAbstractChar2CharMap.BasicEntry, AbstractChar2CharMap.BasicEntrySetChar2CharSortedMap.FastSortedEntrySetChar2CharMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected CharComparator |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected ObjectSortedSet<Char2CharMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected CharSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap.Entry |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected Comparator<? super Character> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected CharCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Char2CharRBTreeMap()
Creates a new empty tree map.
|
Char2CharRBTreeMap(char[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2CharRBTreeMap(char[] k,
char[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2CharRBTreeMap(Char2CharMap m)
Creates a new tree map copying a given map.
|
Char2CharRBTreeMap(Char2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2CharRBTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2CharRBTreeMap(Map<? extends Character,? extends Character> m)
Creates a new tree map copying a given map.
|
Char2CharRBTreeMap(SortedMap<Character,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(char k,
char incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Char2CharMap.Entry> |
char2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Char2CharRBTreeMap |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(char v)
Returns
true if this map maps one or more keys to the specified value. |
char |
firstCharKey()
Returns the first (lowest) key currently in this map.
|
char |
get(char k)
Returns the value to which the given key is mapped.
|
Char2CharSortedMap |
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()
Returns the last (highest) key currently in this map.
|
char |
put(char k,
char v)
Adds a pair to the map (optional operation).
|
char |
remove(char k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Char2CharSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2CharSortedMap |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
CharCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntandThen, compose, identityprotected transient it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.chars.Char2CharRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Char2CharMap.Entry> entries
protected transient CharSortedSet keys
protected transient CharCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Character> storedComparator
protected transient CharComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Char2CharRBTreeMap()
public Char2CharRBTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2CharRBTreeMap(Map<? extends Character,? extends Character> m)
m - a Map to be copied into the new tree map.public Char2CharRBTreeMap(SortedMap<Character,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2CharRBTreeMap(Char2CharMap m)
m - a type-specific map to be copied into the new tree map.public Char2CharRBTreeMap(Char2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2CharRBTreeMap(char[] k,
char[] 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 Char2CharRBTreeMap(char[] k,
char[] 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 char addTo(char k,
char 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 char put(char k,
char v)
Char2CharFunctionput in interface Char2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(char k)
Char2CharFunctionremove in interface Char2CharFunctionk - the key.Function.remove(Object)public boolean containsValue(char v)
Char2CharMaptrue if this map maps one or more keys to the specified value.containsValue in interface Char2CharMapcontainsValue in class AbstractChar2CharMapMap.containsValue(Object)public void clear()
Char2CharMapclear in interface Char2CharMapclear in interface Map<Character,Character>Map.clear()public boolean containsKey(char k)
Char2CharMapcontainsKey in interface Char2CharFunctioncontainsKey in interface Char2CharMapcontainsKey in class AbstractChar2CharMapk - the key.key.Map.containsKey(Object)public int size()
Char2CharMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public char get(char k)
Char2CharFunctionget in interface Char2CharFunctionk - the key.Function.get(Object)public char firstCharKey()
Char2CharSortedMapfirstCharKey in interface Char2CharSortedMapSortedMap.firstKey()public char lastCharKey()
Char2CharSortedMaplastCharKey in interface Char2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2CharMap.Entry> char2CharEntrySet()
Char2CharSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
char2CharEntrySet in interface Char2CharMapchar2CharEntrySet in interface Char2CharSortedMapChar2CharSortedMap.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 Char2CharMapkeySet in interface Char2CharSortedMapkeySet in interface Map<Character,Character>keySet in interface SortedMap<Character,Character>keySet in class AbstractChar2CharSortedMapMap.keySet()public CharCollection 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 Char2CharMapvalues in interface Char2CharSortedMapvalues in interface Map<Character,Character>values in interface SortedMap<Character,Character>values in class AbstractChar2CharSortedMapMap.values()public CharComparator comparator()
Char2CharSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2CharSortedMapcomparator in interface SortedMap<Character,Character>SortedMap.comparator()public Char2CharSortedMap headMap(char to)
Char2CharSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Char2CharSortedMapSortedMap.headMap(Object)public Char2CharSortedMap tailMap(char from)
Char2CharSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Char2CharSortedMapSortedMap.tailMap(Object)public Char2CharSortedMap subMap(char from, char to)
Char2CharSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Char2CharSortedMapSortedMap.subMap(Object,Object)public Char2CharRBTreeMap 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.
Copyright © 2020. All rights reserved.