public class Object2IntRBTreeMap<K> extends AbstractObject2IntSortedMap<K> 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.
AbstractObject2IntMap.BasicEntry<K>
Object2IntSortedMap.FastSortedEntrySet<K>
Object2IntMap.FastEntrySet<K>
Constructor and Description |
---|
Object2IntRBTreeMap()
Creates a new empty tree map.
|
Object2IntRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2IntRBTreeMap(K[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2IntRBTreeMap(K[] k,
int[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2IntRBTreeMap(Map<? extends K,? extends Integer> m)
Creates a new tree map copying a given map.
|
Object2IntRBTreeMap(Object2IntMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2IntRBTreeMap(Object2IntSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Object2IntRBTreeMap(SortedMap<K,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).
|
Object2IntRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2IntMap.keySet() . |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractObject2IntMap.values() . |
K |
firstKey() |
Integer |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
getInt(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.
|
Integer |
put(K ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Integer |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
removeInt(Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
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.
|
entrySet
containsValue, equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
defaultReturnValue, defaultReturnValue
containsValue, equals, hashCode, putAll
public Object2IntRBTreeMap()
public Object2IntRBTreeMap(Comparator<? super K> c)
c
- a (possibly type-specific) comparator.public Object2IntRBTreeMap(Map<? extends K,? extends Integer> m)
m
- a Map
to be copied into the new tree map.public Object2IntRBTreeMap(SortedMap<K,Integer> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Object2IntRBTreeMap(Object2IntMap<? extends K> m)
m
- a type-specific map to be copied into the new tree map.public Object2IntRBTreeMap(Object2IntSortedMap<K> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Object2IntRBTreeMap(K[] k, int[] v, 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.IllegalArgumentException
- if k
and v
have different lengths.public Object2IntRBTreeMap(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.IllegalArgumentException
- if k
and v
have different lengths.public int put(K k, int v)
Object2IntFunction
put
in interface Object2IntFunction<K>
put
in class AbstractObject2IntFunction<K>
k
- the key.v
- the value.Function.put(Object,Object)
public int removeInt(Object k)
Object2IntFunction
removeInt
in interface Object2IntFunction<K>
removeInt
in class AbstractObject2IntFunction<K>
k
- the key.Function.remove(Object)
public Integer put(K ok, Integer ov)
AbstractObject2IntFunction
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 Integer remove(Object ok)
AbstractObject2IntFunction
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)
AbstractObject2IntMap
AbstractObject2IntMap.values()
.containsValue
in interface Object2IntMap<K>
containsValue
in class AbstractObject2IntMap<K>
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(Object k)
AbstractObject2IntMap
AbstractObject2IntMap.keySet()
.containsKey
in interface Function<K,Integer>
containsKey
in interface Map<K,Integer>
containsKey
in class AbstractObject2IntMap<K>
k
- the key.key
.Map.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 getInt(Object k)
Object2IntFunction
getInt
in interface Object2IntFunction<K>
k
- the key.Function.get(Object)
public Integer get(Object ok)
AbstractObject2IntFunction
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 ObjectSortedSet<Object2IntMap.Entry<K>> object2IntEntrySet()
Object2IntSortedMap
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 Map<K,Integer>
keySet
in interface SortedMap<K,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 Map<K,Integer>
values
in interface SortedMap<K,Integer>
values
in class AbstractObject2IntSortedMap<K>
Map.values()
public Comparator<? super K> comparator()
Object2IntSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Object2IntSortedMap<K>
comparator
in interface SortedMap<K,Integer>
SortedMap.comparator()
public Object2IntSortedMap<K> headMap(K to)
Object2IntSortedMap
toKey
.
Note that this specification strengthens the one given in SortedMap.headMap(Object)
.
headMap
in interface Object2IntSortedMap<K>
headMap
in interface SortedMap<K,Integer>
SortedMap.headMap(Object)
public Object2IntSortedMap<K> tailMap(K from)
Object2IntSortedMap
fromKey
.
Note that this specification strengthens the one given in SortedMap.tailMap(Object)
.
tailMap
in interface Object2IntSortedMap<K>
tailMap
in interface SortedMap<K,Integer>
SortedMap.tailMap(Object)
public Object2IntSortedMap<K> subMap(K from, K to)
Object2IntSortedMap
fromKey
, 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 SortedMap<K,Integer>
SortedMap.subMap(Object,Object)
public Object2IntRBTreeMap<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.