public class Int2ShortAVLTreeMap extends AbstractInt2ShortSortedMap 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.
AbstractInt2ShortMap.BasicEntryInt2ShortSortedMap.FastSortedEntrySetInt2ShortMap.FastEntrySet| Constructor and Description |
|---|
Int2ShortAVLTreeMap()
Creates a new empty tree map.
|
Int2ShortAVLTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ShortAVLTreeMap(int[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ShortAVLTreeMap(int[] k,
short[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2ShortAVLTreeMap(Int2ShortMap m)
Creates a new tree map copying a given map.
|
Int2ShortAVLTreeMap(Int2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2ShortAVLTreeMap(Map<? extends Integer,? extends Short> m)
Creates a new tree map copying a given map.
|
Int2ShortAVLTreeMap(SortedMap<Integer,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).
|
Int2ShortAVLTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractInt2ShortMap.values(). |
int |
firstIntKey() |
short |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ShortSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
ObjectSortedSet<Int2ShortMap.Entry> |
int2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey() |
Short |
put(Integer ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
short |
put(int k,
short v)
Adds a pair to the map.
|
short |
remove(int 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.
|
Int2ShortSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Int2ShortSortedMap |
tailMap(int 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 Int2ShortAVLTreeMap()
public Int2ShortAVLTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2ShortAVLTreeMap(Map<? extends Integer,? extends Short> m)
m - a Map to be copied into the new tree map.public Int2ShortAVLTreeMap(SortedMap<Integer,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2ShortAVLTreeMap(Int2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Int2ShortAVLTreeMap(Int2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2ShortAVLTreeMap(int[] k,
short[] v,
Comparator<? super Integer> 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 Int2ShortAVLTreeMap(int[] 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(int k,
short v)
Int2ShortFunctionput in interface Int2ShortFunctionput in class AbstractInt2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(int k)
Int2ShortFunctionremove in interface Int2ShortFunctionremove in class AbstractInt2ShortFunctionk - the key.Function.remove(Object)public Short put(Integer ok, Short ov)
AbstractInt2ShortFunctionnull 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<Integer,Short>put in interface Map<Integer,Short>put in class AbstractInt2ShortFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Short remove(Object ok)
AbstractInt2ShortFunctionnull 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)
AbstractInt2ShortMapAbstractInt2ShortMap.values().containsValue in interface Int2ShortMapcontainsValue in class AbstractInt2ShortMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(int k)
AbstractInt2ShortMapAbstractInt2ShortMap.keySet().containsKey in interface Int2ShortFunctioncontainsKey in class AbstractInt2ShortMapFunction.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(int k)
Int2ShortFunctionget in interface Int2ShortFunctionk - the key.Function.get(Object)public int firstIntKey()
firstIntKey in interface Int2ShortSortedMapSortedMap.firstKey()public int lastIntKey()
lastIntKey in interface Int2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2ShortMap.Entry> int2ShortEntrySet()
Int2ShortSortedMapint2ShortEntrySet in interface Int2ShortMapint2ShortEntrySet in interface Int2ShortSortedMapInt2ShortSortedMap.entrySet()public IntSortedSet 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 Int2ShortMapkeySet in interface Int2ShortSortedMapkeySet in interface Map<Integer,Short>keySet in interface SortedMap<Integer,Short>keySet in class AbstractInt2ShortSortedMapMap.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 Int2ShortMapvalues in interface Int2ShortSortedMapvalues in interface Map<Integer,Short>values in interface SortedMap<Integer,Short>values in class AbstractInt2ShortSortedMapMap.values()public IntComparator comparator()
Int2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Int2ShortSortedMapcomparator in interface SortedMap<Integer,Short>SortedMap.comparator()public Int2ShortSortedMap headMap(int to)
Int2ShortSortedMaptoKey.headMap in interface Int2ShortSortedMapSortedMap.headMap(Object)public Int2ShortSortedMap tailMap(int from)
Int2ShortSortedMapfromKey.tailMap in interface Int2ShortSortedMapSortedMap.tailMap(Object)public Int2ShortSortedMap subMap(int from, int to)
Int2ShortSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Int2ShortSortedMapSortedMap.subMap(Object,Object)public Int2ShortAVLTreeMap 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.