@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/@antv/g6/esm/utils/pinch.js

@@ -0,0 +1,130 @@
+import "../constants/change.js";
+import "../constants/events/animation.js";
+import "../constants/events/canvas.js";
+import "../constants/events/combo.js";
+import { CommonEvent as r } from "../constants/events/common.js";
+import "../constants/events/container.js";
+import "../constants/events/edge.js";
+import "../constants/events/graph.js";
+import "../constants/events/history.js";
+import "../constants/events/node.js";
+import "../constants/registry.js";
+class i {
+  constructor(t, o, n) {
+    if (this.phase = o, this.pointerByTouch = [], this.initialDistance = null, this.emitter = t, i.instance)
+      return i.callbacks[this.phase].push(n), i.instance;
+    this.onPointerDown = this.onPointerDown.bind(this), this.onPointerMove = this.onPointerMove.bind(this), this.onPointerUp = this.onPointerUp.bind(this), this.bindEvents(), i.instance = this, i.callbacks[this.phase].push(n);
+  }
+  bindEvents() {
+    const { emitter: t } = this;
+    t.on(r.POINTER_DOWN, this.onPointerDown), t.on(r.POINTER_MOVE, this.onPointerMove), t.on(r.POINTER_UP, this.onPointerUp);
+  }
+  /**
+   * <zh/> 更新指定指针的位置
+   *
+   * <en/> Update position of specified pointer
+   * @param pointerId - <zh/> 指针唯一标识符 | <en/> Pointer unique identifier<sup>1</sup>
+   * @param x - <zh/> 新的X坐标 | <en/> New X coordinate
+   * @param y - <zh/> 新的Y坐标 | <en/> New Y coordinate
+   */
+  updatePointerPosition(t, o, n) {
+    const s = this.pointerByTouch.findIndex((e) => e.pointerId === t);
+    s >= 0 && (this.pointerByTouch[s] = { x: o, y: n, pointerId: t });
+  }
+  /**
+   * <zh/> 处理指针按下事件
+   *
+   * <en/> Handle pointer down event
+   * @param event - <zh/> 指针事件对象 | <en/> Pointer event object
+   * @remarks
+   * <zh/> 当检测到两个触摸点时记录初始距离
+   *
+   * <en/> Record initial distance when detecting two touch points
+   */
+  onPointerDown(t) {
+    const { x: o, y: n } = t.client || {};
+    if (!(o === void 0 || n === void 0) && (this.pointerByTouch.push({ x: o, y: n, pointerId: t.pointerId }), t.pointerType === "touch" && this.pointerByTouch.length === 2)) {
+      i.isPinching = !0;
+      const s = this.pointerByTouch[0].x - this.pointerByTouch[1].x, e = this.pointerByTouch[0].y - this.pointerByTouch[1].y;
+      this.initialDistance = Math.sqrt(s * s + e * e), i.callbacks.pinchstart.forEach((h) => h(t, { scale: 0 }));
+    }
+  }
+  /**
+   * <zh/> 处理指针移动事件
+   *
+   * <en/> Handle pointer move event
+   * @param event - <zh/> 指针事件对象 | <en/> Pointer event object
+   * @remarks
+   * <zh/> 当存在两个有效触摸点时计算缩放比例
+   *
+   * <en/> Calculate zoom ratio when two valid touch points exist
+   */
+  onPointerMove(t) {
+    if (this.pointerByTouch.length !== 2 || this.initialDistance === null)
+      return;
+    const { x: o, y: n } = t.client || {};
+    if (o === void 0 || n === void 0)
+      return;
+    this.updatePointerPosition(t.pointerId, o, n);
+    const s = this.pointerByTouch[0].x - this.pointerByTouch[1].x, e = this.pointerByTouch[0].y - this.pointerByTouch[1].y, c = Math.sqrt(s * s + e * e) / this.initialDistance;
+    i.callbacks.pinchmove.forEach((p) => p(t, { scale: (c - 1) * 5 }));
+  }
+  /**
+   * <zh/> 处理指针抬起事件
+   *
+   * <en/> Handle pointer up event
+   * @param event
+   * @remarks
+   * <zh/> 重置触摸状态和初始距离
+   *
+   * <en/> Reset touch state and initial distance
+   */
+  onPointerUp(t) {
+    var o;
+    i.callbacks.pinchend.forEach((n) => n(t, { scale: 0 })), i.isPinching = !1, this.initialDistance = null, this.pointerByTouch = [], (o = i.instance) === null || o === void 0 || o.tryDestroy();
+  }
+  /**
+   * <zh/> 销毁捏合手势相关监听
+   *
+   * <en/> Destroy pinch gesture listeners
+   * @remarks
+   * <zh/> 移除指针按下、移动、抬起事件的监听
+   *
+   * <en/> Remove listeners for pointer down, move, and up events
+   */
+  destroy() {
+    this.emitter.off(r.POINTER_DOWN, this.onPointerDown), this.emitter.off(r.POINTER_MOVE, this.onPointerMove), this.emitter.off(r.POINTER_UP, this.onPointerUp), i.instance = null;
+  }
+  /**
+   * <zh/> 解绑指定阶段的手势回调
+   * <en/> Unregister gesture callback for specific phase
+   * @param phase - <zh/> 手势阶段：开始(pinchstart)/移动(pinchmove)/结束(pinchend) | <en/> Gesture phase: start/move/end
+   * @param callback - <zh/> 要解绑的回调函数 | <en/> Callback function to unregister
+   * @remarks
+   * <zh/> 从指定阶段的回调列表中移除特定回调，当所有回调都解绑后自动销毁事件监听
+   * <en/> Remove specific callback from the phase's callback list, auto-destroy event listeners when all callbacks are unregistered
+   */
+  off(t, o) {
+    const n = i.callbacks[t].indexOf(o);
+    n > -1 && i.callbacks[t].splice(n, 1), this.tryDestroy();
+  }
+  /**
+   * <zh/> 尝试销毁手势处理器
+   * <en/> Attempt to destroy the gesture handler
+   * @remarks
+   * <zh/> 当所有阶段（开始/移动/结束）的回调列表都为空时，执行实际销毁操作
+   * <en/> Perform actual destruction when all phase (pinchstart/pinchmove/pinchend) callback lists are empty
+   * <zh/> 自动解除事件监听并重置单例实例
+   * <en/> Automatically remove event listeners and reset singleton instance
+   */
+  tryDestroy() {
+    Object.values(i.callbacks).every((t) => t.length === 0) && this.destroy();
+  }
+}
+i.isPinching = !1;
+i.instance = null;
+i.callbacks = { pinchstart: [], pinchmove: [], pinchend: [] };
+export {
+  i as PinchHandler
+};
+//# sourceMappingURL=pinch.js.map

