data-structure-typed 2.0.0 → 2.0.2

package/dist/umd/data-structure-typed.js

@@ -39,26 +39,6 @@ var dataStructureTyped = (() => {
   };
   var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
   var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
-  var __async = (__this, __arguments, generator) => {
-    return new Promise((resolve, reject) => {
-      var fulfilled = (value) => {
-        try {
-          step(generator.next(value));
-        } catch (e) {
-          reject(e);
-        }
-      };
-      var rejected = (value) => {
-        try {
-          step(generator.throw(value));
-        } catch (e) {
-          reject(e);
-        }
-      };
-      var step = (x) => x.done ? resolve(x.value) : Promise.resolve(x.value).then(fulfilled, rejected);
-      step((generator = generator.apply(__this, __arguments)).next());
-    });
-  };
   var __await = function(promise, isYieldStar) {
     this[0] = promise;
     this[1] = isYieldStar;
@@ -146,7 +126,6 @@ var dataStructureTyped = (() => {
     SkipList: () => SkipList,
     SkipListNode: () => SkipListNode,
     Stack: () => Stack,
-    THUNK_SYMBOL: () => THUNK_SYMBOL,
     TreeCounter: () => TreeCounter,
     TreeCounterNode: () => TreeCounterNode,
     TreeMultiMap: () => TreeMultiMap,
@@ -167,9 +146,7 @@ var dataStructureTyped = (() => {
     roundFixed: () => roundFixed,
     throwRangeError: () => throwRangeError,
     toBinaryString: () => toBinaryString,
-    toThunk: () => toThunk,
     trampoline: () => trampoline,
-    trampolineAsync: () => trampolineAsync,
     uuidV4: () => uuidV4
   });
 
@@ -623,41 +600,16 @@ var dataStructureTyped = (() => {
     }
     return result;
   };
-  var THUNK_SYMBOL = Symbol("thunk");
-  var isThunk = (fnOrValue) => {
-    return typeof fnOrValue === "function" && fnOrValue.__THUNK__ === THUNK_SYMBOL;
-  };
-  var toThunk = (fn) => {
-    const thunk = () => fn();
-    thunk.__THUNK__ = THUNK_SYMBOL;
-    return thunk;
-  };
-  var trampoline = (fn) => {
-    const cont = (...args) => toThunk(() => fn(...args));
-    return Object.assign(
-      (...args) => {
-        let result = fn(...args);
-        while (isThunk(result) && typeof result === "function") {
-          result = result();
-        }
-        return result;
-      },
-      { cont }
-    );
-  };
-  var trampolineAsync = (fn) => {
-    const cont = (...args) => toThunk(() => fn(...args));
-    return Object.assign(
-      (...args) => __async(void 0, null, function* () {
-        let result = yield fn(...args);
-        while (isThunk(result) && typeof result === "function") {
-          result = yield result();
-        }
-        return result;
-      }),
-      { cont }
-    );
-  };
+  function isThunk(result) {
+    return typeof result === "function";
+  }
+  function trampoline(thunk) {
+    let result = thunk;
+    while (isThunk(result)) {
+      result = result();
+    }
+    return result;
+  }
   var getMSB = (value) => {
     if (value <= 0) {
       return 0;
@@ -6256,7 +6208,7 @@ var dataStructureTyped = (() => {
       if (isWeight === void 0) isWeight = false;
       if (isWeight) {
         const allPaths = this.getAllPathsBetween(v1, v2);
-        let min = Infinity;
+        let min = Number.MAX_SAFE_INTEGER;
         for (const path of allPaths) {
           min = Math.min(this.getPathSumWeight(path), min);
         }
@@ -6317,7 +6269,7 @@ var dataStructureTyped = (() => {
       if (isWeight) {
         if (isDFS) {
           const allPaths = this.getAllPathsBetween(v1, v2, 1e4);
-          let min = Infinity;
+          let min = Number.MAX_SAFE_INTEGER;
           let minIndex = -1;
           let index = 0;
           for (const path of allPaths) {
@@ -6377,7 +6329,7 @@ var dataStructureTyped = (() => {
      * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstraWithoutHeap(src, dest = void 0, getMinDist = false, genPaths = false) {
-      let minDist = Infinity;
+      let minDist = Number.MAX_SAFE_INTEGER;
       let minDest = void 0;
       let minPath = [];
       const paths = [];
@@ -6392,12 +6344,12 @@ var dataStructureTyped = (() => {
       }
       for (const vertex of vertexMap) {
         const vertexOrKey = vertex[1];
-        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Infinity);
+        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Number.MAX_SAFE_INTEGER);
       }
       distMap.set(srcVertex, 0);
       preMap.set(srcVertex, void 0);
       const getMinOfNoSeen = () => {
-        let min = Infinity;
+        let min = Number.MAX_SAFE_INTEGER;
         let minV = void 0;
         for (const [key, value] of distMap) {
           if (!seen.has(key)) {
@@ -6431,7 +6383,7 @@ var dataStructureTyped = (() => {
           seen.add(cur);
           if (destVertex && destVertex === cur) {
             if (getMinDist) {
-              minDist = distMap.get(destVertex) || Infinity;
+              minDist = distMap.get(destVertex) || Number.MAX_SAFE_INTEGER;
             }
             if (genPaths) {
               getPaths(destVertex);
@@ -6490,7 +6442,7 @@ var dataStructureTyped = (() => {
      */
     dijkstra(src, dest = void 0, getMinDist = false, genPaths = false) {
       var _a;
-      let minDist = Infinity;
+      let minDist = Number.MAX_SAFE_INTEGER;
       let minDest = void 0;
       let minPath = [];
       const paths = [];
@@ -6503,7 +6455,7 @@ var dataStructureTyped = (() => {
       if (!srcVertex) return void 0;
       for (const vertex of vertexMap) {
         const vertexOrKey = vertex[1];
-        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Infinity);
+        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Number.MAX_SAFE_INTEGER);
       }
       const heap = new Heap([], { comparator: (a, b) => a.key - b.key });
       heap.add({ key: 0, value: srcVertex });
@@ -6534,7 +6486,7 @@ var dataStructureTyped = (() => {
             seen.add(cur);
             if (destVertex && destVertex === cur) {
               if (getMinDist) {
-                minDist = distMap.get(destVertex) || Infinity;
+                minDist = distMap.get(destVertex) || Number.MAX_SAFE_INTEGER;
               }
               if (genPaths) {
                 getPaths(destVertex);
@@ -6600,7 +6552,7 @@ var dataStructureTyped = (() => {
       const paths = [];
       const distMap = /* @__PURE__ */ new Map();
       const preMap = /* @__PURE__ */ new Map();
-      let min = Infinity;
+      let min = Number.MAX_SAFE_INTEGER;
       let minPath = [];
       let hasNegativeCycle;
       if (scanNegativeCycle) hasNegativeCycle = false;
@@ -6610,7 +6562,7 @@ var dataStructureTyped = (() => {
       const edgeMap = this.edgeSet();
       const numOfEdges = edgeMap.length;
       this._vertexMap.forEach((vertex) => {
-        distMap.set(vertex, Infinity);
+        distMap.set(vertex, Number.MAX_SAFE_INTEGER);
       });
       distMap.set(srcVertex, 0);
       for (let i = 1; i < numOfVertices; ++i) {
@@ -6622,7 +6574,7 @@ var dataStructureTyped = (() => {
             const sWeight = distMap.get(s);
             const dWeight = distMap.get(d);
             if (sWeight !== void 0 && dWeight !== void 0) {
-              if (distMap.get(s) !== Infinity && sWeight + weight < dWeight) {
+              if (distMap.get(s) !== Number.MAX_SAFE_INTEGER && sWeight + weight < dWeight) {
                 distMap.set(d, sWeight + weight);
                 if (genPath) preMap.set(d, s);
               }
@@ -6664,7 +6616,7 @@ var dataStructureTyped = (() => {
           const weight = edgeMap[j].weight;
           const sWeight = distMap.get(s);
           if (sWeight) {
-            if (sWeight !== Infinity && sWeight + weight < sWeight) hasNegativeCycle = true;
+            if (sWeight !== Number.MAX_SAFE_INTEGER && sWeight + weight < sWeight) hasNegativeCycle = true;
           }
         }
       }
@@ -6712,7 +6664,7 @@ var dataStructureTyped = (() => {
       }
       for (let i = 0; i < n; i++) {
         for (let j = 0; j < n; j++) {
-          costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Infinity;
+          costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Number.MAX_SAFE_INTEGER;
         }
       }
       for (let k = 0; k < n; k++) {
@@ -8914,11 +8866,11 @@ var dataStructureTyped = (() => {
         };
         return callback(dfs(startNode));
       } else {
-        const dfs = trampoline((cur) => {
+        const dfs = (cur) => {
           if (!this.isRealNode(cur.left)) return cur;
-          return dfs.cont(cur.left);
-        });
-        return callback(dfs(startNode));
+          return () => dfs(cur.left);
+        };
+        return callback(trampoline(() => dfs(startNode)));
       }
     }
     /**
@@ -8954,11 +8906,11 @@ var dataStructureTyped = (() => {
         };
         return callback(dfs(startNode));
       } else {
-        const dfs = trampoline((cur) => {
+        const dfs = (cur) => {
           if (!this.isRealNode(cur.right)) return cur;
-          return dfs.cont(cur.right);
-        });
-        return callback(dfs(startNode));
+          return () => dfs(cur.right);
+        };
+        return callback(trampoline(() => dfs(startNode)));
       }
     }
     /**