|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap
it.unimi.dsi.fastutil.ints.Int2DoubleMaps.EmptyMap
An immutable class representing an empty type-specific map.
This class may be useful to implement your own in case you subclass a type-specific map.
| Nested Class Summary |
| Nested classes inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap |
AbstractInt2DoubleMap.BasicEntry |
| Nested classes inherited from class it.unimi.dsi.fastutil.ints.Int2DoubleMap |
Int2DoubleMap.Entry |
| Field Summary | |
static long |
serialVersionUID
|
| Method Summary | |
void |
clear()
|
Object |
clone()
|
boolean |
containsKey(int k)
Checks whether the given value is contained in keySet(). |
boolean |
containsKey(Object ok)
|
boolean |
containsValue(double v)
Checks whether the given value is contained in values(). |
boolean |
containsValue(Object ov)
|
double |
defaultReturnValue()
Gets the default return value. |
void |
defaultReturnValue(double defRetValue)
Sets the default return value. |
Set |
entrySet()
|
double |
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.
|
Set |
keySet()
Returns a type-specific-set view of the keys of this map. |
double |
put(int k,
double v)
Adds a pair to the map. |
Object |
put(Object k,
Object v)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
void |
putAll(Map m)
Puts all pairs in the given map. |
int |
size()
|
Collection |
values()
Returns a type-specific-set view of the values of this map. |
| Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2DoubleMap |
equals, getDefRetValue, hashCode, isEmpty, remove, remove, setDefRetValue, toString |
| Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
| Field Detail |
public static final long serialVersionUID
| Method Detail |
public double put(int k,
double v)
Int2DoubleMap
put in interface Int2DoubleMapput in class AbstractInt2DoubleMappublic Object get(Object ok)
AbstractInt2DoubleMapnull 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 AbstractInt2DoubleMappublic boolean containsKey(int k)
AbstractInt2DoubleMapAbstractInt2DoubleMap.keySet().
containsKey in interface Int2DoubleMapcontainsKey in class AbstractInt2DoubleMappublic boolean containsValue(double v)
AbstractInt2DoubleMapAbstractInt2DoubleMap.values().
containsValue in interface Int2DoubleMapcontainsValue in class AbstractInt2DoubleMappublic double defaultReturnValue()
Int2DoubleMap
defaultReturnValue in interface Int2DoubleMapdefaultReturnValue in class AbstractInt2DoubleMappublic void defaultReturnValue(double defRetValue)
Int2DoubleMapget(), put() and remove() to
denote that the map does not contain the specified key. It must be
0/false/null by default.
defaultReturnValue in interface Int2DoubleMapdefaultReturnValue in class AbstractInt2DoubleMappublic void putAll(Map m)
AbstractInt2DoubleMap
putAll in interface MapputAll in class AbstractInt2DoubleMapm - a map.public Set entrySet()
entrySet in interface Mappublic Set keySet()
AbstractInt2DoubleMapThe view is backed by the set returned by Map.entrySet(). Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
keySet in interface MapkeySet in class AbstractInt2DoubleMappublic Collection values()
AbstractInt2DoubleMapThe view is backed by the set returned by Map.entrySet(). Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
values in interface Mapvalues in class AbstractInt2DoubleMap
public Object put(Object k,
Object v)
AbstractInt2DoubleMapnull 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 AbstractInt2DoubleMappublic double get(int k)
Int2DoubleMap
get in interface Int2DoubleMapk - the key.
Map.get(Object)public boolean containsKey(Object ok)
containsKey in interface MapcontainsKey in class AbstractInt2DoubleMappublic boolean containsValue(Object ov)
containsValue in interface MapcontainsValue in class AbstractInt2DoubleMappublic int size()
size in interface Mappublic void clear()
clear in interface Mapclear in class AbstractInt2DoubleMappublic Object clone()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||