public class Int2IntRBTreeMap 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.BasicEntrySet
Int2IntSortedMap.FastSortedEntrySet
Int2IntMap.FastEntrySet
Constructor and Description |
---|
Int2IntRBTreeMap()
Creates a new empty tree map.
|
Int2IntRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2IntRBTreeMap(int[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2IntRBTreeMap(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.
|
Int2IntRBTreeMap(Int2IntMap m)
Creates a new tree map copying a given map.
|
Int2IntRBTreeMap(Int2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Int2IntRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> m)
Creates a new tree map copying a given map.
|
Int2IntRBTreeMap(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).
|
Int2IntRBTreeMap |
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, mergeInt, putAll, toString
defaultReturnValue, defaultReturnValue
entrySet, firstKey, headMap, lastKey, subMap, tailMap
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeInt, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, identity
public Int2IntRBTreeMap()
public Int2IntRBTreeMap(java.util.Comparator<? super java.lang.Integer> c)
c
- a (possibly type-specific) comparator.public Int2IntRBTreeMap(java.util.Map<? extends java.lang.Integer,? extends java.lang.Integer> m)
m
- a Map
to be copied into the new tree map.public Int2IntRBTreeMap(java.util.SortedMap<java.lang.Integer,java.lang.Integer> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2IntRBTreeMap(Int2IntMap m)
m
- a type-specific map to be copied into the new tree map.public Int2IntRBTreeMap(Int2IntSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2IntRBTreeMap(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 Int2IntRBTreeMap(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)
Int2IntFunction
put
in interface Int2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(int k)
Int2IntFunction
remove
in interface Int2IntFunction
k
- the key.Function.remove(Object)
public boolean containsValue(int v)
AbstractInt2IntMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Int2IntMap
containsValue
in class AbstractInt2IntMap
Map.containsValue(Object)
public void clear()
Int2IntMap
clear
in interface Int2IntMap
clear
in interface java.util.Map<java.lang.Integer,java.lang.Integer>
Map.clear()
public boolean containsKey(int k)
AbstractInt2IntMap
containsKey
in interface Int2IntFunction
containsKey
in interface Int2IntMap
containsKey
in class AbstractInt2IntMap
k
- the key.key
.Map.containsKey(Object)
public int size()
Int2IntMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Int2IntMap
size
in interface java.util.Map<java.lang.Integer,java.lang.Integer>
Size64
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Integer,java.lang.Integer>
isEmpty
in class AbstractInt2IntMap
public int get(int k)
Int2IntFunction
get
in interface Int2IntFunction
k
- the key.Function.get(Object)
public int firstIntKey()
Int2IntSortedMap
firstIntKey
in interface Int2IntSortedMap
SortedMap.firstKey()
public int lastIntKey()
Int2IntSortedMap
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 java.util.Map<java.lang.Integer,java.lang.Integer>
keySet
in interface java.util.SortedMap<java.lang.Integer,java.lang.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 java.util.Map<java.lang.Integer,java.lang.Integer>
values
in interface java.util.SortedMap<java.lang.Integer,java.lang.Integer>
values
in class AbstractInt2IntSortedMap
Map.values()
public IntComparator comparator()
Int2IntSortedMap
comparator
in interface Int2IntSortedMap
comparator
in interface java.util.SortedMap<java.lang.Integer,java.lang.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 Int2IntRBTreeMap 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