public class Int2LongRBTreeMap extends AbstractInt2LongSortedMap 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.
AbstractInt2LongMap.BasicEntry
Int2LongSortedMap.FastSortedEntrySet
Int2LongMap.FastEntrySet
Constructor and Description |
---|
Int2LongRBTreeMap()
Creates a new empty tree map.
|
Int2LongRBTreeMap(Comparator<? super Integer> c)
Creates a new empty tree map with the given comparator.
|
Int2LongRBTreeMap(int[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Int2LongRBTreeMap(int[] k,
long[] v,
Comparator<? super Integer> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Int2LongRBTreeMap(Int2LongMap m)
Creates a new tree map copying a given map.
|
Int2LongRBTreeMap(Int2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator ). |
Int2LongRBTreeMap(Map<? extends Integer,? extends Long> m)
Creates a new tree map copying a given map.
|
Int2LongRBTreeMap(SortedMap<Integer,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).
|
Int2LongRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2LongMap.keySet() . |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractInt2LongMap.values() . |
int |
firstIntKey() |
long |
get(int k)
Returns the value to which the given key is mapped.
|
Int2LongSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey . |
ObjectSortedSet<Int2LongMap.Entry> |
int2LongEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
int |
lastIntKey() |
Long |
put(Integer ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
long |
put(int k,
long v)
Adds a pair to the map.
|
long |
remove(int k)
Removes the mapping with the given key.
|
Long |
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.
|
Int2LongSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from
fromKey , inclusive, to toKey , exclusive. |
Int2LongSortedMap |
tailMap(int 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
containsKey, containsValue, equals, get, hashCode, putAll
public Int2LongRBTreeMap()
public Int2LongRBTreeMap(Comparator<? super Integer> c)
c
- a (possibly type-specific) comparator.public Int2LongRBTreeMap(Map<? extends Integer,? extends Long> m)
m
- a Map
to be copied into the new tree map.public Int2LongRBTreeMap(SortedMap<Integer,Long> m)
Comparator
).m
- a SortedMap
to be copied into the new tree map.public Int2LongRBTreeMap(Int2LongMap m)
m
- a type-specific map to be copied into the new tree map.public Int2LongRBTreeMap(Int2LongSortedMap m)
Comparator
).m
- a type-specific sorted map to be copied into the new tree map.public Int2LongRBTreeMap(int[] k, long[] v, Comparator<? super Integer> 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 Int2LongRBTreeMap(int[] k, long[] 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 long put(int k, long v)
Int2LongFunction
put
in interface Int2LongFunction
put
in class AbstractInt2LongFunction
k
- the key.v
- the value.Function.put(Object,Object)
public long remove(int k)
Int2LongFunction
remove
in interface Int2LongFunction
remove
in class AbstractInt2LongFunction
Function.remove(Object)
public Long put(Integer ok, Long ov)
AbstractInt2LongFunction
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 Long remove(Object ok)
AbstractInt2LongFunction
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(long v)
AbstractInt2LongMap
AbstractInt2LongMap.values()
.containsValue
in interface Int2LongMap
containsValue
in class AbstractInt2LongMap
Map.containsValue(Object)
public void clear()
Function
public boolean containsKey(int k)
AbstractInt2LongMap
AbstractInt2LongMap.keySet()
.containsKey
in interface Int2LongFunction
containsKey
in class AbstractInt2LongMap
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 long get(int k)
Int2LongFunction
get
in interface Int2LongFunction
k
- the key.Function.get(Object)
public int firstIntKey()
firstIntKey
in interface Int2LongSortedMap
SortedMap.firstKey()
public int lastIntKey()
lastIntKey
in interface Int2LongSortedMap
SortedMap.lastKey()
public ObjectSortedSet<Int2LongMap.Entry> int2LongEntrySet()
Int2LongSortedMap
int2LongEntrySet
in interface Int2LongMap
int2LongEntrySet
in interface Int2LongSortedMap
Int2LongSortedMap.entrySet()
public IntSortedSet 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 Int2LongMap
keySet
in interface Int2LongSortedMap
keySet
in interface Map<Integer,Long>
keySet
in interface SortedMap<Integer,Long>
keySet
in class AbstractInt2LongSortedMap
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 Int2LongMap
values
in interface Int2LongSortedMap
values
in interface Map<Integer,Long>
values
in interface SortedMap<Integer,Long>
values
in class AbstractInt2LongSortedMap
Map.values()
public IntComparator comparator()
Int2LongSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Int2LongSortedMap
comparator
in interface SortedMap<Integer,Long>
SortedMap.comparator()
public Int2LongSortedMap headMap(int to)
Int2LongSortedMap
toKey
.headMap
in interface Int2LongSortedMap
SortedMap.headMap(Object)
public Int2LongSortedMap tailMap(int from)
Int2LongSortedMap
fromKey
.tailMap
in interface Int2LongSortedMap
SortedMap.tailMap(Object)
public Int2LongSortedMap subMap(int from, int to)
Int2LongSortedMap
fromKey
, inclusive, to toKey
, exclusive.subMap
in interface Int2LongSortedMap
SortedMap.subMap(Object,Object)
public Int2LongRBTreeMap 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.