package/dist/node_modules/@antv/g6/esm/utils/pinch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pinch.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/pinch.js"],"sourcesContent":["import { CommonEvent } from '../constants';\n/**\n * <zh/> 捏合手势处理器\n *\n * <en/> Pinch gesture handler\n * @remarks\n * <zh/> 处理双指触摸事件，计算缩放比例并触发回调。通过跟踪两个触摸点的位置变化，计算两点间距离变化率来确定缩放比例。\n *\n * <en/> Handles two-finger touch events, calculates zoom ratio and triggers callbacks. Tracks position changes of two touch points to determine zoom ratio based on distance variation.\n */\nexport class PinchHandler {\n    constructor(emitter, phase, callback) {\n        this.phase = phase;\n        /**\n         * <zh/> 当前跟踪的触摸点集合\n         *\n         * <en/> Currently tracked touch points collection\n         */\n        this.pointerByTouch = [];\n        /**\n         * <zh/> 初始两点间距离\n         *\n         * <en/> Initial distance between two points\n         */\n        this.initialDistance = null;\n        this.emitter = emitter;\n        if (PinchHandler.instance) {\n            PinchHandler.callbacks[this.phase].push(callback);\n            return PinchHandler.instance;\n        }\n        this.onPointerDown = this.onPointerDown.bind(this);\n        this.onPointerMove = this.onPointerMove.bind(this);\n        this.onPointerUp = this.onPointerUp.bind(this);\n        this.bindEvents();\n        PinchHandler.instance = this;\n        PinchHandler.callbacks[this.phase].push(callback);\n    }\n    bindEvents() {\n        const { emitter } = this;\n        emitter.on(CommonEvent.POINTER_DOWN, this.onPointerDown);\n        emitter.on(CommonEvent.POINTER_MOVE, this.onPointerMove);\n        emitter.on(CommonEvent.POINTER_UP, this.onPointerUp);\n    }\n    /**\n     * <zh/> 更新指定指针的位置\n     *\n     * <en/> Update position of specified pointer\n     * @param pointerId - <zh/> 指针唯一标识符 | <en/> Pointer unique identifier<sup>1</sup>\n     * @param x - <zh/> 新的X坐标 | <en/> New X coordinate\n     * @param y - <zh/> 新的Y坐标 | <en/> New Y coordinate\n     */\n    updatePointerPosition(pointerId, x, y) {\n        const index = this.pointerByTouch.findIndex((p) => p.pointerId === pointerId);\n        if (index >= 0) {\n            this.pointerByTouch[index] = { x, y, pointerId };\n        }\n    }\n    /**\n     * <zh/> 处理指针按下事件\n     *\n     * <en/> Handle pointer down event\n     * @param event - <zh/> 指针事件对象 | <en/> Pointer event object\n     * @remarks\n     * <zh/> 当检测到两个触摸点时记录初始距离\n     *\n     * <en/> Record initial distance when detecting two touch points\n     */\n    onPointerDown(event) {\n        const { x, y } = event.client || {};\n        if (x === undefined || y === undefined)\n            return;\n        this.pointerByTouch.push({ x, y, pointerId: event.pointerId });\n        if (event.pointerType === 'touch' && this.pointerByTouch.length === 2) {\n            PinchHandler.isPinching = true;\n            const dx = this.pointerByTouch[0].x - this.pointerByTouch[1].x;\n            const dy = this.pointerByTouch[0].y - this.pointerByTouch[1].y;\n            this.initialDistance = Math.sqrt(dx * dx + dy * dy);\n            PinchHandler.callbacks.pinchstart.forEach((cb) => cb(event, { scale: 0 }));\n        }\n    }\n    /**\n     * <zh/> 处理指针移动事件\n     *\n     * <en/> Handle pointer move event\n     * @param event - <zh/> 指针事件对象 | <en/> Pointer event object\n     * @remarks\n     * <zh/> 当存在两个有效触摸点时计算缩放比例\n     *\n     * <en/> Calculate zoom ratio when two valid touch points exist\n     */\n    onPointerMove(event) {\n        if (this.pointerByTouch.length !== 2 || this.initialDistance === null)\n            return;\n        const { x, y } = event.client || {};\n        if (x === undefined || y === undefined)\n            return;\n        this.updatePointerPosition(event.pointerId, x, y);\n        const dx = this.pointerByTouch[0].x - this.pointerByTouch[1].x;\n        const dy = this.pointerByTouch[0].y - this.pointerByTouch[1].y;\n        const currentDistance = Math.sqrt(dx * dx + dy * dy);\n        const ratio = currentDistance / this.initialDistance;\n        PinchHandler.callbacks.pinchmove.forEach((cb) => cb(event, { scale: (ratio - 1) * 5 }));\n    }\n    /**\n     * <zh/> 处理指针抬起事件\n     *\n     * <en/> Handle pointer up event\n     * @param event\n     * @remarks\n     * <zh/> 重置触摸状态和初始距离\n     *\n     * <en/> Reset touch state and initial distance\n     */\n    onPointerUp(event) {\n        var _a;\n        PinchHandler.callbacks.pinchend.forEach((cb) => cb(event, { scale: 0 }));\n        PinchHandler.isPinching = false;\n        this.initialDistance = null;\n        this.pointerByTouch = [];\n        (_a = PinchHandler.instance) === null || _a === void 0 ? void 0 : _a.tryDestroy();\n    }\n    /**\n     * <zh/> 销毁捏合手势相关监听\n     *\n     * <en/> Destroy pinch gesture listeners\n     * @remarks\n     * <zh/> 移除指针按下、移动、抬起事件的监听\n     *\n     * <en/> Remove listeners for pointer down, move, and up events\n     */\n    destroy() {\n        this.emitter.off(CommonEvent.POINTER_DOWN, this.onPointerDown);\n        this.emitter.off(CommonEvent.POINTER_MOVE, this.onPointerMove);\n        this.emitter.off(CommonEvent.POINTER_UP, this.onPointerUp);\n        PinchHandler.instance = null;\n    }\n    /**\n     * <zh/> 解绑指定阶段的手势回调\n     * <en/> Unregister gesture callback for specific phase\n     * @param phase - <zh/> 手势阶段：开始(pinchstart)/移动(pinchmove)/结束(pinchend) | <en/> Gesture phase: start/move/end\n     * @param callback - <zh/> 要解绑的回调函数 | <en/> Callback function to unregister\n     * @remarks\n     * <zh/> 从指定阶段的回调列表中移除特定回调，当所有回调都解绑后自动销毁事件监听\n     * <en/> Remove specific callback from the phase's callback list, auto-destroy event listeners when all callbacks are unregistered\n     */\n    off(phase, callback) {\n        const index = PinchHandler.callbacks[phase].indexOf(callback);\n        if (index > -1)\n            PinchHandler.callbacks[phase].splice(index, 1);\n        this.tryDestroy();\n    }\n    /**\n     * <zh/> 尝试销毁手势处理器\n     * <en/> Attempt to destroy the gesture handler\n     * @remarks\n     * <zh/> 当所有阶段（开始/移动/结束）的回调列表都为空时，执行实际销毁操作\n     * <en/> Perform actual destruction when all phase (pinchstart/pinchmove/pinchend) callback lists are empty\n     * <zh/> 自动解除事件监听并重置单例实例\n     * <en/> Automatically remove event listeners and reset singleton instance\n     */\n    tryDestroy() {\n        if (Object.values(PinchHandler.callbacks).every((arr) => arr.length === 0)) {\n            this.destroy();\n        }\n    }\n}\n/**\n * <zh/> 是否处于 Pinch 阶段\n *\n * <en/> Whether it is in the Pinch stage\n */\nPinchHandler.isPinching = false;\nPinchHandler.instance = null;\nPinchHandler.callbacks = { pinchstart: [], pinchmove: [], pinchend: [] };\n//# sourceMappingURL=pinch.js.map"],"names":["PinchHandler","emitter","phase","callback","CommonEvent","pointerId","x","y","index","p","event","dx","dy","cb","ratio","_a","arr"],"mappings":";;;;;;;;;;;AAUO,MAAMA,EAAa;AAAA,EACtB,YAAYC,GAASC,GAAOC,GAAU;AAelC,QAdA,KAAK,QAAQD,GAMb,KAAK,iBAAiB,CAAA,GAMtB,KAAK,kBAAkB,MACvB,KAAK,UAAUD,GACXD,EAAa;AACb,aAAAA,EAAa,UAAU,KAAK,KAAK,EAAE,KAAKG,CAAQ,GACzCH,EAAa;AAExB,SAAK,gBAAgB,KAAK,cAAc,KAAK,IAAI,GACjD,KAAK,gBAAgB,KAAK,cAAc,KAAK,IAAI,GACjD,KAAK,cAAc,KAAK,YAAY,KAAK,IAAI,GAC7C,KAAK,WAAU,GACfA,EAAa,WAAW,MACxBA,EAAa,UAAU,KAAK,KAAK,EAAE,KAAKG,CAAQ;AAAA,EACpD;AAAA,EACA,aAAa;AACT,UAAM,EAAE,SAAAF,EAAO,IAAK;AACpB,IAAAA,EAAQ,GAAGG,EAAY,cAAc,KAAK,aAAa,GACvDH,EAAQ,GAAGG,EAAY,cAAc,KAAK,aAAa,GACvDH,EAAQ,GAAGG,EAAY,YAAY,KAAK,WAAW;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,sBAAsBC,GAAWC,GAAGC,GAAG;AACnC,UAAMC,IAAQ,KAAK,eAAe,UAAU,CAACC,MAAMA,EAAE,cAAcJ,CAAS;AAC5E,IAAIG,KAAS,MACT,KAAK,eAAeA,CAAK,IAAI,EAAE,GAAAF,GAAG,GAAAC,GAAG,WAAAF,EAAS;AAAA,EAEtD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,cAAcK,GAAO;AACjB,UAAM,EAAE,GAAAJ,GAAG,GAAAC,EAAC,IAAKG,EAAM,UAAU,CAAA;AACjC,QAAI,EAAAJ,MAAM,UAAaC,MAAM,YAE7B,KAAK,eAAe,KAAK,EAAE,GAAAD,GAAG,GAAAC,GAAG,WAAWG,EAAM,WAAW,GACzDA,EAAM,gBAAgB,WAAW,KAAK,eAAe,WAAW,IAAG;AACnE,MAAAV,EAAa,aAAa;AAC1B,YAAMW,IAAK,KAAK,eAAe,CAAC,EAAE,IAAI,KAAK,eAAe,CAAC,EAAE,GACvDC,IAAK,KAAK,eAAe,CAAC,EAAE,IAAI,KAAK,eAAe,CAAC,EAAE;AAC7D,WAAK,kBAAkB,KAAK,KAAKD,IAAKA,IAAKC,IAAKA,CAAE,GAClDZ,EAAa,UAAU,WAAW,QAAQ,CAACa,MAAOA,EAAGH,GAAO,EAAE,OAAO,EAAC,CAAE,CAAC;AAAA,IAC7E;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,cAAcA,GAAO;AACjB,QAAI,KAAK,eAAe,WAAW,KAAK,KAAK,oBAAoB;AAC7D;AACJ,UAAM,EAAE,GAAAJ,GAAG,GAAAC,EAAC,IAAKG,EAAM,UAAU,CAAA;AACjC,QAAIJ,MAAM,UAAaC,MAAM;AACzB;AACJ,SAAK,sBAAsBG,EAAM,WAAWJ,GAAGC,CAAC;AAChD,UAAMI,IAAK,KAAK,eAAe,CAAC,EAAE,IAAI,KAAK,eAAe,CAAC,EAAE,GACvDC,IAAK,KAAK,eAAe,CAAC,EAAE,IAAI,KAAK,eAAe,CAAC,EAAE,GAEvDE,IADkB,KAAK,KAAKH,IAAKA,IAAKC,IAAKA,CAAE,IACnB,KAAK;AACrC,IAAAZ,EAAa,UAAU,UAAU,QAAQ,CAACa,MAAOA,EAAGH,GAAO,EAAE,QAAQI,IAAQ,KAAK,EAAC,CAAE,CAAC;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAYJ,GAAO;AACf,QAAIK;AACJ,IAAAf,EAAa,UAAU,SAAS,QAAQ,CAACa,MAAOA,EAAGH,GAAO,EAAE,OAAO,EAAC,CAAE,CAAC,GACvEV,EAAa,aAAa,IAC1B,KAAK,kBAAkB,MACvB,KAAK,iBAAiB,CAAA,IACrBe,IAAKf,EAAa,cAAc,QAAQe,MAAO,UAAkBA,EAAG,WAAU;AAAA,EACnF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,UAAU;AACN,SAAK,QAAQ,IAAIX,EAAY,cAAc,KAAK,aAAa,GAC7D,KAAK,QAAQ,IAAIA,EAAY,cAAc,KAAK,aAAa,GAC7D,KAAK,QAAQ,IAAIA,EAAY,YAAY,KAAK,WAAW,GACzDJ,EAAa,WAAW;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,IAAIE,GAAOC,GAAU;AACjB,UAAMK,IAAQR,EAAa,UAAUE,CAAK,EAAE,QAAQC,CAAQ;AAC5D,IAAIK,IAAQ,MACRR,EAAa,UAAUE,CAAK,EAAE,OAAOM,GAAO,CAAC,GACjD,KAAK,WAAU;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa;AACT,IAAI,OAAO,OAAOR,EAAa,SAAS,EAAE,MAAM,CAACgB,MAAQA,EAAI,WAAW,CAAC,KACrE,KAAK,QAAO;AAAA,EAEpB;AACJ;AAMAhB,EAAa,aAAa;AAC1BA,EAAa,WAAW;AACxBA,EAAa,YAAY,EAAE,YAAY,CAAA,GAAI,WAAW,CAAA,GAAI,UAAU,GAAE;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/placement.js

@@ -0,0 +1,11 @@
+import { isBetween as t } from "./math.js";
+function e(r) {
+  if (Array.isArray(r))
+    return t(r[0], 0, 1) && t(r[1], 0, 1) ? r : [0.5, 0.5];
+  const i = r.split("-"), o = i.includes("left") ? 0 : i.includes("right") ? 1 : 0.5, s = i.includes("top") ? 0 : i.includes("bottom") ? 1 : 0.5;
+  return [o, s];
+}
+export {
+  e as parsePlacement
+};
+//# sourceMappingURL=placement.js.map

package/dist/node_modules/@antv/g6/esm/utils/placement.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"placement.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/placement.js"],"sourcesContent":["import { isBetween } from './math';\n/**\n * <zh/> 解析位置\n *\n * <en/> Parse position\n * @param placement - <zh/> 位置 | <en/> placement\n * @returns <zh/> 相对位置 | <en/> relative placement\n */\nexport function parsePlacement(placement) {\n    if (Array.isArray(placement)) {\n        return isBetween(placement[0], 0, 1) && isBetween(placement[1], 0, 1) ? placement : [0.5, 0.5];\n    }\n    const direction = placement.split('-');\n    const x = direction.includes('left') ? 0 : direction.includes('right') ? 1 : 0.5;\n    const y = direction.includes('top') ? 0 : direction.includes('bottom') ? 1 : 0.5;\n    return [x, y];\n}\n//# sourceMappingURL=placement.js.map"],"names":["parsePlacement","placement","isBetween","direction","x","y"],"mappings":";AAQO,SAASA,EAAeC,GAAW;AACtC,MAAI,MAAM,QAAQA,CAAS;AACvB,WAAOC,EAAUD,EAAU,CAAC,GAAG,GAAG,CAAC,KAAKC,EAAUD,EAAU,CAAC,GAAG,GAAG,CAAC,IAAIA,IAAY,CAAC,KAAK,GAAG;AAEjG,QAAME,IAAYF,EAAU,MAAM,GAAG,GAC/BG,IAAID,EAAU,SAAS,MAAM,IAAI,IAAIA,EAAU,SAAS,OAAO,IAAI,IAAI,KACvEE,IAAIF,EAAU,SAAS,KAAK,IAAI,IAAIA,EAAU,SAAS,QAAQ,IAAI,IAAI;AAC7E,SAAO,CAACC,GAAGC,CAAC;AAChB;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/point.js

