public static class Int2IntMaps.SynchronizedMap extends Int2IntFunctions.SynchronizedFunction implements Int2IntMap, Serializable
Int2IntMap.Entry, Int2IntMap.FastEntrySet
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(int v) |
boolean |
containsValue(Object ov) |
int |
defaultReturnValue()
Gets the default return value.
|
void |
defaultReturnValue(int defRetValue)
Sets the default return value.
|
ObjectSet<Map.Entry<Integer,Integer>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
boolean |
equals(Object o) |
int |
get(int k)
Returns the value to which the given key is mapped.
|
int |
hashCode() |
ObjectSet<Int2IntMap.Entry> |
int2IntEntrySet()
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.
|
Integer |
put(Integer k,
Integer v)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
put(int k,
int v)
Adds a pair to the map.
|
void |
putAll(Map<? extends Integer,? extends Integer> m) |
int |
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() |
IntCollection |
values()
Returns a set view of the values contained in this map.
|
get, remove
compute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, putIfAbsent, remove, remove, replace, replace, replaceAll
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 Int2IntFunction
containsKey
in class Int2IntFunctions.SynchronizedFunction
Function.containsKey(Object)
public boolean containsValue(int v)
containsValue
in interface Int2IntMap
Map.containsValue(Object)
public int defaultReturnValue()
Int2IntFunction
defaultReturnValue
in interface Int2IntFunction
defaultReturnValue
in class Int2IntFunctions.SynchronizedFunction
public void defaultReturnValue(int defRetValue)
Int2IntFunction
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 Int2IntFunction
defaultReturnValue
in class Int2IntFunctions.SynchronizedFunction
defRetValue
- the new default return value.Int2IntFunction.defaultReturnValue()
public int put(int k, int v)
Int2IntFunction
put
in interface Int2IntFunction
put
in class Int2IntFunctions.SynchronizedFunction
k
- the key.v
- the value.Function.put(Object,Object)
public ObjectSet<Int2IntMap.Entry> int2IntEntrySet()
Int2IntMap
This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Int2IntMap.entrySet()
so that it returns an
ObjectSet
of type-specific entries (the latter makes it possible to access keys and values with type-specific methods).
int2IntEntrySet
in interface Int2IntMap
Int2IntMap.entrySet()
public IntSet keySet()
Int2IntMap
Note that this specification strengthens the one given in Map.keySet()
.
keySet
in interface Int2IntMap
keySet
in interface Map<Integer,Integer>
Map.keySet()
public IntCollection values()
Int2IntMap
Note that this specification strengthens the one given in Map.values()
.
values
in interface Int2IntMap
values
in interface Map<Integer,Integer>
Map.values()
public void clear()
Function
public String toString()
toString
in class Int2IntFunctions.SynchronizedFunction
public Integer put(Integer k, Integer v)
AbstractInt2IntFunction
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,Integer>
put
in interface Map<Integer,Integer>
put
in class Int2IntFunctions.SynchronizedFunction
k
- the key.v
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public int remove(int k)
Int2IntFunction
remove
in interface Int2IntFunction
remove
in class Int2IntFunctions.SynchronizedFunction
k
- the key.Function.remove(Object)
public int get(int k)
Int2IntFunction
get
in interface Int2IntFunction
get
in class Int2IntFunctions.SynchronizedFunction
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,Integer>
containsKey
in interface Map<Integer,Integer>
containsKey
in class Int2IntFunctions.SynchronizedFunction
ok
- the key.key
.Map.containsKey(Object)
public boolean containsValue(Object ov)
containsValue
in interface Map<Integer,Integer>
public ObjectSet<Map.Entry<Integer,Integer>> entrySet()
Int2IntMap
Note that this specification strengthens the one given in Map.entrySet()
.
entrySet
in interface Int2IntMap
entrySet
in interface Map<Integer,Integer>
Map.entrySet()
public int hashCode()