|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2LongMap
it.unimi.dsi.fastutil.shorts.AbstractShort2LongSortedMap
it.unimi.dsi.fastutil.shorts.Short2LongRBTreeMap
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 inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2LongMap |
AbstractShort2LongMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Short2LongRBTreeMap()
Creates a new empty tree map. |
|
Short2LongRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Short2LongRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Short2LongRBTreeMap(Short2LongMap m)
Creates a new tree map copying a given map. |
|
Short2LongRBTreeMap(Short2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Short2LongRBTreeMap(SortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree map. |
Comparator |
comparator()
|
boolean |
containsKey(short k)
Checks whether the given value is contained in keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in values(). |
Set |
entrySet()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
short |
firstShortKey()
|
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
long |
get(short k)
Returns the value to which the given key is mapped. |
Short2LongSortedMap |
headMap(short to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
Object |
lastKey()
Delegates to the corresponding type-specific method. |
short |
lastShortKey()
|
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
long |
put(short k,
long v)
Adds a pair to the map. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
long |
remove(short k)
Removes the mapping with the given key. |
int |
size()
|
Short2LongSortedMap |
subMap(short from,
short to)
|
Short2LongSortedMap |
tailMap(short from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2LongSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2LongMap |
containsKey, containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, hashCode, putAll, setDefRetValue, toString |
| Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2LongMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
| Methods inherited from interface java.util.Map |
containsKey, containsValue, equals, hashCode, putAll |
| Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public Short2LongRBTreeMap()
public Short2LongRBTreeMap(Comparator c)
c - a Comparator.public Short2LongRBTreeMap(Map m)
m - a Map to be copied into the new tree map.public Short2LongRBTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Short2LongRBTreeMap(Short2LongMap m)
m - a type-specific map to be copied into the new tree map.public Short2LongRBTreeMap(Short2LongSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final long put(short k,
long v)
Short2LongMap
put in interface Short2LongMapput in class AbstractShort2LongMappublic final long remove(short k)
Short2LongMap
remove in interface Short2LongMapremove in class AbstractShort2LongMap
public Object put(Object ok,
Object ov)
AbstractShort2LongMapnull 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 Mapput in class AbstractShort2LongMappublic Object remove(Object ok)
AbstractShort2LongMapnull 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 Mapremove in class AbstractShort2LongMappublic boolean containsValue(long v)
AbstractShort2LongMapAbstractShort2LongMap.values().
containsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMappublic void clear()
clear in interface Mapclear in class AbstractShort2LongMappublic boolean containsKey(short k)
AbstractShort2LongMapAbstractShort2LongMap.keySet().
containsKey in interface Short2LongMapcontainsKey in class AbstractShort2LongMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractShort2LongMappublic long get(short k)
Short2LongMap
get in interface Short2LongMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractShort2LongMapnull 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.
get in interface Mapget in class AbstractShort2LongMappublic short firstShortKey()
firstShortKey in interface Short2LongSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2LongSortedMapSortedMap.lastKey()public Object firstKey()
AbstractShort2LongSortedMap
firstKey in interface SortedMapfirstKey in class AbstractShort2LongSortedMappublic Object lastKey()
AbstractShort2LongSortedMap
lastKey in interface SortedMaplastKey in class AbstractShort2LongSortedMappublic Set entrySet()
entrySet in interface Mappublic Set 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 MapkeySet in class AbstractShort2LongSortedMappublic Collection 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 Mapvalues in class AbstractShort2LongMappublic Comparator comparator()
comparator in interface SortedMappublic Short2LongSortedMap headMap(short to)
headMap in interface Short2LongSortedMapSortedMap.headMap(Object)public Short2LongSortedMap tailMap(short from)
tailMap in interface Short2LongSortedMapSortedMap.tailMap(Object)
public Short2LongSortedMap subMap(short from,
short to)
subMap in interface Short2LongSortedMapSortedMap.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.
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||