@@ -0,0 +1,149 @@
+import { getBBoxWidth as x, getBBoxHeight as B } from "./bbox.js";
+import { getLinesIntersection as I, isLinesParallel as L } from "./line.js";
+import { getXYByPlacement as d } from "./position.js";
+import { subtract as P, add as g, normalize as z, toVector2 as E, distance as h, divide as M } from "./vector.js";
+import N from "../../../util/esm/lodash/is-equal.js";
+function q(n) {
+  var t;
+  return [n.x, n.y, (t = n.z) !== null && t !== void 0 ? t : 0];
+}
+function w(n) {
+  var t;
+  return { x: n[0], y: n[1], z: (t = n[2]) !== null && t !== void 0 ? t : 0 };
+}
+function R(n, t = 0) {
+  return n.map((e) => parseFloat(e.toFixed(t)));
+}
+function S(n, t, e, o = !1) {
+  if (N(n, t))
+    return n;
+  const c = o ? P(n, t) : P(t, n), i = z(c), r = [i[0] * e, i[1] * e];
+  return g(E(n), r);
+}
+function j(n, t) {
+  return n[1] === t[1];
+}
+function D(n, t) {
+  return n[0] === t[0];
+}
+function W(n, t) {
+  return j(n, t) || D(n, t);
+}
+function A(n, t, e) {
+  return L([n, t], [t, e]);
+}
+function v(n, t) {
+  return [2 * t[0] - n[0], 2 * t[1] - n[1]];
+}
+function O(n, t, e, o = !0, c = !1) {
+  for (let i = 0; i < e.length; i++) {
+    let r = e[i], f = e[(i + 1) % e.length];
+    o && (r = g(t, r), f = g(t, f));
+    const s = c ? v(n, t) : n, u = I([t, s], [r, f]);
+    if (u)
+      return {
+        point: u,
+        line: [r, f]
+      };
+  }
+  return {
+    point: t,
+    line: void 0
+  };
+}
+function G(n, t, e, o) {
+  const c = n[0], i = n[1];
+  let r = !1;
+  e === void 0 && (e = 0), o === void 0 && (o = t.length);
+  const f = o - e;
+  for (let s = 0, u = f - 1; s < f; u = s++) {
+    const l = t[s + e][0], a = t[s + e][1], m = t[u + e][0], y = t[u + e][1];
+    a > i != y > i && c < (m - l) * (i - a) / (y - a) + l && (r = !r);
+  }
+  return r;
+}
+function J(n, t, e = !1) {
+  const o = d(t, "center"), c = [
+    d(t, "left-top"),
+    d(t, "right-top"),
+    d(t, "right-bottom"),
+    d(t, "left-bottom")
+  ];
+  return O(n, o, c, !1, e).point;
+}
+function K(n, t, e = !1) {
+  const o = t.center, c = e ? v(n, o) : n, i = P(c, t.center), r = Math.atan2(i[1], i[0]);
+  if (isNaN(r))
+    return o;
+  const f = x(t) / 2, s = B(t) / 2, u = o[0] + f * Math.cos(r), l = o[1] + s * Math.sin(r);
+  return [u, l];
+}
+function Q(n, t) {
+  let e = 1 / 0, o = [n[0], t[0]];
+  return n.forEach((c) => {
+    t.forEach((i) => {
+      const r = h(c, i);
+      r < e && (e = r, o = [c, i]);
+    });
+  }), o;
+}
+function U(n, t) {
+  let e = 1 / 0, o = [
+    [0, 0],
+    [0, 0]
+  ];
+  return t.forEach((c) => {
+    const i = V(n, c);
+    i < e && (e = i, o = c);
+  }), o;
+}
+function V(n, t) {
+  const e = C(n, t);
+  return h(n, e);
+}
+function C(n, t) {
+  const [e, o] = t[0], [c, i] = t[1], [r, f] = n, s = c - e, u = i - o;
+  if (s === 0 && u === 0)
+    return [e, o];
+  let l = ((r - e) * s + (f - o) * u) / (s * s + u * u);
+  l > 1 ? l = 1 : l < 0 && (l = 0);
+  const a = e + l * s, m = o + l * u;
+  return [a, m];
+}
+function F(n) {
+  const t = n.reduce((e, o) => g(e, o), [0, 0]);
+  return M(t, n.length);
+}
+function Z(n, t = !0) {
+  const e = F(n);
+  return n.sort(([o, c], [i, r]) => {
+    const f = Math.atan2(c - e[1], o - e[0]), s = Math.atan2(r - e[1], i - e[0]);
+    return t ? s - f : f - s;
+  });
+}
+function $(n, t) {
+  return [n, [n[0], t[1]], t, [t[0], n[1]]];
+}
+export {
+  F as centerOf,
+  U as findNearestLine,
+  C as findNearestPointOnLine,
+  Q as findNearestPoints,
+  $ as getBoundingPoints,
+  V as getDistanceToLine,
+  K as getEllipseIntersectPoint,
+  O as getPolygonIntersectPoint,
+  J as getRectIntersectPoint,
+  v as getSymmetricPoint,
+  A as isCollinear,
+  j as isHorizontal,
+  W as isOrthogonal,
+  G as isPointInPolygon,
+  D as isVertical,
+  S as moveTo,
+  q as parsePoint,
+  R as round,
+  Z as sortByClockwise,
+  w as toPointObject
+};
+//# sourceMappingURL=point.js.map

