|
||||||||||
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(Object[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Object2ByteRBTreeMap(Object[] k,
byte[] v,
Comparator c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
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.public Object2ByteRBTreeMap(Object[] k, byte[] v, Comparator 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 Object2ByteRBTreeMap(Object[] k, byte[] 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 byte put(Object k, byte v)
Object2ByteMap
put
in interface Object2ByteMap
put
in class AbstractObject2ByteMap
public byte removeByte(Object k)
Object2ByteMap
removeByte
in interface Object2ByteMap
removeByte
in class AbstractObject2ByteMap
public Object put(Object ok, Object ov)
AbstractObject2ByteMap
null
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 Map
put
in class AbstractObject2ByteMap
public Object remove(Object ok)
AbstractObject2ByteMap
null
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 Map
remove
in class AbstractObject2ByteMap
public boolean containsValue(byte v)
AbstractObject2ByteMap
AbstractObject2ByteMap.values()
.
containsValue
in interface Object2ByteMap
containsValue
in class AbstractObject2ByteMap
public void clear()
clear
in interface Map
clear
in class AbstractObject2ByteMap
public boolean containsKey(Object k)
AbstractObject2ByteMap
AbstractObject2ByteMap.keySet()
.
containsKey
in interface Map
containsKey
in class AbstractObject2ByteMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractObject2ByteMap
public byte getByte(Object k)
Object2ByteMap
getByte
in interface Object2ByteMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractObject2ByteMap
null
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 Map
get
in class AbstractObject2ByteMap
public Object firstKey()
AbstractObject2ByteSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractObject2ByteSortedMap
public Object lastKey()
AbstractObject2ByteSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractObject2ByteSortedMap
public Set entrySet()
entrySet
in interface Map
public 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 Map
keySet
in class AbstractObject2ByteSortedMap
public 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 Map
values
in class AbstractObject2ByteMap
public Comparator comparator()
comparator
in interface SortedMap
public SortedMap headMap(Object to)
AbstractObject2ByteSortedMap
headMap
in interface SortedMap
headMap
in class AbstractObject2ByteSortedMap
public SortedMap tailMap(Object from)
AbstractObject2ByteSortedMap
tailMap
in interface SortedMap
tailMap
in class AbstractObject2ByteSortedMap
public SortedMap subMap(Object from, Object to)
AbstractObject2ByteSortedMap
subMap
in interface SortedMap
subMap
in class AbstractObject2ByteSortedMap
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 |