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

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/force-atlas2/simulation.js

@@ -0,0 +1,357 @@
+import { BaseSimulation } from "../base-simulation.js";
+import Body from "./body.js";
+import Quad from "./quad.js";
+import QuadTree from "./quad-tree.js";
+import isNumber from "../../node_modules/@antv/util/esm/lodash/is-number.js";
+let Simulation$1 = class Simulation extends BaseSimulation {
+  constructor() {
+    super(...arguments);
+    this.sg = 0;
+    this.forces = {};
+    this.preForces = {};
+    this.bodies = {};
+    this.sizes = {};
+    this.maxIteration = 0;
+  }
+  data(model, sizes) {
+    this.model = model;
+    this.sizes = sizes;
+    return this;
+  }
+  initialize(options) {
+    super.initialize(options);
+    this.maxIteration = options.maxIteration;
+    this.sg = 0;
+    this.initForces();
+  }
+  initForces() {
+    const { model, options } = this;
+    const { kr, barnesHut } = options;
+    const nodes = model.nodes();
+    this.forces = {};
+    this.preForces = {};
+    this.bodies = {};
+    for (let i = 0; i < nodes.length; i += 1) {
+      const node = nodes[i];
+      this.forces[node.id] = [0, 0];
+      this.preForces[node.id] = [0, 0];
+      if (barnesHut) {
+        const params = {
+          id: i,
+          rx: node.x,
+          ry: node.y,
+          mass: 1,
+          g: kr,
+          degree: model.degree(node.id)
+        };
+        this.bodies[node.id] = new Body(params);
+      }
+    }
+  }
+  /**
+   * Set a node's fixed position
+   */
+  setFixedPosition(id, position) {
+    const node = this.model.node(id);
+    if (!node)
+      return;
+    const keys = ["fx", "fy", "fz"];
+    if (position === null) {
+      keys.forEach((key) => {
+        delete node[key];
+      });
+      return;
+    }
+    position.forEach((value, index) => {
+      if (index < keys.length && (typeof value === "number" || value === null)) {
+        node[keys[index]] = value;
+      }
+    });
+  }
+  isNodeFixed(node) {
+    return isNumber(node.fx) && isNumber(node.fy);
+  }
+  syncFixedPositions() {
+    this.model.forEachNode((node) => {
+      if (this.isNodeFixed(node)) {
+        node.x = node.fx;
+        node.y = node.fy;
+      }
+    });
+  }
+  /**
+   * Execute one step of the simulation
+   */
+  runOneStep() {
+    const { model, options } = this;
+    const { preventOverlap, barnesHut } = options;
+    const iter = this.maxIteration - this.iteration;
+    const krPrime = 100;
+    const nodes = model.nodes();
+    for (let i = 0; i < nodes.length; i += 1) {
+      const { id } = nodes[i];
+      this.preForces[id] = [...this.forces[id] || [0, 0]];
+      this.forces[id] = [0, 0];
+    }
+    this.syncFixedPositions();
+    this.calculateAttractive(iter);
+    if (barnesHut && !preventOverlap) {
+      this.calculateOptRepulsiveGravity();
+    } else {
+      this.calculateRepulsiveGravity(iter, krPrime);
+    }
+    return this.updatePositions();
+  }
+  calculateAttractive(iter) {
+    const { model, options } = this;
+    const { preventOverlap, dissuadeHubs, mode, prune } = options;
+    const edges = model.edges();
+    for (let i = 0; i < edges.length; i += 1) {
+      const { source, target } = edges[i];
+      const sourceNode = model.node(source);
+      const targetNode = model.node(target);
+      const sourceDegree = model.degree(source);
+      const targetDegree = model.degree(target);
+      if (prune && (sourceDegree <= 1 || targetDegree <= 1))
+        continue;
+      const dirX = targetNode.x - sourceNode.x;
+      const dirY = targetNode.y - sourceNode.y;
+      let eucliDis = Math.hypot(dirX, dirY);
+      eucliDis = eucliDis < 1e-4 ? 1e-4 : eucliDis;
+      const nx = dirX / eucliDis;
+      const ny = dirY / eucliDis;
+      let effectiveDist = eucliDis;
+      if (preventOverlap) {
+        effectiveDist = Math.max(0, eucliDis - this.sizes[source] - this.sizes[target]);
+      }
+      let faSource = effectiveDist;
+      let faTarget = effectiveDist;
+      if (mode === "linlog") {
+        faSource = Math.log(1 + effectiveDist);
+        faTarget = faSource;
+      }
+      if (dissuadeHubs) {
+        faSource = effectiveDist / sourceDegree;
+        faTarget = effectiveDist / targetDegree;
+      }
+      this.forces[source][0] += faSource * nx;
+      this.forces[source][1] += faSource * ny;
+      this.forces[target][0] -= faTarget * nx;
+      this.forces[target][1] -= faTarget * ny;
+    }
+  }
+  calculateOptRepulsiveGravity() {
+    const { model, options } = this;
+    const { kg, center, prune, kr } = options;
+    const nodes = model.nodes();
+    const n = nodes.length;
+    let minx = Number.POSITIVE_INFINITY;
+    let maxx = Number.NEGATIVE_INFINITY;
+    let miny = Number.POSITIVE_INFINITY;
+    let maxy = Number.NEGATIVE_INFINITY;
+    for (let i = 0; i < n; i += 1) {
+      const node = nodes[i];
+      const { id, x, y } = node;
+      if (prune && model.degree(id) <= 1)
+        continue;
+      const body = this.bodies[id];
+      if (!body)
+        continue;
+      body.setPos(x, y);
+      if (x < minx)
+        minx = x;
+      if (x > maxx)
+        maxx = x;
+      if (y < miny)
+        miny = y;
+      if (y > maxy)
+        maxy = y;
+    }
+    let width = Math.max(maxx - minx, maxy - miny);
+    if (!isFinite(width) || width <= 0)
+      width = 1;
+    const quadParams = {
+      xmid: (maxx + minx) / 2,
+      ymid: (maxy + miny) / 2,
+      length: width,
+      massCenter: center,
+      mass: n
+    };
+    const quad = new Quad(quadParams);
+    const quadTree = new QuadTree(quad);
+    for (let i = 0; i < n; i += 1) {
+      const { id } = nodes[i];
+      if (prune && model.degree(id) <= 1)
+        continue;
+      const body = this.bodies[id];
+      if (body && body.in(quad))
+        quadTree.insert(body);
+    }
+    for (let i = 0; i < n; i += 1) {
+      const node = nodes[i];
+      const { id, x, y } = node;
+      const degree = model.degree(id);
+      if (prune && degree <= 1)
+        continue;
+      const body = this.bodies[id];
+      if (!body)
+        continue;
+      body.resetForce();
+      quadTree.updateForce(body);
+      this.forces[id][0] -= body.fx;
+      this.forces[id][1] -= body.fy;
+      const dx = x - center[0];
+      const dy = y - center[1];
+      let dist = Math.hypot(dx, dy);
+      dist = dist < 1e-4 ? 1e-4 : dist;
+      const nx = dx / dist;
+      const ny = dy / dist;
+      const fg = kg * (degree + 1);
+      this.forces[id][0] -= fg * nx;
+      this.forces[id][1] -= fg * ny;
+    }
+  }
+  calculateRepulsiveGravity(iter, krPrime) {
+    const { model, options } = this;
+    const { preventOverlap, kr, kg, center, prune } = options;
+    const nodes = model.nodes();
+    const n = nodes.length;
+    for (let i = 0; i < n; i += 1) {
+      const nodei = nodes[i];
+      const degreei = model.degree(nodei.id);
+      for (let j = i + 1; j < n; j += 1) {
+        const nodej = nodes[j];
+        const degreej = model.degree(nodej.id);
+        if (prune && (degreei <= 1 || degreej <= 1))
+          continue;
+        const dx = nodej.x - nodei.x;
+        const dy = nodej.y - nodei.y;
+        let dist = Math.hypot(dx, dy);
+        dist = dist < 1e-4 ? 1e-4 : dist;
+        const nx = dx / dist;
+        const ny = dy / dist;
+        let effDist = dist;
+        let fr;
+        if (preventOverlap) {
+          const overlap = dist - this.sizes[nodei.id] - this.sizes[nodej.id];
+          if (overlap < 0) {
+            fr = krPrime * (degreei + 1) * (degreej + 1);
+          } else if (overlap === 0) {
+            fr = 0;
+          } else {
+            effDist = overlap;
+            fr = kr * (degreei + 1) * (degreej + 1) / effDist;
+          }
+        } else {
+          fr = kr * (degreei + 1) * (degreej + 1) / effDist;
+        }
+        this.forces[nodei.id][0] -= fr * nx;
+        this.forces[nodei.id][1] -= fr * ny;
+        this.forces[nodej.id][0] += fr * nx;
+        this.forces[nodej.id][1] += fr * ny;
+      }
+      const gx = nodei.x - center[0];
+      const gy = nodei.y - center[1];
+      let gdist = Math.hypot(gx, gy);
+      gdist = gdist < 1e-4 ? 1e-4 : gdist;
+      const gnx = gx / gdist;
+      const gny = gy / gdist;
+      const fg = kg * (degreei + 1);
+      this.forces[nodei.id][0] -= fg * gnx;
+      this.forces[nodei.id][1] -= fg * gny;
+    }
+  }
+  updatePositions() {
+    const { model, options } = this;
+    const { ks, tao, prune, ksmax, distanceThresholdMode = "max" } = options;
+    const nodes = model.nodes();
+    const n = nodes.length;
+    const swgns = {};
+    const trans = {};
+    let swgG = 0;
+    let traG = 0;
+    for (let i = 0; i < n; i += 1) {
+      const { id } = nodes[i];
+      const degree = model.degree(id);
+      if (prune && degree <= 1)
+        continue;
+      const prev = this.preForces[id] || [0, 0];
+      const cur = this.forces[id] || [0, 0];
+      const minusX = cur[0] - prev[0];
+      const minusY = cur[1] - prev[1];
+      const minusNorm = Math.hypot(minusX, minusY);
+      const addX = cur[0] + prev[0];
+      const addY = cur[1] + prev[1];
+      const addNorm = Math.hypot(addX, addY);
+      swgns[id] = minusNorm;
+      trans[id] = addNorm / 2;
+      swgG += (degree + 1) * swgns[id];
+      traG += (degree + 1) * trans[id];
+    }
+    let usingSg = this.sg;
+    const preSG = this.sg;
+    if (swgG <= 0) {
+      usingSg = preSG > 0 ? preSG : 1;
+    } else {
+      usingSg = tao * traG / swgG;
+      if (preSG !== 0) {
+        usingSg = usingSg > 1.5 * preSG ? 1.5 * preSG : usingSg;
+      }
+    }
+    this.sg = usingSg;
+    let maxDistance = 0;
+    let minDistance = Infinity;
+    let sumDistance = 0;
+    let movedCount = 0;
+    for (let i = 0; i < n; i += 1) {
+      const node = nodes[i];
+      const id = node.id;
+      const degree = model.degree(id);
+      if (prune && degree <= 1)
+        continue;
+      if (this.isNodeFixed(node))
+        continue;
+      const swgVal = swgns[id] || 0;
+      let sn = ks * usingSg / (1 + usingSg * Math.sqrt(swgVal));
+      let absForce = Math.hypot(this.forces[id][0], this.forces[id][1]);
+      absForce = absForce < 1e-4 ? 1e-4 : absForce;
+      const maxStep = ksmax / absForce;
+      if (sn > maxStep)
+        sn = maxStep;
+      const dx = sn * this.forces[id][0];
+      const dy = sn * this.forces[id][1];
+      node.x += dx;
+      node.y += dy;
+      const dist = Math.hypot(dx, dy);
+      if (dist > 0) {
+        movedCount++;
+        sumDistance += dist;
+        if (dist > maxDistance)
+          maxDistance = dist;
+        if (dist < minDistance)
+          minDistance = dist;
+      }
+    }
+    switch (distanceThresholdMode) {
+      case "min":
+        return minDistance;
+      case "mean":
+        return movedCount > 0 ? sumDistance / movedCount : 0;
+      case "max":
+      default:
+        return maxDistance;
+    }
+  }
+  destroy() {
+    this.stop();
+    this.forces = {};
+    this.preForces = {};
+    this.bodies = {};
+    this.sizes = {};
+    this.off();
+  }
+};
+export {
+  Simulation$1 as Simulation
+};
+//# sourceMappingURL=simulation.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/force-atlas2/simulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simulation.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/algorithm/force-atlas2/simulation.js"],"sourcesContent":["import { BaseSimulation } from '../base-simulation.js';\nimport Body from './body.js';\nimport Quad from './quad.js';\nimport QuadTree from './quad-tree.js';\nimport isNumber from '../../node_modules/@antv/util/esm/lodash/is-number.js';\n\n/**\n * ForceAtlas2 Simulation\n */\nlet Simulation$1 = class Simulation extends BaseSimulation {\n    constructor() {\n        super(...arguments);\n        this.sg = 0;\n        this.forces = {};\n        this.preForces = {};\n        this.bodies = {};\n        this.sizes = {};\n        this.maxIteration = 0;\n    }\n    data(model, sizes) {\n        this.model = model;\n        this.sizes = sizes;\n        return this;\n    }\n    initialize(options) {\n        super.initialize(options);\n        this.maxIteration = options.maxIteration;\n        this.sg = 0;\n        this.initForces();\n    }\n    initForces() {\n        const { model, options } = this;\n        const { kr, barnesHut } = options;\n        const nodes = model.nodes();\n        this.forces = {};\n        this.preForces = {};\n        this.bodies = {};\n        for (let i = 0; i < nodes.length; i += 1) {\n            const node = nodes[i];\n            this.forces[node.id] = [0, 0];\n            this.preForces[node.id] = [0, 0];\n            if (barnesHut) {\n                const params = {\n                    id: i,\n                    rx: node.x,\n                    ry: node.y,\n                    mass: 1,\n                    g: kr,\n                    degree: model.degree(node.id),\n                };\n                this.bodies[node.id] = new Body(params);\n            }\n        }\n    }\n    /**\n     * Set a node's fixed position\n     */\n    setFixedPosition(id, position) {\n        const node = this.model.node(id);\n        if (!node)\n            return;\n        const keys = ['fx', 'fy', 'fz'];\n        if (position === null) {\n            // Unset fixed position\n            keys.forEach((key) => {\n                delete node[key];\n            });\n            return;\n        }\n        position.forEach((value, index) => {\n            if (index < keys.length &&\n                (typeof value === 'number' || value === null)) {\n                node[keys[index]] = value;\n            }\n        });\n    }\n    isNodeFixed(node) {\n        return isNumber(node.fx) && isNumber(node.fy);\n    }\n    syncFixedPositions() {\n        this.model.forEachNode((node) => {\n            if (this.isNodeFixed(node)) {\n                node.x = node.fx;\n                node.y = node.fy;\n            }\n        });\n    }\n    /**\n     * Execute one step of the simulation\n     */\n    runOneStep() {\n        const { model, options } = this;\n        const { preventOverlap, barnesHut } = options;\n        const iter = this.maxIteration - this.iteration;\n        const krPrime = 100;\n        // Save previous & reset current force vectors\n        const nodes = model.nodes();\n        for (let i = 0; i < nodes.length; i += 1) {\n            const { id } = nodes[i];\n            this.preForces[id] = [...(this.forces[id] || [0, 0])];\n            this.forces[id] = [0, 0];\n        }\n        this.syncFixedPositions();\n        // 1. Attractive forces (edges)\n        this.calculateAttractive(iter);\n        // 2. Repulsive forces + gravity\n        // 当启用 Barnes-Hut 且不需要防重叠时使用优化算法\n        if (barnesHut && !preventOverlap) {\n            this.calculateOptRepulsiveGravity();\n        }\n        else {\n            this.calculateRepulsiveGravity(iter, krPrime);\n        }\n        // 3. Update positions\n        return this.updatePositions();\n    }\n    calculateAttractive(iter) {\n        const { model, options } = this;\n        const { preventOverlap, dissuadeHubs, mode, prune } = options;\n        const edges = model.edges();\n        for (let i = 0; i < edges.length; i += 1) {\n            const { source, target } = edges[i];\n            const sourceNode = model.node(source);\n            const targetNode = model.node(target);\n            const sourceDegree = model.degree(source);\n            const targetDegree = model.degree(target);\n            if (prune && (sourceDegree <= 1 || targetDegree <= 1))\n                continue;\n            const dirX = targetNode.x - sourceNode.x;\n            const dirY = targetNode.y - sourceNode.y;\n            let eucliDis = Math.hypot(dirX, dirY);\n            eucliDis = eucliDis < 1e-4 ? 1e-4 : eucliDis;\n            const nx = dirX / eucliDis;\n            const ny = dirY / eucliDis;\n            let effectiveDist = eucliDis;\n            // 当启用 preventOverlap 时,考虑节点大小,确保有效距离不为负\n            if (preventOverlap) {\n                effectiveDist = Math.max(0, eucliDis - this.sizes[source] - this.sizes[target]);\n            }\n            let faSource = effectiveDist;\n            let faTarget = effectiveDist;\n            if (mode === 'linlog') {\n                faSource = Math.log(1 + effectiveDist);\n                faTarget = faSource;\n            }\n            if (dissuadeHubs) {\n                faSource = effectiveDist / sourceDegree;\n                faTarget = effectiveDist / targetDegree;\n            }\n            this.forces[source][0] += faSource * nx;\n            this.forces[source][1] += faSource * ny;\n            this.forces[target][0] -= faTarget * nx;\n            this.forces[target][1] -= faTarget * ny;\n        }\n    }\n    calculateOptRepulsiveGravity() {\n        const { model, options } = this;\n        const { kg, center, prune, kr } = options;\n        const nodes = model.nodes();\n        const n = nodes.length;\n        // Compute bounding box and set body positions\n        let minx = Number.POSITIVE_INFINITY;\n        let maxx = Number.NEGATIVE_INFINITY;\n        let miny = Number.POSITIVE_INFINITY;\n        let maxy = Number.NEGATIVE_INFINITY;\n        for (let i = 0; i < n; i += 1) {\n            const node = nodes[i];\n            const { id, x, y } = node;\n            if (prune && model.degree(id) <= 1)\n                continue;\n            const body = this.bodies[id];\n            if (!body)\n                continue;\n            body.setPos(x, y);\n            if (x < minx)\n                minx = x;\n            if (x > maxx)\n                maxx = x;\n            if (y < miny)\n                miny = y;\n            if (y > maxy)\n                maxy = y;\n        }\n        let width = Math.max(maxx - minx, maxy - miny);\n        if (!isFinite(width) || width <= 0)\n            width = 1;\n        const quadParams = {\n            xmid: (maxx + minx) / 2,\n            ymid: (maxy + miny) / 2,\n            length: width,\n            massCenter: center,\n            mass: n,\n        };\n        const quad = new Quad(quadParams);\n        const quadTree = new QuadTree(quad);\n        // Insert bodies into tree\n        for (let i = 0; i < n; i += 1) {\n            const { id } = nodes[i];\n            if (prune && model.degree(id) <= 1)\n                continue;\n            const body = this.bodies[id];\n            if (body && body.in(quad))\n                quadTree.insert(body);\n        }\n        // Compute forces\n        for (let i = 0; i < n; i += 1) {\n            const node = nodes[i];\n            const { id, x, y } = node;\n            const degree = model.degree(id);\n            if (prune && degree <= 1)\n                continue;\n            const body = this.bodies[id];\n            if (!body)\n                continue;\n            body.resetForce();\n            quadTree.updateForce(body);\n            this.forces[id][0] -= body.fx;\n            this.forces[id][1] -= body.fy;\n            // Gravity toward center\n            const dx = x - center[0];\n            const dy = y - center[1];\n            let dist = Math.hypot(dx, dy);\n            dist = dist < 1e-4 ? 1e-4 : dist;\n            const nx = dx / dist;\n            const ny = dy / dist;\n            const fg = kg * (degree + 1);\n            this.forces[id][0] -= fg * nx;\n            this.forces[id][1] -= fg * ny;\n        }\n    }\n    calculateRepulsiveGravity(iter, krPrime) {\n        const { model, options } = this;\n        const { preventOverlap, kr, kg, center, prune } = options;\n        const nodes = model.nodes();\n        const n = nodes.length;\n        for (let i = 0; i < n; i += 1) {\n            const nodei = nodes[i];\n            const degreei = model.degree(nodei.id);\n            for (let j = i + 1; j < n; j += 1) {\n                const nodej = nodes[j];\n                const degreej = model.degree(nodej.id);\n                if (prune && (degreei <= 1 || degreej <= 1))\n                    continue;\n                const dx = nodej.x - nodei.x;\n                const dy = nodej.y - nodei.y;\n                let dist = Math.hypot(dx, dy);\n                dist = dist < 1e-4 ? 1e-4 : dist;\n                const nx = dx / dist;\n                const ny = dy / dist;\n                let effDist = dist;\n                let fr;\n                // 当启用 preventOverlap 时,考虑节点大小\n                if (preventOverlap) {\n                    const overlap = dist - this.sizes[nodei.id] - this.sizes[nodej.id];\n                    if (overlap < 0) {\n                        // 节点重叠,使用强推力\n                        fr = krPrime * (degreei + 1) * (degreej + 1);\n                    }\n                    else if (overlap === 0) {\n                        // 节点刚好接触,无斥力\n                        fr = 0;\n                    }\n                    else {\n                        // 节点未重叠,使用正常斥力\n                        effDist = overlap;\n                        fr = (kr * (degreei + 1) * (degreej + 1)) / effDist;\n                    }\n                }\n                else {\n                    fr = (kr * (degreei + 1) * (degreej + 1)) / effDist;\n                }\n                this.forces[nodei.id][0] -= fr * nx;\n                this.forces[nodei.id][1] -= fr * ny;\n                this.forces[nodej.id][0] += fr * nx;\n                this.forces[nodej.id][1] += fr * ny;\n            }\n            // Gravity toward center\n            const gx = nodei.x - center[0];\n            const gy = nodei.y - center[1];\n            let gdist = Math.hypot(gx, gy);\n            gdist = gdist < 1e-4 ? 1e-4 : gdist;\n            const gnx = gx / gdist;\n            const gny = gy / gdist;\n            const fg = kg * (degreei + 1);\n            this.forces[nodei.id][0] -= fg * gnx;\n            this.forces[nodei.id][1] -= fg * gny;\n        }\n    }\n    updatePositions() {\n        const { model, options } = this;\n        const { ks, tao, prune, ksmax, distanceThresholdMode = 'max' } = options;\n        const nodes = model.nodes();\n        const n = nodes.length;\n        const swgns = {};\n        const trans = {};\n        let swgG = 0;\n        let traG = 0;\n        // -------- ① 计算 swg / tra --------\n        for (let i = 0; i < n; i += 1) {\n            const { id } = nodes[i];\n            const degree = model.degree(id);\n            if (prune && degree <= 1)\n                continue;\n            const prev = this.preForces[id] || [0, 0];\n            const cur = this.forces[id] || [0, 0];\n            const minusX = cur[0] - prev[0];\n            const minusY = cur[1] - prev[1];\n            const minusNorm = Math.hypot(minusX, minusY);\n            const addX = cur[0] + prev[0];\n            const addY = cur[1] + prev[1];\n            const addNorm = Math.hypot(addX, addY);\n            swgns[id] = minusNorm;\n            trans[id] = addNorm / 2;\n            swgG += (degree + 1) * swgns[id];\n            traG += (degree + 1) * trans[id];\n        }\n        // -------- ② 更新 sg --------\n        let usingSg = this.sg;\n        const preSG = this.sg;\n        if (swgG <= 0) {\n            usingSg = preSG > 0 ? preSG : 1;\n        }\n        else {\n            usingSg = (tao * traG) / swgG;\n            if (preSG !== 0) {\n                usingSg = usingSg > 1.5 * preSG ? 1.5 * preSG : usingSg;\n            }\n        }\n        this.sg = usingSg;\n        // -------- ③ 新增：distance 累计 --------\n        let maxDistance = 0;\n        let minDistance = Infinity;\n        let sumDistance = 0;\n        let movedCount = 0;\n        // -------- ④ 更新位置 --------\n        for (let i = 0; i < n; i += 1) {\n            const node = nodes[i];\n            const id = node.id;\n            const degree = model.degree(id);\n            if (prune && degree <= 1)\n                continue;\n            if (this.isNodeFixed(node))\n                continue;\n            const swgVal = swgns[id] || 0;\n            let sn = (ks * usingSg) / (1 + usingSg * Math.sqrt(swgVal));\n            let absForce = Math.hypot(this.forces[id][0], this.forces[id][1]);\n            absForce = absForce < 1e-4 ? 1e-4 : absForce;\n            const maxStep = ksmax / absForce;\n            if (sn > maxStep)\n                sn = maxStep;\n            const dx = sn * this.forces[id][0];\n            const dy = sn * this.forces[id][1];\n            node.x += dx;\n            node.y += dy;\n            // -------- ⑤ 记录位移 --------\n            const dist = Math.hypot(dx, dy);\n            if (dist > 0) {\n                movedCount++;\n                sumDistance += dist;\n                if (dist > maxDistance)\n                    maxDistance = dist;\n                if (dist < minDistance)\n                    minDistance = dist;\n            }\n        }\n        // -------- ⑥ 根据 mode 返回 distance --------\n        switch (distanceThresholdMode) {\n            case 'min':\n                return minDistance;\n            case 'mean':\n                return movedCount > 0 ? sumDistance / movedCount : 0;\n            case 'max':\n            default:\n                return maxDistance;\n        }\n    }\n    destroy() {\n        this.stop();\n        this.forces = {};\n        this.preForces = {};\n        this.bodies = {};\n        this.sizes = {};\n        this.off();\n    }\n};\n\nexport { Simulation$1 as Simulation };\n//# sourceMappingURL=simulation.js.map\n"],"names":[],"mappings":";;;;;AASG,IAAC,eAAe,MAAM,mBAAmB,eAAe;AAAA,EACvD,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,KAAK;AACV,SAAK,SAAS,CAAA;AACd,SAAK,YAAY,CAAA;AACjB,SAAK,SAAS,CAAA;AACd,SAAK,QAAQ,CAAA;AACb,SAAK,eAAe;AAAA,EACxB;AAAA,EACA,KAAK,OAAO,OAAO;AACf,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,WAAO;AAAA,EACX;AAAA,EACA,WAAW,SAAS;AAChB,UAAM,WAAW,OAAO;AACxB,SAAK,eAAe,QAAQ;AAC5B,SAAK,KAAK;AACV,SAAK,WAAU;AAAA,EACnB;AAAA,EACA,aAAa;AACT,UAAM,EAAE,OAAO,QAAO,IAAK;AAC3B,UAAM,EAAE,IAAI,UAAS,IAAK;AAC1B,UAAM,QAAQ,MAAM,MAAK;AACzB,SAAK,SAAS,CAAA;AACd,SAAK,YAAY,CAAA;AACjB,SAAK,SAAS,CAAA;AACd,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACtC,YAAM,OAAO,MAAM,CAAC;AACpB,WAAK,OAAO,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC;AAC5B,WAAK,UAAU,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC;AAC/B,UAAI,WAAW;AACX,cAAM,SAAS;AAAA,UACX,IAAI;AAAA,UACJ,IAAI,KAAK;AAAA,UACT,IAAI,KAAK;AAAA,UACT,MAAM;AAAA,UACN,GAAG;AAAA,UACH,QAAQ,MAAM,OAAO,KAAK,EAAE;AAAA,QAChD;AACgB,aAAK,OAAO,KAAK,EAAE,IAAI,IAAI,KAAK,MAAM;AAAA,MAC1C;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,iBAAiB,IAAI,UAAU;AAC3B,UAAM,OAAO,KAAK,MAAM,KAAK,EAAE;AAC/B,QAAI,CAAC;AACD;AACJ,UAAM,OAAO,CAAC,MAAM,MAAM,IAAI;AAC9B,QAAI,aAAa,MAAM;AAEnB,WAAK,QAAQ,CAAC,QAAQ;AAClB,eAAO,KAAK,GAAG;AAAA,MACnB,CAAC;AACD;AAAA,IACJ;AACA,aAAS,QAAQ,CAAC,OAAO,UAAU;AAC/B,UAAI,QAAQ,KAAK,WACZ,OAAO,UAAU,YAAY,UAAU,OAAO;AAC/C,aAAK,KAAK,KAAK,CAAC,IAAI;AAAA,MACxB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,YAAY,MAAM;AACd,WAAO,SAAS,KAAK,EAAE,KAAK,SAAS,KAAK,EAAE;AAAA,EAChD;AAAA,EACA,qBAAqB;AACjB,SAAK,MAAM,YAAY,CAAC,SAAS;AAC7B,UAAI,KAAK,YAAY,IAAI,GAAG;AACxB,aAAK,IAAI,KAAK;AACd,aAAK,IAAI,KAAK;AAAA,MAClB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa;AACT,UAAM,EAAE,OAAO,QAAO,IAAK;AAC3B,UAAM,EAAE,gBAAgB,UAAS,IAAK;AACtC,UAAM,OAAO,KAAK,eAAe,KAAK;AACtC,UAAM,UAAU;AAEhB,UAAM,QAAQ,MAAM,MAAK;AACzB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACtC,YAAM,EAAE,GAAE,IAAK,MAAM,CAAC;AACtB,WAAK,UAAU,EAAE,IAAI,CAAC,GAAI,KAAK,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAE;AACpD,WAAK,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC;AAAA,IAC3B;AACA,SAAK,mBAAkB;AAEvB,SAAK,oBAAoB,IAAI;AAG7B,QAAI,aAAa,CAAC,gBAAgB;AAC9B,WAAK,6BAA4B;AAAA,IACrC,OACK;AACD,WAAK,0BAA0B,MAAM,OAAO;AAAA,IAChD;AAEA,WAAO,KAAK,gBAAe;AAAA,EAC/B;AAAA,EACA,oBAAoB,MAAM;AACtB,UAAM,EAAE,OAAO,QAAO,IAAK;AAC3B,UAAM,EAAE,gBAAgB,cAAc,MAAM,MAAK,IAAK;AACtD,UAAM,QAAQ,MAAM,MAAK;AACzB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACtC,YAAM,EAAE,QAAQ,WAAW,MAAM,CAAC;AAClC,YAAM,aAAa,MAAM,KAAK,MAAM;AACpC,YAAM,aAAa,MAAM,KAAK,MAAM;AACpC,YAAM,eAAe,MAAM,OAAO,MAAM;AACxC,YAAM,eAAe,MAAM,OAAO,MAAM;AACxC,UAAI,UAAU,gBAAgB,KAAK,gBAAgB;AAC/C;AACJ,YAAM,OAAO,WAAW,IAAI,WAAW;AACvC,YAAM,OAAO,WAAW,IAAI,WAAW;AACvC,UAAI,WAAW,KAAK,MAAM,MAAM,IAAI;AACpC,iBAAW,WAAW,OAAO,OAAO;AACpC,YAAM,KAAK,OAAO;AAClB,YAAM,KAAK,OAAO;AAClB,UAAI,gBAAgB;AAEpB,UAAI,gBAAgB;AAChB,wBAAgB,KAAK,IAAI,GAAG,WAAW,KAAK,MAAM,MAAM,IAAI,KAAK,MAAM,MAAM,CAAC;AAAA,MAClF;AACA,UAAI,WAAW;AACf,UAAI,WAAW;AACf,UAAI,SAAS,UAAU;AACnB,mBAAW,KAAK,IAAI,IAAI,aAAa;AACrC,mBAAW;AAAA,MACf;AACA,UAAI,cAAc;AACd,mBAAW,gBAAgB;AAC3B,mBAAW,gBAAgB;AAAA,MAC/B;AACA,WAAK,OAAO,MAAM,EAAE,CAAC,KAAK,WAAW;AACrC,WAAK,OAAO,MAAM,EAAE,CAAC,KAAK,WAAW;AACrC,WAAK,OAAO,MAAM,EAAE,CAAC,KAAK,WAAW;AACrC,WAAK,OAAO,MAAM,EAAE,CAAC,KAAK,WAAW;AAAA,IACzC;AAAA,EACJ;AAAA,EACA,+BAA+B;AAC3B,UAAM,EAAE,OAAO,QAAO,IAAK;AAC3B,UAAM,EAAE,IAAI,QAAQ,OAAO,GAAE,IAAK;AAClC,UAAM,QAAQ,MAAM,MAAK;AACzB,UAAM,IAAI,MAAM;AAEhB,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO,OAAO;AAClB,QAAI,OAAO,OAAO;AAClB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC3B,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,EAAE,IAAI,GAAG,EAAC,IAAK;AACrB,UAAI,SAAS,MAAM,OAAO,EAAE,KAAK;AAC7B;AACJ,YAAM,OAAO,KAAK,OAAO,EAAE;AAC3B,UAAI,CAAC;AACD;AACJ,WAAK,OAAO,GAAG,CAAC;AAChB,UAAI,IAAI;AACJ,eAAO;AACX,UAAI,IAAI;AACJ,eAAO;AACX,UAAI,IAAI;AACJ,eAAO;AACX,UAAI,IAAI;AACJ,eAAO;AAAA,IACf;AACA,QAAI,QAAQ,KAAK,IAAI,OAAO,MAAM,OAAO,IAAI;AAC7C,QAAI,CAAC,SAAS,KAAK,KAAK,SAAS;AAC7B,cAAQ;AACZ,UAAM,aAAa;AAAA,MACf,OAAO,OAAO,QAAQ;AAAA,MACtB,OAAO,OAAO,QAAQ;AAAA,MACtB,QAAQ;AAAA,MACR,YAAY;AAAA,MACZ,MAAM;AAAA,IAClB;AACQ,UAAM,OAAO,IAAI,KAAK,UAAU;AAChC,UAAM,WAAW,IAAI,SAAS,IAAI;AAElC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC3B,YAAM,EAAE,GAAE,IAAK,MAAM,CAAC;AACtB,UAAI,SAAS,MAAM,OAAO,EAAE,KAAK;AAC7B;AACJ,YAAM,OAAO,KAAK,OAAO,EAAE;AAC3B,UAAI,QAAQ,KAAK,GAAG,IAAI;AACpB,iBAAS,OAAO,IAAI;AAAA,IAC5B;AAEA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC3B,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,EAAE,IAAI,GAAG,EAAC,IAAK;AACrB,YAAM,SAAS,MAAM,OAAO,EAAE;AAC9B,UAAI,SAAS,UAAU;AACnB;AACJ,YAAM,OAAO,KAAK,OAAO,EAAE;AAC3B,UAAI,CAAC;AACD;AACJ,WAAK,WAAU;AACf,eAAS,YAAY,IAAI;AACzB,WAAK,OAAO,EAAE,EAAE,CAAC,KAAK,KAAK;AAC3B,WAAK,OAAO,EAAE,EAAE,CAAC,KAAK,KAAK;AAE3B,YAAM,KAAK,IAAI,OAAO,CAAC;AACvB,YAAM,KAAK,IAAI,OAAO,CAAC;AACvB,UAAI,OAAO,KAAK,MAAM,IAAI,EAAE;AAC5B,aAAO,OAAO,OAAO,OAAO;AAC5B,YAAM,KAAK,KAAK;AAChB,YAAM,KAAK,KAAK;AAChB,YAAM,KAAK,MAAM,SAAS;AAC1B,WAAK,OAAO,EAAE,EAAE,CAAC,KAAK,KAAK;AAC3B,WAAK,OAAO,EAAE,EAAE,CAAC,KAAK,KAAK;AAAA,IAC/B;AAAA,EACJ;AAAA,EACA,0BAA0B,MAAM,SAAS;AACrC,UAAM,EAAE,OAAO,QAAO,IAAK;AAC3B,UAAM,EAAE,gBAAgB,IAAI,IAAI,QAAQ,MAAK,IAAK;AAClD,UAAM,QAAQ,MAAM,MAAK;AACzB,UAAM,IAAI,MAAM;AAChB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC3B,YAAM,QAAQ,MAAM,CAAC;AACrB,YAAM,UAAU,MAAM,OAAO,MAAM,EAAE;AACrC,eAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC/B,cAAM,QAAQ,MAAM,CAAC;AACrB,cAAM,UAAU,MAAM,OAAO,MAAM,EAAE;AACrC,YAAI,UAAU,WAAW,KAAK,WAAW;AACrC;AACJ,cAAM,KAAK,MAAM,IAAI,MAAM;AAC3B,cAAM,KAAK,MAAM,IAAI,MAAM;AAC3B,YAAI,OAAO,KAAK,MAAM,IAAI,EAAE;AAC5B,eAAO,OAAO,OAAO,OAAO;AAC5B,cAAM,KAAK,KAAK;AAChB,cAAM,KAAK,KAAK;AAChB,YAAI,UAAU;AACd,YAAI;AAEJ,YAAI,gBAAgB;AAChB,gBAAM,UAAU,OAAO,KAAK,MAAM,MAAM,EAAE,IAAI,KAAK,MAAM,MAAM,EAAE;AACjE,cAAI,UAAU,GAAG;AAEb,iBAAK,WAAW,UAAU,MAAM,UAAU;AAAA,UAC9C,WACS,YAAY,GAAG;AAEpB,iBAAK;AAAA,UACT,OACK;AAED,sBAAU;AACV,iBAAM,MAAM,UAAU,MAAM,UAAU,KAAM;AAAA,UAChD;AAAA,QACJ,OACK;AACD,eAAM,MAAM,UAAU,MAAM,UAAU,KAAM;AAAA,QAChD;AACA,aAAK,OAAO,MAAM,EAAE,EAAE,CAAC,KAAK,KAAK;AACjC,aAAK,OAAO,MAAM,EAAE,EAAE,CAAC,KAAK,KAAK;AACjC,aAAK,OAAO,MAAM,EAAE,EAAE,CAAC,KAAK,KAAK;AACjC,aAAK,OAAO,MAAM,EAAE,EAAE,CAAC,KAAK,KAAK;AAAA,MACrC;AAEA,YAAM,KAAK,MAAM,IAAI,OAAO,CAAC;AAC7B,YAAM,KAAK,MAAM,IAAI,OAAO,CAAC;AAC7B,UAAI,QAAQ,KAAK,MAAM,IAAI,EAAE;AAC7B,cAAQ,QAAQ,OAAO,OAAO;AAC9B,YAAM,MAAM,KAAK;AACjB,YAAM,MAAM,KAAK;AACjB,YAAM,KAAK,MAAM,UAAU;AAC3B,WAAK,OAAO,MAAM,EAAE,EAAE,CAAC,KAAK,KAAK;AACjC,WAAK,OAAO,MAAM,EAAE,EAAE,CAAC,KAAK,KAAK;AAAA,IACrC;AAAA,EACJ;AAAA,EACA,kBAAkB;AACd,UAAM,EAAE,OAAO,QAAO,IAAK;AAC3B,UAAM,EAAE,IAAI,KAAK,OAAO,OAAO,wBAAwB,MAAK,IAAK;AACjE,UAAM,QAAQ,MAAM,MAAK;AACzB,UAAM,IAAI,MAAM;AAChB,UAAM,QAAQ,CAAA;AACd,UAAM,QAAQ,CAAA;AACd,QAAI,OAAO;AACX,QAAI,OAAO;AAEX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC3B,YAAM,EAAE,GAAE,IAAK,MAAM,CAAC;AACtB,YAAM,SAAS,MAAM,OAAO,EAAE;AAC9B,UAAI,SAAS,UAAU;AACnB;AACJ,YAAM,OAAO,KAAK,UAAU,EAAE,KAAK,CAAC,GAAG,CAAC;AACxC,YAAM,MAAM,KAAK,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC;AACpC,YAAM,SAAS,IAAI,CAAC,IAAI,KAAK,CAAC;AAC9B,YAAM,SAAS,IAAI,CAAC,IAAI,KAAK,CAAC;AAC9B,YAAM,YAAY,KAAK,MAAM,QAAQ,MAAM;AAC3C,YAAM,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC;AAC5B,YAAM,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC;AAC5B,YAAM,UAAU,KAAK,MAAM,MAAM,IAAI;AACrC,YAAM,EAAE,IAAI;AACZ,YAAM,EAAE,IAAI,UAAU;AACtB,eAAS,SAAS,KAAK,MAAM,EAAE;AAC/B,eAAS,SAAS,KAAK,MAAM,EAAE;AAAA,IACnC;AAEA,QAAI,UAAU,KAAK;AACnB,UAAM,QAAQ,KAAK;AACnB,QAAI,QAAQ,GAAG;AACX,gBAAU,QAAQ,IAAI,QAAQ;AAAA,IAClC,OACK;AACD,gBAAW,MAAM,OAAQ;AACzB,UAAI,UAAU,GAAG;AACb,kBAAU,UAAU,MAAM,QAAQ,MAAM,QAAQ;AAAA,MACpD;AAAA,IACJ;AACA,SAAK,KAAK;AAEV,QAAI,cAAc;AAClB,QAAI,cAAc;AAClB,QAAI,cAAc;AAClB,QAAI,aAAa;AAEjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC3B,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,KAAK,KAAK;AAChB,YAAM,SAAS,MAAM,OAAO,EAAE;AAC9B,UAAI,SAAS,UAAU;AACnB;AACJ,UAAI,KAAK,YAAY,IAAI;AACrB;AACJ,YAAM,SAAS,MAAM,EAAE,KAAK;AAC5B,UAAI,KAAM,KAAK,WAAY,IAAI,UAAU,KAAK,KAAK,MAAM;AACzD,UAAI,WAAW,KAAK,MAAM,KAAK,OAAO,EAAE,EAAE,CAAC,GAAG,KAAK,OAAO,EAAE,EAAE,CAAC,CAAC;AAChE,iBAAW,WAAW,OAAO,OAAO;AACpC,YAAM,UAAU,QAAQ;AACxB,UAAI,KAAK;AACL,aAAK;AACT,YAAM,KAAK,KAAK,KAAK,OAAO,EAAE,EAAE,CAAC;AACjC,YAAM,KAAK,KAAK,KAAK,OAAO,EAAE,EAAE,CAAC;AACjC,WAAK,KAAK;AACV,WAAK,KAAK;AAEV,YAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,UAAI,OAAO,GAAG;AACV;AACA,uBAAe;AACf,YAAI,OAAO;AACP,wBAAc;AAClB,YAAI,OAAO;AACP,wBAAc;AAAA,MACtB;AAAA,IACJ;AAEA,YAAQ,uBAAqB;AAAA,MACzB,KAAK;AACD,eAAO;AAAA,MACX,KAAK;AACD,eAAO,aAAa,IAAI,cAAc,aAAa;AAAA,MACvD,KAAK;AAAA,MACL;AACI,eAAO;AAAA,IACvB;AAAA,EACI;AAAA,EACA,UAAU;AACN,SAAK,KAAI;AACT,SAAK,SAAS,CAAA;AACd,SAAK,YAAY,CAAA;AACjB,SAAK,SAAS,CAAA;AACd,SAAK,QAAQ,CAAA;AACb,SAAK,IAAG;AAAA,EACZ;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/fruchterman/index.cjs