package/dist/node_modules/@antv/g6/esm/utils/point.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"point.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/point.js"],"sourcesContent":["import { isEqual } from '@antv/util';\nimport { getBBoxHeight, getBBoxWidth } from './bbox';\nimport { getLinesIntersection, isLinesParallel } from './line';\nimport { getXYByPlacement } from './position';\nimport { add, distance, divide, normalize, subtract, toVector2 } from './vector';\n/**\n * <zh/> 将对象坐标转换为数组坐标\n * <en/> Convert object coordinates to array coordinates\n * @param point - <zh/> 对象坐标 | <en/> object coordinates\n * @returns <zh/> 数组坐标 | <en/> array coordinates\n */\nexport function parsePoint(point) {\n    var _a;\n    return [point.x, point.y, (_a = point.z) !== null && _a !== void 0 ? _a : 0];\n}\n/**\n * <zh/> 将数组坐标转换为对象坐标\n *\n * <en/> Convert array coordinates to object coordinates\n * @param point - <zh/> 数组坐标 | <en/> array coordinates\n * @returns <zh/> 对象坐标 | <en/> object coordinates\n */\nexport function toPointObject(point) {\n    var _a;\n    return { x: point[0], y: point[1], z: (_a = point[2]) !== null && _a !== void 0 ? _a : 0 };\n}\n/**\n * <zh/> 根据 X 轴坐标排序\n * <en/> Sort by X-axis coordinates\n * @param points - <zh/> 点集 | <en/> point set\n * @returns <zh/> 排序后的点集 | <en/> sorted point set\n */\nexport function sortByX(points) {\n    return points.sort((a, b) => a[0] - b[0] || a[1] - b[1]);\n}\n/**\n * <zh/> 点集去重\n *\n * <en/> Deduplicate point set\n * @param points - <zh/> 点集 | <en/> pointset\n * @returns <zh/> 去重后的点集 | <en/> deduplicated pointset\n */\nexport function deduplicate(points) {\n    const set = new Set();\n    return points.filter((p) => {\n        const key = p.join(',');\n        if (set.has(key))\n            return false;\n        set.add(key);\n        return true;\n    });\n}\n/**\n * <zh/> 对点格式化，精确到 `digits` 位的数字\n *\n * <en/> Round the point to the given precision\n * @param point - <zh/> 要舍入的点 | <en/> the point to round\n * @param digits - <zh/> 小数点后的位数 | <en/> the number of digits after the decimal point\n * @returns <zh/> 舍入后的点 | <en/> the rounded point\n */\nexport function round(point, digits = 0) {\n    return point.map((p) => parseFloat(p.toFixed(digits)));\n}\n/**\n * <zh/> 移动点，将点朝向参考点移动一定的距离\n *\n * <en/> Move `p` point along the line starting from `ref` to this point by a certain `distance`\n * @param p - <zh/> 要移动的点 | <en/> the point to move\n * @param ref - <zh/> 参考点 | <en/> the reference point\n * @param distance - <zh/> 移动的距离 | <en/> the distance to move\n * @param reverse\n * @returns <zh/> 移动后的点 | <en/> the moved point\n */\nexport function moveTo(p, ref, distance, reverse = false) {\n    if (isEqual(p, ref))\n        return p;\n    const direction = reverse ? subtract(p, ref) : subtract(ref, p);\n    const normalizedDirection = normalize(direction);\n    const moveVector = [normalizedDirection[0] * distance, normalizedDirection[1] * distance];\n    return add(toVector2(p), moveVector);\n}\n/**\n * <zh/> 判断两个点是否在同一水平线上\n *\n * <en/> whether two points are on the same horizontal line\n * @param p1 - <zh/> 第一个点 | <en/> the first point\n * @param p2 - <zh/> 第二个点 | <en/> the second point\n * @returns <zh/> 返回两个点是否在同一水平线上 | <en/> is horizontal or not\n */\nexport function isHorizontal(p1, p2) {\n    return p1[1] === p2[1];\n}\n/**\n * <zh/> 判断两个点是否在同一垂直线上\n *\n * <en/> whether two points are on the same vertical line\n * @param p1 - <zh/> 第一个点 | <en/> the first point\n * @param p2 - <zh/> 第二个点 | <en/> the second point\n * @returns <zh/> 返回两个点是否在同一垂直线上 | <en/> is vertical or not\n */\nexport function isVertical(p1, p2) {\n    return p1[0] === p2[0];\n}\n/**\n * <zh/> 判断两个点是否正交，即是否在同一水平线或垂直线上\n *\n * <en/> Judges whether two points are orthogonal, that is, whether they are on the same horizontal or vertical line\n * @param p1 - <zh/> 第一个点 | <en/> the first point\n * @param p2 - <zh/> 第二个点 | <en/> the second point\n * @returns <zh/> 是否正交 | <en/> whether orthogonal or not\n */\nexport function isOrthogonal(p1, p2) {\n    return isHorizontal(p1, p2) || isVertical(p1, p2);\n}\n/**\n * <zh/> 判断是否三点共线\n *\n * <en/> Judge whether three points are collinear\n * @param p1 - <zh/> 第一个点 | <en/> the first point\n * @param p2 - <zh/> 第二个点 | <en/> the second point\n * @param p3 - <zh/> 第三个点 | <en/> the third point\n * @returns <zh/> 是否三点共线 | <en/> whether three points are collinear\n */\nexport function isCollinear(p1, p2, p3) {\n    return isLinesParallel([p1, p2], [p2, p3]);\n}\n/**\n * <zh/> 计算一个点相对于另一个点的中心对称点\n *\n * <en/> Calculate the center symmetric point of a point relative to another point\n * @param p - <zh/> 要计算的点 | <en/> the point to calculate\n * @param center - <zh/> 中心点 | <en/> the center point\n * @returns <zh/> 中心对称点 | <en/> the center symmetric point\n */\nexport function getSymmetricPoint(p, center) {\n    return [2 * center[0] - p[0], 2 * center[1] - p[1]];\n}\n/**\n * <zh/> 获取从多边形中心到给定点的连线与多边形边缘的交点\n *\n * <en/> Gets the intersection point between the line from the center of a polygon to a given point and the polygon's edge\n * @param p - <zh/> 从多边形中心到多边形边缘的连线的外部点 | <en/> The point outside the polygon from which the line to the polygon's center is drawn\n * @param center - <zh/> 多边形中心 | <en/> the center of the polygon\n * @param points - <zh/> 多边形顶点 | <en/> the vertices of the polygon\n * @param isRelativePos - <zh/> 顶点坐标是否相对中心点 | <en/> whether the vertex coordinates are relative to the center point\n * @param useExtendedLine - <zh/> 是否使用延长线 | <en/> whether to use the extended line\n * @returns <zh/> 交点与相交线段 | <en/> intersection and intersecting line segment\n */\nexport function getPolygonIntersectPoint(p, center, points, isRelativePos = true, useExtendedLine = false) {\n    for (let i = 0; i < points.length; i++) {\n        let start = points[i];\n        let end = points[(i + 1) % points.length];\n        if (isRelativePos) {\n            start = add(center, start);\n            end = add(center, end);\n        }\n        const refP = useExtendedLine ? getSymmetricPoint(p, center) : p;\n        const intersect = getLinesIntersection([center, refP], [start, end]);\n        if (intersect) {\n            return {\n                point: intersect,\n                line: [start, end],\n            };\n        }\n    }\n    return {\n        point: center,\n        line: undefined,\n    };\n}\n/**\n * <zh/> 判断点是否在多边形内部\n *\n * <en/> Whether point is inside the polygon (ray algo)\n * @param point - <zh/> 点 | <en/> point\n * @param points - <zh/> 多边形顶点 | <en/> polygon vertices\n * @param start - <zh/> 起始索引 | <en/> start index\n * @param end - <zh/> 结束索引 | <en/> end index\n * @returns <zh/> 是否在多边形内部 | <en/> whether inside the polygon\n */\nexport function isPointInPolygon(point, points, start, end) {\n    const x = point[0];\n    const y = point[1];\n    let inside = false;\n    if (start === undefined)\n        start = 0;\n    if (end === undefined)\n        end = points.length;\n    const len = end - start;\n    for (let i = 0, j = len - 1; i < len; j = i++) {\n        const xi = points[i + start][0];\n        const yi = points[i + start][1];\n        const xj = points[j + start][0];\n        const yj = points[j + start][1];\n        const intersect = yi > y !== yj > y && x < ((xj - xi) * (y - yi)) / (yj - yi) + xi;\n        if (intersect)\n            inside = !inside;\n    }\n    return inside;\n}\n/**\n * <zh/> 获取给定点到矩形中心的连线与矩形边缘的交点\n *\n * <en/> Gets the intersection point between the line from the center of a rectangle to a given point and the rectangle's edge\n * @param p - <zh/> 从矩形中心到矩形边缘的连线的外部点 | <en/> The point outside the rectangle from which the line to the rectangle's center is drawn\n * @param bbox - <zh/> 矩形包围盒 | <en/> the bounding box of the rectangle\n * @param useExtendedLine - <zh/> 是否使用延长线 | <en/> whether to use the extended line\n * @returns <zh/> 交点 | <en/> intersection\n */\nexport function getRectIntersectPoint(p, bbox, useExtendedLine = false) {\n    const center = getXYByPlacement(bbox, 'center');\n    const corners = [\n        getXYByPlacement(bbox, 'left-top'),\n        getXYByPlacement(bbox, 'right-top'),\n        getXYByPlacement(bbox, 'right-bottom'),\n        getXYByPlacement(bbox, 'left-bottom'),\n    ];\n    return getPolygonIntersectPoint(p, center, corners, false, useExtendedLine).point;\n}\n/**\n * <zh/> 获取给定点到椭圆中心的连线与椭圆边缘的交点\n *\n * <en/> Gets the intersection point between the line from the center of an ellipse to a given point and the ellipse's edge\n * @param p - <zh/> 从椭圆中心到椭圆边缘的连线的外部点 | <en/> The point outside the ellipse from which the line to the ellipse's center is drawn\n * The point outside the ellipse from which the line to the ellipse's center is drawn.\n * @param bbox - <zh/> 椭圆包围盒 | <en/> the bounding box of the ellipse\n * @param useExtendedLine - <zh/> 是否使用延长线 | <en/> whether to use the extended line\n * @returns <zh/> 交点 | <en/> intersection\n */\nexport function getEllipseIntersectPoint(p, bbox, useExtendedLine = false) {\n    const center = bbox.center;\n    const refP = useExtendedLine ? getSymmetricPoint(p, center) : p;\n    const vec = subtract(refP, bbox.center);\n    const angle = Math.atan2(vec[1], vec[0]);\n    if (isNaN(angle))\n        return center;\n    const rx = getBBoxWidth(bbox) / 2;\n    const ry = getBBoxHeight(bbox) / 2;\n    const intersectX = center[0] + rx * Math.cos(angle);\n    const intersectY = center[1] + ry * Math.sin(angle);\n    return [intersectX, intersectY];\n}\n/**\n * <zh/> 从两组点中找到距离最近的两个点\n * @param group1 - <zh/> 第一组点 | <en/> the first group of points\n * @param group2 - <zh/> 第二组点 | <en/> the second group of points\n * @returns <zh/> 距离最近的两个点 | <en/> the nearest two points\n */\nexport function findNearestPoints(group1, group2) {\n    let minDistance = Infinity;\n    let nearestPoints = [group1[0], group2[0]];\n    group1.forEach((p1) => {\n        group2.forEach((p2) => {\n            const dist = distance(p1, p2);\n            if (dist < minDistance) {\n                minDistance = dist;\n                nearestPoints = [p1, p2];\n            }\n        });\n    });\n    return nearestPoints;\n}\n/**\n * <zh/> 从一组线段中找到距离给定点最近的线段\n *\n * <en/> Find the line segment closest to the given point from a group of line segments\n * @param point - <zh/> 给定点 | <en/> the given point\n * @param lines - <zh/> 一组线段 | <en/> a group of line segments\n * @returns <zh/> 距离最近的线段 | <en/> the nearest line segment\n */\nexport function findNearestLine(point, lines) {\n    let minDistance = Infinity;\n    let nearestLine = [\n        [0, 0],\n        [0, 0],\n    ];\n    lines.forEach((line) => {\n        const distance = getDistanceToLine(point, line);\n        if (distance < minDistance) {\n            minDistance = distance;\n            nearestLine = line;\n        }\n    });\n    return nearestLine;\n}\n/**\n * <zh/> 获取点到线段的距离\n *\n * <en/> Get the distance from a point to a line segment\n * @param point - <zh/> 点 | <en/> the point\n * @param line - <zh/> 线段 | <en/> the line segment\n * @returns <zh/> 点到线段的距离 | <en/> the distance from the point to the line segment\n */\nexport function getDistanceToLine(point, line) {\n    const nearestPoint = findNearestPointOnLine(point, line);\n    return distance(point, nearestPoint);\n}\n/**\n * <zh/> 获取线段上距离给定点最近的点\n *\n * <en/> Get the point on the line segment closest to the given point\n * @param point - <zh/> 给定点 | <en/> the given point\n * @param line - <zh/> 线段 | <en/> the line segment\n * @returns <zh/> 线段上距离给定点最近的点 | <en/> the point on the line segment closest to the given point\n */\nexport function findNearestPointOnLine(point, line) {\n    const [x1, y1] = line[0];\n    const [x2, y2] = line[1];\n    const [x3, y3] = point;\n    const px = x2 - x1;\n    const py = y2 - y1;\n    // 若线段实际上是一个点 | If the line segment is actually a point\n    if (px === 0 && py === 0) {\n        return [x1, y1];\n    }\n    let u = ((x3 - x1) * px + (y3 - y1) * py) / (px * px + py * py);\n    if (u > 1) {\n        u = 1;\n    }\n    else if (u < 0) {\n        u = 0;\n    }\n    const x = x1 + u * px;\n    const y = y1 + u * py;\n    return [x, y];\n}\n/**\n * <zh/> 获取点集的中心点\n *\n * <en/> Get the center point of a set of points\n * @param points - <zh/> 点集 | <en/> point set\n * @returns <zh/> 中心点 | <en/> center point\n */\nexport function centerOf(points) {\n    const totalPosition = points.reduce((acc, p) => add(acc, p), [0, 0]);\n    return divide(totalPosition, points.length);\n}\n/**\n * <zh/> 按顺时针或逆时针方向对点集排序\n *\n * <en/> Sort the point set in a clockwise or counterclockwise direction\n * @param points - <zh/> 点集 | <en/> point set\n * @param clockwise - <zh/> 是否顺时针 | <en/> whether clockwise\n * @returns <zh/> 排序后的点集 | <en/> sorted point set\n */\nexport function sortByClockwise(points, clockwise = true) {\n    const center = centerOf(points);\n    return points.sort(([x1, y1], [x2, y2]) => {\n        const angle1 = Math.atan2(y1 - center[1], x1 - center[0]);\n        const angle2 = Math.atan2(y2 - center[1], x2 - center[0]);\n        return clockwise ? angle2 - angle1 : angle1 - angle2;\n    });\n}\n/**\n * <zh/> 给定的起点和终点，返回一个由这两个点和它们的对角点组成的数组\n * @param start - <zh/> 起点 | <en/> start point\n * @param end - <zh/> 终点 | <en/> end point\n * @returns <zh/> 由这两个点和它们的对角点组成的数组 | <en/> an array consisting of these two points and their diagonal points\n */\nexport function getBoundingPoints(start, end) {\n    return [start, [start[0], end[1]], end, [end[0], start[1]]];\n}\n//# sourceMappingURL=point.js.map"],"names":["parsePoint","point","_a","toPointObject","round","digits","p","moveTo","ref","distance","reverse","isEqual","direction","subtract","normalizedDirection","normalize","moveVector","add","toVector2","isHorizontal","p1","p2","isVertical","isOrthogonal","isCollinear","p3","isLinesParallel","getSymmetricPoint","center","getPolygonIntersectPoint","points","isRelativePos","useExtendedLine","start","end","refP","intersect","getLinesIntersection","isPointInPolygon","x","y","inside","len","i","j","xi","yi","xj","yj","getRectIntersectPoint","bbox","getXYByPlacement","corners","getEllipseIntersectPoint","vec","angle","rx","getBBoxWidth","ry","getBBoxHeight","intersectX","intersectY","findNearestPoints","group1","group2","minDistance","nearestPoints","dist","findNearestLine","lines","nearestLine","line","getDistanceToLine","nearestPoint","findNearestPointOnLine","x1","y1","x2","y2","x3","y3","px","py","u","centerOf","totalPosition","acc","divide","sortByClockwise","clockwise","angle1","angle2","getBoundingPoints"],"mappings":";;;;;AAWO,SAASA,EAAWC,GAAO;AAC9B,MAAIC;AACJ,SAAO,CAACD,EAAM,GAAGA,EAAM,IAAIC,IAAKD,EAAM,OAAO,QAAQC,MAAO,SAASA,IAAK,CAAC;AAC/E;AAQO,SAASC,EAAcF,GAAO;AACjC,MAAIC;AACJ,SAAO,EAAE,GAAGD,EAAM,CAAC,GAAG,GAAGA,EAAM,CAAC,GAAG,IAAIC,IAAKD,EAAM,CAAC,OAAO,QAAQC,MAAO,SAASA,IAAK,EAAC;AAC5F;AAmCO,SAASE,EAAMH,GAAOI,IAAS,GAAG;AACrC,SAAOJ,EAAM,IAAI,CAACK,MAAM,WAAWA,EAAE,QAAQD,CAAM,CAAC,CAAC;AACzD;AAWO,SAASE,EAAOD,GAAGE,GAAKC,GAAUC,IAAU,IAAO;AACtD,MAAIC,EAAQL,GAAGE,CAAG;AACd,WAAOF;AACX,QAAMM,IAAYF,IAAUG,EAASP,GAAGE,CAAG,IAAIK,EAASL,GAAKF,CAAC,GACxDQ,IAAsBC,EAAUH,CAAS,GACzCI,IAAa,CAACF,EAAoB,CAAC,IAAIL,GAAUK,EAAoB,CAAC,IAAIL,CAAQ;AACxF,SAAOQ,EAAIC,EAAUZ,CAAC,GAAGU,CAAU;AACvC;AASO,SAASG,EAAaC,GAAIC,GAAI;AACjC,SAAOD,EAAG,CAAC,MAAMC,EAAG,CAAC;AACzB;AASO,SAASC,EAAWF,GAAIC,GAAI;AAC/B,SAAOD,EAAG,CAAC,MAAMC,EAAG,CAAC;AACzB;AASO,SAASE,EAAaH,GAAIC,GAAI;AACjC,SAAOF,EAAaC,GAAIC,CAAE,KAAKC,EAAWF,GAAIC,CAAE;AACpD;AAUO,SAASG,EAAYJ,GAAIC,GAAII,GAAI;AACpC,SAAOC,EAAgB,CAACN,GAAIC,CAAE,GAAG,CAACA,GAAII,CAAE,CAAC;AAC7C;AASO,SAASE,EAAkBrB,GAAGsB,GAAQ;AACzC,SAAO,CAAC,IAAIA,EAAO,CAAC,IAAItB,EAAE,CAAC,GAAG,IAAIsB,EAAO,CAAC,IAAItB,EAAE,CAAC,CAAC;AACtD;AAYO,SAASuB,EAAyBvB,GAAGsB,GAAQE,GAAQC,IAAgB,IAAMC,IAAkB,IAAO;AACvG,WAAS,IAAI,GAAG,IAAIF,EAAO,QAAQ,KAAK;AACpC,QAAIG,IAAQH,EAAO,CAAC,GAChBI,IAAMJ,GAAQ,IAAI,KAAKA,EAAO,MAAM;AACxC,IAAIC,MACAE,IAAQhB,EAAIW,GAAQK,CAAK,GACzBC,IAAMjB,EAAIW,GAAQM,CAAG;AAEzB,UAAMC,IAAOH,IAAkBL,EAAkBrB,GAAGsB,CAAM,IAAItB,GACxD8B,IAAYC,EAAqB,CAACT,GAAQO,CAAI,GAAG,CAACF,GAAOC,CAAG,CAAC;AACnE,QAAIE;AACA,aAAO;AAAA,QACH,OAAOA;AAAA,QACP,MAAM,CAACH,GAAOC,CAAG;AAAA,MACjC;AAAA,EAEI;AACA,SAAO;AAAA,IACH,OAAON;AAAA,IACP,MAAM;AAAA,EACd;AACA;AAWO,SAASU,EAAiBrC,GAAO6B,GAAQG,GAAOC,GAAK;AACxD,QAAMK,IAAItC,EAAM,CAAC,GACXuC,IAAIvC,EAAM,CAAC;AACjB,MAAIwC,IAAS;AACb,EAAIR,MAAU,WACVA,IAAQ,IACRC,MAAQ,WACRA,IAAMJ,EAAO;AACjB,QAAMY,IAAMR,IAAMD;AAClB,WAASU,IAAI,GAAGC,IAAIF,IAAM,GAAGC,IAAID,GAAKE,IAAID,KAAK;AAC3C,UAAME,IAAKf,EAAOa,IAAIV,CAAK,EAAE,CAAC,GACxBa,IAAKhB,EAAOa,IAAIV,CAAK,EAAE,CAAC,GACxBc,IAAKjB,EAAOc,IAAIX,CAAK,EAAE,CAAC,GACxBe,IAAKlB,EAAOc,IAAIX,CAAK,EAAE,CAAC;AAE9B,IADkBa,IAAKN,KAAMQ,IAAKR,KAAKD,KAAMQ,IAAKF,MAAOL,IAAIM,MAAQE,IAAKF,KAAMD,MAE5EJ,IAAS,CAACA;AAAA,EAClB;AACA,SAAOA;AACX;AAUO,SAASQ,EAAsB3C,GAAG4C,GAAMlB,IAAkB,IAAO;AACpE,QAAMJ,IAASuB,EAAiBD,GAAM,QAAQ,GACxCE,IAAU;AAAA,IACZD,EAAiBD,GAAM,UAAU;AAAA,IACjCC,EAAiBD,GAAM,WAAW;AAAA,IAClCC,EAAiBD,GAAM,cAAc;AAAA,IACrCC,EAAiBD,GAAM,aAAa;AAAA,EAC5C;AACI,SAAOrB,EAAyBvB,GAAGsB,GAAQwB,GAAS,IAAOpB,CAAe,EAAE;AAChF;AAWO,SAASqB,EAAyB/C,GAAG4C,GAAMlB,IAAkB,IAAO;AACvE,QAAMJ,IAASsB,EAAK,QACdf,IAAOH,IAAkBL,EAAkBrB,GAAGsB,CAAM,IAAItB,GACxDgD,IAAMzC,EAASsB,GAAMe,EAAK,MAAM,GAChCK,IAAQ,KAAK,MAAMD,EAAI,CAAC,GAAGA,EAAI,CAAC,CAAC;AACvC,MAAI,MAAMC,CAAK;AACX,WAAO3B;AACX,QAAM4B,IAAKC,EAAaP,CAAI,IAAI,GAC1BQ,IAAKC,EAAcT,CAAI,IAAI,GAC3BU,IAAahC,EAAO,CAAC,IAAI4B,IAAK,KAAK,IAAID,CAAK,GAC5CM,IAAajC,EAAO,CAAC,IAAI8B,IAAK,KAAK,IAAIH,CAAK;AAClD,SAAO,CAACK,GAAYC,CAAU;AAClC;AAOO,SAASC,EAAkBC,GAAQC,GAAQ;AAC9C,MAAIC,IAAc,OACdC,IAAgB,CAACH,EAAO,CAAC,GAAGC,EAAO,CAAC,CAAC;AACzC,SAAAD,EAAO,QAAQ,CAAC3C,MAAO;AACnB,IAAA4C,EAAO,QAAQ,CAAC3C,MAAO;AACnB,YAAM8C,IAAO1D,EAASW,GAAIC,CAAE;AAC5B,MAAI8C,IAAOF,MACPA,IAAcE,GACdD,IAAgB,CAAC9C,GAAIC,CAAE;AAAA,IAE/B,CAAC;AAAA,EACL,CAAC,GACM6C;AACX;AASO,SAASE,EAAgBnE,GAAOoE,GAAO;AAC1C,MAAIJ,IAAc,OACdK,IAAc;AAAA,IACd,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACb;AACI,SAAAD,EAAM,QAAQ,CAACE,MAAS;AACpB,UAAM9D,IAAW+D,EAAkBvE,GAAOsE,CAAI;AAC9C,IAAI9D,IAAWwD,MACXA,IAAcxD,GACd6D,IAAcC;AAAA,EAEtB,CAAC,GACMD;AACX;AASO,SAASE,EAAkBvE,GAAOsE,GAAM;AAC3C,QAAME,IAAeC,EAAuBzE,GAAOsE,CAAI;AACvD,SAAO9D,EAASR,GAAOwE,CAAY;AACvC;AASO,SAASC,EAAuBzE,GAAOsE,GAAM;AAChD,QAAM,CAACI,GAAIC,CAAE,IAAIL,EAAK,CAAC,GACjB,CAACM,GAAIC,CAAE,IAAIP,EAAK,CAAC,GACjB,CAACQ,GAAIC,CAAE,IAAI/E,GACXgF,IAAKJ,IAAKF,GACVO,IAAKJ,IAAKF;AAEhB,MAAIK,MAAO,KAAKC,MAAO;AACnB,WAAO,CAACP,GAAIC,CAAE;AAElB,MAAIO,MAAMJ,IAAKJ,KAAMM,KAAMD,IAAKJ,KAAMM,MAAOD,IAAKA,IAAKC,IAAKA;AAC5D,EAAIC,IAAI,IACJA,IAAI,IAECA,IAAI,MACTA,IAAI;AAER,QAAM5C,IAAIoC,IAAKQ,IAAIF,GACbzC,IAAIoC,IAAKO,IAAID;AACnB,SAAO,CAAC3C,GAAGC,CAAC;AAChB;AAQO,SAAS4C,EAAStD,GAAQ;AAC7B,QAAMuD,IAAgBvD,EAAO,OAAO,CAACwD,GAAKhF,MAAMW,EAAIqE,GAAKhF,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnE,SAAOiF,EAAOF,GAAevD,EAAO,MAAM;AAC9C;AASO,SAAS0D,EAAgB1D,GAAQ2D,IAAY,IAAM;AACtD,QAAM7D,IAASwD,EAAStD,CAAM;AAC9B,SAAOA,EAAO,KAAK,CAAC,CAAC6C,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,MAAM;AACvC,UAAMY,IAAS,KAAK,MAAMd,IAAKhD,EAAO,CAAC,GAAG+C,IAAK/C,EAAO,CAAC,CAAC,GAClD+D,IAAS,KAAK,MAAMb,IAAKlD,EAAO,CAAC,GAAGiD,IAAKjD,EAAO,CAAC,CAAC;AACxD,WAAO6D,IAAYE,IAASD,IAASA,IAASC;AAAA,EAClD,CAAC;AACL;AAOO,SAASC,EAAkB3D,GAAOC,GAAK;AAC1C,SAAO,CAACD,GAAO,CAACA,EAAM,CAAC,GAAGC,EAAI,CAAC,CAAC,GAAGA,GAAK,CAACA,EAAI,CAAC,GAAGD,EAAM,CAAC,CAAC,CAAC;AAC9D;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/polygon.js

