@seed-ship/mcp-ui-solid 5.7.0 → 6.0.0

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

@@ -0,0 +1,25 @@
+import { parsePlacement } from "./placement.js";
+function positionOf(datum) {
+  const { x = 0, y = 0, z = 0 } = datum.style || {};
+  return [+x, +y, +z];
+}
+function hasPosition(datum) {
+  const { x, y, z } = datum.style || {};
+  return x !== void 0 || y !== void 0 || z !== void 0;
+}
+function getXYByRelativePlacement(bbox, placement) {
+  const [x, y] = placement;
+  const { min, max } = bbox;
+  return [min[0] + x * (max[0] - min[0]), min[1] + y * (max[1] - min[1])];
+}
+function getXYByPlacement(bbox, placement = "center") {
+  const relativePlacement = parsePlacement(placement);
+  return getXYByRelativePlacement(bbox, relativePlacement);
+}
+export {
+  getXYByPlacement,
+  getXYByRelativePlacement,
+  hasPosition,
+  positionOf
+};
+//# sourceMappingURL=position.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"position.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";AASO,SAAS,WAAW,OAAO;AAC9B,QAAM,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAC,IAAK,MAAM,SAAS,CAAA;AAC/C,SAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACtB;AAQO,SAAS,YAAY,OAAO;AAC/B,QAAM,EAAE,GAAG,GAAG,EAAC,IAAK,MAAM,SAAS,CAAA;AACnC,SAAO,MAAM,UAAa,MAAM,UAAa,MAAM;AACvD;AASO,SAAS,yBAAyB,MAAM,WAAW;AACtD,QAAM,CAAC,GAAG,CAAC,IAAI;AACf,QAAM,EAAE,KAAK,IAAG,IAAK;AACrB,SAAO,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE;AAC1E;AASO,SAAS,iBAAiB,MAAM,YAAY,UAAU;AACzD,QAAM,oBAAoB,eAAe,SAAS;AAClD,SAAO,yBAAyB,MAAM,iBAAiB;AAC3D;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/prefix.cjs

