@blackglory/structures 0.10.11 → 0.10.14

package/dist/es2018/index.mjs

@@ -16498,6 +16498,9 @@ class SparseMap {
     values() {
         return this.indexToValue.values();
     }
+    getInternalIndexOfKey(key) {
+        return this.keyToIndex[key];
+    }
     has(key) {
         // 跟一般的稀疏集实现不同, 不需要访问values数组.
         return key in this.keyToIndex;
@@ -16534,7 +16537,7 @@ class SparseMap {
                 const index = this.keyToIndex[key];
                 this.indexToKey[index] = lastKey;
                 this.indexToValue[index] = lastValue;
-                this.keyToIndex[key] = index;
+                this.keyToIndex[lastKey] = index;
                 delete this.keyToIndex[key];
             }
         }
@@ -16573,6 +16576,9 @@ class TypedSparseMap {
             yield this.indexToValue.internalTypedArray[i];
         }
     }
+    getInternalIndexOfKey(key) {
+        return this.keyToIndex[key];
+    }
     has(key) {
         const index = this.keyToIndex[key];
         return this.indexToKey[index] === key;
@@ -16980,8 +16986,100 @@ class SortedSet {
 }
 
 class BitSet {
-    constructor() {
-        this.array = new DynamicTypedArray(Uint8Array);
+    constructor(bitsPerElement = 8) {
+        this.bitsPerElement = bitsPerElement;
+        this.array = [];
+        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 / this.bitsPerElement);
+            const remainder = this.bitsPerElement
+                - (maxArrayLength * this.bitsPerElement - this.length);
+            const lastIndex = maxArrayLength - 1;
+            for (let index = 0; index < lastIndex; index++) {
+                const element = this.array[index];
+                for (let bit = 0; bit < this.bitsPerElement; bit++) {
+                    const mask = this.getMask(bit);
+                    if ((element & mask) === mask) {
+                        yield index * this.bitsPerElement + bit;
+                    }
+                }
+            }
+            const lastElement = this.array[maxArrayLength - 1];
+            for (let bit = 0; bit < remainder; bit++) {
+                const mask = this.getMask(bit);
+                if ((lastElement & mask) === mask) {
+                    yield lastIndex * this.bitsPerElement + bit;
+                }
+            }
+        }
+    }
+    _dumpBinaryStrings() {
+        const result = [];
+        for (let i = 0; i < this.array.length; i++) {
+            const binary = this.array[i].toString(2);
+            if (binary.length < this.bitsPerElement) {
+                result.push('0'.repeat(this.bitsPerElement - binary.length) + binary);
+            }
+            else {
+                result.push(binary);
+            }
+        }
+        return result;
+    }
+    has(value) {
+        var _a;
+        const [index, mask] = this.getPosition(value);
+        return (((_a = this.array[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[index] = ((_a = this.array[index]) !== null && _a !== void 0 ? _a : 0) | mask;
+    }
+    delete(value) {
+        var _a;
+        const [index, mask] = this.getPosition(value);
+        const element = ((_a = this.array[index]) !== null && _a !== void 0 ? _a : 0);
+        this.array[index] = element & ~mask;
+        return (element & mask) === mask;
+    }
+    clear() {
+        for (let i = this.array.length; i--;) {
+            this.array[i] = 0;
+        }
+    }
+    getPosition(value) {
+        const remainder = value % this.bitsPerElement;
+        const quotient = (value - remainder) / this.bitsPerElement;
+        const index = quotient;
+        const mask = this.getMask(remainder);
+        return [index, mask];
+    }
+    // 输入一定是一个小于bitsPerElement的值, 取值范围是[0, bitsPerElement)
+    getMask(value) {
+        return 2 ** value;
+    }
+}
+
+class TypedBitSet {
+    constructor(array) {
+        this.array = array;
+        this.bitsPerElement = this.array.internalTypedArray.BYTES_PER_ELEMENT * 8;
         this.length = 0;
     }
     get [Symbol.toStringTag]() {
@@ -16995,15 +17093,16 @@ class BitSet {
     }
     *values() {
         if (this.length > 0) {
-            const maxArrayLength = Math.ceil(this.length / BitSet.bitsPerElement);
-            const remainder = BitSet.bitsPerElement - (maxArrayLength * BitSet.bitsPerElement - this.length);
+            const maxArrayLength = Math.ceil(this.length / this.bitsPerElement);
+            const remainder = this.bitsPerElement
+                - (maxArrayLength * this.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++) {
+                for (let bit = 0; bit < this.bitsPerElement; bit++) {
                     const mask = this.getMask(bit);
                     if ((element & mask) === mask) {
-                        yield index * BitSet.bitsPerElement + bit;
+                        yield index * this.bitsPerElement + bit;
                     }
                 }
             }
@@ -17011,7 +17110,7 @@ class BitSet {
             for (let bit = 0; bit < remainder; bit++) {
                 const mask = this.getMask(bit);
                 if ((lastElement & mask) === mask) {
-                    yield lastIndex * BitSet.bitsPerElement + bit;
+                    yield lastIndex * this.bitsPerElement + bit;
                 }
             }
         }
@@ -17020,8 +17119,8 @@ class BitSet {
         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);
+            if (binary.length < this.bitsPerElement) {
+                result.push('0'.repeat(this.bitsPerElement - binary.length) + binary);
             }
             else {
                 result.push(binary);
@@ -17056,8 +17155,8 @@ class BitSet {
         }
     }
     getPosition(value) {
-        const remainder = value % BitSet.bitsPerElement;
-        const quotient = (value - remainder) / BitSet.bitsPerElement;
+        const remainder = value % this.bitsPerElement;
+        const quotient = (value - remainder) / this.bitsPerElement;
         const index = quotient;
         const mask = this.getMask(remainder);
         return [index, mask];
@@ -17067,7 +17166,6 @@ class BitSet {
         return 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 };
+export { BadEventError, BitSet, Box, DynamicTypedArray, Emitter, ExpirableMap, FiniteStateMachine, HashMap, HashSet, LRUMap, ObservableFiniteStateMachine, Queue, SortedSet, SparseMap, SparseSet, TLRUMap, TrieMap, TypedBitSet, TypedSparseMap, TypedSparseSet, convertArrayToCons, convertConsToArray };
 //# sourceMappingURL=index.mjs.map