public class Object2ReferenceRBTreeMap<K,V> extends AbstractObject2ReferenceSortedMap<K,V> 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.
AbstractObject2ReferenceMap.BasicEntry<K,V>, AbstractObject2ReferenceMap.BasicEntrySet<K,V>
Object2ReferenceSortedMap.FastSortedEntrySet<K,V>
Object2ReferenceMap.FastEntrySet<K,V>
Constructor and Description |
---|
Object2ReferenceRBTreeMap()
Creates a new empty tree map.
|
Object2ReferenceRBTreeMap(java.util.Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2ReferenceRBTreeMap(K[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2ReferenceRBTreeMap(K[] k,
V[] v,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2ReferenceRBTreeMap(java.util.Map<? extends K,? extends V> m)
Creates a new tree map copying a given map.
|
Object2ReferenceRBTreeMap(Object2ReferenceMap<? extends K,? extends V> m)
Creates a new tree map copying a given map.
|
Object2ReferenceRBTreeMap(Object2ReferenceSortedMap<K,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Object2ReferenceRBTreeMap(java.util.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 of the mappings from this map (optional operation).
|
Object2ReferenceRBTreeMap<K,V> |
clone()
Returns a deep copy of this tree map.
|
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(java.lang.Object k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(java.lang.Object v) |
K |
firstKey() |
V |
get(java.lang.Object k)
Returns the value to which the given key is mapped.
|
Object2ReferenceSortedMap<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<Object2ReferenceMap.Entry<K,V>> |
object2ReferenceEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
V |
put(K k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(java.lang.Object k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Object2ReferenceSortedMap<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. |
Object2ReferenceSortedMap<K,V> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
entrySet
compute, computeIfAbsent, computeIfPresent, computeReferenceIfAbsentPartial, defaultReturnValue, defaultReturnValue, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Object2ReferenceRBTreeMap()
public Object2ReferenceRBTreeMap(java.util.Comparator<? super K> c)
c
- a (possibly type-specific) comparator.public Object2ReferenceRBTreeMap(java.util.Map<? extends K,? extends V> m)
m
- a Map
to be copied into the new tree map.public Object2ReferenceRBTreeMap(java.util.SortedMap<K,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Object2ReferenceRBTreeMap(Object2ReferenceMap<? extends K,? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Object2ReferenceRBTreeMap(Object2ReferenceSortedMap<K,V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Object2ReferenceRBTreeMap(K[] k, V[] v, java.util.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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Object2ReferenceRBTreeMap(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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public V put(K k, V v)
Object2ReferenceFunction
put
in interface Object2ReferenceFunction<K,V>
put
in interface Object2ReferenceMap<K,V>
put
in interface java.util.Map<K,V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(java.lang.Object k)
Object2ReferenceFunction
remove
in interface Object2ReferenceFunction<K,V>
remove
in interface Object2ReferenceMap<K,V>
remove
in interface java.util.Map<K,V>
k
- the key.Function.remove(Object)
public boolean containsValue(java.lang.Object v)
AbstractObject2ReferenceMap
containsValue
in interface java.util.Map<K,V>
containsValue
in class AbstractObject2ReferenceMap<K,V>
public void clear()
Object2ReferenceMap
public boolean containsKey(java.lang.Object k)
AbstractObject2ReferenceMap
containsKey
in interface Object2ReferenceMap<K,V>
containsKey
in interface java.util.Map<K,V>
containsKey
in class AbstractObject2ReferenceMap<K,V>
k
- the key.key
.Map.containsKey(Object)
public int size()
Object2ReferenceMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.public boolean isEmpty()
public V get(java.lang.Object k)
Object2ReferenceFunction
get
in interface Object2ReferenceFunction<K,V>
get
in interface java.util.Map<K,V>
k
- the key.Function.get(Object)
public ObjectSortedSet<Object2ReferenceMap.Entry<K,V>> object2ReferenceEntrySet()
Object2ReferenceSortedMap
object2ReferenceEntrySet
in interface Object2ReferenceMap<K,V>
object2ReferenceEntrySet
in interface Object2ReferenceSortedMap<K,V>
Object2ReferenceSortedMap.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 Object2ReferenceMap<K,V>
keySet
in interface Object2ReferenceSortedMap<K,V>
keySet
in interface java.util.Map<K,V>
keySet
in interface java.util.SortedMap<K,V>
keySet
in class AbstractObject2ReferenceSortedMap<K,V>
Map.keySet()
public ReferenceCollection<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 Object2ReferenceMap<K,V>
values
in interface Object2ReferenceSortedMap<K,V>
values
in interface java.util.Map<K,V>
values
in interface java.util.SortedMap<K,V>
values
in class AbstractObject2ReferenceSortedMap<K,V>
Map.values()
public java.util.Comparator<? super K> comparator()
Object2ReferenceSortedMap
comparator
in interface Object2ReferenceSortedMap<K,V>
comparator
in interface java.util.SortedMap<K,V>
SortedMap.comparator()
public Object2ReferenceSortedMap<K,V> headMap(K to)
Object2ReferenceSortedMap
toKey
.public Object2ReferenceSortedMap<K,V> tailMap(K from)
Object2ReferenceSortedMap
fromKey
.public Object2ReferenceSortedMap<K,V> subMap(K from, K to)
Object2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.public Object2ReferenceRBTreeMap<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.
clone
in class java.lang.Object