public static class Byte2ReferenceMaps.SynchronizedMap<V> extends Byte2ReferenceFunctions.SynchronizedFunction<V> implements Byte2ReferenceMap<V>, Serializable
Byte2ReferenceMap.Entry<V>, Byte2ReferenceMap.FastEntrySet<V>| Modifier and Type | Method and Description |
|---|---|
ObjectSet<Byte2ReferenceMap.Entry<V>> |
byte2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
boolean |
containsKey(byte 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<Byte,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
boolean |
equals(Object o) |
V |
get(byte k)
Returns the value to which the given key is mapped.
|
int |
hashCode() |
boolean |
isEmpty() |
ByteSet |
keySet()
Returns a set view of the keys contained in this map.
|
V |
put(byte k,
V v)
Adds a pair to the map.
|
V |
put(Byte k,
V v)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
void |
putAll(Map<? extends Byte,? extends V> m) |
V |
remove(byte 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, removecompute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, putIfAbsent, remove, remove, replace, replace, replaceAllpublic int size()
FunctionMost 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(byte k)
containsKey in interface Byte2ReferenceFunction<V>containsKey in class Byte2ReferenceFunctions.SynchronizedFunction<V>Function.containsKey(Object)public boolean containsValue(Object v)
containsValue in interface Map<Byte,V>public V defaultReturnValue()
Byte2ReferenceFunctiondefaultReturnValue in interface Byte2ReferenceFunction<V>defaultReturnValue in class Byte2ReferenceFunctions.SynchronizedFunction<V>public void defaultReturnValue(V defRetValue)
Byte2ReferenceFunctionget(), 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 Byte2ReferenceFunction<V>defaultReturnValue in class Byte2ReferenceFunctions.SynchronizedFunction<V>defRetValue - the new default return value.Byte2ReferenceFunction.defaultReturnValue()public V put(byte k, V v)
Byte2ReferenceFunctionput in interface Byte2ReferenceFunction<V>put in class Byte2ReferenceFunctions.SynchronizedFunction<V>k - the key.v - the value.Function.put(Object,Object)public ObjectSet<Byte2ReferenceMap.Entry<V>> byte2ReferenceEntrySet()
Byte2ReferenceMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Byte2ReferenceMap.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).
byte2ReferenceEntrySet in interface Byte2ReferenceMap<V>Byte2ReferenceMap.entrySet()public ByteSet keySet()
Byte2ReferenceMapNote that this specification strengthens the one given in Map.keySet().
keySet in interface Byte2ReferenceMap<V>keySet in interface Map<Byte,V>Map.keySet()public ReferenceCollection<V> values()
Byte2ReferenceMapNote that this specification strengthens the one given in Map.values().
values in interface Byte2ReferenceMap<V>values in interface Map<Byte,V>Map.values()public void clear()
Functionpublic String toString()
toString in class Byte2ReferenceFunctions.SynchronizedFunction<V>public V put(Byte k, V v)
AbstractByte2ReferenceFunctionnull 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<Byte,V>put in interface Map<Byte,V>put in class Byte2ReferenceFunctions.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(byte k)
Byte2ReferenceFunctionremove in interface Byte2ReferenceFunction<V>remove in class Byte2ReferenceFunctions.SynchronizedFunction<V>k - the key.Function.remove(Object)public V get(byte k)
Byte2ReferenceFunctionget in interface Byte2ReferenceFunction<V>get in class Byte2ReferenceFunctions.SynchronizedFunction<V>k - the key.Function.get(Object)public boolean containsKey(Object ok)
FunctionNote that for some kind of functions (e.g., hashes) this method will always return true.
containsKey in interface Function<Byte,V>containsKey in interface Map<Byte,V>containsKey in class Byte2ReferenceFunctions.SynchronizedFunction<V>ok - the key.key.Map.containsKey(Object)public ObjectSet<Map.Entry<Byte,V>> entrySet()
Byte2ReferenceMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Byte2ReferenceMap<V>entrySet in interface Map<Byte,V>Map.entrySet()public int hashCode()