|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2IntMap
it.unimi.dsi.fastutil.longs.AbstractLong2IntSortedMap
it.unimi.dsi.fastutil.longs.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 inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntMap |
AbstractLong2IntMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Long2IntRBTreeMap()
Creates a new empty tree map. |
|
Long2IntRBTreeMap(Comparator 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 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 m)
Creates a new tree map copying a given map. |
|
Long2IntRBTreeMap(SortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
Method Summary | |
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree map. |
Comparator |
comparator()
|
boolean |
containsKey(long k)
Checks whether the given value is contained in keySet() . |
boolean |
containsValue(int v)
Checks whether the given value is contained in values() . |
Set |
entrySet()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
long |
firstLongKey()
|
int |
get(long k)
Returns the value to which the given key is mapped. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
Long2IntSortedMap |
headMap(long to)
|
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
Object |
lastKey()
Delegates to the corresponding type-specific method. |
long |
lastLongKey()
|
int |
put(long k,
int v)
Adds a pair to the map. |
Object |
put(Object ok,
Object 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. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
size()
|
Long2IntSortedMap |
subMap(long from,
long to)
|
Long2IntSortedMap |
tailMap(long from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntSortedMap |
headMap, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2IntMap |
containsKey, containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, hashCode, putAll, setDefRetValue, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.longs.Long2IntMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
Methods inherited from interface java.util.Map |
containsKey, containsValue, equals, hashCode, putAll |
Methods inherited from interface java.util.SortedMap |
headMap, subMap, tailMap |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public Long2IntRBTreeMap()
public Long2IntRBTreeMap(Comparator c)
c
- a Comparator
.public Long2IntRBTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Long2IntRBTreeMap(SortedMap 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 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)
Long2IntMap
put
in interface Long2IntMap
put
in class AbstractLong2IntMap
public int remove(long k)
Long2IntMap
remove
in interface Long2IntMap
remove
in class AbstractLong2IntMap
public Object put(Object ok, Object ov)
AbstractLong2IntMap
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 Map
put
in class AbstractLong2IntMap
public Object remove(Object ok)
AbstractLong2IntMap
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 Map
remove
in class AbstractLong2IntMap
public boolean containsValue(int v)
AbstractLong2IntMap
AbstractLong2IntMap.values()
.
containsValue
in interface Long2IntMap
containsValue
in class AbstractLong2IntMap
public void clear()
clear
in interface Map
clear
in class AbstractLong2IntMap
public boolean containsKey(long k)
AbstractLong2IntMap
AbstractLong2IntMap.keySet()
.
containsKey
in interface Long2IntMap
containsKey
in class AbstractLong2IntMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractLong2IntMap
public int get(long k)
Long2IntMap
get
in interface Long2IntMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractLong2IntMap
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.
get
in interface Map
get
in class AbstractLong2IntMap
public long firstLongKey()
firstLongKey
in interface Long2IntSortedMap
SortedMap.firstKey()
public long lastLongKey()
lastLongKey
in interface Long2IntSortedMap
SortedMap.lastKey()
public Object firstKey()
AbstractLong2IntSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractLong2IntSortedMap
public Object lastKey()
AbstractLong2IntSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractLong2IntSortedMap
public Set entrySet()
entrySet
in interface Map
public Set 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 Map
keySet
in class AbstractLong2IntSortedMap
public Collection 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 Map
values
in class AbstractLong2IntMap
public Comparator comparator()
comparator
in interface SortedMap
public Long2IntSortedMap headMap(long to)
headMap
in interface Long2IntSortedMap
SortedMap.headMap(Object)
public Long2IntSortedMap tailMap(long from)
tailMap
in interface Long2IntSortedMap
SortedMap.tailMap(Object)
public Long2IntSortedMap subMap(long from, long to)
subMap
in interface Long2IntSortedMap
SortedMap.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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |