public class Char2ShortRBTreeMap extends AbstractChar2ShortSortedMap implements java.io.Serializable, java.lang.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.
AbstractChar2ShortMap.BasicEntryChar2ShortSortedMap.FastSortedEntrySetChar2ShortMap.FastEntrySet| Constructor and Description |
|---|
Char2ShortRBTreeMap()
Creates a new empty tree map.
|
Char2ShortRBTreeMap(char[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2ShortRBTreeMap(char[] k,
short[] v,
java.util.Comparator<? super java.lang.Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2ShortRBTreeMap(Char2ShortMap m)
Creates a new tree map copying a given map.
|
Char2ShortRBTreeMap(Char2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Char2ShortRBTreeMap(java.util.Comparator<? super java.lang.Character> c)
Creates a new empty tree map with the given comparator.
|
Char2ShortRBTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Short> m)
Creates a new tree map copying a given map.
|
Char2ShortRBTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Short> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(char k,
short incr)
Adds an increment to value currently associated with a key.
|
ObjectSortedSet<Char2ShortMap.Entry> |
char2ShortEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2ShortRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
CharComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(char k)
Checks whether the given value is contained in
AbstractChar2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractChar2ShortMap.values(). |
char |
firstCharKey() |
short |
get(char k)
Returns the value to which the given key is mapped.
|
Char2ShortSortedMap |
headMap(char to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
CharSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
char |
lastCharKey() |
java.lang.Short |
put(java.lang.Character ok,
java.lang.Short ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
short |
put(char k,
short v)
Adds a pair to the map.
|
short |
remove(char k)
Removes the mapping with the given key.
|
java.lang.Short |
remove(java.lang.Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Char2ShortSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Char2ShortSortedMap |
tailMap(char 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, getpublic Char2ShortRBTreeMap()
public Char2ShortRBTreeMap(java.util.Comparator<? super java.lang.Character> c)
c - a (possibly type-specific) comparator.public Char2ShortRBTreeMap(java.util.Map<? extends java.lang.Character,? extends java.lang.Short> m)
m - a Map to be copied into the new tree map.public Char2ShortRBTreeMap(java.util.SortedMap<java.lang.Character,java.lang.Short> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Char2ShortRBTreeMap(Char2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Char2ShortRBTreeMap(Char2ShortSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Char2ShortRBTreeMap(char[] k,
short[] v,
java.util.Comparator<? super java.lang.Character> 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.java.lang.IllegalArgumentException - if k and v have different lengths.public Char2ShortRBTreeMap(char[] k,
short[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.java.lang.IllegalArgumentException - if k and v have different lengths.public short addTo(char 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(char k,
short v)
Char2ShortFunctionput in interface Char2ShortFunctionput in class AbstractChar2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(char k)
Char2ShortFunctionremove in interface Char2ShortFunctionremove in class AbstractChar2ShortFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Short put(java.lang.Character ok,
java.lang.Short 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<java.lang.Character,java.lang.Short>put in interface java.util.Map<java.lang.Character,java.lang.Short>put in class AbstractChar2ShortFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Short remove(java.lang.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.
remove in interface Function<java.lang.Character,java.lang.Short>remove in interface java.util.Map<java.lang.Character,java.lang.Short>remove in class AbstractChar2ShortFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(short v)
AbstractChar2ShortMapAbstractChar2ShortMap.values().containsValue in interface Char2ShortMapcontainsValue in class AbstractChar2ShortMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Character,java.lang.Short>clear in interface java.util.Map<java.lang.Character,java.lang.Short>clear in class AbstractChar2ShortFunctionMap.clear()public boolean containsKey(char k)
AbstractChar2ShortMapAbstractChar2ShortMap.keySet().containsKey in interface Char2ShortFunctioncontainsKey in class AbstractChar2ShortMapFunction.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()
isEmpty in interface java.util.Map<java.lang.Character,java.lang.Short>isEmpty in class AbstractChar2ShortMappublic short get(char k)
Char2ShortFunctionget in interface Char2ShortFunctionk - the key.Function.get(Object)public char firstCharKey()
firstCharKey in interface Char2ShortSortedMapSortedMap.firstKey()public char lastCharKey()
lastCharKey in interface Char2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Char2ShortMap.Entry> char2ShortEntrySet()
Char2ShortSortedMapchar2ShortEntrySet in interface Char2ShortMapchar2ShortEntrySet in interface Char2ShortSortedMapChar2ShortSortedMap.entrySet()public CharSortedSet 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 Char2ShortMapkeySet in interface Char2ShortSortedMapkeySet in interface java.util.Map<java.lang.Character,java.lang.Short>keySet in interface java.util.SortedMap<java.lang.Character,java.lang.Short>keySet in class AbstractChar2ShortSortedMapMap.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 Char2ShortMapvalues in interface Char2ShortSortedMapvalues in interface java.util.Map<java.lang.Character,java.lang.Short>values in interface java.util.SortedMap<java.lang.Character,java.lang.Short>values in class AbstractChar2ShortSortedMapMap.values()public CharComparator comparator()
Char2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Char2ShortSortedMapcomparator in interface java.util.SortedMap<java.lang.Character,java.lang.Short>SortedMap.comparator()public Char2ShortSortedMap headMap(char to)
Char2ShortSortedMaptoKey.headMap in interface Char2ShortSortedMapSortedMap.headMap(Object)public Char2ShortSortedMap tailMap(char from)
Char2ShortSortedMapfromKey.tailMap in interface Char2ShortSortedMapSortedMap.tailMap(Object)public Char2ShortSortedMap subMap(char from, char to)
Char2ShortSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Char2ShortSortedMapSortedMap.subMap(Object,Object)public Char2ShortRBTreeMap 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.
clone in class java.lang.Object