public static class Reference2ReferenceMaps.SynchronizedMap<K,V> extends Reference2ReferenceFunctions.SynchronizedFunction<K,V> implements Reference2ReferenceMap<K,V>, Serializable
Reference2ReferenceMap.Entry<K,V>, Reference2ReferenceMap.FastEntrySet<K,V>| Modifier and Type | Method and Description |
|---|---|
V |
compute(K key,
BiFunction<? super K,? super V,? extends V> remappingFunction)
Attempts to compute a mapping for the specified key and its current
mapped value (or
null if there is no current mapping). |
V |
computeIfPresent(K key,
BiFunction<? super K,? super V,? extends V> remappingFunction)
If the value for the specified key is present and non-null, attempts to
compute a new mapping given the key and its current mapped value.
|
boolean |
containsValue(Object v)
Returns true if this map maps one or more keys to the
specified value.
|
ObjectSet<Map.Entry<K,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
void |
forEach(BiConsumer<? super K,? super V> action)
Performs the given action for each entry in this map until all entries
have been processed or the action throws an exception.
|
V |
getOrDefault(Object key,
V defaultValue)
Returns the value to which the specified key is mapped, or
defaultValue if this map contains no mapping for the key. |
int |
hashCode()
Returns a hash code value for the object.
|
boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
ReferenceSet<K> |
keySet()
Returns a
Set view of the keys contained in this map. |
V |
merge(K key,
V value,
BiFunction<? super V,? super V,? extends V> remappingFunction)
If the specified key is not already associated with a value or is
associated with null, associates it with the given non-null value.
|
void |
putAll(Map<? extends K,? extends V> m)
Copies all of the mappings from the specified map to this map
(optional operation).
|
V |
putIfAbsent(K key,
V value)
If the specified key is not already associated with a value (or is mapped
to
null) associates it with the given value and returns
null, else returns the current value. |
ObjectSet<Reference2ReferenceMap.Entry<K,V>> |
reference2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
remove(Object key,
Object value)
Removes the entry for the specified key only if it is currently
mapped to the specified value.
|
V |
replace(K key,
V value)
Replaces the entry for the specified key only if it is
currently mapped to some value.
|
boolean |
replace(K key,
V oldValue,
V newValue)
Replaces the entry for the specified key only if currently
mapped to the specified value.
|
void |
replaceAll(BiFunction<? super K,? super V,? extends V> function)
Replaces each entry's value with the result of invoking the given
function on that entry until all entries have been processed or the
function throws an exception.
|
ReferenceCollection<V> |
values()
Returns a
Collection view of the values contained in this map. |
apply, clear, containsKey, defaultReturnValue, defaultReturnValue, get, put, remove, size, toStringclear, containsKey, defaultReturnValue, defaultReturnValue, put, remove, sizegetcomputeIfAbsent, getpublic boolean containsValue(Object v)
java.util.MapcontainsValue in interface Map<K,V>v - value whose presence in this map is to be testedpublic void putAll(Map<? extends K,? extends V> m)
java.util.Mapput(k, v) on this map once
for each mapping from key k to value v in the
specified map. The behavior of this operation is undefined if the
specified map is modified while the operation is in progress.public ObjectSet<Reference2ReferenceMap.Entry<K,V>> reference2ReferenceEntrySet()
Reference2ReferenceMap
This method is necessary because there is no inheritance along type
parameters: it is thus impossible to strengthen Map.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).
reference2ReferenceEntrySet in interface Reference2ReferenceMap<K,V>Map.entrySet()public ObjectSet<Map.Entry<K,V>> entrySet()
Note that this specification strengthens the one given in
Map.entrySet().
entrySet in interface Reference2ReferenceMap<K,V>entrySet in interface Map<K,V>Map.entrySet()public ReferenceSet<K> keySet()
Reference2ReferenceMapSet view of the keys contained in this map.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. If the map is modified
while an iteration over the set is in progress (except through
the iterator's own remove operation), the results of
the iteration are undefined. The set supports element removal,
which removes the corresponding mapping from the map, via the
Iterator.remove, Set.remove,
removeAll, retainAll, and clear
operations. It does not support the add or addAll
operations.
Note that this specification strengthens the one given in
Map.keySet().
keySet in interface Reference2ReferenceMap<K,V>keySet in interface Map<K,V>Map.keySet()public ReferenceCollection<V> values()
Reference2ReferenceMapCollection view of the values contained in this map.
The collection is backed by the map, so changes to the map are
reflected in the collection, and vice-versa. If the map is
modified while an iteration over the collection is in progress
(except through the iterator's own remove operation),
the results of the iteration are undefined. The collection
supports element removal, which removes the corresponding
mapping from the map, via the Iterator.remove,
Collection.remove, removeAll,
retainAll and clear operations. It does not
support the add or addAll operations.
Note that this specification strengthens the one given in
Map.values().
values in interface Reference2ReferenceMap<K,V>values in interface Map<K,V>Map.values()public boolean isEmpty()
java.util.Mappublic int hashCode()
java.lang.ObjectHashMap.
The general contract of hashCode is:
hashCode method
must consistently return the same integer, provided no information
used in equals comparisons on the object is modified.
This integer need not remain consistent from one execution of an
application to another execution of the same application.
equals(Object)
method, then calling the hashCode method on each of
the two objects must produce the same integer result.
Object.equals(java.lang.Object)
method, then calling the hashCode method on each of the
two objects must produce distinct integer results. However, the
programmer should be aware that producing distinct integer results
for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by
class Object does return distinct integers for distinct
objects. (This is typically implemented by converting the internal
address of the object into an integer, but this implementation
technique is not required by the
Java™ programming language.)
hashCode in interface Map<K,V>hashCode in class Reference2ReferenceFunctions.SynchronizedFunction<K,V>Object.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)public boolean equals(Object o)
java.lang.Object
The equals method implements an equivalence relation
on non-null object references:
x, x.equals(x) should return
true.
x and y, x.equals(y)
should return true if and only if
y.equals(x) returns true.
x, y, and z, if
x.equals(y) returns true and
y.equals(z) returns true, then
x.equals(z) should return true.
x and y, multiple invocations of
x.equals(y) consistently return true
or consistently return false, provided no
information used in equals comparisons on the
objects is modified.
x,
x.equals(null) should return false.
The equals method for class Object implements
the most discriminating possible equivalence relation on objects;
that is, for any non-null reference values x and
y, this method returns true if and only
if x and y refer to the same object
(x == y has the value true).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden, so as to maintain the
general contract for the hashCode method, which states
that equal objects must have equal hash codes.
equals in interface Map<K,V>equals in class Reference2ReferenceFunctions.SynchronizedFunction<K,V>o - the reference object with which to compare.true if this object is the same as the obj
argument; false otherwise.Object.hashCode(),
HashMappublic V getOrDefault(Object key, V defaultValue)
java.util.MapdefaultValue if this map contains no mapping for the key.getOrDefault in interface Map<K,V>key - the key whose associated value is to be returneddefaultValue - the default mapping of the keydefaultValue if this map contains no mapping for the keypublic void forEach(BiConsumer<? super K,? super V> action)
java.util.Mappublic void replaceAll(BiFunction<? super K,? super V,? extends V> function)
java.util.MapreplaceAll in interface Map<K,V>function - the function to apply to each entrypublic V putIfAbsent(K key, V value)
java.util.Mapnull) associates it with the given value and returns
null, else returns the current value.putIfAbsent in interface Map<K,V>key - key with which the specified value is to be associatedvalue - value to be associated with the specified keynull if there was no mapping for the key.
(A null return can also indicate that the map
previously associated null with the key,
if the implementation supports null values.)public boolean remove(Object key, Object value)
java.util.Mappublic V replace(K key, V value)
java.util.Mapreplace in interface Map<K,V>key - key with which the specified value is associatedvalue - value to be associated with the specified keynull if there was no mapping for the key.
(A null return can also indicate that the map
previously associated null with the key,
if the implementation supports null values.)public boolean replace(K key, V oldValue, V newValue)
java.util.Mappublic V computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
java.util.MapIf the function returns null, the mapping is removed. If the
function itself throws an (unchecked) exception, the exception is
rethrown, and the current mapping is left unchanged.
computeIfPresent in interface Map<K,V>key - key with which the specified value is to be associatedremappingFunction - the function to compute a valuepublic V compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
java.util.Mapnull if there is no current mapping). For
example, to either create or append a String msg to a value
mapping:
map.compute(key, (k, v) -> (v == null) ? msg : v.concat(msg))
(Method merge() is often simpler to use for such purposes.)
If the function returns null, the mapping is removed (or
remains absent if initially absent). If the function itself throws an
(unchecked) exception, the exception is rethrown, and the current mapping
is left unchanged.
public V merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)
java.util.Mapnull. This
method may be of use when combining multiple mapped values for a key.
For example, to either create or append a String msg to a
value mapping:
map.merge(key, msg, String::concat)
If the function returns null the mapping is removed. If the
function itself throws an (unchecked) exception, the exception is
rethrown, and the current mapping is left unchanged.
merge in interface Map<K,V>key - key with which the resulting value is to be associatedvalue - the non-null value to be merged with the existing value
associated with the key or, if no existing value or a null value
is associated with the key, to be associated with the keyremappingFunction - the function to recompute a value if present