public static class Int2ReferenceMaps.SynchronizedMap<V> extends Int2ReferenceFunctions.SynchronizedFunction<V> implements Int2ReferenceMap<V>, Serializable
Int2ReferenceMap.Entry<V>, Int2ReferenceMap.FastEntrySet<V>
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
boolean |
containsKey(int k) |
boolean |
containsKey(Object ok)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(Object v) |
V |
defaultReturnValue()
Gets the default return value.
|
void |
defaultReturnValue(V defRetValue)
Sets the default return value.
|
ObjectSet<Map.Entry<Integer,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
boolean |
equals(Object o) |
V |
get(int k)
Returns the value to which the given key is mapped.
|
int |
hashCode() |
ObjectSet<Int2ReferenceMap.Entry<V>> |
int2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a set view of the keys contained in this map.
|
V |
put(Integer k,
V v)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
V |
put(int k,
V v)
Adds a pair to the map.
|
void |
putAll(Map<? extends Integer,? extends V> m) |
V |
remove(int k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
String |
toString() |
ReferenceCollection<V> |
values()
Returns a set view of the values contained in this map.
|
get, remove
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean containsKey(int k)
containsKey
in interface Int2ReferenceFunction<V>
containsKey
in class Int2ReferenceFunctions.SynchronizedFunction<V>
Function.containsKey(Object)
public boolean containsValue(Object v)
containsValue
in interface Map<Integer,V>
public V defaultReturnValue()
Int2ReferenceFunction
defaultReturnValue
in interface Int2ReferenceFunction<V>
defaultReturnValue
in class Int2ReferenceFunctions.SynchronizedFunction<V>
public void defaultReturnValue(V defRetValue)
Int2ReferenceFunction
get()
, 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 Int2ReferenceFunction<V>
defaultReturnValue
in class Int2ReferenceFunctions.SynchronizedFunction<V>
defRetValue
- the new default return value.Int2ReferenceFunction.defaultReturnValue()
public V put(int k, V v)
Int2ReferenceFunction
put
in interface Int2ReferenceFunction<V>
put
in class Int2ReferenceFunctions.SynchronizedFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public ObjectSet<Int2ReferenceMap.Entry<V>> int2ReferenceEntrySet()
Int2ReferenceMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2ReferenceMap.entrySet()
so that it returns an ObjectSet
of objects of type Map.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
int2ReferenceEntrySet
in interface Int2ReferenceMap<V>
Int2ReferenceMap.entrySet()
public IntSet keySet()
Int2ReferenceMap
Note that this specification strengthens the one given in Map.keySet()
.
keySet
in interface Int2ReferenceMap<V>
keySet
in interface Map<Integer,V>
Map.keySet()
public ReferenceCollection<V> values()
Int2ReferenceMap
Note that this specification strengthens the one given in Map.values()
.
values
in interface Int2ReferenceMap<V>
values
in interface Map<Integer,V>
Map.values()
public void clear()
Function
public String toString()
toString
in class Int2ReferenceFunctions.SynchronizedFunction<V>
public V put(Integer k, V v)
AbstractInt2ReferenceFunction
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 Function<Integer,V>
put
in interface Map<Integer,V>
put
in class Int2ReferenceFunctions.SynchronizedFunction<V>
k
- the key.v
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public V remove(int k)
Int2ReferenceFunction
remove
in interface Int2ReferenceFunction<V>
remove
in class Int2ReferenceFunctions.SynchronizedFunction<V>
k
- the key.Function.remove(Object)
public V get(int k)
Int2ReferenceFunction
get
in interface Int2ReferenceFunction<V>
get
in class Int2ReferenceFunctions.SynchronizedFunction<V>
k
- the key.Function.get(Object)
public boolean containsKey(Object ok)
Function
Note that for some kind of functions (e.g., hashes) this method will always return true.
containsKey
in interface Function<Integer,V>
containsKey
in interface Map<Integer,V>
containsKey
in class Int2ReferenceFunctions.SynchronizedFunction<V>
ok
- the key.key
.Map.containsKey(Object)
public ObjectSet<Map.Entry<Integer,V>> entrySet()
Int2ReferenceMap
Note that this specification strengthens the one given in Map.entrySet()
.
entrySet
in interface Int2ReferenceMap<V>
entrySet
in interface Map<Integer,V>
Map.entrySet()
public int hashCode()