public class Long2LongRBTreeMap extends AbstractLong2LongSortedMap 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.
AbstractLong2LongSortedMap.KeySetIterator, AbstractLong2LongSortedMap.ValuesCollection, AbstractLong2LongSortedMap.ValuesIteratorAbstractLong2LongMap.BasicEntry, AbstractLong2LongMap.BasicEntrySetLong2LongSortedMap.FastSortedEntrySetLong2LongMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected LongComparator |
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<Long2LongMap.Entry> |
entries
Cached set of entries.
|
protected it.unimi.dsi.fastutil.longs.Long2LongRBTreeMap.Entry |
firstEntry
The first key in this map.
|
protected LongSortedSet |
keys
Cached set of keys.
|
protected it.unimi.dsi.fastutil.longs.Long2LongRBTreeMap.Entry |
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 Long> |
storedComparator
This map's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.longs.Long2LongRBTreeMap.Entry |
tree
A reference to the root entry.
|
protected LongCollection |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Long2LongRBTreeMap()
Creates a new empty tree map.
|
Long2LongRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2LongRBTreeMap(long[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2LongRBTreeMap(long[] k,
long[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2LongRBTreeMap(Long2LongMap m)
Creates a new tree map copying a given map.
|
Long2LongRBTreeMap(Long2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2LongRBTreeMap(Map<? extends Long,? extends Long> m)
Creates a new tree map copying a given map.
|
Long2LongRBTreeMap(SortedMap<Long,Long> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(long k,
long incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Long2LongRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(long k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(long v)
Returns
true if this map maps one or more keys to the specified value. |
long |
firstLongKey()
Returns the first (lowest) key currently in this map.
|
long |
get(long k)
Returns the value to which the given key is mapped.
|
Long2LongSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
long |
lastLongKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Long2LongMap.Entry> |
long2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
long |
put(long k,
long v)
Adds a pair to the map (optional operation).
|
long |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Long2LongSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2LongSortedMap |
tailMap(long from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
LongCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitentrySet, firstKey, headMap, lastKey, subMap, tailMapcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsLongandThen, compose, identityprotected transient it.unimi.dsi.fastutil.longs.Long2LongRBTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.longs.Long2LongRBTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.longs.Long2LongRBTreeMap.Entry lastEntry
protected transient ObjectSortedSet<Long2LongMap.Entry> entries
protected transient LongSortedSet keys
protected transient LongCollection values
protected transient boolean modified
put()
or a remove(), whether the domain of the map
has been modified.protected Comparator<? super Long> storedComparator
protected transient LongComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public Long2LongRBTreeMap()
public Long2LongRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2LongRBTreeMap(Map<? extends Long,? extends Long> m)
m - a Map to be copied into the new tree map.public Long2LongRBTreeMap(SortedMap<Long,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2LongRBTreeMap(Long2LongMap m)
m - a type-specific map to be copied into the new tree map.public Long2LongRBTreeMap(Long2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2LongRBTreeMap(long[] k,
long[] v,
Comparator<? super Long> 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 Long2LongRBTreeMap(long[] k,
long[] 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 long addTo(long k,
long 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 long put(long k,
long v)
Long2LongFunctionput in interface Long2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(long k)
Long2LongFunctionremove in interface Long2LongFunctionk - the key.Function.remove(Object)public boolean containsValue(long v)
Long2LongMaptrue if this map maps one or more keys to the specified value.containsValue in interface Long2LongMapcontainsValue in class AbstractLong2LongMapMap.containsValue(Object)public void clear()
Long2LongMapclear in interface Long2LongMapclear in interface Map<Long,Long>Map.clear()public boolean containsKey(long k)
Long2LongMapcontainsKey in interface Long2LongFunctioncontainsKey in interface Long2LongMapcontainsKey in class AbstractLong2LongMapk - the key.key.Map.containsKey(Object)public int size()
Long2LongMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public long get(long k)
Long2LongFunctionget in interface Long2LongFunctionk - the key.Function.get(Object)public long firstLongKey()
Long2LongSortedMapfirstLongKey in interface Long2LongSortedMapSortedMap.firstKey()public long lastLongKey()
Long2LongSortedMaplastLongKey in interface Long2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2LongMap.Entry> long2LongEntrySet()
Long2LongSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
long2LongEntrySet in interface Long2LongMaplong2LongEntrySet in interface Long2LongSortedMapLong2LongSortedMap.entrySet()public LongSortedSet 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 Long2LongMapkeySet in interface Long2LongSortedMapkeySet in interface Map<Long,Long>keySet in interface SortedMap<Long,Long>keySet in class AbstractLong2LongSortedMapMap.keySet()public LongCollection 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 Long2LongMapvalues in interface Long2LongSortedMapvalues in interface Map<Long,Long>values in interface SortedMap<Long,Long>values in class AbstractLong2LongSortedMapMap.values()public LongComparator comparator()
Long2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2LongSortedMapcomparator in interface SortedMap<Long,Long>SortedMap.comparator()public Long2LongSortedMap headMap(long to)
Long2LongSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Long2LongSortedMapSortedMap.headMap(Object)public Long2LongSortedMap tailMap(long from)
Long2LongSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Long2LongSortedMapSortedMap.tailMap(Object)public Long2LongSortedMap subMap(long from, long to)
Long2LongSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Long2LongSortedMapSortedMap.subMap(Object,Object)public Long2LongRBTreeMap 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.