public class Long2IntRBTreeMap extends AbstractLong2IntSortedMap 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.
AbstractLong2IntMap.BasicEntry, AbstractLong2IntMap.BasicEntrySetLong2IntSortedMap.FastSortedEntrySetLong2IntMap.FastEntrySet| Constructor and Description |
|---|
Long2IntRBTreeMap()
Creates a new empty tree map.
|
Long2IntRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2IntRBTreeMap(long[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2IntRBTreeMap(long[] k,
int[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2IntRBTreeMap(Long2IntMap m)
Creates a new tree map copying a given map.
|
Long2IntRBTreeMap(Long2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2IntRBTreeMap(Map<? extends Long,? extends Integer> m)
Creates a new tree map copying a given map.
|
Long2IntRBTreeMap(SortedMap<Long,Integer> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
int |
addTo(long 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).
|
Long2IntRBTreeMap |
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(int 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.
|
int |
get(long k)
Returns the value to which the given key is mapped.
|
Long2IntSortedMap |
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<Long2IntMap.Entry> |
long2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
put(long k,
int v)
Adds a pair to the map (optional operation).
|
int |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
Long2IntSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2IntSortedMap |
tailMap(long 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, defaultReturnValueentrySet, 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, replaceapplyAsIntpublic Long2IntRBTreeMap()
public Long2IntRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2IntRBTreeMap(Map<? extends Long,? extends Integer> m)
m - a Map to be copied into the new tree map.public Long2IntRBTreeMap(SortedMap<Long,Integer> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2IntRBTreeMap(Long2IntMap m)
m - a type-specific map to be copied into the new tree map.public Long2IntRBTreeMap(Long2IntSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2IntRBTreeMap(long[] k,
int[] 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 Long2IntRBTreeMap(long[] 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(long 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(long k,
int v)
Long2IntFunctionput in interface Long2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(long k)
Long2IntFunctionremove in interface Long2IntFunctionk - the key.Function.remove(Object)public boolean containsValue(int v)
Long2IntMaptrue if this map maps one or more keys to the specified value.containsValue in interface Long2IntMapcontainsValue in class AbstractLong2IntMapMap.containsValue(Object)public void clear()
Long2IntMapclear in interface Long2IntMapclear in interface Map<Long,Integer>Map.clear()public boolean containsKey(long k)
Long2IntMapcontainsKey in interface Long2IntFunctioncontainsKey in interface Long2IntMapcontainsKey in class AbstractLong2IntMapk - the key.key.Map.containsKey(Object)public int size()
Long2IntMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public int get(long k)
Long2IntFunctionget in interface Long2IntFunctionk - the key.Function.get(Object)public long firstLongKey()
Long2IntSortedMapfirstLongKey in interface Long2IntSortedMapSortedMap.firstKey()public long lastLongKey()
Long2IntSortedMaplastLongKey in interface Long2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2IntMap.Entry> long2IntEntrySet()
Long2IntSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
long2IntEntrySet in interface Long2IntMaplong2IntEntrySet in interface Long2IntSortedMapLong2IntSortedMap.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 Long2IntMapkeySet in interface Long2IntSortedMapkeySet in interface Map<Long,Integer>keySet in interface SortedMap<Long,Integer>keySet in class AbstractLong2IntSortedMapMap.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 Long2IntMapvalues in interface Long2IntSortedMapvalues in interface Map<Long,Integer>values in interface SortedMap<Long,Integer>values in class AbstractLong2IntSortedMapMap.values()public LongComparator comparator()
Long2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2IntSortedMapcomparator in interface SortedMap<Long,Integer>SortedMap.comparator()public Long2IntSortedMap headMap(long to)
Long2IntSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Long2IntSortedMapSortedMap.headMap(Object)public Long2IntSortedMap tailMap(long from)
Long2IntSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Long2IntSortedMapSortedMap.tailMap(Object)public Long2IntSortedMap subMap(long from, long to)
Long2IntSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Long2IntSortedMapSortedMap.subMap(Object,Object)public Long2IntRBTreeMap 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.