|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2ByteFunction
it.unimi.dsi.fastutil.longs.AbstractLong2ByteMap
it.unimi.dsi.fastutil.longs.AbstractLong2ByteSortedMap
it.unimi.dsi.fastutil.longs.Long2ByteRBTreeMap
public class Long2ByteRBTreeMap
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.longs.AbstractLong2ByteMap |
|---|
AbstractLong2ByteMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ByteSortedMap |
|---|
Long2ByteSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ByteMap |
|---|
Long2ByteMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Long2ByteRBTreeMap()
Creates a new empty tree map. |
|
Long2ByteRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator. |
|
Long2ByteRBTreeMap(long[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Long2ByteRBTreeMap(long[] k,
byte[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Long2ByteRBTreeMap(Long2ByteMap m)
Creates a new tree map copying a given map. |
|
Long2ByteRBTreeMap(Long2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Long2ByteRBTreeMap(Map<? extends Long,? extends Byte> m)
Creates a new tree map copying a given map. |
|
Long2ByteRBTreeMap(SortedMap<Long,Byte> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
|---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this tree map. |
LongComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(long k)
Checks whether the given value is contained in AbstractLong2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in AbstractLong2ByteMap.values(). |
long |
firstLongKey()
|
byte |
get(long k)
Returns the value to which the given key is mapped. |
Long2ByteSortedMap |
headMap(long to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey. |
boolean |
isEmpty()
|
LongSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
long |
lastLongKey()
|
ObjectSortedSet<Long2ByteMap.Entry> |
long2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
byte |
put(long k,
byte v)
Adds a pair to the map. |
Byte |
put(Long ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
byte |
remove(long k)
Removes the mapping with the given key. |
Byte |
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. |
Long2ByteSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Long2ByteSortedMap |
tailMap(long from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
ByteCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ByteSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ByteMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ByteFunction |
|---|
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.longs.Long2ByteFunction |
|---|
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 Long2ByteRBTreeMap()
public Long2ByteRBTreeMap(Comparator<? super Long> c)
c - a (possibly type-specific) comparator.public Long2ByteRBTreeMap(Map<? extends Long,? extends Byte> m)
m - a Map to be copied into the new tree map.public Long2ByteRBTreeMap(SortedMap<Long,Byte> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Long2ByteRBTreeMap(Long2ByteMap m)
m - a type-specific map to be copied into the new tree map.public Long2ByteRBTreeMap(Long2ByteSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Long2ByteRBTreeMap(long[] k,
byte[] v,
Comparator<? super Long> 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 Long2ByteRBTreeMap(long[] 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(long k,
byte v)
Long2ByteFunction
put in interface Long2ByteFunctionput in class AbstractLong2ByteFunctionk - the key.v - the value.
Function.put(Object,Object)public byte remove(long k)
Long2ByteFunction
remove in interface Long2ByteFunctionremove in class AbstractLong2ByteFunctionFunction.remove(Object)
public Byte put(Long ok,
Byte ov)
AbstractLong2ByteFunctionnull 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<Long,Byte>put in interface Map<Long,Byte>put in class AbstractLong2ByteFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Byte remove(Object ok)
AbstractLong2ByteFunctionnull 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<Long,Byte>remove in interface Map<Long,Byte>remove in class AbstractLong2ByteFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(byte v)
AbstractLong2ByteMapAbstractLong2ByteMap.values().
containsValue in interface Long2ByteMapcontainsValue in class AbstractLong2ByteMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Long,Byte>clear in interface Map<Long,Byte>clear in class AbstractLong2ByteFunctionMap.clear()public boolean containsKey(long k)
AbstractLong2ByteMapAbstractLong2ByteMap.keySet().
containsKey in interface Long2ByteFunctioncontainsKey in class AbstractLong2ByteMapFunction.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<Long,Byte>size in interface Map<Long,Byte>public boolean isEmpty()
isEmpty in interface Map<Long,Byte>isEmpty in class AbstractLong2ByteMappublic byte get(long k)
Long2ByteFunction
get in interface Long2ByteFunctionk - the key.
Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2ByteSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2ByteSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2ByteMap.Entry> long2ByteEntrySet()
Long2ByteMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Long2ByteMap.entrySet()
so that it returns an ObjectSet
of objects of type Long2ByteMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
long2ByteEntrySet in interface Long2ByteMaplong2ByteEntrySet in interface Long2ByteSortedMapLong2ByteMap.entrySet()public LongSortedSet 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 Long2ByteMapkeySet in interface Long2ByteSortedMapkeySet in interface Map<Long,Byte>keySet in class AbstractLong2ByteSortedMapMap.keySet()public ByteCollection 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 Long2ByteMapvalues in interface Long2ByteSortedMapvalues in interface Map<Long,Byte>values in class AbstractLong2ByteSortedMapMap.values()public LongComparator comparator()
Long2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2ByteSortedMapcomparator in interface SortedMap<Long,Byte>SortedMap.comparator()public Long2ByteSortedMap headMap(long to)
Long2ByteSortedMaptoKey.
headMap in interface Long2ByteSortedMapSortedMap.headMap(Object)public Long2ByteSortedMap tailMap(long from)
Long2ByteSortedMapfromKey.
tailMap in interface Long2ByteSortedMapSortedMap.tailMap(Object)
public Long2ByteSortedMap subMap(long from,
long to)
Long2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Long2ByteSortedMapSortedMap.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 | ||||||||