public class Int2IntAVLTreeMap extends AbstractInt2IntSortedMap 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.
AbstractInt2IntMap.BasicEntry, AbstractInt2IntMap.BasicEntrySetInt2IntSortedMap.FastSortedEntrySetInt2IntMap.FastEntrySet| Constructor and Description |
|---|
Int2IntAVLTreeMap()
Creates a new empty tree map.
|
Int2IntAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2IntAVLTreeMap(int[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2IntAVLTreeMap(int[] k,
int[] 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.
|
Int2IntAVLTreeMap(Int2IntMap m)
Creates a new tree map copying a given map.
|
Int2IntAVLTreeMap(Int2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2IntAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> m)
Creates a new tree map copying a given map.
|
Int2IntAVLTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(int k,
int incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2IntAVLTreeMap |
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(int 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.
|
int |
get(int k)
Returns the value to which the given key is mapped.
|
Int2IntSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less
than
toKey. |
ObjectSortedSet<Int2IntMap.Entry> |
int2IntEntrySet()
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.
|
int |
put(int k,
int v)
Adds a pair to the map (optional operation).
|
int |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Int2IntSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2IntSortedMap |
tailMap(int from)
Returns a view of the portion of this sorted map whose keys are greater than
or equal to
fromKey. |
IntCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValueentrySet, 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, replaceapplyAsIntpublic Int2IntAVLTreeMap()
public Int2IntAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c - a (possibly type-specific) comparator.public Int2IntAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> m)
m - a Map to be copied into the new tree map.public Int2IntAVLTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2IntAVLTreeMap(Int2IntMap m)
m - a type-specific map to be copied into the new tree map.public Int2IntAVLTreeMap(Int2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2IntAVLTreeMap(int[] k,
int[] 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 Int2IntAVLTreeMap(int[] k,
int[] 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 int addTo(int k,
int 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 int put(int k,
int v)
Int2IntFunctionput in interface Int2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(int k)
Int2IntFunctionremove in interface Int2IntFunctionk - the key.Function.remove(Object)public boolean containsValue(int v)
Int2IntMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Int2IntMapcontainsValue in class AbstractInt2IntMapMap.containsValue(Object)public void clear()
Int2IntMapclear in interface Int2IntMapclear in interface java.util.Map<java.lang.Integer,java.lang.Integer>Map.clear()public boolean containsKey(int k)
Int2IntMapcontainsKey in interface Int2IntFunctioncontainsKey in interface Int2IntMapcontainsKey in class AbstractInt2IntMapk - the key.key.Map.containsKey(Object)public int size()
Int2IntMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.size in interface Int2IntMapsize in interface java.util.Map<java.lang.Integer,java.lang.Integer>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Integer,java.lang.Integer>isEmpty in class AbstractInt2IntMappublic int get(int k)
Int2IntFunctionget in interface Int2IntFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2IntSortedMapfirstIntKey in interface Int2IntSortedMapSortedMap.firstKey()public int lastIntKey()
Int2IntSortedMaplastIntKey in interface Int2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2IntMap.Entry> int2IntEntrySet()
Int2IntSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2IntEntrySet in interface Int2IntMapint2IntEntrySet in interface Int2IntSortedMapInt2IntSortedMap.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 Int2IntMapkeySet in interface Int2IntSortedMapkeySet in interface java.util.Map<java.lang.Integer,java.lang.Integer>keySet in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>keySet in class AbstractInt2IntSortedMapMap.keySet()public IntCollection 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 Int2IntMapvalues in interface Int2IntSortedMapvalues in interface java.util.Map<java.lang.Integer,java.lang.Integer>values in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>values in class AbstractInt2IntSortedMapMap.values()public IntComparator comparator()
Int2IntSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Int2IntSortedMapcomparator in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>SortedMap.comparator()public Int2IntSortedMap headMap(int to)
Int2IntSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Int2IntSortedMapSortedMap.headMap(Object)public Int2IntSortedMap tailMap(int from)
Int2IntSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Int2IntSortedMapSortedMap.tailMap(Object)public Int2IntSortedMap subMap(int from, int to)
Int2IntSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Int2IntSortedMapSortedMap.subMap(Object,Object)public Int2IntAVLTreeMap 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