|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2IntFunction
it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap
it.unimi.dsi.fastutil.shorts.AbstractShort2IntSortedMap
it.unimi.dsi.fastutil.shorts.Short2IntRBTreeMap
public class Short2IntRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
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.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap |
|---|
AbstractShort2IntMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntSortedMap |
|---|
Short2IntSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntMap |
|---|
Short2IntMap.FastEntrySet |
| Constructor Summary | |
|---|---|
Short2IntRBTreeMap()
Creates a new empty tree map. |
|
Short2IntRBTreeMap(java.util.Comparator<? super java.lang.Short> c)
Creates a new empty tree map with the given comparator. |
|
Short2IntRBTreeMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> m)
Creates a new tree map copying a given map. |
|
Short2IntRBTreeMap(short[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Short2IntRBTreeMap(short[] k,
int[] v,
java.util.Comparator<? super java.lang.Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Short2IntRBTreeMap(Short2IntMap m)
Creates a new tree map copying a given map. |
|
Short2IntRBTreeMap(Short2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Short2IntRBTreeMap(java.util.SortedMap<java.lang.Short,java.lang.Integer> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
|---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Short2IntRBTreeMap |
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 AbstractShort2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in AbstractShort2IntMap.values(). |
short |
firstShortKey()
|
int |
get(short k)
Returns the value to which the given key is mapped. |
Short2IntSortedMap |
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()
|
int |
put(short k,
int v)
Adds a pair to the map. |
java.lang.Integer |
put(java.lang.Short ok,
java.lang.Integer ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
java.lang.Integer |
remove(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
int |
remove(short k)
Removes the mapping with the given key. |
ObjectSortedSet<Short2IntMap.Entry> |
short2IntEntrySet()
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. |
Short2IntSortedMap |
subMap(short from,
short to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Short2IntSortedMap |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
IntCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntFunction |
|---|
containsKey, defaultReturnValue, defaultReturnValue, get |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2IntFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, containsValue, equals, get, hashCode, putAll |
| Constructor Detail |
|---|
public Short2IntRBTreeMap()
public Short2IntRBTreeMap(java.util.Comparator<? super java.lang.Short> c)
c - a (possibly type-specific) comparator.public Short2IntRBTreeMap(java.util.Map<? extends java.lang.Short,? extends java.lang.Integer> m)
m - a Map to be copied into the new tree map.public Short2IntRBTreeMap(java.util.SortedMap<java.lang.Short,java.lang.Integer> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Short2IntRBTreeMap(Short2IntMap m)
m - a type-specific map to be copied into the new tree map.public Short2IntRBTreeMap(Short2IntSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Short2IntRBTreeMap(short[] k,
int[] v,
java.util.Comparator<? super java.lang.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.
java.lang.IllegalArgumentException - if k and v have different lengths.
public Short2IntRBTreeMap(short[] k,
int[] 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.| Method Detail |
|---|
public int put(short k,
int v)
Short2IntFunction
put in interface Short2IntFunctionput in class AbstractShort2IntFunctionk - the key.v - the value.
Function.put(Object,Object)public int remove(short k)
Short2IntFunction
remove in interface Short2IntFunctionremove in class AbstractShort2IntFunctionFunction.remove(Object)
public java.lang.Integer put(java.lang.Short ok,
java.lang.Integer ov)
AbstractShort2IntFunctionnull 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.Short,java.lang.Integer>put in interface java.util.Map<java.lang.Short,java.lang.Integer>put in class AbstractShort2IntFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public java.lang.Integer remove(java.lang.Object ok)
AbstractShort2IntFunctionnull 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.Short,java.lang.Integer>remove in interface java.util.Map<java.lang.Short,java.lang.Integer>remove in class AbstractShort2IntFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(int v)
AbstractShort2IntMapAbstractShort2IntMap.values().
containsValue in interface Short2IntMapcontainsValue in class AbstractShort2IntMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<java.lang.Short,java.lang.Integer>clear in interface java.util.Map<java.lang.Short,java.lang.Integer>clear in class AbstractShort2IntFunctionMap.clear()public boolean containsKey(short k)
AbstractShort2IntMapAbstractShort2IntMap.keySet().
containsKey in interface Short2IntFunctioncontainsKey in class AbstractShort2IntMapFunction.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.
size in interface Function<java.lang.Short,java.lang.Integer>size in interface java.util.Map<java.lang.Short,java.lang.Integer>public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Short,java.lang.Integer>isEmpty in class AbstractShort2IntMappublic int get(short k)
Short2IntFunction
get in interface Short2IntFunctionk - the key.
Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2IntSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Short2IntMap.Entry> short2IntEntrySet()
Short2IntSortedMap
short2IntEntrySet in interface Short2IntMapshort2IntEntrySet in interface Short2IntSortedMapShort2IntSortedMap.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 Short2IntMapkeySet in interface Short2IntSortedMapkeySet in interface java.util.Map<java.lang.Short,java.lang.Integer>keySet in interface java.util.SortedMap<java.lang.Short,java.lang.Integer>keySet in class AbstractShort2IntSortedMapMap.keySet()public IntCollection 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 Short2IntMapvalues in interface Short2IntSortedMapvalues in interface java.util.Map<java.lang.Short,java.lang.Integer>values in interface java.util.SortedMap<java.lang.Short,java.lang.Integer>values in class AbstractShort2IntSortedMapMap.values()public ShortComparator comparator()
Short2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2IntSortedMapcomparator in interface java.util.SortedMap<java.lang.Short,java.lang.Integer>SortedMap.comparator()public Short2IntSortedMap headMap(short to)
Short2IntSortedMaptoKey.
headMap in interface Short2IntSortedMapSortedMap.headMap(Object)public Short2IntSortedMap tailMap(short from)
Short2IntSortedMapfromKey.
tailMap in interface Short2IntSortedMapSortedMap.tailMap(Object)
public Short2IntSortedMap subMap(short from,
short to)
Short2IntSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Short2IntSortedMapSortedMap.subMap(Object,Object)public Short2IntRBTreeMap 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
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||