public class Char2ByteAVLTreeMap extends AbstractChar2ByteSortedMap 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.
AbstractChar2ByteSortedMap.KeySetIterator, AbstractChar2ByteSortedMap.ValuesCollection, AbstractChar2ByteSortedMap.ValuesIteratorAbstractChar2ByteMap.BasicEntry, AbstractChar2ByteMap.BasicEntrySetChar2ByteSortedMap.FastSortedEntrySetChar2ByteMap.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<Char2ByteMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.chars.Char2ByteAVLTreeMap.Entry |
firstEntry
The first key in this map.
|
protected CharSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.chars.Char2ByteAVLTreeMap.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.Char2ByteAVLTreeMap.Entry |
tree
A reference to the root entry.
|
protected ByteCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Char2ByteAVLTreeMap()
Creates a new empty tree map.
|
Char2ByteAVLTreeMap(char[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2ByteAVLTreeMap(char[] k,
byte[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2ByteAVLTreeMap(Char2ByteMap m)
Creates a new tree map copying a given map.
|
Char2ByteAVLTreeMap(Char2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2ByteAVLTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2ByteAVLTreeMap(Map<? extends Character,? extends Byte> m)
Creates a new tree map copying a given map.
|
Char2ByteAVLTreeMap(SortedMap<Character,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(char k,
byte incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Char2ByteMap.Entry> |
char2ByteEntrySet()
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).
|
Char2ByteAVLTreeMap |
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(byte 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.
|
byte |
get(char k)
Returns the value to which the given key is mapped.
|
Char2ByteSortedMap |
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.
|
byte |
put(char k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(char k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Char2ByteSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2ByteSortedMap |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ByteCollection |
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.Char2ByteAVLTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.chars.Char2ByteAVLTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.chars.Char2ByteAVLTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Char2ByteMap.Entry> entries
protected transient CharSortedSet keys
protected transient ByteCollection 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 Char2ByteAVLTreeMap()
public Char2ByteAVLTreeMap(Comparator<? super Character> c)
c - a (possibly type-specific) comparator.public Char2ByteAVLTreeMap(Map<? extends Character,? extends Byte> m)
m - a Map to be copied into the new tree map.public Char2ByteAVLTreeMap(SortedMap<Character,Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2ByteAVLTreeMap(Char2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Char2ByteAVLTreeMap(Char2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2ByteAVLTreeMap(char[] k,
byte[] 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 Char2ByteAVLTreeMap(char[] k,
byte[] 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 byte addTo(char k,
byte 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 byte put(char k,
byte v)
Char2ByteFunctionput in interface Char2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(char k)
Char2ByteFunctionremove in interface Char2ByteFunctionk - the key.Function.remove(Object)public boolean containsValue(byte v)
Char2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Char2ByteMapcontainsValue in class AbstractChar2ByteMapMap.containsValue(Object)public void clear()
Char2ByteMapclear in interface Char2ByteMapclear in interface Map<Character,Byte>Map.clear()public boolean containsKey(char k)
Char2ByteMapcontainsKey in interface Char2ByteFunctioncontainsKey in interface Char2ByteMapcontainsKey in class AbstractChar2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Char2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public byte get(char k)
Char2ByteFunctionget in interface Char2ByteFunctionk - the key.Function.get(Object)public char firstCharKey()
Char2ByteSortedMapfirstCharKey in interface Char2ByteSortedMapSortedMap.firstKey()public char lastCharKey()
Char2ByteSortedMaplastCharKey in interface Char2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2ByteMap.Entry> char2ByteEntrySet()
Char2ByteSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
char2ByteEntrySet in interface Char2ByteMapchar2ByteEntrySet in interface Char2ByteSortedMapChar2ByteSortedMap.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 Char2ByteMapkeySet in interface Char2ByteSortedMapkeySet in interface Map<Character,Byte>keySet in interface SortedMap<Character,Byte>keySet in class AbstractChar2ByteSortedMapMap.keySet()public ByteCollection 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 Char2ByteMapvalues in interface Char2ByteSortedMapvalues in interface Map<Character,Byte>values in interface SortedMap<Character,Byte>values in class AbstractChar2ByteSortedMapMap.values()public CharComparator comparator()
Char2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2ByteSortedMapcomparator in interface SortedMap<Character,Byte>SortedMap.comparator()public Char2ByteSortedMap headMap(char to)
Char2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Char2ByteSortedMapSortedMap.headMap(Object)public Char2ByteSortedMap tailMap(char from)
Char2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Char2ByteSortedMapSortedMap.tailMap(Object)public Char2ByteSortedMap subMap(char from, char to)
Char2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Char2ByteSortedMapSortedMap.subMap(Object,Object)public Char2ByteAVLTreeMap 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.