|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2IntFunction
it.unimi.dsi.fastutil.longs.AbstractLong2IntMap
it.unimi.dsi.fastutil.longs.AbstractLong2IntSortedMap
it.unimi.dsi.fastutil.longs.Long2IntRBTreeMap
public class Long2IntRBTreeMap
A type-specific red-black tree map with a fast, small-footprint implementation.
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.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntMap |
|---|
AbstractLong2IntMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2IntSortedMap |
|---|
Long2IntSortedMap.FastSortedEntrySet |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2IntMap |
|---|
Long2IntMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Constructor Summary | |
|---|---|
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). |
|
| Method Summary | |
|---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Object |
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 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. |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntMap |
|---|
containsValue, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntFunction |
|---|
containsKey, defaultReturnValue, defaultReturnValue, get |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.longs.Long2IntFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, containsValue, equals, get, hashCode, putAll |
| Methods inherited from interface java.util.Map |
|---|
containsKey, containsValue, equals, get, hashCode, putAll |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
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.| Method Detail |
|---|
public int put(long k,
int v)
Long2IntFunction
put in interface Long2IntFunctionput in class AbstractLong2IntFunctionk - the key.v - the value.
Function.put(Object,Object)public int remove(long k)
Long2IntFunction
remove in interface Long2IntFunctionremove in class AbstractLong2IntFunctionFunction.remove(Object)
public Integer put(Long ok,
Integer ov)
AbstractLong2IntFunctionnull 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,Integer>put in interface Map<Long,Integer>put in class AbstractLong2IntFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public Integer remove(Object ok)
AbstractLong2IntFunctionnull 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<Long,Integer>remove in interface Map<Long,Integer>remove in class AbstractLong2IntFunctionnull if no value was present for the given key.Map.remove(Object)public boolean containsValue(int v)
AbstractLong2IntMapAbstractLong2IntMap.values().
containsValue in interface Long2IntMapcontainsValue in class AbstractLong2IntMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Long,Integer>clear in interface Map<Long,Integer>clear in class AbstractLong2IntFunctionMap.clear()public boolean containsKey(long k)
AbstractLong2IntMapAbstractLong2IntMap.keySet().
containsKey in interface Long2IntFunctioncontainsKey in class AbstractLong2IntMapFunction.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.
size in interface Function<Long,Integer>size in interface Map<Long,Integer>public boolean isEmpty()
isEmpty in interface Map<Long,Integer>isEmpty in class AbstractLong2IntMappublic int get(long k)
Long2IntFunction
get in interface Long2IntFunctionk - the key.
Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2IntSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2IntSortedMapSortedMap.lastKey()public ObjectSortedSet<Long2IntMap.Entry> long2IntEntrySet()
Long2IntMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Long2IntMap.entrySet()
so that it returns an ObjectSet
of objects of type Long2IntMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
long2IntEntrySet in interface Long2IntMaplong2IntEntrySet in interface Long2IntSortedMapLong2IntMap.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 Long2IntMapkeySet in interface Long2IntSortedMapkeySet in interface Map<Long,Integer>keySet in class AbstractLong2IntSortedMapMap.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 Long2IntMapvalues in interface Long2IntSortedMapvalues in interface Map<Long,Integer>values in class AbstractLong2IntSortedMapMap.values()public LongComparator comparator()
Long2IntSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2IntSortedMapcomparator in interface SortedMap<Long,Integer>SortedMap.comparator()public Long2IntSortedMap headMap(long to)
Long2IntSortedMaptoKey.
headMap in interface Long2IntSortedMapSortedMap.headMap(Object)public Long2IntSortedMap tailMap(long from)
Long2IntSortedMapfromKey.
tailMap in interface Long2IntSortedMapSortedMap.tailMap(Object)
public Long2IntSortedMap subMap(long from,
long to)
Long2IntSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Long2IntSortedMapSortedMap.subMap(Object,Object)public Object 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 Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||