|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2ShortFunction
it.unimi.dsi.fastutil.bytes.AbstractByte2ShortMap
it.unimi.dsi.fastutil.bytes.AbstractByte2ShortSortedMap
it.unimi.dsi.fastutil.bytes.Byte2ShortAVLTreeMap
public class Byte2ShortAVLTreeMap
A type-specific AVL 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.AbstractByte2ShortMap |
|---|
AbstractByte2ShortMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortSortedMap |
|---|
Byte2ShortSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ShortMap |
|---|
Byte2ShortMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
Byte2ShortAVLTreeMap()
Creates a new empty tree map. |
|
Byte2ShortAVLTreeMap(byte[] k,
short[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Byte2ShortAVLTreeMap(byte[] k,
short[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Byte2ShortAVLTreeMap(Byte2ShortMap m)
Creates a new tree map copying a given map. |
|
Byte2ShortAVLTreeMap(Byte2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Byte2ShortAVLTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator. |
|
Byte2ShortAVLTreeMap(Map<? extends Byte,? extends Short> m)
Creates a new tree map copying a given map. |
|
Byte2ShortAVLTreeMap(SortedMap<Byte,Short> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
| Method Summary | |
|---|---|
ObjectSortedSet<Byte2ShortMap.Entry> |
byte2ShortEntrySet()
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 AbstractByte2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in AbstractByte2ShortMap.values(). |
byte |
firstByteKey()
|
short |
get(byte k)
Returns the value to which the given key is mapped. |
Byte2ShortSortedMap |
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()
|
short |
put(byte k,
short v)
Adds a pair to the map. |
Short |
put(Byte ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
short |
remove(byte k)
Removes the mapping with the given key. |
Short |
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. |
Byte2ShortSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Byte2ShortSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
ShortCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ShortSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ShortMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ShortFunction |
|---|
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.Byte2ShortFunction |
|---|
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 Byte2ShortAVLTreeMap()
public Byte2ShortAVLTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2ShortAVLTreeMap(Map<? extends Byte,? extends Short> m)
m - a Map to be copied into the new tree map.public Byte2ShortAVLTreeMap(SortedMap<Byte,Short> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Byte2ShortAVLTreeMap(Byte2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Byte2ShortAVLTreeMap(Byte2ShortSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Byte2ShortAVLTreeMap(byte[] k,
short[] 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 Byte2ShortAVLTreeMap(byte[] k,
short[] 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 short put(byte k,
short v)
Byte2ShortFunction
put in interface Byte2ShortFunctionput in class AbstractByte2ShortFunctionk - the key.v - the value.
Function.put(Object,Object)public short remove(byte k)
Byte2ShortFunction
remove in interface Byte2ShortFunctionremove in class AbstractByte2ShortFunctionFunction.remove(Object)
public Short put(Byte ok,
Short ov)
AbstractByte2ShortFunctionnull 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,Short>put in interface Map<Byte,Short>put in class AbstractByte2ShortFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Short remove(Object ok)
AbstractByte2ShortFunctionnull 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,Short>remove in interface Map<Byte,Short>remove in class AbstractByte2ShortFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(short v)
AbstractByte2ShortMapAbstractByte2ShortMap.values().
containsValue in interface Byte2ShortMapcontainsValue in class AbstractByte2ShortMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Byte,Short>clear in interface Map<Byte,Short>clear in class AbstractByte2ShortFunctionMap.clear()public boolean containsKey(byte k)
AbstractByte2ShortMapAbstractByte2ShortMap.keySet().
containsKey in interface Byte2ShortFunctioncontainsKey in class AbstractByte2ShortMapFunction.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,Short>size in interface Map<Byte,Short>public boolean isEmpty()
isEmpty in interface Map<Byte,Short>isEmpty in class AbstractByte2ShortMappublic short get(byte k)
Byte2ShortFunction
get in interface Byte2ShortFunctionk - the key.
Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2ShortSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2ShortSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2ShortMap.Entry> byte2ShortEntrySet()
Byte2ShortMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2ShortMap.entrySet()
so that it returns an ObjectSet
of objects of type Byte2ShortMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
byte2ShortEntrySet in interface Byte2ShortMapbyte2ShortEntrySet in interface Byte2ShortSortedMapByte2ShortMap.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 Byte2ShortMapkeySet in interface Byte2ShortSortedMapkeySet in interface Map<Byte,Short>keySet in class AbstractByte2ShortSortedMapMap.keySet()public ShortCollection 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 Byte2ShortMapvalues in interface Byte2ShortSortedMapvalues in interface Map<Byte,Short>values in class AbstractByte2ShortSortedMapMap.values()public ByteComparator comparator()
Byte2ShortSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2ShortSortedMapcomparator in interface SortedMap<Byte,Short>SortedMap.comparator()public Byte2ShortSortedMap headMap(byte to)
Byte2ShortSortedMaptoKey.
headMap in interface Byte2ShortSortedMapSortedMap.headMap(Object)public Byte2ShortSortedMap tailMap(byte from)
Byte2ShortSortedMapfromKey.
tailMap in interface Byte2ShortSortedMapSortedMap.tailMap(Object)
public Byte2ShortSortedMap subMap(byte from,
byte to)
Byte2ShortSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Byte2ShortSortedMapSortedMap.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 | ||||||||