public class Int2ByteAVLTreeMap extends AbstractInt2ByteSortedMap implements java.io.Serializable, java.lang.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.
AbstractInt2ByteSortedMap.KeySetIterator, AbstractInt2ByteSortedMap.ValuesCollection, AbstractInt2ByteSortedMap.ValuesIteratorAbstractInt2ByteMap.BasicEntry, AbstractInt2ByteMap.BasicEntrySetInt2ByteSortedMap.FastSortedEntrySetInt2ByteMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected it.unimi.dsi.fastutil.ints.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 it.unimi.dsi.fastutil.objects.ObjectSortedSet<Int2ByteMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.ints.Int2ByteAVLTreeMap.Entry |
firstEntry
The first key in this map.
|
protected it.unimi.dsi.fastutil.ints.IntSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.ints.Int2ByteAVLTreeMap.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 java.util.Comparator<? super java.lang.Integer> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.ints.Int2ByteAVLTreeMap.Entry |
tree
A reference to the root entry.
|
protected it.unimi.dsi.fastutil.bytes.ByteCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Int2ByteAVLTreeMap()
Creates a new empty tree map.
|
Int2ByteAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ByteAVLTreeMap(int[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ByteAVLTreeMap(int[] k,
byte[] v,
java.util.Comparator<? super java.lang.Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2ByteAVLTreeMap(Int2ByteMap m)
Creates a new tree map copying a given map.
|
Int2ByteAVLTreeMap(Int2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2ByteAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Byte> m)
Creates a new tree map copying a given map.
|
Int2ByteAVLTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
byte |
addTo(int k,
byte incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2ByteAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
it.unimi.dsi.fastutil.ints.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(byte 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.
|
byte |
get(int k) |
Int2ByteSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
it.unimi.dsi.fastutil.objects.ObjectSortedSet<Int2ByteMap.Entry> |
int2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
it.unimi.dsi.fastutil.ints.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.
|
byte |
put(int k,
byte v) |
byte |
remove(int k) |
int |
size()
Returns the number of key/value mappings in this map.
|
Int2ByteSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2ByteSortedMap |
tailMap(int from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
it.unimi.dsi.fastutil.bytes.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, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeByte, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceandThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortprotected transient it.unimi.dsi.fastutil.ints.Int2ByteAVLTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.ints.Int2ByteAVLTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.ints.Int2ByteAVLTreeMap.Entry lastEntry
protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<Int2ByteMap.Entry> entries
protected transient it.unimi.dsi.fastutil.ints.IntSortedSet keys
protected transient it.unimi.dsi.fastutil.bytes.ByteCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected java.util.Comparator<? super java.lang.Integer> storedComparator
protected transient it.unimi.dsi.fastutil.ints.IntComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Int2ByteAVLTreeMap()
public Int2ByteAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c - a (possibly type-specific) comparator.public Int2ByteAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Byte> m)
m - a Map to be copied into the new tree map.public Int2ByteAVLTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Byte> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2ByteAVLTreeMap(Int2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Int2ByteAVLTreeMap(Int2ByteSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2ByteAVLTreeMap(int[] k,
byte[] v,
java.util.Comparator<? super java.lang.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.java.lang.IllegalArgumentException - if k and v have different lengths.public Int2ByteAVLTreeMap(int[] k,
byte[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.java.lang.IllegalArgumentException - if k and v have different lengths.public byte addTo(int 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(int k,
byte v)
put in interface it.unimi.dsi.fastutil.ints.Int2ByteFunctionpublic byte remove(int k)
remove in interface it.unimi.dsi.fastutil.ints.Int2ByteFunctionpublic boolean containsValue(byte v)
AbstractInt2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2ByteMapcontainsValue in class AbstractInt2ByteMapMap.containsValue(Object)public void clear()
Int2ByteMapclear in interface Int2ByteMapclear in interface java.util.Map<java.lang.Integer,java.lang.Byte>public boolean containsKey(int k)
AbstractInt2ByteMapcontainsKey in interface it.unimi.dsi.fastutil.ints.Int2ByteFunctioncontainsKey in interface Int2ByteMapcontainsKey in class AbstractInt2ByteMapk - the key.key.Map.containsKey(Object)public int size()
Int2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.size in interface Int2ByteMapsize in interface java.util.Map<java.lang.Integer,java.lang.Byte>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Integer,java.lang.Byte>isEmpty in class AbstractInt2ByteMappublic byte get(int k)
get in interface it.unimi.dsi.fastutil.ints.Int2ByteFunctionpublic int firstIntKey()
Int2ByteSortedMapfirstIntKey in interface Int2ByteSortedMapSortedMap.firstKey()public int lastIntKey()
Int2ByteSortedMaplastIntKey in interface Int2ByteSortedMapSortedMap.lastKey()public it.unimi.dsi.fastutil.objects.ObjectSortedSet<Int2ByteMap.Entry> int2ByteEntrySet()
Int2ByteSortedMapint2ByteEntrySet in interface Int2ByteMapint2ByteEntrySet in interface Int2ByteSortedMapInt2ByteSortedMap.entrySet()public it.unimi.dsi.fastutil.ints.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 Int2ByteMapkeySet in interface Int2ByteSortedMapkeySet in interface java.util.Map<java.lang.Integer,java.lang.Byte>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>keySet in class AbstractInt2ByteSortedMapMap.keySet()public it.unimi.dsi.fastutil.bytes.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 Int2ByteMapvalues in interface Int2ByteSortedMapvalues in interface java.util.Map<java.lang.Integer,java.lang.Byte>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>values in class AbstractInt2ByteSortedMapMap.values()public it.unimi.dsi.fastutil.ints.IntComparator comparator()
Int2ByteSortedMapcomparator in interface Int2ByteSortedMapcomparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Byte>SortedMap.comparator()public Int2ByteSortedMap headMap(int to)
Int2ByteSortedMaptoKey.headMap in interface Int2ByteSortedMapSortedMap.headMap(Object)public Int2ByteSortedMap tailMap(int from)
Int2ByteSortedMapfromKey.tailMap in interface Int2ByteSortedMapSortedMap.tailMap(Object)public Int2ByteSortedMap subMap(int from, int to)
Int2ByteSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2ByteSortedMapSortedMap.subMap(Object,Object)public Int2ByteAVLTreeMap 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.
clone in class java.lang.Object