|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceFunction<V>
it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap<V>
it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceSortedMap<V>
it.unimi.dsi.fastutil.bytes.Byte2ReferenceAVLTreeMap<V>
public class Byte2ReferenceAVLTreeMap<V>
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.AbstractByte2ReferenceMap |
---|
AbstractByte2ReferenceMap.BasicEntry<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceSortedMap |
---|
Byte2ReferenceSortedMap.FastSortedEntrySet<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ReferenceMap |
---|
Byte2ReferenceMap.FastEntrySet<V> |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Byte2ReferenceAVLTreeMap()
Creates a new empty tree map. |
|
Byte2ReferenceAVLTreeMap(byte[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Byte2ReferenceAVLTreeMap(byte[] k,
V[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Byte2ReferenceAVLTreeMap(Byte2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map. |
|
Byte2ReferenceAVLTreeMap(Byte2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Byte2ReferenceAVLTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator. |
|
Byte2ReferenceAVLTreeMap(Map<? extends Byte,? extends V> m)
Creates a new tree map copying a given map. |
|
Byte2ReferenceAVLTreeMap(SortedMap<Byte,V> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
---|---|
ObjectSortedSet<Byte2ReferenceMap.Entry<V>> |
byte2ReferenceEntrySet()
Returns a type-specific sorted-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 AbstractByte2ReferenceMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractByte2ReferenceMap.values() . |
byte |
firstByteKey()
|
V |
get(byte k)
Returns the value to which the given key is mapped. |
Byte2ReferenceSortedMap<V> |
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()
|
V |
put(byte k,
V v)
Adds a pair to the map. |
V |
put(Byte ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
V |
remove(byte k)
Removes the mapping with the given key. |
V |
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. |
Byte2ReferenceSortedMap<V> |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Byte2ReferenceSortedMap<V> |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey . |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceMap |
---|
equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ReferenceFunction |
---|
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.Byte2ReferenceFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, equals, get, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Byte2ReferenceAVLTreeMap()
public Byte2ReferenceAVLTreeMap(Comparator<? super Byte> c)
c
- a (possibly type-specific) comparator.public Byte2ReferenceAVLTreeMap(Map<? extends Byte,? extends V> m)
m
- a Map
to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(SortedMap<Byte,V> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(Byte2ReferenceMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(Byte2ReferenceSortedMap<V> m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Byte2ReferenceAVLTreeMap(byte[] k, V[] 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 Byte2ReferenceAVLTreeMap(byte[] k, V[] 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 V put(byte k, V v)
Byte2ReferenceFunction
put
in interface Byte2ReferenceFunction<V>
put
in class AbstractByte2ReferenceFunction<V>
k
- the key.v
- the value.
Function.put(Object,Object)
public V remove(byte k)
Byte2ReferenceFunction
remove
in interface Byte2ReferenceFunction<V>
remove
in class AbstractByte2ReferenceFunction<V>
Function.remove(Object)
public V put(Byte ok, V ov)
AbstractByte2ReferenceFunction
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 Function<Byte,V>
put
in interface Map<Byte,V>
put
in class AbstractByte2ReferenceFunction<V>
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public V remove(Object ok)
AbstractByte2ReferenceFunction
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 Function<Byte,V>
remove
in interface Map<Byte,V>
remove
in class AbstractByte2ReferenceFunction<V>
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(Object v)
AbstractByte2ReferenceMap
AbstractByte2ReferenceMap.values()
.
containsValue
in interface Map<Byte,V>
containsValue
in class AbstractByte2ReferenceMap<V>
public void clear()
Function
clear
in interface Function<Byte,V>
clear
in interface Map<Byte,V>
clear
in class AbstractByte2ReferenceFunction<V>
Map.clear()
public boolean containsKey(byte k)
AbstractByte2ReferenceMap
AbstractByte2ReferenceMap.keySet()
.
containsKey
in interface Byte2ReferenceFunction<V>
containsKey
in class AbstractByte2ReferenceMap<V>
Function.containsKey(Object)
public int size()
Function
Most 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,V>
size
in interface Map<Byte,V>
public boolean isEmpty()
isEmpty
in interface Map<Byte,V>
isEmpty
in class AbstractByte2ReferenceMap<V>
public V get(byte k)
Byte2ReferenceFunction
get
in interface Byte2ReferenceFunction<V>
k
- the key.
Function.get(Object)
public byte firstByteKey()
firstByteKey
in interface Byte2ReferenceSortedMap<V>
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2ReferenceSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Byte2ReferenceMap.Entry<V>> byte2ReferenceEntrySet()
Byte2ReferenceSortedMap
byte2ReferenceEntrySet
in interface Byte2ReferenceMap<V>
byte2ReferenceEntrySet
in interface Byte2ReferenceSortedMap<V>
Byte2ReferenceSortedMap.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 Byte2ReferenceMap<V>
keySet
in interface Byte2ReferenceSortedMap<V>
keySet
in interface Map<Byte,V>
keySet
in interface SortedMap<Byte,V>
keySet
in class AbstractByte2ReferenceSortedMap<V>
Map.keySet()
public ReferenceCollection<V> 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 Byte2ReferenceMap<V>
values
in interface Byte2ReferenceSortedMap<V>
values
in interface Map<Byte,V>
values
in interface SortedMap<Byte,V>
values
in class AbstractByte2ReferenceSortedMap<V>
Map.values()
public ByteComparator comparator()
Byte2ReferenceSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Byte2ReferenceSortedMap<V>
comparator
in interface SortedMap<Byte,V>
SortedMap.comparator()
public Byte2ReferenceSortedMap<V> headMap(byte to)
Byte2ReferenceSortedMap
toKey
.
headMap
in interface Byte2ReferenceSortedMap<V>
SortedMap.headMap(Object)
public Byte2ReferenceSortedMap<V> tailMap(byte from)
Byte2ReferenceSortedMap
fromKey
.
tailMap
in interface Byte2ReferenceSortedMap<V>
SortedMap.tailMap(Object)
public Byte2ReferenceSortedMap<V> subMap(byte from, byte to)
Byte2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Byte2ReferenceSortedMap<V>
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.
clone
in class Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |