public class Short2ShortAVLTreeMap extends AbstractShort2ShortSortedMap 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.
AbstractShort2ShortMap.BasicEntryShort2ShortSortedMap.FastSortedEntrySetShort2ShortMap.FastEntrySet| Constructor and Description |
|---|
Short2ShortAVLTreeMap()
Creates a new empty tree map.
|
Short2ShortAVLTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2ShortAVLTreeMap(Map<? extends Short,? extends Short> m)
Creates a new tree map copying a given map.
|
Short2ShortAVLTreeMap(short[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2ShortAVLTreeMap(short[] k,
short[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2ShortAVLTreeMap(Short2ShortMap m)
Creates a new tree map copying a given map.
|
Short2ShortAVLTreeMap(Short2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2ShortAVLTreeMap(SortedMap<Short,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).
|
Short2ShortAVLTreeMap |
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
AbstractShort2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractShort2ShortMap.values(). |
short |
firstShortKey() |
short |
get(short k)
Returns the value to which the given key is mapped.
|
Short2ShortSortedMap |
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() |
short |
put(short k,
short v)
Adds a pair to the map.
|
Short |
put(Short ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Short |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
short |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2ShortMap.Entry> |
short2ShortEntrySet()
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.
|
Short2ShortSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2ShortSortedMap |
tailMap(short 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 Short2ShortAVLTreeMap()
public Short2ShortAVLTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2ShortAVLTreeMap(Map<? extends Short,? extends Short> m)
m - a Map to be copied into the new tree map.public Short2ShortAVLTreeMap(SortedMap<Short,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2ShortAVLTreeMap(Short2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Short2ShortAVLTreeMap(Short2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2ShortAVLTreeMap(short[] k,
short[] 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 Short2ShortAVLTreeMap(short[] 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(short k,
short v)
Short2ShortFunctionput in interface Short2ShortFunctionput in class AbstractShort2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(short k)
Short2ShortFunctionremove in interface Short2ShortFunctionremove in class AbstractShort2ShortFunctionk - the key.Function.remove(Object)public Short put(Short ok, Short ov)
AbstractShort2ShortFunctionnull 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.
put in interface Function<Short,Short>put in interface Map<Short,Short>put in class AbstractShort2ShortFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Short remove(Object ok)
AbstractShort2ShortFunctionnull 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)
AbstractShort2ShortMapAbstractShort2ShortMap.values().containsValue in interface Short2ShortMapcontainsValue in class AbstractShort2ShortMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(short k)
AbstractShort2ShortMapAbstractShort2ShortMap.keySet().containsKey in interface Short2ShortFunctioncontainsKey in class AbstractShort2ShortMapFunction.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(short k)
Short2ShortFunctionget in interface Short2ShortFunctionk - the key.Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2ShortSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2ShortMap.Entry> short2ShortEntrySet()
Short2ShortSortedMapshort2ShortEntrySet in interface Short2ShortMapshort2ShortEntrySet in interface Short2ShortSortedMapShort2ShortSortedMap.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 Short2ShortMapkeySet in interface Short2ShortSortedMapkeySet in interface Map<Short,Short>keySet in interface SortedMap<Short,Short>keySet in class AbstractShort2ShortSortedMapMap.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 Short2ShortMapvalues in interface Short2ShortSortedMapvalues in interface Map<Short,Short>values in interface SortedMap<Short,Short>values in class AbstractShort2ShortSortedMapMap.values()public ShortComparator comparator()
Short2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2ShortSortedMapcomparator in interface SortedMap<Short,Short>SortedMap.comparator()public Short2ShortSortedMap headMap(short to)
Short2ShortSortedMaptoKey.headMap in interface Short2ShortSortedMapSortedMap.headMap(Object)public Short2ShortSortedMap tailMap(short from)
Short2ShortSortedMapfromKey.tailMap in interface Short2ShortSortedMapSortedMap.tailMap(Object)public Short2ShortSortedMap subMap(short from, short to)
Short2ShortSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Short2ShortSortedMapSortedMap.subMap(Object,Object)public Short2ShortAVLTreeMap 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.