public class Int2ObjectRBTreeMap<V> extends AbstractInt2ObjectSortedMap<V> 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.
AbstractInt2ObjectMap.BasicEntry<V>
Int2ObjectSortedMap.FastSortedEntrySet<V>
Int2ObjectMap.FastEntrySet<V>
Constructor and Description |
---|
Int2ObjectRBTreeMap()
Creates a new empty tree map.
|
Int2ObjectRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ObjectRBTreeMap(int[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ObjectRBTreeMap(int[] k,
V[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2ObjectRBTreeMap(Int2ObjectMap<? extends V> m)
Creates a new tree map copying a given map.
|
Int2ObjectRBTreeMap(Int2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Int2ObjectRBTreeMap(Map<? extends Integer,? extends V> m)
Creates a new tree map copying a given map.
|
Int2ObjectRBTreeMap(SortedMap<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 associations from this function (optional operation).
|
Int2ObjectRBTreeMap<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)
Checks whether the given value is contained in
AbstractInt2ObjectMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractInt2ObjectMap.values() . |
int |
firstIntKey() |
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() |
V |
put(Integer ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
put(int k,
V v)
Adds a pair to the map.
|
V |
remove(int k)
Removes the mapping with the given key.
|
V |
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
public Int2ObjectRBTreeMap()
public Int2ObjectRBTreeMap(Comparator<? super Integer> c)
c
- a (possibly type-specific) comparator.public Int2ObjectRBTreeMap(Map<? extends Integer,? extends V> m)
m
- a Map
to be copied into the new tree map.public Int2ObjectRBTreeMap(SortedMap<Integer,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2ObjectRBTreeMap(Int2ObjectMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Int2ObjectRBTreeMap(Int2ObjectSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2ObjectRBTreeMap(int[] k, V[] 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 Int2ObjectRBTreeMap(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.IllegalArgumentException
- if k
and v
have different lengths.public V put(int k, V v)
Int2ObjectFunction
put
in interface Int2ObjectFunction<V>
put
in class AbstractInt2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(int k)
Int2ObjectFunction
remove
in interface Int2ObjectFunction<V>
remove
in class AbstractInt2ObjectFunction<V>
k
- the key.Function.remove(Object)
public V put(Integer ok, V ov)
AbstractInt2ObjectFunction
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 V remove(Object ok)
AbstractInt2ObjectFunction
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(Object v)
AbstractInt2ObjectMap
AbstractInt2ObjectMap.values()
.containsValue
in interface Map<Integer,V>
containsValue
in class AbstractInt2ObjectMap<V>
public void clear()
Function
public boolean containsKey(int k)
AbstractInt2ObjectMap
AbstractInt2ObjectMap.keySet()
.containsKey
in interface Int2ObjectFunction<V>
containsKey
in class AbstractInt2ObjectMap<V>
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 V get(int k)
Int2ObjectFunction
get
in interface Int2ObjectFunction<V>
k
- the key.Function.get(Object)
public int firstIntKey()
firstIntKey
in interface Int2ObjectSortedMap<V>
SortedMap.firstKey()
public int lastIntKey()
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 Map<Integer,V>
keySet
in interface SortedMap<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 Map<Integer,V>
values
in interface SortedMap<Integer,V>
values
in class AbstractInt2ObjectSortedMap<V>
Map.values()
public IntComparator comparator()
Int2ObjectSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Int2ObjectSortedMap<V>
comparator
in interface SortedMap<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 Int2ObjectRBTreeMap<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.