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