public class Object2IntAVLTreeMap<K> extends AbstractObject2IntSortedMap<K> 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.
AbstractObject2IntMap.BasicEntry<K>, AbstractObject2IntMap.BasicEntrySet<K>Object2IntSortedMap.FastSortedEntrySet<K>Object2IntMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2IntAVLTreeMap()
Creates a new empty tree map.
|
Object2IntAVLTreeMap(java.util.Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2IntAVLTreeMap(K[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2IntAVLTreeMap(K[] k,
int[] v,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Object2IntAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Integer> m)
Creates a new tree map copying a given map.
|
Object2IntAVLTreeMap(Object2IntMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2IntAVLTreeMap(Object2IntSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2IntAVLTreeMap(java.util.SortedMap<K,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(K 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).
|
Object2IntAVLTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses
its keys' natural ordering.
|
boolean |
containsKey(java.lang.Object 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. |
K |
firstKey() |
int |
getInt(java.lang.Object k)
Returns the value to which the given key is mapped.
|
Object2IntSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less
than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
ObjectSortedSet<Object2IntMap.Entry<K>> |
object2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
int |
put(K k,
int v)
Adds a pair to the map (optional operation).
|
int |
removeInt(java.lang.Object k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Object2IntSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2IntSortedMap<K> |
tailMap(K 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, defaultReturnValueentrySetcomputeInt, computeIntIfAbsent, computeIntIfAbsentPartial, computeIntIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntpublic Object2IntAVLTreeMap()
public Object2IntAVLTreeMap(java.util.Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2IntAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Integer> m)
m - a Map to be copied into the new tree map.public Object2IntAVLTreeMap(java.util.SortedMap<K,java.lang.Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2IntAVLTreeMap(Object2IntMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2IntAVLTreeMap(Object2IntSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2IntAVLTreeMap(K[] k, int[] v, java.util.Comparator<? super K> 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 Object2IntAVLTreeMap(K[] 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(K 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(K k, int v)
Object2IntFunctionput in interface Object2IntFunction<K>k - the key.v - the value.Function.put(Object,Object)public int removeInt(java.lang.Object k)
Object2IntFunctionremoveInt in interface Object2IntFunction<K>k - the key.Function.remove(Object)public boolean containsValue(int v)
Object2IntMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Object2IntMap<K>containsValue in class AbstractObject2IntMap<K>Map.containsValue(Object)public void clear()
Object2IntMapclear in interface Object2IntMap<K>clear in interface java.util.Map<K,java.lang.Integer>Map.clear()public boolean containsKey(java.lang.Object k)
Object2IntMapcontainsKey in interface Object2IntMap<K>containsKey in interface java.util.Map<K,java.lang.Integer>containsKey in class AbstractObject2IntMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2IntMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.size in interface Object2IntMap<K>size in interface java.util.Map<K,java.lang.Integer>Size64public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Integer>isEmpty in class AbstractObject2IntMap<K>public int getInt(java.lang.Object k)
Object2IntFunctiongetInt in interface Object2IntFunction<K>k - the key.Function.get(Object)public K firstKey()
firstKey in interface java.util.SortedMap<K,java.lang.Integer>public K lastKey()
lastKey in interface java.util.SortedMap<K,java.lang.Integer>public ObjectSortedSet<Object2IntMap.Entry<K>> object2IntEntrySet()
Object2IntSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
object2IntEntrySet in interface Object2IntMap<K>object2IntEntrySet in interface Object2IntSortedMap<K>Object2IntSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2IntMap<K>keySet in interface Object2IntSortedMap<K>keySet in interface java.util.Map<K,java.lang.Integer>keySet in interface java.util.SortedMap<K,java.lang.Integer>keySet in class AbstractObject2IntSortedMap<K>Map.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 Object2IntMap<K>values in interface Object2IntSortedMap<K>values in interface java.util.Map<K,java.lang.Integer>values in interface java.util.SortedMap<K,java.lang.Integer>values in class AbstractObject2IntSortedMap<K>Map.values()public java.util.Comparator<? super K> comparator()
Object2IntSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2IntSortedMap<K>comparator in interface java.util.SortedMap<K,java.lang.Integer>SortedMap.comparator()public Object2IntSortedMap<K> headMap(K to)
Object2IntSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Object2IntSortedMap<K>headMap in interface java.util.SortedMap<K,java.lang.Integer>SortedMap.headMap(Object)public Object2IntSortedMap<K> tailMap(K from)
Object2IntSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Object2IntSortedMap<K>tailMap in interface java.util.SortedMap<K,java.lang.Integer>SortedMap.tailMap(Object)public Object2IntSortedMap<K> subMap(K from, K to)
Object2IntSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Object2IntSortedMap<K>subMap in interface java.util.SortedMap<K,java.lang.Integer>SortedMap.subMap(Object,Object)public Object2IntAVLTreeMap<K> 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