|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2ByteMap
it.unimi.dsi.fastutil.objects.AbstractObject2ByteSortedMap
it.unimi.dsi.fastutil.objects.Object2ByteRBTreeMap
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.objects.AbstractObject2ByteMap |
AbstractObject2ByteMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Object2ByteRBTreeMap()
Creates a new empty tree map. |
|
Object2ByteRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Object2ByteRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Object2ByteRBTreeMap(Object2ByteMap m)
Creates a new tree map copying a given map. |
|
Object2ByteRBTreeMap(Object2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Object2ByteRBTreeMap(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(Object 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. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
byte |
getByte(Object k)
Returns the value to which the given key is mapped. |
SortedMap |
headMap(Object to)
Delegates to the corresponding type-specific method. |
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. |
byte |
put(Object k,
byte v)
Adds a pair to the map. |
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
byte |
removeByte(Object k)
Removes the mapping with the given key. |
int |
size()
|
SortedMap |
subMap(Object from,
Object to)
Delegates to the corresponding type-specific method. |
SortedMap |
tailMap(Object from)
Delegates to the corresponding type-specific method. |
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ByteMap |
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.objects.Object2ByteMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
| Methods inherited from interface java.util.Map |
containsValue, equals, hashCode, putAll |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public Object2ByteRBTreeMap()
public Object2ByteRBTreeMap(Comparator c)
c - a Comparator.public Object2ByteRBTreeMap(Map m)
m - a Map to be copied into the new tree map.public Object2ByteRBTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Object2ByteRBTreeMap(Object2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Object2ByteRBTreeMap(Object2ByteSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final byte put(Object k,
byte v)
Object2ByteMap
put in interface Object2ByteMapput in class AbstractObject2ByteMappublic final byte removeByte(Object k)
Object2ByteMap
removeByte in interface Object2ByteMapremoveByte in class AbstractObject2ByteMap
public Object put(Object ok,
Object ov)
AbstractObject2ByteMapnull 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 AbstractObject2ByteMappublic Object remove(Object ok)
AbstractObject2ByteMapnull 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 AbstractObject2ByteMappublic boolean containsValue(byte v)
AbstractObject2ByteMapAbstractObject2ByteMap.values().
containsValue in interface Object2ByteMapcontainsValue in class AbstractObject2ByteMappublic void clear()
clear in interface Mapclear in class AbstractObject2ByteMappublic boolean containsKey(Object k)
AbstractObject2ByteMapAbstractObject2ByteMap.keySet().
containsKey in interface MapcontainsKey in class AbstractObject2ByteMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractObject2ByteMappublic byte getByte(Object k)
Object2ByteMap
getByte in interface Object2ByteMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractObject2ByteMapnull 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 AbstractObject2ByteMappublic Object firstKey()
AbstractObject2ByteSortedMap
firstKey in interface SortedMapfirstKey in class AbstractObject2ByteSortedMappublic Object lastKey()
AbstractObject2ByteSortedMap
lastKey in interface SortedMaplastKey in class AbstractObject2ByteSortedMappublic 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 AbstractObject2ByteSortedMappublic 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 AbstractObject2ByteMappublic Comparator comparator()
comparator in interface SortedMappublic SortedMap headMap(Object to)
AbstractObject2ByteSortedMap
headMap in interface SortedMapheadMap in class AbstractObject2ByteSortedMappublic SortedMap tailMap(Object from)
AbstractObject2ByteSortedMap
tailMap in interface SortedMaptailMap in class AbstractObject2ByteSortedMap
public SortedMap subMap(Object from,
Object to)
AbstractObject2ByteSortedMap
subMap in interface SortedMapsubMap in class AbstractObject2ByteSortedMappublic 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 | |||||||||