|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2LongFunction
it.unimi.dsi.fastutil.longs.AbstractLong2LongMap
it.unimi.dsi.fastutil.longs.AbstractLong2LongSortedMap
it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap
public class Long2LongAVLTreeMap
A type-specific AVL 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.AbstractLong2LongSortedMap |
---|
AbstractLong2LongSortedMap.KeySetIterator, AbstractLong2LongSortedMap.ValuesCollection, AbstractLong2LongSortedMap.ValuesIterator |
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2LongMap |
---|
AbstractLong2LongMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2LongSortedMap |
---|
Long2LongSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2LongMap |
---|
Long2LongMap.FastEntrySet |
Field Summary | |
---|---|
protected LongComparator |
actualComparator
This map's actual comparator; it may differ from storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of entries in this map. |
protected ObjectSortedSet<Long2LongMap.Entry> |
entries
Cached set of entries. |
protected it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap.Entry |
firstEntry
The first key in this map. |
protected LongSortedSet |
keys
Cached set of keys. |
protected it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap.Entry |
lastEntry
The last key in this map. |
protected boolean |
modified
The value of this variable remembers, after a put()
or a remove() , whether the domain of the map
has been modified. |
static long |
serialVersionUID
|
protected Comparator<? super Long> |
storedComparator
This map's comparator, as provided in the constructor. |
protected it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap.Entry |
tree
A reference to the root entry. |
protected LongCollection |
values
Cached collection of values. |
Fields inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2LongFunction |
---|
defRetValue |
Constructor Summary | |
---|---|
Long2LongAVLTreeMap()
Creates a new empty tree map. |
|
Long2LongAVLTreeMap(Comparator<? super Long> c)
Creates a new empty tree map with the given comparator. |
|
Long2LongAVLTreeMap(long[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Long2LongAVLTreeMap(long[] k,
long[] v,
Comparator<? super Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Long2LongAVLTreeMap(Long2LongMap m)
Creates a new tree map copying a given map. |
|
Long2LongAVLTreeMap(Long2LongSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Long2LongAVLTreeMap(Map<? extends Long,? extends Long> m)
Creates a new tree map copying a given map. |
|
Long2LongAVLTreeMap(SortedMap<Long,Long> 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). |
Long2LongAVLTreeMap |
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. |
Long |
put(Long ok,
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. |
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. |
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. |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2LongSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2LongMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2LongFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.longs.Long2LongFunction |
---|
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 |
Field Detail |
---|
protected transient it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap.Entry firstEntry
protected transient it.unimi.dsi.fastutil.longs.Long2LongAVLTreeMap.Entry lastEntry
protected transient volatile ObjectSortedSet<Long2LongMap.Entry> entries
protected transient volatile LongSortedSet keys
protected transient volatile LongCollection values
protected transient boolean modified
put()
or a remove()
, whether the domain of the map
has been modified.
protected Comparator<? super Long> storedComparator
protected transient LongComparator actualComparator
storedComparator
because it is
always a type-specific comparator, so it could be derived from the former by wrapping.
public static final long serialVersionUID
Constructor Detail |
---|
public Long2LongAVLTreeMap()
public Long2LongAVLTreeMap(Comparator<? super Long> c)
c
- a (possibly type-specific) comparator.public Long2LongAVLTreeMap(Map<? extends Long,? extends Long> m)
m
- a Map
to be copied into the new tree map.public Long2LongAVLTreeMap(SortedMap<Long,Long> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Long2LongAVLTreeMap(Long2LongMap m)
m
- a type-specific map to be copied into the new tree map.public Long2LongAVLTreeMap(Long2LongSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Long2LongAVLTreeMap(long[] k, long[] 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 Long2LongAVLTreeMap(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.
IllegalArgumentException
- if k
and v
have different lengths.Method Detail |
---|
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
Function.remove(Object)
public Long put(Long ok, 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<Long,Long>
put
in interface Map<Long,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 Long remove(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<Long,Long>
remove
in interface Map<Long,Long>
remove
in class AbstractLong2LongFunction
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<Long,Long>
clear
in interface Map<Long,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.
size
in interface Function<Long,Long>
size
in interface Map<Long,Long>
public boolean isEmpty()
isEmpty
in interface Map<Long,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 Map<Long,Long>
keySet
in interface SortedMap<Long,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 Map<Long,Long>
values
in interface SortedMap<Long,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 SortedMap<Long,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 Long2LongAVLTreeMap 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 |