public class Long2LongRBTreeMap 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.BasicEntry
Long2LongSortedMap.FastSortedEntrySet
Long2LongMap.FastEntrySet
Constructor and Description |
---|
Long2LongRBTreeMap()
Creates a new empty tree map.
|
Long2LongRBTreeMap(java.util.Comparator<? super java.lang.Long> c)
Creates a new empty tree map with the given comparator.
|
Long2LongRBTreeMap(long[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2LongRBTreeMap(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.
|
Long2LongRBTreeMap(Long2LongMap m)
Creates a new tree map copying a given map.
|
Long2LongRBTreeMap(Long2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Long2LongRBTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> m)
Creates a new tree map copying a given map.
|
Long2LongRBTreeMap(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 |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Long2LongRBTreeMap |
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)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
remove(long k)
Removes the mapping with the given key.
|
java.lang.Long |
remove(java.lang.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.
|
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, tailMap
containsValue, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get
defaultReturnValue, defaultReturnValue
containsKey, get
public Long2LongRBTreeMap()
public Long2LongRBTreeMap(java.util.Comparator<? super java.lang.Long> c)
c
- a (possibly type-specific) comparator.public Long2LongRBTreeMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Long> m)
m
- a Map
to be copied into the new tree map.public Long2LongRBTreeMap(java.util.SortedMap<java.lang.Long,java.lang.Long> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Long2LongRBTreeMap(Long2LongMap m)
m
- a type-specific map to be copied into the new tree map.public Long2LongRBTreeMap(Long2LongSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Long2LongRBTreeMap(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 Long2LongRBTreeMap(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 put(long k, long v)
Long2LongFunction
put
in interface Long2LongFunction
put
in class AbstractLong2LongFunction
k
- the key.v
- the value.Function.put(Object,Object)
public long remove(long k)
Long2LongFunction
remove
in interface Long2LongFunction
remove
in class AbstractLong2LongFunction
k
- the key.Function.remove(Object)
public java.lang.Long put(java.lang.Long ok, java.lang.Long ov)
AbstractLong2LongFunction
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 AbstractLong2LongFunction
ok
- the key.ov
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public java.lang.Long remove(java.lang.Object ok)
AbstractLong2LongFunction
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 AbstractLong2LongFunction
ok
- the key.null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(long v)
AbstractLong2LongMap
AbstractLong2LongMap.values()
.containsValue
in interface Long2LongMap
containsValue
in class AbstractLong2LongMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<java.lang.Long,java.lang.Long>
clear
in interface java.util.Map<java.lang.Long,java.lang.Long>
clear
in class AbstractLong2LongFunction
Map.clear()
public boolean containsKey(long k)
AbstractLong2LongMap
AbstractLong2LongMap.keySet()
.containsKey
in interface Long2LongFunction
containsKey
in class AbstractLong2LongMap
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()
isEmpty
in interface java.util.Map<java.lang.Long,java.lang.Long>
isEmpty
in class AbstractLong2LongMap
public long get(long k)
Long2LongFunction
get
in interface Long2LongFunction
k
- the key.Function.get(Object)
public long firstLongKey()
firstLongKey
in interface Long2LongSortedMap
SortedMap.firstKey()
public long lastLongKey()
lastLongKey
in interface Long2LongSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Long2LongMap.Entry> long2LongEntrySet()
Long2LongSortedMap
long2LongEntrySet
in interface Long2LongMap
long2LongEntrySet
in interface Long2LongSortedMap
Long2LongSortedMap.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 Long2LongMap
keySet
in interface Long2LongSortedMap
keySet
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 AbstractLong2LongSortedMap
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 Long2LongMap
values
in interface Long2LongSortedMap
values
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 AbstractLong2LongSortedMap
Map.values()
public LongComparator comparator()
Long2LongSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Long2LongSortedMap
comparator
in interface java.util.SortedMap<java.lang.Long,java.lang.Long>
SortedMap.comparator()
public Long2LongSortedMap headMap(long to)
Long2LongSortedMap
toKey
.headMap
in interface Long2LongSortedMap
SortedMap.headMap(Object)
public Long2LongSortedMap tailMap(long from)
Long2LongSortedMap
fromKey
.tailMap
in interface Long2LongSortedMap
SortedMap.tailMap(Object)
public Long2LongSortedMap subMap(long from, long to)
Long2LongSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Long2LongSortedMap
SortedMap.subMap(Object,Object)
public Long2LongRBTreeMap 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