@@ -0,0 +1,68 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lowerFirst = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/lower-first.cjs");
+const upperFirst = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/upper-first.cjs");
+function startsWith(str, prefix) {
+  if (!str.startsWith(prefix))
+    return false;
+  const nextChart = str[prefix.length];
+  return nextChart >= "A" && nextChart <= "Z";
+}
+function addPrefix(str, prefix) {
+  return `${prefix}${upperFirst(str)}`;
+}
+function removePrefix(string, prefix, lowercaseFirstLetter = true) {
+  if (!prefix)
+    return string;
+  if (!startsWith(string, prefix))
+    return string;
+  const str = string.slice(prefix.length);
+  return lowercaseFirstLetter ? lowerFirst(str) : str;
+}
+function subStyleProps(style, prefix) {
+  const subStyle = Object.entries(style).reduce((acc, [key, value]) => {
+    if (key === "className" || key === "class")
+      return acc;
+    if (startsWith(key, prefix)) {
+      Object.assign(acc, { [removePrefix(key, prefix)]: value });
+    }
+    return acc;
+  }, {});
+  if ("opacity" in style) {
+    const subOpacityKey = addPrefix("opacity", prefix);
+    const opacity = style.opacity;
+    if (subOpacityKey in style) {
+      const subOpacity = style[subOpacityKey];
+      Object.assign(subStyle, { opacity: opacity * subOpacity });
+    } else
+      Object.assign(subStyle, { opacity });
+  }
+  return subStyle;
+}
+function subObject(obj, prefix) {
+  const prefixLength = prefix.length;
+  return Object.keys(obj).reduce((acc, key) => {
+    if (key.startsWith(prefix)) {
+      const newKey = key.slice(prefixLength);
+      acc[newKey] = obj[key];
+    }
+    return acc;
+  }, {});
+}
+function omitStyleProps(style, prefix) {
+  const prefixArray = typeof prefix === "string" ? [prefix] : prefix;
+  const omitStyle = {};
+  Object.keys(style).forEach((key) => {
+    if (!prefixArray.find((p) => key.startsWith(p))) {
+      omitStyle[key] = style[key];
+    }
+  });
+  return omitStyle;
+}
+exports.addPrefix = addPrefix;
+exports.omitStyleProps = omitStyleProps;
+exports.removePrefix = removePrefix;
+exports.startsWith = startsWith;
+exports.subObject = subObject;
+exports.subStyleProps = subStyleProps;
+//# sourceMappingURL=prefix.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/prefix.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefix.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";;;;AASO,SAAS,WAAW,KAAK,QAAQ;AACpC,MAAI,CAAC,IAAI,WAAW,MAAM;AACtB,WAAO;AACX,QAAM,YAAY,IAAI,OAAO,MAAM;AACnC,SAAO,aAAa,OAAO,aAAa;AAC5C;AASO,SAAS,UAAU,KAAK,QAAQ;AACnC,SAAO,GAAG,MAAM,GAAG,WAAW,GAAG,CAAC;AACtC;AAUO,SAAS,aAAa,QAAQ,QAAQ,uBAAuB,MAAM;AACtE,MAAI,CAAC;AACD,WAAO;AACX,MAAI,CAAC,WAAW,QAAQ,MAAM;AAC1B,WAAO;AACX,QAAM,MAAM,OAAO,MAAM,OAAO,MAAM;AACtC,SAAO,uBAAuB,WAAW,GAAG,IAAI;AACpD;AASO,SAAS,cAAc,OAAO,QAAQ;AACzC,QAAM,WAAW,OAAO,QAAQ,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM;AACjE,QAAI,QAAQ,eAAe,QAAQ;AAC/B,aAAO;AACX,QAAI,WAAW,KAAK,MAAM,GAAG;AACzB,aAAO,OAAO,KAAK,EAAE,CAAC,aAAa,KAAK,MAAM,CAAC,GAAG,OAAO;AAAA,IAC7D;AACA,WAAO;AAAA,EACX,GAAG,CAAA,CAAE;AAGL,MAAI,aAAa,OAAO;AACpB,UAAM,gBAAgB,UAAU,WAAW,MAAM;AACjD,UAAM,UAAU,MAAM;AACtB,QAAI,iBAAiB,OAAO;AACxB,YAAM,aAAa,MAAM,aAAa;AACtC,aAAO,OAAO,UAAU,EAAE,SAAS,UAAU,YAAY;AAAA,IAC7D;AAEI,aAAO,OAAO,UAAU,EAAE,QAAO,CAAE;AAAA,EAC3C;AACA,SAAO;AACX;AASO,SAAS,UAAU,KAAK,QAAQ;AACnC,QAAM,eAAe,OAAO;AAC5B,SAAO,OAAO,KAAK,GAAG,EAAE,OAAO,CAAC,KAAK,QAAQ;AACzC,QAAI,IAAI,WAAW,MAAM,GAAG;AACxB,YAAM,SAAS,IAAI,MAAM,YAAY;AACrC,UAAI,MAAM,IAAI,IAAI,GAAG;AAAA,IACzB;AACA,WAAO;AAAA,EACX,GAAG,CAAA,CAAE;AACT;AASO,SAAS,eAAe,OAAO,QAAQ;AAC1C,QAAM,cAAc,OAAO,WAAW,WAAW,CAAC,MAAM,IAAI;AAC5D,QAAM,YAAY,CAAA;AAClB,SAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,QAAQ;AAChC,QAAI,CAAC,YAAY,KAAK,CAAC,MAAM,IAAI,WAAW,CAAC,CAAC,GAAG;AAC7C,gBAAU,GAAG,IAAI,MAAM,GAAG;AAAA,IAC9B;AAAA,EACJ,CAAC;AACD,SAAO;AACX;;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,68 @@
+import lowerFirst from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/lower-first.js";
+import upperFirst from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/upper-first.js";
+function startsWith(str, prefix) {
+  if (!str.startsWith(prefix))
+    return false;
+  const nextChart = str[prefix.length];
+  return nextChart >= "A" && nextChart <= "Z";
+}
+function addPrefix(str, prefix) {
+  return `${prefix}${upperFirst(str)}`;
+}
+function removePrefix(string, prefix, lowercaseFirstLetter = true) {
+  if (!prefix)
+    return string;
+  if (!startsWith(string, prefix))
+    return string;
+  const str = string.slice(prefix.length);
+  return lowercaseFirstLetter ? lowerFirst(str) : str;
+}
+function subStyleProps(style, prefix) {
+  const subStyle = Object.entries(style).reduce((acc, [key, value]) => {
+    if (key === "className" || key === "class")
+      return acc;
+    if (startsWith(key, prefix)) {
+      Object.assign(acc, { [removePrefix(key, prefix)]: value });
+    }
+    return acc;
+  }, {});
+  if ("opacity" in style) {
+    const subOpacityKey = addPrefix("opacity", prefix);
+    const opacity = style.opacity;
+    if (subOpacityKey in style) {
+      const subOpacity = style[subOpacityKey];
+      Object.assign(subStyle, { opacity: opacity * subOpacity });
+    } else
+      Object.assign(subStyle, { opacity });
+  }
+  return subStyle;
+}
+function subObject(obj, prefix) {
+  const prefixLength = prefix.length;
+  return Object.keys(obj).reduce((acc, key) => {
+    if (key.startsWith(prefix)) {
+      const newKey = key.slice(prefixLength);
+      acc[newKey] = obj[key];
+    }
+    return acc;
+  }, {});
+}
+function omitStyleProps(style, prefix) {
+  const prefixArray = typeof prefix === "string" ? [prefix] : prefix;
+  const omitStyle = {};
+  Object.keys(style).forEach((key) => {
+    if (!prefixArray.find((p) => key.startsWith(p))) {
+      omitStyle[key] = style[key];
+    }
+  });
+  return omitStyle;
+}
+export {
+  addPrefix,
+  omitStyleProps,
+  removePrefix,
+  startsWith,
+  subObject,
+  subStyleProps
+};
+//# sourceMappingURL=prefix.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"prefix.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";;AASO,SAAS,WAAW,KAAK,QAAQ;AACpC,MAAI,CAAC,IAAI,WAAW,MAAM;AACtB,WAAO;AACX,QAAM,YAAY,IAAI,OAAO,MAAM;AACnC,SAAO,aAAa,OAAO,aAAa;AAC5C;AASO,SAAS,UAAU,KAAK,QAAQ;AACnC,SAAO,GAAG,MAAM,GAAG,WAAW,GAAG,CAAC;AACtC;AAUO,SAAS,aAAa,QAAQ,QAAQ,uBAAuB,MAAM;AACtE,MAAI,CAAC;AACD,WAAO;AACX,MAAI,CAAC,WAAW,QAAQ,MAAM;AAC1B,WAAO;AACX,QAAM,MAAM,OAAO,MAAM,OAAO,MAAM;AACtC,SAAO,uBAAuB,WAAW,GAAG,IAAI;AACpD;AASO,SAAS,cAAc,OAAO,QAAQ;AACzC,QAAM,WAAW,OAAO,QAAQ,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,MAAM;AACjE,QAAI,QAAQ,eAAe,QAAQ;AAC/B,aAAO;AACX,QAAI,WAAW,KAAK,MAAM,GAAG;AACzB,aAAO,OAAO,KAAK,EAAE,CAAC,aAAa,KAAK,MAAM,CAAC,GAAG,OAAO;AAAA,IAC7D;AACA,WAAO;AAAA,EACX,GAAG,CAAA,CAAE;AAGL,MAAI,aAAa,OAAO;AACpB,UAAM,gBAAgB,UAAU,WAAW,MAAM;AACjD,UAAM,UAAU,MAAM;AACtB,QAAI,iBAAiB,OAAO;AACxB,YAAM,aAAa,MAAM,aAAa;AACtC,aAAO,OAAO,UAAU,EAAE,SAAS,UAAU,YAAY;AAAA,IAC7D;AAEI,aAAO,OAAO,UAAU,EAAE,QAAO,CAAE;AAAA,EAC3C;AACA,SAAO;AACX;AASO,SAAS,UAAU,KAAK,QAAQ;AACnC,QAAM,eAAe,OAAO;AAC5B,SAAO,OAAO,KAAK,GAAG,EAAE,OAAO,CAAC,KAAK,QAAQ;AACzC,QAAI,IAAI,WAAW,MAAM,GAAG;AACxB,YAAM,SAAS,IAAI,MAAM,YAAY;AACrC,UAAI,MAAM,IAAI,IAAI,GAAG;AAAA,IACzB;AACA,WAAO;AAAA,EACX,GAAG,CAAA,CAAE;AACT;AASO,SAAS,eAAe,OAAO,QAAQ;AAC1C,QAAM,cAAc,OAAO,WAAW,WAAW,CAAC,MAAM,IAAI;AAC5D,QAAM,YAAY,CAAA;AAClB,SAAO,KAAK,KAAK,EAAE,QAAQ,CAAC,QAAQ;AAChC,QAAI,CAAC,YAAY,KAAK,CAAC,MAAM,IAAI,WAAW,CAAC,CAAC,GAAG;AAC7C,gBAAU,GAAG,IAAI,MAAM,GAAG;AAAA,IAC9B;AAAA,EACJ,CAAC;AACD,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/print.cjs

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const version = require("../version.cjs");
+const BRAND = "G6";
+function format(message) {
+  return `[${BRAND} v${version.version}] ${message}`;
+}
+const print = {
+  mute: false,
+  debug: (message) => {
+    console.debug(format(message));
+  },
+  info: (message) => {
+    console.info(format(message));
+  },
+  warn: (message) => {
+    console.warn(format(message));
+  },
+  error: (message) => {
+    console.error(format(message));
+  }
+};
+exports.format = format;
+exports.print = print;
+//# sourceMappingURL=print.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/print.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"print.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["version"],"mappings":";;;AAGA,MAAM,QAAQ;AAQP,SAAS,OAAO,SAAS;AAC5B,SAAO,IAAI,KAAK,KAAKA,QAAAA,OAAO,KAAK,OAAO;AAC5C;AACY,MAAC,QAAQ;AAAA,EACjB,MAAM;AAAA,EACN,OAAO,CAAC,YAAY;AACD,YAAQ,MAAM,OAAO,OAAO,CAAC;AAAA,EAChD;AAAA,EACA,MAAM,CAAC,YAAY;AACA,YAAQ,KAAK,OAAO,OAAO,CAAC;AAAA,EAC/C;AAAA,EACA,MAAM,CAAC,YAAY;AACA,YAAQ,KAAK,OAAO,OAAO,CAAC;AAAA,EAC/C;AAAA,EACA,OAAO,CAAC,YAAY;AACD,YAAQ,MAAM,OAAO,OAAO,CAAC;AAAA,EAChD;AACJ;;;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"print.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";AAGA,MAAM,QAAQ;AAQP,SAAS,OAAO,SAAS;AAC5B,SAAO,IAAI,KAAK,KAAK,OAAO,KAAK,OAAO;AAC5C;AACY,MAAC,QAAQ;AAAA,EACjB,MAAM;AAAA,EACN,OAAO,CAAC,YAAY;AACD,YAAQ,MAAM,OAAO,OAAO,CAAC;AAAA,EAChD;AAAA,EACA,MAAM,CAAC,YAAY;AACA,YAAQ,KAAK,OAAO,OAAO,CAAC;AAAA,EAC/C;AAAA,EACA,MAAM,CAAC,YAAY;AACA,YAAQ,KAAK,OAAO,OAAO,CAAC;AAAA,EAC/C;AAAA,EACA,OAAO,CAAC,YAAY;AACD,YAAQ,MAAM,OAAO,OAAO,CAAC;AAAA,EAChD;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/relation.cjs

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const id = require("./id.cjs");
+const traverse = require("./traverse.cjs");
+function getElementNthDegreeIds(graph, elementType, elementId, degree, direction = "both") {
+  if (elementType === "combo" || elementType === "node") {
+    return getNodeNthDegreeIds(graph, elementId, degree, direction);
+  }
+  const edgeData = graph.getEdgeData(elementId);
+  if (!edgeData)
+    return [];
+  const sourceRelations = getNodeNthDegreeIds(graph, edgeData.source, degree - 1, direction);
+  const targetRelations = getNodeNthDegreeIds(graph, edgeData.target, degree - 1, direction);
+  return Array.from(/* @__PURE__ */ new Set([...sourceRelations, ...targetRelations, elementId]));
+}
+function getNodeNthDegreeIds(graph, startNodeId, degree, direction = "both") {
+  const visitedNodes = /* @__PURE__ */ new Set();
+  const visitedEdges = /* @__PURE__ */ new Set();
+  const relations = /* @__PURE__ */ new Set();
+  traverse.bfs(startNodeId, (nodeId, depth) => {
+    if (depth > degree)
+      return;
+    relations.add(nodeId);
+    graph.getRelatedEdgesData(nodeId, direction).forEach((edge) => {
+      const edgeId = id.idOf(edge);
+      if (!visitedEdges.has(edgeId) && depth < degree) {
+        relations.add(edgeId);
+        visitedEdges.add(edgeId);
+      }
+    });
+  }, (nodeId) => {
+    return graph.getRelatedEdgesData(nodeId, direction).map((edge) => edge.source === nodeId ? edge.target : edge.source).filter((neighborNodeId) => {
+      if (!visitedNodes.has(neighborNodeId)) {
+        visitedNodes.add(neighborNodeId);
+        return true;
+      }
+      return false;
+    });
+  });
+  return Array.from(relations);
+}
+exports.getElementNthDegreeIds = getElementNthDegreeIds;
+exports.getNodeNthDegreeIds = getNodeNthDegreeIds;
+//# sourceMappingURL=relation.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/relation.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["bfs","idOf"],"mappings":";;;;AAmBO,SAAS,uBAAuB,OAAO,aAAa,WAAW,QAAQ,YAAY,QAAQ;AAC9F,MAAI,gBAAgB,WAAW,gBAAgB,QAAQ;AACnD,WAAO,oBAAoB,OAAO,WAAW,QAAQ,SAAS;AAAA,EAClE;AACA,QAAM,WAAW,MAAM,YAAY,SAAS;AAC5C,MAAI,CAAC;AACD,WAAO,CAAA;AACX,QAAM,kBAAkB,oBAAoB,OAAO,SAAS,QAAQ,SAAS,GAAG,SAAS;AACzF,QAAM,kBAAkB,oBAAoB,OAAO,SAAS,QAAQ,SAAS,GAAG,SAAS;AACzF,SAAO,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAG,iBAAiB,GAAG,iBAAiB,SAAS,CAAC,CAAC;AAClF;AAeO,SAAS,oBAAoB,OAAO,aAAa,QAAQ,YAAY,QAAQ;AAChF,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,YAAY,oBAAI,IAAG;AACzBA,WAAAA,IAAI,aAAa,CAAC,QAAQ,UAAU;AAChC,QAAI,QAAQ;AACR;AACJ,cAAU,IAAI,MAAM;AACpB,UAAM,oBAAoB,QAAQ,SAAS,EAAE,QAAQ,CAAC,SAAS;AAC3D,YAAM,SAASC,GAAAA,KAAK,IAAI;AACxB,UAAI,CAAC,aAAa,IAAI,MAAM,KAAK,QAAQ,QAAQ;AAC7C,kBAAU,IAAI,MAAM;AACpB,qBAAa,IAAI,MAAM;AAAA,MAC3B;AAAA,IACJ,CAAC;AAAA,EACL,GAAG,CAAC,WAAW;AACX,WAAO,MACF,oBAAoB,QAAQ,SAAS,EACrC,IAAI,CAAC,SAAU,KAAK,WAAW,SAAS,KAAK,SAAS,KAAK,MAAO,EAClE,OAAO,CAAC,mBAAmB;AAC5B,UAAI,CAAC,aAAa,IAAI,cAAc,GAAG;AACnC,qBAAa,IAAI,cAAc;AAC/B,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX,CAAC;AAAA,EACL,CAAC;AACD,SAAO,MAAM,KAAK,SAAS;AAC/B;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,44 @@
+import { idOf } from "./id.js";
+import { bfs } from "./traverse.js";
+function getElementNthDegreeIds(graph, elementType, elementId, degree, direction = "both") {
+  if (elementType === "combo" || elementType === "node") {
+    return getNodeNthDegreeIds(graph, elementId, degree, direction);
+  }
+  const edgeData = graph.getEdgeData(elementId);
+  if (!edgeData)
+    return [];
+  const sourceRelations = getNodeNthDegreeIds(graph, edgeData.source, degree - 1, direction);
+  const targetRelations = getNodeNthDegreeIds(graph, edgeData.target, degree - 1, direction);
+  return Array.from(/* @__PURE__ */ new Set([...sourceRelations, ...targetRelations, elementId]));
+}
+function getNodeNthDegreeIds(graph, startNodeId, degree, direction = "both") {
+  const visitedNodes = /* @__PURE__ */ new Set();
+  const visitedEdges = /* @__PURE__ */ new Set();
+  const relations = /* @__PURE__ */ new Set();
+  bfs(startNodeId, (nodeId, depth) => {
+    if (depth > degree)
+      return;
+    relations.add(nodeId);
+    graph.getRelatedEdgesData(nodeId, direction).forEach((edge) => {
+      const edgeId = idOf(edge);
+      if (!visitedEdges.has(edgeId) && depth < degree) {
+        relations.add(edgeId);
+        visitedEdges.add(edgeId);
+      }
+    });
+  }, (nodeId) => {
+    return graph.getRelatedEdgesData(nodeId, direction).map((edge) => edge.source === nodeId ? edge.target : edge.source).filter((neighborNodeId) => {
+      if (!visitedNodes.has(neighborNodeId)) {
+        visitedNodes.add(neighborNodeId);
+        return true;
+      }
+      return false;
+    });
+  });
+  return Array.from(relations);
+}
+export {
+  getElementNthDegreeIds,
+  getNodeNthDegreeIds
+};
+//# sourceMappingURL=relation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"relation.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";;AAmBO,SAAS,uBAAuB,OAAO,aAAa,WAAW,QAAQ,YAAY,QAAQ;AAC9F,MAAI,gBAAgB,WAAW,gBAAgB,QAAQ;AACnD,WAAO,oBAAoB,OAAO,WAAW,QAAQ,SAAS;AAAA,EAClE;AACA,QAAM,WAAW,MAAM,YAAY,SAAS;AAC5C,MAAI,CAAC;AACD,WAAO,CAAA;AACX,QAAM,kBAAkB,oBAAoB,OAAO,SAAS,QAAQ,SAAS,GAAG,SAAS;AACzF,QAAM,kBAAkB,oBAAoB,OAAO,SAAS,QAAQ,SAAS,GAAG,SAAS;AACzF,SAAO,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAG,iBAAiB,GAAG,iBAAiB,SAAS,CAAC,CAAC;AAClF;AAeO,SAAS,oBAAoB,OAAO,aAAa,QAAQ,YAAY,QAAQ;AAChF,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,eAAe,oBAAI,IAAG;AAC5B,QAAM,YAAY,oBAAI,IAAG;AACzB,MAAI,aAAa,CAAC,QAAQ,UAAU;AAChC,QAAI,QAAQ;AACR;AACJ,cAAU,IAAI,MAAM;AACpB,UAAM,oBAAoB,QAAQ,SAAS,EAAE,QAAQ,CAAC,SAAS;AAC3D,YAAM,SAAS,KAAK,IAAI;AACxB,UAAI,CAAC,aAAa,IAAI,MAAM,KAAK,QAAQ,QAAQ;AAC7C,kBAAU,IAAI,MAAM;AACpB,qBAAa,IAAI,MAAM;AAAA,MAC3B;AAAA,IACJ,CAAC;AAAA,EACL,GAAG,CAAC,WAAW;AACX,WAAO,MACF,oBAAoB,QAAQ,SAAS,EACrC,IAAI,CAAC,SAAU,KAAK,WAAW,SAAS,KAAK,SAAS,KAAK,MAAO,EAClE,OAAO,CAAC,mBAAmB;AAC5B,UAAI,CAAC,aAAa,IAAI,cAAc,GAAG;AACnC,qBAAa,IAAI,cAAc;AAC/B,eAAO;AAAA,MACX;AACA,aAAO;AAAA,IACX,CAAC;AAAA,EACL,CAAC;AACD,SAAO,MAAM,KAAK,SAAS;AAC/B;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/router/orth.cjs