@@ -0,0 +1,29 @@
+import { pathToPoints as B } from "./path.js";
+import { findNearestLine as P, findNearestPointOnLine as b } from "./point.js";
+import { getXYByPlacement as d } from "./position.js";
+import A from "../../../util/esm/lodash/is-equal.js";
+function q(m, t, f, a, u, x, c) {
+  const [i, s] = d(m, t), o = {
+    textAlign: t === "left" ? "right" : t === "right" ? "left" : "center",
+    textBaseline: t === "top" ? "bottom" : t === "bottom" ? "top" : "middle",
+    transform: [["translate", i + f, s + a]]
+  };
+  if (t === "center" || !u)
+    return o;
+  const r = B(x);
+  if (!r || r.length <= 3)
+    return o;
+  const p = r.map((e, y) => {
+    const g = e, h = r[(y + 1) % r.length];
+    return A(g, h) ? null : [g, h];
+  }).filter(Boolean), n = P([i, s], p), l = b([i, s], n);
+  if (l && n && (o.transform = [["translate", l[0] + f, l[1] + a]], c)) {
+    const e = Math.atan((n[0][1] - n[1][1]) / (n[0][0] - n[1][0]));
+    o.transform.push(["rotate", e / Math.PI * 180]), o.textAlign = "center", (t === "right" || t === "left") && (e > 0 ? o.textBaseline = t === "right" ? "bottom" : "top" : o.textBaseline = t === "right" ? "top" : "bottom");
+  }
+  return o;
+}
+export {
+  q as getPolygonTextStyleByPlacement
+};
+//# sourceMappingURL=polygon.js.map

