Class AbstractMultiMap<K, V>`Abstract`

A AbstractMultiMap can have multiple values per key.

Type Parameters

K

the key type
V

the value type

Hierarchy

AbstractMultiMap
- ArrayMultiMap
- SetMultiMap

Implements

MultiMap<K, V>

Index

Constructors

`Protected` constructor

new AbstractMultiMap<K, V>(map: Map<K, Iterable<V>>): AbstractMultiMap<K, V>
Create a new AbstractMultiMap from the given Map.
Type Parameters
- K
- V
Parameters
- map: Map<K, Iterable<V>>
  
  the underlying Map object to use
Returns AbstractMultiMap<K, V>
- Defined in packages/collections/src/abstractMultiMap.ts:20

Properties

`Private` #value

#value: Map<K, Iterable<V>>

[toStringTag]

[toStringTag]: string = "MultiMap"

Accessors

size

get size(): number
Returns
the number of entries in this MultiMap

Returns number
Implementation of MultiMap.size
- Defined in packages/collections/src/abstractMultiMap.ts:59

Methods

[iterator]

[iterator](): IterableIterator<[K, V]>
Returns IterableIterator<[K, V]>
Implementation of MultiMap.[iterator]
- Defined in packages/collections/src/abstractMultiMap.ts:77

`Abstract` add

add(key: K, value: V): AbstractMultiMap<K, V>
Adds a value for a key to this MultiMap.

Returns
this MultiMap
Parameters
- key: K
  
  the key to look up
- value: V
  
  the value to add
Returns AbstractMultiMap<K, V>
Implementation of MultiMap.add
- Defined in packages/collections/src/abstractMultiMap.ts:51

addAll

addAll(entries: Iterable<Entry<K, V>>): void
Adds all entries to this MultiMap.
Parameters
- entries: Iterable<Entry<K, V>>
  
  the entries to add
Returns void
Implementation of MultiMap.addAll
- Defined in packages/collections/src/abstractMultiMap.ts:53

clear

clear(): void
Removes all entries.

Returns void
Implementation of MultiMap.clear
- Defined in packages/collections/src/abstractMultiMap.ts:24

`Abstract` delete

delete(key: K): boolean
Deletes the key with all its values.

Returns
true if an entry was deleted, otherwise false
Parameters
- key: K
  
  the key to delete
Returns boolean
Implementation of MultiMap.delete
- Defined in packages/collections/src/abstractMultiMap.ts:28
delete(key: K, value: V): boolean
Deletes the first entry with the given key and value.

Returns
true if an entry was deleted, otherwise false
Parameters
- key: K
  
  the key to look for
- value: V
  
  the value to delete
Returns boolean
Implementation of MultiMap.delete
- Defined in packages/collections/src/abstractMultiMap.ts:30

entries

entries(): IterableIterator<[K, V]>
See
Map.entries

Returns IterableIterator<[K, V]>
Implementation of MultiMap.entries
- Defined in packages/collections/src/abstractMultiMap.ts:63

forEach

forEach(callbackfn: ((value: V, key: K, multiMap: AbstractMultiMap<K, V>) => void)): void
See
Map.forEach
Parameters
- callbackfn: ((value: V, key: K, multiMap: AbstractMultiMap<K, V>) => void)
  - - (value: V, key: K, multiMap: AbstractMultiMap<K, V>): void
    - Parameters
      
      value: V
      
      key: K
      
      multiMap: AbstractMultiMap<K, V>
      
      Returns void
Returns void
Implementation of MultiMap.forEach
- Defined in packages/collections/src/abstractMultiMap.ts:32

get

get(key: K): Iterable<V>
Gets all values for this key.

Returns an empty iterable if the key does not exist.

Returns
an Iterable containing all values for this key
Parameters
- key: K
  
  the key to look up
Returns Iterable<V>
Implementation of MultiMap.get
- Defined in packages/collections/src/abstractMultiMap.ts:38

has

has(key: K, value?: V): boolean
Checks if this MultiMap contains an entry for this key.

See
Map.has

Returns
true if an entry with the given key exists, otherwise false
Parameters
- key: K
  
  the key to look up
- Optional value: V
Returns boolean
Implementation of MultiMap.has
- Defined in packages/collections/src/abstractMultiMap.ts:42

keys

keys(): IterableIterator<K>
See
Map.keys

Returns IterableIterator<K>
Implementation of MultiMap.keys
- Defined in packages/collections/src/abstractMultiMap.ts:69

`Abstract` set

set(key: K, values: Iterable<V>): AbstractMultiMap<K, V>
Set the values for a key and replaces all previous values for this key.

If no values are provided all previous entries will be removed.

Returns
this MultiMap
Parameters
- key: K
  
  the key to set
- values: Iterable<V>
Returns AbstractMultiMap<K, V>
Implementation of MultiMap.set
- Defined in packages/collections/src/abstractMultiMap.ts:49

values

values(): IterableIterator<V>
See
Map.forEach

Returns IterableIterator<V>
Implementation of MultiMap.values
- Defined in packages/collections/src/abstractMultiMap.ts:73

Class AbstractMultiMap<K, V>Abstract

Type Parameters

K

V

Hierarchy

Implements

Index

Constructors

Properties

Accessors

Methods

Constructors

Protected constructor

Type Parameters

K

V

Parameters

map: Map<K, Iterable<V>>

Returns AbstractMultiMap<K, V>

Properties

Private #value

[toStringTag]

Accessors

size

Returns

Returns number

Methods

[iterator]

Returns IterableIterator<[K, V]>

Abstract add

Returns

Parameters

key: K

value: V

Returns AbstractMultiMap<K, V>

addAll

Parameters

entries: Iterable<Entry<K, V>>

Returns void

clear

Returns void

Abstract delete

Returns

Parameters

key: K

Returns boolean

Returns

Parameters

key: K

value: V

Returns boolean

entries

See

Returns IterableIterator<[K, V]>

forEach

See

Parameters

callbackfn: ((value: V, key: K, multiMap: AbstractMultiMap<K, V>) => void)

Parameters

value: V

key: K

multiMap: AbstractMultiMap<K, V>

Returns void

Returns void

get

Returns

Parameters

key: K

Returns Iterable<V>

has

See

Returns

Parameters

key: K

Optional value: V

Returns boolean

keys

See

Returns IterableIterator<K>

Abstract set

Class AbstractMultiMap<K, V>`Abstract`

`Protected` constructor

`Private` #value

`Abstract` add

`Abstract` delete

`Optional` value: V

`Abstract` set