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.
AbstractObject2IntSortedMap.KeySetIterator<K>, AbstractObject2IntSortedMap.ValuesCollection, AbstractObject2IntSortedMap.ValuesIterator<K>AbstractObject2IntMap.BasicEntry<K>, AbstractObject2IntMap.BasicEntrySet<K>Object2IntSortedMap.FastSortedEntrySet<K>Object2IntMap.FastEntrySet<K>| Modifier and Type | Field and Description |
|---|---|
protected 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 ObjectSortedSet<Object2IntMap.Entry<K>> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.objects.Object2IntRBTreeMap.Entry<K> |
firstEntry
The first key in this map.
|
protected ObjectSortedSet<K> |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.objects.Object2IntRBTreeMap.Entry<K> |
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 Comparator<? super K> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.objects.Object2IntRBTreeMap.Entry<K> |
tree
A reference to the root entry.
|
protected IntCollection |
values
Cached collection of values.
|
defRetValue| 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 |
|---|---|
int |
addTo(K k,
int incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(int v)
Returns
true if this map maps one or more keys to the specified value. |
K |
firstKey() |
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 (optional operation).
|
int |
removeInt(Object k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
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.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySetcomputeInt, computeIntIfAbsent, computeIntIfAbsentPartial, computeIntIfPresent, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntcompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, putAll, replaceAllprotected transient it.unimi.dsi.fastutil.objects.Object2IntRBTreeMap.Entry<K> tree
protected int count
protected transient it.unimi.dsi.fastutil.objects.Object2IntRBTreeMap.Entry<K> firstEntry
protected transient it.unimi.dsi.fastutil.objects.Object2IntRBTreeMap.Entry<K> lastEntry
protected transient ObjectSortedSet<Object2IntMap.Entry<K>> entries
protected transient ObjectSortedSet<K> keys
protected transient IntCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super K> storedComparator
protected transient Comparator<? super K> actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.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 addTo(K k, int incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public int put(K k, int v)
Object2IntFunctionput in interface Object2IntFunction<K>k - the key.v - the value.Function.put(Object,Object)public int removeInt(Object k)
Object2IntFunctionremoveInt in interface Object2IntFunction<K>k - the key.Function.remove(Object)public boolean containsValue(int v)
Object2IntMaptrue if this map maps one or more keys to the specified value.containsValue in interface Object2IntMap<K>containsValue in class AbstractObject2IntMap<K>Map.containsValue(Object)public void clear()
Object2IntMapclear in interface Object2IntMap<K>clear in interface Map<K,Integer>Map.clear()public boolean containsKey(Object k)
Object2IntMapcontainsKey in interface Object2IntMap<K>containsKey in interface Map<K,Integer>containsKey in class AbstractObject2IntMap<K>k - the key.key.Map.containsKey(Object)public int size()
Object2IntMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public int getInt(Object k)
Object2IntFunctiongetInt in interface Object2IntFunction<K>k - the key.Function.get(Object)public ObjectSortedSet<Object2IntMap.Entry<K>> object2IntEntrySet()
Object2IntSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
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()
Object2IntSortedMapNote 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)
Object2IntSortedMaptoKey.
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)
Object2IntSortedMapfromKey.
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)
Object2IntSortedMapfromKey, 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.
Copyright © 2020. All rights reserved.