public class Char2LongAVLTreeMap extends AbstractChar2LongSortedMap 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.
AbstractChar2LongMap.BasicEntry
Char2LongSortedMap.FastSortedEntrySet
Char2LongMap.FastEntrySet
Constructor and Description |
---|
Char2LongAVLTreeMap()
Creates a new empty tree map.
|
Char2LongAVLTreeMap(char[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Char2LongAVLTreeMap(char[] k,
long[] v,
Comparator<? super Character> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Char2LongAVLTreeMap(Char2LongMap m)
Creates a new tree map copying a given map.
|
Char2LongAVLTreeMap(Char2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Char2LongAVLTreeMap(Comparator<? super Character> c)
Creates a new empty tree map with the given comparator.
|
Char2LongAVLTreeMap(Map<? extends Character,? extends Long> m)
Creates a new tree map copying a given map.
|
Char2LongAVLTreeMap(SortedMap<Character,Long> m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
ObjectSortedSet<Char2LongMap.Entry> |
char2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2LongAVLTreeMap |
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
AbstractChar2LongMap.keySet() . |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractChar2LongMap.values() . |
char |
firstCharKey() |
long |
get(char k)
Returns the value to which the given key is mapped.
|
Char2LongSortedMap |
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() |
Long |
put(Character ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
put(char k,
long v)
Adds a pair to the map.
|
long |
remove(char k)
Removes the mapping with the given key.
|
Long |
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.
|
Char2LongSortedMap |
subMap(char from,
char to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Char2LongSortedMap |
tailMap(char from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
LongCollection |
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 Char2LongAVLTreeMap()
public Char2LongAVLTreeMap(Comparator<? super Character> c)
c
- a (possibly type-specific) comparator.public Char2LongAVLTreeMap(Map<? extends Character,? extends Long> m)
m
- a Map
to be copied into the new tree map.public Char2LongAVLTreeMap(SortedMap<Character,Long> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Char2LongAVLTreeMap(Char2LongMap m)
m
- a type-specific map to be copied into the new tree map.public Char2LongAVLTreeMap(Char2LongSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Char2LongAVLTreeMap(char[] k, long[] 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 Char2LongAVLTreeMap(char[] k, long[] 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 long put(char k, long v)
Char2LongFunction
put
in interface Char2LongFunction
put
in class AbstractChar2LongFunction
k
- the key.v
- the value.Function.put(Object,Object)
public long remove(char k)
Char2LongFunction
remove
in interface Char2LongFunction
remove
in class AbstractChar2LongFunction
k
- the key.Function.remove(Object)
public Long put(Character ok, Long ov)
AbstractChar2LongFunction
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,Long>
put
in interface Map<Character,Long>
put
in class AbstractChar2LongFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public Long remove(Object ok)
AbstractChar2LongFunction
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(long v)
AbstractChar2LongMap
AbstractChar2LongMap.values()
.containsValue
in interface Char2LongMap
containsValue
in class AbstractChar2LongMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(char k)
AbstractChar2LongMap
AbstractChar2LongMap.keySet()
.containsKey
in interface Char2LongFunction
containsKey
in class AbstractChar2LongMap
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 long get(char k)
Char2LongFunction
get
in interface Char2LongFunction
k
- the key.Function.get(Object)
public char firstCharKey()
firstCharKey
in interface Char2LongSortedMap
SortedMap.firstKey()
public char lastCharKey()
lastCharKey
in interface Char2LongSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Char2LongMap.Entry> char2LongEntrySet()
Char2LongSortedMap
char2LongEntrySet
in interface Char2LongMap
char2LongEntrySet
in interface Char2LongSortedMap
Char2LongSortedMap.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 Char2LongMap
keySet
in interface Char2LongSortedMap
keySet
in interface Map<Character,Long>
keySet
in interface SortedMap<Character,Long>
keySet
in class AbstractChar2LongSortedMap
Map.keySet()
public LongCollection 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 Char2LongMap
values
in interface Char2LongSortedMap
values
in interface Map<Character,Long>
values
in interface SortedMap<Character,Long>
values
in class AbstractChar2LongSortedMap
Map.values()
public CharComparator comparator()
Char2LongSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Char2LongSortedMap
comparator
in interface SortedMap<Character,Long>
SortedMap.comparator()
public Char2LongSortedMap headMap(char to)
Char2LongSortedMap
toKey
.headMap
in interface Char2LongSortedMap
SortedMap.headMap(Object)
public Char2LongSortedMap tailMap(char from)
Char2LongSortedMap
fromKey
.tailMap
in interface Char2LongSortedMap
SortedMap.tailMap(Object)
public Char2LongSortedMap subMap(char from, char to)
Char2LongSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Char2LongSortedMap
SortedMap.subMap(Object,Object)
public Char2LongAVLTreeMap 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.