@@ -0,0 +1,93 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const tslib_es6 = require("../../node_modules/tslib/tslib.es6.cjs");
+const data = require("../../model/data.cjs");
+const common = require("../../util/common.cjs");
+const format = require("../../util/format.cjs");
+const viewport = require("../../util/viewport.cjs");
+const baseLayout = require("../base-layout.cjs");
+const simulation = require("./simulation.cjs");
+const DEFAULTS_LAYOUT_OPTIONS$3 = {
+  maxIteration: 1e3,
+  gravity: 10,
+  speed: 5,
+  clustering: false,
+  clusterGravity: 10,
+  width: 300,
+  height: 300,
+  nodeClusterBy: "node.cluster",
+  dimensions: 2
+};
+class FruchtermanLayout extends baseLayout.BaseLayoutWithIterations {
+  constructor() {
+    super(...arguments);
+    this.id = "fruchterman";
+    this.simulation = null;
+  }
+  getDefaultOptions() {
+    return DEFAULTS_LAYOUT_OPTIONS$3;
+  }
+  parseOptions(options = {}) {
+    const { clustering, nodeClusterBy } = this.options;
+    const clusteringEnabled = clustering && !!nodeClusterBy;
+    Object.assign(options, viewport.normalizeViewport(options), {
+      clustering: clusteringEnabled,
+      nodeClusterBy: format.formatFn(nodeClusterBy, ["node"])
+    });
+    return options;
+  }
+  layout() {
+    return tslib_es6.__awaiter(this, void 0, void 0, function* () {
+      const options = this.parseOptions(this.options);
+      const { dimensions, center, width, height } = options;
+      const n = this.model.nodeCount();
+      if (!n || n === 1) {
+        common.applySingleNodeLayout(this.model, center, dimensions);
+        return;
+      }
+      data.initNodePosition(this.model, width, height, dimensions);
+      const simulation2 = this.setSimulation();
+      simulation2.data(this.model);
+      simulation2.initialize(options);
+      simulation2.restart();
+      return new Promise((resolve) => {
+        simulation2.on("end", () => resolve());
+      });
+    });
+  }
+  setSimulation() {
+    const simulation$1 = this.simulation || new simulation.Simulation();
+    if (!this.simulation) {
+      this.simulation = simulation$1.on("tick", () => {
+        var _a, _b;
+        return (_b = (_a = this.options).onTick) === null || _b === void 0 ? void 0 : _b.call(_a, this);
+      });
+    }
+    return this.simulation;
+  }
+  restart() {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.restart();
+  }
+  stop() {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.stop();
+  }
+  tick(iterations = 1) {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.tick(iterations);
+  }
+  setFixedPosition(id, position) {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.setFixedPosition(id, position);
+  }
+  destroy() {
+    var _a;
+    super.destroy();
+    this.stop();
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.destroy();
+    this.simulation = null;
+  }
+}
+exports.FruchtermanLayout = FruchtermanLayout;
+//# sourceMappingURL=index.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/fruchterman/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/algorithm/fruchterman/index.js"],"sourcesContent":["import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';\nimport { initNodePosition } from '../../model/data.js';\nimport { applySingleNodeLayout } from '../../util/common.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { formatFn } from '../../util/format.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayoutWithIterations } from '../base-layout.js';\nimport { Simulation } from './simulation.js';\n\nconst DEFAULTS_LAYOUT_OPTIONS$3 = {\n    maxIteration: 1000,\n    gravity: 10,\n    speed: 5,\n    clustering: false,\n    clusterGravity: 10,\n    width: 300,\n    height: 300,\n    nodeClusterBy: 'node.cluster',\n    dimensions: 2,\n};\nclass FruchtermanLayout extends BaseLayoutWithIterations {\n    constructor() {\n        super(...arguments);\n        this.id = 'fruchterman';\n        this.simulation = null;\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS$3;\n    }\n    parseOptions(options = {}) {\n        const { clustering, nodeClusterBy } = this.options;\n        const clusteringEnabled = clustering && !!nodeClusterBy;\n        Object.assign(options, normalizeViewport(options), {\n            clustering: clusteringEnabled,\n            nodeClusterBy: formatFn(nodeClusterBy, ['node']),\n        });\n        return options;\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const options = this.parseOptions(this.options);\n            const { dimensions, center, width, height } = options;\n            const n = this.model.nodeCount();\n            if (!n || n === 1) {\n                applySingleNodeLayout(this.model, center, dimensions);\n                return;\n            }\n            initNodePosition(this.model, width, height, dimensions);\n            const simulation = this.setSimulation();\n            simulation.data(this.model);\n            simulation.initialize(options);\n            simulation.restart();\n            return new Promise((resolve) => {\n                simulation.on('end', () => resolve());\n            });\n        });\n    }\n    setSimulation() {\n        const simulation = this.simulation || new Simulation();\n        if (!this.simulation) {\n            this.simulation = simulation.on('tick', () => { var _a, _b; return (_b = (_a = this.options).onTick) === null || _b === void 0 ? void 0 : _b.call(_a, this); });\n        }\n        return this.simulation;\n    }\n    restart() {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.restart();\n    }\n    stop() {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.stop();\n    }\n    tick(iterations = 1) {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.tick(iterations);\n    }\n    setFixedPosition(id, position) {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.setFixedPosition(id, position);\n    }\n    destroy() {\n        var _a;\n        super.destroy();\n        this.stop();\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.destroy();\n        this.simulation = null;\n    }\n}\n\nexport { FruchtermanLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["BaseLayoutWithIterations","normalizeViewport","formatFn","__awaiter","applySingleNodeLayout","initNodePosition","simulation","Simulation"],"mappings":";;;;;;;;;AASA,MAAM,4BAA4B;AAAA,EAC9B,cAAc;AAAA,EACd,SAAS;AAAA,EACT,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,gBAAgB;AAAA,EAChB,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,YAAY;AAChB;AACA,MAAM,0BAA0BA,WAAAA,yBAAyB;AAAA,EACrD,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,KAAK;AACV,SAAK,aAAa;AAAA,EACtB;AAAA,EACA,oBAAoB;AAChB,WAAO;AAAA,EACX;AAAA,EACA,aAAa,UAAU,IAAI;AACvB,UAAM,EAAE,YAAY,cAAa,IAAK,KAAK;AAC3C,UAAM,oBAAoB,cAAc,CAAC,CAAC;AAC1C,WAAO,OAAO,SAASC,SAAAA,kBAAkB,OAAO,GAAG;AAAA,MAC/C,YAAY;AAAA,MACZ,eAAeC,OAAAA,SAAS,eAAe,CAAC,MAAM,CAAC;AAAA,IAC3D,CAAS;AACD,WAAO;AAAA,EACX;AAAA,EACA,SAAS;AACL,WAAOC,oBAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,UAAU,KAAK,aAAa,KAAK,OAAO;AAC9C,YAAM,EAAE,YAAY,QAAQ,OAAO,OAAM,IAAK;AAC9C,YAAM,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAI,CAAC,KAAK,MAAM,GAAG;AACfC,eAAAA,sBAAsB,KAAK,OAAO,QAAQ,UAAU;AACpD;AAAA,MACJ;AACAC,WAAAA,iBAAiB,KAAK,OAAO,OAAO,QAAQ,UAAU;AACtD,YAAMC,cAAa,KAAK,cAAa;AACrC,MAAAA,YAAW,KAAK,KAAK,KAAK;AAC1B,MAAAA,YAAW,WAAW,OAAO;AAC7B,MAAAA,YAAW,QAAO;AAClB,aAAO,IAAI,QAAQ,CAAC,YAAY;AAC5B,QAAAA,YAAW,GAAG,OAAO,MAAM,QAAO,CAAE;AAAA,MACxC,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,gBAAgB;AACZ,UAAMA,eAAa,KAAK,cAAc,IAAIC,WAAAA,WAAU;AACpD,QAAI,CAAC,KAAK,YAAY;AAClB,WAAK,aAAaD,aAAW,GAAG,QAAQ,MAAM;AAAE,YAAI,IAAI;AAAI,gBAAQ,MAAM,KAAK,KAAK,SAAS,YAAY,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,IAAI,IAAI;AAAA,MAAG,CAAC;AAAA,IAClK;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,UAAU;AACN,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAO;AAAA,EAC1E;AAAA,EACA,OAAO;AACH,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAI;AAAA,EACvE;AAAA,EACA,KAAK,aAAa,GAAG;AACjB,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,UAAU;AAAA,EAClF;AAAA,EACA,iBAAiB,IAAI,UAAU;AAC3B,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,iBAAiB,IAAI,QAAQ;AAAA,EAChG;AAAA,EACA,UAAU;AACN,QAAI;AACJ,UAAM,QAAO;AACb,SAAK,KAAI;AACT,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAO;AACtE,SAAK,aAAa;AAAA,EACtB;AACJ;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/fruchterman/index.js

