public class Object2ObjectRBTreeMap<K,V> extends AbstractObject2ObjectSortedMap<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.
AbstractObject2ObjectSortedMap.KeySetIterator<K,V>, AbstractObject2ObjectSortedMap.ValuesCollection, AbstractObject2ObjectSortedMap.ValuesIterator<K,V>AbstractObject2ObjectMap.BasicEntry<K,V>, AbstractObject2ObjectMap.BasicEntrySet<K,V>Object2ObjectSortedMap.FastSortedEntrySet<K,V>Object2ObjectMap.FastEntrySet<K,V>| Modifier and Type | Field and Description |
|---|---|
protected java.util.Comparator<? super K> |
actualComparator
This map's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map.
|
protected it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2ObjectMap.Entry<K,V>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap.Entry<K,V> |
firstEntry
The first key in this map.
|
protected it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap.Entry<K,V> |
lastEntry
The last key in this map.
|
protected boolean |
modified
The value of this variable remembers, after a
put()
or a remove(), whether the domain of the map
has been modified. |
protected java.util.Comparator<? super K> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap.Entry<K,V> |
tree
A reference to the root entry.
|
protected it.unimi.dsi.fastutil.objects.ObjectCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Object2ObjectRBTreeMap()
Creates a new empty tree map.
|
Object2ObjectRBTreeMap(java.util.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,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2ObjectRBTreeMap(java.util.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(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).
|
Object2ObjectRBTreeMap<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) |
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() |
it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
it.unimi.dsi.fastutil.objects.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) |
V |
remove(java.lang.Object k) |
int |
size()
Returns the number of key/value mappings in this map.
|
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. |
it.unimi.dsi.fastutil.objects.ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySetcompute, computeIfAbsent, computeIfPresent, computeObjectIfAbsentPartial, defaultReturnValue, defaultReturnValue, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replaceandThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortprotected transient it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap.Entry<K,V> tree
protected int count
protected transient it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap.Entry<K,V> firstEntry
protected transient it.unimi.dsi.fastutil.objects.Object2ObjectRBTreeMap.Entry<K,V> lastEntry
protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2ObjectMap.Entry<K,V>> entries
protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<K> keys
protected transient it.unimi.dsi.fastutil.objects.ObjectCollection<V> values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected java.util.Comparator<? super K> storedComparator
protected transient java.util.Comparator<? super K> actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Object2ObjectRBTreeMap()
public Object2ObjectRBTreeMap(java.util.Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2ObjectRBTreeMap(java.util.Map<? extends K,? extends V> m)
m - a Map to be copied into the new tree map.public Object2ObjectRBTreeMap(java.util.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, 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 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.java.lang.IllegalArgumentException - if k and v have different lengths.public V put(K k, V v)
Object2ObjectMapThis default implementation just delegates to the corresponding function method.
public V remove(java.lang.Object k)
Object2ObjectMapThis default implementation just delegates to the corresponding type-specific–function method.
public boolean containsValue(java.lang.Object v)
AbstractObject2ObjectMapcontainsValue in interface java.util.Map<K,V>containsValue in class AbstractObject2ObjectMap<K,V>public void clear()
Object2ObjectMappublic boolean containsKey(java.lang.Object k)
AbstractObject2ObjectMapcontainsKey in interface Object2ObjectMap<K,V>containsKey in interface java.util.Map<K,V>containsKey in class AbstractObject2ObjectMap<K,V>k - the key.key.Map.containsKey(Object)public int size()
Object2ObjectMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public V get(java.lang.Object k)
public it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2ObjectMap.Entry<K,V>> object2ObjectEntrySet()
Object2ObjectSortedMapobject2ObjectEntrySet in interface Object2ObjectMap<K,V>object2ObjectEntrySet in interface Object2ObjectSortedMap<K,V>Object2ObjectSortedMap.entrySet()public it.unimi.dsi.fastutil.objects.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 java.util.Map<K,V>keySet in interface java.util.SortedMap<K,V>keySet in class AbstractObject2ObjectSortedMap<K,V>Map.keySet()public it.unimi.dsi.fastutil.objects.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 java.util.Map<K,V>values in interface java.util.SortedMap<K,V>values in class AbstractObject2ObjectSortedMap<K,V>Map.values()public java.util.Comparator<? super K> comparator()
Object2ObjectSortedMapcomparator in interface Object2ObjectSortedMap<K,V>comparator in interface java.util.SortedMap<K,V>SortedMap.comparator()public Object2ObjectSortedMap<K,V> headMap(K to)
Object2ObjectSortedMaptoKey.public Object2ObjectSortedMap<K,V> tailMap(K from)
Object2ObjectSortedMapfromKey.public Object2ObjectSortedMap<K,V> subMap(K from, K to)
Object2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.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.
clone in class java.lang.Object