package/dist/node_modules/@antv/g6/esm/utils/polygon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/polygon.js"],"sourcesContent":["import { isEqual } from '@antv/util';\nimport { pathToPoints } from './path';\nimport { findNearestLine, findNearestPointOnLine } from './point';\nimport { getXYByPlacement } from './position';\n/**\n * <zh/> 计算文本位置样式\n *\n * <en/> Calculate text position style\n * @param bounds - <zh/> 外包围盒 | <en/> contour bounds\n * @param placement - <zh/> 位置 | <en/> placement\n * @param offsetX - <zh/> x轴偏移 | <en/> x-axis offset\n * @param offsetY - <zh/> y轴偏移 | <en/> y-axis offset\n * @param closeToContour - <zh/> 标签位置是否贴合轮廓 | <en/> whether the label position is close to the contour\n * @param path - <zh/> 路径 | <en/> path\n * @param autoRotate - <zh/> 是否跟随轮廓旋转 | <en/> whether to rotate with the contour\n * @returns <zh/> 文本样式 | <en/> text style\n */\nexport function getPolygonTextStyleByPlacement(bounds, placement, offsetX, offsetY, closeToContour, path, autoRotate) {\n    const [x, y] = getXYByPlacement(bounds, placement);\n    const style = {\n        textAlign: placement === 'left' ? 'right' : placement === 'right' ? 'left' : 'center',\n        textBaseline: placement === 'top' ? 'bottom' : placement === 'bottom' ? 'top' : 'middle',\n        transform: [['translate', x + offsetX, y + offsetY]],\n    };\n    if (placement === 'center' || !closeToContour)\n        return style;\n    const points = pathToPoints(path);\n    if (!points || points.length <= 3)\n        return style;\n    const lines = points\n        .map((point, index) => {\n        const p1 = point;\n        const p2 = points[(index + 1) % points.length];\n        if (isEqual(p1, p2))\n            return null;\n        return [p1, p2];\n    })\n        .filter(Boolean);\n    const line = findNearestLine([x, y], lines);\n    const intersection = findNearestPointOnLine([x, y], line);\n    if (intersection && line) {\n        style.transform = [['translate', intersection[0] + offsetX, intersection[1] + offsetY]];\n        if (autoRotate) {\n            const angle = Math.atan((line[0][1] - line[1][1]) / (line[0][0] - line[1][0]));\n            style.transform.push(['rotate', (angle / Math.PI) * 180]);\n            style.textAlign = 'center';\n            if (placement === 'right' || placement === 'left') {\n                if (angle > 0) {\n                    style.textBaseline = placement === 'right' ? 'bottom' : 'top';\n                }\n                else {\n                    style.textBaseline = placement === 'right' ? 'top' : 'bottom';\n                }\n            }\n        }\n    }\n    return style;\n}\n//# sourceMappingURL=polygon.js.map"],"names":["getPolygonTextStyleByPlacement","bounds","placement","offsetX","offsetY","closeToContour","path","autoRotate","x","y","getXYByPlacement","style","points","pathToPoints","lines","point","index","p1","p2","isEqual","line","findNearestLine","intersection","findNearestPointOnLine","angle"],"mappings":";;;;AAiBO,SAASA,EAA+BC,GAAQC,GAAWC,GAASC,GAASC,GAAgBC,GAAMC,GAAY;AAClH,QAAM,CAACC,GAAGC,CAAC,IAAIC,EAAiBT,GAAQC,CAAS,GAC3CS,IAAQ;AAAA,IACV,WAAWT,MAAc,SAAS,UAAUA,MAAc,UAAU,SAAS;AAAA,IAC7E,cAAcA,MAAc,QAAQ,WAAWA,MAAc,WAAW,QAAQ;AAAA,IAChF,WAAW,CAAC,CAAC,aAAaM,IAAIL,GAASM,IAAIL,CAAO,CAAC;AAAA,EAC3D;AACI,MAAIF,MAAc,YAAY,CAACG;AAC3B,WAAOM;AACX,QAAMC,IAASC,EAAaP,CAAI;AAChC,MAAI,CAACM,KAAUA,EAAO,UAAU;AAC5B,WAAOD;AACX,QAAMG,IAAQF,EACT,IAAI,CAACG,GAAOC,MAAU;AACvB,UAAMC,IAAKF,GACLG,IAAKN,GAAQI,IAAQ,KAAKJ,EAAO,MAAM;AAC7C,WAAIO,EAAQF,GAAIC,CAAE,IACP,OACJ,CAACD,GAAIC,CAAE;AAAA,EAClB,CAAC,EACI,OAAO,OAAO,GACbE,IAAOC,EAAgB,CAACb,GAAGC,CAAC,GAAGK,CAAK,GACpCQ,IAAeC,EAAuB,CAACf,GAAGC,CAAC,GAAGW,CAAI;AACxD,MAAIE,KAAgBF,MAChBT,EAAM,YAAY,CAAC,CAAC,aAAaW,EAAa,CAAC,IAAInB,GAASmB,EAAa,CAAC,IAAIlB,CAAO,CAAC,GAClFG,IAAY;AACZ,UAAMiB,IAAQ,KAAK,MAAMJ,EAAK,CAAC,EAAE,CAAC,IAAIA,EAAK,CAAC,EAAE,CAAC,MAAMA,EAAK,CAAC,EAAE,CAAC,IAAIA,EAAK,CAAC,EAAE,CAAC,EAAE;AAC7E,IAAAT,EAAM,UAAU,KAAK,CAAC,UAAWa,IAAQ,KAAK,KAAM,GAAG,CAAC,GACxDb,EAAM,YAAY,WACdT,MAAc,WAAWA,MAAc,YACnCsB,IAAQ,IACRb,EAAM,eAAeT,MAAc,UAAU,WAAW,QAGxDS,EAAM,eAAeT,MAAc,UAAU,QAAQ;AAAA,EAGjE;AAEJ,SAAOS;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/position.js

@@ -0,0 +1,24 @@
+import { parsePlacement as r } from "./placement.js";
+function a(n) {
+  const { x: e = 0, y: t = 0, z: o = 0 } = n.style || {};
+  return [+e, +t, +o];
+}
+function f(n) {
+  const { x: e, y: t, z: o } = n.style || {};
+  return e !== void 0 || t !== void 0 || o !== void 0;
+}
+function s(n, e) {
+  const [t, o] = e, { min: i, max: c } = n;
+  return [i[0] + t * (c[0] - i[0]), i[1] + o * (c[1] - i[1])];
+}
+function l(n, e = "center") {
+  const t = r(e);
+  return s(n, t);
+}
+export {
+  l as getXYByPlacement,
+  s as getXYByRelativePlacement,
+  f as hasPosition,
+  a as positionOf
+};
+//# sourceMappingURL=position.js.map

package/dist/node_modules/@antv/g6/esm/utils/position.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"position.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/position.js"],"sourcesContent":["import { parseAnchor } from './anchor';\nimport { parsePlacement } from './placement';\n/**\n * <zh/> 获取节点/ combo 的位置坐标\n *\n * <en/> Get the position of node/combo\n * @param datum - <zh/> 节点/ combo 的数据 | <en/> data of node/combo\n * @returns - <zh/> 坐标 | <en/> position\n */\nexport function positionOf(datum) {\n    const { x = 0, y = 0, z = 0 } = datum.style || {};\n    return [+x, +y, +z];\n}\n/**\n * <zh/> 检查数据是否有位置坐标\n *\n * <en/> Check if the data has a position coordinate\n * @param datum - <zh/> 节点/ combo 的数据 | <en/> data of node/combo\n * @returns - <zh/> 是否有位置坐标 | <en/> Whether there is a position coordinate\n */\nexport function hasPosition(datum) {\n    const { x, y, z } = datum.style || {};\n    return x !== undefined || y !== undefined || z !== undefined;\n}\n/**\n * <zh/> 获取相对位置坐标\n *\n * <en/> Get position by relative placement\n * @param bbox - <zh/> 元素包围盒 | <en/> element bounding box\n * @param placement - <zh/> 相对于元素的位置 | <en/> Point relative to element\n * @returns - <zh/> 坐标 | <en/> position\n */\nexport function getXYByRelativePlacement(bbox, placement) {\n    const [x, y] = placement;\n    const { min, max } = bbox;\n    return [min[0] + x * (max[0] - min[0]), min[1] + y * (max[1] - min[1])];\n}\n/**\n * <zh/> 获取位置坐标\n *\n * <en/> Get position by placement\n * @param bbox - <zh/> 元素包围盒 | <en/> element bounding box\n * @param placement - <zh/> 相对于元素的位置 | <en/> Point relative to element\n * @returns - <zh/> 坐标 | <en/> position\n */\nexport function getXYByPlacement(bbox, placement = 'center') {\n    const relativePlacement = parsePlacement(placement);\n    return getXYByRelativePlacement(bbox, relativePlacement);\n}\n/**\n * <zh/> 获取锚点坐标\n *\n * <en/> Get anchor position\n * @param bbox - <zh/> 元素包围盒 | <en/> element bounding box\n * @param anchor - <zh/> 锚点位置 | <en/> Anchor\n * @returns - <zh/> 坐标 | <en/> position\n */\nexport function getXYByAnchor(bbox, anchor) {\n    const parsedAnchor = parseAnchor(anchor);\n    return getXYByRelativePlacement(bbox, parsedAnchor);\n}\n/**\n * <zh/> 通过 rect points 路径点获取 position 方位配置.\n *\n * <en/> The rect points command is used to obtain the position and orientation configuration.\n * @param points Points\n * @returns `{ left: number; right: number; top: number; bottom: number }`\n */\nexport const getPositionByRectPoints = (points) => {\n    const [p1, p2] = points;\n    return {\n        left: Math.min(p1[0], p2[0]),\n        right: Math.max(p1[0], p2[0]),\n        top: Math.min(p1[1], p2[1]),\n        bottom: Math.max(p1[1], p2[1]),\n    };\n};\n//# sourceMappingURL=position.js.map"],"names":["positionOf","datum","x","y","z","hasPosition","getXYByRelativePlacement","bbox","placement","min","max","getXYByPlacement","relativePlacement","parsePlacement"],"mappings":";AASO,SAASA,EAAWC,GAAO;AAC9B,QAAM,EAAE,GAAAC,IAAI,GAAG,GAAAC,IAAI,GAAG,GAAAC,IAAI,EAAC,IAAKH,EAAM,SAAS,CAAA;AAC/C,SAAO,CAAC,CAACC,GAAG,CAACC,GAAG,CAACC,CAAC;AACtB;AAQO,SAASC,EAAYJ,GAAO;AAC/B,QAAM,EAAE,GAAAC,GAAG,GAAAC,GAAG,GAAAC,EAAC,IAAKH,EAAM,SAAS,CAAA;AACnC,SAAOC,MAAM,UAAaC,MAAM,UAAaC,MAAM;AACvD;AASO,SAASE,EAAyBC,GAAMC,GAAW;AACtD,QAAM,CAACN,GAAGC,CAAC,IAAIK,GACT,EAAE,KAAAC,GAAK,KAAAC,EAAG,IAAKH;AACrB,SAAO,CAACE,EAAI,CAAC,IAAIP,KAAKQ,EAAI,CAAC,IAAID,EAAI,CAAC,IAAIA,EAAI,CAAC,IAAIN,KAAKO,EAAI,CAAC,IAAID,EAAI,CAAC,EAAE;AAC1E;AASO,SAASE,EAAiBJ,GAAMC,IAAY,UAAU;AACzD,QAAMI,IAAoBC,EAAeL,CAAS;AAClD,SAAOF,EAAyBC,GAAMK,CAAiB;AAC3D;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/prefix.js

