interface Map<K, V> { clear(): void; compute(key: K, remappingFn: BiFunction<K, V, V>): V; computeIfAbsent(key: K, mappingFn: Function<K, V>): V; computeIfPresent(key: K, remappingFn: BiFunction<K, V, V>): V; containsKey(key: any): boolean; containsValue(key: any): boolean; entrySet(): Set<Java.Map.Entry<K, V>>; forEach(action: BiConsumer<K, V>): void; get(key: any): V; getOrDefault(key: any, defaultValue: V): V; hashCode(): number; isEmpty(): boolean; keySet(): Set<K>; merge(key: K, value: V, remappingFn: BiFunction<V, V, V>): V; put(key: K, value: V): V; putAll(m: Java.Map<K, V>): void; putIfAbstent(key: K, value: V): V; remove(key: any): V; remove(key: any, value: any): boolean; replace(key: K, value: V): V; replace(key: K, oldValue: V, newValue: V): boolean; replaceAll(fnc: BiFunction<K, V, V>): void; size(): number; values(): Collection<V>;} Methods
clear
Returns void
compute
Returns V
computeIfAbsent
Returns V
computeIfPresent
Returns V
containsKey
containsKey(key: any): boolean Returns boolean
containsValue
containsValue(key: any): boolean Returns boolean
entrySet
entrySet(): Set<Java.Map.Entry<K, V>>
forEach
Returns void
get
Returns V
getOrDefault
getOrDefault(key: any, defaultValue: V): V Returns V
hashCode
Returns number
isEmpty
Returns boolean
keySet
Returns Set<K>
merge
Returns V
put
Returns V
putAll
Returns void
putIfAbstent
putIfAbstent(key: K, value: V): V Returns V
remove
Returns V
remove(key: any, value: any): boolean Returns boolean
replace
replace(key: K, value: V): V Returns V
replace(key: K, oldValue: V, newValue: V): boolean Parameters
- key: K
- oldValue: V
- newValue: V
Returns boolean
replaceAll
Returns void
size
Returns number
values
An object that maps keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
See java.util.Map for full documentation