|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2ByteMap
it.unimi.dsi.fastutil.shorts.AbstractShort2ByteSortedMap
it.unimi.dsi.fastutil.shorts.Short2ByteRBTreeMap
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.AbstractShort2ByteMap |
AbstractShort2ByteMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Short2ByteRBTreeMap()
Creates a new empty tree map. |
|
Short2ByteRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Short2ByteRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Short2ByteRBTreeMap(Short2ByteMap m)
Creates a new tree map copying a given map. |
|
Short2ByteRBTreeMap(Short2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Short2ByteRBTreeMap(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(byte 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.
|
byte |
get(short k)
Returns the value to which the given key is mapped. |
Short2ByteSortedMap |
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.
|
byte |
put(short k,
byte 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.
|
byte |
remove(short k)
Removes the mapping with the given key. |
int |
size()
|
Short2ByteSortedMap |
subMap(short from,
short to)
|
Short2ByteSortedMap |
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.AbstractShort2ByteSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ByteMap |
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.Short2ByteMap |
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 Short2ByteRBTreeMap()
public Short2ByteRBTreeMap(Comparator c)
c - a Comparator.public Short2ByteRBTreeMap(Map m)
m - a Map to be copied into the new tree map.public Short2ByteRBTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Short2ByteRBTreeMap(Short2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Short2ByteRBTreeMap(Short2ByteSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final byte put(short k,
byte v)
Short2ByteMap
put in interface Short2ByteMapput in class AbstractShort2ByteMappublic final byte remove(short k)
Short2ByteMap
remove in interface Short2ByteMapremove in class AbstractShort2ByteMap
public Object put(Object ok,
Object ov)
AbstractShort2ByteMapnull 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 AbstractShort2ByteMappublic Object remove(Object ok)
AbstractShort2ByteMapnull 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 AbstractShort2ByteMappublic boolean containsValue(byte v)
AbstractShort2ByteMapAbstractShort2ByteMap.values().
containsValue in interface Short2ByteMapcontainsValue in class AbstractShort2ByteMappublic void clear()
clear in interface Mapclear in class AbstractShort2ByteMappublic boolean containsKey(short k)
AbstractShort2ByteMapAbstractShort2ByteMap.keySet().
containsKey in interface Short2ByteMapcontainsKey in class AbstractShort2ByteMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractShort2ByteMappublic byte get(short k)
Short2ByteMap
get in interface Short2ByteMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractShort2ByteMapnull 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 AbstractShort2ByteMappublic short firstShortKey()
firstShortKey in interface Short2ByteSortedMapSortedMap.firstKey()public short lastShortKey()
lastShortKey in interface Short2ByteSortedMapSortedMap.lastKey()public Object firstKey()
AbstractShort2ByteSortedMap
firstKey in interface SortedMapfirstKey in class AbstractShort2ByteSortedMappublic Object lastKey()
AbstractShort2ByteSortedMap
lastKey in interface SortedMaplastKey in class AbstractShort2ByteSortedMappublic 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 AbstractShort2ByteSortedMappublic 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 AbstractShort2ByteMappublic Comparator comparator()
comparator in interface SortedMappublic Short2ByteSortedMap headMap(short to)
headMap in interface Short2ByteSortedMapSortedMap.headMap(Object)public Short2ByteSortedMap tailMap(short from)
tailMap in interface Short2ByteSortedMapSortedMap.tailMap(Object)
public Short2ByteSortedMap subMap(short from,
short to)
subMap in interface Short2ByteSortedMapSortedMap.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 | |||||||||