@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/point.cjs

@@ -0,0 +1,194 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const bbox = require("./bbox.cjs");
+const line = require("./line.cjs");
+const position = require("./position.cjs");
+const vector = require("./vector.cjs");
+const isEqual = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-equal.cjs");
+function parsePoint(point) {
+  var _a;
+  return [point.x, point.y, (_a = point.z) !== null && _a !== void 0 ? _a : 0];
+}
+function toPointObject(point) {
+  var _a;
+  return { x: point[0], y: point[1], z: (_a = point[2]) !== null && _a !== void 0 ? _a : 0 };
+}
+function round(point, digits = 0) {
+  return point.map((p) => parseFloat(p.toFixed(digits)));
+}
+function moveTo(p, ref, distance, reverse = false) {
+  if (isEqual(p, ref))
+    return p;
+  const direction = reverse ? vector.subtract(p, ref) : vector.subtract(ref, p);
+  const normalizedDirection = vector.normalize(direction);
+  const moveVector = [normalizedDirection[0] * distance, normalizedDirection[1] * distance];
+  return vector.add(vector.toVector2(p), moveVector);
+}
+function isHorizontal(p1, p2) {
+  return p1[1] === p2[1];
+}
+function isVertical(p1, p2) {
+  return p1[0] === p2[0];
+}
+function isOrthogonal(p1, p2) {
+  return isHorizontal(p1, p2) || isVertical(p1, p2);
+}
+function isCollinear(p1, p2, p3) {
+  return line.isLinesParallel([p1, p2], [p2, p3]);
+}
+function getSymmetricPoint(p, center) {
+  return [2 * center[0] - p[0], 2 * center[1] - p[1]];
+}
+function getPolygonIntersectPoint(p, center, points, isRelativePos = true, useExtendedLine = false) {
+  for (let i = 0; i < points.length; i++) {
+    let start = points[i];
+    let end = points[(i + 1) % points.length];
+    if (isRelativePos) {
+      start = vector.add(center, start);
+      end = vector.add(center, end);
+    }
+    const refP = useExtendedLine ? getSymmetricPoint(p, center) : p;
+    const intersect = line.getLinesIntersection([center, refP], [start, end]);
+    if (intersect) {
+      return {
+        point: intersect,
+        line: [start, end]
+      };
+    }
+  }
+  return {
+    point: center,
+    line: void 0
+  };
+}
+function isPointInPolygon(point, points, start, end) {
+  const x = point[0];
+  const y = point[1];
+  let inside = false;
+  if (start === void 0)
+    start = 0;
+  if (end === void 0)
+    end = points.length;
+  const len = end - start;
+  for (let i = 0, j = len - 1; i < len; j = i++) {
+    const xi = points[i + start][0];
+    const yi = points[i + start][1];
+    const xj = points[j + start][0];
+    const yj = points[j + start][1];
+    const intersect = yi > y !== yj > y && x < (xj - xi) * (y - yi) / (yj - yi) + xi;
+    if (intersect)
+      inside = !inside;
+  }
+  return inside;
+}
+function getRectIntersectPoint(p, bbox2, useExtendedLine = false) {
+  const center = position.getXYByPlacement(bbox2, "center");
+  const corners = [
+    position.getXYByPlacement(bbox2, "left-top"),
+    position.getXYByPlacement(bbox2, "right-top"),
+    position.getXYByPlacement(bbox2, "right-bottom"),
+    position.getXYByPlacement(bbox2, "left-bottom")
+  ];
+  return getPolygonIntersectPoint(p, center, corners, false, useExtendedLine).point;
+}
+function getEllipseIntersectPoint(p, bbox$1, useExtendedLine = false) {
+  const center = bbox$1.center;
+  const refP = useExtendedLine ? getSymmetricPoint(p, center) : p;
+  const vec = vector.subtract(refP, bbox$1.center);
+  const angle = Math.atan2(vec[1], vec[0]);
+  if (isNaN(angle))
+    return center;
+  const rx = bbox.getBBoxWidth(bbox$1) / 2;
+  const ry = bbox.getBBoxHeight(bbox$1) / 2;
+  const intersectX = center[0] + rx * Math.cos(angle);
+  const intersectY = center[1] + ry * Math.sin(angle);
+  return [intersectX, intersectY];
+}
+function findNearestPoints(group1, group2) {
+  let minDistance = Infinity;
+  let nearestPoints = [group1[0], group2[0]];
+  group1.forEach((p1) => {
+    group2.forEach((p2) => {
+      const dist = vector.distance(p1, p2);
+      if (dist < minDistance) {
+        minDistance = dist;
+        nearestPoints = [p1, p2];
+      }
+    });
+  });
+  return nearestPoints;
+}
+function findNearestLine(point, lines) {
+  let minDistance = Infinity;
+  let nearestLine = [
+    [0, 0],
+    [0, 0]
+  ];
+  lines.forEach((line2) => {
+    const distance = getDistanceToLine(point, line2);
+    if (distance < minDistance) {
+      minDistance = distance;
+      nearestLine = line2;
+    }
+  });
+  return nearestLine;
+}
+function getDistanceToLine(point, line2) {
+  const nearestPoint = findNearestPointOnLine(point, line2);
+  return vector.distance(point, nearestPoint);
+}
+function findNearestPointOnLine(point, line2) {
+  const [x1, y1] = line2[0];
+  const [x2, y2] = line2[1];
+  const [x3, y3] = point;
+  const px = x2 - x1;
+  const py = y2 - y1;
+  if (px === 0 && py === 0) {
+    return [x1, y1];
+  }
+  let u = ((x3 - x1) * px + (y3 - y1) * py) / (px * px + py * py);
+  if (u > 1) {
+    u = 1;
+  } else if (u < 0) {
+    u = 0;
+  }
+  const x = x1 + u * px;
+  const y = y1 + u * py;
+  return [x, y];
+}
+function centerOf(points) {
+  const totalPosition = points.reduce((acc, p) => vector.add(acc, p), [0, 0]);
+  return vector.divide(totalPosition, points.length);
+}
+function sortByClockwise(points, clockwise = true) {
+  const center = centerOf(points);
+  return points.sort(([x1, y1], [x2, y2]) => {
+    const angle1 = Math.atan2(y1 - center[1], x1 - center[0]);
+    const angle2 = Math.atan2(y2 - center[1], x2 - center[0]);
+    return clockwise ? angle2 - angle1 : angle1 - angle2;
+  });
+}
+function getBoundingPoints(start, end) {
+  return [start, [start[0], end[1]], end, [end[0], start[1]]];
+}
+exports.centerOf = centerOf;
+exports.findNearestLine = findNearestLine;
+exports.findNearestPointOnLine = findNearestPointOnLine;
+exports.findNearestPoints = findNearestPoints;
+exports.getBoundingPoints = getBoundingPoints;
+exports.getDistanceToLine = getDistanceToLine;
+exports.getEllipseIntersectPoint = getEllipseIntersectPoint;
+exports.getPolygonIntersectPoint = getPolygonIntersectPoint;
+exports.getRectIntersectPoint = getRectIntersectPoint;
+exports.getSymmetricPoint = getSymmetricPoint;
+exports.isCollinear = isCollinear;
+exports.isHorizontal = isHorizontal;
+exports.isOrthogonal = isOrthogonal;
+exports.isPointInPolygon = isPointInPolygon;
+exports.isVertical = isVertical;
+exports.moveTo = moveTo;
+exports.parsePoint = parsePoint;
+exports.round = round;
+exports.sortByClockwise = sortByClockwise;
+exports.toPointObject = toPointObject;
+//# sourceMappingURL=point.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"point.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["subtract","normalize","add","toVector2","isLinesParallel","getLinesIntersection","bbox","getXYByPlacement","getBBoxWidth","getBBoxHeight","distance","line","divide"],"mappings":";;;;;;;AAWO,SAAS,WAAW,OAAO;AAC9B,MAAI;AACJ,SAAO,CAAC,MAAM,GAAG,MAAM,IAAI,KAAK,MAAM,OAAO,QAAQ,OAAO,SAAS,KAAK,CAAC;AAC/E;AAQO,SAAS,cAAc,OAAO;AACjC,MAAI;AACJ,SAAO,EAAE,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,KAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK,EAAC;AAC5F;AAmCO,SAAS,MAAM,OAAO,SAAS,GAAG;AACrC,SAAO,MAAM,IAAI,CAAC,MAAM,WAAW,EAAE,QAAQ,MAAM,CAAC,CAAC;AACzD;AAWO,SAAS,OAAO,GAAG,KAAK,UAAU,UAAU,OAAO;AACtD,MAAI,QAAQ,GAAG,GAAG;AACd,WAAO;AACX,QAAM,YAAY,UAAUA,gBAAS,GAAG,GAAG,IAAIA,OAAAA,SAAS,KAAK,CAAC;AAC9D,QAAM,sBAAsBC,OAAAA,UAAU,SAAS;AAC/C,QAAM,aAAa,CAAC,oBAAoB,CAAC,IAAI,UAAU,oBAAoB,CAAC,IAAI,QAAQ;AACxF,SAAOC,WAAIC,OAAAA,UAAU,CAAC,GAAG,UAAU;AACvC;AASO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO,GAAG,CAAC,MAAM,GAAG,CAAC;AACzB;AASO,SAAS,WAAW,IAAI,IAAI;AAC/B,SAAO,GAAG,CAAC,MAAM,GAAG,CAAC;AACzB;AASO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO,aAAa,IAAI,EAAE,KAAK,WAAW,IAAI,EAAE;AACpD;AAUO,SAAS,YAAY,IAAI,IAAI,IAAI;AACpC,SAAOC,KAAAA,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAC7C;AASO,SAAS,kBAAkB,GAAG,QAAQ;AACzC,SAAO,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;AACtD;AAYO,SAAS,yBAAyB,GAAG,QAAQ,QAAQ,gBAAgB,MAAM,kBAAkB,OAAO;AACvG,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,QAAQ,OAAO,CAAC;AACpB,QAAI,MAAM,QAAQ,IAAI,KAAK,OAAO,MAAM;AACxC,QAAI,eAAe;AACf,cAAQF,OAAAA,IAAI,QAAQ,KAAK;AACzB,YAAMA,OAAAA,IAAI,QAAQ,GAAG;AAAA,IACzB;AACA,UAAM,OAAO,kBAAkB,kBAAkB,GAAG,MAAM,IAAI;AAC9D,UAAM,YAAYG,KAAAA,qBAAqB,CAAC,QAAQ,IAAI,GAAG,CAAC,OAAO,GAAG,CAAC;AACnE,QAAI,WAAW;AACX,aAAO;AAAA,QACH,OAAO;AAAA,QACP,MAAM,CAAC,OAAO,GAAG;AAAA,MACjC;AAAA,IACQ;AAAA,EACJ;AACA,SAAO;AAAA,IACH,OAAO;AAAA,IACP,MAAM;AAAA,EACd;AACA;AAWO,SAAS,iBAAiB,OAAO,QAAQ,OAAO,KAAK;AACxD,QAAM,IAAI,MAAM,CAAC;AACjB,QAAM,IAAI,MAAM,CAAC;AACjB,MAAI,SAAS;AACb,MAAI,UAAU;AACV,YAAQ;AACZ,MAAI,QAAQ;AACR,UAAM,OAAO;AACjB,QAAM,MAAM,MAAM;AAClB,WAAS,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,KAAK,IAAI,KAAK;AAC3C,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,YAAY,KAAK,MAAM,KAAK,KAAK,KAAM,KAAK,OAAO,IAAI,OAAQ,KAAK,MAAM;AAChF,QAAI;AACA,eAAS,CAAC;AAAA,EAClB;AACA,SAAO;AACX;AAUO,SAAS,sBAAsB,GAAGC,OAAM,kBAAkB,OAAO;AACpE,QAAM,SAASC,SAAAA,iBAAiBD,OAAM,QAAQ;AAC9C,QAAM,UAAU;AAAA,IACZC,SAAAA,iBAAiBD,OAAM,UAAU;AAAA,IACjCC,SAAAA,iBAAiBD,OAAM,WAAW;AAAA,IAClCC,SAAAA,iBAAiBD,OAAM,cAAc;AAAA,IACrCC,SAAAA,iBAAiBD,OAAM,aAAa;AAAA,EAC5C;AACI,SAAO,yBAAyB,GAAG,QAAQ,SAAS,OAAO,eAAe,EAAE;AAChF;AAWO,SAAS,yBAAyB,GAAGA,QAAM,kBAAkB,OAAO;AACvE,QAAM,SAASA,OAAK;AACpB,QAAM,OAAO,kBAAkB,kBAAkB,GAAG,MAAM,IAAI;AAC9D,QAAM,MAAMN,OAAAA,SAAS,MAAMM,OAAK,MAAM;AACtC,QAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACvC,MAAI,MAAM,KAAK;AACX,WAAO;AACX,QAAM,KAAKE,KAAAA,aAAaF,MAAI,IAAI;AAChC,QAAM,KAAKG,KAAAA,cAAcH,MAAI,IAAI;AACjC,QAAM,aAAa,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK;AAClD,QAAM,aAAa,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK;AAClD,SAAO,CAAC,YAAY,UAAU;AAClC;AAOO,SAAS,kBAAkB,QAAQ,QAAQ;AAC9C,MAAI,cAAc;AAClB,MAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACzC,SAAO,QAAQ,CAAC,OAAO;AACnB,WAAO,QAAQ,CAAC,OAAO;AACnB,YAAM,OAAOI,OAAAA,SAAS,IAAI,EAAE;AAC5B,UAAI,OAAO,aAAa;AACpB,sBAAc;AACd,wBAAgB,CAAC,IAAI,EAAE;AAAA,MAC3B;AAAA,IACJ,CAAC;AAAA,EACL,CAAC;AACD,SAAO;AACX;AASO,SAAS,gBAAgB,OAAO,OAAO;AAC1C,MAAI,cAAc;AAClB,MAAI,cAAc;AAAA,IACd,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACb;AACI,QAAM,QAAQ,CAACC,UAAS;AACpB,UAAM,WAAW,kBAAkB,OAAOA,KAAI;AAC9C,QAAI,WAAW,aAAa;AACxB,oBAAc;AACd,oBAAcA;AAAA,IAClB;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AASO,SAAS,kBAAkB,OAAOA,OAAM;AAC3C,QAAM,eAAe,uBAAuB,OAAOA,KAAI;AACvD,SAAOD,OAAAA,SAAS,OAAO,YAAY;AACvC;AASO,SAAS,uBAAuB,OAAOC,OAAM;AAChD,QAAM,CAAC,IAAI,EAAE,IAAIA,MAAK,CAAC;AACvB,QAAM,CAAC,IAAI,EAAE,IAAIA,MAAK,CAAC;AACvB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,KAAK,KAAK;AAChB,QAAM,KAAK,KAAK;AAEhB,MAAI,OAAO,KAAK,OAAO,GAAG;AACtB,WAAO,CAAC,IAAI,EAAE;AAAA,EAClB;AACA,MAAI,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,OAAO,KAAK,KAAK,KAAK;AAC5D,MAAI,IAAI,GAAG;AACP,QAAI;AAAA,EACR,WACS,IAAI,GAAG;AACZ,QAAI;AAAA,EACR;AACA,QAAM,IAAI,KAAK,IAAI;AACnB,QAAM,IAAI,KAAK,IAAI;AACnB,SAAO,CAAC,GAAG,CAAC;AAChB;AAQO,SAAS,SAAS,QAAQ;AAC7B,QAAM,gBAAgB,OAAO,OAAO,CAAC,KAAK,MAAMT,WAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnE,SAAOU,cAAO,eAAe,OAAO,MAAM;AAC9C;AASO,SAAS,gBAAgB,QAAQ,YAAY,MAAM;AACtD,QAAM,SAAS,SAAS,MAAM;AAC9B,SAAO,OAAO,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC;AACxD,UAAM,SAAS,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC;AACxD,WAAO,YAAY,SAAS,SAAS,SAAS;AAAA,EAClD,CAAC;AACL;AAOO,SAAS,kBAAkB,OAAO,KAAK;AAC1C,SAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC9D;;;;;;;;;;;;;;;;;;;;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,194 @@
+import { getBBoxWidth, getBBoxHeight } from "./bbox.js";
+import { isLinesParallel, getLinesIntersection } from "./line.js";
+import { getXYByPlacement } from "./position.js";
+import { subtract, add, normalize, toVector2, distance, divide } from "./vector.js";
+import isEqual from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-equal.js";
+function parsePoint(point) {
+  var _a;
+  return [point.x, point.y, (_a = point.z) !== null && _a !== void 0 ? _a : 0];
+}
+function toPointObject(point) {
+  var _a;
+  return { x: point[0], y: point[1], z: (_a = point[2]) !== null && _a !== void 0 ? _a : 0 };
+}
+function round(point, digits = 0) {
+  return point.map((p) => parseFloat(p.toFixed(digits)));
+}
+function moveTo(p, ref, distance2, reverse = false) {
+  if (isEqual(p, ref))
+    return p;
+  const direction = reverse ? subtract(p, ref) : subtract(ref, p);
+  const normalizedDirection = normalize(direction);
+  const moveVector = [normalizedDirection[0] * distance2, normalizedDirection[1] * distance2];
+  return add(toVector2(p), moveVector);
+}
+function isHorizontal(p1, p2) {
+  return p1[1] === p2[1];
+}
+function isVertical(p1, p2) {
+  return p1[0] === p2[0];
+}
+function isOrthogonal(p1, p2) {
+  return isHorizontal(p1, p2) || isVertical(p1, p2);
+}
+function isCollinear(p1, p2, p3) {
+  return isLinesParallel([p1, p2], [p2, p3]);
+}
+function getSymmetricPoint(p, center) {
+  return [2 * center[0] - p[0], 2 * center[1] - p[1]];
+}
+function getPolygonIntersectPoint(p, center, points, isRelativePos = true, useExtendedLine = false) {
+  for (let i = 0; i < points.length; i++) {
+    let start = points[i];
+    let end = points[(i + 1) % points.length];
+    if (isRelativePos) {
+      start = add(center, start);
+      end = add(center, end);
+    }
+    const refP = useExtendedLine ? getSymmetricPoint(p, center) : p;
+    const intersect = getLinesIntersection([center, refP], [start, end]);
+    if (intersect) {
+      return {
+        point: intersect,
+        line: [start, end]
+      };
+    }
+  }
+  return {
+    point: center,
+    line: void 0
+  };
+}
+function isPointInPolygon(point, points, start, end) {
+  const x = point[0];
+  const y = point[1];
+  let inside = false;
+  if (start === void 0)
+    start = 0;
+  if (end === void 0)
+    end = points.length;
+  const len = end - start;
+  for (let i = 0, j = len - 1; i < len; j = i++) {
+    const xi = points[i + start][0];
+    const yi = points[i + start][1];
+    const xj = points[j + start][0];
+    const yj = points[j + start][1];
+    const intersect = yi > y !== yj > y && x < (xj - xi) * (y - yi) / (yj - yi) + xi;
+    if (intersect)
+      inside = !inside;
+  }
+  return inside;
+}
+function getRectIntersectPoint(p, bbox, useExtendedLine = false) {
+  const center = getXYByPlacement(bbox, "center");
+  const corners = [
+    getXYByPlacement(bbox, "left-top"),
+    getXYByPlacement(bbox, "right-top"),
+    getXYByPlacement(bbox, "right-bottom"),
+    getXYByPlacement(bbox, "left-bottom")
+  ];
+  return getPolygonIntersectPoint(p, center, corners, false, useExtendedLine).point;
+}
+function getEllipseIntersectPoint(p, bbox, useExtendedLine = false) {
+  const center = bbox.center;
+  const refP = useExtendedLine ? getSymmetricPoint(p, center) : p;
+  const vec = subtract(refP, bbox.center);
+  const angle = Math.atan2(vec[1], vec[0]);
+  if (isNaN(angle))
+    return center;
+  const rx = getBBoxWidth(bbox) / 2;
+  const ry = getBBoxHeight(bbox) / 2;
+  const intersectX = center[0] + rx * Math.cos(angle);
+  const intersectY = center[1] + ry * Math.sin(angle);
+  return [intersectX, intersectY];
+}
+function findNearestPoints(group1, group2) {
+  let minDistance = Infinity;
+  let nearestPoints = [group1[0], group2[0]];
+  group1.forEach((p1) => {
+    group2.forEach((p2) => {
+      const dist = distance(p1, p2);
+      if (dist < minDistance) {
+        minDistance = dist;
+        nearestPoints = [p1, p2];
+      }
+    });
+  });
+  return nearestPoints;
+}
+function findNearestLine(point, lines) {
+  let minDistance = Infinity;
+  let nearestLine = [
+    [0, 0],
+    [0, 0]
+  ];
+  lines.forEach((line) => {
+    const distance2 = getDistanceToLine(point, line);
+    if (distance2 < minDistance) {
+      minDistance = distance2;
+      nearestLine = line;
+    }
+  });
+  return nearestLine;
+}
+function getDistanceToLine(point, line) {
+  const nearestPoint = findNearestPointOnLine(point, line);
+  return distance(point, nearestPoint);
+}
+function findNearestPointOnLine(point, line) {
+  const [x1, y1] = line[0];
+  const [x2, y2] = line[1];
+  const [x3, y3] = point;
+  const px = x2 - x1;
+  const py = y2 - y1;
+  if (px === 0 && py === 0) {
+    return [x1, y1];
+  }
+  let u = ((x3 - x1) * px + (y3 - y1) * py) / (px * px + py * py);
+  if (u > 1) {
+    u = 1;
+  } else if (u < 0) {
+    u = 0;
+  }
+  const x = x1 + u * px;
+  const y = y1 + u * py;
+  return [x, y];
+}
+function centerOf(points) {
+  const totalPosition = points.reduce((acc, p) => add(acc, p), [0, 0]);
+  return divide(totalPosition, points.length);
+}
+function sortByClockwise(points, clockwise = true) {
+  const center = centerOf(points);
+  return points.sort(([x1, y1], [x2, y2]) => {
+    const angle1 = Math.atan2(y1 - center[1], x1 - center[0]);
+    const angle2 = Math.atan2(y2 - center[1], x2 - center[0]);
+    return clockwise ? angle2 - angle1 : angle1 - angle2;
+  });
+}
+function getBoundingPoints(start, end) {
+  return [start, [start[0], end[1]], end, [end[0], start[1]]];
+}
+export {
+  centerOf,
+  findNearestLine,
+  findNearestPointOnLine,
+  findNearestPoints,
+  getBoundingPoints,
+  getDistanceToLine,
+  getEllipseIntersectPoint,
+  getPolygonIntersectPoint,
+  getRectIntersectPoint,
+  getSymmetricPoint,
+  isCollinear,
+  isHorizontal,
+  isOrthogonal,
+  isPointInPolygon,
+  isVertical,
+  moveTo,
+  parsePoint,
+  round,
+  sortByClockwise,
+  toPointObject
+};
+//# sourceMappingURL=point.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"point.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["distance"],"mappings":";;;;;AAWO,SAAS,WAAW,OAAO;AAC9B,MAAI;AACJ,SAAO,CAAC,MAAM,GAAG,MAAM,IAAI,KAAK,MAAM,OAAO,QAAQ,OAAO,SAAS,KAAK,CAAC;AAC/E;AAQO,SAAS,cAAc,OAAO;AACjC,MAAI;AACJ,SAAO,EAAE,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,KAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK,EAAC;AAC5F;AAmCO,SAAS,MAAM,OAAO,SAAS,GAAG;AACrC,SAAO,MAAM,IAAI,CAAC,MAAM,WAAW,EAAE,QAAQ,MAAM,CAAC,CAAC;AACzD;AAWO,SAAS,OAAO,GAAG,KAAKA,WAAU,UAAU,OAAO;AACtD,MAAI,QAAQ,GAAG,GAAG;AACd,WAAO;AACX,QAAM,YAAY,UAAU,SAAS,GAAG,GAAG,IAAI,SAAS,KAAK,CAAC;AAC9D,QAAM,sBAAsB,UAAU,SAAS;AAC/C,QAAM,aAAa,CAAC,oBAAoB,CAAC,IAAIA,WAAU,oBAAoB,CAAC,IAAIA,SAAQ;AACxF,SAAO,IAAI,UAAU,CAAC,GAAG,UAAU;AACvC;AASO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO,GAAG,CAAC,MAAM,GAAG,CAAC;AACzB;AASO,SAAS,WAAW,IAAI,IAAI;AAC/B,SAAO,GAAG,CAAC,MAAM,GAAG,CAAC;AACzB;AASO,SAAS,aAAa,IAAI,IAAI;AACjC,SAAO,aAAa,IAAI,EAAE,KAAK,WAAW,IAAI,EAAE;AACpD;AAUO,SAAS,YAAY,IAAI,IAAI,IAAI;AACpC,SAAO,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAC7C;AASO,SAAS,kBAAkB,GAAG,QAAQ;AACzC,SAAO,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;AACtD;AAYO,SAAS,yBAAyB,GAAG,QAAQ,QAAQ,gBAAgB,MAAM,kBAAkB,OAAO;AACvG,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACpC,QAAI,QAAQ,OAAO,CAAC;AACpB,QAAI,MAAM,QAAQ,IAAI,KAAK,OAAO,MAAM;AACxC,QAAI,eAAe;AACf,cAAQ,IAAI,QAAQ,KAAK;AACzB,YAAM,IAAI,QAAQ,GAAG;AAAA,IACzB;AACA,UAAM,OAAO,kBAAkB,kBAAkB,GAAG,MAAM,IAAI;AAC9D,UAAM,YAAY,qBAAqB,CAAC,QAAQ,IAAI,GAAG,CAAC,OAAO,GAAG,CAAC;AACnE,QAAI,WAAW;AACX,aAAO;AAAA,QACH,OAAO;AAAA,QACP,MAAM,CAAC,OAAO,GAAG;AAAA,MACjC;AAAA,IACQ;AAAA,EACJ;AACA,SAAO;AAAA,IACH,OAAO;AAAA,IACP,MAAM;AAAA,EACd;AACA;AAWO,SAAS,iBAAiB,OAAO,QAAQ,OAAO,KAAK;AACxD,QAAM,IAAI,MAAM,CAAC;AACjB,QAAM,IAAI,MAAM,CAAC;AACjB,MAAI,SAAS;AACb,MAAI,UAAU;AACV,YAAQ;AACZ,MAAI,QAAQ;AACR,UAAM,OAAO;AACjB,QAAM,MAAM,MAAM;AAClB,WAAS,IAAI,GAAG,IAAI,MAAM,GAAG,IAAI,KAAK,IAAI,KAAK;AAC3C,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,KAAK,OAAO,IAAI,KAAK,EAAE,CAAC;AAC9B,UAAM,YAAY,KAAK,MAAM,KAAK,KAAK,KAAM,KAAK,OAAO,IAAI,OAAQ,KAAK,MAAM;AAChF,QAAI;AACA,eAAS,CAAC;AAAA,EAClB;AACA,SAAO;AACX;AAUO,SAAS,sBAAsB,GAAG,MAAM,kBAAkB,OAAO;AACpE,QAAM,SAAS,iBAAiB,MAAM,QAAQ;AAC9C,QAAM,UAAU;AAAA,IACZ,iBAAiB,MAAM,UAAU;AAAA,IACjC,iBAAiB,MAAM,WAAW;AAAA,IAClC,iBAAiB,MAAM,cAAc;AAAA,IACrC,iBAAiB,MAAM,aAAa;AAAA,EAC5C;AACI,SAAO,yBAAyB,GAAG,QAAQ,SAAS,OAAO,eAAe,EAAE;AAChF;AAWO,SAAS,yBAAyB,GAAG,MAAM,kBAAkB,OAAO;AACvE,QAAM,SAAS,KAAK;AACpB,QAAM,OAAO,kBAAkB,kBAAkB,GAAG,MAAM,IAAI;AAC9D,QAAM,MAAM,SAAS,MAAM,KAAK,MAAM;AACtC,QAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACvC,MAAI,MAAM,KAAK;AACX,WAAO;AACX,QAAM,KAAK,aAAa,IAAI,IAAI;AAChC,QAAM,KAAK,cAAc,IAAI,IAAI;AACjC,QAAM,aAAa,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK;AAClD,QAAM,aAAa,OAAO,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK;AAClD,SAAO,CAAC,YAAY,UAAU;AAClC;AAOO,SAAS,kBAAkB,QAAQ,QAAQ;AAC9C,MAAI,cAAc;AAClB,MAAI,gBAAgB,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACzC,SAAO,QAAQ,CAAC,OAAO;AACnB,WAAO,QAAQ,CAAC,OAAO;AACnB,YAAM,OAAO,SAAS,IAAI,EAAE;AAC5B,UAAI,OAAO,aAAa;AACpB,sBAAc;AACd,wBAAgB,CAAC,IAAI,EAAE;AAAA,MAC3B;AAAA,IACJ,CAAC;AAAA,EACL,CAAC;AACD,SAAO;AACX;AASO,SAAS,gBAAgB,OAAO,OAAO;AAC1C,MAAI,cAAc;AAClB,MAAI,cAAc;AAAA,IACd,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACb;AACI,QAAM,QAAQ,CAAC,SAAS;AACpB,UAAMA,YAAW,kBAAkB,OAAO,IAAI;AAC9C,QAAIA,YAAW,aAAa;AACxB,oBAAcA;AACd,oBAAc;AAAA,IAClB;AAAA,EACJ,CAAC;AACD,SAAO;AACX;AASO,SAAS,kBAAkB,OAAO,MAAM;AAC3C,QAAM,eAAe,uBAAuB,OAAO,IAAI;AACvD,SAAO,SAAS,OAAO,YAAY;AACvC;AASO,SAAS,uBAAuB,OAAO,MAAM;AAChD,QAAM,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC;AACvB,QAAM,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC;AACvB,QAAM,CAAC,IAAI,EAAE,IAAI;AACjB,QAAM,KAAK,KAAK;AAChB,QAAM,KAAK,KAAK;AAEhB,MAAI,OAAO,KAAK,OAAO,GAAG;AACtB,WAAO,CAAC,IAAI,EAAE;AAAA,EAClB;AACA,MAAI,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM,OAAO,KAAK,KAAK,KAAK;AAC5D,MAAI,IAAI,GAAG;AACP,QAAI;AAAA,EACR,WACS,IAAI,GAAG;AACZ,QAAI;AAAA,EACR;AACA,QAAM,IAAI,KAAK,IAAI;AACnB,QAAM,IAAI,KAAK,IAAI;AACnB,SAAO,CAAC,GAAG,CAAC;AAChB;AAQO,SAAS,SAAS,QAAQ;AAC7B,QAAM,gBAAgB,OAAO,OAAO,CAAC,KAAK,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACnE,SAAO,OAAO,eAAe,OAAO,MAAM;AAC9C;AASO,SAAS,gBAAgB,QAAQ,YAAY,MAAM;AACtD,QAAM,SAAS,SAAS,MAAM;AAC9B,SAAO,OAAO,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC;AACxD,UAAM,SAAS,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC;AACxD,WAAO,YAAY,SAAS,SAAS,SAAS;AAAA,EAClD,CAAC;AACL;AAOO,SAAS,kBAAkB,OAAO,KAAK;AAC1C,SAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;AAC9D;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,46 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const path = require("./path.cjs");
+const point = require("./point.cjs");
+const position = require("./position.cjs");
+const isEqual = require("../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-equal.cjs");
+function getPolygonTextStyleByPlacement(bounds, placement, offsetX, offsetY, closeToContour, path$1, autoRotate) {
+  const [x, y] = position.getXYByPlacement(bounds, placement);
+  const style = {
+    textAlign: placement === "left" ? "right" : placement === "right" ? "left" : "center",
+    textBaseline: placement === "top" ? "bottom" : placement === "bottom" ? "top" : "middle",
+    transform: [["translate", x + offsetX, y + offsetY]]
+  };
+  if (placement === "center" || !closeToContour)
+    return style;
+  const points = path.pathToPoints(path$1);
+  if (!points || points.length <= 3)
+    return style;
+  const lines = points.map((point2, index) => {
+    const p1 = point2;
+    const p2 = points[(index + 1) % points.length];
+    if (isEqual(p1, p2))
+      return null;
+    return [p1, p2];
+  }).filter(Boolean);
+  const line = point.findNearestLine([x, y], lines);
+  const intersection = point.findNearestPointOnLine([x, y], line);
+  if (intersection && line) {
+    style.transform = [["translate", intersection[0] + offsetX, intersection[1] + offsetY]];
+    if (autoRotate) {
+      const angle = Math.atan((line[0][1] - line[1][1]) / (line[0][0] - line[1][0]));
+      style.transform.push(["rotate", angle / Math.PI * 180]);
+      style.textAlign = "center";
+      if (placement === "right" || placement === "left") {
+        if (angle > 0) {
+          style.textBaseline = placement === "right" ? "bottom" : "top";
+        } else {
+          style.textBaseline = placement === "right" ? "top" : "bottom";
+        }
+      }
+    }
+  }
+  return style;
+}
+exports.getPolygonTextStyleByPlacement = getPolygonTextStyleByPlacement;
+//# sourceMappingURL=polygon.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"polygon.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":["path","getXYByPlacement","pathToPoints","point","findNearestLine","findNearestPointOnLine"],"mappings":";;;;;;AAiBO,SAAS,+BAA+B,QAAQ,WAAW,SAAS,SAAS,gBAAgBA,QAAM,YAAY;AAClH,QAAM,CAAC,GAAG,CAAC,IAAIC,SAAAA,iBAAiB,QAAQ,SAAS;AACjD,QAAM,QAAQ;AAAA,IACV,WAAW,cAAc,SAAS,UAAU,cAAc,UAAU,SAAS;AAAA,IAC7E,cAAc,cAAc,QAAQ,WAAW,cAAc,WAAW,QAAQ;AAAA,IAChF,WAAW,CAAC,CAAC,aAAa,IAAI,SAAS,IAAI,OAAO,CAAC;AAAA,EAC3D;AACI,MAAI,cAAc,YAAY,CAAC;AAC3B,WAAO;AACX,QAAM,SAASC,KAAAA,aAAaF,MAAI;AAChC,MAAI,CAAC,UAAU,OAAO,UAAU;AAC5B,WAAO;AACX,QAAM,QAAQ,OACT,IAAI,CAACG,QAAO,UAAU;AACvB,UAAM,KAAKA;AACX,UAAM,KAAK,QAAQ,QAAQ,KAAK,OAAO,MAAM;AAC7C,QAAI,QAAQ,IAAI,EAAE;AACd,aAAO;AACX,WAAO,CAAC,IAAI,EAAE;AAAA,EAClB,CAAC,EACI,OAAO,OAAO;AACnB,QAAM,OAAOC,MAAAA,gBAAgB,CAAC,GAAG,CAAC,GAAG,KAAK;AAC1C,QAAM,eAAeC,MAAAA,uBAAuB,CAAC,GAAG,CAAC,GAAG,IAAI;AACxD,MAAI,gBAAgB,MAAM;AACtB,UAAM,YAAY,CAAC,CAAC,aAAa,aAAa,CAAC,IAAI,SAAS,aAAa,CAAC,IAAI,OAAO,CAAC;AACtF,QAAI,YAAY;AACZ,YAAM,QAAQ,KAAK,MAAM,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE;AAC7E,YAAM,UAAU,KAAK,CAAC,UAAW,QAAQ,KAAK,KAAM,GAAG,CAAC;AACxD,YAAM,YAAY;AAClB,UAAI,cAAc,WAAW,cAAc,QAAQ;AAC/C,YAAI,QAAQ,GAAG;AACX,gBAAM,eAAe,cAAc,UAAU,WAAW;AAAA,QAC5D,OACK;AACD,gBAAM,eAAe,cAAc,UAAU,QAAQ;AAAA,QACzD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,46 @@
+import { pathToPoints } from "./path.js";
+import { findNearestLine, findNearestPointOnLine } from "./point.js";
+import { getXYByPlacement } from "./position.js";
+import isEqual from "../../../../../../@antv_util@3.3.11/node_modules/@antv/util/esm/lodash/is-equal.js";
+function getPolygonTextStyleByPlacement(bounds, placement, offsetX, offsetY, closeToContour, path, autoRotate) {
+  const [x, y] = getXYByPlacement(bounds, placement);
+  const style = {
+    textAlign: placement === "left" ? "right" : placement === "right" ? "left" : "center",
+    textBaseline: placement === "top" ? "bottom" : placement === "bottom" ? "top" : "middle",
+    transform: [["translate", x + offsetX, y + offsetY]]
+  };
+  if (placement === "center" || !closeToContour)
+    return style;
+  const points = pathToPoints(path);
+  if (!points || points.length <= 3)
+    return style;
+  const lines = points.map((point, index) => {
+    const p1 = point;
+    const p2 = points[(index + 1) % points.length];
+    if (isEqual(p1, p2))
+      return null;
+    return [p1, p2];
+  }).filter(Boolean);
+  const line = findNearestLine([x, y], lines);
+  const intersection = findNearestPointOnLine([x, y], line);
+  if (intersection && line) {
+    style.transform = [["translate", intersection[0] + offsetX, intersection[1] + offsetY]];
+    if (autoRotate) {
+      const angle = Math.atan((line[0][1] - line[1][1]) / (line[0][0] - line[1][0]));
+      style.transform.push(["rotate", angle / Math.PI * 180]);
+      style.textAlign = "center";
+      if (placement === "right" || placement === "left") {
+        if (angle > 0) {
+          style.textBaseline = placement === "right" ? "bottom" : "top";
+        } else {
+          style.textBaseline = placement === "right" ? "top" : "bottom";
+        }
+      }
+    }
+  }
+  return style;
+}
+export {
+  getPolygonTextStyleByPlacement
+};
+//# sourceMappingURL=polygon.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"polygon.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+g6@5.1.0/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":[],"mappings":";;;;AAiBO,SAAS,+BAA+B,QAAQ,WAAW,SAAS,SAAS,gBAAgB,MAAM,YAAY;AAClH,QAAM,CAAC,GAAG,CAAC,IAAI,iBAAiB,QAAQ,SAAS;AACjD,QAAM,QAAQ;AAAA,IACV,WAAW,cAAc,SAAS,UAAU,cAAc,UAAU,SAAS;AAAA,IAC7E,cAAc,cAAc,QAAQ,WAAW,cAAc,WAAW,QAAQ;AAAA,IAChF,WAAW,CAAC,CAAC,aAAa,IAAI,SAAS,IAAI,OAAO,CAAC;AAAA,EAC3D;AACI,MAAI,cAAc,YAAY,CAAC;AAC3B,WAAO;AACX,QAAM,SAAS,aAAa,IAAI;AAChC,MAAI,CAAC,UAAU,OAAO,UAAU;AAC5B,WAAO;AACX,QAAM,QAAQ,OACT,IAAI,CAAC,OAAO,UAAU;AACvB,UAAM,KAAK;AACX,UAAM,KAAK,QAAQ,QAAQ,KAAK,OAAO,MAAM;AAC7C,QAAI,QAAQ,IAAI,EAAE;AACd,aAAO;AACX,WAAO,CAAC,IAAI,EAAE;AAAA,EAClB,CAAC,EACI,OAAO,OAAO;AACnB,QAAM,OAAO,gBAAgB,CAAC,GAAG,CAAC,GAAG,KAAK;AAC1C,QAAM,eAAe,uBAAuB,CAAC,GAAG,CAAC,GAAG,IAAI;AACxD,MAAI,gBAAgB,MAAM;AACtB,UAAM,YAAY,CAAC,CAAC,aAAa,aAAa,CAAC,IAAI,SAAS,aAAa,CAAC,IAAI,OAAO,CAAC;AACtF,QAAI,YAAY;AACZ,YAAM,QAAQ,KAAK,MAAM,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,EAAE;AAC7E,YAAM,UAAU,KAAK,CAAC,UAAW,QAAQ,KAAK,KAAM,GAAG,CAAC;AACxD,YAAM,YAAY;AAClB,UAAI,cAAc,WAAW,cAAc,QAAQ;AAC/C,YAAI,QAAQ,GAAG;AACX,gBAAM,eAAe,cAAc,UAAU,WAAW;AAAA,QAC5D,OACK;AACD,gBAAM,eAAe,cAAc,UAAU,QAAQ;AAAA,QACzD;AAAA,MACJ;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const placement = require("./placement.cjs");
+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, placement2) {
+  const [x, y] = placement2;
+  const { min, max } = bbox;
+  return [min[0] + x * (max[0] - min[0]), min[1] + y * (max[1] - min[1])];
+}
+function getXYByPlacement(bbox, placement$1 = "center") {
+  const relativePlacement = placement.parsePlacement(placement$1);
+  return getXYByRelativePlacement(bbox, relativePlacement);
+}
+exports.getXYByPlacement = getXYByPlacement;
+exports.getXYByRelativePlacement = getXYByRelativePlacement;
+exports.hasPosition = hasPosition;
+exports.positionOf = positionOf;
+//# sourceMappingURL=position.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"position.cjs","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":["placement","parsePlacement"],"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,MAAMA,YAAW;AACtD,QAAM,CAAC,GAAG,CAAC,IAAIA;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,MAAMA,cAAY,UAAU;AACzD,QAAM,oBAAoBC,UAAAA,eAAeD,WAAS;AAClD,SAAO,yBAAyB,MAAM,iBAAiB;AAC3D;;;;;","x_google_ignoreList":[0]}