public class Int2ShortRBTreeMap 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.BasicEntry, AbstractInt2ShortMap.BasicEntrySetInt2ShortSortedMap.FastSortedEntrySetInt2ShortMap.FastEntrySet| Constructor and Description |
|---|
Int2ShortRBTreeMap()
Creates a new empty tree map.
|
Int2ShortRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2ShortRBTreeMap(int[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2ShortRBTreeMap(int[] k,
short[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2ShortRBTreeMap(Int2ShortMap m)
Creates a new tree map copying a given map.
|
Int2ShortRBTreeMap(Int2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Int2ShortRBTreeMap(Map<? extends Integer,? extends Short> m)
Creates a new tree map copying a given map.
|
Int2ShortRBTreeMap(SortedMap<Integer,Short> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(int k,
short incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Int2ShortRBTreeMap |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(short v)
Returns
true if this map maps one or more keys to the specified value. |
int |
firstIntKey()
Returns the first (lowest) key currently in this map.
|
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()
Returns the last (highest) key currently in this map.
|
short |
put(int k,
short v)
Adds a pair to the map (optional operation).
|
short |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
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.
|
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, replaceapplyAsIntandThen, compose, identitypublic Int2ShortRBTreeMap()
public Int2ShortRBTreeMap(Comparator<? super Integer> c)
c - a (possibly type-specific) comparator.public Int2ShortRBTreeMap(Map<? extends Integer,? extends Short> m)
m - a Map to be copied into the new tree map.public Int2ShortRBTreeMap(SortedMap<Integer,Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Int2ShortRBTreeMap(Int2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Int2ShortRBTreeMap(Int2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Int2ShortRBTreeMap(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 Int2ShortRBTreeMap(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 addTo(int k,
short 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 short put(int k,
short v)
Int2ShortFunctionput in interface Int2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(int k)
Int2ShortFunctionremove in interface Int2ShortFunctionk - the key.Function.remove(Object)public boolean containsValue(short v)
Int2ShortMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2ShortMapcontainsValue in class AbstractInt2ShortMapMap.containsValue(Object)public void clear()
Int2ShortMapclear in interface Int2ShortMapclear in interface Map<Integer,Short>Map.clear()public boolean containsKey(int k)
Int2ShortMapcontainsKey in interface Int2ShortFunctioncontainsKey in interface Int2ShortMapcontainsKey in class AbstractInt2ShortMapk - the key.key.Map.containsKey(Object)public int size()
Int2ShortMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public short get(int k)
Int2ShortFunctionget in interface Int2ShortFunctionk - the key.Function.get(Object)public int firstIntKey()
Int2ShortSortedMapfirstIntKey in interface Int2ShortSortedMapSortedMap.firstKey()public int lastIntKey()
Int2ShortSortedMaplastIntKey in interface Int2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Int2ShortMap.Entry> int2ShortEntrySet()
Int2ShortSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
int2ShortEntrySet 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.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Int2ShortSortedMapSortedMap.headMap(Object)public Int2ShortSortedMap tailMap(int from)
Int2ShortSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Int2ShortSortedMapSortedMap.tailMap(Object)public Int2ShortSortedMap subMap(int from, int to)
Int2ShortSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Int2ShortSortedMapSortedMap.subMap(Object,Object)public Int2ShortRBTreeMap 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.