public class Long2ShortRBTreeMap extends AbstractLong2ShortSortedMap 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.
AbstractLong2ShortMap.BasicEntryLong2ShortSortedMap.FastSortedEntrySetLong2ShortMap.FastEntrySet| Constructor and Description |
|---|
Long2ShortRBTreeMap()
Creates a new empty tree map.
|
Long2ShortRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2ShortRBTreeMap(long[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2ShortRBTreeMap(long[] k,
short[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2ShortRBTreeMap(Long2ShortMap m)
Creates a new tree map copying a given map.
|
Long2ShortRBTreeMap(Long2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2ShortRBTreeMap(Map<? extends Long,? extends Short> m)
Creates a new tree map copying a given map.
|
Long2ShortRBTreeMap(SortedMap<Long,Short> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Long2ShortRBTreeMap |
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)
Checks whether the given value is contained in
AbstractLong2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractLong2ShortMap.values(). |
long |
firstLongKey() |
short |
get(long k)
Returns the value to which the given key is mapped.
|
Long2ShortSortedMap |
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() |
ObjectSortedSet<Long2ShortMap.Entry> |
long2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
short |
put(long k,
short v)
Adds a pair to the map.
|
Short |
put(Long ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
short |
remove(long k)
Removes the mapping with the given key.
|
Short |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Long2ShortSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2ShortSortedMap |
tailMap(long from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ShortCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Long2ShortRBTreeMap()
public Long2ShortRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2ShortRBTreeMap(Map<? extends Long,? extends Short> m)
m - a Map to be copied into the new tree map.public Long2ShortRBTreeMap(SortedMap<Long,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2ShortRBTreeMap(Long2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Long2ShortRBTreeMap(Long2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2ShortRBTreeMap(long[] k,
short[] 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 Long2ShortRBTreeMap(long[] k,
short[] 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 short put(long k,
short v)
Long2ShortFunctionput in interface Long2ShortFunctionput in class AbstractLong2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(long k)
Long2ShortFunctionremove in interface Long2ShortFunctionremove in class AbstractLong2ShortFunctionk - the key.Function.remove(Object)public Short put(Long ok, Short ov)
AbstractLong2ShortFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a
more efficient method.
public Short remove(Object ok)
AbstractLong2ShortFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a
more efficient method.
public boolean containsValue(short v)
AbstractLong2ShortMapAbstractLong2ShortMap.values().containsValue in interface Long2ShortMapcontainsValue in class AbstractLong2ShortMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(long k)
AbstractLong2ShortMapAbstractLong2ShortMap.keySet().containsKey in interface Long2ShortFunctioncontainsKey in class AbstractLong2ShortMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public short get(long k)
Long2ShortFunctionget in interface Long2ShortFunctionk - the key.Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2ShortSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2ShortMap.Entry> long2ShortEntrySet()
Long2ShortSortedMaplong2ShortEntrySet in interface Long2ShortMaplong2ShortEntrySet in interface Long2ShortSortedMapLong2ShortSortedMap.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 Long2ShortMapkeySet in interface Long2ShortSortedMapkeySet in interface Map<Long,Short>keySet in interface SortedMap<Long,Short>keySet in class AbstractLong2ShortSortedMapMap.keySet()public ShortCollection 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 Long2ShortMapvalues in interface Long2ShortSortedMapvalues in interface Map<Long,Short>values in interface SortedMap<Long,Short>values in class AbstractLong2ShortSortedMapMap.values()public LongComparator comparator()
Long2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2ShortSortedMapcomparator in interface SortedMap<Long,Short>SortedMap.comparator()public Long2ShortSortedMap headMap(long to)
Long2ShortSortedMaptoKey.headMap in interface Long2ShortSortedMapSortedMap.headMap(Object)public Long2ShortSortedMap tailMap(long from)
Long2ShortSortedMapfromKey.tailMap in interface Long2ShortSortedMapSortedMap.tailMap(Object)public Long2ShortSortedMap subMap(long from, long to)
Long2ShortSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Long2ShortSortedMapSortedMap.subMap(Object,Object)public Long2ShortRBTreeMap 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.