Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 | 2x 2x 1x 2x 2x 2x 26x | import { map } from "@benneq/iterable";
/**
* An abstract helper class that implements the common base functionality of a
* {@link Map}.
*/
export abstract class AbstractMap<K, V> implements Map<K, V> {
/**
* @see {@link Map.clear}
*/
abstract clear(): void;
/**
* @see {@link Map.delete}
*/
abstract delete(key: K): boolean;
/**
* @see {@link Map.get}
*/
abstract get(key: K): V | undefined;
/**
* @see {@link Map.has}
*/
abstract has(key: K): boolean;
/**
* @see {@link Map.set}
*/
abstract set(key: K, value: V): this;
/**
* @see {@link Map.size}
*/
abstract size: number;
/**
* @see {@link Map.entries}
*/
abstract entries(): IterableIterator<[K, V]>;
/**
* @see {@link Map[Symbol.toStringTag]}
*/
abstract [Symbol.toStringTag]: string;
/**
* @see {@link Map.forEach}
*/
forEach(callbackfn: (value: V, key: K, sortedMap: this) => void): void {
for (const [key, value] of this) {
callbackfn(value, key, this);
}
}
/**
* @see {@link Map.keys}
*/
keys(): IterableIterator<K> {
return map<[K, V], K>((entry) => entry[0])(this);
}
/**
* @see {@link Map.values}
*/
values(): IterableIterator<V> {
return map<[K, V], V>((entry) => entry[1])(this);
}
/**
* @see {@link Map[Symbol.iterator]}
*/
[Symbol.iterator](): IterableIterator<[K, V]> {
return this.entries();
}
}
|