|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2ShortMap
it.unimi.dsi.fastutil.objects.AbstractObject2ShortSortedMap
it.unimi.dsi.fastutil.objects.Object2ShortRBTreeMap
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.objects.AbstractObject2ShortMap |
AbstractObject2ShortMap.BasicEntry |
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
Object2ShortRBTreeMap()
Creates a new empty tree map. |
|
Object2ShortRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Object2ShortRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Object2ShortRBTreeMap(Object2ShortMap m)
Creates a new tree map copying a given map. |
|
Object2ShortRBTreeMap(Object2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator ). |
|
Object2ShortRBTreeMap(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(Object 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()
|
Object |
firstKey()
Delegates to the corresponding type-specific method. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
short |
getShort(Object k)
Returns the value to which the given key is mapped. |
SortedMap |
headMap(Object to)
Delegates to the corresponding type-specific method. |
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. |
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
short |
put(Object k,
short 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.
|
short |
removeShort(Object k)
Removes the mapping with the given key. |
int |
size()
|
SortedMap |
subMap(Object from,
Object to)
Delegates to the corresponding type-specific method. |
SortedMap |
tailMap(Object from)
Delegates to the corresponding type-specific method. |
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ShortMap |
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.objects.Object2ShortMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
Methods inherited from interface java.util.Map |
containsValue, equals, hashCode, putAll |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public Object2ShortRBTreeMap()
public Object2ShortRBTreeMap(Comparator c)
c
- a Comparator
.public Object2ShortRBTreeMap(Map m)
m
- a Map
to be copied into the new tree map.public Object2ShortRBTreeMap(SortedMap m)
Comparator
).
m
- a SortedMap
to be copied into the new tree map.public Object2ShortRBTreeMap(Object2ShortMap m)
m
- a type-specific map to be copied into the new tree map.public Object2ShortRBTreeMap(Object2ShortSortedMap m)
Comparator
).
m
- a type-specific sorted map to be copied into the new tree map.Method Detail |
public short put(Object k, short v)
Object2ShortMap
put
in interface Object2ShortMap
put
in class AbstractObject2ShortMap
public short removeShort(Object k)
Object2ShortMap
removeShort
in interface Object2ShortMap
removeShort
in class AbstractObject2ShortMap
public Object put(Object ok, Object ov)
AbstractObject2ShortMap
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 AbstractObject2ShortMap
public Object remove(Object ok)
AbstractObject2ShortMap
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 AbstractObject2ShortMap
public boolean containsValue(short v)
AbstractObject2ShortMap
AbstractObject2ShortMap.values()
.
containsValue
in interface Object2ShortMap
containsValue
in class AbstractObject2ShortMap
public void clear()
clear
in interface Map
clear
in class AbstractObject2ShortMap
public boolean containsKey(Object k)
AbstractObject2ShortMap
AbstractObject2ShortMap.keySet()
.
containsKey
in interface Map
containsKey
in class AbstractObject2ShortMap
public int size()
size
in interface Map
public boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractObject2ShortMap
public short getShort(Object k)
Object2ShortMap
getShort
in interface Object2ShortMap
k
- the key.
Map.get(Object)
public Object get(Object ok)
AbstractObject2ShortMap
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 AbstractObject2ShortMap
public Object firstKey()
AbstractObject2ShortSortedMap
firstKey
in interface SortedMap
firstKey
in class AbstractObject2ShortSortedMap
public Object lastKey()
AbstractObject2ShortSortedMap
lastKey
in interface SortedMap
lastKey
in class AbstractObject2ShortSortedMap
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 AbstractObject2ShortSortedMap
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 AbstractObject2ShortMap
public Comparator comparator()
comparator
in interface SortedMap
public SortedMap headMap(Object to)
AbstractObject2ShortSortedMap
headMap
in interface SortedMap
headMap
in class AbstractObject2ShortSortedMap
public SortedMap tailMap(Object from)
AbstractObject2ShortSortedMap
tailMap
in interface SortedMap
tailMap
in class AbstractObject2ShortSortedMap
public SortedMap subMap(Object from, Object to)
AbstractObject2ShortSortedMap
subMap
in interface SortedMap
subMap
in class AbstractObject2ShortSortedMap
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 |