Properties
delete
delete
: (k
: K) => Map<K, V>
Type declaration
-
-
Parameters
Returns Map<K, V>
entries
entries: () => Iterator<[K, V], undefined, undefined>
Type declaration
-
- (): Iterator<[K, V], undefined, undefined>
-
Returns Iterator<[K, V], undefined, undefined>
entriesArray
entriesArray: () => [K, V][]
forEach
for
Each: <T, U>(f: (value: V, key: K, map: Map<K, V>) => T, u?: U) => void
Type declaration
-
- <T, U>(f: (value: V, key: K, map: Map<K, V>) => T, u?: U): void
-
Type parameters
Parameters
-
f: (value: V, key: K, map: Map<K, V>) => T
-
- (value: V, key: K, map: Map<K, V>): T
-
Parameters
-
value: V
-
key: K
-
map: Map<K, V>
Returns T
-
Optional u: U
Returns void
get
get: (k: K) => V | undefined
Type declaration
-
-
Parameters
Returns V | undefined
has
has: (k: K) => boolean
Type declaration
-
-
Parameters
Returns boolean
keys
keys: () => Iterator<K, undefined, undefined>
Type declaration
-
- (): Iterator<K, undefined, undefined>
-
Returns Iterator<K, undefined, undefined>
set
set
: (k
: K, v
: V) => Map<K, V>
Type declaration
-
-
Parameters
Returns Map<K, V>
values
values: () => Iterator<V, undefined, undefined>
Type declaration
-
- (): Iterator<V, undefined, undefined>
-
Returns Iterator<V, undefined, undefined>
The counterpart of Daml's
DA.Map.Map K Vtype.This is an immutable map which compares keys via deep equality. The order of iteration is unspecified; the only guarantee is that the order in
keysandvaluesmatch, i.e.m.get(k)is (deep-, value-based) equal to[...m.values()][[...m.keys()].findIndex((l) => _.isEqual(k, l))]