@rxflow/base 0.0.2-alpha.8 → 0.0.2

package/cjs/edges/manhattan.d.ts

@@ -2,7 +2,7 @@
  * @author: yanxianliang
  * @date: 2025-10-20 09:19
  * @modified：2025/10/20 09:19 by yanxianliang
- * @desc: 智能边
+ * @desc: 智能边 - 默认使用 Web Worker 计算
  *
  * Copyright (c) 2025 by yanxianliang, All Rights Reserved.
  */

package/cjs/edges/manhattan.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"manhattan.d.ts","sourceRoot":"","sources":["manhattan.tsx"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAW,KAAK,SAAS,EAAc,MAAM,eAAe,CAAC;AACpE,OAAO,EAAC,aAAa,EAAO,MAAM,OAAO,CAAC;AAG1C,eAAO,MAAM,aAAa,EAAE,aAAa,CAAC,SAAS,CAyCjD,CAAA"}
+{"version":3,"file":"manhattan.d.ts","sourceRoot":"","sources":["manhattan.tsx"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAW,KAAK,SAAS,EAAc,MAAM,eAAe,CAAC;AACpE,OAAO,EAAC,aAAa,EAAoC,MAAM,OAAO,CAAC;AAgGvE,eAAO,MAAM,aAAa,EAAE,aAAa,CAAC,SAAS,CA0IjD,CAAA"}

package/cjs/edges/manhattan.js

@@ -7,17 +7,96 @@ exports.ManhattanEdge = void 0;
 var _react = require("@xyflow/react");
 var _react2 = require("react");
 var _manhattan = require("@rxflow/manhattan");
+var _comlink = require("comlink");
 var _jsxRuntime = require("react/jsx-runtime");
 /**
  * @author: yanxianliang
  * @date: 2025-10-20 09:19
  * @modified：2025/10/20 09:19 by yanxianliang
- * @desc: 智能边
+ * @desc: 智能边 - 默认使用 Web Worker 计算
  *
  * Copyright (c) 2025 by yanxianliang, All Rights Reserved.
  */
 
+// 全局 Worker 实例（单例）
+let workerInstance = null;
+let workerApi = null;
+
+// 获取或创建 Worker
+function getWorker() {
+  if (typeof window === 'undefined') return null; // SSR 环境
+
+  if (!workerInstance || !workerApi) {
+    try {
+      workerInstance = new Worker(new URL('../workers/manhattan.worker.ts', import.meta.url), {
+        type: 'module'
+      });
+      workerApi = (0, _comlink.wrap)(workerInstance);
+    } catch (error) {
+      console.warn('[ManhattanEdge] Worker initialization failed, using main thread:', error);
+      return null;
+    }
+  }
+  return workerApi;
+}
+
+// 全局性能统计
+const perfStats = {
+  totalEdges: 0,
+  completedEdges: 0,
+  totalTime: 0,
+  maxTime: 0,
+  minTime: Infinity,
+  startTime: 0,
+  cacheHits: 0,
+  cacheMisses: 0,
+  workerCalculations: 0,
+  mainThreadCalculations: 0
+};
+
+// 生成缓存 key
+function generateCacheKey(sourceX, sourceY, targetX, targetY, sourcePosition, targetPosition) {
+  const sx = Math.round(sourceX * 10) / 10;
+  const sy = Math.round(sourceY * 10) / 10;
+  const tx = Math.round(targetX * 10) / 10;
+  const ty = Math.round(targetY * 10) / 10;
+  return `${sx}-${sy}-${tx}-${ty}-${sourcePosition}-${targetPosition}`;
+}
+
+// 重置统计
+function resetPerfStats() {
+  perfStats.totalEdges = 0;
+  perfStats.completedEdges = 0;
+  perfStats.totalTime = 0;
+  perfStats.maxTime = 0;
+  perfStats.minTime = Infinity;
+  perfStats.startTime = performance.now();
+  perfStats.cacheHits = 0;
+  perfStats.cacheMisses = 0;
+  perfStats.workerCalculations = 0;
+  perfStats.mainThreadCalculations = 0;
+}
+
+// 打印统计
+function logPerfStats() {
+  const totalDuration = performance.now() - perfStats.startTime;
+  const cacheHitRate = perfStats.totalEdges > 0 ? (perfStats.cacheHits / perfStats.totalEdges * 100).toFixed(1) : '0';
+  console.log('=== Manhattan Edge Performance Stats ===');
+  console.log(`Total edges: ${perfStats.totalEdges}`);
+  console.log(`Completed: ${perfStats.completedEdges}`);
+  console.log(`Cache hits: ${perfStats.cacheHits} (${cacheHitRate}%)`);
+  console.log(`Cache misses: ${perfStats.cacheMisses}`);
+  console.log(`Worker calculations: ${perfStats.workerCalculations}`);
+  console.log(`Main thread calculations: ${perfStats.mainThreadCalculations}`);
+  console.log(`Total calculation time: ${perfStats.totalTime.toFixed(2)}ms`);
+  console.log(`Average time per edge: ${(perfStats.totalTime / perfStats.completedEdges).toFixed(2)}ms`);
+  console.log(`Max time: ${perfStats.maxTime.toFixed(2)}ms`);
+  console.log(`Min time: ${perfStats.minTime.toFixed(2)}ms`);
+  console.log(`Total elapsed time: ${totalDuration.toFixed(2)}ms`);
+  console.log('========================================');
+}
 const ManhattanEdge = exports.ManhattanEdge = /*#__PURE__*/(0, _react2.memo)(({
+  id,
   source,
   target,
   sourceX,
@@ -30,30 +109,108 @@ const ManhattanEdge = exports.ManhattanEdge = /*#__PURE__*/(0, _react2.memo)(({
   const {
     getState
   } = (0, _react.useStoreApi)();
-  const nodeLookup = getState().nodeLookup;
-  const path = (0, _manhattan.getManHattanPath)({
-    sourceNodeId: source,
-    targetNodeId: target,
-    sourceX,
-    sourceY,
-    sourcePosition,
-    targetX,
-    targetY,
-    targetPosition,
-    //
-    // sourcePosition: {
-    //   x: sourceX,
-    //   y: sourceY
-    // },
-    // targetPosition: {
-    //   x: targetX,
-    //   y: targetY
-    // },
-    nodeLookup: nodeLookup
-    // options: {
-    //   padding: 10
-    // }
-  });
+  const [path, setPath] = (0, _react2.useState)('');
+  const isMountedRef = (0, _react2.useRef)(true);
+  (0, _react2.useEffect)(() => {
+    isMountedRef.current = true;
+
+    // 第一个边开始计算时重置统计
+    if (perfStats.totalEdges === 0) {
+      resetPerfStats();
+    }
+    perfStats.totalEdges++;
+    const state = getState();
+    const {
+      edgeLookup,
+      nodeLookup
+    } = state;
+
+    // 获取当前 edge 对象
+    const currentEdge = edgeLookup.get(id);
+
+    // 生成缓存 key
+    const cacheKey = generateCacheKey(sourceX, sourceY, targetX, targetY, sourcePosition, targetPosition);
+
+    // 检查缓存
+    const cachedData = currentEdge?.data?.__manhattanPathCache;
+    if (cachedData && cachedData.key === cacheKey) {
+      perfStats.cacheHits++;
+      perfStats.completedEdges++;
+      setPath(cachedData.path);
+      if (perfStats.completedEdges === perfStats.totalEdges) {
+        logPerfStats();
+      }
+      return;
+    }
+    perfStats.cacheMisses++;
+    const calculatePath = async () => {
+      if (!isMountedRef.current) return;
+      const startTime = performance.now();
+      let calculatedPath;
+      const params = {
+        sourceNodeId: source,
+        targetNodeId: target,
+        sourceX,
+        sourceY,
+        sourcePosition,
+        targetX,
+        targetY,
+        targetPosition,
+        nodeLookup: nodeLookup
+      };
+
+      // 尝试使用 Worker，失败则回退到主线程
+      const worker = getWorker();
+      try {
+        if (worker) {
+          perfStats.workerCalculations++;
+          calculatedPath = await worker.calculatePath(params);
+        } else {
+          perfStats.mainThreadCalculations++;
+          calculatedPath = (0, _manhattan.getManHattanPath)(params);
+        }
+      } catch (error) {
+        // Fallback 到主线程
+        perfStats.mainThreadCalculations++;
+        calculatedPath = (0, _manhattan.getManHattanPath)(params);
+      }
+      const endTime = performance.now();
+      const duration = endTime - startTime;
+
+      // 更新统计
+      perfStats.completedEdges++;
+      perfStats.totalTime += duration;
+      perfStats.maxTime = Math.max(perfStats.maxTime, duration);
+      perfStats.minTime = Math.min(perfStats.minTime, duration);
+
+      // 缓存结果
+      if (currentEdge) {
+        if (!currentEdge.data) {
+          currentEdge.data = {};
+        }
+        currentEdge.data.__manhattanPathCache = {
+          key: cacheKey,
+          path: calculatedPath,
+          timestamp: Date.now()
+        };
+      }
+      if (isMountedRef.current) {
+        setPath(calculatedPath);
+      }
+      if (perfStats.completedEdges === perfStats.totalEdges) {
+        logPerfStats();
+      }
+    };
+
+    // 直接执行异步计算（Worker 已经是异步的）
+    calculatePath();
+    return () => {
+      isMountedRef.current = false;
+    };
+  }, [id, source, target, sourceX, sourceY, targetX, targetY, sourcePosition, targetPosition, getState]);
+  if (!path) {
+    return null;
+  }
   return /*#__PURE__*/(0, _jsxRuntime.jsx)(_react.BaseEdge, {
     path: path
   });

package/cjs/workers/manhattan.worker.d.ts

@@ -0,0 +1,21 @@
+import { type GetManHattanPathParams } from '@rxflow/manhattan';
+/**
+ * Worker 中的 Manhattan 路径计算服务
+ */
+declare const manhattanWorker: {
+    /**
+     * 计算单条边的路径
+     */
+    calculatePath(params: GetManHattanPathParams): Promise<string>;
+    /**
+     * 批量计算多条边的路径
+     */
+    calculatePaths(paramsArray: GetManHattanPathParams[]): Promise<Array<{
+        id: string;
+        path: string;
+        error?: string;
+    }>>;
+};
+export type ManhattanWorkerType = typeof manhattanWorker;
+export {};
+//# sourceMappingURL=manhattan.worker.d.ts.map

package/cjs/workers/manhattan.worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"manhattan.worker.d.ts","sourceRoot":"","sources":["manhattan.worker.ts"],"names":[],"mappings":"AAKA,OAAO,EAAoB,KAAK,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAElF;;GAEG;AACH,QAAA,MAAM,eAAe;IACnB;;OAEG;0BACyB,sBAAsB,GAAG,QAAQ,MAAM,CAAC;IAIpE;;OAEG;gCAEY,sBAAsB,EAAE,GACpC,QAAQ,MAAM;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAiBhE,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG,OAAO,eAAe,CAAC"}

package/cjs/workers/manhattan.worker.js

@@ -0,0 +1,41 @@
+"use strict";
+
+var _comlink = require("comlink");
+var _manhattan = require("@rxflow/manhattan");
+/**
+ * Manhattan 路径计算 Worker
+ * 使用 Comlink 暴露计算接口
+ */
+
+/**
+ * Worker 中的 Manhattan 路径计算服务
+ */
+const manhattanWorker = {
+  /**
+   * 计算单条边的路径
+   */
+  async calculatePath(params) {
+    return (0, _manhattan.getManHattanPath)(params);
+  },
+  /**
+   * 批量计算多条边的路径
+   */
+  async calculatePaths(paramsArray) {
+    return paramsArray.map((params, index) => {
+      try {
+        const path = (0, _manhattan.getManHattanPath)(params);
+        return {
+          id: `${params.sourceNodeId}-${params.targetNodeId}`,
+          path
+        };
+      } catch (error) {
+        return {
+          id: `${params.sourceNodeId}-${params.targetNodeId}`,
+          path: '',
+          error: error instanceof Error ? error.message : 'Unknown error'
+        };
+      }
+    });
+  }
+};
+(0, _comlink.expose)(manhattanWorker);

package/esm/edges/manhattan.d.ts

@@ -2,7 +2,7 @@
  * @author: yanxianliang
  * @date: 2025-10-20 09:19
  * @modified：2025/10/20 09:19 by yanxianliang
- * @desc: 智能边
+ * @desc: 智能边 - 默认使用 Web Worker 计算
  *
  * Copyright (c) 2025 by yanxianliang, All Rights Reserved.
  */

package/esm/edges/manhattan.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"manhattan.d.ts","sourceRoot":"","sources":["manhattan.tsx"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAW,KAAK,SAAS,EAAc,MAAM,eAAe,CAAC;AACpE,OAAO,EAAC,aAAa,EAAO,MAAM,OAAO,CAAC;AAG1C,eAAO,MAAM,aAAa,EAAE,aAAa,CAAC,SAAS,CAyCjD,CAAA"}
+{"version":3,"file":"manhattan.d.ts","sourceRoot":"","sources":["manhattan.tsx"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAW,KAAK,SAAS,EAAc,MAAM,eAAe,CAAC;AACpE,OAAO,EAAC,aAAa,EAAoC,MAAM,OAAO,CAAC;AAgGvE,eAAO,MAAM,aAAa,EAAE,aAAa,CAAC,SAAS,CA0IjD,CAAA"}

package/esm/edges/manhattan.js

@@ -1,17 +1,106 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
+function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
+function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
 /**
  * @author: yanxianliang
  * @date: 2025-10-20 09:19
  * @modified：2025/10/20 09:19 by yanxianliang
- * @desc: 智能边
+ * @desc: 智能边 - 默认使用 Web Worker 计算
  *
  * Copyright (c) 2025 by yanxianliang, All Rights Reserved.
  */
 import { BaseEdge, useStoreApi } from '@xyflow/react';
-import { memo } from "react";
+import { memo, useState, useEffect, useRef } from "react";
 import { getManHattanPath } from '@rxflow/manhattan';
+import { wrap } from 'comlink';
 import { jsx as _jsx } from "react/jsx-runtime";
+// 全局 Worker 实例（单例）
+var workerInstance = null;
+var workerApi = null;
+
+// 获取或创建 Worker
+function getWorker() {
+  if (typeof window === 'undefined') return null; // SSR 环境
+
+  if (!workerInstance || !workerApi) {
+    try {
+      workerInstance = new Worker(new URL('../workers/manhattan.worker.ts', import.meta.url), {
+        type: 'module'
+      });
+      workerApi = wrap(workerInstance);
+    } catch (error) {
+      console.warn('[ManhattanEdge] Worker initialization failed, using main thread:', error);
+      return null;
+    }
+  }
+  return workerApi;
+}
+
+// 全局性能统计
+var perfStats = {
+  totalEdges: 0,
+  completedEdges: 0,
+  totalTime: 0,
+  maxTime: 0,
+  minTime: Infinity,
+  startTime: 0,
+  cacheHits: 0,
+  cacheMisses: 0,
+  workerCalculations: 0,
+  mainThreadCalculations: 0
+};
+
+// 生成缓存 key
+function generateCacheKey(sourceX, sourceY, targetX, targetY, sourcePosition, targetPosition) {
+  var sx = Math.round(sourceX * 10) / 10;
+  var sy = Math.round(sourceY * 10) / 10;
+  var tx = Math.round(targetX * 10) / 10;
+  var ty = Math.round(targetY * 10) / 10;
+  return "".concat(sx, "-").concat(sy, "-").concat(tx, "-").concat(ty, "-").concat(sourcePosition, "-").concat(targetPosition);
+}
+
+// 重置统计
+function resetPerfStats() {
+  perfStats.totalEdges = 0;
+  perfStats.completedEdges = 0;
+  perfStats.totalTime = 0;
+  perfStats.maxTime = 0;
+  perfStats.minTime = Infinity;
+  perfStats.startTime = performance.now();
+  perfStats.cacheHits = 0;
+  perfStats.cacheMisses = 0;
+  perfStats.workerCalculations = 0;
+  perfStats.mainThreadCalculations = 0;
+}
+
+// 打印统计
+function logPerfStats() {
+  var totalDuration = performance.now() - perfStats.startTime;
+  var cacheHitRate = perfStats.totalEdges > 0 ? (perfStats.cacheHits / perfStats.totalEdges * 100).toFixed(1) : '0';
+  console.log('=== Manhattan Edge Performance Stats ===');
+  console.log("Total edges: ".concat(perfStats.totalEdges));
+  console.log("Completed: ".concat(perfStats.completedEdges));
+  console.log("Cache hits: ".concat(perfStats.cacheHits, " (").concat(cacheHitRate, "%)"));
+  console.log("Cache misses: ".concat(perfStats.cacheMisses));
+  console.log("Worker calculations: ".concat(perfStats.workerCalculations));
+  console.log("Main thread calculations: ".concat(perfStats.mainThreadCalculations));
+  console.log("Total calculation time: ".concat(perfStats.totalTime.toFixed(2), "ms"));
+  console.log("Average time per edge: ".concat((perfStats.totalTime / perfStats.completedEdges).toFixed(2), "ms"));
+  console.log("Max time: ".concat(perfStats.maxTime.toFixed(2), "ms"));
+  console.log("Min time: ".concat(perfStats.minTime.toFixed(2), "ms"));
+  console.log("Total elapsed time: ".concat(totalDuration.toFixed(2), "ms"));
+  console.log('========================================');
+}
 export var ManhattanEdge = /*#__PURE__*/memo(function (_ref) {
-  var source = _ref.source,
+  var id = _ref.id,
+    source = _ref.source,
     target = _ref.target,
     sourceX = _ref.sourceX,
     sourceY = _ref.sourceY,
@@ -21,30 +110,136 @@ export var ManhattanEdge = /*#__PURE__*/memo(function (_ref) {
     targetPosition = _ref.targetPosition;
   var _useStoreApi = useStoreApi(),
     getState = _useStoreApi.getState;
-  var nodeLookup = getState().nodeLookup;
-  var path = getManHattanPath({
-    sourceNodeId: source,
-    targetNodeId: target,
-    sourceX: sourceX,
-    sourceY: sourceY,
-    sourcePosition: sourcePosition,
-    targetX: targetX,
-    targetY: targetY,
-    targetPosition: targetPosition,
-    //
-    // sourcePosition: {
-    //   x: sourceX,
-    //   y: sourceY
-    // },
-    // targetPosition: {
-    //   x: targetX,
-    //   y: targetY
-    // },
-    nodeLookup: nodeLookup
-    // options: {
-    //   padding: 10
-    // }
-  });
+  var _useState = useState(''),
+    _useState2 = _slicedToArray(_useState, 2),
+    path = _useState2[0],
+    setPath = _useState2[1];
+  var isMountedRef = useRef(true);
+  useEffect(function () {
+    var _currentEdge$data;
+    isMountedRef.current = true;
+
+    // 第一个边开始计算时重置统计
+    if (perfStats.totalEdges === 0) {
+      resetPerfStats();
+    }
+    perfStats.totalEdges++;
+    var state = getState();
+    var edgeLookup = state.edgeLookup,
+      nodeLookup = state.nodeLookup;
+
+    // 获取当前 edge 对象
+    var currentEdge = edgeLookup.get(id);
+
+    // 生成缓存 key
+    var cacheKey = generateCacheKey(sourceX, sourceY, targetX, targetY, sourcePosition, targetPosition);
+
+    // 检查缓存
+    var cachedData = currentEdge === null || currentEdge === void 0 || (_currentEdge$data = currentEdge.data) === null || _currentEdge$data === void 0 ? void 0 : _currentEdge$data.__manhattanPathCache;
+    if (cachedData && cachedData.key === cacheKey) {
+      perfStats.cacheHits++;
+      perfStats.completedEdges++;
+      setPath(cachedData.path);
+      if (perfStats.completedEdges === perfStats.totalEdges) {
+        logPerfStats();
+      }
+      return;
+    }
+    perfStats.cacheMisses++;
+    var calculatePath = /*#__PURE__*/function () {
+      var _ref2 = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+        var startTime, calculatedPath, params, worker, endTime, duration;
+        return _regeneratorRuntime().wrap(function _callee$(_context) {
+          while (1) switch (_context.prev = _context.next) {
+            case 0:
+              if (isMountedRef.current) {
+                _context.next = 2;
+                break;
+              }
+              return _context.abrupt("return");
+            case 2:
+              startTime = performance.now();
+              params = {
+                sourceNodeId: source,
+                targetNodeId: target,
+                sourceX: sourceX,
+                sourceY: sourceY,
+                sourcePosition: sourcePosition,
+                targetX: targetX,
+                targetY: targetY,
+                targetPosition: targetPosition,
+                nodeLookup: nodeLookup
+              }; // 尝试使用 Worker，失败则回退到主线程
+              worker = getWorker();
+              _context.prev = 5;
+              if (!worker) {
+                _context.next = 13;
+                break;
+              }
+              perfStats.workerCalculations++;
+              _context.next = 10;
+              return worker.calculatePath(params);
+            case 10:
+              calculatedPath = _context.sent;
+              _context.next = 15;
+              break;
+            case 13:
+              perfStats.mainThreadCalculations++;
+              calculatedPath = getManHattanPath(params);
+            case 15:
+              _context.next = 21;
+              break;
+            case 17:
+              _context.prev = 17;
+              _context.t0 = _context["catch"](5);
+              // Fallback 到主线程
+              perfStats.mainThreadCalculations++;
+              calculatedPath = getManHattanPath(params);
+            case 21:
+              endTime = performance.now();
+              duration = endTime - startTime; // 更新统计
+              perfStats.completedEdges++;
+              perfStats.totalTime += duration;
+              perfStats.maxTime = Math.max(perfStats.maxTime, duration);
+              perfStats.minTime = Math.min(perfStats.minTime, duration);
+
+              // 缓存结果
+              if (currentEdge) {
+                if (!currentEdge.data) {
+                  currentEdge.data = {};
+                }
+                currentEdge.data.__manhattanPathCache = {
+                  key: cacheKey,
+                  path: calculatedPath,
+                  timestamp: Date.now()
+                };
+              }
+              if (isMountedRef.current) {
+                setPath(calculatedPath);
+              }
+              if (perfStats.completedEdges === perfStats.totalEdges) {
+                logPerfStats();
+              }
+            case 30:
+            case "end":
+              return _context.stop();
+          }
+        }, _callee, null, [[5, 17]]);
+      }));
+      return function calculatePath() {
+        return _ref2.apply(this, arguments);
+      };
+    }();
+
+    // 直接执行异步计算（Worker 已经是异步的）
+    calculatePath();
+    return function () {
+      isMountedRef.current = false;
+    };
+  }, [id, source, target, sourceX, sourceY, targetX, targetY, sourcePosition, targetPosition, getState]);
+  if (!path) {
+    return null;
+  }
   return /*#__PURE__*/_jsx(BaseEdge, {
     path: path
   });

package/esm/workers/manhattan.worker.d.ts

@@ -0,0 +1,21 @@
+import { type GetManHattanPathParams } from '@rxflow/manhattan';
+/**
+ * Worker 中的 Manhattan 路径计算服务
+ */
+declare const manhattanWorker: {
+    /**
+     * 计算单条边的路径
+     */
+    calculatePath(params: GetManHattanPathParams): Promise<string>;
+    /**
+     * 批量计算多条边的路径
+     */
+    calculatePaths(paramsArray: GetManHattanPathParams[]): Promise<Array<{
+        id: string;
+        path: string;
+        error?: string;
+    }>>;
+};
+export type ManhattanWorkerType = typeof manhattanWorker;
+export {};
+//# sourceMappingURL=manhattan.worker.d.ts.map

package/esm/workers/manhattan.worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"manhattan.worker.d.ts","sourceRoot":"","sources":["manhattan.worker.ts"],"names":[],"mappings":"AAKA,OAAO,EAAoB,KAAK,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAElF;;GAEG;AACH,QAAA,MAAM,eAAe;IACnB;;OAEG;0BACyB,sBAAsB,GAAG,QAAQ,MAAM,CAAC;IAIpE;;OAEG;gCAEY,sBAAsB,EAAE,GACpC,QAAQ,MAAM;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAiBhE,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG,OAAO,eAAe,CAAC"}

package/esm/workers/manhattan.worker.js

@@ -0,0 +1,63 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+/**
+ * Manhattan 路径计算 Worker
+ * 使用 Comlink 暴露计算接口
+ */
+import { expose } from 'comlink';
+import { getManHattanPath } from '@rxflow/manhattan';
+
+/**
+ * Worker 中的 Manhattan 路径计算服务
+ */
+var manhattanWorker = {
+  /**
+   * 计算单条边的路径
+   */
+  calculatePath: function calculatePath(params) {
+    return _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+      return _regeneratorRuntime().wrap(function _callee$(_context) {
+        while (1) switch (_context.prev = _context.next) {
+          case 0:
+            return _context.abrupt("return", getManHattanPath(params));
+          case 1:
+          case "end":
+            return _context.stop();
+        }
+      }, _callee);
+    }))();
+  },
+  /**
+   * 批量计算多条边的路径
+   */
+  calculatePaths: function calculatePaths(paramsArray) {
+    return _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee2() {
+      return _regeneratorRuntime().wrap(function _callee2$(_context2) {
+        while (1) switch (_context2.prev = _context2.next) {
+          case 0:
+            return _context2.abrupt("return", paramsArray.map(function (params, index) {
+              try {
+                var path = getManHattanPath(params);
+                return {
+                  id: "".concat(params.sourceNodeId, "-").concat(params.targetNodeId),
+                  path: path
+                };
+              } catch (error) {
+                return {
+                  id: "".concat(params.sourceNodeId, "-").concat(params.targetNodeId),
+                  path: '',
+                  error: error instanceof Error ? error.message : 'Unknown error'
+                };
+              }
+            }));
+          case 1:
+          case "end":
+            return _context2.stop();
+        }
+      }, _callee2);
+    }))();
+  }
+};
+expose(manhattanWorker);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rxflow/base",
-  "version": "0.0.2-alpha.8",
+  "version": "0.0.2",
   "description": "BaseFlow - 核心 Flow 组件库",
   "keywords": [
     "reactflow",
@@ -42,7 +42,7 @@
   "dependencies": {
     "@ant-design/icons": "^6.0.0",
     "@antv/hierarchy": "0.6.14",
-    "@rxflow/manhattan": "^0.0.2-alpha.8",
+    "@rxflow/manhattan": "^0.0.2",
     "@xyflow/react": "^12.8.6",
     "@xyflow/system": "^0.0.70",
     "@zumer/snapdom": "^1.9.9",