Interface Map<K, V>

The counterpart of Daml's DA.Map.Map K V type.

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 keys and values match, i.e. m.get(k) is (deep-, value-based) equal to [...m.values()][[...m.keys()].findIndex((l) => _.isEqual(k, l))]

Type parameters

K

The type of the map keys.
V

The type of the map values.

Hierarchy

Map

Index

Methods

Methods

delete

delete(k: K): Map<K, V>

- Defined in index.ts:603
Parameters
- k: K
Returns Map<K, V>

entries

entries(): Iterator<[K, V], undefined, undefined>

- Defined in index.ts:606
Returns Iterator<[K, V], undefined, undefined>

entriesArray

entriesArray(): [K, V][]

- Defined in index.ts:607
Returns [K, V][]

forEach

forEach<T, U>(f: (value: V, key: K, map: Map<K, V>) => T, u?: U): void

- Defined in index.ts:608
Type parameters
- T
- U
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): undefined | V

- Defined in index.ts:600
Parameters
- k: K
Returns undefined | V

has

has(k: K): boolean

- Defined in index.ts:601
Parameters
- k: K
Returns boolean

keys

keys(): Iterator<K, undefined, undefined>

- Defined in index.ts:604
Returns Iterator<K, undefined, undefined>

set

set(k: K, v: V): Map<K, V>

- Defined in index.ts:602
Parameters
- k: K
- v: V
Returns Map<K, V>

values

values(): Iterator<V, undefined, undefined>

- Defined in index.ts:605
Returns Iterator<V, undefined, undefined>

Generated using TypeDoc