public class Short2ObjectRBTreeMap<V> extends AbstractShort2ObjectSortedMap<V> 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.
AbstractShort2ObjectMap.BasicEntry<V>, AbstractShort2ObjectMap.BasicEntrySet<V>Short2ObjectSortedMap.FastSortedEntrySet<V>Short2ObjectMap.FastEntrySet<V>| Constructor and Description |
|---|
Short2ObjectRBTreeMap()
Creates a new empty tree map.
|
Short2ObjectRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2ObjectRBTreeMap(Map<? extends Short,? extends V> m)
Creates a new tree map copying a given map.
|
Short2ObjectRBTreeMap(short[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2ObjectRBTreeMap(short[] k,
V[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Short2ObjectRBTreeMap(Short2ObjectMap<? extends V> m)
Creates a new tree map copying a given map.
|
Short2ObjectRBTreeMap(Short2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2ObjectRBTreeMap(SortedMap<Short,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Short2ObjectRBTreeMap<V> |
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)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(Object v) |
short |
firstShortKey()
Returns the first (lowest) key currently in this map.
|
V |
get(short k)
Returns the value to which the given key is mapped.
|
Short2ObjectSortedMap<V> |
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()
Returns the last (highest) key currently in this map.
|
V |
put(short k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(short k)
Removes the mapping with the given key (optional operation).
|
ObjectSortedSet<Short2ObjectMap.Entry<V>> |
short2ObjectEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
size()
Returns the number of key/value mappings in this map.
|
Short2ObjectSortedMap<V> |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2ObjectSortedMap<V> |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
ObjectCollection<V> |
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, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplypublic Short2ObjectRBTreeMap()
public Short2ObjectRBTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2ObjectRBTreeMap(Map<? extends Short,? extends V> m)
m - a Map to be copied into the new tree map.public Short2ObjectRBTreeMap(SortedMap<Short,V> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2ObjectRBTreeMap(Short2ObjectMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Short2ObjectRBTreeMap(Short2ObjectSortedMap<V> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2ObjectRBTreeMap(short[] k,
V[] 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 Short2ObjectRBTreeMap(short[] k,
V[] 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 V put(short k, V v)
Short2ObjectFunctionput in interface Short2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(short k)
Short2ObjectFunctionremove in interface Short2ObjectFunction<V>k - the key.Function.remove(Object)public boolean containsValue(Object v)
containsValue in interface Map<Short,V>containsValue in class AbstractShort2ObjectMap<V>public void clear()
Short2ObjectMapclear in interface Short2ObjectMap<V>clear in interface Map<Short,V>Map.clear()public boolean containsKey(short k)
Short2ObjectMapcontainsKey in interface Short2ObjectFunction<V>containsKey in interface Short2ObjectMap<V>containsKey in class AbstractShort2ObjectMap<V>k - the key.key.Map.containsKey(Object)public int size()
Short2ObjectMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public V get(short k)
Short2ObjectFunctionget in interface Short2ObjectFunction<V>k - the key.Function.get(Object)public short firstShortKey()
Short2ObjectSortedMapfirstShortKey in interface Short2ObjectSortedMap<V>SortedMap.firstKey()public short lastShortKey()
Short2ObjectSortedMaplastShortKey in interface Short2ObjectSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Short2ObjectMap.Entry<V>> short2ObjectEntrySet()
Short2ObjectSortedMapNote that this specification strengthens the one given in the corresponding type-specific unsorted map.
short2ObjectEntrySet in interface Short2ObjectMap<V>short2ObjectEntrySet in interface Short2ObjectSortedMap<V>Short2ObjectSortedMap.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 Short2ObjectMap<V>keySet in interface Short2ObjectSortedMap<V>keySet in interface Map<Short,V>keySet in interface SortedMap<Short,V>keySet in class AbstractShort2ObjectSortedMap<V>Map.keySet()public ObjectCollection<V> 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 Short2ObjectMap<V>values in interface Short2ObjectSortedMap<V>values in interface Map<Short,V>values in interface SortedMap<Short,V>values in class AbstractShort2ObjectSortedMap<V>Map.values()public ShortComparator comparator()
Short2ObjectSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2ObjectSortedMap<V>comparator in interface SortedMap<Short,V>SortedMap.comparator()public Short2ObjectSortedMap<V> headMap(short to)
Short2ObjectSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Short2ObjectSortedMap<V>SortedMap.headMap(Object)public Short2ObjectSortedMap<V> tailMap(short from)
Short2ObjectSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Short2ObjectSortedMap<V>SortedMap.tailMap(Object)public Short2ObjectSortedMap<V> subMap(short from, short to)
Short2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Short2ObjectSortedMap<V>SortedMap.subMap(Object,Object)public Short2ObjectRBTreeMap<V> 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.