public class Object2ByteAVLTreeMap<K> extends AbstractObject2ByteSortedMap<K> implements Serializable, Cloneable
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.
AbstractObject2ByteMap.BasicEntry<K>
Object2ByteSortedMap.FastSortedEntrySet<K>
Object2ByteMap.FastEntrySet<K>
Constructor and Description |
---|
Object2ByteAVLTreeMap()
Creates a new empty tree map.
|
Object2ByteAVLTreeMap(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,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2ByteAVLTreeMap(Map<? extends K,? extends 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(SortedMap<K,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2ByteAVLTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(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() |
Byte |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
getByte(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.
|
Byte |
put(K ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Byte |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
removeByte(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.
|
entrySet
containsValue, equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
defaultReturnValue, defaultReturnValue
containsValue, equals, hashCode, putAll
public Object2ByteAVLTreeMap()
public Object2ByteAVLTreeMap(Comparator<? super K> c)
c
- a (possibly type-specific) comparator.public Object2ByteAVLTreeMap(Map<? extends K,? extends Byte> m)
m
- a Map
to be copied into the new tree map.public Object2ByteAVLTreeMap(SortedMap<K,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, 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.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.IllegalArgumentException
- if k
and v
have different lengths.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(Object k)
Object2ByteFunction
removeByte
in interface Object2ByteFunction<K>
removeByte
in class AbstractObject2ByteFunction<K>
Function.remove(Object)
public Byte put(K ok, Byte ov)
AbstractObject2ByteFunction
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.
public Byte remove(Object ok)
AbstractObject2ByteFunction
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.
public boolean containsValue(byte v)
AbstractObject2ByteMap
AbstractObject2ByteMap.values()
.containsValue
in interface Object2ByteMap<K>
containsValue
in class AbstractObject2ByteMap<K>
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(Object k)
AbstractObject2ByteMap
AbstractObject2ByteMap.keySet()
.containsKey
in interface Function<K,Byte>
containsKey
in interface Map<K,Byte>
containsKey
in class AbstractObject2ByteMap<K>
k
- the key.key
.Map.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.
public boolean isEmpty()
public byte getByte(Object k)
Object2ByteFunction
getByte
in interface Object2ByteFunction<K>
k
- the key.Function.get(Object)
public Byte get(Object ok)
AbstractObject2ByteFunction
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.
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 Map<K,Byte>
keySet
in interface SortedMap<K,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 Map<K,Byte>
values
in interface SortedMap<K,Byte>
values
in class AbstractObject2ByteSortedMap<K>
Map.values()
public Comparator<? super K> comparator()
Object2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Object2ByteSortedMap<K>
comparator
in interface SortedMap<K,Byte>
SortedMap.comparator()
public Object2ByteSortedMap<K> headMap(K to)
Object2ByteSortedMap
toKey
.
Note that this specification strengthens the one given in SortedMap.headMap(Object)
.
headMap
in interface Object2ByteSortedMap<K>
headMap
in interface SortedMap<K,Byte>
SortedMap.headMap(Object)
public Object2ByteSortedMap<K> tailMap(K from)
Object2ByteSortedMap
fromKey
.
Note that this specification strengthens the one given in SortedMap.tailMap(Object)
.
tailMap
in interface Object2ByteSortedMap<K>
tailMap
in interface SortedMap<K,Byte>
SortedMap.tailMap(Object)
public Object2ByteSortedMap<K> subMap(K from, K to)
Object2ByteSortedMap
fromKey
, 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 SortedMap<K,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.