@@ -0,0 +1,54 @@
+import c from "../../../util/esm/lodash/lower-first.js";
+import u from "../../../util/esm/lodash/upper-first.js";
+function o(t, n) {
+  if (!t.startsWith(n))
+    return !1;
+  const e = t[n.length];
+  return e >= "A" && e <= "Z";
+}
+function a(t, n) {
+  return `${n}${u(t)}`;
+}
+function f(t, n, e = !0) {
+  if (!n || !o(t, n))
+    return t;
+  const r = t.slice(n.length);
+  return e ? c(r) : r;
+}
+function l(t, n) {
+  const e = Object.entries(t).reduce((r, [s, i]) => (s === "className" || s === "class" || o(s, n) && Object.assign(r, { [f(s, n)]: i }), r), {});
+  if ("opacity" in t) {
+    const r = a("opacity", n), s = t.opacity;
+    if (r in t) {
+      const i = t[r];
+      Object.assign(e, { opacity: s * i });
+    } else
+      Object.assign(e, { opacity: s });
+  }
+  return e;
+}
+function p(t, n) {
+  const e = n.length;
+  return Object.keys(t).reduce((r, s) => {
+    if (s.startsWith(n)) {
+      const i = s.slice(e);
+      r[i] = t[s];
+    }
+    return r;
+  }, {});
+}
+function O(t, n) {
+  const e = typeof n == "string" ? [n] : n, r = {};
+  return Object.keys(t).forEach((s) => {
+    e.find((i) => s.startsWith(i)) || (r[s] = t[s]);
+  }), r;
+}
+export {
+  a as addPrefix,
+  O as omitStyleProps,
+  f as removePrefix,
+  o as startsWith,
+  p as subObject,
+  l as subStyleProps
+};
+//# sourceMappingURL=prefix.js.map

package/dist/node_modules/@antv/g6/esm/utils/prefix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefix.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/prefix.js"],"sourcesContent":["import { lowerFirst, upperFirst } from '@antv/util';\n/**\n * <zh/> 是否以某个前缀开头\n *\n * <en/> Whether starts with prefix\n * @param str - <zh/> 字符串 | <en/> string\n * @param prefix - <zh/> 前缀 | <en/> prefix\n * @returns <zh/> 是否以某个前缀开头 | <en/> whether starts with prefix\n */\nexport function startsWith(str, prefix) {\n    if (!str.startsWith(prefix))\n        return false;\n    const nextChart = str[prefix.length];\n    return nextChart >= 'A' && nextChart <= 'Z';\n}\n/**\n * <zh/> 添加前缀\n *\n * <en/> Add prefix\n * @param str - <zh/> 字符串 | <en/> string\n * @param prefix - <zh/> 前缀 | <en/> prefix\n * @returns <zh/> 添加前缀后的字符串 | <en/> string with prefix\n */\nexport function addPrefix(str, prefix) {\n    return `${prefix}${upperFirst(str)}`;\n}\n/**\n * <zh/> 移除前缀\n *\n * <en/> Remove prefix\n * @param string - <zh/> 字符串 | <en/> string\n * @param prefix - <zh/> 前缀 | <en/> prefix\n * @param lowercaseFirstLetter - <zh/> 是否小写首字母 | <en/> whether lowercase first letter\n * @returns <zh/> 移除前缀后的字符串 | <en/> string without prefix\n */\nexport function removePrefix(string, prefix, lowercaseFirstLetter = true) {\n    if (!prefix)\n        return string;\n    if (!startsWith(string, prefix))\n        return string;\n    const str = string.slice(prefix.length);\n    return lowercaseFirstLetter ? lowerFirst(str) : str;\n}\n/**\n * <zh/> 从样式中提取子样式\n *\n * <en/> Extract sub style from style\n * @param style - <zh/> 样式 | <en/> style\n * @param prefix - <zh/> 子样式前缀 | <en/> sub style prefix\n * @returns <zh/> 子样式 | <en/> sub style\n */\nexport function subStyleProps(style, prefix) {\n    const subStyle = Object.entries(style).reduce((acc, [key, value]) => {\n        if (key === 'className' || key === 'class')\n            return acc;\n        if (startsWith(key, prefix)) {\n            Object.assign(acc, { [removePrefix(key, prefix)]: value });\n        }\n        return acc;\n    }, {});\n    // 向下传递透明度，但避免覆盖子样式中的透明度属性\n    // Pass down opacity, but avoid overwriting the opacity property in the sub-style\n    if ('opacity' in style) {\n        const subOpacityKey = addPrefix('opacity', prefix);\n        const opacity = style.opacity;\n        if (subOpacityKey in style) {\n            const subOpacity = style[subOpacityKey];\n            Object.assign(subStyle, { opacity: opacity * subOpacity });\n        }\n        else\n            Object.assign(subStyle, { opacity });\n    }\n    return subStyle;\n}\n/**\n * <zh/> 从对象中提取指定前缀的属性，并移除前缀\n *\n * <en/> Extract properties with the specified prefix from the object and remove the prefix\n * @param obj - <zh/> 对象 | <en/> object\n * @param prefix - <zh/> 前缀 | <en/> prefix\n * @returns <zh/> 新对象 | <en/> new object\n */\nexport function subObject(obj, prefix) {\n    const prefixLength = prefix.length;\n    return Object.keys(obj).reduce((acc, key) => {\n        if (key.startsWith(prefix)) {\n            const newKey = key.slice(prefixLength);\n            acc[newKey] = obj[key];\n        }\n        return acc;\n    }, {});\n}\n/**\n * <zh/> 从样式中排除子样式\n *\n * <en/> Omit sub style from style\n * @param style - <zh/> 样式 | <en/> style\n * @param prefix - <zh/> 子样式前缀 | <en/> sub style prefix\n * @returns <zh/> 排除子样式后的样式 | <en/> style without sub style\n */\nexport function omitStyleProps(style, prefix) {\n    const prefixArray = typeof prefix === 'string' ? [prefix] : prefix;\n    const omitStyle = {};\n    Object.keys(style).forEach((key) => {\n        if (!prefixArray.find((p) => key.startsWith(p))) {\n            omitStyle[key] = style[key];\n        }\n    });\n    return omitStyle;\n}\n/**\n * <zh/> 替换前缀\n *\n * <en/> Replace prefix\n * @param style - <zh/> 样式 | <en/> style\n * @param oldPrefix - <zh/> 旧前缀 | <en/> old prefix\n * @param newPrefix - <zh/> 新前缀 | <en/> new prefix\n * @returns <zh/> 替换前缀后的样式 | <en/> style with replaced prefix\n */\nexport function replacePrefix(style, oldPrefix, newPrefix) {\n    return Object.entries(style).reduce((acc, [key, value]) => {\n        if (startsWith(key, oldPrefix)) {\n            acc[addPrefix(removePrefix(key, oldPrefix, false), newPrefix)] = value;\n        }\n        else {\n            acc[key] = value;\n        }\n        return acc;\n    }, {});\n}\n//# sourceMappingURL=prefix.js.map"],"names":["startsWith","str","prefix","nextChart","addPrefix","upperFirst","removePrefix","string","lowercaseFirstLetter","lowerFirst","subStyleProps","style","subStyle","acc","key","value","subOpacityKey","opacity","subOpacity","subObject","obj","prefixLength","newKey","omitStyleProps","prefixArray","omitStyle","p"],"mappings":";;AASO,SAASA,EAAWC,GAAKC,GAAQ;AACpC,MAAI,CAACD,EAAI,WAAWC,CAAM;AACtB,WAAO;AACX,QAAMC,IAAYF,EAAIC,EAAO,MAAM;AACnC,SAAOC,KAAa,OAAOA,KAAa;AAC5C;AASO,SAASC,EAAUH,GAAKC,GAAQ;AACnC,SAAO,GAAGA,CAAM,GAAGG,EAAWJ,CAAG,CAAC;AACtC;AAUO,SAASK,EAAaC,GAAQL,GAAQM,IAAuB,IAAM;AAGtE,MAFI,CAACN,KAED,CAACF,EAAWO,GAAQL,CAAM;AAC1B,WAAOK;AACX,QAAMN,IAAMM,EAAO,MAAML,EAAO,MAAM;AACtC,SAAOM,IAAuBC,EAAWR,CAAG,IAAIA;AACpD;AASO,SAASS,EAAcC,GAAOT,GAAQ;AACzC,QAAMU,IAAW,OAAO,QAAQD,CAAK,EAAE,OAAO,CAACE,GAAK,CAACC,GAAKC,CAAK,OACvDD,MAAQ,eAAeA,MAAQ,WAE/Bd,EAAWc,GAAKZ,CAAM,KACtB,OAAO,OAAOW,GAAK,EAAE,CAACP,EAAaQ,GAAKZ,CAAM,CAAC,GAAGa,GAAO,GAEtDF,IACR,CAAA,CAAE;AAGL,MAAI,aAAaF,GAAO;AACpB,UAAMK,IAAgBZ,EAAU,WAAWF,CAAM,GAC3Ce,IAAUN,EAAM;AACtB,QAAIK,KAAiBL,GAAO;AACxB,YAAMO,IAAaP,EAAMK,CAAa;AACtC,aAAO,OAAOJ,GAAU,EAAE,SAASK,IAAUC,GAAY;AAAA,IAC7D;AAEI,aAAO,OAAON,GAAU,EAAE,SAAAK,EAAO,CAAE;AAAA,EAC3C;AACA,SAAOL;AACX;AASO,SAASO,EAAUC,GAAKlB,GAAQ;AACnC,QAAMmB,IAAenB,EAAO;AAC5B,SAAO,OAAO,KAAKkB,CAAG,EAAE,OAAO,CAACP,GAAKC,MAAQ;AACzC,QAAIA,EAAI,WAAWZ,CAAM,GAAG;AACxB,YAAMoB,IAASR,EAAI,MAAMO,CAAY;AACrC,MAAAR,EAAIS,CAAM,IAAIF,EAAIN,CAAG;AAAA,IACzB;AACA,WAAOD;AAAA,EACX,GAAG,CAAA,CAAE;AACT;AASO,SAASU,EAAeZ,GAAOT,GAAQ;AAC1C,QAAMsB,IAAc,OAAOtB,KAAW,WAAW,CAACA,CAAM,IAAIA,GACtDuB,IAAY,CAAA;AAClB,gBAAO,KAAKd,CAAK,EAAE,QAAQ,CAACG,MAAQ;AAChC,IAAKU,EAAY,KAAK,CAACE,MAAMZ,EAAI,WAAWY,CAAC,CAAC,MAC1CD,EAAUX,CAAG,IAAIH,EAAMG,CAAG;AAAA,EAElC,CAAC,GACMW;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/print.js

@@ -0,0 +1,25 @@
+import { version as n } from "../version.js";
+const e = "G6";
+function r(o) {
+  return `[${e} v${n}] ${o}`;
+}
+const s = {
+  mute: !1,
+  debug: (o) => {
+    console.debug(r(o));
+  },
+  info: (o) => {
+    console.info(r(o));
+  },
+  warn: (o) => {
+    console.warn(r(o));
+  },
+  error: (o) => {
+    console.error(r(o));
+  }
+};
+export {
+  r as format,
+  s as print
+};
+//# sourceMappingURL=print.js.map

package/dist/node_modules/@antv/g6/esm/utils/print.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"print.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/print.js"],"sourcesContent":["/* global console */\n/* eslint no-console: \"off\" */\nimport { version } from '../version';\nconst BRAND = 'G6';\n/**\n * <zh/> 格式化打印\n *\n * <en/> Format print\n * @param message - <zh/> 消息 | <en/> Message\n * @returns <zh/> 格式化后的消息 | <en/> Formatted message\n */\nexport function format(message) {\n    return `[${BRAND} v${version}] ${message}`;\n}\nexport const print = {\n    mute: false,\n    debug: (message) => {\n        !print.mute && console.debug(format(message));\n    },\n    info: (message) => {\n        !print.mute && console.info(format(message));\n    },\n    warn: (message) => {\n        !print.mute && console.warn(format(message));\n    },\n    error: (message) => {\n        !print.mute && console.error(format(message));\n    },\n};\n//# sourceMappingURL=print.js.map"],"names":["BRAND","format","message","version","print"],"mappings":";AAGA,MAAMA,IAAQ;AAQP,SAASC,EAAOC,GAAS;AAC5B,SAAO,IAAIF,CAAK,KAAKG,CAAO,KAAKD,CAAO;AAC5C;AACY,MAACE,IAAQ;AAAA,EACjB,MAAM;AAAA,EACN,OAAO,CAACF,MAAY;AACD,YAAQ,MAAMD,EAAOC,CAAO,CAAC;AAAA,EAChD;AAAA,EACA,MAAM,CAACA,MAAY;AACA,YAAQ,KAAKD,EAAOC,CAAO,CAAC;AAAA,EAC/C;AAAA,EACA,MAAM,CAACA,MAAY;AACA,YAAQ,KAAKD,EAAOC,CAAO,CAAC;AAAA,EAC/C;AAAA,EACA,OAAO,CAACA,MAAY;AACD,YAAQ,MAAMD,EAAOC,CAAO,CAAC;AAAA,EAChD;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/g6/esm/utils/relation.js

