public class Byte2ObjectRBTreeMap<V> extends AbstractByte2ObjectSortedMap<V> 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.
AbstractByte2ObjectMap.BasicEntry<V>
Byte2ObjectSortedMap.FastSortedEntrySet<V>
Byte2ObjectMap.FastEntrySet<V>
Constructor and Description |
---|
Byte2ObjectRBTreeMap()
Creates a new empty tree map.
|
Byte2ObjectRBTreeMap(byte[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ObjectRBTreeMap(byte[] k,
V[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2ObjectRBTreeMap(Byte2ObjectMap<? extends V> m)
Creates a new tree map copying a given map.
|
Byte2ObjectRBTreeMap(Byte2ObjectSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Byte2ObjectRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ObjectRBTreeMap(Map<? extends Byte,? extends V> m)
Creates a new tree map copying a given map.
|
Byte2ObjectRBTreeMap(SortedMap<Byte,V> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
ObjectSortedSet<Byte2ObjectMap.Entry<V>> |
byte2ObjectEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ObjectRBTreeMap<V> |
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
AbstractByte2ObjectMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractByte2ObjectMap.values() . |
byte |
firstByteKey() |
V |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2ObjectSortedMap<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.
|
Byte2ObjectSortedMap<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. |
Byte2ObjectSortedMap<V> |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMap
equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
public Byte2ObjectRBTreeMap()
public Byte2ObjectRBTreeMap(Comparator<? super Byte> c)
c
- a (possibly type-specific) comparator.public Byte2ObjectRBTreeMap(Map<? extends Byte,? extends V> m)
m
- a Map
to be copied into the new tree map.public Byte2ObjectRBTreeMap(SortedMap<Byte,V> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Byte2ObjectRBTreeMap(Byte2ObjectMap<? extends V> m)
m
- a type-specific map to be copied into the new tree map.public Byte2ObjectRBTreeMap(Byte2ObjectSortedMap<V> m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Byte2ObjectRBTreeMap(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 Byte2ObjectRBTreeMap(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.public V put(byte k, V v)
Byte2ObjectFunction
put
in interface Byte2ObjectFunction<V>
put
in class AbstractByte2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(byte k)
Byte2ObjectFunction
remove
in interface Byte2ObjectFunction<V>
remove
in class AbstractByte2ObjectFunction<V>
Function.remove(Object)
public V put(Byte ok, V ov)
AbstractByte2ObjectFunction
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 V remove(Object ok)
AbstractByte2ObjectFunction
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(Object v)
AbstractByte2ObjectMap
AbstractByte2ObjectMap.values()
.containsValue
in interface Map<Byte,V>
containsValue
in class AbstractByte2ObjectMap<V>
public void clear()
Function
public boolean containsKey(byte k)
AbstractByte2ObjectMap
AbstractByte2ObjectMap.keySet()
.containsKey
in interface Byte2ObjectFunction<V>
containsKey
in class AbstractByte2ObjectMap<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.
public boolean isEmpty()
public V get(byte k)
Byte2ObjectFunction
get
in interface Byte2ObjectFunction<V>
k
- the key.Function.get(Object)
public byte firstByteKey()
firstByteKey
in interface Byte2ObjectSortedMap<V>
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2ObjectSortedMap<V>
SortedMap.lastKey()
public ObjectSortedSet<Byte2ObjectMap.Entry<V>> byte2ObjectEntrySet()
Byte2ObjectSortedMap
byte2ObjectEntrySet
in interface Byte2ObjectMap<V>
byte2ObjectEntrySet
in interface Byte2ObjectSortedMap<V>
Byte2ObjectSortedMap.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 Byte2ObjectMap<V>
keySet
in interface Byte2ObjectSortedMap<V>
keySet
in interface Map<Byte,V>
keySet
in interface SortedMap<Byte,V>
keySet
in class AbstractByte2ObjectSortedMap<V>
Map.keySet()
public ObjectCollection<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 Byte2ObjectMap<V>
values
in interface Byte2ObjectSortedMap<V>
values
in interface Map<Byte,V>
values
in interface SortedMap<Byte,V>
values
in class AbstractByte2ObjectSortedMap<V>
Map.values()
public ByteComparator comparator()
Byte2ObjectSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Byte2ObjectSortedMap<V>
comparator
in interface SortedMap<Byte,V>
SortedMap.comparator()
public Byte2ObjectSortedMap<V> headMap(byte to)
Byte2ObjectSortedMap
toKey
.headMap
in interface Byte2ObjectSortedMap<V>
SortedMap.headMap(Object)
public Byte2ObjectSortedMap<V> tailMap(byte from)
Byte2ObjectSortedMap
fromKey
.tailMap
in interface Byte2ObjectSortedMap<V>
SortedMap.tailMap(Object)
public Byte2ObjectSortedMap<V> subMap(byte from, byte to)
Byte2ObjectSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Byte2ObjectSortedMap<V>
SortedMap.subMap(Object,Object)
public Byte2ObjectRBTreeMap<V> 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.