java.util

Interface Map<K,V>

Type Parameters:

K - key type.

V - value type.

All Known Subinterfaces:

ConcurrentMap<K,V>, NavigableMap<K,V>, SortedMap<K,V>

All Known Implementing Classes:

AbstractMap, ConcurrentHashMap, EnumMap, HashMap, HashMap, IdentityHashMap, IdentityHashMap, LinkedHashMap, StorageMap, TreeMap

@JsType
public interface Map<K,V>

Abstract interface for maps.

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static interface	Map.Entry<K,V> Represents an individual map entry.

Method Summary

Modifier and Type	Method and Description
void	clear()
default V	compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
default V	computeIfAbsent(K key, Function<? super K,? extends V> remappingFunction)
default V	computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
boolean	containsKey(Object key)
boolean	containsValue(Object value)
Set<Map.Entry<K,V>>	entrySet()
default void	forEach(BiConsumer<? super K,? super V> consumer)
V	get(Object key)
default V	getOrDefault(Object key, V defaultValue)
boolean	isEmpty()
Set<K>	keySet()
default V	merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)
V	put(K key, V value)
void	putAll(Map<? extends K,? extends V> t)
default V	putIfAbsent(K key, V value)
V	remove(Object key)
default boolean	remove(Object key, Object value)
default V	replace(K key, V value)
default boolean	replace(K key, V oldValue, V newValue)
default void	replaceAll(BiFunction<? super K,? super V,? extends V> function)
int	size()
Collection<V>	values()

Method Detail

clear

void clear()

compute

@JsIgnore
default V compute(K key,
                            BiFunction<? super K,? super V,? extends V> remappingFunction)

computeIfAbsent

@JsIgnore
default V computeIfAbsent(K key,
                                    Function<? super K,? extends V> remappingFunction)

computeIfPresent

@JsIgnore
default V computeIfPresent(K key,
                                     BiFunction<? super K,? super V,? extends V> remappingFunction)

containsKey

boolean containsKey(Object key)

containsValue

boolean containsValue(Object value)

entrySet

@JsIgnore
Set<Map.Entry<K,V>> entrySet()

forEach

@JsIgnore
default void forEach(BiConsumer<? super K,? super V> consumer)

get

V get(Object key)

getOrDefault

default V getOrDefault(Object key,
                       V defaultValue)

isEmpty

boolean isEmpty()

keySet

Set<K> keySet()

merge

@JsIgnore
default V merge(K key,
                          V value,
                          BiFunction<? super V,? super V,? extends V> remappingFunction)

put

V put(K key,
      V value)

putIfAbsent

default V putIfAbsent(K key,
                      V value)

putAll

void putAll(Map<? extends K,? extends V> t)

remove

V remove(Object key)

remove

@JsIgnore
default boolean remove(Object key,
                                 Object value)

replace

default V replace(K key,
                  V value)

replace

@JsIgnore
default boolean replace(K key,
                                  V oldValue,
                                  V newValue)

replaceAll

@JsIgnore
default void replaceAll(BiFunction<? super K,? super V,? extends V> function)

size

int size()

values

Collection<V> values()