|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2LongFunction<K>
it.unimi.dsi.fastutil.objects.AbstractObject2LongMap<K>
it.unimi.dsi.fastutil.objects.AbstractObject2LongSortedMap<K>
it.unimi.dsi.fastutil.objects.Object2LongAVLTreeMap<K>
public class Object2LongAVLTreeMap<K>
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.objects.AbstractObject2LongMap |
---|
AbstractObject2LongMap.BasicEntry<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2LongSortedMap |
---|
Object2LongSortedMap.FastSortedEntrySet<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2LongMap |
---|
Object2LongMap.FastEntrySet<K> |
Field Summary | |
---|---|
static long |
serialVersionUID
|
Constructor Summary | |
---|---|
Object2LongAVLTreeMap()
Creates a new empty tree map. |
|
Object2LongAVLTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator. |
|
Object2LongAVLTreeMap(K[] k,
long[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Object2LongAVLTreeMap(K[] k,
long[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Object2LongAVLTreeMap(Map<? extends K,? extends Long> m)
Creates a new tree map copying a given map. |
|
Object2LongAVLTreeMap(Object2LongMap<? extends K> m)
Creates a new tree map copying a given map. |
|
Object2LongAVLTreeMap(Object2LongSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Object2LongAVLTreeMap(SortedMap<K,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). |
Object |
clone()
Returns a deep copy of this tree map. |
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(Object k)
Checks whether the given value is contained in AbstractObject2LongMap.keySet() . |
boolean |
containsValue(long v)
Checks whether the given value is contained in AbstractObject2LongMap.values() . |
K |
firstKey()
|
Long |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
long |
getLong(Object k)
Returns the value to which the given key is mapped. |
Object2LongSortedMap<K> |
headMap(K to)
Delegates to the corresponding type-specific method. |
boolean |
isEmpty()
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map. |
K |
lastKey()
|
ObjectSortedSet<Object2LongMap.Entry<K>> |
object2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
long |
put(K k,
long v)
Adds a pair to the map. |
Long |
put(K ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
Long |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
long |
removeLong(Object k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
Object2LongSortedMap<K> |
subMap(K from,
K to)
Delegates to the corresponding type-specific method. |
Object2LongSortedMap<K> |
tailMap(K from)
Delegates to the corresponding type-specific method. |
LongCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2LongSortedMap |
---|
entrySet |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2LongMap |
---|
containsValue, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2LongFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2LongFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface java.util.Map |
---|
containsValue, equals, hashCode, putAll |
Methods inherited from interface java.util.Map |
---|
containsValue, equals, hashCode, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Object2LongAVLTreeMap()
public Object2LongAVLTreeMap(Comparator<? super K> c)
c
- a (possibly type-specific) comparator.public Object2LongAVLTreeMap(Map<? extends K,? extends Long> m)
m
- a Map
to be copied into the new tree map.public Object2LongAVLTreeMap(SortedMap<K,Long> m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Object2LongAVLTreeMap(Object2LongMap<? extends K> m)
m
- a type-specific map to be copied into the new tree map.public Object2LongAVLTreeMap(Object2LongSortedMap<K> m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Object2LongAVLTreeMap(K[] k, long[] v, Comparator<? super K> 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 Object2LongAVLTreeMap(K[] 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(K k, long v)
Object2LongFunction
put
in interface Object2LongFunction<K>
put
in class AbstractObject2LongFunction<K>
k
- the key.v
- the value.
Function.put(Object,Object)
public long removeLong(Object k)
Object2LongFunction
removeLong
in interface Object2LongFunction<K>
removeLong
in class AbstractObject2LongFunction<K>
Function.remove(Object)
public Long put(K ok, Long ov)
AbstractObject2LongFunction
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<K,Long>
put
in interface Map<K,Long>
put
in class AbstractObject2LongFunction<K>
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)
AbstractObject2LongFunction
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<K,Long>
remove
in interface Map<K,Long>
remove
in class AbstractObject2LongFunction<K>
null
if no value was present for the given key.Map.remove(Object)
public boolean containsValue(long v)
AbstractObject2LongMap
AbstractObject2LongMap.values()
.
containsValue
in interface Object2LongMap<K>
containsValue
in class AbstractObject2LongMap<K>
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<K,Long>
clear
in interface Map<K,Long>
clear
in class AbstractObject2LongFunction<K>
Map.clear()
public boolean containsKey(Object k)
AbstractObject2LongMap
AbstractObject2LongMap.keySet()
.
containsKey
in interface Function<K,Long>
containsKey
in interface Map<K,Long>
containsKey
in class AbstractObject2LongMap<K>
k
- the key.
key
.Map.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<K,Long>
size
in interface Map<K,Long>
public boolean isEmpty()
isEmpty
in interface Map<K,Long>
isEmpty
in class AbstractObject2LongMap<K>
public long getLong(Object k)
Object2LongFunction
getLong
in interface Object2LongFunction<K>
k
- the key.
Function.get(Object)
public Long get(Object ok)
AbstractObject2LongFunction
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 Function<K,Long>
get
in interface Map<K,Long>
get
in class AbstractObject2LongFunction<K>
ok
- the key.
null
if no value was present for the given key.Map.get(Object)
public K firstKey()
firstKey
in interface SortedMap<K,Long>
public K lastKey()
lastKey
in interface SortedMap<K,Long>
public ObjectSortedSet<Object2LongMap.Entry<K>> object2LongEntrySet()
Object2LongMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Object2LongMap.entrySet()
so that it returns an ObjectSet
of objects of type Object2LongMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
object2LongEntrySet
in interface Object2LongMap<K>
object2LongEntrySet
in interface Object2LongSortedMap<K>
Object2LongMap.entrySet()
public ObjectSortedSet<K> 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 Object2LongMap<K>
keySet
in interface Object2LongSortedMap<K>
keySet
in interface Map<K,Long>
keySet
in class AbstractObject2LongSortedMap<K>
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 Object2LongMap<K>
values
in interface Object2LongSortedMap<K>
values
in interface Map<K,Long>
values
in class AbstractObject2LongSortedMap<K>
Map.values()
public Comparator<? super K> comparator()
Object2LongSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Object2LongSortedMap<K>
comparator
in interface SortedMap<K,Long>
SortedMap.comparator()
public Object2LongSortedMap<K> headMap(K to)
AbstractObject2LongSortedMap
headMap
in interface Object2LongSortedMap<K>
headMap
in interface SortedMap<K,Long>
headMap
in class AbstractObject2LongSortedMap<K>
SortedMap.headMap(Object)
public Object2LongSortedMap<K> tailMap(K from)
AbstractObject2LongSortedMap
tailMap
in interface Object2LongSortedMap<K>
tailMap
in interface SortedMap<K,Long>
tailMap
in class AbstractObject2LongSortedMap<K>
SortedMap.tailMap(Object)
public Object2LongSortedMap<K> subMap(K from, K to)
AbstractObject2LongSortedMap
subMap
in interface Object2LongSortedMap<K>
subMap
in interface SortedMap<K,Long>
subMap
in class AbstractObject2LongSortedMap<K>
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.
clone
in class Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |