public class Object2ObjectRBTreeMap<K,V> extends AbstractObject2ObjectSortedMap<K,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.
AbstractObject2ObjectMap.BasicEntry<K,V>Object2ObjectSortedMap.FastSortedEntrySet<K,V>Object2ObjectMap.FastEntrySet<K,V>| Constructor and Description |
|---|
Object2ObjectRBTreeMap()
Creates a new empty tree map.
|
Object2ObjectRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2ObjectRBTreeMap(K[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2ObjectRBTreeMap(K[] k,
V[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2ObjectRBTreeMap(Map<? extends K,? extends V> m)
Creates a new tree map copying a given map.
|
Object2ObjectRBTreeMap(Object2ObjectMap<? extends K,? extends V> m)
Creates a new tree map copying a given map.
|
Object2ObjectRBTreeMap(Object2ObjectSortedMap<K,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2ObjectRBTreeMap(SortedMap<K,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).
|
Object2ObjectRBTreeMap<K,V> |
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
AbstractObject2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractObject2ObjectMap.values(). |
K |
firstKey() |
V |
get(Object k)
Returns the value associated by this function to the specified key.
|
Object2ObjectSortedMap<K,V> |
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<Object2ObjectMap.Entry<K,V>> |
object2ObjectEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
V |
put(K k,
V v)
Associates the specified value with the specified key in this function (optional operation).
|
V |
remove(Object k)
Removes this key and the associated value from this function if it is present (optional operation).
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Object2ObjectSortedMap<K,V> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2ObjectSortedMap<K,V> |
tailMap(K 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.
|
entrySetequals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValuepublic Object2ObjectRBTreeMap()
public Object2ObjectRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2ObjectRBTreeMap(Map<? extends K,? extends V> m)
m - a Map to be copied into the new tree map.public Object2ObjectRBTreeMap(SortedMap<K,V> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2ObjectRBTreeMap(Object2ObjectMap<? extends K,? extends V> m)
m - a type-specific map to be copied into the new tree map.public Object2ObjectRBTreeMap(Object2ObjectSortedMap<K,V> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2ObjectRBTreeMap(K[] k, V[] 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 Object2ObjectRBTreeMap(K[] 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(K k, V v)
Functionpublic V remove(Object k)
Functionpublic boolean containsValue(Object v)
AbstractObject2ObjectMapAbstractObject2ObjectMap.values().containsValue in interface Map<K,V>containsValue in class AbstractObject2ObjectMap<K,V>public void clear()
Functionpublic boolean containsKey(Object k)
AbstractObject2ObjectMapAbstractObject2ObjectMap.keySet().containsKey in interface Function<K,V>containsKey in interface Map<K,V>containsKey in class AbstractObject2ObjectMap<K,V>k - the key.key.Map.containsKey(Object)public int size()
FunctionMost 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(Object k)
Functionpublic ObjectSortedSet<Object2ObjectMap.Entry<K,V>> object2ObjectEntrySet()
Object2ObjectSortedMapobject2ObjectEntrySet in interface Object2ObjectMap<K,V>object2ObjectEntrySet in interface Object2ObjectSortedMap<K,V>Object2ObjectSortedMap.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 Object2ObjectMap<K,V>keySet in interface Object2ObjectSortedMap<K,V>keySet in interface Map<K,V>keySet in interface SortedMap<K,V>keySet in class AbstractObject2ObjectSortedMap<K,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 Object2ObjectMap<K,V>values in interface Object2ObjectSortedMap<K,V>values in interface Map<K,V>values in interface SortedMap<K,V>values in class AbstractObject2ObjectSortedMap<K,V>Map.values()public Comparator<? super K> comparator()
Object2ObjectSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2ObjectSortedMap<K,V>comparator in interface SortedMap<K,V>SortedMap.comparator()public Object2ObjectSortedMap<K,V> headMap(K to)
Object2ObjectSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2ObjectSortedMap<K,V>headMap in interface SortedMap<K,V>SortedMap.headMap(Object)public Object2ObjectSortedMap<K,V> tailMap(K from)
Object2ObjectSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2ObjectSortedMap<K,V>tailMap in interface SortedMap<K,V>SortedMap.tailMap(Object)public Object2ObjectSortedMap<K,V> subMap(K from, K to)
Object2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2ObjectSortedMap<K,V>subMap in interface SortedMap<K,V>SortedMap.subMap(Object,Object)public Object2ObjectRBTreeMap<K,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.