From interface
java.util.Map
void
|
clear()
|
V
|
compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
|
V
|
computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1)
|
V
|
computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1)
|
boolean
|
containsKey(Object arg0)
|
boolean
|
containsValue(Object arg0)
|
Set<Entry<K, V>>
|
entrySet()
|
boolean
|
equals(Object arg0)
|
void
|
forEach(BiConsumer<? super K, ? super V> arg0)
|
V
|
get(Object arg0)
|
V
|
getOrDefault(Object arg0, V arg1)
|
int
|
hashCode()
|
boolean
|
isEmpty()
|
Set<K>
|
keySet()
|
V
|
merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2)
|
V
|
put(K arg0, V arg1)
|
void
|
putAll(Map<? extends K, ? extends V> arg0)
|
V
|
putIfAbsent(K arg0, V arg1)
|
boolean
|
remove(Object arg0, Object arg1)
|
V
|
remove(Object arg0)
|
boolean
|
replace(K arg0, V arg1, V arg2)
|
V
|
replace(K arg0, V arg1)
|
void
|
replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
|
int
|
size()
|
Collection<V>
|
values()
|
|