|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShort2IntMap
it.unimi.dsi.fastutil.shorts.AbstractShort2IntSortedMap
it.unimi.dsi.fastutil.shorts.Short2IntAVLTreeMap
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 inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap |
AbstractShort2IntMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Short2IntAVLTreeMap()
Creates a new empty tree map. |
|
Short2IntAVLTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Short2IntAVLTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Short2IntAVLTreeMap(short[] k,
int[] v)
Creates a new tree map using the elements of two parallel arrays. |
|
Short2IntAVLTreeMap(short[] k,
int[] v,
Comparator c)
Creates a new tree map using the elements of two parallel arrays and the given comparator. |
|
Short2IntAVLTreeMap(Short2IntMap m)
Creates a new tree map copying a given map. |
|
Short2IntAVLTreeMap(Short2IntSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Short2IntAVLTreeMap(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(short 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. |
short |
firstShortKey()
|
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
get(short k)
Returns the value to which the given key is mapped. |
Short2IntSortedMap |
headMap(short 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. |
short |
lastShortKey()
|
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
put(short k,
int v)
Adds a pair to the map. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
remove(short k)
Removes the mapping with the given key. |
int |
size()
|
Short2IntSortedMap |
subMap(short from,
short to)
|
Short2IntSortedMap |
tailMap(short from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntSortedMap |
headMap, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2IntMap |
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.shorts.Short2IntMap |
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 Short2IntAVLTreeMap()
public Short2IntAVLTreeMap(Comparator c)
c
- a (possibly type-specific) comparator.public Short2IntAVLTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Short2IntAVLTreeMap(SortedMap m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Short2IntAVLTreeMap(Short2IntMap m)
m
- a type-specific map to be copied into the new tree map.public Short2IntAVLTreeMap(Short2IntSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.public Short2IntAVLTreeMap(short[] 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 Short2IntAVLTreeMap(short[] 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(short k, int v)
Short2IntMap
put
in interface Short2IntMap
put
in class AbstractShort2IntMap
public int remove(short k)
Short2IntMap
remove
in interface Short2IntMap
remove
in class AbstractShort2IntMap
public Object put(Object ok, Object ov)
AbstractShort2IntMap
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 AbstractShort2IntMap
public Object remove(Object ok)
AbstractShort2IntMap
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 AbstractShort2IntMap
public boolean containsValue(int v)
AbstractShort2IntMap
AbstractShort2IntMap.values()
.
containsValue
in interface Short2IntMap
containsValue
in class AbstractShort2IntMap
public void clear()
clear
in interface Map
clear
in class AbstractShort2IntMap
public boolean containsKey(short k)
AbstractShort2IntMap
AbstractShort2IntMap.keySet()
.
containsKey
in interface Short2IntMap
containsKey
in class AbstractShort2IntMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractShort2IntMap
public int get(short k)
Short2IntMap
get
in interface Short2IntMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractShort2IntMap
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 AbstractShort2IntMap
public short firstShortKey()
firstShortKey
in interface Short2IntSortedMap
SortedMap.firstKey()
public short lastShortKey()
lastShortKey
in interface Short2IntSortedMap
SortedMap.lastKey()
public Object firstKey()
AbstractShort2IntSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractShort2IntSortedMap
public Object lastKey()
AbstractShort2IntSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractShort2IntSortedMap
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 AbstractShort2IntSortedMap
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 AbstractShort2IntMap
public Comparator comparator()
comparator
in interface SortedMap
public Short2IntSortedMap headMap(short to)
headMap
in interface Short2IntSortedMap
SortedMap.headMap(Object)
public Short2IntSortedMap tailMap(short from)
tailMap
in interface Short2IntSortedMap
SortedMap.tailMap(Object)
public Short2IntSortedMap subMap(short from, short to)
subMap
in interface Short2IntSortedMap
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 |