@@ -0,0 +1,198 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const bbox = require("../bbox.cjs");
+const point = require("../point.cjs");
+const vector = require("../vector.cjs");
+const isEqual = require("../../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-equal.cjs");
+const difference = require("../../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/difference.cjs");
+const defaultOptions = {
+  padding: 10
+};
+function orth(sourcePoint, targetPoint, sourceNode, targetNode, controlPoints, options) {
+  const { padding } = Object.assign(defaultOptions, options);
+  const sourceBBox = bbox.getNodeBBox(sourceNode, padding);
+  const targetBBox = bbox.getNodeBBox(targetNode, padding);
+  const points = [sourcePoint, ...controlPoints, targetPoint];
+  let direction = null;
+  const result = [];
+  for (let fromIdx = 0, len = points.length; fromIdx < len - 1; fromIdx++) {
+    const toIdx = fromIdx + 1;
+    const from = points[fromIdx];
+    const to = points[toIdx];
+    const isOrth = point.isOrthogonal(from, to);
+    let route = null;
+    if (fromIdx === 0) {
+      if (toIdx === len - 1) {
+        if (sourceBBox.intersects(targetBBox)) {
+          route = insideNode(from, to, sourceBBox, targetBBox);
+        } else if (!bbox.isPointBBoxCenter(from, sourceBBox) && !bbox.isPointBBoxCenter(to, targetBBox)) {
+          const fromWithPadding = bbox.getNearestBoundaryPoint(from, sourceBBox);
+          const toWithPadding = bbox.getNearestBoundaryPoint(to, targetBBox);
+          route = pointToPoint(fromWithPadding, toWithPadding, getDirection(fromWithPadding, toWithPadding));
+          route.points.unshift(fromWithPadding);
+          route.points.push(toWithPadding);
+        } else if (!isOrth) {
+          route = nodeToNode(from, to, sourceBBox, targetBBox);
+        }
+      } else {
+        if (bbox.isPointInBBox(to, sourceBBox)) {
+          route = insideNode(from, to, sourceBBox, bbox.getNodeBBox(to, padding), direction);
+        } else if (!isOrth) {
+          route = nodeToPoint(from, to, sourceBBox);
+        }
+      }
+    } else if (toIdx === len - 1) {
+      if (bbox.isPointInBBox(from, targetBBox)) {
+        route = insideNode(from, to, bbox.getNodeBBox(from, padding), targetBBox, direction);
+      } else if (!isOrth) {
+        route = pointToNode(from, to, targetBBox, direction);
+      }
+    } else if (!isOrth) {
+      route = pointToPoint(from, to, direction);
+    }
+    if (route) {
+      result.push(...route.points);
+      direction = route.direction;
+    } else {
+      direction = getDirection(from, to);
+    }
+    if (toIdx < len - 1)
+      result.push(to);
+  }
+  return result.map(vector.toVector2);
+}
+const opposites = {
+  N: "S",
+  S: "N",
+  W: "E",
+  E: "W"
+};
+const radians = {
+  N: -Math.PI / 2,
+  S: Math.PI / 2,
+  E: 0,
+  W: Math.PI
+};
+function getDirection(from, to) {
+  const [fx, fy] = from;
+  const [tx, ty] = to;
+  if (fx === tx) {
+    return fy > ty ? "N" : "S";
+  }
+  if (fy === ty) {
+    return fx > tx ? "W" : "E";
+  }
+  return null;
+}
+function getBBoxSize(bbox$1, direction) {
+  return direction === "N" || direction === "S" ? bbox.getBBoxHeight(bbox$1) : bbox.getBBoxWidth(bbox$1);
+}
+function pointToPoint(from, to, direction) {
+  const p1 = [from[0], to[1]];
+  const p2 = [to[0], from[1]];
+  const d1 = getDirection(from, p1);
+  const d2 = getDirection(from, p2);
+  const opposite = direction ? opposites[direction] : null;
+  const p = d1 === direction || d1 !== opposite && d2 !== direction ? p1 : p2;
+  return { points: [p], direction: getDirection(p, to) };
+}
+function nodeToPoint(from, to, fromBBox) {
+  if (bbox.isPointBBoxCenter(from, fromBBox)) {
+    const p = freeJoin(from, to, fromBBox);
+    return { points: [p], direction: getDirection(p, to) };
+  } else {
+    const fromWithPadding = bbox.getNearestBoundaryPoint(from, fromBBox);
+    const isHorizontal = ["left", "right"].includes(bbox.getNearestBoundarySide(from, fromBBox));
+    const p = isHorizontal ? [to[0], fromWithPadding[1]] : [fromWithPadding[0], to[1]];
+    return { points: [p], direction: getDirection(p, to) };
+  }
+}
+function pointToNode(from, to, toBBox, direction) {
+  const toWithPadding = bbox.isPointBBoxCenter(to, toBBox) ? to : bbox.getNearestBoundaryPoint(to, toBBox);
+  const points = [
+    [toWithPadding[0], from[1]],
+    [from[0], toWithPadding[1]]
+  ];
+  const freePoints = points.filter((p) => bbox.isPointOutsideBBox(p, toBBox) && !bbox.isPointOnBBoxBoundary(p, toBBox, true));
+  const freeDirectionPoints = freePoints.filter((p) => getDirection(p, from) !== direction);
+  if (freeDirectionPoints.length > 0) {
+    const p = freeDirectionPoints.find((p2) => getDirection(from, p2) === direction) || freeDirectionPoints[0];
+    return {
+      points: [p],
+      direction: getDirection(p, to)
+    };
+  } else {
+    const p = difference(points, freePoints)[0];
+    const p2 = point.moveTo(to, p, getBBoxSize(toBBox, direction) / 2);
+    const p1 = freeJoin(p2, from, toBBox);
+    return {
+      points: [p1, p2],
+      direction: getDirection(p2, to)
+    };
+  }
+}
+function nodeToNode(from, to, fromBBox, toBBox) {
+  let route = nodeToPoint(from, to, fromBBox);
+  const p1 = vector.toVector3(route.points[0]);
+  if (bbox.isPointInBBox(p1, toBBox)) {
+    route = nodeToPoint(to, from, toBBox);
+    const p2 = vector.toVector3(route.points[0]);
+    if (bbox.isPointInBBox(p2, fromBBox)) {
+      const fromBorder = point.moveTo(from, p1, getBBoxSize(fromBBox, getDirection(from, p1)) / 2);
+      const toBorder = point.moveTo(to, p2, getBBoxSize(toBBox, getDirection(to, p2)) / 2);
+      const midPoint = [(fromBorder[0] + toBorder[0]) / 2, (fromBorder[1] + toBorder[1]) / 2];
+      const startRoute = nodeToPoint(from, midPoint, fromBBox);
+      const endRoute = pointToNode(midPoint, to, toBBox, startRoute.direction);
+      route.points = [startRoute.points[0], endRoute.points[0]];
+      route.direction = endRoute.direction;
+    }
+  }
+  return route;
+}
+function insideNode(from, to, fromBBox, toBBox, direction) {
+  const DEFAULT_OFFSET = 0.01;
+  const boundary = bbox.getCombinedBBox([fromBBox, toBBox]);
+  const reversed = vector.distance(to, boundary.center) > vector.distance(from, boundary.center);
+  const [start, end] = reversed ? [to, from] : [from, to];
+  const halfPerimeter = bbox.getBBoxHeight(boundary) + bbox.getBBoxWidth(boundary);
+  let p1;
+  if (direction) {
+    const ref = [
+      start[0] + halfPerimeter * Math.cos(radians[direction]),
+      start[1] + halfPerimeter * Math.sin(radians[direction])
+    ];
+    p1 = point.moveTo(bbox.getNearestBoundaryPoint(ref, boundary), ref, DEFAULT_OFFSET);
+  } else {
+    p1 = point.moveTo(bbox.getNearestBoundaryPoint(start, boundary), start, -DEFAULT_OFFSET);
+  }
+  let p2 = freeJoin(p1, end, boundary);
+  let points = [point.round(p1, 2), point.round(p2, 2)];
+  if (isEqual(point.round(p1), point.round(p2))) {
+    const rad = vector.angle(vector.subtract(p1, start), [1, 0, 0]) + Math.PI / 2;
+    p2 = [end[0] + halfPerimeter * Math.cos(rad), end[1] + halfPerimeter * Math.sin(rad), 0];
+    p2 = point.round(point.moveTo(bbox.getNearestBoundaryPoint(p2, boundary), end, -DEFAULT_OFFSET), 2);
+    const p3 = freeJoin(p1, p2, boundary);
+    points = [p1, p3, p2];
+  }
+  return {
+    points: reversed ? points.reverse() : points,
+    direction: reversed ? getDirection(p1, to) : getDirection(p2, to)
+  };
+}
+function freeJoin(p1, p2, bbox$1) {
+  let p = [p1[0], p2[1]];
+  if (bbox.isPointInBBox(p, bbox$1)) {
+    p = [p2[0], p1[1]];
+  }
+  return p;
+}
+exports.freeJoin = freeJoin;
+exports.getBBoxSize = getBBoxSize;
+exports.getDirection = getDirection;
+exports.insideNode = insideNode;
+exports.nodeToNode = nodeToNode;
+exports.nodeToPoint = nodeToPoint;
+exports.orth = orth;
+exports.pointToNode = pointToNode;
+exports.pointToPoint = pointToPoint;
+//# sourceMappingURL=orth.cjs.map

