Class HashMap<K, V>

The map we've all been waiting for: a proper hash map.

But, it's js, so you have to implement the hashing yourself.

Make an object Hashable to use as a key.

Type Parameters

K extends Hashable
V

Implements

Map<K, V>

Index

Constructors

Accessors

[toStringTag] size

Methods

[iterator] clear delete entries forEach get has keys set values

Constructors

constructor

new HashMap<K extends Hashable, V>(): HashMap<K, V>
Type Parameters
- K extends Hashable
- V
Returns HashMap<K, V>

Accessors

[toStringTag]

get "[toStringTag]"(): string
Returns string
Implementation of Map.[toStringTag]
- Defined in src/utils/hash-map.ts:72

size

get size(): number
Returns number
the number of elements in the Map.
Implementation of Map.size
- Defined in src/utils/hash-map.ts:64

Methods

[iterator]

"[iterator]"(): MapIterator<[K, V]>
Returns MapIterator<[K, V]>
Implementation of Map.[iterator]
- Defined in src/utils/hash-map.ts:68

clear

clear(): void
Returns void
Implementation of Map.clear
- Defined in src/utils/hash-map.ts:18

delete

delete(key: K): boolean
Parameters
- key: K
Returns boolean
true if an element in the Map existed and has been removed, or false if the element does not exist.
Implementation of Map.delete
- Defined in src/utils/hash-map.ts:22

entries

entries(): MapIterator<[K, V]>
Returns an iterable of key, value pairs for every entry in the map.

Returns MapIterator<[K, V]>
Implementation of Map.entries
- Defined in src/utils/hash-map.ts:36

forEach

forEach(
callbackfn: (value: V, key: K, map: Map<K, V>) => void,
thisArg?: unknown,
): void
Executes a provided function once per each key/value pair in the Map, in insertion order.
Parameters
- callbackfn: (value: V, key: K, map: Map<K, V>) => void
- OptionalthisArg: unknown
Returns void
Implementation of Map.forEach
- Defined in src/utils/hash-map.ts:27

get

get(key: K): undefined | V
Returns a specified element from the Map object. If the value that is associated to the provided key is an object, then you will get a reference to that object and any change made to that object will effectively modify it inside the Map.
Parameters
- key: K
Returns undefined | V
Returns the element associated with the specified key. If no element is associated with the specified key, undefined is returned.
Implementation of Map.get
- Defined in src/utils/hash-map.ts:42

has

has(key: K): boolean
Parameters
- key: K
Returns boolean
boolean indicating whether an element with the specified key exists or not.
Implementation of Map.has
- Defined in src/utils/hash-map.ts:46

keys

keys(): MapIterator<K>
Returns an iterable of keys in the map

Returns MapIterator<K>
Implementation of Map.keys
- Defined in src/utils/hash-map.ts:50

set

set(key: K, value: V): this
Adds a new element with a specified key and value to the Map. If an element with the same key already exists, the element will be updated.
Parameters
- key: K
- value: V
Returns this
Implementation of Map.set
- Defined in src/utils/hash-map.ts:54

values

values(): MapIterator<V>
Returns an iterable of values in the map

Returns MapIterator<V>
Implementation of Map.values
- Defined in src/utils/hash-map.ts:60