@blackglory/structures 0.10.0 → 0.10.3

package/lib/es2015/bit-set.d.ts

@@ -0,0 +1,12 @@
+export declare class BitSet {
+    private length;
+    private array;
+    get [Symbol.toStringTag](): string;
+    get size(): number;
+    has(value: number): boolean;
+    add(value: number): void;
+    delete(value: number): void;
+    clear(): void;
+    private getPosition;
+    private getMask;
+}

package/lib/es2015/bit-set.js

@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BitSet = void 0;
+const dynamic_typed_array_1 = require("./dynamic-typed-array");
+const errors_1 = require("@blackglory/errors");
+class BitSet {
+    constructor() {
+        this.length = 0;
+        this.array = new dynamic_typed_array_1.DynamicTypedArray(Uint8Array);
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    get size() {
+        return this.length;
+    }
+    has(value) {
+        var _a;
+        const { index, mask } = this.getPosition(value);
+        return (((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) & mask) === mask;
+    }
+    add(value) {
+        var _a;
+        (0, errors_1.assert)(value >= 0, 'value must be greater than or equal to 0');
+        if (value >= this.length) {
+            this.length = value + 1;
+        }
+        const { index, mask } = this.getPosition(value);
+        this.array.set(index, ((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) | mask);
+    }
+    delete(value) {
+        var _a;
+        const { index, mask } = this.getPosition(value);
+        this.array.set(index, ((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) & ~mask);
+    }
+    clear() {
+        for (let i = this.array.length; i--;) {
+            this.array.set(i, 0);
+        }
+    }
+    getPosition(value) {
+        const bits = Uint8Array.BYTES_PER_ELEMENT * 8;
+        const remainder = value % bits;
+        const quotient = (value - remainder) / bits;
+        const index = Math.max(0, quotient - 1);
+        const mask = this.getMask(value);
+        return { index, mask };
+    }
+    getMask(value) {
+        return Math.pow(2, value);
+    }
+}
+exports.BitSet = BitSet;
+//# sourceMappingURL=bit-set.js.map

package/lib/es2015/bit-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-set.js","sourceRoot":"","sources":["../../src/bit-set.ts"],"names":[],"mappings":";;;AAAA,+DAAyD;AACzD,+CAA2C;AAE3C,MAAa,MAAM;IAAnB;QACU,WAAM,GAAG,CAAC,CAAA;QACV,UAAK,GAAG,IAAI,uCAAiB,CAAC,UAAU,CAAC,CAAA;IAmDnD,CAAC;IAjDC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED,GAAG,CAAC,KAAa;;QACf,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;QAE/C,OAAO,CAAC,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,CAAA;IACvD,CAAC;IAED,GAAG,CAAC,KAAa;;QACf,IAAA,eAAM,EAAC,KAAK,IAAI,CAAC,EAAE,0CAA0C,CAAC,CAAA;QAC9D,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACxB,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAA;SACxB;QAED,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;QAE/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;IAC5D,CAAC;IAED,MAAM,CAAC,KAAa;;QAClB,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;QAE/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7D,CAAC;IAED,KAAK;QACH,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG;YACpC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SACrB;IACH,CAAC;IAEO,WAAW,CAAC,KAAa;QAC/B,MAAM,IAAI,GAAG,UAAU,CAAC,iBAAiB,GAAG,CAAC,CAAA;QAC7C,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,CAAA;QAC9B,MAAM,QAAQ,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,IAAI,CAAA;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAA;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAChC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;IACxB,CAAC;IAEO,OAAO,CAAC,KAAa;QAC3B,OAAO,SAAA,CAAC,EAAI,KAAK,CAAA,CAAA;IACnB,CAAC;CACF;AArDD,wBAqDC"}

package/lib/es2015/hash-set.d.ts

@@ -9,5 +9,5 @@ export declare class HashSet<V, Hash = unknown> implements Iterable<V> {
     delete(value: V): boolean;
     has(value: V): boolean;
     clear(): void;
-    values(): Iterable<V>;
+    values(): IterableIterator<V>;
 }

package/lib/es2015/index.d.ts

@@ -15,3 +15,5 @@ export * from './sparse-map';
 export * from './typed-sparse-map';
 export * from './typed-sparse-set';
 export { DynamicTypedArray } from './dynamic-typed-array';
+export * from './sorted-set';
+export * from './bit-set';

package/lib/es2015/index.js

@@ -33,4 +33,6 @@ __exportStar(require("./typed-sparse-map"), exports);
 __exportStar(require("./typed-sparse-set"), exports);
 var dynamic_typed_array_1 = require("./dynamic-typed-array");
 Object.defineProperty(exports, "DynamicTypedArray", { enumerable: true, get: function () { return dynamic_typed_array_1.DynamicTypedArray; } });
+__exportStar(require("./sorted-set"), exports);
+__exportStar(require("./bit-set"), exports);
 //# sourceMappingURL=index.js.map

package/lib/es2015/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B;AAC5B,4CAAyB"}

package/lib/es2015/sorted-set.d.ts

@@ -0,0 +1,10 @@
+export declare class SortedSet<T> implements Iterable<T> {
+    private skipList;
+    get [Symbol.toStringTag](): string;
+    [Symbol.iterator](): IterableIterator<T>;
+    constructor(compare: (a: T, b: T) => number);
+    values(): IterableIterator<T>;
+    has(value: T): boolean;
+    add(value: T): void;
+    delete(value: T): void;
+}

package/lib/es2015/sorted-set.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SortedSet = void 0;
+const skip_list_1 = require("./utils/skip-list");
+const iterable_operator_1 = require("iterable-operator");
+class SortedSet {
+    constructor(compare) {
+        this.skipList = new skip_list_1.SkipList(compare);
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    [Symbol.iterator]() {
+        return this.values();
+    }
+    values() {
+        return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);
+    }
+    has(value) {
+        return this.skipList.has(value);
+    }
+    add(value) {
+        this.skipList.add(value);
+    }
+    delete(value) {
+        this.skipList.delete(value);
+    }
+}
+exports.SortedSet = SortedSet;
+//# sourceMappingURL=sorted-set.js.map

package/lib/es2015/sorted-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAWpB,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAVD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,MAAM,EAAE,CAAA;IACtB,CAAC;IAMD,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3D,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC;CACF;AA9BD,8BA8BC"}

package/lib/es2015/sparse-map.d.ts

@@ -3,9 +3,9 @@ export declare class SparseMap<T> {
     private indexToKey;
     private indexToValue;
     get [Symbol.toStringTag](): string;
-    entries(): Iterable<[key: number, value: T]>;
-    keys(): Iterable<number>;
-    values(): Iterable<T>;
+    entries(): IterableIterator<[key: number, value: T]>;
+    keys(): IterableIterator<number>;
+    values(): IterableIterator<T>;
     has(key: number): boolean;
     get(key: number): T | undefined;
     set(key: number, value: T): void;

package/lib/es2015/sparse-set.d.ts

@@ -3,7 +3,8 @@ export declare class SparseSet implements Iterable<number> {
     private valueToIndex;
     get [Symbol.toStringTag](): string;
     [Symbol.iterator](): IterableIterator<number>;
-    values(): Iterable<number>;
+    constructor(array?: number[]);
+    values(): IterableIterator<number>;
     has(value: number): boolean;
     add(value: number): void;
     delete(value: number): void;

package/lib/es2015/sparse-set.js

@@ -2,9 +2,15 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.SparseSet = void 0;
 class SparseSet {
-    constructor() {
+    constructor(array = []) {
         this.indexToValue = [];
-        this.valueToIndex = [];
+        const valueToIndex = [];
+        if (array.length > 0) {
+            for (const [index, value] of array.entries()) {
+                valueToIndex[value] = index;
+            }
+        }
+        this.valueToIndex = valueToIndex;
     }
     get [Symbol.toStringTag]() {
         return this.constructor.name;

package/lib/es2015/sparse-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAAtB;QACU,iBAAY,GAAa,EAAE,CAAA;QAC3B,iBAAY,GAA8B,EAAE,CAAA;IAyCtD,CAAC;IAvCC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;SACF;IACH,CAAC;CACF;AA3CD,8BA2CC"}
+{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAYpB,YAAY,QAAkB,EAAE;QAXxB,iBAAY,GAAa,EAAE,CAAA;QAYjC,MAAM,YAAY,GAA8B,EAAE,CAAA;QAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;aAC5B;SACF;QAED,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAjBD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAaD,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;SACF;IACH,CAAC;CACF;AAtDD,8BAsDC"}

package/lib/es2015/trie-map.d.ts

@@ -1,9 +1,9 @@
 export declare class TrieMap<K extends Iterable<T>, V, T = unknown> {
     private root;
     get [Symbol.toStringTag](): string;
-    entries(): Iterable<[key: T[], value: V]>;
-    keys(): Iterable<T[]>;
-    values(): Iterable<V>;
+    entries(): IterableIterator<[key: T[], value: V]>;
+    keys(): IterableIterator<T[]>;
+    values(): IterableIterator<V>;
     set(key: K, value: V): this;
     has(key: K): boolean;
     get(key: K): V | undefined;

package/lib/es2015/utils/skip-list.d.ts

@@ -0,0 +1,24 @@
+export declare class SkipListNode<T> {
+    value: T | null;
+    previous: SkipListNode<T> | null;
+    next: SkipListNode<T> | null;
+    up: SkipListNode<T> | null;
+    down: SkipListNode<T> | null;
+    constructor(value: T | null);
+}
+export declare class SkipList<T> {
+    private compare;
+    private head;
+    private tail;
+    private height;
+    private _size;
+    get size(): number;
+    constructor(compare: (a: T, b: T) => number);
+    elements(): IterableIterator<SkipListNode<T>>;
+    dumpList(): Array<Array<T | null | undefined>>;
+    delete(value: T): void;
+    has(value: T): boolean;
+    findNode(value: T): SkipListNode<T> | null;
+    add(value: T): void;
+    private findPreviousNode;
+}

package/lib/es2015/utils/skip-list.js

@@ -0,0 +1,155 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SkipList = exports.SkipListNode = void 0;
+const types_1 = require("@blackglory/types");
+class SkipListNode {
+    constructor(value) {
+        this.value = value;
+        this.previous = null;
+        this.next = null;
+        this.up = null;
+        this.down = null;
+    }
+}
+exports.SkipListNode = SkipListNode;
+class SkipList {
+    constructor(compare) {
+        this.compare = compare;
+        this.head = new SkipListNode(null);
+        this.tail = new SkipListNode(null);
+        this.height = 0;
+        this._size = 0;
+        this.head.next = this.tail;
+        this.tail.previous = this.head;
+    }
+    get size() {
+        return this._size;
+    }
+    *elements() {
+        let currentNode = this.head;
+        while (currentNode.down) {
+            currentNode = currentNode.down;
+        }
+        while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
+            currentNode = currentNode.next;
+            yield currentNode;
+        }
+    }
+    dumpList() {
+        const result = [];
+        let head = this.head;
+        do {
+            result.push([]);
+            let currentNode = head;
+            do {
+                result[result.length - 1].push(currentNode.value);
+                currentNode = currentNode.next;
+            } while (currentNode);
+        } while (head = head.down);
+        return result;
+    }
+    delete(value) {
+        let currentNode = this.findNode(value);
+        while (currentNode) {
+            currentNode.previous.next = currentNode.next;
+            currentNode.next.previous = currentNode.previous;
+            currentNode = currentNode.down;
+        }
+        this._size--;
+    }
+    has(value) {
+        return (0, types_1.isntNull)(this.findNode(value));
+    }
+    findNode(value) {
+        let currentNode = this.head;
+        while (true) {
+            while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
+                const result = this.compare(currentNode.next.value, value);
+                if (result === 0) {
+                    return currentNode.next;
+                }
+                else if (result < 0) {
+                    currentNode = currentNode.next;
+                }
+                else {
+                    break;
+                }
+            }
+            if (currentNode.down) {
+                currentNode = currentNode.down;
+            }
+            else {
+                return null;
+            }
+        }
+    }
+    add(value) {
+        let previousNode = this.findPreviousNode(value);
+        if (previousNode.next &&
+            (0, types_1.isntNull)(previousNode.next.value) &&
+            this.compare(previousNode.next.value, value) === 0) {
+            return;
+        }
+        let newNode = new SkipListNode(value);
+        if (previousNode.next) {
+            newNode.next = previousNode.next;
+            previousNode.next.previous = newNode;
+        }
+        previousNode.next = newNode;
+        newNode.previous = previousNode;
+        let level = 0;
+        while (Math.random() < 0.5) {
+            if (level === this.height) {
+                const newHead = new SkipListNode(null);
+                const newTail = new SkipListNode(null);
+                newHead.next = newTail;
+                newHead.down = this.head;
+                newTail.previous = newHead;
+                newTail.down = this.tail;
+                this.head.up = newHead;
+                this.tail.up = newTail;
+                this.head = newHead;
+                this.tail = newTail;
+                this.height++;
+            }
+            while (!previousNode.up) {
+                previousNode = previousNode.previous;
+            }
+            previousNode = previousNode.up;
+            const upperNewNode = new SkipListNode(value);
+            if (previousNode.next) {
+                upperNewNode.next = previousNode.next;
+                previousNode.next.previous = upperNewNode;
+            }
+            previousNode.next = upperNewNode;
+            upperNewNode.previous = previousNode;
+            upperNewNode.down = newNode;
+            newNode.up = upperNewNode;
+            newNode = upperNewNode;
+            level++;
+        }
+        this._size++;
+    }
+    findPreviousNode(value) {
+        let currentNode = this.head;
+        while (true) {
+            while (currentNode.next && (0, types_1.isntNull)(currentNode.next.value)) {
+                const result = this.compare(currentNode.next.value, value);
+                if (result >= 0) {
+                    break;
+                }
+                else {
+                    currentNode = currentNode.next;
+                }
+            }
+            if (currentNode.down) {
+                currentNode = currentNode.down;
+            }
+            else {
+                return currentNode;
+            }
+        }
+    }
+}
+exports.SkipList = SkipList;
+//# sourceMappingURL=skip-list.js.map

package/lib/es2015/utils/skip-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"skip-list.js","sourceRoot":"","sources":["../../../src/utils/skip-list.ts"],"names":[],"mappings":";;;AAAA,6CAA4C;AAE5C,MAAa,YAAY;IAMvB,YAAmB,KAAe;QAAf,UAAK,GAAL,KAAK,CAAU;QALlC,aAAQ,GAA2B,IAAI,CAAA;QACvC,SAAI,GAA2B,IAAI,CAAA;QACnC,OAAE,GAA2B,IAAI,CAAA;QACjC,SAAI,GAA2B,IAAI,CAAA;IAEE,CAAC;CACvC;AAPD,oCAOC;AAED,MAAa,QAAQ;IAcnB,YAAoB,OAA+B;QAA/B,YAAO,GAAP,OAAO,CAAwB;QAZ3C,SAAI,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;QAEjD,SAAI,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;QAEjD,WAAM,GAAW,CAAC,CAAA;QAClB,UAAK,GAAW,CAAC,CAAA;QAQvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAA;IAChC,CAAC;IAPD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAOD,CAAE,QAAQ;QACR,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,WAAW,CAAC,IAAI,EAAE;YACvB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;SAC/B;QAED,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YAC3D,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;YAC9B,MAAM,WAAW,CAAA;SAClB;IACH,CAAC;IAED,QAAQ;QACN,MAAM,MAAM,GAAuC,EAAE,CAAA;QACrD,IAAI,IAAI,GAA2B,IAAI,CAAC,IAAI,CAAA;QAE5C,GAAG;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACf,IAAI,WAAW,GAA2B,IAAI,CAAA;YAC9C,GAAG;gBACD,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;gBACjD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B,QAAQ,WAAW,EAAC;SACtB,QAAQ,IAAI,GAAG,IAAI,CAAC,IAAI,EAAC;QAE1B,OAAO,MAAM,CAAA;IACf,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,WAAW,GAA2B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QAE9D,OAAO,WAAW,EAAE;YAElB,WAAW,CAAC,QAAS,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAA;YAG7C,WAAW,CAAC,IAAK,CAAC,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAA;YAEjD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;SAC/B;QAED,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAA,gBAAQ,EAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,IAAI,EAAE;YACX,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC1D,IAAI,MAAM,KAAK,CAAC,EAAE;oBAChB,OAAO,WAAW,CAAC,IAAI,CAAA;iBACxB;qBAAM,IAAI,MAAM,GAAG,CAAC,EAAE;oBACrB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;iBAC/B;qBAAM;oBACL,MAAK;iBACN;aACF;YAED,IAAI,WAAW,CAAC,IAAI,EAAE;gBACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B;iBAAM;gBACL,OAAO,IAAI,CAAA;aACZ;SACF;IACH,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,YAAY,GAAoB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAGhE,IACE,YAAY,CAAC,IAAI;YACjB,IAAA,gBAAQ,EAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,EAClD;YACA,OAAM;SACP;QAED,IAAI,OAAO,GAAoB,IAAI,YAAY,CAAC,KAAK,CAAC,CAAA;QAEtD,IAAI,YAAY,CAAC,IAAI,EAAE;YACrB,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAA;YAChC,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;SACrC;QACD,YAAY,CAAC,IAAI,GAAG,OAAO,CAAA;QAC3B,OAAO,CAAC,QAAQ,GAAG,YAAY,CAAA;QAI/B,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,EAAE;YAE1B,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE;gBACzB,MAAM,OAAO,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;gBAC1D,MAAM,OAAO,GAAoB,IAAI,YAAY,CAAI,IAAI,CAAC,CAAA;gBAE1D,OAAO,CAAC,IAAI,GAAG,OAAO,CAAA;gBACtB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAExB,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAA;gBAC1B,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAExB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAA;gBACtB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAA;gBAEtB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAA;gBACnB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAA;gBAEnB,IAAI,CAAC,MAAM,EAAE,CAAA;aACd;YAGD,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE;gBAEvB,YAAY,GAAG,YAAY,CAAC,QAAS,CAAA;aACtC;YAED,YAAY,GAAG,YAAY,CAAC,EAAG,CAAA;YAG/B,MAAM,YAAY,GAAoB,IAAI,YAAY,CAAI,KAAK,CAAC,CAAA;YAChE,IAAI,YAAY,CAAC,IAAI,EAAE;gBACrB,YAAY,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAA;gBACrC,YAAY,CAAC,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAA;aAC1C;YACD,YAAY,CAAC,IAAI,GAAG,YAAY,CAAA;YAChC,YAAY,CAAC,QAAQ,GAAG,YAAY,CAAA;YAEpC,YAAY,CAAC,IAAI,GAAG,OAAO,CAAA;YAC3B,OAAO,CAAC,EAAE,GAAG,YAAY,CAAA;YACzB,OAAO,GAAG,YAAY,CAAA;YAEtB,KAAK,EAAE,CAAA;SACR;QAED,IAAI,CAAC,KAAK,EAAE,CAAA;IACd,CAAC;IAEO,gBAAgB,CAAC,KAAQ;QAC/B,IAAI,WAAW,GAAoB,IAAI,CAAC,IAAI,CAAA;QAE5C,OAAO,IAAI,EAAE;YACX,OAAO,WAAW,CAAC,IAAI,IAAI,IAAA,gBAAQ,EAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;gBAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;gBAC1D,IAAI,MAAM,IAAI,CAAC,EAAE;oBACf,MAAK;iBACN;qBAAM;oBACL,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;iBAC/B;aACF;YAED,IAAI,WAAW,CAAC,IAAI,EAAE;gBACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAA;aAC/B;iBAAM;gBACL,OAAO,WAAW,CAAA;aACnB;SACF;IACH,CAAC;CACF;AAvLD,4BAuLC"}

package/lib/es2018/bit-set.d.ts

@@ -0,0 +1,12 @@
+export declare class BitSet {
+    private length;
+    private array;
+    get [Symbol.toStringTag](): string;
+    get size(): number;
+    has(value: number): boolean;
+    add(value: number): void;
+    delete(value: number): void;
+    clear(): void;
+    private getPosition;
+    private getMask;
+}

package/lib/es2018/bit-set.js

@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BitSet = void 0;
+const dynamic_typed_array_1 = require("./dynamic-typed-array");
+const errors_1 = require("@blackglory/errors");
+class BitSet {
+    constructor() {
+        this.length = 0;
+        this.array = new dynamic_typed_array_1.DynamicTypedArray(Uint8Array);
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    get size() {
+        return this.length;
+    }
+    has(value) {
+        var _a;
+        const { index, mask } = this.getPosition(value);
+        return (((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) & mask) === mask;
+    }
+    add(value) {
+        var _a;
+        (0, errors_1.assert)(value >= 0, 'value must be greater than or equal to 0');
+        if (value >= this.length) {
+            this.length = value + 1;
+        }
+        const { index, mask } = this.getPosition(value);
+        this.array.set(index, ((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) | mask);
+    }
+    delete(value) {
+        var _a;
+        const { index, mask } = this.getPosition(value);
+        this.array.set(index, ((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) & ~mask);
+    }
+    clear() {
+        for (let i = this.array.length; i--;) {
+            this.array.set(i, 0);
+        }
+    }
+    getPosition(value) {
+        const bits = Uint8Array.BYTES_PER_ELEMENT * 8;
+        const remainder = value % bits;
+        const quotient = (value - remainder) / bits;
+        const index = Math.max(0, quotient - 1);
+        const mask = this.getMask(value);
+        return { index, mask };
+    }
+    getMask(value) {
+        return 2 ** value;
+    }
+}
+exports.BitSet = BitSet;
+//# sourceMappingURL=bit-set.js.map

package/lib/es2018/bit-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bit-set.js","sourceRoot":"","sources":["../../src/bit-set.ts"],"names":[],"mappings":";;;AAAA,+DAAyD;AACzD,+CAA2C;AAE3C,MAAa,MAAM;IAAnB;QACU,WAAM,GAAG,CAAC,CAAA;QACV,UAAK,GAAG,IAAI,uCAAiB,CAAC,UAAU,CAAC,CAAA;IAmDnD,CAAC;IAjDC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED,GAAG,CAAC,KAAa;;QACf,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;QAE/C,OAAO,CAAC,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,CAAA;IACvD,CAAC;IAED,GAAG,CAAC,KAAa;;QACf,IAAA,eAAM,EAAC,KAAK,IAAI,CAAC,EAAE,0CAA0C,CAAC,CAAA;QAC9D,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACxB,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAA;SACxB;QAED,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;QAE/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;IAC5D,CAAC;IAED,MAAM,CAAC,KAAa;;QAClB,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;QAE/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAC7D,CAAC;IAED,KAAK;QACH,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG;YACpC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SACrB;IACH,CAAC;IAEO,WAAW,CAAC,KAAa;QAC/B,MAAM,IAAI,GAAG,UAAU,CAAC,iBAAiB,GAAG,CAAC,CAAA;QAC7C,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,CAAA;QAC9B,MAAM,QAAQ,GAAG,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,IAAI,CAAA;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAA;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;QAChC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;IACxB,CAAC;IAEO,OAAO,CAAC,KAAa;QAC3B,OAAO,CAAC,IAAI,KAAK,CAAA;IACnB,CAAC;CACF;AArDD,wBAqDC"}

package/lib/es2018/hash-set.d.ts

@@ -9,5 +9,5 @@ export declare class HashSet<V, Hash = unknown> implements Iterable<V> {
     delete(value: V): boolean;
     has(value: V): boolean;
     clear(): void;
-    values(): Iterable<V>;
+    values(): IterableIterator<V>;
 }

package/lib/es2018/index.d.ts

@@ -15,3 +15,5 @@ export * from './sparse-map';
 export * from './typed-sparse-map';
 export * from './typed-sparse-set';
 export { DynamicTypedArray } from './dynamic-typed-array';
+export * from './sorted-set';
+export * from './bit-set';

package/lib/es2018/index.js

@@ -33,4 +33,6 @@ __exportStar(require("./typed-sparse-map"), exports);
 __exportStar(require("./typed-sparse-set"), exports);
 var dynamic_typed_array_1 = require("./dynamic-typed-array");
 Object.defineProperty(exports, "DynamicTypedArray", { enumerable: true, get: function () { return dynamic_typed_array_1.DynamicTypedArray; } });
+__exportStar(require("./sorted-set"), exports);
+__exportStar(require("./bit-set"), exports);
 //# sourceMappingURL=index.js.map

package/lib/es2018/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,yDAAsC;AACtC,oEAAiD;AACjD,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B;AAC5B,4CAAyB"}

package/lib/es2018/sorted-set.d.ts

@@ -0,0 +1,10 @@
+export declare class SortedSet<T> implements Iterable<T> {
+    private skipList;
+    get [Symbol.toStringTag](): string;
+    [Symbol.iterator](): IterableIterator<T>;
+    constructor(compare: (a: T, b: T) => number);
+    values(): IterableIterator<T>;
+    has(value: T): boolean;
+    add(value: T): void;
+    delete(value: T): void;
+}

package/lib/es2018/sorted-set.js

@@ -0,0 +1,30 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SortedSet = void 0;
+const skip_list_1 = require("./utils/skip-list");
+const iterable_operator_1 = require("iterable-operator");
+class SortedSet {
+    constructor(compare) {
+        this.skipList = new skip_list_1.SkipList(compare);
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    [Symbol.iterator]() {
+        return this.values();
+    }
+    values() {
+        return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);
+    }
+    has(value) {
+        return this.skipList.has(value);
+    }
+    add(value) {
+        this.skipList.add(value);
+    }
+    delete(value) {
+        this.skipList.delete(value);
+    }
+}
+exports.SortedSet = SortedSet;
+//# sourceMappingURL=sorted-set.js.map

package/lib/es2018/sorted-set.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAWpB,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAVD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,MAAM,EAAE,CAAA;IACtB,CAAC;IAMD,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3D,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC;CACF;AA9BD,8BA8BC"}

package/lib/es2018/sparse-map.d.ts

@@ -3,9 +3,9 @@ export declare class SparseMap<T> {
     private indexToKey;
     private indexToValue;
     get [Symbol.toStringTag](): string;
-    entries(): Iterable<[key: number, value: T]>;
-    keys(): Iterable<number>;
-    values(): Iterable<T>;
+    entries(): IterableIterator<[key: number, value: T]>;
+    keys(): IterableIterator<number>;
+    values(): IterableIterator<T>;
     has(key: number): boolean;
     get(key: number): T | undefined;
     set(key: number, value: T): void;

package/lib/es2018/sparse-set.d.ts

@@ -3,7 +3,8 @@ export declare class SparseSet implements Iterable<number> {
     private valueToIndex;
     get [Symbol.toStringTag](): string;
     [Symbol.iterator](): IterableIterator<number>;
-    values(): Iterable<number>;
+    constructor(array?: number[]);
+    values(): IterableIterator<number>;
     has(value: number): boolean;
     add(value: number): void;
     delete(value: number): void;

package/lib/es2018/sparse-set.js

@@ -2,9 +2,15 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.SparseSet = void 0;
 class SparseSet {
-    constructor() {
+    constructor(array = []) {
         this.indexToValue = [];
-        this.valueToIndex = [];
+        const valueToIndex = [];
+        if (array.length > 0) {
+            for (const [index, value] of array.entries()) {
+                valueToIndex[value] = index;
+            }
+        }
+        this.valueToIndex = valueToIndex;
     }
     get [Symbol.toStringTag]() {
         return this.constructor.name;

package/lib/es2018/sparse-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAAtB;QACU,iBAAY,GAAa,EAAE,CAAA;QAC3B,iBAAY,GAA8B,EAAE,CAAA;IAyCtD,CAAC;IAvCC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;SACF;IACH,CAAC;CACF;AA3CD,8BA2CC"}
+{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAYpB,YAAY,QAAkB,EAAE;QAXxB,iBAAY,GAAa,EAAE,CAAA;QAYjC,MAAM,YAAY,GAA8B,EAAE,CAAA;QAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;aAC5B;SACF;QAED,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAjBD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAaD,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;SACF;IACH,CAAC;CACF;AAtDD,8BAsDC"}

package/lib/es2018/trie-map.d.ts

@@ -1,9 +1,9 @@
 export declare class TrieMap<K extends Iterable<T>, V, T = unknown> {
     private root;
     get [Symbol.toStringTag](): string;
-    entries(): Iterable<[key: T[], value: V]>;
-    keys(): Iterable<T[]>;
-    values(): Iterable<V>;
+    entries(): IterableIterator<[key: T[], value: V]>;
+    keys(): IterableIterator<T[]>;
+    values(): IterableIterator<V>;
     set(key: K, value: V): this;
     has(key: K): boolean;
     get(key: K): V | undefined;