public class Byte2CharRBTreeMap extends AbstractByte2CharSortedMap 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.
AbstractByte2CharMap.BasicEntryByte2CharSortedMap.FastSortedEntrySetByte2CharMap.FastEntrySet| Constructor and Description |
|---|
Byte2CharRBTreeMap()
Creates a new empty tree map.
|
Byte2CharRBTreeMap(byte[] k,
char[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Byte2CharRBTreeMap(byte[] k,
char[] v,
Comparator<? super Byte> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Byte2CharRBTreeMap(Byte2CharMap m)
Creates a new tree map copying a given map.
|
Byte2CharRBTreeMap(Byte2CharSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Byte2CharRBTreeMap(Comparator<? super Byte> c)
Creates a new empty tree map with the given comparator.
|
Byte2CharRBTreeMap(Map<? extends Byte,? extends Character> m)
Creates a new tree map copying a given map.
|
Byte2CharRBTreeMap(SortedMap<Byte,Character> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Byte2CharMap.Entry> |
byte2CharEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2CharRBTreeMap |
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
AbstractByte2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractByte2CharMap.values(). |
byte |
firstByteKey() |
char |
get(byte k)
Returns the value to which the given key is mapped.
|
Byte2CharSortedMap |
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() |
char |
put(byte k,
char v)
Adds a pair to the map.
|
Character |
put(Byte ok,
Character ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
char |
remove(byte k)
Removes the mapping with the given key.
|
Character |
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.
|
Byte2CharSortedMap |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Byte2CharSortedMap |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
CharCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, containsValue, equals, get, hashCode, putAllpublic Byte2CharRBTreeMap()
public Byte2CharRBTreeMap(Comparator<? super Byte> c)
c - a (possibly type-specific) comparator.public Byte2CharRBTreeMap(Map<? extends Byte,? extends Character> m)
m - a Map to be copied into the new tree map.public Byte2CharRBTreeMap(SortedMap<Byte,Character> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Byte2CharRBTreeMap(Byte2CharMap m)
m - a type-specific map to be copied into the new tree map.public Byte2CharRBTreeMap(Byte2CharSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Byte2CharRBTreeMap(byte[] k,
char[] 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 Byte2CharRBTreeMap(byte[] k,
char[] 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 char put(byte k,
char v)
Byte2CharFunctionput in interface Byte2CharFunctionput in class AbstractByte2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(byte k)
Byte2CharFunctionremove in interface Byte2CharFunctionremove in class AbstractByte2CharFunctionFunction.remove(Object)public Character put(Byte ok, Character ov)
AbstractByte2CharFunctionnull 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,Character>put in interface Map<Byte,Character>put in class AbstractByte2CharFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Character remove(Object ok)
AbstractByte2CharFunctionnull 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(char v)
AbstractByte2CharMapAbstractByte2CharMap.values().containsValue in interface Byte2CharMapcontainsValue in class AbstractByte2CharMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(byte k)
AbstractByte2CharMapAbstractByte2CharMap.keySet().containsKey in interface Byte2CharFunctioncontainsKey in class AbstractByte2CharMapFunction.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.
public boolean isEmpty()
public char get(byte k)
Byte2CharFunctionget in interface Byte2CharFunctionk - the key.Function.get(Object)public byte firstByteKey()
firstByteKey in interface Byte2CharSortedMapSortedMap.firstKey()public byte lastByteKey()
lastByteKey in interface Byte2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Byte2CharMap.Entry> byte2CharEntrySet()
Byte2CharSortedMapbyte2CharEntrySet in interface Byte2CharMapbyte2CharEntrySet in interface Byte2CharSortedMapByte2CharSortedMap.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 Byte2CharMapkeySet in interface Byte2CharSortedMapkeySet in interface Map<Byte,Character>keySet in interface SortedMap<Byte,Character>keySet in class AbstractByte2CharSortedMapMap.keySet()public CharCollection 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 Byte2CharMapvalues in interface Byte2CharSortedMapvalues in interface Map<Byte,Character>values in interface SortedMap<Byte,Character>values in class AbstractByte2CharSortedMapMap.values()public ByteComparator comparator()
Byte2CharSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Byte2CharSortedMapcomparator in interface SortedMap<Byte,Character>SortedMap.comparator()public Byte2CharSortedMap headMap(byte to)
Byte2CharSortedMaptoKey.headMap in interface Byte2CharSortedMapSortedMap.headMap(Object)public Byte2CharSortedMap tailMap(byte from)
Byte2CharSortedMapfromKey.tailMap in interface Byte2CharSortedMapSortedMap.tailMap(Object)public Byte2CharSortedMap subMap(byte from, byte to)
Byte2CharSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Byte2CharSortedMapSortedMap.subMap(Object,Object)public Byte2CharRBTreeMap 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.