public class Char2ReferenceAVLTreeMap<V> extends AbstractChar2ReferenceSortedMap<V> 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.
AbstractChar2ReferenceSortedMap.KeySetIterator<V>, AbstractChar2ReferenceSortedMap.ValuesCollection, AbstractChar2ReferenceSortedMap.ValuesIterator<V>AbstractChar2ReferenceMap.BasicEntry<V>, AbstractChar2ReferenceMap.BasicEntrySet<V>Char2ReferenceSortedMap.FastSortedEntrySet<V>Char2ReferenceMap.FastEntrySet<V>| 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<Char2ReferenceMap.Entry<V>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.chars.Char2ReferenceAVLTreeMap.Entry<V> |
firstEntry
The first key in this map.
|
protected CharSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.chars.Char2ReferenceAVLTreeMap.Entry<V> |
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.Char2ReferenceAVLTreeMap.Entry<V> |
tree
A reference to the root entry.
|
protected ReferenceCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Char2ReferenceAVLTreeMap()
Creates a new empty tree map.
|
Char2ReferenceAVLTreeMap(char[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2ReferenceAVLTreeMap(char[] k,
V[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2ReferenceAVLTreeMap(Char2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map.
|
Char2ReferenceAVLTreeMap(Char2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2ReferenceAVLTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2ReferenceAVLTreeMap(Map<? extends Character,? extends V> m)
Creates a new tree map copying a given map.
|
Char2ReferenceAVLTreeMap(SortedMap<Character,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Char2ReferenceMap.Entry<V>> |
char2ReferenceEntrySet()
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).
|
Char2ReferenceAVLTreeMap<V> |
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(Object v) |
char |
firstCharKey()
Returns the first (lowest) key currently in this map.
|
V |
get(char k)
Returns the value to which the given key is mapped.
|
Char2ReferenceSortedMap<V> |
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.
|
V |
put(char k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(char k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Char2ReferenceSortedMap<V> |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2ReferenceSortedMap<V> |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ReferenceCollection<V> |
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, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyprotected transient it.unimi.dsi.fastutil.chars.Char2ReferenceAVLTreeMap.Entry<V> tree
protected int count
protected transient it.unimi.dsi.fastutil.chars.Char2ReferenceAVLTreeMap.Entry<V> firstEntry
protected transient it.unimi.dsi.fastutil.chars.Char2ReferenceAVLTreeMap.Entry<V> lastEntry
protected transient ObjectSortedSet<Char2ReferenceMap.Entry<V>> entries
protected transient CharSortedSet keys
protected transient ReferenceCollection<V> 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 Char2ReferenceAVLTreeMap()
public Char2ReferenceAVLTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2ReferenceAVLTreeMap(Map<? extends Character,? extends V> m)
m - a Map to be copied into the new tree map.public Char2ReferenceAVLTreeMap(SortedMap<Character,V> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2ReferenceAVLTreeMap(Char2ReferenceMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Char2ReferenceAVLTreeMap(Char2ReferenceSortedMap<V> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2ReferenceAVLTreeMap(char[] k,
V[] 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 Char2ReferenceAVLTreeMap(char[] k,
V[] 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 V put(char k, V v)
Char2ReferenceFunctionput in interface Char2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(char k)
Char2ReferenceFunctionremove in interface Char2ReferenceFunction<V>k - the key.Function.remove(Object)public boolean containsValue(Object v)
containsValue in interface Map<Character,V>containsValue in class AbstractChar2ReferenceMap<V>public void clear()
Char2ReferenceMapclear in interface Char2ReferenceMap<V>clear in interface Map<Character,V>Map.clear()public boolean containsKey(char k)
Char2ReferenceMapcontainsKey in interface Char2ReferenceFunction<V>containsKey in interface Char2ReferenceMap<V>containsKey in class AbstractChar2ReferenceMap<V>k - the key.key.Map.containsKey(Object)public int size()
Char2ReferenceMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public V get(char k)
Char2ReferenceFunctionget in interface Char2ReferenceFunction<V>k - the key.Function.get(Object)public char firstCharKey()
Char2ReferenceSortedMapfirstCharKey in interface Char2ReferenceSortedMap<V>SortedMap.firstKey()public char lastCharKey()
Char2ReferenceSortedMaplastCharKey in interface Char2ReferenceSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Char2ReferenceMap.Entry<V>> char2ReferenceEntrySet()
Char2ReferenceSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
char2ReferenceEntrySet in interface Char2ReferenceMap<V>char2ReferenceEntrySet in interface Char2ReferenceSortedMap<V>Char2ReferenceSortedMap.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 Char2ReferenceMap<V>keySet in interface Char2ReferenceSortedMap<V>keySet in interface Map<Character,V>keySet in interface SortedMap<Character,V>keySet in class AbstractChar2ReferenceSortedMap<V>Map.keySet()public ReferenceCollection<V> 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 Char2ReferenceMap<V>values in interface Char2ReferenceSortedMap<V>values in interface Map<Character,V>values in interface SortedMap<Character,V>values in class AbstractChar2ReferenceSortedMap<V>Map.values()public CharComparator comparator()
Char2ReferenceSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2ReferenceSortedMap<V>comparator in interface SortedMap<Character,V>SortedMap.comparator()public Char2ReferenceSortedMap<V> headMap(char to)
Char2ReferenceSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Char2ReferenceSortedMap<V>SortedMap.headMap(Object)public Char2ReferenceSortedMap<V> tailMap(char from)
Char2ReferenceSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Char2ReferenceSortedMap<V>SortedMap.tailMap(Object)public Char2ReferenceSortedMap<V> subMap(char from, char to)
Char2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Char2ReferenceSortedMap<V>SortedMap.subMap(Object,Object)public Char2ReferenceAVLTreeMap<V> 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.