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>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 associations from this function (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)
Checks whether the given value is contained in
AbstractShort2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractShort2ObjectMap.values(). |
short |
firstShortKey() |
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() |
V |
put(short k,
V v)
Adds a pair to the map.
|
V |
put(Short ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2ObjectMap.Entry<V>> |
short2ObjectEntrySet()
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.
|
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.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapequals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getpublic 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>put in class AbstractShort2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(short k)
Short2ObjectFunctionremove in interface Short2ObjectFunction<V>remove in class AbstractShort2ObjectFunction<V>Function.remove(Object)public V put(Short ok, V ov)
AbstractShort2ObjectFunctionnull 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 V remove(Object ok)
AbstractShort2ObjectFunctionnull 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(Object v)
AbstractShort2ObjectMapAbstractShort2ObjectMap.values().containsValue in interface Map<Short,V>containsValue in class AbstractShort2ObjectMap<V>public void clear()
Functionpublic boolean containsKey(short k)
AbstractShort2ObjectMapAbstractShort2ObjectMap.keySet().containsKey in interface Short2ObjectFunction<V>containsKey in class AbstractShort2ObjectMap<V>Function.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 V get(short k)
Short2ObjectFunctionget in interface Short2ObjectFunction<V>k - the key.Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2ObjectSortedMap<V>SortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2ObjectSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Short2ObjectMap.Entry<V>> short2ObjectEntrySet()
Short2ObjectSortedMapshort2ObjectEntrySet 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.headMap in interface Short2ObjectSortedMap<V>SortedMap.headMap(Object)public Short2ObjectSortedMap<V> tailMap(short from)
Short2ObjectSortedMapfromKey.tailMap in interface Short2ObjectSortedMap<V>SortedMap.tailMap(Object)public Short2ObjectSortedMap<V> subMap(short from, short to)
Short2ObjectSortedMapfromKey, inclusive, to toKey, exclusive.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.