@blackglory/structures 0.10.4 → 0.10.7

package/dist/es2015/index.mjs

@@ -16955,8 +16955,8 @@ class SortedSet {
 
 class BitSet {
     constructor() {
+        this.array = new DynamicTypedArray(Uint8Array);
         this.length = 0;
-        this.array = new DynamicTypedArray(Uint8Array); // 经测试, 比Uint32Array快
     }
     get [Symbol.toStringTag]() {
         return this.constructor.name;
@@ -16968,15 +16968,44 @@ class BitSet {
         return this.values();
     }
     *values() {
-        for (let i = 0; i < this.length; i++) {
-            if (this.has(i)) {
-                yield i;
+        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 * BitSet.bitsPerElement + 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 * BitSet.bitsPerElement + bit;
+                }
             }
         }
     }
+    _dumpBinaryStrings() {
+        const result = [];
+        for (let i = 0; i < this.array.length; i++) {
+            const binary = this.array.internalTypedArray[i].toString(2);
+            if (binary.length < BitSet.bitsPerElement) {
+                result.push('0'.repeat(BitSet.bitsPerElement - binary.length) + binary);
+            }
+            else {
+                result.push(binary);
+            }
+        }
+        return result;
+    }
     has(value) {
         var _a;
-        const { index, mask } = this.getPosition(value);
+        const [index, mask] = this.getPosition(value);
         return (((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0) & mask) === mask;
     }
     add(value) {
@@ -16985,13 +17014,15 @@ class BitSet {
         if (value >= this.length) {
             this.length = value + 1;
         }
-        const { index, mask } = this.getPosition(value);
+        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);
+        const [index, mask] = this.getPosition(value);
+        const element = ((_a = this.array.get(index)) !== null && _a !== void 0 ? _a : 0);
+        this.array.set(index, element & ~mask);
+        return (element & mask) === mask;
     }
     clear() {
         for (let i = this.array.length; i--;) {
@@ -16999,17 +17030,18 @@ class BitSet {
         }
     }
     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 };
+        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