public class Long2LongAVLTreeMap extends AbstractLong2LongSortedMap implements java.io.Serializable, java.lang.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.
AbstractLong2LongMap.BasicEntryLong2LongSortedMap.FastSortedEntrySetLong2LongMap.FastEntrySet| Constructor and Description |
|---|
Long2LongAVLTreeMap()
Creates a new empty tree map.
|
Long2LongAVLTreeMap(java.util.Comparator<? super java.lang.Long> c)
Creates a new empty tree map with the given comparator.
|
Long2LongAVLTreeMap(long[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2LongAVLTreeMap(long[] k,
long[] v,
java.util.Comparator<? super java.lang.Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2LongAVLTreeMap(Long2LongMap m)
Creates a new tree map copying a given map.
|
Long2LongAVLTreeMap(Long2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Long2LongAVLTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> m)
Creates a new tree map copying a given map.
|
Long2LongAVLTreeMap(java.util.SortedMap<java.lang.Long,java.lang.Long> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
long |
addTo(long k,
long incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Long2LongAVLTreeMap |
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
AbstractLong2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractLong2LongMap.values(). |
long |
firstLongKey() |
long |
get(long k)
Returns the value to which the given key is mapped.
|
Long2LongSortedMap |
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<Long2LongMap.Entry> |
long2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
long |
put(long k,
long v)
Adds a pair to the map.
|
java.lang.Long |
put(java.lang.Long ok,
java.lang.Long ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
long |
remove(long k)
Removes the mapping with the given key.
|
java.lang.Long |
remove(java.lang.Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Long2LongSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Long2LongSortedMap |
tailMap(long 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, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getpublic Long2LongAVLTreeMap()
public Long2LongAVLTreeMap(java.util.Comparator<? super java.lang.Long> c)
c - a (possibly type-specific) comparator.public Long2LongAVLTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> m)
m - a Map to be copied into the new tree map.public Long2LongAVLTreeMap(java.util.SortedMap<java.lang.Long,java.lang.Long> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Long2LongAVLTreeMap(Long2LongMap m)
m - a type-specific map to be copied into the new tree map.public Long2LongAVLTreeMap(Long2LongSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Long2LongAVLTreeMap(long[] k,
long[] v,
java.util.Comparator<? super java.lang.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.java.lang.IllegalArgumentException - if k and v have different lengths.public Long2LongAVLTreeMap(long[] k,
long[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.java.lang.IllegalArgumentException - if k and v have different lengths.public long addTo(long k,
long incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public long put(long k,
long v)
Long2LongFunctionput in interface Long2LongFunctionput in class AbstractLong2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(long k)
Long2LongFunctionremove in interface Long2LongFunctionremove in class AbstractLong2LongFunctionk - the key.Function.remove(Object)@Deprecated
public java.lang.Long put(java.lang.Long ok,
java.lang.Long ov)
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<java.lang.Long,java.lang.Long>put in interface java.util.Map<java.lang.Long,java.lang.Long>put in class AbstractLong2LongFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public java.lang.Long remove(java.lang.Object ok)
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.
remove in interface Function<java.lang.Long,java.lang.Long>remove in interface java.util.Map<java.lang.Long,java.lang.Long>remove in class AbstractLong2LongFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public boolean containsValue(long v)
AbstractLong2LongMapAbstractLong2LongMap.values().containsValue in interface Long2LongMapcontainsValue in class AbstractLong2LongMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Long,java.lang.Long>clear in interface java.util.Map<java.lang.Long,java.lang.Long>clear in class AbstractLong2LongFunctionMap.clear()public boolean containsKey(long k)
AbstractLong2LongMapAbstractLong2LongMap.keySet().containsKey in interface Long2LongFunctioncontainsKey in class AbstractLong2LongMapFunction.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()
isEmpty in interface java.util.Map<java.lang.Long,java.lang.Long>isEmpty in class AbstractLong2LongMappublic long get(long k)
Long2LongFunctionget in interface Long2LongFunctionk - the key.Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2LongSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2LongSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2LongMap.Entry> long2LongEntrySet()
Long2LongSortedMaplong2LongEntrySet in interface Long2LongMaplong2LongEntrySet in interface Long2LongSortedMapLong2LongSortedMap.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 Long2LongMapkeySet in interface Long2LongSortedMapkeySet in interface java.util.Map<java.lang.Long,java.lang.Long>keySet in interface java.util.SortedMap<java.lang.Long,java.lang.Long>keySet in class AbstractLong2LongSortedMapMap.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 Long2LongMapvalues in interface Long2LongSortedMapvalues in interface java.util.Map<java.lang.Long,java.lang.Long>values in interface java.util.SortedMap<java.lang.Long,java.lang.Long>values in class AbstractLong2LongSortedMapMap.values()public LongComparator comparator()
Long2LongSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2LongSortedMapcomparator in interface java.util.SortedMap<java.lang.Long,java.lang.Long>SortedMap.comparator()public Long2LongSortedMap headMap(long to)
Long2LongSortedMaptoKey.headMap in interface Long2LongSortedMapSortedMap.headMap(Object)public Long2LongSortedMap tailMap(long from)
Long2LongSortedMapfromKey.tailMap in interface Long2LongSortedMapSortedMap.tailMap(Object)public Long2LongSortedMap subMap(long from, long to)
Long2LongSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Long2LongSortedMapSortedMap.subMap(Object,Object)public Long2LongAVLTreeMap 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.
clone in class java.lang.Object