@@ -0,0 +1,93 @@
+import { __awaiter } from "../../node_modules/tslib/tslib.es6.js";
+import { initNodePosition } from "../../model/data.js";
+import { applySingleNodeLayout } from "../../util/common.js";
+import { formatFn } from "../../util/format.js";
+import { normalizeViewport } from "../../util/viewport.js";
+import { BaseLayoutWithIterations } from "../base-layout.js";
+import { Simulation } from "./simulation.js";
+const DEFAULTS_LAYOUT_OPTIONS$3 = {
+  maxIteration: 1e3,
+  gravity: 10,
+  speed: 5,
+  clustering: false,
+  clusterGravity: 10,
+  width: 300,
+  height: 300,
+  nodeClusterBy: "node.cluster",
+  dimensions: 2
+};
+class FruchtermanLayout extends BaseLayoutWithIterations {
+  constructor() {
+    super(...arguments);
+    this.id = "fruchterman";
+    this.simulation = null;
+  }
+  getDefaultOptions() {
+    return DEFAULTS_LAYOUT_OPTIONS$3;
+  }
+  parseOptions(options = {}) {
+    const { clustering, nodeClusterBy } = this.options;
+    const clusteringEnabled = clustering && !!nodeClusterBy;
+    Object.assign(options, normalizeViewport(options), {
+      clustering: clusteringEnabled,
+      nodeClusterBy: formatFn(nodeClusterBy, ["node"])
+    });
+    return options;
+  }
+  layout() {
+    return __awaiter(this, void 0, void 0, function* () {
+      const options = this.parseOptions(this.options);
+      const { dimensions, center, width, height } = options;
+      const n = this.model.nodeCount();
+      if (!n || n === 1) {
+        applySingleNodeLayout(this.model, center, dimensions);
+        return;
+      }
+      initNodePosition(this.model, width, height, dimensions);
+      const simulation = this.setSimulation();
+      simulation.data(this.model);
+      simulation.initialize(options);
+      simulation.restart();
+      return new Promise((resolve) => {
+        simulation.on("end", () => resolve());
+      });
+    });
+  }
+  setSimulation() {
+    const simulation = this.simulation || new Simulation();
+    if (!this.simulation) {
+      this.simulation = simulation.on("tick", () => {
+        var _a, _b;
+        return (_b = (_a = this.options).onTick) === null || _b === void 0 ? void 0 : _b.call(_a, this);
+      });
+    }
+    return this.simulation;
+  }
+  restart() {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.restart();
+  }
+  stop() {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.stop();
+  }
+  tick(iterations = 1) {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.tick(iterations);
+  }
+  setFixedPosition(id, position) {
+    var _a;
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.setFixedPosition(id, position);
+  }
+  destroy() {
+    var _a;
+    super.destroy();
+    this.stop();
+    (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.destroy();
+    this.simulation = null;
+  }
+}
+export {
+  FruchtermanLayout
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/algorithm/fruchterman/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/algorithm/fruchterman/index.js"],"sourcesContent":["import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';\nimport { initNodePosition } from '../../model/data.js';\nimport { applySingleNodeLayout } from '../../util/common.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { formatFn } from '../../util/format.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayoutWithIterations } from '../base-layout.js';\nimport { Simulation } from './simulation.js';\n\nconst DEFAULTS_LAYOUT_OPTIONS$3 = {\n    maxIteration: 1000,\n    gravity: 10,\n    speed: 5,\n    clustering: false,\n    clusterGravity: 10,\n    width: 300,\n    height: 300,\n    nodeClusterBy: 'node.cluster',\n    dimensions: 2,\n};\nclass FruchtermanLayout extends BaseLayoutWithIterations {\n    constructor() {\n        super(...arguments);\n        this.id = 'fruchterman';\n        this.simulation = null;\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS$3;\n    }\n    parseOptions(options = {}) {\n        const { clustering, nodeClusterBy } = this.options;\n        const clusteringEnabled = clustering && !!nodeClusterBy;\n        Object.assign(options, normalizeViewport(options), {\n            clustering: clusteringEnabled,\n            nodeClusterBy: formatFn(nodeClusterBy, ['node']),\n        });\n        return options;\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const options = this.parseOptions(this.options);\n            const { dimensions, center, width, height } = options;\n            const n = this.model.nodeCount();\n            if (!n || n === 1) {\n                applySingleNodeLayout(this.model, center, dimensions);\n                return;\n            }\n            initNodePosition(this.model, width, height, dimensions);\n            const simulation = this.setSimulation();\n            simulation.data(this.model);\n            simulation.initialize(options);\n            simulation.restart();\n            return new Promise((resolve) => {\n                simulation.on('end', () => resolve());\n            });\n        });\n    }\n    setSimulation() {\n        const simulation = this.simulation || new Simulation();\n        if (!this.simulation) {\n            this.simulation = simulation.on('tick', () => { var _a, _b; return (_b = (_a = this.options).onTick) === null || _b === void 0 ? void 0 : _b.call(_a, this); });\n        }\n        return this.simulation;\n    }\n    restart() {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.restart();\n    }\n    stop() {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.stop();\n    }\n    tick(iterations = 1) {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.tick(iterations);\n    }\n    setFixedPosition(id, position) {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.setFixedPosition(id, position);\n    }\n    destroy() {\n        var _a;\n        super.destroy();\n        this.stop();\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.destroy();\n        this.simulation = null;\n    }\n}\n\nexport { FruchtermanLayout };\n//# sourceMappingURL=index.js.map\n"],"names":[],"mappings":";;;;;;;AASA,MAAM,4BAA4B;AAAA,EAC9B,cAAc;AAAA,EACd,SAAS;AAAA,EACT,OAAO;AAAA,EACP,YAAY;AAAA,EACZ,gBAAgB;AAAA,EAChB,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,YAAY;AAChB;AACA,MAAM,0BAA0B,yBAAyB;AAAA,EACrD,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,KAAK;AACV,SAAK,aAAa;AAAA,EACtB;AAAA,EACA,oBAAoB;AAChB,WAAO;AAAA,EACX;AAAA,EACA,aAAa,UAAU,IAAI;AACvB,UAAM,EAAE,YAAY,cAAa,IAAK,KAAK;AAC3C,UAAM,oBAAoB,cAAc,CAAC,CAAC;AAC1C,WAAO,OAAO,SAAS,kBAAkB,OAAO,GAAG;AAAA,MAC/C,YAAY;AAAA,MACZ,eAAe,SAAS,eAAe,CAAC,MAAM,CAAC;AAAA,IAC3D,CAAS;AACD,WAAO;AAAA,EACX;AAAA,EACA,SAAS;AACL,WAAO,UAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,UAAU,KAAK,aAAa,KAAK,OAAO;AAC9C,YAAM,EAAE,YAAY,QAAQ,OAAO,OAAM,IAAK;AAC9C,YAAM,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAI,CAAC,KAAK,MAAM,GAAG;AACf,8BAAsB,KAAK,OAAO,QAAQ,UAAU;AACpD;AAAA,MACJ;AACA,uBAAiB,KAAK,OAAO,OAAO,QAAQ,UAAU;AACtD,YAAM,aAAa,KAAK,cAAa;AACrC,iBAAW,KAAK,KAAK,KAAK;AAC1B,iBAAW,WAAW,OAAO;AAC7B,iBAAW,QAAO;AAClB,aAAO,IAAI,QAAQ,CAAC,YAAY;AAC5B,mBAAW,GAAG,OAAO,MAAM,QAAO,CAAE;AAAA,MACxC,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,gBAAgB;AACZ,UAAM,aAAa,KAAK,cAAc,IAAI,WAAU;AACpD,QAAI,CAAC,KAAK,YAAY;AAClB,WAAK,aAAa,WAAW,GAAG,QAAQ,MAAM;AAAE,YAAI,IAAI;AAAI,gBAAQ,MAAM,KAAK,KAAK,SAAS,YAAY,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,IAAI,IAAI;AAAA,MAAG,CAAC;AAAA,IAClK;AACA,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,UAAU;AACN,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAO;AAAA,EAC1E;AAAA,EACA,OAAO;AACH,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAI;AAAA,EACvE;AAAA,EACA,KAAK,aAAa,GAAG;AACjB,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,KAAK,UAAU;AAAA,EAClF;AAAA,EACA,iBAAiB,IAAI,UAAU;AAC3B,QAAI;AACJ,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,iBAAiB,IAAI,QAAQ;AAAA,EAChG;AAAA,EACA,UAAU;AACN,QAAI;AACJ,UAAM,QAAO;AACb,SAAK,KAAI;AACT,KAAC,KAAK,KAAK,gBAAgB,QAAQ,OAAO,SAAS,SAAS,GAAG,QAAO;AACtE,SAAK,aAAa;AAAA,EACtB;AACJ;","x_google_ignoreList":[0]}