public class Int2IntAVLTreeMap extends AbstractInt2IntSortedMap 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.
AbstractInt2IntMap.BasicEntry
Int2IntSortedMap.FastSortedEntrySet
Int2IntMap.FastEntrySet
Constructor and Description |
---|
Int2IntAVLTreeMap()
Creates a new empty tree map.
|
Int2IntAVLTreeMap(Comparator<? super 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,
Comparator<? super 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(Map<? extends Integer,? extends Integer> m)
Creates a new tree map copying a given map.
|
Int2IntAVLTreeMap(SortedMap<Integer,Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (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)
Checks whether the given value is contained in
AbstractInt2IntMap.keySet() . |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractInt2IntMap.values() . |
int |
firstIntKey() |
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() |
Integer |
put(Integer ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
put(int k,
int v)
Adds a pair to the map.
|
int |
remove(int k)
Removes the mapping with the given key.
|
Integer |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
containsKey, containsValue, equals, get, hashCode, putAll
public Int2IntAVLTreeMap()
public Int2IntAVLTreeMap(Comparator<? super Integer> c)
c
- a (possibly type-specific) comparator.public Int2IntAVLTreeMap(Map<? extends Integer,? extends Integer> m)
m
- a Map
to be copied into the new tree map.public Int2IntAVLTreeMap(SortedMap<Integer,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, Comparator<? super 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.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.IllegalArgumentException
- if k
and v
have different lengths.public int put(int k, int v)
Int2IntFunction
put
in interface Int2IntFunction
put
in class AbstractInt2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(int k)
Int2IntFunction
remove
in interface Int2IntFunction
remove
in class AbstractInt2IntFunction
Function.remove(Object)
public Integer put(Integer ok, Integer ov)
AbstractInt2IntFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
put
in interface Function<Integer,Integer>
put
in interface Map<Integer,Integer>
put
in class AbstractInt2IntFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Integer remove(Object ok)
AbstractInt2IntFunction
null
on a missing key.
This method must check whether the provided key is in the map using containsKey()
. Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
public boolean containsValue(int v)
AbstractInt2IntMap
AbstractInt2IntMap.values()
.containsValue
in interface Int2IntMap
containsValue
in class AbstractInt2IntMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(int k)
AbstractInt2IntMap
AbstractInt2IntMap.keySet()
.containsKey
in interface Int2IntFunction
containsKey
in class AbstractInt2IntMap
Function.containsKey(Object)
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public int get(int k)
Int2IntFunction
get
in interface Int2IntFunction
k
- the key.Function.get(Object)
public int firstIntKey()
firstIntKey
in interface Int2IntSortedMap
SortedMap.firstKey()
public int lastIntKey()
lastIntKey
in interface Int2IntSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Int2IntMap.Entry> int2IntEntrySet()
Int2IntSortedMap
int2IntEntrySet
in interface Int2IntMap
int2IntEntrySet
in interface Int2IntSortedMap
Int2IntSortedMap.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 Int2IntMap
keySet
in interface Int2IntSortedMap
keySet
in interface Map<Integer,Integer>
keySet
in interface SortedMap<Integer,Integer>
keySet
in class AbstractInt2IntSortedMap
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 Int2IntMap
values
in interface Int2IntSortedMap
values
in interface Map<Integer,Integer>
values
in interface SortedMap<Integer,Integer>
values
in class AbstractInt2IntSortedMap
Map.values()
public IntComparator comparator()
Int2IntSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Int2IntSortedMap
comparator
in interface SortedMap<Integer,Integer>
SortedMap.comparator()
public Int2IntSortedMap headMap(int to)
Int2IntSortedMap
toKey
.headMap
in interface Int2IntSortedMap
SortedMap.headMap(Object)
public Int2IntSortedMap tailMap(int from)
Int2IntSortedMap
fromKey
.tailMap
in interface Int2IntSortedMap
SortedMap.tailMap(Object)
public Int2IntSortedMap subMap(int from, int to)
Int2IntSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2IntSortedMap
SortedMap.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.