public class Int2ObjectAVLTreeMap<V> extends AbstractInt2ObjectSortedMap<V> 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.
AbstractInt2ObjectMap.BasicEntry<V>, AbstractInt2ObjectMap.BasicEntrySet<V>
Int2ObjectSortedMap.FastSortedEntrySet<V>
Int2ObjectMap.FastEntrySet<V>
Constructor and Description |
---|
Int2ObjectAVLTreeMap()
Creates a new empty tree map.
|
Int2ObjectAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ObjectAVLTreeMap(int[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ObjectAVLTreeMap(int[] k,
V[] 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.
|
Int2ObjectAVLTreeMap(Int2ObjectMap<? extends V> m)
Creates a new tree map copying a given map.
|
Int2ObjectAVLTreeMap(Int2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Int2ObjectAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends V> m)
Creates a new tree map copying a given map.
|
Int2ObjectAVLTreeMap(java.util.SortedMap<java.lang.Integer,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2ObjectAVLTreeMap<V> |
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(java.lang.Object v) |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
V |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ObjectSortedMap<V> |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
ObjectSortedSet<Int2ObjectMap.Entry<V>> |
int2ObjectEntrySet()
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.
|
V |
put(int k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Int2ObjectSortedMap<V> |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Int2ObjectSortedMap<V> |
tailMap(int from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
entrySet, firstKey, headMap, lastKey, subMap, tailMap
compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Int2ObjectAVLTreeMap()
public Int2ObjectAVLTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c
- a (possibly type-specific) comparator.public Int2ObjectAVLTreeMap(java.util.Map<? extends java.lang.Integer,? extends V> m)
m
- a Map
to be copied into the new tree map.public Int2ObjectAVLTreeMap(java.util.SortedMap<java.lang.Integer,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2ObjectAVLTreeMap(Int2ObjectMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Int2ObjectAVLTreeMap(Int2ObjectSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2ObjectAVLTreeMap(int[] k, V[] 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 Int2ObjectAVLTreeMap(int[] k, V[] 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 V put(int k, V v)
Int2ObjectFunction
put
in interface Int2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(int k)
Int2ObjectFunction
remove
in interface Int2ObjectFunction<V>
k
- the key.Function.remove(Object)
public boolean containsValue(java.lang.Object v)
AbstractInt2ObjectMap
containsValue
in interface java.util.Map<java.lang.Integer,V>
containsValue
in class AbstractInt2ObjectMap<V>
public void clear()
Int2ObjectMap
clear
in interface Int2ObjectMap<V>
clear
in interface java.util.Map<java.lang.Integer,V>
Map.clear()
public boolean containsKey(int k)
AbstractInt2ObjectMap
containsKey
in interface Int2ObjectFunction<V>
containsKey
in interface Int2ObjectMap<V>
containsKey
in class AbstractInt2ObjectMap<V>
k
- the key.key
.Map.containsKey(Object)
public int size()
Int2ObjectMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Int2ObjectMap<V>
size
in interface java.util.Map<java.lang.Integer,V>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Integer,V>
isEmpty
in class AbstractInt2ObjectMap<V>
public V get(int k)
Int2ObjectFunction
get
in interface Int2ObjectFunction<V>
k
- the key.Function.get(Object)
public int firstIntKey()
Int2ObjectSortedMap
firstIntKey
in interface Int2ObjectSortedMap<V>
SortedMap.firstKey()
public int lastIntKey()
Int2ObjectSortedMap
lastIntKey
in interface Int2ObjectSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Int2ObjectMap.Entry<V>> int2ObjectEntrySet()
Int2ObjectSortedMap
int2ObjectEntrySet
in interface Int2ObjectMap<V>
int2ObjectEntrySet
in interface Int2ObjectSortedMap<V>
Int2ObjectSortedMap.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 Int2ObjectMap<V>
keySet
in interface Int2ObjectSortedMap<V>
keySet
in interface java.util.Map<java.lang.Integer,V>
keySet
in interface java.util.SortedMap<java.lang.Integer,V>
keySet
in class AbstractInt2ObjectSortedMap<V>
Map.keySet()
public ObjectCollection<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 Int2ObjectMap<V>
values
in interface Int2ObjectSortedMap<V>
values
in interface java.util.Map<java.lang.Integer,V>
values
in interface java.util.SortedMap<java.lang.Integer,V>
values
in class AbstractInt2ObjectSortedMap<V>
Map.values()
public IntComparator comparator()
Int2ObjectSortedMap
comparator
in interface Int2ObjectSortedMap<V>
comparator
in interface java.util.SortedMap<java.lang.Integer,V>
SortedMap.comparator()
public Int2ObjectSortedMap<V> headMap(int to)
Int2ObjectSortedMap
toKey
.headMap
in interface Int2ObjectSortedMap<V>
SortedMap.headMap(Object)
public Int2ObjectSortedMap<V> tailMap(int from)
Int2ObjectSortedMap
fromKey
.tailMap
in interface Int2ObjectSortedMap<V>
SortedMap.tailMap(Object)
public Int2ObjectSortedMap<V> subMap(int from, int to)
Int2ObjectSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2ObjectSortedMap<V>
SortedMap.subMap(Object,Object)
public Int2ObjectAVLTreeMap<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.
clone
in class java.lang.Object