@@ -0,0 +1,25 @@
+import { idOf as g } from "./id.js";
+import { bfs as m } from "./traverse.js";
+function l(e, u, s, o, a = "both") {
+  if (u === "combo" || u === "node")
+    return i(e, s, o, a);
+  const n = e.getEdgeData(s);
+  if (!n)
+    return [];
+  const f = i(e, n.source, o - 1, a), r = i(e, n.target, o - 1, a);
+  return Array.from(/* @__PURE__ */ new Set([...f, ...r, s]));
+}
+function i(e, u, s, o = "both") {
+  const a = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), f = /* @__PURE__ */ new Set();
+  return m(u, (r, t) => {
+    t > s || (f.add(r), e.getRelatedEdgesData(r, o).forEach((d) => {
+      const c = g(d);
+      !n.has(c) && t < s && (f.add(c), n.add(c));
+    }));
+  }, (r) => e.getRelatedEdgesData(r, o).map((t) => t.source === r ? t.target : t.source).filter((t) => a.has(t) ? !1 : (a.add(t), !0))), Array.from(f);
+}
+export {
+  l as getElementNthDegreeIds,
+  i as getNodeNthDegreeIds
+};
+//# sourceMappingURL=relation.js.map

package/dist/node_modules/@antv/g6/esm/utils/relation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.js","sources":["../../../../../../node_modules/@antv/g6/esm/utils/relation.js"],"sourcesContent":["import { idOf } from './id';\nimport { bfs } from './traverse';\n/**\n * <zh/> 获取指定元素在 n 度关系内的所有元素的 ID\n *\n * <en/> Get the IDs of all elements within an n-degree relationship from the specified element\n * @remarks\n * <zh/> 对于节点，0 度关系是节点本身，1 度关系包括节点的直接相邻节点和边，以此类推。\n * 对于边，0 度关系是边本身，1 度关系包括边本身及其两个端点，以此类推。\n *\n * <en/> For a node, 0-degree relationship includes the node itself; 1-degree relationship includes the node's direct neighbors and their connecting edges, etc.\n * For an edge, 0-degree relationship includes the edge itself; 1-degree relationship includes the edge and its two endpoints, etc\n * @param graph - <zh/> 图实例 | <en/> graph instance\n * @param elementType - <zh/> 元素类型 | <en/> element type\n * @param elementId - <zh/> 起始元素的 ID | <en/> start element ID\n * @param degree - <zh/> 指定的度数 | <en/> the specified degree\n * @param direction - <zh/> 边的方向 | <en/> edge direction\n * @returns - <zh/> 返回节点和边的 ID 数组 | <en/> Returns an array of node and edge IDs\n */\nexport function getElementNthDegreeIds(graph, elementType, elementId, degree, direction = 'both') {\n    if (elementType === 'combo' || elementType === 'node') {\n        return getNodeNthDegreeIds(graph, elementId, degree, direction);\n    }\n    const edgeData = graph.getEdgeData(elementId);\n    if (!edgeData)\n        return [];\n    const sourceRelations = getNodeNthDegreeIds(graph, edgeData.source, degree - 1, direction);\n    const targetRelations = getNodeNthDegreeIds(graph, edgeData.target, degree - 1, direction);\n    return Array.from(new Set([...sourceRelations, ...targetRelations, elementId]));\n}\n/**\n * <zh/> 获取指定节点在 n 度关系内的所有元素的 ID\n *\n * <en/> Get all elements IDs within n-degree relationship of the specified node\n * @remarks\n * <zh/> 节点的 0 度关系是节点本身，1 度关系是节点的直接相邻节点和边，以此类推\n * @param direction\n * <en/> 0-degree relationship of a node is the node itself; 1-degree relationship is the node's neighboring nodes and related edges, etc\n * @param graph - <zh/> 图实例 | <en/> graph instance\n * @param startNodeId - <zh/> 起始节点的 ID | <en/> The ID of the starting node\n * @param degree - <zh/> 指定的度数 | <en/> The specified degree\n * @param direction - <zh/> 边的方向 | <en/> The direction of the edge\n * @returns - <zh/> 返回节点和边的 ID 数组 | <en/> Returns an array of node and edge IDs\n */\nexport function getNodeNthDegreeIds(graph, startNodeId, degree, direction = 'both') {\n    const visitedNodes = new Set();\n    const visitedEdges = new Set();\n    const relations = new Set();\n    bfs(startNodeId, (nodeId, depth) => {\n        if (depth > degree)\n            return;\n        relations.add(nodeId);\n        graph.getRelatedEdgesData(nodeId, direction).forEach((edge) => {\n            const edgeId = idOf(edge);\n            if (!visitedEdges.has(edgeId) && depth < degree) {\n                relations.add(edgeId);\n                visitedEdges.add(edgeId);\n            }\n        });\n    }, (nodeId) => {\n        return graph\n            .getRelatedEdgesData(nodeId, direction)\n            .map((edge) => (edge.source === nodeId ? edge.target : edge.source))\n            .filter((neighborNodeId) => {\n            if (!visitedNodes.has(neighborNodeId)) {\n                visitedNodes.add(neighborNodeId);\n                return true;\n            }\n            return false;\n        });\n    });\n    return Array.from(relations);\n}\n//# sourceMappingURL=relation.js.map"],"names":["getElementNthDegreeIds","graph","elementType","elementId","degree","direction","getNodeNthDegreeIds","edgeData","sourceRelations","targetRelations","startNodeId","visitedNodes","visitedEdges","relations","bfs","nodeId","depth","edge","edgeId","idOf","neighborNodeId"],"mappings":";;AAmBO,SAASA,EAAuBC,GAAOC,GAAaC,GAAWC,GAAQC,IAAY,QAAQ;AAC9F,MAAIH,MAAgB,WAAWA,MAAgB;AAC3C,WAAOI,EAAoBL,GAAOE,GAAWC,GAAQC,CAAS;AAElE,QAAME,IAAWN,EAAM,YAAYE,CAAS;AAC5C,MAAI,CAACI;AACD,WAAO,CAAA;AACX,QAAMC,IAAkBF,EAAoBL,GAAOM,EAAS,QAAQH,IAAS,GAAGC,CAAS,GACnFI,IAAkBH,EAAoBL,GAAOM,EAAS,QAAQH,IAAS,GAAGC,CAAS;AACzF,SAAO,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAGG,GAAiB,GAAGC,GAAiBN,CAAS,CAAC,CAAC;AAClF;AAeO,SAASG,EAAoBL,GAAOS,GAAaN,GAAQC,IAAY,QAAQ;AAChF,QAAMM,IAAe,oBAAI,IAAG,GACtBC,IAAe,oBAAI,IAAG,GACtBC,IAAY,oBAAI,IAAG;AACzB,SAAAC,EAAIJ,GAAa,CAACK,GAAQC,MAAU;AAChC,IAAIA,IAAQZ,MAEZS,EAAU,IAAIE,CAAM,GACpBd,EAAM,oBAAoBc,GAAQV,CAAS,EAAE,QAAQ,CAACY,MAAS;AAC3D,YAAMC,IAASC,EAAKF,CAAI;AACxB,MAAI,CAACL,EAAa,IAAIM,CAAM,KAAKF,IAAQZ,MACrCS,EAAU,IAAIK,CAAM,GACpBN,EAAa,IAAIM,CAAM;AAAA,IAE/B,CAAC;AAAA,EACL,GAAG,CAACH,MACOd,EACF,oBAAoBc,GAAQV,CAAS,EACrC,IAAI,CAACY,MAAUA,EAAK,WAAWF,IAASE,EAAK,SAASA,EAAK,MAAO,EAClE,OAAO,CAACG,MACJT,EAAa,IAAIS,CAAc,IAI7B,MAHHT,EAAa,IAAIS,CAAc,GACxB,GAGd,CACJ,GACM,MAAM,KAAKP,CAAS;AAC/B;","x_google_ignoreList":[0]}