public class Int2CharRBTreeMap extends AbstractInt2CharSortedMap 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.
AbstractInt2CharSortedMap.KeySetIterator, AbstractInt2CharSortedMap.ValuesCollection, AbstractInt2CharSortedMap.ValuesIteratorAbstractInt2CharMap.BasicEntry, AbstractInt2CharMap.BasicEntrySetInt2CharSortedMap.FastSortedEntrySetInt2CharMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected IntComparator |
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<Int2CharMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.ints.Int2CharRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected IntSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.ints.Int2CharRBTreeMap.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 Integer> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.ints.Int2CharRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected CharCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Int2CharRBTreeMap()
Creates a new empty tree map.
|
Int2CharRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2CharRBTreeMap(int[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2CharRBTreeMap(int[] k,
char[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2CharRBTreeMap(Int2CharMap m)
Creates a new tree map copying a given map.
|
Int2CharRBTreeMap(Int2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2CharRBTreeMap(Map<? extends Integer,? extends Character> m)
Creates a new tree map copying a given map.
|
Int2CharRBTreeMap(SortedMap<Integer,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
char |
addTo(int k,
char incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2CharRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(int 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. |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
char |
get(int k)
Returns the value to which the given key is mapped.
|
Int2CharSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
ObjectSortedSet<Int2CharMap.Entry> |
int2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey()
Returns the last (highest) key currently in this map.
|
char |
put(int k,
char v)
Adds a pair to the map (optional operation).
|
char |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Int2CharSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2CharSortedMap |
tailMap(int 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.ints.Int2CharRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.ints.Int2CharRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.ints.Int2CharRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Int2CharMap.Entry> entries
protected transient IntSortedSet 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 Integer> storedComparator
protected transient IntComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Int2CharRBTreeMap()
public Int2CharRBTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2CharRBTreeMap(Map<? extends Integer,? extends Character> m)
m - a Map to be copied into the new tree map.public Int2CharRBTreeMap(SortedMap<Integer,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2CharRBTreeMap(Int2CharMap m)
m - a type-specific map to be copied into the new tree map.public Int2CharRBTreeMap(Int2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2CharRBTreeMap(int[] k,
char[] v,
Comparator<? super Integer> 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 Int2CharRBTreeMap(int[] 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(int 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(int k,
char v)
Int2CharFunctionput in interface Int2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(int k)
Int2CharFunctionremove in interface Int2CharFunctionk - the key.Function.remove(Object)public boolean containsValue(char v)
Int2CharMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2CharMapcontainsValue in class AbstractInt2CharMapMap.containsValue(Object)public void clear()
Int2CharMapclear in interface Int2CharMapclear in interface Map<Integer,Character>Map.clear()public boolean containsKey(int k)
Int2CharMapcontainsKey in interface Int2CharFunctioncontainsKey in interface Int2CharMapcontainsKey in class AbstractInt2CharMapk - the key.key.Map.containsKey(Object)public int size()
Int2CharMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public char get(int k)
Int2CharFunctionget in interface Int2CharFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2CharSortedMapfirstIntKey in interface Int2CharSortedMapSortedMap.firstKey()public int lastIntKey()
Int2CharSortedMaplastIntKey in interface Int2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2CharMap.Entry> int2CharEntrySet()
Int2CharSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2CharEntrySet in interface Int2CharMapint2CharEntrySet in interface Int2CharSortedMapInt2CharSortedMap.entrySet()public IntSortedSet 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 Int2CharMapkeySet in interface Int2CharSortedMapkeySet in interface Map<Integer,Character>keySet in interface SortedMap<Integer,Character>keySet in class AbstractInt2CharSortedMapMap.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 Int2CharMapvalues in interface Int2CharSortedMapvalues in interface Map<Integer,Character>values in interface SortedMap<Integer,Character>values in class AbstractInt2CharSortedMapMap.values()public IntComparator comparator()
Int2CharSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Int2CharSortedMapcomparator in interface SortedMap<Integer,Character>SortedMap.comparator()public Int2CharSortedMap headMap(int to)
Int2CharSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Int2CharSortedMapSortedMap.headMap(Object)public Int2CharSortedMap tailMap(int from)
Int2CharSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Int2CharSortedMapSortedMap.tailMap(Object)public Int2CharSortedMap subMap(int from, int to)
Int2CharSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Int2CharSortedMapSortedMap.subMap(Object,Object)public Int2CharRBTreeMap 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.