|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2FloatFunction
it.unimi.dsi.fastutil.bytes.AbstractByte2FloatMap
it.unimi.dsi.fastutil.bytes.AbstractByte2FloatSortedMap
it.unimi.dsi.fastutil.bytes.Byte2FloatRBTreeMap
public class Byte2FloatRBTreeMap
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/interfaces inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2FloatMap |
|---|
AbstractByte2FloatMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2FloatSortedMap |
|---|
Byte2FloatSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2FloatMap |
|---|
Byte2FloatMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Byte2FloatRBTreeMap()
Creates a new empty tree map. |
|
Byte2FloatRBTreeMap(byte[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Byte2FloatRBTreeMap(byte[] k,
float[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Byte2FloatRBTreeMap(Byte2FloatMap m)
Creates a new tree map copying a given map. |
|
Byte2FloatRBTreeMap(Byte2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Byte2FloatRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator. |
|
Byte2FloatRBTreeMap(Map<? extends Byte,? extends Float> m)
Creates a new tree map copying a given map. |
|
Byte2FloatRBTreeMap(SortedMap<Byte,Float> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
|---|---|
ObjectSortedSet<Byte2FloatMap.Entry> |
byte2FloatEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this tree map. |
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(byte k)
Checks whether the given value is contained in AbstractByte2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in AbstractByte2FloatMap.values(). |
byte |
firstByteKey()
|
float |
get(byte k)
Returns the value to which the given key is mapped. |
Byte2FloatSortedMap |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey. |
boolean |
isEmpty()
|
ByteSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
byte |
lastByteKey()
|
float |
put(byte k,
float v)
Adds a pair to the map. |
Float |
put(Byte ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
float |
remove(byte k)
Removes the mapping with the given key. |
Float |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Byte2FloatSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Byte2FloatSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2FloatSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2FloatMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2FloatFunction |
|---|
containsKey, defaultReturnValue, defaultReturnValue, get |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2FloatFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, containsValue, equals, get, hashCode, putAll |
| Methods inherited from interface java.util.Map |
|---|
containsKey, containsValue, equals, get, hashCode, putAll |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
public Byte2FloatRBTreeMap()
public Byte2FloatRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2FloatRBTreeMap(Map<? extends Byte,? extends Float> m)
m - a Map to be copied into the new tree map.public Byte2FloatRBTreeMap(SortedMap<Byte,Float> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Byte2FloatRBTreeMap(Byte2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Byte2FloatRBTreeMap(Byte2FloatSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Byte2FloatRBTreeMap(byte[] k,
float[] v,
Comparator<? super Byte> 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 Byte2FloatRBTreeMap(byte[] k,
float[] 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 float put(byte k,
float v)
Byte2FloatFunction
put in interface Byte2FloatFunctionput in class AbstractByte2FloatFunctionk - the key.v - the value.
Function.put(Object,Object)public float remove(byte k)
Byte2FloatFunction
remove in interface Byte2FloatFunctionremove in class AbstractByte2FloatFunctionFunction.remove(Object)
public Float put(Byte ok,
Float ov)
AbstractByte2FloatFunctionnull 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 Function<Byte,Float>put in interface Map<Byte,Float>put in class AbstractByte2FloatFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Float remove(Object ok)
AbstractByte2FloatFunctionnull 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 Function<Byte,Float>remove in interface Map<Byte,Float>remove in class AbstractByte2FloatFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(float v)
AbstractByte2FloatMapAbstractByte2FloatMap.values().
containsValue in interface Byte2FloatMapcontainsValue in class AbstractByte2FloatMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Byte,Float>clear in interface Map<Byte,Float>clear in class AbstractByte2FloatFunctionMap.clear()public boolean containsKey(byte k)
AbstractByte2FloatMapAbstractByte2FloatMap.keySet().
containsKey in interface Byte2FloatFunctioncontainsKey in class AbstractByte2FloatMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
size in interface Function<Byte,Float>size in interface Map<Byte,Float>public boolean isEmpty()
isEmpty in interface Map<Byte,Float>isEmpty in class AbstractByte2FloatMappublic float get(byte k)
Byte2FloatFunction
get in interface Byte2FloatFunctionk - the key.
Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2FloatSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2FloatMap.Entry> byte2FloatEntrySet()
Byte2FloatMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2FloatMap.entrySet()
so that it returns an ObjectSet
of objects of type Byte2FloatMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
byte2FloatEntrySet in interface Byte2FloatMapbyte2FloatEntrySet in interface Byte2FloatSortedMapByte2FloatMap.entrySet()public ByteSortedSet 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 Byte2FloatMapkeySet in interface Byte2FloatSortedMapkeySet in interface Map<Byte,Float>keySet in class AbstractByte2FloatSortedMapMap.keySet()public FloatCollection 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 Byte2FloatMapvalues in interface Byte2FloatSortedMapvalues in interface Map<Byte,Float>values in class AbstractByte2FloatSortedMapMap.values()public ByteComparator comparator()
Byte2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2FloatSortedMapcomparator in interface SortedMap<Byte,Float>SortedMap.comparator()public Byte2FloatSortedMap headMap(byte to)
Byte2FloatSortedMaptoKey.
headMap in interface Byte2FloatSortedMapSortedMap.headMap(Object)public Byte2FloatSortedMap tailMap(byte from)
Byte2FloatSortedMapfromKey.
tailMap in interface Byte2FloatSortedMapSortedMap.tailMap(Object)
public Byte2FloatSortedMap subMap(byte from,
byte to)
Byte2FloatSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Byte2FloatSortedMapSortedMap.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.
clone in class Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||