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