|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.longs.AbstractLong2ShortMap
it.unimi.dsi.fastutil.longs.AbstractLong2ShortSortedMap
it.unimi.dsi.fastutil.longs.Long2ShortRBTreeMap
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.longs.AbstractLong2ShortMap |
AbstractLong2ShortMap.BasicEntry |
| Field Summary | |
static long |
serialVersionUID
|
| Constructor Summary | |
Long2ShortRBTreeMap()
Creates a new empty tree map. |
|
Long2ShortRBTreeMap(Comparator c)
Creates a new empty tree map with the given comparator. |
|
Long2ShortRBTreeMap(Long2ShortMap m)
Creates a new tree map copying a given map. |
|
Long2ShortRBTreeMap(Long2ShortSortedMap m)
Creates a new tree map copying a given sorted map (and its Comparator). |
|
Long2ShortRBTreeMap(Map m)
Creates a new tree map copying a given map. |
|
Long2ShortRBTreeMap(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(long 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. |
long |
firstLongKey()
|
short |
get(long 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.
|
Long2ShortSortedMap |
headMap(long 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. |
long |
lastLongKey()
|
short |
put(long 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(long 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()
|
Long2ShortSortedMap |
subMap(long from,
long to)
|
Long2ShortSortedMap |
tailMap(long from)
|
Collection |
values()
Returns a type-specific collection view of the values contained in this map. |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ShortSortedMap |
headMap, subMap, tailMap |
| Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ShortMap |
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.longs.Long2ShortMap |
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 Long2ShortRBTreeMap()
public Long2ShortRBTreeMap(Comparator c)
c - a Comparator.public Long2ShortRBTreeMap(Map m)
m - a Map to be copied into the new tree map.public Long2ShortRBTreeMap(SortedMap m)
Comparator).
m - a SortedMap to be copied into the new tree map.public Long2ShortRBTreeMap(Long2ShortMap m)
m - a type-specific map to be copied into the new tree map.public Long2ShortRBTreeMap(Long2ShortSortedMap m)
Comparator).
m - a type-specific sorted map to be copied into the new tree map.| Method Detail |
public final short put(long k,
short v)
Long2ShortMap
put in interface Long2ShortMapput in class AbstractLong2ShortMappublic final short remove(long k)
Long2ShortMap
remove in interface Long2ShortMapremove in class AbstractLong2ShortMap
public Object put(Object ok,
Object ov)
AbstractLong2ShortMapnull 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 Mapput in class AbstractLong2ShortMappublic Object remove(Object ok)
AbstractLong2ShortMapnull 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 Mapremove in class AbstractLong2ShortMappublic boolean containsValue(short v)
AbstractLong2ShortMapAbstractLong2ShortMap.values().
containsValue in interface Long2ShortMapcontainsValue in class AbstractLong2ShortMappublic void clear()
clear in interface Mapclear in class AbstractLong2ShortMappublic boolean containsKey(long k)
AbstractLong2ShortMapAbstractLong2ShortMap.keySet().
containsKey in interface Long2ShortMapcontainsKey in class AbstractLong2ShortMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractLong2ShortMappublic short get(long k)
Long2ShortMap
get in interface Long2ShortMapk - the key.
Map.get(Object)public Object get(Object ok)
AbstractLong2ShortMapnull 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 Mapget in class AbstractLong2ShortMappublic long firstLongKey()
firstLongKey in interface Long2ShortSortedMapSortedMap.firstKey()public long lastLongKey()
lastLongKey in interface Long2ShortSortedMapSortedMap.lastKey()public Object firstKey()
AbstractLong2ShortSortedMap
firstKey in interface SortedMapfirstKey in class AbstractLong2ShortSortedMappublic Object lastKey()
AbstractLong2ShortSortedMap
lastKey in interface SortedMaplastKey in class AbstractLong2ShortSortedMappublic Set entrySet()
entrySet in interface Mappublic 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 MapkeySet in class AbstractLong2ShortSortedMappublic 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 Mapvalues in class AbstractLong2ShortMappublic Comparator comparator()
comparator in interface SortedMappublic Long2ShortSortedMap headMap(long to)
headMap in interface Long2ShortSortedMapSortedMap.headMap(Object)public Long2ShortSortedMap tailMap(long from)
tailMap in interface Long2ShortSortedMapSortedMap.tailMap(Object)
public Long2ShortSortedMap subMap(long from,
long to)
subMap in interface Long2ShortSortedMapSortedMap.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 | |||||||||