public class Short2LongAVLTreeMap extends AbstractShort2LongSortedMap 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.
AbstractShort2LongMap.BasicEntryShort2LongSortedMap.FastSortedEntrySetShort2LongMap.FastEntrySet| Constructor and Description |
|---|
Short2LongAVLTreeMap()
Creates a new empty tree map.
|
Short2LongAVLTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2LongAVLTreeMap(Map<? extends Short,? extends Long> m)
Creates a new tree map copying a given map.
|
Short2LongAVLTreeMap(short[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2LongAVLTreeMap(short[] k,
long[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2LongAVLTreeMap(Short2LongMap m)
Creates a new tree map copying a given map.
|
Short2LongAVLTreeMap(Short2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2LongAVLTreeMap(SortedMap<Short,Long> 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).
|
Short2LongAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractShort2LongMap.values(). |
short |
firstShortKey() |
long |
get(short k)
Returns the value to which the given key is mapped.
|
Short2LongSortedMap |
headMap(short to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ShortSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
short |
lastShortKey() |
long |
put(short k,
long v)
Adds a pair to the map.
|
Long |
put(Short ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Long |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2LongMap.Entry> |
short2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Short2LongSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2LongSortedMap |
tailMap(short 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.
|
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 Short2LongAVLTreeMap()
public Short2LongAVLTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2LongAVLTreeMap(Map<? extends Short,? extends Long> m)
m - a Map to be copied into the new tree map.public Short2LongAVLTreeMap(SortedMap<Short,Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2LongAVLTreeMap(Short2LongMap m)
m - a type-specific map to be copied into the new tree map.public Short2LongAVLTreeMap(Short2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2LongAVLTreeMap(short[] k,
long[] v,
Comparator<? super Short> 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 Short2LongAVLTreeMap(short[] 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 put(short k,
long v)
Short2LongFunctionput in interface Short2LongFunctionput in class AbstractShort2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(short k)
Short2LongFunctionremove in interface Short2LongFunctionremove in class AbstractShort2LongFunctionk - the key.Function.remove(Object)public Long put(Short ok, Long ov)
AbstractShort2LongFunctionnull 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 Long remove(Object ok)
AbstractShort2LongFunctionnull 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(long v)
AbstractShort2LongMapAbstractShort2LongMap.values().containsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(short k)
AbstractShort2LongMapAbstractShort2LongMap.keySet().containsKey in interface Short2LongFunctioncontainsKey in class AbstractShort2LongMapFunction.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 long get(short k)
Short2LongFunctionget in interface Short2LongFunctionk - the key.Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2LongSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2LongMap.Entry> short2LongEntrySet()
Short2LongSortedMapshort2LongEntrySet in interface Short2LongMapshort2LongEntrySet in interface Short2LongSortedMapShort2LongSortedMap.entrySet()public ShortSortedSet 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 Short2LongMapkeySet in interface Short2LongSortedMapkeySet in interface Map<Short,Long>keySet in interface SortedMap<Short,Long>keySet in class AbstractShort2LongSortedMapMap.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 Short2LongMapvalues in interface Short2LongSortedMapvalues in interface Map<Short,Long>values in interface SortedMap<Short,Long>values in class AbstractShort2LongSortedMapMap.values()public ShortComparator comparator()
Short2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2LongSortedMapcomparator in interface SortedMap<Short,Long>SortedMap.comparator()public Short2LongSortedMap headMap(short to)
Short2LongSortedMaptoKey.headMap in interface Short2LongSortedMapSortedMap.headMap(Object)public Short2LongSortedMap tailMap(short from)
Short2LongSortedMapfromKey.tailMap in interface Short2LongSortedMapSortedMap.tailMap(Object)public Short2LongSortedMap subMap(short from, short to)
Short2LongSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Short2LongSortedMapSortedMap.subMap(Object,Object)public Short2LongAVLTreeMap 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.