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.BasicEntryLong2CharSortedMap.FastSortedEntrySetLong2CharMap.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, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, containsValue, equals, get, hashCode, putAllpublic 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)
Long2CharFunctionput in interface Long2CharFunctionput in class AbstractLong2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(long k)
Long2CharFunctionremove in interface Long2CharFunctionremove in class AbstractLong2CharFunctionFunction.remove(Object)public Character put(Long ok, Character ov)
AbstractLong2CharFunctionnull 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 AbstractLong2CharFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Character remove(Object ok)
AbstractLong2CharFunctionnull 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)
AbstractLong2CharMapAbstractLong2CharMap.values().containsValue in interface Long2CharMapcontainsValue in class AbstractLong2CharMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(long k)
AbstractLong2CharMapAbstractLong2CharMap.keySet().containsKey in interface Long2CharFunctioncontainsKey in class AbstractLong2CharMapFunction.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(long k)
Long2CharFunctionget in interface Long2CharFunctionk - the key.Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2CharSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2CharSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2CharMap.Entry> long2CharEntrySet()
Long2CharSortedMaplong2CharEntrySet in interface Long2CharMaplong2CharEntrySet in interface Long2CharSortedMapLong2CharSortedMap.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 Long2CharMapkeySet in interface Long2CharSortedMapkeySet in interface Map<Long,Character>keySet in interface SortedMap<Long,Character>keySet in class AbstractLong2CharSortedMapMap.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 Long2CharMapvalues in interface Long2CharSortedMapvalues in interface Map<Long,Character>values in interface SortedMap<Long,Character>values in class AbstractLong2CharSortedMapMap.values()public LongComparator comparator()
Long2CharSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2CharSortedMapcomparator in interface SortedMap<Long,Character>SortedMap.comparator()public Long2CharSortedMap headMap(long to)
Long2CharSortedMaptoKey.headMap in interface Long2CharSortedMapSortedMap.headMap(Object)public Long2CharSortedMap tailMap(long from)
Long2CharSortedMapfromKey.tailMap in interface Long2CharSortedMapSortedMap.tailMap(Object)public Long2CharSortedMap subMap(long from, long to)
Long2CharSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Long2CharSortedMapSortedMap.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.