public class Char2ByteRBTreeMap extends AbstractChar2ByteSortedMap 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.
AbstractChar2ByteMap.BasicEntry
Char2ByteSortedMap.FastSortedEntrySet
Char2ByteMap.FastEntrySet
Constructor and Description |
---|
Char2ByteRBTreeMap()
Creates a new empty tree map.
|
Char2ByteRBTreeMap(char[] k,
byte[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2ByteRBTreeMap(char[] k,
byte[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2ByteRBTreeMap(Char2ByteMap m)
Creates a new tree map copying a given map.
|
Char2ByteRBTreeMap(Char2ByteSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Char2ByteRBTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2ByteRBTreeMap(Map<? extends Character,? extends Byte> m)
Creates a new tree map copying a given map.
|
Char2ByteRBTreeMap(SortedMap<Character,Byte> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
ObjectSortedSet<Char2ByteMap.Entry> |
char2ByteEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2ByteRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
CharComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(char k)
Checks whether the given value is contained in
AbstractChar2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractChar2ByteMap.values() . |
char |
firstCharKey() |
byte |
get(char k)
Returns the value to which the given key is mapped.
|
Char2ByteSortedMap |
headMap(char to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
boolean |
isEmpty() |
CharSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
char |
lastCharKey() |
Byte |
put(Character ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
put(char k,
byte v)
Adds a pair to the map.
|
byte |
remove(char k)
Removes the mapping with the given key.
|
Byte |
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.
|
Char2ByteSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Char2ByteSortedMap |
tailMap(char 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
containsKey, containsValue, equals, get, hashCode, putAll
public Char2ByteRBTreeMap()
public Char2ByteRBTreeMap(Comparator<? super Character> c)
c
- a (possibly type-specific) comparator.public Char2ByteRBTreeMap(Map<? extends Character,? extends Byte> m)
m
- a Map
to be copied into the new tree map.public Char2ByteRBTreeMap(SortedMap<Character,Byte> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Char2ByteRBTreeMap(Char2ByteMap m)
m
- a type-specific map to be copied into the new tree map.public Char2ByteRBTreeMap(Char2ByteSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Char2ByteRBTreeMap(char[] k, byte[] v, Comparator<? super Character> 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 Char2ByteRBTreeMap(char[] 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(char k, byte v)
Char2ByteFunction
put
in interface Char2ByteFunction
put
in class AbstractChar2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(char k)
Char2ByteFunction
remove
in interface Char2ByteFunction
remove
in class AbstractChar2ByteFunction
k
- the key.Function.remove(Object)
public Byte put(Character ok, Byte ov)
AbstractChar2ByteFunction
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<Character,Byte>
put
in interface Map<Character,Byte>
put
in class AbstractChar2ByteFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Byte remove(Object ok)
AbstractChar2ByteFunction
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)
AbstractChar2ByteMap
AbstractChar2ByteMap.values()
.containsValue
in interface Char2ByteMap
containsValue
in class AbstractChar2ByteMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(char k)
AbstractChar2ByteMap
AbstractChar2ByteMap.keySet()
.containsKey
in interface Char2ByteFunction
containsKey
in class AbstractChar2ByteMap
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 byte get(char k)
Char2ByteFunction
get
in interface Char2ByteFunction
k
- the key.Function.get(Object)
public char firstCharKey()
firstCharKey
in interface Char2ByteSortedMap
SortedMap.firstKey()
public char lastCharKey()
lastCharKey
in interface Char2ByteSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Char2ByteMap.Entry> char2ByteEntrySet()
Char2ByteSortedMap
char2ByteEntrySet
in interface Char2ByteMap
char2ByteEntrySet
in interface Char2ByteSortedMap
Char2ByteSortedMap.entrySet()
public CharSortedSet 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 Char2ByteMap
keySet
in interface Char2ByteSortedMap
keySet
in interface Map<Character,Byte>
keySet
in interface SortedMap<Character,Byte>
keySet
in class AbstractChar2ByteSortedMap
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 Char2ByteMap
values
in interface Char2ByteSortedMap
values
in interface Map<Character,Byte>
values
in interface SortedMap<Character,Byte>
values
in class AbstractChar2ByteSortedMap
Map.values()
public CharComparator comparator()
Char2ByteSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Char2ByteSortedMap
comparator
in interface SortedMap<Character,Byte>
SortedMap.comparator()
public Char2ByteSortedMap headMap(char to)
Char2ByteSortedMap
toKey
.headMap
in interface Char2ByteSortedMap
SortedMap.headMap(Object)
public Char2ByteSortedMap tailMap(char from)
Char2ByteSortedMap
fromKey
.tailMap
in interface Char2ByteSortedMap
SortedMap.tailMap(Object)
public Char2ByteSortedMap subMap(char from, char to)
Char2ByteSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Char2ByteSortedMap
SortedMap.subMap(Object,Object)
public Char2ByteRBTreeMap 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.