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