@blackglory/structures 0.10.2 → 0.10.5

package/dist/es2015/index.mjs

@@ -16953,5 +16953,94 @@ class SortedSet {
     }
 }
 
-export { BadEventError, Box, DynamicTypedArray, Emitter, ExpirableMap, FiniteStateMachine, HashMap, HashSet, LRUMap, ObservableFiniteStateMachine, Queue, SortedSet, SparseMap, SparseSet, TLRUMap, TrieMap, TypedSparseMap, TypedSparseSet, convertArrayToCons, convertConsToArray };
+class BitSet {
+    constructor() {
+        this.array = new DynamicTypedArray(Uint8Array);
+        this.length = 0;
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    get size() {
+        return this.length;
+    }
+    [Symbol.iterator]() {
+        return this.values();
+    }
+    *values() {
+        if (this.length > 0) {
+            const maxArrayLength = Math.ceil(this.length / BitSet.bitsPerElement);
+            const remainder = BitSet.bitsPerElement - (maxArrayLength * BitSet.bitsPerElement - this.length);
+            const lastIndex = maxArrayLength - 1;
+            for (let index = 0; index < lastIndex; index++) {
+                const element = this.array.internalTypedArray[index];
+                for (let bit = 0; bit < BitSet.bitsPerElement; bit++) {
+                    const mask = this.getMask(bit);
+                    if ((element & mask) === mask) {
+                        yield index * 8 + bit;
+                    }
+                }
+            }
+            const lastElement = this.array.internalTypedArray[maxArrayLength - 1];
+            for (let bit = 0; bit < remainder; bit++) {
+                const mask = this.getMask(bit);
+                if ((lastElement & mask) === mask) {
+                    yield lastIndex * 8 + bit;
+                }
+            }
+        }
+    }
+    _dumpBinaryStrings() {
+        const result = [];
+        const expectedBinaryStringLength = Uint8Array.BYTES_PER_ELEMENT * 8;
+        for (let i = 0; i < this.array.length; i++) {
+            const binary = this.array.internalTypedArray[i].toString(2);
+            if (binary.length < expectedBinaryStringLength) {
+                result.push('0'.repeat(expectedBinaryStringLength - binary.length) + binary);
+            }
+            else {
+                result.push(binary);
+            }
+        }
+        return result;
+    }
+    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;
+        es2018$p.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 remainder = value % BitSet.bitsPerElement;
+        const quotient = (value - remainder) / BitSet.bitsPerElement;
+        const index = quotient;
+        const mask = this.getMask(remainder);
+        return { index, mask };
+    }
+    // 输入一定是一个小于bitsPerElement的值, 取值范围是[0, bitsPerElement)
+    getMask(value) {
+        return Math.pow(2, value);
+    }
+}
+BitSet.bitsPerElement = Uint8Array.BYTES_PER_ELEMENT * 8;
+
+export { BadEventError, BitSet, Box, DynamicTypedArray, Emitter, ExpirableMap, FiniteStateMachine, HashMap, HashSet, LRUMap, ObservableFiniteStateMachine, Queue, SortedSet, SparseMap, SparseSet, TLRUMap, TrieMap, TypedSparseMap, TypedSparseSet, convertArrayToCons, convertConsToArray };
 //# sourceMappingURL=index.mjs.map