|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap
it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceSortedMap
it.unimi.dsi.fastutil.bytes.Byte2ReferenceRBTreeMap
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.bytes.AbstractByte2ReferenceMap |
AbstractByte2ReferenceMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Byte2ReferenceRBTreeMap()
Creates a new empty tree map. |
|
Byte2ReferenceRBTreeMap(Byte2ReferenceMap m)
Creates a new tree map copying a given map. |
|
Byte2ReferenceRBTreeMap(Byte2ReferenceSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Byte2ReferenceRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Byte2ReferenceRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Byte2ReferenceRBTreeMap(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(byte k)
Checks whether the given value is contained in keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in values() . |
Set |
entrySet()
|
byte |
firstByteKey()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
Object |
get(byte k)
Returns the value to which the given key is mapped. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
Byte2ReferenceSortedMap |
headMap(byte to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
byte |
lastByteKey()
|
Object |
lastKey()
Delegates to the corresponding type-specific method. |
Object |
put(byte k,
Object 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(byte k)
Removes the mapping with the given key. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
size()
|
Byte2ReferenceSortedMap |
subMap(byte from,
byte to)
|
Byte2ReferenceSortedMap |
tailMap(byte from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceSortedMap |
headMap, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap |
containsKey, 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.bytes.Byte2ReferenceMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
Methods inherited from interface java.util.Map |
containsKey, equals, hashCode, putAll |
Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public Byte2ReferenceRBTreeMap()
public Byte2ReferenceRBTreeMap(Comparator c)
c
- a Comparator
.public Byte2ReferenceRBTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Byte2ReferenceRBTreeMap(SortedMap m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Byte2ReferenceRBTreeMap(Byte2ReferenceMap m)
m
- a type-specific map to be copied into the new tree map.public Byte2ReferenceRBTreeMap(Byte2ReferenceSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.Method Detail |
public Object put(byte k, Object v)
Byte2ReferenceMap
put
in interface Byte2ReferenceMap
put
in class AbstractByte2ReferenceMap
public Object remove(byte k)
Byte2ReferenceMap
remove
in interface Byte2ReferenceMap
remove
in class AbstractByte2ReferenceMap
public Object put(Object ok, Object ov)
AbstractByte2ReferenceMap
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 AbstractByte2ReferenceMap
public Object remove(Object ok)
AbstractByte2ReferenceMap
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 AbstractByte2ReferenceMap
public boolean containsValue(Object v)
AbstractByte2ReferenceMap
AbstractByte2ReferenceMap.values()
.
containsValue
in interface Map
containsValue
in class AbstractByte2ReferenceMap
public void clear()
clear
in interface Map
clear
in class AbstractByte2ReferenceMap
public boolean containsKey(byte k)
AbstractByte2ReferenceMap
AbstractByte2ReferenceMap.keySet()
.
containsKey
in interface Byte2ReferenceMap
containsKey
in class AbstractByte2ReferenceMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractByte2ReferenceMap
public Object get(byte k)
Byte2ReferenceMap
get
in interface Byte2ReferenceMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractByte2ReferenceMap
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 AbstractByte2ReferenceMap
public byte firstByteKey()
firstByteKey
in interface Byte2ReferenceSortedMap
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2ReferenceSortedMap
SortedMap.lastKey()
public Object firstKey()
AbstractByte2ReferenceSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractByte2ReferenceSortedMap
public Object lastKey()
AbstractByte2ReferenceSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractByte2ReferenceSortedMap
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 AbstractByte2ReferenceSortedMap
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 AbstractByte2ReferenceMap
public Comparator comparator()
comparator
in interface SortedMap
public Byte2ReferenceSortedMap headMap(byte to)
headMap
in interface Byte2ReferenceSortedMap
SortedMap.headMap(Object)
public Byte2ReferenceSortedMap tailMap(byte from)
tailMap
in interface Byte2ReferenceSortedMap
SortedMap.tailMap(Object)
public Byte2ReferenceSortedMap subMap(byte from, byte to)
subMap
in interface Byte2ReferenceSortedMap
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |