@blackglory/structures 0.10.1 → 0.10.4

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

@@ -0,0 +1,14 @@
+export declare class BitSet {
+    private length;
+    private array;
+    get [Symbol.toStringTag](): string;
+    get size(): number;
+    [Symbol.iterator](): IterableIterator<number>;
+    values(): IterableIterator<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,64 @@
+"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;
+    }
+    [Symbol.iterator]() {
+        return this.values();
+    }
+    *values() {
+        for (let i = 0; i < this.length; i++) {
+            if (this.has(i)) {
+                yield i;
+            }
+        }
+    }
+    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;IA+DnD,CAAC;IA7DC,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,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,MAAM,EAAE,CAAA;IACtB,CAAC;IAED,CAAE,MAAM;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACf,MAAM,CAAC,CAAA;aACR;SACF;IACH,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;AAjED,wBAiEC"}

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

@@ -16,3 +16,4 @@ 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

@@ -34,4 +34,5 @@ __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;AAC1B,+CAA4B"}
+{"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

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

package/lib/es2015/sorted-set.js

@@ -10,10 +10,8 @@ class SortedSet {
     get [Symbol.toStringTag]() {
         return this.constructor.name;
     }
-    *[Symbol.iterator]() {
-        for (const value of this.values()) {
-            yield value;
-        }
+    [Symbol.iterator]() {
+        return this.values();
     }
     values() {
         return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);

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

@@ -1 +1 @@
-{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAapB,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAZD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,CAAA;SACZ;IACH,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;AAhCD,8BAgCC"}
+{"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

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

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/es2018/bit-set.d.ts

@@ -0,0 +1,14 @@
+export declare class BitSet {
+    private length;
+    private array;
+    get [Symbol.toStringTag](): string;
+    get size(): number;
+    [Symbol.iterator](): IterableIterator<number>;
+    values(): IterableIterator<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,64 @@
+"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;
+    }
+    [Symbol.iterator]() {
+        return this.values();
+    }
+    *values() {
+        for (let i = 0; i < this.length; i++) {
+            if (this.has(i)) {
+                yield i;
+            }
+        }
+    }
+    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;IA+DnD,CAAC;IA7DC,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,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,MAAM,EAAE,CAAA;IACtB,CAAC;IAED,CAAE,MAAM;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACf,MAAM,CAAC,CAAA;aACR;SACF;IACH,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;AAjED,wBAiEC"}

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

@@ -16,3 +16,4 @@ 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

@@ -34,4 +34,5 @@ __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;AAC1B,+CAA4B"}
+{"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

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

package/lib/es2018/sorted-set.js

@@ -10,10 +10,8 @@ class SortedSet {
     get [Symbol.toStringTag]() {
         return this.constructor.name;
     }
-    *[Symbol.iterator]() {
-        for (const value of this.values()) {
-            yield value;
-        }
+    [Symbol.iterator]() {
+        return this.values();
     }
     values() {
         return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);

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

@@ -1 +1 @@
-{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAapB,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAZD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjC,MAAM,KAAK,CAAA;SACZ;IACH,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;AAhCD,8BAgCC"}
+{"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

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

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;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@blackglory/structures",
-  "version": "0.10.1",
+  "version": "0.10.4",
   "description": "",
   "files": [
     "lib",
@@ -72,7 +72,7 @@
     "@blackglory/errors": "^2.2.1",
     "@blackglory/types": "^1.2.1",
     "extra-timers": "^0.2.5",
-    "iterable-operator": "^1.1.0",
+    "iterable-operator": "^1.2.1",
     "justypes": "^2.2.0",
     "rxjs": "^7.5.5"
   }