@blackglory/structures 0.8.0 → 0.9.0

package/dist/es2018/index.mjs

@@ -9641,6 +9641,108 @@ class ObservableFiniteStateMachine extends FiniteStateMachine {
     }
 }
 
+class SparseSet {
+    constructor() {
+        this.indexToValue = [];
+        this.valueToIndex = [];
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    [Symbol.iterator]() {
+        return this.indexToValue[Symbol.iterator]();
+    }
+    has(value) {
+        // 跟一般的实现不同, 不需要访问values数组.
+        return value in this.valueToIndex;
+    }
+    add(value) {
+        if (!this.has(value)) {
+            const index = this.indexToValue.length;
+            this.indexToValue.push(value);
+            this.valueToIndex[value] = index;
+        }
+    }
+    delete(value) {
+        if (this.has(value)) {
+            const lastValue = this.indexToValue.pop();
+            if (value === lastValue) {
+                delete this.valueToIndex[value];
+            }
+            else {
+                const index = this.valueToIndex[value];
+                this.indexToValue[index] = lastValue;
+                this.valueToIndex[lastValue] = index;
+                // 跟一般的实现不同, 直接删除值的索引.
+                delete this.valueToIndex[value];
+            }
+        }
+    }
+}
+
+class SparseMap {
+    constructor() {
+        this.keyToIndex = [];
+        this.indexToKey = [];
+        this.indexToValue = [];
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    *entries() {
+        for (let i = 0; i < this.indexToKey.length; i++) {
+            yield [this.indexToKey[i], this.indexToValue[i]];
+        }
+    }
+    keys() {
+        return this.indexToKey.values();
+    }
+    values() {
+        return this.indexToValue.values();
+    }
+    has(key) {
+        // 跟一般的稀疏集实现不同, 不需要访问values数组.
+        return key in this.keyToIndex;
+    }
+    get(key) {
+        if (this.has(key)) {
+            const index = this.keyToIndex[key];
+            return this.indexToValue[index];
+        }
+        else {
+            return undefined;
+        }
+    }
+    set(key, value) {
+        if (this.has(key)) {
+            const index = this.keyToIndex[key];
+            this.indexToValue[index] = value;
+        }
+        else {
+            const index = this.indexToKey.length;
+            this.indexToKey.push(key);
+            this.indexToValue.push(value);
+            this.keyToIndex[key] = index;
+        }
+    }
+    delete(key) {
+        if (this.has(key)) {
+            const lastKey = this.indexToKey.pop();
+            const lastValue = this.indexToValue.pop();
+            if (key === lastKey) {
+                delete this.keyToIndex[key];
+            }
+            else {
+                const index = this.keyToIndex[key];
+                this.indexToKey[index] = lastKey;
+                this.indexToValue[index] = lastValue;
+                this.keyToIndex[key] = index;
+                delete this.keyToIndex[key];
+            }
+        }
+    }
+}
+
 // 相关提案: https://github.com/tc39/proposal-resizablearraybuffer
 class DynamicTypedArray {
     constructor(typedArrayConstructor, { capacity = 0, growthFactor = 1.5 } = {}) {
@@ -9761,41 +9863,7 @@ function computeNewCapacity(oldCapacity, targetLength, growthFactor) {
     }
 }
 
-class SparseSet {
-    constructor(typedArrayConstructor, { capacity = 0, growthFactor = 1.5 } = {}) {
-        this.indexToValue = new DynamicTypedArray(typedArrayConstructor, { capacity, growthFactor });
-        this.valueToIndex = new DynamicTypedArray(Uint32Array, { capacity, growthFactor });
-    }
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    [Symbol.iterator]() {
-        return this.indexToValue.internalTypedArray[Symbol.iterator]();
-    }
-    has(value) {
-        const index = this.valueToIndex.internalTypedArray[value];
-        return this.indexToValue.internalTypedArray[index] === value;
-    }
-    add(value) {
-        if (!this.has(value)) {
-            const index = this.indexToValue.length;
-            this.indexToValue.push(value);
-            this.valueToIndex.set(value, index);
-        }
-    }
-    delete(value) {
-        const index = this.valueToIndex.internalTypedArray[value];
-        if (this.indexToValue.internalTypedArray[index] === value) {
-            const lastValue = this.indexToValue.pop();
-            if (value !== lastValue) {
-                this.indexToValue.internalTypedArray[index] = lastValue;
-                this.valueToIndex.internalTypedArray[lastValue] = index;
-            }
-        }
-    }
-}
-
-class SparseMap {
+class TypedSparseMap {
     constructor(typedArrayConstructor, { capacity = 0, growthFactor = 1.5 } = {}) {
         this.indexToValue = new DynamicTypedArray(typedArrayConstructor, { capacity, growthFactor });
         this.keyToIndex = new DynamicTypedArray(Uint32Array, { capacity, growthFactor });
@@ -9857,5 +9925,39 @@ class SparseMap {
     }
 }
 
-export { BadEventError, Box, DynamicTypedArray, Emitter, ExpirableMap, FiniteStateMachine, HashMap, HashSet, LRUMap, ObservableFiniteStateMachine, Queue, SparseMap, SparseSet, TLRUMap, TrieMap, convertArrayToCons, convertConsToArray };
+class TypedSparseSet {
+    constructor(typedArrayConstructor, { capacity = 0, growthFactor = 1.5 } = {}) {
+        this.indexToValue = new DynamicTypedArray(typedArrayConstructor, { capacity, growthFactor });
+        this.valueToIndex = new DynamicTypedArray(Uint32Array, { capacity, growthFactor });
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    [Symbol.iterator]() {
+        return this.indexToValue.internalTypedArray[Symbol.iterator]();
+    }
+    has(value) {
+        const index = this.valueToIndex.internalTypedArray[value];
+        return this.indexToValue.internalTypedArray[index] === value;
+    }
+    add(value) {
+        if (!this.has(value)) {
+            const index = this.indexToValue.length;
+            this.indexToValue.push(value);
+            this.valueToIndex.set(value, index);
+        }
+    }
+    delete(value) {
+        const index = this.valueToIndex.internalTypedArray[value];
+        if (this.indexToValue.internalTypedArray[index] === value) {
+            const lastValue = this.indexToValue.pop();
+            if (value !== lastValue) {
+                this.indexToValue.internalTypedArray[index] = lastValue;
+                this.valueToIndex.internalTypedArray[lastValue] = index;
+            }
+        }
+    }
+}
+
+export { BadEventError, Box, DynamicTypedArray, Emitter, ExpirableMap, FiniteStateMachine, HashMap, HashSet, LRUMap, ObservableFiniteStateMachine, Queue, SparseMap, SparseSet, TLRUMap, TrieMap, TypedSparseMap, TypedSparseSet, convertArrayToCons, convertConsToArray };
 //# sourceMappingURL=index.mjs.map