You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
47 lines
1.2 KiB
47 lines
1.2 KiB
3 years ago
|
/**
|
||
|
|
* Mnemonist BiMap Typings
|
||
|
|
* ========================
|
||
|
|
*/
|
||
|
|
export class InverseMap<K, V> implements Iterable<[K, V]> {
|
||
|
|
|
||
|
|
// Members
|
||
|
|
size: number;
|
||
|
|
inverse: BiMap<V, K>;
|
||
|
|
|
||
|
|
// Methods
|
||
|
|
clear(): void;
|
||
|
|
set(key: K, value: V): this;
|
||
|
|
delete(key: K): boolean;
|
||
|
|
has(key: K): boolean;
|
||
|
|
get(key: K): V | undefined;
|
||
|
|
forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
|
||
|
|
keys(): IterableIterator<K>;
|
||
|
|
values(): IterableIterator<V>;
|
||
|
|
entries(): IterableIterator<[K, V]>;
|
||
|
|
[Symbol.iterator](): IterableIterator<[K, V]>;
|
||
|
|
inspect(): any;
|
||
|
|
}
|
||
|
|
|
||
|
|
export default class BiMap<K, V> implements Iterable<[K, V]> {
|
||
|
|
|
||
|
|
// Members
|
||
|
|
size: number;
|
||
|
|
inverse: InverseMap<V, K>;
|
||
|
|
|
||
|
|
// Methods
|
||
|
|
clear(): void;
|
||
|
|
set(key: K, value: V): this;
|
||
|
|
delete(key: K): boolean;
|
||
|
|
has(key: K): boolean;
|
||
|
|
get(key: K): V | undefined;
|
||
|
|
forEach(callback: (value: V, key: K, map: this) => void, scope?: any): void;
|
||
|
|
keys(): IterableIterator<K>;
|
||
|
|
values(): IterableIterator<V>;
|
||
|
|
entries(): IterableIterator<[K, V]>;
|
||
|
|
[Symbol.iterator](): IterableIterator<[K, V]>;
|
||
|
|
inspect(): any;
|
||
|
|
|
||
|
|
// Statics
|
||
|
|
static from<I, J>(iterable: Iterable<[I, J]> | {[key: string]: J}): BiMap<I, J>;
|
||
|
|
}
|