|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2ByteFunction<K>
it.unimi.dsi.fastutil.objects.AbstractObject2ByteMap<K>
it.unimi.dsi.fastutil.objects.AbstractObject2ByteSortedMap<K>
it.unimi.dsi.fastutil.objects.Object2ByteAVLTreeMap<K>
public class Object2ByteAVLTreeMap<K>
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.objects.AbstractObject2ByteMap |
|---|
AbstractObject2ByteMap.BasicEntry<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteSortedMap |
|---|
Object2ByteSortedMap.FastSortedEntrySet<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteMap |
|---|
Object2ByteMap.FastEntrySet<K> |
| Constructor Summary | |
|---|---|
Object2ByteAVLTreeMap()
Creates a new empty tree map. |
|
Object2ByteAVLTreeMap(java.util.Comparator<? super K> c)
Creates a new empty tree map with the given comparator. |
|
Object2ByteAVLTreeMap(K[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Object2ByteAVLTreeMap(K[] k,
byte[] v,
java.util.Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Object2ByteAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Byte> m)
Creates a new tree map copying a given map. |
|
Object2ByteAVLTreeMap(Object2ByteMap<? extends K> m)
Creates a new tree map copying a given map. |
|
Object2ByteAVLTreeMap(Object2ByteSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Object2ByteAVLTreeMap(java.util.SortedMap<K,java.lang.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). |
Object2ByteAVLTreeMap<K> |
clone()
Returns a deep copy of this tree map. |
java.util.Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(java.lang.Object k)
Checks whether the given value is contained in AbstractObject2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in AbstractObject2ByteMap.values(). |
K |
firstKey()
|
java.lang.Byte |
get(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
byte |
getByte(java.lang.Object k)
Returns the value to which the given key is mapped. |
Object2ByteSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey. |
boolean |
isEmpty()
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
K |
lastKey()
|
ObjectSortedSet<Object2ByteMap.Entry<K>> |
object2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
byte |
put(K k,
byte v)
Adds a pair to the map. |
java.lang.Byte |
put(K ok,
java.lang.Byte ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
java.lang.Byte |
remove(java.lang.Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
byte |
removeByte(java.lang.Object k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Object2ByteSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Object2ByteSortedMap<K> |
tailMap(K 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.objects.AbstractObject2ByteSortedMap |
|---|
entrySet |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ByteMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ByteFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2ByteFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface java.util.Map |
|---|
containsValue, equals, hashCode, putAll |
| Constructor Detail |
|---|
public Object2ByteAVLTreeMap()
public Object2ByteAVLTreeMap(java.util.Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2ByteAVLTreeMap(java.util.Map<? extends K,? extends java.lang.Byte> m)
m - a Map to be copied into the new tree map.public Object2ByteAVLTreeMap(java.util.SortedMap<K,java.lang.Byte> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Object2ByteAVLTreeMap(Object2ByteMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2ByteAVLTreeMap(Object2ByteSortedMap<K> m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Object2ByteAVLTreeMap(K[] k,
byte[] v,
java.util.Comparator<? super K> 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.
java.lang.IllegalArgumentException - if k and v have different lengths.
public Object2ByteAVLTreeMap(K[] k,
byte[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.
java.lang.IllegalArgumentException - if k and v have different lengths.| Method Detail |
|---|
public byte put(K k,
byte v)
Object2ByteFunction
put in interface Object2ByteFunction<K>put in class AbstractObject2ByteFunction<K>k - the key.v - the value.
Function.put(Object,Object)public byte removeByte(java.lang.Object k)
Object2ByteFunction
removeByte in interface Object2ByteFunction<K>removeByte in class AbstractObject2ByteFunction<K>Function.remove(Object)
public java.lang.Byte put(K ok,
java.lang.Byte ov)
AbstractObject2ByteFunctionnull 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<K,java.lang.Byte>put in interface java.util.Map<K,java.lang.Byte>put in class AbstractObject2ByteFunction<K>ok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public java.lang.Byte remove(java.lang.Object ok)
AbstractObject2ByteFunctionnull 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<K,java.lang.Byte>remove in interface java.util.Map<K,java.lang.Byte>remove in class AbstractObject2ByteFunction<K>null if no value was present for the given key.Map.remove(Object)public boolean containsValue(byte v)
AbstractObject2ByteMapAbstractObject2ByteMap.values().
containsValue in interface Object2ByteMap<K>containsValue in class AbstractObject2ByteMap<K>Map.containsValue(Object)public void clear()
Function
clear in interface Function<K,java.lang.Byte>clear in interface java.util.Map<K,java.lang.Byte>clear in class AbstractObject2ByteFunction<K>Map.clear()public boolean containsKey(java.lang.Object k)
AbstractObject2ByteMapAbstractObject2ByteMap.keySet().
containsKey in interface Function<K,java.lang.Byte>containsKey in interface java.util.Map<K,java.lang.Byte>containsKey in class AbstractObject2ByteMap<K>k - the key.
key.Map.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<K,java.lang.Byte>size in interface java.util.Map<K,java.lang.Byte>public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Byte>isEmpty in class AbstractObject2ByteMap<K>public byte getByte(java.lang.Object k)
Object2ByteFunction
getByte in interface Object2ByteFunction<K>k - the key.
Function.get(Object)public java.lang.Byte get(java.lang.Object ok)
AbstractObject2ByteFunctionnull 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 Function<K,java.lang.Byte>get in interface java.util.Map<K,java.lang.Byte>get in class AbstractObject2ByteFunction<K>ok - the key.
null if no value was present for the given key.Map.get(Object)public K firstKey()
firstKey in interface java.util.SortedMap<K,java.lang.Byte>public K lastKey()
lastKey in interface java.util.SortedMap<K,java.lang.Byte>public ObjectSortedSet<Object2ByteMap.Entry<K>> object2ByteEntrySet()
Object2ByteSortedMap
object2ByteEntrySet in interface Object2ByteMap<K>object2ByteEntrySet in interface Object2ByteSortedMap<K>Object2ByteSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2ByteMap<K>keySet in interface Object2ByteSortedMap<K>keySet in interface java.util.Map<K,java.lang.Byte>keySet in interface java.util.SortedMap<K,java.lang.Byte>keySet in class AbstractObject2ByteSortedMap<K>Map.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 Object2ByteMap<K>values in interface Object2ByteSortedMap<K>values in interface java.util.Map<K,java.lang.Byte>values in interface java.util.SortedMap<K,java.lang.Byte>values in class AbstractObject2ByteSortedMap<K>Map.values()public java.util.Comparator<? super K> comparator()
Object2ByteSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2ByteSortedMap<K>comparator in interface java.util.SortedMap<K,java.lang.Byte>SortedMap.comparator()public Object2ByteSortedMap<K> headMap(K to)
Object2ByteSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2ByteSortedMap<K>headMap in interface java.util.SortedMap<K,java.lang.Byte>SortedMap.headMap(Object)public Object2ByteSortedMap<K> tailMap(K from)
Object2ByteSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2ByteSortedMap<K>tailMap in interface java.util.SortedMap<K,java.lang.Byte>SortedMap.tailMap(Object)
public Object2ByteSortedMap<K> subMap(K from,
K to)
Object2ByteSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2ByteSortedMap<K>subMap in interface java.util.SortedMap<K,java.lang.Byte>SortedMap.subMap(Object,Object)public Object2ByteAVLTreeMap<K> 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 java.lang.Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||