package/dist/node_modules/.pnpm/@antv_g6@5.1.0/node_modules/@antv/g6/esm/utils/router/orth.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"orth.cjs","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/node_modules/@antv/g6/esm/utils/router/orth.js"],"sourcesContent":["import { difference, isEqual } from '@antv/util';\nimport { getBBoxHeight, getBBoxWidth, getCombinedBBox, getNearestBoundaryPoint, getNearestBoundarySide, getNodeBBox, isPointBBoxCenter, isPointInBBox, isPointOnBBoxBoundary, isPointOutsideBBox, } from '../bbox';\nimport { isOrthogonal, moveTo, round } from '../point';\nimport { angle, distance, subtract, toVector2, toVector3 } from '../vector';\nconst defaultOptions = {\n    padding: 10,\n};\n/**\n * <zh/> 获取两点之间的正交线段路径\n *\n * <en/> Get orthogonal line segments between two points\n * @param sourcePoint - <zh/> 起始点 | <en/> start point\n * @param targetPoint - <zh/> 终止点 | <en/> end point\n * @param sourceNode - <zh/> 起始节点 | <en/> source node\n * @param targetNode - <zh/> 终止节点 | <en/> target node\n * @param controlPoints - <zh/> 控制点 | <en/> control points\n * @param options - <zh/> 配置项 | <en/> options\n * @returns <zh/> 路径点集 | <en/> vertices\n */\nexport function orth(sourcePoint, targetPoint, sourceNode, targetNode, controlPoints, options) {\n    const { padding } = Object.assign(defaultOptions, options);\n    const sourceBBox = getNodeBBox(sourceNode, padding);\n    const targetBBox = getNodeBBox(targetNode, padding);\n    const points = [sourcePoint, ...controlPoints, targetPoint];\n    // direction of previous route segment\n    let direction = null;\n    const result = [];\n    for (let fromIdx = 0, len = points.length; fromIdx < len - 1; fromIdx++) {\n        const toIdx = fromIdx + 1;\n        const from = points[fromIdx];\n        const to = points[toIdx];\n        const isOrth = isOrthogonal(from, to);\n        let route = null;\n        if (fromIdx === 0) {\n            if (toIdx === len - 1) {\n                // source -> target\n                if (sourceBBox.intersects(targetBBox)) {\n                    route = insideNode(from, to, sourceBBox, targetBBox);\n                }\n                else if (!isPointBBoxCenter(from, sourceBBox) && !isPointBBoxCenter(to, targetBBox)) {\n                    const fromWithPadding = getNearestBoundaryPoint(from, sourceBBox);\n                    const toWithPadding = getNearestBoundaryPoint(to, targetBBox);\n                    route = pointToPoint(fromWithPadding, toWithPadding, getDirection(fromWithPadding, toWithPadding));\n                    route.points.unshift(fromWithPadding);\n                    route.points.push(toWithPadding);\n                }\n                else if (!isOrth) {\n                    route = nodeToNode(from, to, sourceBBox, targetBBox);\n                }\n            }\n            else {\n                // source -> point\n                if (isPointInBBox(to, sourceBBox)) {\n                    route = insideNode(from, to, sourceBBox, getNodeBBox(to, padding), direction);\n                }\n                else if (!isOrth) {\n                    route = nodeToPoint(from, to, sourceBBox);\n                }\n            }\n        }\n        else if (toIdx === len - 1) {\n            // point -> target\n            if (isPointInBBox(from, targetBBox)) {\n                route = insideNode(from, to, getNodeBBox(from, padding), targetBBox, direction);\n            }\n            else if (!isOrth) {\n                route = pointToNode(from, to, targetBBox, direction);\n            }\n        }\n        else if (!isOrth) {\n            // point -> point\n            route = pointToPoint(from, to, direction);\n        }\n        // set direction for next iteration\n        if (route) {\n            result.push(...route.points);\n            direction = route.direction;\n        }\n        else {\n            // orthogonal route and not looped\n            direction = getDirection(from, to);\n        }\n        if (toIdx < len - 1)\n            result.push(to);\n    }\n    return result.map(toVector2);\n}\n/**\n * Direction to opposites direction map\n */\nconst opposites = {\n    N: 'S',\n    S: 'N',\n    W: 'E',\n    E: 'W',\n};\n/**\n * Direction to radians map\n */\nconst radians = {\n    N: -Math.PI / 2,\n    S: Math.PI / 2,\n    E: 0,\n    W: Math.PI,\n};\n/**\n * <zh/> 获取两点之间的方向，从 `from` 到 `to` 的方向\n *\n * <en/> Get the direction between two points, the direction from `from` to `to`\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @returns <zh/> 方向 | <en/> direction\n */\nexport function getDirection(from, to) {\n    const [fx, fy] = from;\n    const [tx, ty] = to;\n    if (fx === tx) {\n        return fy > ty ? 'N' : 'S';\n    }\n    if (fy === ty) {\n        return fx > tx ? 'W' : 'E';\n    }\n    return null;\n}\n/**\n * <zh/> 获取包围盒的尺寸，根据方向返回宽度或者高度\n *\n * <en/> Get the size of the bounding box, return the width or height according to the direction\n * @param bbox - <zh/> 包围盒 | <en/> bounding box\n * @param direction - <zh/> 方向 | <en/> direction\n * @returns <zh/> 尺寸 | <en/> size\n */\nexport function getBBoxSize(bbox, direction) {\n    return direction === 'N' || direction === 'S' ? getBBoxHeight(bbox) : getBBoxWidth(bbox);\n}\n/**\n * <zh/> 从一个点到另一个点计算正交路由\n *\n * <en/> Calculate orthogonal route from one point to another\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param direction - <zh/> 前一条线段的方向 | <en/> direction of the previous segment\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function pointToPoint(from, to, direction) {\n    const p1 = [from[0], to[1]];\n    const p2 = [to[0], from[1]];\n    const d1 = getDirection(from, p1);\n    const d2 = getDirection(from, p2);\n    const opposite = direction ? opposites[direction] : null;\n    const p = d1 === direction || (d1 !== opposite && d2 !== direction) ? p1 : p2;\n    return { points: [p], direction: getDirection(p, to) };\n}\n/**\n * <zh/> 从节点到点计算正交路由\n *\n * <en/> Calculate orthogonal route from node to point\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param fromBBox - <zh/> 起始节点的包围盒 | <en/> bounding box of the start node\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function nodeToPoint(from, to, fromBBox) {\n    if (isPointBBoxCenter(from, fromBBox)) {\n        const p = freeJoin(from, to, fromBBox);\n        return { points: [p], direction: getDirection(p, to) };\n    }\n    else {\n        const fromWithPadding = getNearestBoundaryPoint(from, fromBBox);\n        const isHorizontal = ['left', 'right'].includes(getNearestBoundarySide(from, fromBBox));\n        const p = isHorizontal ? [to[0], fromWithPadding[1]] : [fromWithPadding[0], to[1]];\n        return { points: [p], direction: getDirection(p, to) };\n    }\n}\n/**\n * <zh/> 从点到节点计算正交路由\n *\n * <en/> Calculate orthogonal route from point to node\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param toBBox - <zh/> 终止节点的包围盒 | <en/> bounding box of the end node\n * @param direction - <zh/> 前一条线段的方向 | <en/> direction of the previous segment\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function pointToNode(from, to, toBBox, direction) {\n    const toWithPadding = isPointBBoxCenter(to, toBBox) ? to : getNearestBoundaryPoint(to, toBBox);\n    const points = [\n        [toWithPadding[0], from[1]],\n        [from[0], toWithPadding[1]],\n    ];\n    const freePoints = points.filter((p) => isPointOutsideBBox(p, toBBox) && !isPointOnBBoxBoundary(p, toBBox, true));\n    const freeDirectionPoints = freePoints.filter((p) => getDirection(p, from) !== direction);\n    if (freeDirectionPoints.length > 0) {\n        // Pick a point which bears the same direction as the previous segment.\n        const p = freeDirectionPoints.find((p) => getDirection(from, p) === direction) || freeDirectionPoints[0];\n        return {\n            points: [p],\n            direction: getDirection(p, to),\n        };\n    }\n    else {\n        // Here we found only points which are either contained in the element or they would create\n        // a link segment going in opposites direction from the previous one.\n        // We take the point inside element and move it outside the element in the direction the\n        // route is going. Now we can join this point with the current end (using freeJoin).\n        const p = difference(points, freePoints)[0];\n        const p2 = moveTo(to, p, getBBoxSize(toBBox, direction) / 2);\n        const p1 = freeJoin(p2, from, toBBox);\n        return {\n            points: [p1, p2],\n            direction: getDirection(p2, to),\n        };\n    }\n}\n/**\n * <zh/> 从节点到节点计算正交路由\n *\n * <en/> Calculate orthogonal route from node to node\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param fromBBox - <zh/> 起始节点的包围盒 | <en/> bounding box of the start node\n * @param toBBox - <zh/> 终止节点的包围盒 | <en/> bounding box of the end node\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function nodeToNode(from, to, fromBBox, toBBox) {\n    let route = nodeToPoint(from, to, fromBBox);\n    const p1 = toVector3(route.points[0]);\n    if (isPointInBBox(p1, toBBox)) {\n        route = nodeToPoint(to, from, toBBox);\n        const p2 = toVector3(route.points[0]);\n        if (isPointInBBox(p2, fromBBox)) {\n            const fromBorder = moveTo(from, p1, getBBoxSize(fromBBox, getDirection(from, p1)) / 2);\n            const toBorder = moveTo(to, p2, getBBoxSize(toBBox, getDirection(to, p2)) / 2);\n            const midPoint = [(fromBorder[0] + toBorder[0]) / 2, (fromBorder[1] + toBorder[1]) / 2];\n            const startRoute = nodeToPoint(from, midPoint, fromBBox);\n            const endRoute = pointToNode(midPoint, to, toBBox, startRoute.direction);\n            route.points = [startRoute.points[0], endRoute.points[0]];\n            route.direction = endRoute.direction;\n        }\n    }\n    return route;\n}\n/**\n * <zh/> 在两个节点内部计算路由\n *\n * <en/> Calculate route inside two nodes\n * @param from - <zh/> 起始点 | <en/> start point\n * @param to - <zh/> 终止点 | <en/> end point\n * @param fromBBox - <zh/> 起始节点的包围盒 | <en/> bounding box of the start node\n * @param toBBox - <zh/> 终止节点的包围盒 | <en/> bounding box of the end node\n * @param direction - <zh/> 方向 | <en/> direction\n * @returns <zh/> 正交路由 | <en/> orthogonal route\n */\nexport function insideNode(from, to, fromBBox, toBBox, direction) {\n    const DEFAULT_OFFSET = 0.01;\n    const boundary = getCombinedBBox([fromBBox, toBBox]);\n    const reversed = distance(to, boundary.center) > distance(from, boundary.center);\n    const [start, end] = reversed ? [to, from] : [from, to];\n    const halfPerimeter = getBBoxHeight(boundary) + getBBoxWidth(boundary);\n    let p1;\n    if (direction) {\n        const ref = [\n            start[0] + halfPerimeter * Math.cos(radians[direction]),\n            start[1] + halfPerimeter * Math.sin(radians[direction]),\n        ];\n        // `getNearestBoundaryPoint` returns a point on the boundary, so we need to move it a bit to ensure it's outside the element and then get the correct `p2` via `freeJoin`.\n        p1 = moveTo(getNearestBoundaryPoint(ref, boundary), ref, DEFAULT_OFFSET);\n    }\n    else {\n        p1 = moveTo(getNearestBoundaryPoint(start, boundary), start, -DEFAULT_OFFSET);\n    }\n    let p2 = freeJoin(p1, end, boundary);\n    let points = [round(p1, 2), round(p2, 2)];\n    if (isEqual(round(p1), round(p2))) {\n        const rad = angle(subtract(p1, start), [1, 0, 0]) + Math.PI / 2;\n        p2 = [end[0] + halfPerimeter * Math.cos(rad), end[1] + halfPerimeter * Math.sin(rad), 0];\n        p2 = round(moveTo(getNearestBoundaryPoint(p2, boundary), end, -DEFAULT_OFFSET), 2);\n        const p3 = freeJoin(p1, p2, boundary);\n        points = [p1, p3, p2];\n    }\n    return {\n        points: reversed ? points.reverse() : points,\n        direction: reversed ? getDirection(p1, to) : getDirection(p2, to),\n    };\n}\n/**\n * <zh/> 返回一个点 `p`，使得线段 p,p1 和 p,p2 互相垂直，p 尽可能不在给定的包围盒内\n *\n * <en/> Returns a point `p` where lines p,p1 and p,p2 are perpendicular and p is not contained in the given box\n * @param p1 - <zh/> 点 | <en/> point\n * @param p2 - <zh/> 点 | <en/> point\n * @param bbox - <zh/> 包围盒 | <en/> bounding box\n * @returns <zh/> 点 | <en/> point\n */\nexport function freeJoin(p1, p2, bbox) {\n    let p = [p1[0], p2[1]];\n    if (isPointInBBox(p, bbox)) {\n        p = [p2[0], p1[1]];\n    }\n    return p;\n}\n//# sourceMappingURL=orth.js.map"],"names":["getNodeBBox","isOrthogonal","isPointBBoxCenter","getNearestBoundaryPoint","isPointInBBox","toVector2","bbox","getBBoxHeight","getBBoxWidth","getNearestBoundarySide","isPointOutsideBBox","isPointOnBBoxBoundary","p","moveTo","toVector3","getCombinedBBox","distance","round","angle","subtract"],"mappings":";;;;;;;AAIA,MAAM,iBAAiB;AAAA,EACnB,SAAS;AACb;AAaO,SAAS,KAAK,aAAa,aAAa,YAAY,YAAY,eAAe,SAAS;AAC3F,QAAM,EAAE,QAAO,IAAK,OAAO,OAAO,gBAAgB,OAAO;AACzD,QAAM,aAAaA,KAAAA,YAAY,YAAY,OAAO;AAClD,QAAM,aAAaA,KAAAA,YAAY,YAAY,OAAO;AAClD,QAAM,SAAS,CAAC,aAAa,GAAG,eAAe,WAAW;AAE1D,MAAI,YAAY;AAChB,QAAM,SAAS,CAAA;AACf,WAAS,UAAU,GAAG,MAAM,OAAO,QAAQ,UAAU,MAAM,GAAG,WAAW;AACrE,UAAM,QAAQ,UAAU;AACxB,UAAM,OAAO,OAAO,OAAO;AAC3B,UAAM,KAAK,OAAO,KAAK;AACvB,UAAM,SAASC,MAAAA,aAAa,MAAM,EAAE;AACpC,QAAI,QAAQ;AACZ,QAAI,YAAY,GAAG;AACf,UAAI,UAAU,MAAM,GAAG;AAEnB,YAAI,WAAW,WAAW,UAAU,GAAG;AACnC,kBAAQ,WAAW,MAAM,IAAI,YAAY,UAAU;AAAA,QACvD,WACS,CAACC,KAAAA,kBAAkB,MAAM,UAAU,KAAK,CAACA,uBAAkB,IAAI,UAAU,GAAG;AACjF,gBAAM,kBAAkBC,KAAAA,wBAAwB,MAAM,UAAU;AAChE,gBAAM,gBAAgBA,KAAAA,wBAAwB,IAAI,UAAU;AAC5D,kBAAQ,aAAa,iBAAiB,eAAe,aAAa,iBAAiB,aAAa,CAAC;AACjG,gBAAM,OAAO,QAAQ,eAAe;AACpC,gBAAM,OAAO,KAAK,aAAa;AAAA,QACnC,WACS,CAAC,QAAQ;AACd,kBAAQ,WAAW,MAAM,IAAI,YAAY,UAAU;AAAA,QACvD;AAAA,MACJ,OACK;AAED,YAAIC,KAAAA,cAAc,IAAI,UAAU,GAAG;AAC/B,kBAAQ,WAAW,MAAM,IAAI,YAAYJ,KAAAA,YAAY,IAAI,OAAO,GAAG,SAAS;AAAA,QAChF,WACS,CAAC,QAAQ;AACd,kBAAQ,YAAY,MAAM,IAAI,UAAU;AAAA,QAC5C;AAAA,MACJ;AAAA,IACJ,WACS,UAAU,MAAM,GAAG;AAExB,UAAII,KAAAA,cAAc,MAAM,UAAU,GAAG;AACjC,gBAAQ,WAAW,MAAM,IAAIJ,KAAAA,YAAY,MAAM,OAAO,GAAG,YAAY,SAAS;AAAA,MAClF,WACS,CAAC,QAAQ;AACd,gBAAQ,YAAY,MAAM,IAAI,YAAY,SAAS;AAAA,MACvD;AAAA,IACJ,WACS,CAAC,QAAQ;AAEd,cAAQ,aAAa,MAAM,IAAI,SAAS;AAAA,IAC5C;AAEA,QAAI,OAAO;AACP,aAAO,KAAK,GAAG,MAAM,MAAM;AAC3B,kBAAY,MAAM;AAAA,IACtB,OACK;AAED,kBAAY,aAAa,MAAM,EAAE;AAAA,IACrC;AACA,QAAI,QAAQ,MAAM;AACd,aAAO,KAAK,EAAE;AAAA,EACtB;AACA,SAAO,OAAO,IAAIK,gBAAS;AAC/B;AAIA,MAAM,YAAY;AAAA,EACd,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AAAA,EACH,GAAG;AACP;AAIA,MAAM,UAAU;AAAA,EACZ,GAAG,CAAC,KAAK,KAAK;AAAA,EACd,GAAG,KAAK,KAAK;AAAA,EACb,GAAG;AAAA,EACH,GAAG,KAAK;AACZ;AASO,SAAS,aAAa,MAAM,IAAI;AACnC,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,MAAI,OAAO,IAAI;AACX,WAAO,KAAK,KAAK,MAAM;AAAA,EAC3B;AACA,MAAI,OAAO,IAAI;AACX,WAAO,KAAK,KAAK,MAAM;AAAA,EAC3B;AACA,SAAO;AACX;AASO,SAAS,YAAYC,QAAM,WAAW;AACzC,SAAO,cAAc,OAAO,cAAc,MAAMC,KAAAA,cAAcD,MAAI,IAAIE,KAAAA,aAAaF,MAAI;AAC3F;AAUO,SAAS,aAAa,MAAM,IAAI,WAAW;AAC9C,QAAM,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;AAC1B,QAAM,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;AAC1B,QAAM,KAAK,aAAa,MAAM,EAAE;AAChC,QAAM,KAAK,aAAa,MAAM,EAAE;AAChC,QAAM,WAAW,YAAY,UAAU,SAAS,IAAI;AACpD,QAAM,IAAI,OAAO,aAAc,OAAO,YAAY,OAAO,YAAa,KAAK;AAC3E,SAAO,EAAE,QAAQ,CAAC,CAAC,GAAG,WAAW,aAAa,GAAG,EAAE,EAAC;AACxD;AAUO,SAAS,YAAY,MAAM,IAAI,UAAU;AAC5C,MAAIJ,KAAAA,kBAAkB,MAAM,QAAQ,GAAG;AACnC,UAAM,IAAI,SAAS,MAAM,IAAI,QAAQ;AACrC,WAAO,EAAE,QAAQ,CAAC,CAAC,GAAG,WAAW,aAAa,GAAG,EAAE,EAAC;AAAA,EACxD,OACK;AACD,UAAM,kBAAkBC,KAAAA,wBAAwB,MAAM,QAAQ;AAC9D,UAAM,eAAe,CAAC,QAAQ,OAAO,EAAE,SAASM,KAAAA,uBAAuB,MAAM,QAAQ,CAAC;AACtF,UAAM,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,GAAG,CAAC,CAAC;AACjF,WAAO,EAAE,QAAQ,CAAC,CAAC,GAAG,WAAW,aAAa,GAAG,EAAE,EAAC;AAAA,EACxD;AACJ;AAWO,SAAS,YAAY,MAAM,IAAI,QAAQ,WAAW;AACrD,QAAM,gBAAgBP,KAAAA,kBAAkB,IAAI,MAAM,IAAI,KAAKC,KAAAA,wBAAwB,IAAI,MAAM;AAC7F,QAAM,SAAS;AAAA,IACX,CAAC,cAAc,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1B,CAAC,KAAK,CAAC,GAAG,cAAc,CAAC,CAAC;AAAA,EAClC;AACI,QAAM,aAAa,OAAO,OAAO,CAAC,MAAMO,KAAAA,mBAAmB,GAAG,MAAM,KAAK,CAACC,KAAAA,sBAAsB,GAAG,QAAQ,IAAI,CAAC;AAChH,QAAM,sBAAsB,WAAW,OAAO,CAAC,MAAM,aAAa,GAAG,IAAI,MAAM,SAAS;AACxF,MAAI,oBAAoB,SAAS,GAAG;AAEhC,UAAM,IAAI,oBAAoB,KAAK,CAACC,OAAM,aAAa,MAAMA,EAAC,MAAM,SAAS,KAAK,oBAAoB,CAAC;AACvG,WAAO;AAAA,MACH,QAAQ,CAAC,CAAC;AAAA,MACV,WAAW,aAAa,GAAG,EAAE;AAAA,IACzC;AAAA,EACI,OACK;AAKD,UAAM,IAAI,WAAW,QAAQ,UAAU,EAAE,CAAC;AAC1C,UAAM,KAAKC,MAAAA,OAAO,IAAI,GAAG,YAAY,QAAQ,SAAS,IAAI,CAAC;AAC3D,UAAM,KAAK,SAAS,IAAI,MAAM,MAAM;AACpC,WAAO;AAAA,MACH,QAAQ,CAAC,IAAI,EAAE;AAAA,MACf,WAAW,aAAa,IAAI,EAAE;AAAA,IAC1C;AAAA,EACI;AACJ;AAWO,SAAS,WAAW,MAAM,IAAI,UAAU,QAAQ;AACnD,MAAI,QAAQ,YAAY,MAAM,IAAI,QAAQ;AAC1C,QAAM,KAAKC,OAAAA,UAAU,MAAM,OAAO,CAAC,CAAC;AACpC,MAAIV,KAAAA,cAAc,IAAI,MAAM,GAAG;AAC3B,YAAQ,YAAY,IAAI,MAAM,MAAM;AACpC,UAAM,KAAKU,OAAAA,UAAU,MAAM,OAAO,CAAC,CAAC;AACpC,QAAIV,KAAAA,cAAc,IAAI,QAAQ,GAAG;AAC7B,YAAM,aAAaS,MAAAA,OAAO,MAAM,IAAI,YAAY,UAAU,aAAa,MAAM,EAAE,CAAC,IAAI,CAAC;AACrF,YAAM,WAAWA,MAAAA,OAAO,IAAI,IAAI,YAAY,QAAQ,aAAa,IAAI,EAAE,CAAC,IAAI,CAAC;AAC7E,YAAM,WAAW,EAAE,WAAW,CAAC,IAAI,SAAS,CAAC,KAAK,IAAI,WAAW,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC;AACtF,YAAM,aAAa,YAAY,MAAM,UAAU,QAAQ;AACvD,YAAM,WAAW,YAAY,UAAU,IAAI,QAAQ,WAAW,SAAS;AACvE,YAAM,SAAS,CAAC,WAAW,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC;AACxD,YAAM,YAAY,SAAS;AAAA,IAC/B;AAAA,EACJ;AACA,SAAO;AACX;AAYO,SAAS,WAAW,MAAM,IAAI,UAAU,QAAQ,WAAW;AAC9D,QAAM,iBAAiB;AACvB,QAAM,WAAWE,KAAAA,gBAAgB,CAAC,UAAU,MAAM,CAAC;AACnD,QAAM,WAAWC,gBAAS,IAAI,SAAS,MAAM,IAAIA,gBAAS,MAAM,SAAS,MAAM;AAC/E,QAAM,CAAC,OAAO,GAAG,IAAI,WAAW,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AACtD,QAAM,gBAAgBT,KAAAA,cAAc,QAAQ,IAAIC,KAAAA,aAAa,QAAQ;AACrE,MAAI;AACJ,MAAI,WAAW;AACX,UAAM,MAAM;AAAA,MACR,MAAM,CAAC,IAAI,gBAAgB,KAAK,IAAI,QAAQ,SAAS,CAAC;AAAA,MACtD,MAAM,CAAC,IAAI,gBAAgB,KAAK,IAAI,QAAQ,SAAS,CAAC;AAAA,IAClE;AAEQ,SAAKK,MAAAA,OAAOV,6BAAwB,KAAK,QAAQ,GAAG,KAAK,cAAc;AAAA,EAC3E,OACK;AACD,SAAKU,MAAAA,OAAOV,6BAAwB,OAAO,QAAQ,GAAG,OAAO,CAAC,cAAc;AAAA,EAChF;AACA,MAAI,KAAK,SAAS,IAAI,KAAK,QAAQ;AACnC,MAAI,SAAS,CAACc,MAAAA,MAAM,IAAI,CAAC,GAAGA,MAAAA,MAAM,IAAI,CAAC,CAAC;AACxC,MAAI,QAAQA,MAAAA,MAAM,EAAE,GAAGA,MAAAA,MAAM,EAAE,CAAC,GAAG;AAC/B,UAAM,MAAMC,OAAAA,MAAMC,gBAAS,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,KAAK;AAC9D,SAAK,CAAC,IAAI,CAAC,IAAI,gBAAgB,KAAK,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,gBAAgB,KAAK,IAAI,GAAG,GAAG,CAAC;AACvF,SAAKF,MAAAA,MAAMJ,aAAOV,KAAAA,wBAAwB,IAAI,QAAQ,GAAG,KAAK,CAAC,cAAc,GAAG,CAAC;AACjF,UAAM,KAAK,SAAS,IAAI,IAAI,QAAQ;AACpC,aAAS,CAAC,IAAI,IAAI,EAAE;AAAA,EACxB;AACA,SAAO;AAAA,IACH,QAAQ,WAAW,OAAO,QAAO,IAAK;AAAA,IACtC,WAAW,WAAW,aAAa,IAAI,EAAE,IAAI,aAAa,IAAI,EAAE;AAAA,EACxE;AACA;AAUO,SAAS,SAAS,IAAI,IAAIG,QAAM;AACnC,MAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AACrB,MAAIF,KAAAA,cAAc,GAAGE,MAAI,GAAG;AACxB,QAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,EACrB;AACA,SAAO;AACX;;;;;;;;;;","x_google_ignoreList":[0]}