|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2ReferenceFunction<V>
it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceMap<V>
it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceSortedMap<V>
it.unimi.dsi.fastutil.longs.Long2ReferenceAVLTreeMap<V>
public class Long2ReferenceAVLTreeMap<V>
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.AbstractLong2ReferenceMap |
|---|
AbstractLong2ReferenceMap.BasicEntry<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceSortedMap |
|---|
Long2ReferenceSortedMap.FastSortedEntrySet<V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceMap |
|---|
Long2ReferenceMap.FastEntrySet<V> |
| Constructor Summary | |
|---|---|
Long2ReferenceAVLTreeMap()
Creates a new empty tree map. |
|
Long2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Long> c)
Creates a new empty tree map with the given comparator. |
|
Long2ReferenceAVLTreeMap(long[] k,
V[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Long2ReferenceAVLTreeMap(long[] k,
V[] v,
java.util.Comparator<? super java.lang.Long> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Long2ReferenceAVLTreeMap(Long2ReferenceMap<? extends V> m)
Creates a new tree map copying a given map. |
|
Long2ReferenceAVLTreeMap(Long2ReferenceSortedMap<V> m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Long2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Long,? extends V> m)
Creates a new tree map copying a given map. |
|
Long2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Long,V> 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). |
Long2ReferenceAVLTreeMap<V> |
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 AbstractLong2ReferenceMap.keySet(). |
boolean |
containsValue(java.lang.Object v)
Checks whether the given value is contained in AbstractLong2ReferenceMap.values(). |
long |
firstLongKey()
|
V |
get(long k)
Returns the value to which the given key is mapped. |
Long2ReferenceSortedMap<V> |
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<Long2ReferenceMap.Entry<V>> |
long2ReferenceEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
V |
put(long k,
V v)
Adds a pair to the map. |
V |
put(java.lang.Long ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
V |
remove(long k)
Removes the mapping with the given key. |
V |
remove(java.lang.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. |
Long2ReferenceSortedMap<V> |
subMap(long from,
long to)
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive. |
Long2ReferenceSortedMap<V> |
tailMap(long from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey. |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceSortedMap |
|---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceMap |
|---|
equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceFunction |
|---|
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.Long2ReferenceFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, equals, get, hashCode, putAll |
| Constructor Detail |
|---|
public Long2ReferenceAVLTreeMap()
public Long2ReferenceAVLTreeMap(java.util.Comparator<? super java.lang.Long> c)
c - a (possibly type-specific) comparator.public Long2ReferenceAVLTreeMap(java.util.Map<? extends java.lang.Long,? extends V> m)
m - a Map to be copied into the new tree map.public Long2ReferenceAVLTreeMap(java.util.SortedMap<java.lang.Long,V> m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Long2ReferenceAVLTreeMap(Long2ReferenceMap<? extends V> m)
m - a type-specific map to be copied into the new tree map.public Long2ReferenceAVLTreeMap(Long2ReferenceSortedMap<V> m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.
public Long2ReferenceAVLTreeMap(long[] k,
V[] v,
java.util.Comparator<? super java.lang.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.
java.lang.IllegalArgumentException - if k and v have different lengths.
public Long2ReferenceAVLTreeMap(long[] k,
V[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.
java.lang.IllegalArgumentException - if k and v have different lengths.| Method Detail |
|---|
public V put(long k,
V v)
Long2ReferenceFunction
put in interface Long2ReferenceFunction<V>put in class AbstractLong2ReferenceFunction<V>k - the key.v - the value.
Function.put(Object,Object)public V remove(long k)
Long2ReferenceFunction
remove in interface Long2ReferenceFunction<V>remove in class AbstractLong2ReferenceFunction<V>Function.remove(Object)
public V put(java.lang.Long ok,
V ov)
AbstractLong2ReferenceFunctionnull 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<java.lang.Long,V>put in interface java.util.Map<java.lang.Long,V>put in class AbstractLong2ReferenceFunction<V>ok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public V remove(java.lang.Object ok)
AbstractLong2ReferenceFunctionnull 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<java.lang.Long,V>remove in interface java.util.Map<java.lang.Long,V>remove in class AbstractLong2ReferenceFunction<V>null if no value was present for the given key.Map.remove(Object)public boolean containsValue(java.lang.Object v)
AbstractLong2ReferenceMapAbstractLong2ReferenceMap.values().
containsValue in interface java.util.Map<java.lang.Long,V>containsValue in class AbstractLong2ReferenceMap<V>public void clear()
Function
clear in interface Function<java.lang.Long,V>clear in interface java.util.Map<java.lang.Long,V>clear in class AbstractLong2ReferenceFunction<V>Map.clear()public boolean containsKey(long k)
AbstractLong2ReferenceMapAbstractLong2ReferenceMap.keySet().
containsKey in interface Long2ReferenceFunction<V>containsKey in class AbstractLong2ReferenceMap<V>Function.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<java.lang.Long,V>size in interface java.util.Map<java.lang.Long,V>public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Long,V>isEmpty in class AbstractLong2ReferenceMap<V>public V get(long k)
Long2ReferenceFunction
get in interface Long2ReferenceFunction<V>k - the key.
Function.get(Object)public long firstLongKey()
firstLongKey in interface Long2ReferenceSortedMap<V>SortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2ReferenceSortedMap<V>SortedMap.lastKey()public ObjectSortedSet<Long2ReferenceMap.Entry<V>> long2ReferenceEntrySet()
Long2ReferenceSortedMap
long2ReferenceEntrySet in interface Long2ReferenceMap<V>long2ReferenceEntrySet in interface Long2ReferenceSortedMap<V>Long2ReferenceSortedMap.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 Long2ReferenceMap<V>keySet in interface Long2ReferenceSortedMap<V>keySet in interface java.util.Map<java.lang.Long,V>keySet in interface java.util.SortedMap<java.lang.Long,V>keySet in class AbstractLong2ReferenceSortedMap<V>Map.keySet()public ReferenceCollection<V> 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 Long2ReferenceMap<V>values in interface Long2ReferenceSortedMap<V>values in interface java.util.Map<java.lang.Long,V>values in interface java.util.SortedMap<java.lang.Long,V>values in class AbstractLong2ReferenceSortedMap<V>Map.values()public LongComparator comparator()
Long2ReferenceSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Long2ReferenceSortedMap<V>comparator in interface java.util.SortedMap<java.lang.Long,V>SortedMap.comparator()public Long2ReferenceSortedMap<V> headMap(long to)
Long2ReferenceSortedMaptoKey.
headMap in interface Long2ReferenceSortedMap<V>SortedMap.headMap(Object)public Long2ReferenceSortedMap<V> tailMap(long from)
Long2ReferenceSortedMapfromKey.
tailMap in interface Long2ReferenceSortedMap<V>SortedMap.tailMap(Object)
public Long2ReferenceSortedMap<V> subMap(long from,
long to)
Long2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
subMap in interface Long2ReferenceSortedMap<V>SortedMap.subMap(Object,Object)public Long2ReferenceAVLTreeMap<V> 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 java.lang.Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||