public class Long2IntRBTreeMap extends AbstractLong2IntSortedMap 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.
AbstractLong2IntMap.BasicEntry
Long2IntSortedMap.FastSortedEntrySet
Long2IntMap.FastEntrySet
Constructor and Description |
---|
Long2IntRBTreeMap()
Creates a new empty tree map.
|
Long2IntRBTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator.
|
Long2IntRBTreeMap(long[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Long2IntRBTreeMap(long[] k,
int[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Long2IntRBTreeMap(Long2IntMap m)
Creates a new tree map copying a given map.
|
Long2IntRBTreeMap(Long2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Long2IntRBTreeMap(Map<? extends Long,? extends Integer> m)
Creates a new tree map copying a given map.
|
Long2IntRBTreeMap(SortedMap<Long,Integer> 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).
|
Long2IntRBTreeMap |
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
AbstractLong2IntMap.keySet() . |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractLong2IntMap.values() . |
long |
firstLongKey() |
int |
get(long k)
Returns the value to which the given key is mapped.
|
Long2IntSortedMap |
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<Long2IntMap.Entry> |
long2IntEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
int |
put(long k,
int v)
Adds a pair to the map.
|
Integer |
put(Long ok,
Integer ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
remove(long k)
Removes the mapping with the given key.
|
Integer |
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.
|
Long2IntSortedMap |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Long2IntSortedMap |
tailMap(long from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey . |
IntCollection |
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 Long2IntRBTreeMap()
public Long2IntRBTreeMap(Comparator<? super Long> c)
c
- a (possibly type-specific) comparator.public Long2IntRBTreeMap(Map<? extends Long,? extends Integer> m)
m
- a Map
to be copied into the new tree map.public Long2IntRBTreeMap(SortedMap<Long,Integer> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Long2IntRBTreeMap(Long2IntMap m)
m
- a type-specific map to be copied into the new tree map.public Long2IntRBTreeMap(Long2IntSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Long2IntRBTreeMap(long[] k, int[] 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 Long2IntRBTreeMap(long[] k, int[] 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 int put(long k, int v)
Long2IntFunction
put
in interface Long2IntFunction
put
in class AbstractLong2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(long k)
Long2IntFunction
remove
in interface Long2IntFunction
remove
in class AbstractLong2IntFunction
Function.remove(Object)
public Integer put(Long ok, Integer ov)
AbstractLong2IntFunction
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 Integer remove(Object ok)
AbstractLong2IntFunction
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(int v)
AbstractLong2IntMap
AbstractLong2IntMap.values()
.containsValue
in interface Long2IntMap
containsValue
in class AbstractLong2IntMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(long k)
AbstractLong2IntMap
AbstractLong2IntMap.keySet()
.containsKey
in interface Long2IntFunction
containsKey
in class AbstractLong2IntMap
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 int get(long k)
Long2IntFunction
get
in interface Long2IntFunction
k
- the key.Function.get(Object)
public long firstLongKey()
firstLongKey
in interface Long2IntSortedMap
SortedMap.firstKey()
public long lastLongKey()
lastLongKey
in interface Long2IntSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Long2IntMap.Entry> long2IntEntrySet()
Long2IntSortedMap
long2IntEntrySet
in interface Long2IntMap
long2IntEntrySet
in interface Long2IntSortedMap
Long2IntSortedMap.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 Long2IntMap
keySet
in interface Long2IntSortedMap
keySet
in interface Map<Long,Integer>
keySet
in interface SortedMap<Long,Integer>
keySet
in class AbstractLong2IntSortedMap
Map.keySet()
public IntCollection 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 Long2IntMap
values
in interface Long2IntSortedMap
values
in interface Map<Long,Integer>
values
in interface SortedMap<Long,Integer>
values
in class AbstractLong2IntSortedMap
Map.values()
public LongComparator comparator()
Long2IntSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Long2IntSortedMap
comparator
in interface SortedMap<Long,Integer>
SortedMap.comparator()
public Long2IntSortedMap headMap(long to)
Long2IntSortedMap
toKey
.headMap
in interface Long2IntSortedMap
SortedMap.headMap(Object)
public Long2IntSortedMap tailMap(long from)
Long2IntSortedMap
fromKey
.tailMap
in interface Long2IntSortedMap
SortedMap.tailMap(Object)
public Long2IntSortedMap subMap(long from, long to)
Long2IntSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Long2IntSortedMap
SortedMap.subMap(Object,Object)
public Long2IntRBTreeMap 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.