|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceFunction<V>
it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceMap<V>
it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceSortedMap<V>
it.unimi.dsi.fastutil.shorts.Short2ReferenceRBTreeMap<V>
public class Short2ReferenceRBTreeMap<V>
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.AbstractShort2ReferenceMap |
|---|
AbstractShort2ReferenceMap.BasicEntry<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2ReferenceSortedMap |
|---|
Short2ReferenceSortedMap.FastSortedEntrySet<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.shorts.Short2ReferenceMap |
|---|
Short2ReferenceMap.FastEntrySet<V> |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Short2ReferenceRBTreeMap()
Creates a new empty tree map. |
|
Short2ReferenceRBTreeMap(Comparator<? super Short> c)
Creates a new empty tree map with the given comparator. |
|
Short2ReferenceRBTreeMap(Map<? extends Short,? extends V> m)
Creates a new tree map copying a given map. |
|
Short2ReferenceRBTreeMap(short[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Short2ReferenceRBTreeMap(short[] k,
V[] v,
Comparator<? super Short> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Short2ReferenceRBTreeMap(Short2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map. |
|
Short2ReferenceRBTreeMap(Short2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Short2ReferenceRBTreeMap(SortedMap<Short,V> 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). |
Object |
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 AbstractShort2ReferenceMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractShort2ReferenceMap.values(). |
short |
firstShortKey()
|
V |
get(short k)
Returns the value to which the given key is mapped. |
Short2ReferenceSortedMap<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<Short2ReferenceMap.Entry<V>> |
short2ReferenceEntrySet()
Returns a type-specific 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. |
Short2ReferenceSortedMap<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. |
Short2ReferenceSortedMap<V> |
tailMap(short from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceMap |
|---|
equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ReferenceFunction |
|---|
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.Short2ReferenceFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, equals, get, hashCode, putAll |
| Methods inherited from interface java.util.Map |
|---|
containsKey, equals, get, hashCode, putAll |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
public Short2ReferenceRBTreeMap()
public Short2ReferenceRBTreeMap(Comparator<? super Short> c)
c - a (possibly type-specific) comparator.public Short2ReferenceRBTreeMap(Map<? extends Short,? extends V> m)
m - a Map to be copied into the new tree map.public Short2ReferenceRBTreeMap(SortedMap<Short,V> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Short2ReferenceRBTreeMap(Short2ReferenceMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Short2ReferenceRBTreeMap(Short2ReferenceSortedMap<V> m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Short2ReferenceRBTreeMap(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 Short2ReferenceRBTreeMap(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.| Method Detail |
|---|
public V put(short k,
V v)
Short2ReferenceFunction
put in interface Short2ReferenceFunction<V>put in class AbstractShort2ReferenceFunction<V>k - the key.v - the value.
Function.put(Object,Object)public V remove(short k)
Short2ReferenceFunction
remove in interface Short2ReferenceFunction<V>remove in class AbstractShort2ReferenceFunction<V>Function.remove(Object)
public V put(Short ok,
V ov)
AbstractShort2ReferenceFunctionnull 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,V>put in interface Map<Short,V>put in class AbstractShort2ReferenceFunction<V>ok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public V remove(Object ok)
AbstractShort2ReferenceFunctionnull 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<Short,V>remove in interface Map<Short,V>remove in class AbstractShort2ReferenceFunction<V>null if no value was present for the given key.Map.remove(Object)public boolean containsValue(Object v)
AbstractShort2ReferenceMapAbstractShort2ReferenceMap.values().
containsValue in interface Map<Short,V>containsValue in class AbstractShort2ReferenceMap<V>public void clear()
Function
clear in interface Function<Short,V>clear in interface Map<Short,V>clear in class AbstractShort2ReferenceFunction<V>Map.clear()public boolean containsKey(short k)
AbstractShort2ReferenceMapAbstractShort2ReferenceMap.keySet().
containsKey in interface Short2ReferenceFunction<V>containsKey in class AbstractShort2ReferenceMap<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.
size in interface Function<Short,V>size in interface Map<Short,V>public boolean isEmpty()
isEmpty in interface Map<Short,V>isEmpty in class AbstractShort2ReferenceMap<V>public V get(short k)
Short2ReferenceFunction
get in interface Short2ReferenceFunction<V>k - the key.
Function.get(Object)public short firstShortKey()
firstShortKey in interface Short2ReferenceSortedMap<V>SortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2ReferenceSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Short2ReferenceMap.Entry<V>> short2ReferenceEntrySet()
Short2ReferenceMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Short2ReferenceMap.entrySet()
so that it returns an ObjectSet
of objects of type Short2ReferenceMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
short2ReferenceEntrySet in interface Short2ReferenceMap<V>short2ReferenceEntrySet in interface Short2ReferenceSortedMap<V>Short2ReferenceMap.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 Short2ReferenceMap<V>keySet in interface Short2ReferenceSortedMap<V>keySet in interface Map<Short,V>keySet in class AbstractShort2ReferenceSortedMap<V>Map.keySet()public ReferenceCollection<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 Short2ReferenceMap<V>values in interface Short2ReferenceSortedMap<V>values in interface Map<Short,V>values in class AbstractShort2ReferenceSortedMap<V>Map.values()public ShortComparator comparator()
Short2ReferenceSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Short2ReferenceSortedMap<V>comparator in interface SortedMap<Short,V>SortedMap.comparator()public Short2ReferenceSortedMap<V> headMap(short to)
Short2ReferenceSortedMaptoKey.
headMap in interface Short2ReferenceSortedMap<V>SortedMap.headMap(Object)public Short2ReferenceSortedMap<V> tailMap(short from)
Short2ReferenceSortedMapfromKey.
tailMap in interface Short2ReferenceSortedMap<V>SortedMap.tailMap(Object)
public Short2ReferenceSortedMap<V> subMap(short from,
short to)
Short2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Short2ReferenceSortedMap<V>SortedMap.subMap(Object,Object)public Object 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 Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||