public class Byte2ByteRBTreeMap extends AbstractByte2ByteSortedMap implements java.io.Serializable, java.lang.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.
AbstractByte2ByteMap.BasicEntry
Byte2ByteSortedMap.FastSortedEntrySet
Byte2ByteMap.FastEntrySet
Constructor and Description |
---|
Byte2ByteRBTreeMap()
Creates a new empty tree map.
|
Byte2ByteRBTreeMap(byte[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2ByteRBTreeMap(byte[] k,
byte[] v,
java.util.Comparator<? super java.lang.Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2ByteRBTreeMap(Byte2ByteMap m)
Creates a new tree map copying a given map.
|
Byte2ByteRBTreeMap(Byte2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Byte2ByteRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2ByteRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Byte> m)
Creates a new tree map copying a given map.
|
Byte2ByteRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
ObjectSortedSet<Byte2ByteMap.Entry> |
byte2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ByteRBTreeMap |
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
AbstractByte2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractByte2ByteMap.values() . |
byte |
firstByteKey() |
byte |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2ByteSortedMap |
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() |
byte |
put(byte k,
byte v)
Adds a pair to the map.
|
java.lang.Byte |
put(java.lang.Byte ok,
java.lang.Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(byte k)
Removes the mapping with the given 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. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Byte2ByteSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Byte2ByteSortedMap |
tailMap(byte 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, firstKey, headMap, lastKey, subMap, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
public Byte2ByteRBTreeMap()
public Byte2ByteRBTreeMap(java.util.Comparator<? super java.lang.Byte> c)
c
- a (possibly type-specific) comparator.public Byte2ByteRBTreeMap(java.util.Map<? extends java.lang.Byte,? extends java.lang.Byte> m)
m
- a Map
to be copied into the new tree map.public Byte2ByteRBTreeMap(java.util.SortedMap<java.lang.Byte,java.lang.Byte> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Byte2ByteRBTreeMap(Byte2ByteMap m)
m
- a type-specific map to be copied into the new tree map.public Byte2ByteRBTreeMap(Byte2ByteSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Byte2ByteRBTreeMap(byte[] k, byte[] v, java.util.Comparator<? super java.lang.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.java.lang.IllegalArgumentException
- if k
and v
have different lengths.public Byte2ByteRBTreeMap(byte[] 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.public byte put(byte k, byte v)
Byte2ByteFunction
put
in interface Byte2ByteFunction
put
in class AbstractByte2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(byte k)
Byte2ByteFunction
remove
in interface Byte2ByteFunction
remove
in class AbstractByte2ByteFunction
k
- the key.Function.remove(Object)
public java.lang.Byte put(java.lang.Byte ok, java.lang.Byte ov)
AbstractByte2ByteFunction
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<java.lang.Byte,java.lang.Byte>
put
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
put
in class AbstractByte2ByteFunction
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)
AbstractByte2ByteFunction
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<java.lang.Byte,java.lang.Byte>
remove
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
remove
in class AbstractByte2ByteFunction
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(byte v)
AbstractByte2ByteMap
AbstractByte2ByteMap.values()
.containsValue
in interface Byte2ByteMap
containsValue
in class AbstractByte2ByteMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Byte,java.lang.Byte>
clear
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
clear
in class AbstractByte2ByteFunction
Map.clear()
public boolean containsKey(byte k)
AbstractByte2ByteMap
AbstractByte2ByteMap.keySet()
.containsKey
in interface Byte2ByteFunction
containsKey
in class AbstractByte2ByteMap
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()
isEmpty
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
isEmpty
in class AbstractByte2ByteMap
public byte get(byte k)
Byte2ByteFunction
get
in interface Byte2ByteFunction
k
- the key.Function.get(Object)
public byte firstByteKey()
firstByteKey
in interface Byte2ByteSortedMap
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Byte2ByteMap.Entry> byte2ByteEntrySet()
Byte2ByteSortedMap
byte2ByteEntrySet
in interface Byte2ByteMap
byte2ByteEntrySet
in interface Byte2ByteSortedMap
Byte2ByteSortedMap.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 Byte2ByteMap
keySet
in interface Byte2ByteSortedMap
keySet
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
keySet
in interface java.util.SortedMap<java.lang.Byte,java.lang.Byte>
keySet
in class AbstractByte2ByteSortedMap
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 Byte2ByteMap
values
in interface Byte2ByteSortedMap
values
in interface java.util.Map<java.lang.Byte,java.lang.Byte>
values
in interface java.util.SortedMap<java.lang.Byte,java.lang.Byte>
values
in class AbstractByte2ByteSortedMap
Map.values()
public ByteComparator comparator()
Byte2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Byte2ByteSortedMap
comparator
in interface java.util.SortedMap<java.lang.Byte,java.lang.Byte>
SortedMap.comparator()
public Byte2ByteSortedMap headMap(byte to)
Byte2ByteSortedMap
toKey
.headMap
in interface Byte2ByteSortedMap
SortedMap.headMap(Object)
public Byte2ByteSortedMap tailMap(byte from)
Byte2ByteSortedMap
fromKey
.tailMap
in interface Byte2ByteSortedMap
SortedMap.tailMap(Object)
public Byte2ByteSortedMap subMap(byte from, byte to)
Byte2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Byte2ByteSortedMap
SortedMap.subMap(Object,Object)
public Byte2ByteRBTreeMap 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