public class Short2BooleanAVLTreeMap extends AbstractShort2BooleanSortedMap 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.
AbstractShort2BooleanMap.BasicEntryShort2BooleanSortedMap.FastSortedEntrySetShort2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Short2BooleanAVLTreeMap()
Creates a new empty tree map.
|
Short2BooleanAVLTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator.
|
Short2BooleanAVLTreeMap(Map<? extends Short,? extends Boolean> m)
Creates a new tree map copying a given map.
|
Short2BooleanAVLTreeMap(short[] k,
boolean[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Short2BooleanAVLTreeMap(short[] k,
boolean[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Short2BooleanAVLTreeMap(Short2BooleanMap m)
Creates a new tree map copying a given map.
|
Short2BooleanAVLTreeMap(Short2BooleanSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Short2BooleanAVLTreeMap(SortedMap<Short,Boolean> 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).
|
Short2BooleanAVLTreeMap |
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
AbstractShort2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractShort2BooleanMap.values(). |
short |
firstShortKey() |
boolean |
get(short k)
Returns the value to which the given key is mapped.
|
Short2BooleanSortedMap |
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() |
boolean |
put(short k,
boolean v)
Adds a pair to the map.
|
Boolean |
put(Short ok,
Boolean ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
Boolean |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
boolean |
remove(short k)
Removes the mapping with the given key.
|
ObjectSortedSet<Short2BooleanMap.Entry> |
short2BooleanEntrySet()
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.
|
Short2BooleanSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Short2BooleanSortedMap |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
BooleanCollection |
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 Short2BooleanAVLTreeMap()
public Short2BooleanAVLTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2BooleanAVLTreeMap(Map<? extends Short,? extends Boolean> m)
m - a Map to be copied into the new tree map.public Short2BooleanAVLTreeMap(SortedMap<Short,Boolean> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Short2BooleanAVLTreeMap(Short2BooleanMap m)
m - a type-specific map to be copied into the new tree map.public Short2BooleanAVLTreeMap(Short2BooleanSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Short2BooleanAVLTreeMap(short[] k,
boolean[] 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 Short2BooleanAVLTreeMap(short[] k,
boolean[] 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 boolean put(short k,
boolean v)
Short2BooleanFunctionput in interface Short2BooleanFunctionput in class AbstractShort2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(short k)
Short2BooleanFunctionremove in interface Short2BooleanFunctionremove in class AbstractShort2BooleanFunctionk - the key.Function.remove(Object)@Deprecated public Boolean put(Short ok, Boolean ov)
null 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,Boolean>put in interface Map<Short,Boolean>put in class AbstractShort2BooleanFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Boolean remove(Object ok)
null 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(boolean v)
AbstractShort2BooleanMapAbstractShort2BooleanMap.values().containsValue in interface Short2BooleanMapcontainsValue in class AbstractShort2BooleanMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(short k)
AbstractShort2BooleanMapAbstractShort2BooleanMap.keySet().containsKey in interface Short2BooleanFunctioncontainsKey in class AbstractShort2BooleanMapFunction.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 boolean get(short k)
Short2BooleanFunctionget in interface Short2BooleanFunctionk - the key.Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2BooleanSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2BooleanSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2BooleanMap.Entry> short2BooleanEntrySet()
Short2BooleanSortedMapshort2BooleanEntrySet in interface Short2BooleanMapshort2BooleanEntrySet in interface Short2BooleanSortedMapShort2BooleanSortedMap.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 Short2BooleanMapkeySet in interface Short2BooleanSortedMapkeySet in interface Map<Short,Boolean>keySet in interface SortedMap<Short,Boolean>keySet in class AbstractShort2BooleanSortedMapMap.keySet()public BooleanCollection 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 Short2BooleanMapvalues in interface Short2BooleanSortedMapvalues in interface Map<Short,Boolean>values in interface SortedMap<Short,Boolean>values in class AbstractShort2BooleanSortedMapMap.values()public ShortComparator comparator()
Short2BooleanSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Short2BooleanSortedMapcomparator in interface SortedMap<Short,Boolean>SortedMap.comparator()public Short2BooleanSortedMap headMap(short to)
Short2BooleanSortedMaptoKey.headMap in interface Short2BooleanSortedMapSortedMap.headMap(Object)public Short2BooleanSortedMap tailMap(short from)
Short2BooleanSortedMapfromKey.tailMap in interface Short2BooleanSortedMapSortedMap.tailMap(Object)public Short2BooleanSortedMap subMap(short from, short to)
Short2BooleanSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Short2BooleanSortedMapSortedMap.subMap(Object,Object)public Short2BooleanAVLTreeMap 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.