@hkyhy/marsun-components-core 0.1.113 → 0.1.115

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

@@ -0,0 +1,200 @@
+import { BaseSimulation as w } from "../base-simulation.js";
+import D from "./body.js";
+import O from "./quad.js";
+import Y from "./quad-tree.js";
+import G from "../../node_modules/@antv/util/esm/lodash/is-number.js";
+let H = class extends w {
+  constructor() {
+    super(...arguments), this.sg = 0, this.forces = {}, this.preForces = {}, this.bodies = {}, this.sizes = {}, this.maxIteration = 0;
+  }
+  data(t, h) {
+    return this.model = t, this.sizes = h, this;
+  }
+  initialize(t) {
+    super.initialize(t), this.maxIteration = t.maxIteration, this.sg = 0, this.initForces();
+  }
+  initForces() {
+    const { model: t, options: h } = this, { kr: p, barnesHut: y } = h, o = t.nodes();
+    this.forces = {}, this.preForces = {}, this.bodies = {};
+    for (let x = 0; x < o.length; x += 1) {
+      const a = o[x];
+      if (this.forces[a.id] = [0, 0], this.preForces[a.id] = [0, 0], y) {
+        const f = {
+          id: x,
+          rx: a.x,
+          ry: a.y,
+          mass: 1,
+          g: p,
+          degree: t.degree(a.id)
+        };
+        this.bodies[a.id] = new D(f);
+      }
+    }
+  }
+  /**
+   * Set a node's fixed position
+   */
+  setFixedPosition(t, h) {
+    const p = this.model.node(t);
+    if (!p)
+      return;
+    const y = ["fx", "fy", "fz"];
+    if (h === null) {
+      y.forEach((o) => {
+        delete p[o];
+      });
+      return;
+    }
+    h.forEach((o, x) => {
+      x < y.length && (typeof o == "number" || o === null) && (p[y[x]] = o);
+    });
+  }
+  isNodeFixed(t) {
+    return G(t.fx) && G(t.fy);
+  }
+  syncFixedPositions() {
+    this.model.forEachNode((t) => {
+      this.isNodeFixed(t) && (t.x = t.fx, t.y = t.fy);
+    });
+  }
+  /**
+   * Execute one step of the simulation
+   */
+  runOneStep() {
+    const { model: t, options: h } = this, { preventOverlap: p, barnesHut: y } = h, o = this.maxIteration - this.iteration, x = 100, a = t.nodes();
+    for (let f = 0; f < a.length; f += 1) {
+      const { id: I } = a[f];
+      this.preForces[I] = [...this.forces[I] || [0, 0]], this.forces[I] = [0, 0];
+    }
+    return this.syncFixedPositions(), this.calculateAttractive(o), y && !p ? this.calculateOptRepulsiveGravity() : this.calculateRepulsiveGravity(o, x), this.updatePositions();
+  }
+  calculateAttractive(t) {
+    const { model: h, options: p } = this, { preventOverlap: y, dissuadeHubs: o, mode: x, prune: a } = p, f = h.edges();
+    for (let I = 0; I < f.length; I += 1) {
+      const { source: g, target: F } = f[I], b = h.node(g), c = h.node(F), u = h.degree(g), v = h.degree(F);
+      if (a && (u <= 1 || v <= 1))
+        continue;
+      const M = c.x - b.x, i = c.y - b.y;
+      let m = Math.hypot(M, i);
+      m = m < 1e-4 ? 1e-4 : m;
+      const n = M / m, d = i / m;
+      let e = m;
+      y && (e = Math.max(0, m - this.sizes[g] - this.sizes[F]));
+      let s = e, r = e;
+      x === "linlog" && (s = Math.log(1 + e), r = s), o && (s = e / u, r = e / v), this.forces[g][0] += s * n, this.forces[g][1] += s * d, this.forces[F][0] -= r * n, this.forces[F][1] -= r * d;
+    }
+  }
+  calculateOptRepulsiveGravity() {
+    const { model: t, options: h } = this, { kg: p, center: y, prune: o, kr: x } = h, a = t.nodes(), f = a.length;
+    let I = Number.POSITIVE_INFINITY, g = Number.NEGATIVE_INFINITY, F = Number.POSITIVE_INFINITY, b = Number.NEGATIVE_INFINITY;
+    for (let i = 0; i < f; i += 1) {
+      const m = a[i], { id: n, x: d, y: e } = m;
+      if (o && t.degree(n) <= 1)
+        continue;
+      const s = this.bodies[n];
+      s && (s.setPos(d, e), d < I && (I = d), d > g && (g = d), e < F && (F = e), e > b && (b = e));
+    }
+    let c = Math.max(g - I, b - F);
+    (!isFinite(c) || c <= 0) && (c = 1);
+    const u = {
+      xmid: (g + I) / 2,
+      ymid: (b + F) / 2,
+      length: c,
+      massCenter: y,
+      mass: f
+    }, v = new O(u), M = new Y(v);
+    for (let i = 0; i < f; i += 1) {
+      const { id: m } = a[i];
+      if (o && t.degree(m) <= 1)
+        continue;
+      const n = this.bodies[m];
+      n && n.in(v) && M.insert(n);
+    }
+    for (let i = 0; i < f; i += 1) {
+      const m = a[i], { id: n, x: d, y: e } = m, s = t.degree(n);
+      if (o && s <= 1)
+        continue;
+      const r = this.bodies[n];
+      if (!r)
+        continue;
+      r.resetForce(), M.updateForce(r), this.forces[n][0] -= r.fx, this.forces[n][1] -= r.fy;
+      const T = d - y[0], S = e - y[1];
+      let l = Math.hypot(T, S);
+      l = l < 1e-4 ? 1e-4 : l;
+      const P = T / l, k = S / l, z = p * (s + 1);
+      this.forces[n][0] -= z * P, this.forces[n][1] -= z * k;
+    }
+  }
+  calculateRepulsiveGravity(t, h) {
+    const { model: p, options: y } = this, { preventOverlap: o, kr: x, kg: a, center: f, prune: I } = y, g = p.nodes(), F = g.length;
+    for (let b = 0; b < F; b += 1) {
+      const c = g[b], u = p.degree(c.id);
+      for (let e = b + 1; e < F; e += 1) {
+        const s = g[e], r = p.degree(s.id);
+        if (I && (u <= 1 || r <= 1))
+          continue;
+        const T = s.x - c.x, S = s.y - c.y;
+        let l = Math.hypot(T, S);
+        l = l < 1e-4 ? 1e-4 : l;
+        const P = T / l, k = S / l;
+        let z = l, N;
+        if (o) {
+          const E = l - this.sizes[c.id] - this.sizes[s.id];
+          E < 0 ? N = h * (u + 1) * (r + 1) : E === 0 ? N = 0 : (z = E, N = x * (u + 1) * (r + 1) / z);
+        } else
+          N = x * (u + 1) * (r + 1) / z;
+        this.forces[c.id][0] -= N * P, this.forces[c.id][1] -= N * k, this.forces[s.id][0] += N * P, this.forces[s.id][1] += N * k;
+      }
+      const v = c.x - f[0], M = c.y - f[1];
+      let i = Math.hypot(v, M);
+      i = i < 1e-4 ? 1e-4 : i;
+      const m = v / i, n = M / i, d = a * (u + 1);
+      this.forces[c.id][0] -= d * m, this.forces[c.id][1] -= d * n;
+    }
+  }
+  updatePositions() {
+    const { model: t, options: h } = this, { ks: p, tao: y, prune: o, ksmax: x, distanceThresholdMode: a = "max" } = h, f = t.nodes(), I = f.length, g = {}, F = {};
+    let b = 0, c = 0;
+    for (let d = 0; d < I; d += 1) {
+      const { id: e } = f[d], s = t.degree(e);
+      if (o && s <= 1)
+        continue;
+      const r = this.preForces[e] || [0, 0], T = this.forces[e] || [0, 0], S = T[0] - r[0], l = T[1] - r[1], P = Math.hypot(S, l), k = T[0] + r[0], z = T[1] + r[1], N = Math.hypot(k, z);
+      g[e] = P, F[e] = N / 2, b += (s + 1) * g[e], c += (s + 1) * F[e];
+    }
+    let u = this.sg;
+    const v = this.sg;
+    b <= 0 ? u = v > 0 ? v : 1 : (u = y * c / b, v !== 0 && (u = u > 1.5 * v ? 1.5 * v : u)), this.sg = u;
+    let M = 0, i = 1 / 0, m = 0, n = 0;
+    for (let d = 0; d < I; d += 1) {
+      const e = f[d], s = e.id, r = t.degree(s);
+      if (o && r <= 1 || this.isNodeFixed(e))
+        continue;
+      const T = g[s] || 0;
+      let S = p * u / (1 + u * Math.sqrt(T)), l = Math.hypot(this.forces[s][0], this.forces[s][1]);
+      l = l < 1e-4 ? 1e-4 : l;
+      const P = x / l;
+      S > P && (S = P);
+      const k = S * this.forces[s][0], z = S * this.forces[s][1];
+      e.x += k, e.y += z;
+      const N = Math.hypot(k, z);
+      N > 0 && (n++, m += N, N > M && (M = N), N < i && (i = N));
+    }
+    switch (a) {
+      case "min":
+        return i;
+      case "mean":
+        return n > 0 ? m / n : 0;
+      case "max":
+      default:
+        return M;
+    }
+  }
+  destroy() {
+    this.stop(), this.forces = {}, this.preForces = {}, this.bodies = {}, this.sizes = {}, this.off();
+  }
+};
+export {
+  H as Simulation
+};
+//# sourceMappingURL=simulation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"simulation.js","sources":["../../../../../../../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":["Simulation$1","BaseSimulation","model","sizes","options","kr","barnesHut","nodes","i","node","params","Body","id","position","keys","key","value","index","isNumber","preventOverlap","iter","krPrime","dissuadeHubs","mode","prune","edges","source","target","sourceNode","targetNode","sourceDegree","targetDegree","dirX","dirY","eucliDis","nx","ny","effectiveDist","faSource","faTarget","kg","center","n","minx","maxx","miny","maxy","x","y","body","width","quadParams","quad","Quad","quadTree","QuadTree","degree","dx","dy","dist","fg","nodei","degreei","j","nodej","degreej","effDist","fr","overlap","gx","gy","gdist","gnx","gny","ks","tao","ksmax","distanceThresholdMode","swgns","trans","swgG","traG","prev","cur","minusX","minusY","minusNorm","addX","addY","addNorm","usingSg","preSG","maxDistance","minDistance","sumDistance","movedCount","swgVal","sn","absForce","maxStep"],"mappings":";;;;;AASG,IAACA,IAAe,cAAyBC,EAAe;AAAA,EACvD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK,GACV,KAAK,SAAS,CAAA,GACd,KAAK,YAAY,CAAA,GACjB,KAAK,SAAS,CAAA,GACd,KAAK,QAAQ,CAAA,GACb,KAAK,eAAe;AAAA,EACxB;AAAA,EACA,KAAKC,GAAOC,GAAO;AACf,gBAAK,QAAQD,GACb,KAAK,QAAQC,GACN;AAAA,EACX;AAAA,EACA,WAAWC,GAAS;AAChB,UAAM,WAAWA,CAAO,GACxB,KAAK,eAAeA,EAAQ,cAC5B,KAAK,KAAK,GACV,KAAK,WAAU;AAAA,EACnB;AAAA,EACA,aAAa;AACT,UAAM,EAAE,OAAAF,GAAO,SAAAE,EAAO,IAAK,MACrB,EAAE,IAAAC,GAAI,WAAAC,EAAS,IAAKF,GACpBG,IAAQL,EAAM,MAAK;AACzB,SAAK,SAAS,CAAA,GACd,KAAK,YAAY,CAAA,GACjB,KAAK,SAAS,CAAA;AACd,aAASM,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK,GAAG;AACtC,YAAMC,IAAOF,EAAMC,CAAC;AAGpB,UAFA,KAAK,OAAOC,EAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAC5B,KAAK,UAAUA,EAAK,EAAE,IAAI,CAAC,GAAG,CAAC,GAC3BH,GAAW;AACX,cAAMI,IAAS;AAAA,UACX,IAAIF;AAAA,UACJ,IAAIC,EAAK;AAAA,UACT,IAAIA,EAAK;AAAA,UACT,MAAM;AAAA,UACN,GAAGJ;AAAA,UACH,QAAQH,EAAM,OAAOO,EAAK,EAAE;AAAA,QAChD;AACgB,aAAK,OAAOA,EAAK,EAAE,IAAI,IAAIE,EAAKD,CAAM;AAAA,MAC1C;AAAA,IACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAIA,iBAAiBE,GAAIC,GAAU;AAC3B,UAAMJ,IAAO,KAAK,MAAM,KAAKG,CAAE;AAC/B,QAAI,CAACH;AACD;AACJ,UAAMK,IAAO,CAAC,MAAM,MAAM,IAAI;AAC9B,QAAID,MAAa,MAAM;AAEnB,MAAAC,EAAK,QAAQ,CAACC,MAAQ;AAClB,eAAON,EAAKM,CAAG;AAAA,MACnB,CAAC;AACD;AAAA,IACJ;AACA,IAAAF,EAAS,QAAQ,CAACG,GAAOC,MAAU;AAC/B,MAAIA,IAAQH,EAAK,WACZ,OAAOE,KAAU,YAAYA,MAAU,UACxCP,EAAKK,EAAKG,CAAK,CAAC,IAAID;AAAA,IAE5B,CAAC;AAAA,EACL;AAAA,EACA,YAAYP,GAAM;AACd,WAAOS,EAAST,EAAK,EAAE,KAAKS,EAAST,EAAK,EAAE;AAAA,EAChD;AAAA,EACA,qBAAqB;AACjB,SAAK,MAAM,YAAY,CAACA,MAAS;AAC7B,MAAI,KAAK,YAAYA,CAAI,MACrBA,EAAK,IAAIA,EAAK,IACdA,EAAK,IAAIA,EAAK;AAAA,IAEtB,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa;AACT,UAAM,EAAE,OAAAP,GAAO,SAAAE,EAAO,IAAK,MACrB,EAAE,gBAAAe,GAAgB,WAAAb,EAAS,IAAKF,GAChCgB,IAAO,KAAK,eAAe,KAAK,WAChCC,IAAU,KAEVd,IAAQL,EAAM,MAAK;AACzB,aAASM,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK,GAAG;AACtC,YAAM,EAAE,IAAAI,EAAE,IAAKL,EAAMC,CAAC;AACtB,WAAK,UAAUI,CAAE,IAAI,CAAC,GAAI,KAAK,OAAOA,CAAE,KAAK,CAAC,GAAG,CAAC,CAAE,GACpD,KAAK,OAAOA,CAAE,IAAI,CAAC,GAAG,CAAC;AAAA,IAC3B;AACA,gBAAK,mBAAkB,GAEvB,KAAK,oBAAoBQ,CAAI,GAGzBd,KAAa,CAACa,IACd,KAAK,6BAA4B,IAGjC,KAAK,0BAA0BC,GAAMC,CAAO,GAGzC,KAAK,gBAAe;AAAA,EAC/B;AAAA,EACA,oBAAoBD,GAAM;AACtB,UAAM,EAAE,OAAAlB,GAAO,SAAAE,EAAO,IAAK,MACrB,EAAE,gBAAAe,GAAgB,cAAAG,GAAc,MAAAC,GAAM,OAAAC,EAAK,IAAKpB,GAChDqB,IAAQvB,EAAM,MAAK;AACzB,aAASM,IAAI,GAAGA,IAAIiB,EAAM,QAAQjB,KAAK,GAAG;AACtC,YAAM,EAAE,QAAAkB,GAAQ,QAAAC,MAAWF,EAAMjB,CAAC,GAC5BoB,IAAa1B,EAAM,KAAKwB,CAAM,GAC9BG,IAAa3B,EAAM,KAAKyB,CAAM,GAC9BG,IAAe5B,EAAM,OAAOwB,CAAM,GAClCK,IAAe7B,EAAM,OAAOyB,CAAM;AACxC,UAAIH,MAAUM,KAAgB,KAAKC,KAAgB;AAC/C;AACJ,YAAMC,IAAOH,EAAW,IAAID,EAAW,GACjCK,IAAOJ,EAAW,IAAID,EAAW;AACvC,UAAIM,IAAW,KAAK,MAAMF,GAAMC,CAAI;AACpC,MAAAC,IAAWA,IAAW,OAAO,OAAOA;AACpC,YAAMC,IAAKH,IAAOE,GACZE,IAAKH,IAAOC;AAClB,UAAIG,IAAgBH;AAEpB,MAAIf,MACAkB,IAAgB,KAAK,IAAI,GAAGH,IAAW,KAAK,MAAMR,CAAM,IAAI,KAAK,MAAMC,CAAM,CAAC;AAElF,UAAIW,IAAWD,GACXE,IAAWF;AACf,MAAId,MAAS,aACTe,IAAW,KAAK,IAAI,IAAID,CAAa,GACrCE,IAAWD,IAEXhB,MACAgB,IAAWD,IAAgBP,GAC3BS,IAAWF,IAAgBN,IAE/B,KAAK,OAAOL,CAAM,EAAE,CAAC,KAAKY,IAAWH,GACrC,KAAK,OAAOT,CAAM,EAAE,CAAC,KAAKY,IAAWF,GACrC,KAAK,OAAOT,CAAM,EAAE,CAAC,KAAKY,IAAWJ,GACrC,KAAK,OAAOR,CAAM,EAAE,CAAC,KAAKY,IAAWH;AAAA,IACzC;AAAA,EACJ;AAAA,EACA,+BAA+B;AAC3B,UAAM,EAAE,OAAAlC,GAAO,SAAAE,EAAO,IAAK,MACrB,EAAE,IAAAoC,GAAI,QAAAC,GAAQ,OAAAjB,GAAO,IAAAnB,EAAE,IAAKD,GAC5BG,IAAQL,EAAM,MAAK,GACnBwC,IAAInC,EAAM;AAEhB,QAAIoC,IAAO,OAAO,mBACdC,IAAO,OAAO,mBACdC,IAAO,OAAO,mBACdC,IAAO,OAAO;AAClB,aAAS,IAAI,GAAG,IAAIJ,GAAG,KAAK,GAAG;AAC3B,YAAMjC,IAAOF,EAAM,CAAC,GACd,EAAE,IAAAK,GAAI,GAAAmC,GAAG,GAAAC,EAAC,IAAKvC;AACrB,UAAIe,KAAStB,EAAM,OAAOU,CAAE,KAAK;AAC7B;AACJ,YAAMqC,IAAO,KAAK,OAAOrC,CAAE;AAC3B,MAAKqC,MAELA,EAAK,OAAOF,GAAGC,CAAC,GACZD,IAAIJ,MACJA,IAAOI,IACPA,IAAIH,MACJA,IAAOG,IACPC,IAAIH,MACJA,IAAOG,IACPA,IAAIF,MACJA,IAAOE;AAAA,IACf;AACA,QAAIE,IAAQ,KAAK,IAAIN,IAAOD,GAAMG,IAAOD,CAAI;AAC7C,KAAI,CAAC,SAASK,CAAK,KAAKA,KAAS,OAC7BA,IAAQ;AACZ,UAAMC,IAAa;AAAA,MACf,OAAOP,IAAOD,KAAQ;AAAA,MACtB,OAAOG,IAAOD,KAAQ;AAAA,MACtB,QAAQK;AAAA,MACR,YAAYT;AAAA,MACZ,MAAMC;AAAA,IAClB,GACcU,IAAO,IAAIC,EAAKF,CAAU,GAC1BG,IAAW,IAAIC,EAASH,CAAI;AAElC,aAAS,IAAI,GAAG,IAAIV,GAAG,KAAK,GAAG;AAC3B,YAAM,EAAE,IAAA9B,EAAE,IAAKL,EAAM,CAAC;AACtB,UAAIiB,KAAStB,EAAM,OAAOU,CAAE,KAAK;AAC7B;AACJ,YAAMqC,IAAO,KAAK,OAAOrC,CAAE;AAC3B,MAAIqC,KAAQA,EAAK,GAAGG,CAAI,KACpBE,EAAS,OAAOL,CAAI;AAAA,IAC5B;AAEA,aAAS,IAAI,GAAG,IAAIP,GAAG,KAAK,GAAG;AAC3B,YAAMjC,IAAOF,EAAM,CAAC,GACd,EAAE,IAAAK,GAAI,GAAAmC,GAAG,GAAAC,EAAC,IAAKvC,GACf+C,IAAStD,EAAM,OAAOU,CAAE;AAC9B,UAAIY,KAASgC,KAAU;AACnB;AACJ,YAAMP,IAAO,KAAK,OAAOrC,CAAE;AAC3B,UAAI,CAACqC;AACD;AACJ,MAAAA,EAAK,WAAU,GACfK,EAAS,YAAYL,CAAI,GACzB,KAAK,OAAOrC,CAAE,EAAE,CAAC,KAAKqC,EAAK,IAC3B,KAAK,OAAOrC,CAAE,EAAE,CAAC,KAAKqC,EAAK;AAE3B,YAAMQ,IAAKV,IAAIN,EAAO,CAAC,GACjBiB,IAAKV,IAAIP,EAAO,CAAC;AACvB,UAAIkB,IAAO,KAAK,MAAMF,GAAIC,CAAE;AAC5B,MAAAC,IAAOA,IAAO,OAAO,OAAOA;AAC5B,YAAMxB,IAAKsB,IAAKE,GACVvB,IAAKsB,IAAKC,GACVC,IAAKpB,KAAMgB,IAAS;AAC1B,WAAK,OAAO5C,CAAE,EAAE,CAAC,KAAKgD,IAAKzB,GAC3B,KAAK,OAAOvB,CAAE,EAAE,CAAC,KAAKgD,IAAKxB;AAAA,IAC/B;AAAA,EACJ;AAAA,EACA,0BAA0BhB,GAAMC,GAAS;AACrC,UAAM,EAAE,OAAAnB,GAAO,SAAAE,EAAO,IAAK,MACrB,EAAE,gBAAAe,GAAgB,IAAAd,GAAI,IAAAmC,GAAI,QAAAC,GAAQ,OAAAjB,EAAK,IAAKpB,GAC5CG,IAAQL,EAAM,MAAK,GACnBwC,IAAInC,EAAM;AAChB,aAASC,IAAI,GAAGA,IAAIkC,GAAGlC,KAAK,GAAG;AAC3B,YAAMqD,IAAQtD,EAAMC,CAAC,GACfsD,IAAU5D,EAAM,OAAO2D,EAAM,EAAE;AACrC,eAASE,IAAIvD,IAAI,GAAGuD,IAAIrB,GAAGqB,KAAK,GAAG;AAC/B,cAAMC,IAAQzD,EAAMwD,CAAC,GACfE,IAAU/D,EAAM,OAAO8D,EAAM,EAAE;AACrC,YAAIxC,MAAUsC,KAAW,KAAKG,KAAW;AACrC;AACJ,cAAMR,IAAKO,EAAM,IAAIH,EAAM,GACrBH,IAAKM,EAAM,IAAIH,EAAM;AAC3B,YAAIF,IAAO,KAAK,MAAMF,GAAIC,CAAE;AAC5B,QAAAC,IAAOA,IAAO,OAAO,OAAOA;AAC5B,cAAMxB,IAAKsB,IAAKE,GACVvB,IAAKsB,IAAKC;AAChB,YAAIO,IAAUP,GACVQ;AAEJ,YAAIhD,GAAgB;AAChB,gBAAMiD,IAAUT,IAAO,KAAK,MAAME,EAAM,EAAE,IAAI,KAAK,MAAMG,EAAM,EAAE;AACjE,UAAII,IAAU,IAEVD,IAAK9C,KAAWyC,IAAU,MAAMG,IAAU,KAErCG,MAAY,IAEjBD,IAAK,KAILD,IAAUE,GACVD,IAAM9D,KAAMyD,IAAU,MAAMG,IAAU,KAAMC;AAAA,QAEpD;AAEI,UAAAC,IAAM9D,KAAMyD,IAAU,MAAMG,IAAU,KAAMC;AAEhD,aAAK,OAAOL,EAAM,EAAE,EAAE,CAAC,KAAKM,IAAKhC,GACjC,KAAK,OAAO0B,EAAM,EAAE,EAAE,CAAC,KAAKM,IAAK/B,GACjC,KAAK,OAAO4B,EAAM,EAAE,EAAE,CAAC,KAAKG,IAAKhC,GACjC,KAAK,OAAO6B,EAAM,EAAE,EAAE,CAAC,KAAKG,IAAK/B;AAAA,MACrC;AAEA,YAAMiC,IAAKR,EAAM,IAAIpB,EAAO,CAAC,GACvB6B,IAAKT,EAAM,IAAIpB,EAAO,CAAC;AAC7B,UAAI8B,IAAQ,KAAK,MAAMF,GAAIC,CAAE;AAC7B,MAAAC,IAAQA,IAAQ,OAAO,OAAOA;AAC9B,YAAMC,IAAMH,IAAKE,GACXE,IAAMH,IAAKC,GACXX,IAAKpB,KAAMsB,IAAU;AAC3B,WAAK,OAAOD,EAAM,EAAE,EAAE,CAAC,KAAKD,IAAKY,GACjC,KAAK,OAAOX,EAAM,EAAE,EAAE,CAAC,KAAKD,IAAKa;AAAA,IACrC;AAAA,EACJ;AAAA,EACA,kBAAkB;AACd,UAAM,EAAE,OAAAvE,GAAO,SAAAE,EAAO,IAAK,MACrB,EAAE,IAAAsE,GAAI,KAAAC,GAAK,OAAAnD,GAAO,OAAAoD,GAAO,uBAAAC,IAAwB,MAAK,IAAKzE,GAC3DG,IAAQL,EAAM,MAAK,GACnBwC,IAAInC,EAAM,QACVuE,IAAQ,CAAA,GACRC,IAAQ,CAAA;AACd,QAAIC,IAAO,GACPC,IAAO;AAEX,aAASzE,IAAI,GAAGA,IAAIkC,GAAGlC,KAAK,GAAG;AAC3B,YAAM,EAAE,IAAAI,EAAE,IAAKL,EAAMC,CAAC,GAChBgD,IAAStD,EAAM,OAAOU,CAAE;AAC9B,UAAIY,KAASgC,KAAU;AACnB;AACJ,YAAM0B,IAAO,KAAK,UAAUtE,CAAE,KAAK,CAAC,GAAG,CAAC,GAClCuE,IAAM,KAAK,OAAOvE,CAAE,KAAK,CAAC,GAAG,CAAC,GAC9BwE,IAASD,EAAI,CAAC,IAAID,EAAK,CAAC,GACxBG,IAASF,EAAI,CAAC,IAAID,EAAK,CAAC,GACxBI,IAAY,KAAK,MAAMF,GAAQC,CAAM,GACrCE,IAAOJ,EAAI,CAAC,IAAID,EAAK,CAAC,GACtBM,IAAOL,EAAI,CAAC,IAAID,EAAK,CAAC,GACtBO,IAAU,KAAK,MAAMF,GAAMC,CAAI;AACrC,MAAAV,EAAMlE,CAAE,IAAI0E,GACZP,EAAMnE,CAAE,IAAI6E,IAAU,GACtBT,MAASxB,IAAS,KAAKsB,EAAMlE,CAAE,GAC/BqE,MAASzB,IAAS,KAAKuB,EAAMnE,CAAE;AAAA,IACnC;AAEA,QAAI8E,IAAU,KAAK;AACnB,UAAMC,IAAQ,KAAK;AACnB,IAAIX,KAAQ,IACRU,IAAUC,IAAQ,IAAIA,IAAQ,KAG9BD,IAAWf,IAAMM,IAAQD,GACrBW,MAAU,MACVD,IAAUA,IAAU,MAAMC,IAAQ,MAAMA,IAAQD,KAGxD,KAAK,KAAKA;AAEV,QAAIE,IAAc,GACdC,IAAc,OACdC,IAAc,GACdC,IAAa;AAEjB,aAASvF,IAAI,GAAGA,IAAIkC,GAAGlC,KAAK,GAAG;AAC3B,YAAMC,IAAOF,EAAMC,CAAC,GACdI,IAAKH,EAAK,IACV+C,IAAStD,EAAM,OAAOU,CAAE;AAG9B,UAFIY,KAASgC,KAAU,KAEnB,KAAK,YAAY/C,CAAI;AACrB;AACJ,YAAMuF,IAASlB,EAAMlE,CAAE,KAAK;AAC5B,UAAIqF,IAAMvB,IAAKgB,KAAY,IAAIA,IAAU,KAAK,KAAKM,CAAM,IACrDE,IAAW,KAAK,MAAM,KAAK,OAAOtF,CAAE,EAAE,CAAC,GAAG,KAAK,OAAOA,CAAE,EAAE,CAAC,CAAC;AAChE,MAAAsF,IAAWA,IAAW,OAAO,OAAOA;AACpC,YAAMC,IAAUvB,IAAQsB;AACxB,MAAID,IAAKE,MACLF,IAAKE;AACT,YAAM1C,IAAKwC,IAAK,KAAK,OAAOrF,CAAE,EAAE,CAAC,GAC3B8C,IAAKuC,IAAK,KAAK,OAAOrF,CAAE,EAAE,CAAC;AACjC,MAAAH,EAAK,KAAKgD,GACVhD,EAAK,KAAKiD;AAEV,YAAMC,IAAO,KAAK,MAAMF,GAAIC,CAAE;AAC9B,MAAIC,IAAO,MACPoC,KACAD,KAAenC,GACXA,IAAOiC,MACPA,IAAcjC,IACdA,IAAOkC,MACPA,IAAclC;AAAA,IAE1B;AAEA,YAAQkB,GAAqB;AAAA,MACzB,KAAK;AACD,eAAOgB;AAAA,MACX,KAAK;AACD,eAAOE,IAAa,IAAID,IAAcC,IAAa;AAAA,MACvD,KAAK;AAAA,MACL;AACI,eAAOH;AAAA,IACvB;AAAA,EACI;AAAA,EACA,UAAU;AACN,SAAK,KAAI,GACT,KAAK,SAAS,CAAA,GACd,KAAK,YAAY,CAAA,GACjB,KAAK,SAAS,CAAA,GACd,KAAK,QAAQ,CAAA,GACb,KAAK,IAAG;AAAA,EACZ;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,78 @@
+import { __awaiter as l } from "../../node_modules/tslib/tslib.es6.js";
+import { initNodePosition as u } from "../../model/data.js";
+import { applySingleNodeLayout as m } from "../../util/common.js";
+import { formatFn as d } from "../../util/format.js";
+import { normalizeViewport as h } from "../../util/viewport.js";
+import { BaseLayoutWithIterations as c } from "../base-layout.js";
+import { Simulation as p } from "./simulation.js";
+const v = {
+  maxIteration: 1e3,
+  gravity: 10,
+  speed: 5,
+  clustering: !1,
+  clusterGravity: 10,
+  width: 300,
+  height: 300,
+  nodeClusterBy: "node.cluster",
+  dimensions: 2
+};
+class F extends c {
+  constructor() {
+    super(...arguments), this.id = "fruchterman", this.simulation = null;
+  }
+  getDefaultOptions() {
+    return v;
+  }
+  parseOptions(t = {}) {
+    const { clustering: i, nodeClusterBy: o } = this.options, n = i && !!o;
+    return Object.assign(t, h(t), {
+      clustering: n,
+      nodeClusterBy: d(o, ["node"])
+    }), t;
+  }
+  layout() {
+    return l(this, void 0, void 0, function* () {
+      const t = this.parseOptions(this.options), { dimensions: i, center: o, width: n, height: r } = t, e = this.model.nodeCount();
+      if (!e || e === 1) {
+        m(this.model, o, i);
+        return;
+      }
+      u(this.model, n, r, i);
+      const s = this.setSimulation();
+      return s.data(this.model), s.initialize(t), s.restart(), new Promise((a) => {
+        s.on("end", () => a());
+      });
+    });
+  }
+  setSimulation() {
+    const t = this.simulation || new p();
+    return this.simulation || (this.simulation = t.on("tick", () => {
+      var i, o;
+      return (o = (i = this.options).onTick) === null || o === void 0 ? void 0 : o.call(i, this);
+    })), this.simulation;
+  }
+  restart() {
+    var t;
+    (t = this.simulation) === null || t === void 0 || t.restart();
+  }
+  stop() {
+    var t;
+    (t = this.simulation) === null || t === void 0 || t.stop();
+  }
+  tick(t = 1) {
+    var i;
+    (i = this.simulation) === null || i === void 0 || i.tick(t);
+  }
+  setFixedPosition(t, i) {
+    var o;
+    (o = this.simulation) === null || o === void 0 || o.setFixedPosition(t, i);
+  }
+  destroy() {
+    var t;
+    super.destroy(), this.stop(), (t = this.simulation) === null || t === void 0 || t.destroy(), this.simulation = null;
+  }
+}
+export {
+  F as FruchtermanLayout
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../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":["DEFAULTS_LAYOUT_OPTIONS$3","FruchtermanLayout","BaseLayoutWithIterations","options","clustering","nodeClusterBy","clusteringEnabled","normalizeViewport","formatFn","__awaiter","dimensions","center","width","height","n","applySingleNodeLayout","initNodePosition","simulation","resolve","Simulation","_a","_b","iterations","id","position"],"mappings":";;;;;;;AASA,MAAMA,IAA4B;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,MAAMC,UAA0BC,EAAyB;AAAA,EACrD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK,eACV,KAAK,aAAa;AAAA,EACtB;AAAA,EACA,oBAAoB;AAChB,WAAOF;AAAA,EACX;AAAA,EACA,aAAaG,IAAU,IAAI;AACvB,UAAM,EAAE,YAAAC,GAAY,eAAAC,EAAa,IAAK,KAAK,SACrCC,IAAoBF,KAAc,CAAC,CAACC;AAC1C,kBAAO,OAAOF,GAASI,EAAkBJ,CAAO,GAAG;AAAA,MAC/C,YAAYG;AAAA,MACZ,eAAeE,EAASH,GAAe,CAAC,MAAM,CAAC;AAAA,IAC3D,CAAS,GACMF;AAAA,EACX;AAAA,EACA,SAAS;AACL,WAAOM,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAMN,IAAU,KAAK,aAAa,KAAK,OAAO,GACxC,EAAE,YAAAO,GAAY,QAAAC,GAAQ,OAAAC,GAAO,QAAAC,EAAM,IAAKV,GACxCW,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAI,CAACA,KAAKA,MAAM,GAAG;AACf,QAAAC,EAAsB,KAAK,OAAOJ,GAAQD,CAAU;AACpD;AAAA,MACJ;AACA,MAAAM,EAAiB,KAAK,OAAOJ,GAAOC,GAAQH,CAAU;AACtD,YAAMO,IAAa,KAAK,cAAa;AACrC,aAAAA,EAAW,KAAK,KAAK,KAAK,GAC1BA,EAAW,WAAWd,CAAO,GAC7Bc,EAAW,QAAO,GACX,IAAI,QAAQ,CAACC,MAAY;AAC5B,QAAAD,EAAW,GAAG,OAAO,MAAMC,EAAO,CAAE;AAAA,MACxC,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,gBAAgB;AACZ,UAAMD,IAAa,KAAK,cAAc,IAAIE,EAAU;AACpD,WAAK,KAAK,eACN,KAAK,aAAaF,EAAW,GAAG,QAAQ,MAAM;AAAE,UAAIG,GAAIC;AAAI,cAAQA,KAAMD,IAAK,KAAK,SAAS,YAAY,QAAQC,MAAO,SAAS,SAASA,EAAG,KAAKD,GAAI,IAAI;AAAA,IAAG,CAAC,IAE3J,KAAK;AAAA,EAChB;AAAA,EACA,UAAU;AACN,QAAIA;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,QAAO;AAAA,EAC1E;AAAA,EACA,OAAO;AACH,QAAIA;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,KAAI;AAAA,EACvE;AAAA,EACA,KAAKE,IAAa,GAAG;AACjB,QAAIF;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,KAAKE,CAAU;AAAA,EAClF;AAAA,EACA,iBAAiBC,GAAIC,GAAU;AAC3B,QAAIJ;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,iBAAiBG,GAAIC,CAAQ;AAAA,EAChG;AAAA,EACA,UAAU;AACN,QAAIJ;AACJ,UAAM,QAAO,GACb,KAAK,KAAI,IACRA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,QAAO,GACtE,KAAK,aAAa;AAAA,EACtB;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/fruchterman/simulation.js

@@ -0,0 +1,171 @@
+import { normalizeViewport as M } from "../../util/viewport.js";
+import { BaseSimulation as N } from "../base-simulation.js";
+import v from "../../node_modules/@antv/util/esm/lodash/is-nil.js";
+const E = 800;
+class S extends N {
+  constructor() {
+    super(...arguments), this.displacements = null, this.clusterMap = null;
+  }
+  data(s) {
+    return this.model = s, this;
+  }
+  initialize(s) {
+    super.initialize(s), this.recomputeConstants(), this.displacements = null, this.clusterMap = null, this.initDisplacements();
+  }
+  recomputeConstants() {
+    const { model: s, options: h } = this, { width: n, height: i } = M(h), o = n * i;
+    this.k2 = o / (s.nodeCount() + 1), this.k = Math.sqrt(this.k2), this.maxDisplace = Math.sqrt(o) / 10;
+  }
+  runOneStep() {
+    return this.syncFixedPositions(), this.initDisplacements(), this.calculateRepulsive(), this.calculateAttractive(), this.applyClusterGravity(), this.applyGlobalGravity(), this.updatePositions();
+  }
+  /**
+   * Fixes the position of the node with the given id to the specified position.
+   */
+  setFixedPosition(s, h) {
+    const n = this.model.node(s);
+    if (!n)
+      return;
+    const i = ["fx", "fy", "fz"];
+    if (h === null) {
+      i.forEach((o) => {
+        delete n[o];
+      });
+      return;
+    }
+    h.forEach((o, d) => {
+      d < i.length && (typeof o == "number" || o === null) && (n[i[d]] = o);
+    });
+  }
+  /**
+   * Determines whether a node is fixed (has fx and fy defined).
+   */
+  isNodeFixed(s) {
+    return !v(s.fx) && !v(s.fy);
+  }
+  /**
+   * Synchronizes fixed node positions (fx/fy -> x/y)
+   */
+  syncFixedPositions() {
+    const { model: s, options: h } = this, n = h.dimensions === 3;
+    s.forEachNode((i) => {
+      this.isNodeFixed(i) && (i.x = i.fx, i.y = i.fy, n && i.fz !== void 0 && (i.z = i.fz));
+    });
+  }
+  initDisplacements() {
+    this.displacements || (this.displacements = /* @__PURE__ */ new Map(), this.model.forEachNode((s) => {
+      this.displacements.set(s.id, { x: 0, y: 0, z: 0 });
+    })), this.displacements.forEach((s) => {
+      s.x = 0, s.y = 0, s.z = 0;
+    });
+  }
+  /**
+   * Calculates repulsive forces
+   */
+  calculateRepulsive() {
+    const { model: s, options: h } = this, n = h.dimensions === 3, i = s.nodes();
+    for (let o = 0; o < i.length; o++) {
+      const d = i[o], r = this.displacements.get(d.id), t = this.isNodeFixed(d);
+      for (let c = o + 1; c < i.length; c++) {
+        const e = i[c], a = this.displacements.get(e.id), m = this.isNodeFixed(e);
+        let l = d.x - e.x, u = d.y - e.y, p = n ? d.z - e.z : 0, f = l * l + u * u + p * p;
+        f === 0 && (f = 1, l = 0.01, u = 0.01, p = 0.01);
+        const x = this.k2 / f, y = l * x, z = u * x, g = p * x;
+        !t && !m ? (r.x += y, r.y += z, a.x -= y, a.y -= z, n && (r.z += g, a.z -= g)) : t && !m ? (a.x -= y * 2, a.y -= z * 2, n && (a.z -= g * 2)) : !t && m && (r.x += y * 2, r.y += z * 2, n && (r.z += g * 2));
+      }
+    }
+  }
+  calculateAttractive() {
+    const { model: s, options: h } = this, n = h.dimensions === 3;
+    s.forEachEdge((i) => {
+      const { source: o, target: d } = i;
+      if (!o || !d || o === d)
+        return;
+      const r = s.node(o), t = s.node(d), c = this.displacements.get(o), e = this.displacements.get(d), a = this.isNodeFixed(r), m = this.isNodeFixed(t), l = t.x - r.x, u = t.y - r.y, p = n ? t.z - r.z : 0, f = Math.sqrt(l * l + u * u + p * p);
+      if (f === 0)
+        return;
+      const x = f / this.k, y = l * x, z = u * x, g = p * x;
+      !a && !m ? (c.x += y, c.y += z, e.x -= y, e.y -= z, n && (c.z += g, e.z -= g)) : a && !m ? (e.x -= y * 2, e.y -= z * 2, n && (e.z -= g * 2)) : !a && m && (c.x += y * 2, c.y += z * 2, n && (c.z += g * 2));
+    });
+  }
+  applyClusterGravity() {
+    const { model: s, options: h } = this, { nodeClusterBy: n, clusterGravity: i, dimensions: o, clustering: d } = h;
+    if (!d || (this.clusterMap || (this.clusterMap = /* @__PURE__ */ new Map(), s.forEachNode((t) => {
+      const c = n(s.originalNode(t.id));
+      this.clusterMap.has(c) || this.clusterMap.set(c, {
+        name: c,
+        cx: 0,
+        cy: 0,
+        cz: 0,
+        count: 0
+      });
+    })), this.clusterMap.size === 0))
+      return;
+    const r = o === 3;
+    this.clusterMap.forEach((t) => {
+      t.cx = 0, t.cy = 0, t.cz = 0, t.count = 0;
+    }), s.forEachNode((t) => {
+      const c = n(s.originalNode(t.id)), e = this.clusterMap.get(c);
+      e && (e.cx += t.x, e.cy += t.y, r && (e.cz += t.z), e.count++);
+    }), this.clusterMap.forEach((t) => {
+      t.count > 0 && (t.cx /= t.count, t.cy /= t.count, t.cz /= t.count);
+    }), s.forEachNode((t) => {
+      const { id: c } = t;
+      if (this.isNodeFixed(t))
+        return;
+      const e = n(s.originalNode(c)), a = this.clusterMap.get(e);
+      if (!a)
+        return;
+      const m = this.displacements.get(c), l = t.x - a.cx, u = t.y - a.cy, p = r ? t.z - a.cz : 0, f = Math.sqrt(l * l + u * u + p * p);
+      if (f === 0)
+        return;
+      const x = this.k * i;
+      m.x -= x * l / f, m.y -= x * u / f, r && (m.z -= x * p / f);
+    });
+  }
+  applyGlobalGravity() {
+    const { model: s, options: h } = this, { gravity: n, center: i, dimensions: o } = h, d = o === 3, r = 0.01 * this.k * n;
+    s.forEachNode((t) => {
+      const { id: c } = t;
+      if (this.isNodeFixed(t))
+        return;
+      const e = this.displacements.get(c);
+      e.x -= r * (t.x - i[0]), e.y -= r * (t.y - i[1]), d && (e.z -= r * (t.z - (i[2] || 0)));
+    });
+  }
+  /**
+   * Updates node positions based on calculated displacements
+   */
+  updatePositions() {
+    const { model: s, options: h } = this, { speed: n, dimensions: i, distanceThresholdMode: o = "max" } = h, d = i === 3;
+    let r = 0, t = 1 / 0, c = 0, e = 0;
+    if (s.forEachNode((a) => {
+      const { id: m } = a;
+      if (this.isNodeFixed(a))
+        return;
+      const l = this.displacements.get(m), u = Math.sqrt(l.x * l.x + l.y * l.y + (d ? l.z * l.z : 0));
+      if (u === 0)
+        return;
+      const p = Math.min(this.maxDisplace * (n / E), u), f = p / u;
+      a.x += l.x * f, a.y += l.y * f, d && (a.z = a.z + l.z * f), r = Math.max(r, p), t = Math.min(t, p), c += p, e++;
+    }), e === 0)
+      return 0;
+    switch (o) {
+      case "min":
+        return t === 1 / 0 ? 0 : t;
+      case "mean":
+        return c / e;
+      case "max":
+      default:
+        return r;
+    }
+  }
+  destroy() {
+    var s, h;
+    this.stop(), (s = this.displacements) === null || s === void 0 || s.clear(), (h = this.clusterMap) === null || h === void 0 || h.clear();
+  }
+}
+export {
+  S as Simulation
+};
+//# sourceMappingURL=simulation.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/fruchterman/simulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simulation.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/fruchterman/simulation.js"],"sourcesContent":["import '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseSimulation } from '../base-simulation.js';\nimport isNil from '../../node_modules/@antv/util/esm/lodash/is-nil.js';\n\nconst SPEED_DIVISOR$1 = 800;\n/**\n * Fruchterman Simulation\n */\nclass Simulation extends BaseSimulation {\n    constructor() {\n        super(...arguments);\n        this.displacements = null;\n        this.clusterMap = null;\n    }\n    data(model) {\n        this.model = model;\n        return this;\n    }\n    initialize(options) {\n        super.initialize(options);\n        this.recomputeConstants();\n        this.displacements = null;\n        this.clusterMap = null;\n        this.initDisplacements();\n    }\n    recomputeConstants() {\n        const { model, options } = this;\n        const { width, height } = normalizeViewport(options);\n        const area = width * height;\n        this.k2 = area / (model.nodeCount() + 1);\n        this.k = Math.sqrt(this.k2);\n        this.maxDisplace = Math.sqrt(area) / 10;\n    }\n    runOneStep() {\n        this.syncFixedPositions();\n        this.initDisplacements();\n        this.calculateRepulsive();\n        this.calculateAttractive();\n        this.applyClusterGravity();\n        this.applyGlobalGravity();\n        return this.updatePositions();\n    }\n    /**\n     * Fixes the position of the node with the given id to the specified 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    /**\n     * Determines whether a node is fixed (has fx and fy defined).\n     */\n    isNodeFixed(node) {\n        return !isNil(node.fx) && !isNil(node.fy);\n    }\n    /**\n     * Synchronizes fixed node positions (fx/fy -> x/y)\n     */\n    syncFixedPositions() {\n        const { model, options } = this;\n        const is3D = options.dimensions === 3;\n        model.forEachNode((node) => {\n            if (this.isNodeFixed(node)) {\n                node.x = node.fx;\n                node.y = node.fy;\n                if (is3D && node.fz !== undefined) {\n                    node.z = node.fz;\n                }\n            }\n        });\n    }\n    initDisplacements() {\n        if (!this.displacements) {\n            this.displacements = new Map();\n            this.model.forEachNode((node) => {\n                this.displacements.set(node.id, { x: 0, y: 0, z: 0 });\n            });\n        }\n        this.displacements.forEach((displacement) => {\n            displacement.x = 0;\n            displacement.y = 0;\n            displacement.z = 0;\n        });\n    }\n    /**\n     * Calculates repulsive forces\n     */\n    calculateRepulsive() {\n        const { model, options } = this;\n        const is3D = options.dimensions === 3;\n        const nodes = model.nodes();\n        for (let i = 0; i < nodes.length; i++) {\n            const nodeV = nodes[i];\n            const dispV = this.displacements.get(nodeV.id);\n            const vFixed = this.isNodeFixed(nodeV);\n            for (let j = i + 1; j < nodes.length; j++) {\n                const nodeU = nodes[j];\n                const dispU = this.displacements.get(nodeU.id);\n                const uFixed = this.isNodeFixed(nodeU);\n                let vecX = nodeV.x - nodeU.x;\n                let vecY = nodeV.y - nodeU.y;\n                let vecZ = is3D ? nodeV.z - nodeU.z : 0;\n                let lengthSqr = vecX * vecX + vecY * vecY + vecZ * vecZ;\n                if (lengthSqr === 0) {\n                    lengthSqr = 1;\n                    vecX = 0.01;\n                    vecY = 0.01;\n                    vecZ = 0.01;\n                }\n                const common = this.k2 / lengthSqr;\n                const dispX = vecX * common;\n                const dispY = vecY * common;\n                const dispZ = vecZ * common;\n                if (!vFixed && !uFixed) {\n                    // 两个都不固定：正常分配\n                    dispV.x += dispX;\n                    dispV.y += dispY;\n                    dispU.x -= dispX;\n                    dispU.y -= dispY;\n                    if (is3D) {\n                        dispV.z += dispZ;\n                        dispU.z -= dispZ;\n                    }\n                }\n                else if (vFixed && !uFixed) {\n                    // V 固定，U 不固定：U 承受双倍位移\n                    dispU.x -= dispX * 2;\n                    dispU.y -= dispY * 2;\n                    if (is3D) {\n                        dispU.z -= dispZ * 2;\n                    }\n                }\n                else if (!vFixed && uFixed) {\n                    // U 固定，V 不固定：V 承受双倍位移\n                    dispV.x += dispX * 2;\n                    dispV.y += dispY * 2;\n                    if (is3D) {\n                        dispV.z += dispZ * 2;\n                    }\n                }\n                // 如果两个都固定，则都不移动（不添加位移）\n            }\n        }\n    }\n    calculateAttractive() {\n        const { model, options } = this;\n        const is3D = options.dimensions === 3;\n        model.forEachEdge((edge) => {\n            const { source, target } = edge;\n            if (!source || !target || source === target) {\n                return;\n            }\n            const u = model.node(source);\n            const v = model.node(target);\n            const dispSource = this.displacements.get(source);\n            const dispTarget = this.displacements.get(target);\n            const fixedU = this.isNodeFixed(u);\n            const fixedV = this.isNodeFixed(v);\n            const vecX = v.x - u.x;\n            const vecY = v.y - u.y;\n            const vecZ = is3D ? v.z - u.z : 0;\n            const length = Math.sqrt(vecX * vecX + vecY * vecY + vecZ * vecZ);\n            if (length === 0)\n                return;\n            const common = length / this.k;\n            const dispX = vecX * common;\n            const dispY = vecY * common;\n            const dispZ = vecZ * common;\n            if (!fixedU && !fixedV) {\n                // 两个都不固定：正常分配\n                dispSource.x += dispX;\n                dispSource.y += dispY;\n                dispTarget.x -= dispX;\n                dispTarget.y -= dispY;\n                if (is3D) {\n                    dispSource.z += dispZ;\n                    dispTarget.z -= dispZ;\n                }\n            }\n            else if (fixedU && !fixedV) {\n                // V 固定，U 不固定：U 承受双倍位移\n                dispTarget.x -= dispX * 2;\n                dispTarget.y -= dispY * 2;\n                if (is3D) {\n                    dispTarget.z -= dispZ * 2;\n                }\n            }\n            else if (!fixedU && fixedV) {\n                // U 固定，V 不固定：V 承受双倍位移\n                dispSource.x += dispX * 2;\n                dispSource.y += dispY * 2;\n                if (is3D) {\n                    dispSource.z += dispZ * 2;\n                }\n            }\n            // 如果两个都固定，则都不移动（不添加位移）\n        });\n    }\n    applyClusterGravity() {\n        const { model, options } = this;\n        const { nodeClusterBy, clusterGravity, dimensions, clustering } = options;\n        if (!clustering)\n            return;\n        if (!this.clusterMap) {\n            this.clusterMap = new Map();\n            model.forEachNode((node) => {\n                const clusterKey = nodeClusterBy(model.originalNode(node.id));\n                if (!this.clusterMap.has(clusterKey)) {\n                    this.clusterMap.set(clusterKey, {\n                        name: clusterKey,\n                        cx: 0,\n                        cy: 0,\n                        cz: 0,\n                        count: 0,\n                    });\n                }\n            });\n        }\n        if (this.clusterMap.size === 0)\n            return;\n        const is3D = dimensions === 3;\n        this.clusterMap.forEach((cluster) => {\n            cluster.cx = 0;\n            cluster.cy = 0;\n            cluster.cz = 0;\n            cluster.count = 0;\n        });\n        model.forEachNode((node) => {\n            const clusterKey = nodeClusterBy(model.originalNode(node.id));\n            const cluster = this.clusterMap.get(clusterKey);\n            if (!cluster)\n                return;\n            cluster.cx += node.x;\n            cluster.cy += node.y;\n            if (is3D)\n                cluster.cz += node.z;\n            cluster.count++;\n        });\n        this.clusterMap.forEach((cluster) => {\n            if (cluster.count > 0) {\n                cluster.cx /= cluster.count;\n                cluster.cy /= cluster.count;\n                cluster.cz /= cluster.count;\n            }\n        });\n        model.forEachNode((node) => {\n            const { id } = node;\n            // 固定节点不应用聚类重力\n            if (this.isNodeFixed(node))\n                return;\n            const clusterKey = nodeClusterBy(model.originalNode(id));\n            const cluster = this.clusterMap.get(clusterKey);\n            if (!cluster)\n                return;\n            const disp = this.displacements.get(id);\n            const vecX = node.x - cluster.cx;\n            const vecY = node.y - cluster.cy;\n            const vecZ = is3D ? node.z - cluster.cz : 0;\n            const distLength = Math.sqrt(vecX * vecX + vecY * vecY + vecZ * vecZ);\n            if (distLength === 0)\n                return;\n            const gravityForce = this.k * clusterGravity;\n            disp.x -= (gravityForce * vecX) / distLength;\n            disp.y -= (gravityForce * vecY) / distLength;\n            if (is3D) {\n                disp.z -= (gravityForce * vecZ) / distLength;\n            }\n        });\n    }\n    applyGlobalGravity() {\n        const { model, options } = this;\n        const { gravity, center, dimensions } = options;\n        const is3D = dimensions === 3;\n        const gravityForce = 0.01 * this.k * gravity;\n        model.forEachNode((node) => {\n            const { id } = node;\n            // 固定节点不应用全局重力\n            if (this.isNodeFixed(node))\n                return;\n            const disp = this.displacements.get(id);\n            disp.x -= gravityForce * (node.x - center[0]);\n            disp.y -= gravityForce * (node.y - center[1]);\n            if (is3D) {\n                disp.z -= gravityForce * (node.z - (center[2] || 0));\n            }\n        });\n    }\n    /**\n     * Updates node positions based on calculated displacements\n     */\n    updatePositions() {\n        const { model, options } = this;\n        const { speed, dimensions, distanceThresholdMode = 'max' } = options;\n        const is3D = dimensions === 3;\n        let max = 0;\n        let min = Infinity;\n        let sum = 0;\n        let count = 0;\n        model.forEachNode((node) => {\n            const { id } = node;\n            if (this.isNodeFixed(node))\n                return;\n            const disp = this.displacements.get(id);\n            const distLength = Math.sqrt(disp.x * disp.x + disp.y * disp.y + (is3D ? disp.z * disp.z : 0));\n            if (distLength === 0)\n                return;\n            const limitedDist = Math.min(this.maxDisplace * (speed / SPEED_DIVISOR$1), distLength);\n            const ratio = limitedDist / distLength;\n            node.x += disp.x * ratio;\n            node.y += disp.y * ratio;\n            if (is3D) {\n                node.z = node.z + disp.z * ratio;\n            }\n            // ---- distance statistics ----\n            max = Math.max(max, limitedDist);\n            min = Math.min(min, limitedDist);\n            sum += limitedDist;\n            count++;\n        });\n        if (count === 0)\n            return 0;\n        switch (distanceThresholdMode) {\n            case 'min':\n                return min === Infinity ? 0 : min;\n            case 'mean':\n                return sum / count;\n            case 'max':\n            default:\n                return max;\n        }\n    }\n    destroy() {\n        var _a, _b;\n        this.stop();\n        (_a = this.displacements) === null || _a === void 0 ? void 0 : _a.clear();\n        (_b = this.clusterMap) === null || _b === void 0 ? void 0 : _b.clear();\n    }\n}\n\nexport { Simulation };\n//# sourceMappingURL=simulation.js.map\n"],"names":["SPEED_DIVISOR$1","Simulation","BaseSimulation","model","options","width","height","normalizeViewport","area","id","position","node","keys","key","value","index","isNil","is3D","displacement","nodes","i","nodeV","dispV","vFixed","j","nodeU","dispU","uFixed","vecX","vecY","vecZ","lengthSqr","common","dispX","dispY","dispZ","edge","source","target","u","v","dispSource","dispTarget","fixedU","fixedV","length","nodeClusterBy","clusterGravity","dimensions","clustering","clusterKey","cluster","disp","distLength","gravityForce","gravity","center","speed","distanceThresholdMode","max","min","sum","count","limitedDist","ratio","_a","_b"],"mappings":";;;AAKA,MAAMA,IAAkB;AAIxB,MAAMC,UAAmBC,EAAe;AAAA,EACpC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,gBAAgB,MACrB,KAAK,aAAa;AAAA,EACtB;AAAA,EACA,KAAKC,GAAO;AACR,gBAAK,QAAQA,GACN;AAAA,EACX;AAAA,EACA,WAAWC,GAAS;AAChB,UAAM,WAAWA,CAAO,GACxB,KAAK,mBAAkB,GACvB,KAAK,gBAAgB,MACrB,KAAK,aAAa,MAClB,KAAK,kBAAiB;AAAA,EAC1B;AAAA,EACA,qBAAqB;AACjB,UAAM,EAAE,OAAAD,GAAO,SAAAC,EAAO,IAAK,MACrB,EAAE,OAAAC,GAAO,QAAAC,MAAWC,EAAkBH,CAAO,GAC7CI,IAAOH,IAAQC;AACrB,SAAK,KAAKE,KAAQL,EAAM,UAAS,IAAK,IACtC,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE,GAC1B,KAAK,cAAc,KAAK,KAAKK,CAAI,IAAI;AAAA,EACzC;AAAA,EACA,aAAa;AACT,gBAAK,mBAAkB,GACvB,KAAK,kBAAiB,GACtB,KAAK,mBAAkB,GACvB,KAAK,oBAAmB,GACxB,KAAK,oBAAmB,GACxB,KAAK,mBAAkB,GAChB,KAAK,gBAAe;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAIA,iBAAiBC,GAAIC,GAAU;AAC3B,UAAMC,IAAO,KAAK,MAAM,KAAKF,CAAE;AAC/B,QAAI,CAACE;AACD;AACJ,UAAMC,IAAO,CAAC,MAAM,MAAM,IAAI;AAC9B,QAAIF,MAAa,MAAM;AAEnB,MAAAE,EAAK,QAAQ,CAACC,MAAQ;AAClB,eAAOF,EAAKE,CAAG;AAAA,MACnB,CAAC;AACD;AAAA,IACJ;AACA,IAAAH,EAAS,QAAQ,CAACI,GAAOC,MAAU;AAC/B,MAAIA,IAAQH,EAAK,WACZ,OAAOE,KAAU,YAAYA,MAAU,UACxCH,EAAKC,EAAKG,CAAK,CAAC,IAAID;AAAA,IAE5B,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,YAAYH,GAAM;AACd,WAAO,CAACK,EAAML,EAAK,EAAE,KAAK,CAACK,EAAML,EAAK,EAAE;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAqB;AACjB,UAAM,EAAE,OAAAR,GAAO,SAAAC,EAAO,IAAK,MACrBa,IAAOb,EAAQ,eAAe;AACpC,IAAAD,EAAM,YAAY,CAACQ,MAAS;AACxB,MAAI,KAAK,YAAYA,CAAI,MACrBA,EAAK,IAAIA,EAAK,IACdA,EAAK,IAAIA,EAAK,IACVM,KAAQN,EAAK,OAAO,WACpBA,EAAK,IAAIA,EAAK;AAAA,IAG1B,CAAC;AAAA,EACL;AAAA,EACA,oBAAoB;AAChB,IAAK,KAAK,kBACN,KAAK,gBAAgB,oBAAI,IAAG,GAC5B,KAAK,MAAM,YAAY,CAACA,MAAS;AAC7B,WAAK,cAAc,IAAIA,EAAK,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC,CAAE;AAAA,IACxD,CAAC,IAEL,KAAK,cAAc,QAAQ,CAACO,MAAiB;AACzC,MAAAA,EAAa,IAAI,GACjBA,EAAa,IAAI,GACjBA,EAAa,IAAI;AAAA,IACrB,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,qBAAqB;AACjB,UAAM,EAAE,OAAAf,GAAO,SAAAC,EAAO,IAAK,MACrBa,IAAOb,EAAQ,eAAe,GAC9Be,IAAQhB,EAAM,MAAK;AACzB,aAASiB,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK;AACnC,YAAMC,IAAQF,EAAMC,CAAC,GACfE,IAAQ,KAAK,cAAc,IAAID,EAAM,EAAE,GACvCE,IAAS,KAAK,YAAYF,CAAK;AACrC,eAASG,IAAIJ,IAAI,GAAGI,IAAIL,EAAM,QAAQK,KAAK;AACvC,cAAMC,IAAQN,EAAMK,CAAC,GACfE,IAAQ,KAAK,cAAc,IAAID,EAAM,EAAE,GACvCE,IAAS,KAAK,YAAYF,CAAK;AACrC,YAAIG,IAAOP,EAAM,IAAII,EAAM,GACvBI,IAAOR,EAAM,IAAII,EAAM,GACvBK,IAAOb,IAAOI,EAAM,IAAII,EAAM,IAAI,GAClCM,IAAYH,IAAOA,IAAOC,IAAOA,IAAOC,IAAOA;AACnD,QAAIC,MAAc,MACdA,IAAY,GACZH,IAAO,MACPC,IAAO,MACPC,IAAO;AAEX,cAAME,IAAS,KAAK,KAAKD,GACnBE,IAAQL,IAAOI,GACfE,IAAQL,IAAOG,GACfG,IAAQL,IAAOE;AACrB,QAAI,CAACT,KAAU,CAACI,KAEZL,EAAM,KAAKW,GACXX,EAAM,KAAKY,GACXR,EAAM,KAAKO,GACXP,EAAM,KAAKQ,GACPjB,MACAK,EAAM,KAAKa,GACXT,EAAM,KAAKS,MAGVZ,KAAU,CAACI,KAEhBD,EAAM,KAAKO,IAAQ,GACnBP,EAAM,KAAKQ,IAAQ,GACfjB,MACAS,EAAM,KAAKS,IAAQ,MAGlB,CAACZ,KAAUI,MAEhBL,EAAM,KAAKW,IAAQ,GACnBX,EAAM,KAAKY,IAAQ,GACfjB,MACAK,EAAM,KAAKa,IAAQ;AAAA,MAI/B;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,sBAAsB;AAClB,UAAM,EAAE,OAAAhC,GAAO,SAAAC,EAAO,IAAK,MACrBa,IAAOb,EAAQ,eAAe;AACpC,IAAAD,EAAM,YAAY,CAACiC,MAAS;AACxB,YAAM,EAAE,QAAAC,GAAQ,QAAAC,EAAM,IAAKF;AAC3B,UAAI,CAACC,KAAU,CAACC,KAAUD,MAAWC;AACjC;AAEJ,YAAMC,IAAIpC,EAAM,KAAKkC,CAAM,GACrBG,IAAIrC,EAAM,KAAKmC,CAAM,GACrBG,IAAa,KAAK,cAAc,IAAIJ,CAAM,GAC1CK,IAAa,KAAK,cAAc,IAAIJ,CAAM,GAC1CK,IAAS,KAAK,YAAYJ,CAAC,GAC3BK,IAAS,KAAK,YAAYJ,CAAC,GAC3BZ,IAAOY,EAAE,IAAID,EAAE,GACfV,IAAOW,EAAE,IAAID,EAAE,GACfT,IAAOb,IAAOuB,EAAE,IAAID,EAAE,IAAI,GAC1BM,IAAS,KAAK,KAAKjB,IAAOA,IAAOC,IAAOA,IAAOC,IAAOA,CAAI;AAChE,UAAIe,MAAW;AACX;AACJ,YAAMb,IAASa,IAAS,KAAK,GACvBZ,IAAQL,IAAOI,GACfE,IAAQL,IAAOG,GACfG,IAAQL,IAAOE;AACrB,MAAI,CAACW,KAAU,CAACC,KAEZH,EAAW,KAAKR,GAChBQ,EAAW,KAAKP,GAChBQ,EAAW,KAAKT,GAChBS,EAAW,KAAKR,GACZjB,MACAwB,EAAW,KAAKN,GAChBO,EAAW,KAAKP,MAGfQ,KAAU,CAACC,KAEhBF,EAAW,KAAKT,IAAQ,GACxBS,EAAW,KAAKR,IAAQ,GACpBjB,MACAyB,EAAW,KAAKP,IAAQ,MAGvB,CAACQ,KAAUC,MAEhBH,EAAW,KAAKR,IAAQ,GACxBQ,EAAW,KAAKP,IAAQ,GACpBjB,MACAwB,EAAW,KAAKN,IAAQ;AAAA,IAIpC,CAAC;AAAA,EACL;AAAA,EACA,sBAAsB;AAClB,UAAM,EAAE,OAAAhC,GAAO,SAAAC,EAAO,IAAK,MACrB,EAAE,eAAA0C,GAAe,gBAAAC,GAAgB,YAAAC,GAAY,YAAAC,EAAU,IAAK7C;AAkBlE,QAjBI,CAAC6C,MAEA,KAAK,eACN,KAAK,aAAa,oBAAI,IAAG,GACzB9C,EAAM,YAAY,CAACQ,MAAS;AACxB,YAAMuC,IAAaJ,EAAc3C,EAAM,aAAaQ,EAAK,EAAE,CAAC;AAC5D,MAAK,KAAK,WAAW,IAAIuC,CAAU,KAC/B,KAAK,WAAW,IAAIA,GAAY;AAAA,QAC5B,MAAMA;AAAA,QACN,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,IAAI;AAAA,QACJ,OAAO;AAAA,MAC/B,CAAqB;AAAA,IAET,CAAC,IAED,KAAK,WAAW,SAAS;AACzB;AACJ,UAAMjC,IAAO+B,MAAe;AAC5B,SAAK,WAAW,QAAQ,CAACG,MAAY;AACjC,MAAAA,EAAQ,KAAK,GACbA,EAAQ,KAAK,GACbA,EAAQ,KAAK,GACbA,EAAQ,QAAQ;AAAA,IACpB,CAAC,GACDhD,EAAM,YAAY,CAACQ,MAAS;AACxB,YAAMuC,IAAaJ,EAAc3C,EAAM,aAAaQ,EAAK,EAAE,CAAC,GACtDwC,IAAU,KAAK,WAAW,IAAID,CAAU;AAC9C,MAAKC,MAELA,EAAQ,MAAMxC,EAAK,GACnBwC,EAAQ,MAAMxC,EAAK,GACfM,MACAkC,EAAQ,MAAMxC,EAAK,IACvBwC,EAAQ;AAAA,IACZ,CAAC,GACD,KAAK,WAAW,QAAQ,CAACA,MAAY;AACjC,MAAIA,EAAQ,QAAQ,MAChBA,EAAQ,MAAMA,EAAQ,OACtBA,EAAQ,MAAMA,EAAQ,OACtBA,EAAQ,MAAMA,EAAQ;AAAA,IAE9B,CAAC,GACDhD,EAAM,YAAY,CAACQ,MAAS;AACxB,YAAM,EAAE,IAAAF,EAAE,IAAKE;AAEf,UAAI,KAAK,YAAYA,CAAI;AACrB;AACJ,YAAMuC,IAAaJ,EAAc3C,EAAM,aAAaM,CAAE,CAAC,GACjD0C,IAAU,KAAK,WAAW,IAAID,CAAU;AAC9C,UAAI,CAACC;AACD;AACJ,YAAMC,IAAO,KAAK,cAAc,IAAI3C,CAAE,GAChCmB,IAAOjB,EAAK,IAAIwC,EAAQ,IACxBtB,IAAOlB,EAAK,IAAIwC,EAAQ,IACxBrB,IAAOb,IAAON,EAAK,IAAIwC,EAAQ,KAAK,GACpCE,IAAa,KAAK,KAAKzB,IAAOA,IAAOC,IAAOA,IAAOC,IAAOA,CAAI;AACpE,UAAIuB,MAAe;AACf;AACJ,YAAMC,IAAe,KAAK,IAAIP;AAC9B,MAAAK,EAAK,KAAME,IAAe1B,IAAQyB,GAClCD,EAAK,KAAME,IAAezB,IAAQwB,GAC9BpC,MACAmC,EAAK,KAAME,IAAexB,IAAQuB;AAAA,IAE1C,CAAC;AAAA,EACL;AAAA,EACA,qBAAqB;AACjB,UAAM,EAAE,OAAAlD,GAAO,SAAAC,EAAO,IAAK,MACrB,EAAE,SAAAmD,GAAS,QAAAC,GAAQ,YAAAR,EAAU,IAAK5C,GAClCa,IAAO+B,MAAe,GACtBM,IAAe,OAAO,KAAK,IAAIC;AACrC,IAAApD,EAAM,YAAY,CAACQ,MAAS;AACxB,YAAM,EAAE,IAAAF,EAAE,IAAKE;AAEf,UAAI,KAAK,YAAYA,CAAI;AACrB;AACJ,YAAMyC,IAAO,KAAK,cAAc,IAAI3C,CAAE;AACtC,MAAA2C,EAAK,KAAKE,KAAgB3C,EAAK,IAAI6C,EAAO,CAAC,IAC3CJ,EAAK,KAAKE,KAAgB3C,EAAK,IAAI6C,EAAO,CAAC,IACvCvC,MACAmC,EAAK,KAAKE,KAAgB3C,EAAK,KAAK6C,EAAO,CAAC,KAAK;AAAA,IAEzD,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,kBAAkB;AACd,UAAM,EAAE,OAAArD,GAAO,SAAAC,EAAO,IAAK,MACrB,EAAE,OAAAqD,GAAO,YAAAT,GAAY,uBAAAU,IAAwB,MAAK,IAAKtD,GACvDa,IAAO+B,MAAe;AAC5B,QAAIW,IAAM,GACNC,IAAM,OACNC,IAAM,GACNC,IAAQ;AAsBZ,QArBA3D,EAAM,YAAY,CAACQ,MAAS;AACxB,YAAM,EAAE,IAAAF,EAAE,IAAKE;AACf,UAAI,KAAK,YAAYA,CAAI;AACrB;AACJ,YAAMyC,IAAO,KAAK,cAAc,IAAI3C,CAAE,GAChC4C,IAAa,KAAK,KAAKD,EAAK,IAAIA,EAAK,IAAIA,EAAK,IAAIA,EAAK,KAAKnC,IAAOmC,EAAK,IAAIA,EAAK,IAAI,EAAE;AAC7F,UAAIC,MAAe;AACf;AACJ,YAAMU,IAAc,KAAK,IAAI,KAAK,eAAeN,IAAQzD,IAAkBqD,CAAU,GAC/EW,IAAQD,IAAcV;AAC5B,MAAA1C,EAAK,KAAKyC,EAAK,IAAIY,GACnBrD,EAAK,KAAKyC,EAAK,IAAIY,GACf/C,MACAN,EAAK,IAAIA,EAAK,IAAIyC,EAAK,IAAIY,IAG/BL,IAAM,KAAK,IAAIA,GAAKI,CAAW,GAC/BH,IAAM,KAAK,IAAIA,GAAKG,CAAW,GAC/BF,KAAOE,GACPD;AAAA,IACJ,CAAC,GACGA,MAAU;AACV,aAAO;AACX,YAAQJ,GAAqB;AAAA,MACzB,KAAK;AACD,eAAOE,MAAQ,QAAW,IAAIA;AAAA,MAClC,KAAK;AACD,eAAOC,IAAMC;AAAA,MACjB,KAAK;AAAA,MACL;AACI,eAAOH;AAAA,IACvB;AAAA,EACI;AAAA,EACA,UAAU;AACN,QAAIM,GAAIC;AACR,SAAK,KAAI,IACRD,IAAK,KAAK,mBAAmB,QAAQA,MAAO,UAAkBA,EAAG,MAAK,IACtEC,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,MAAK;AAAA,EACxE;AACJ;","x_google_ignoreList":[0]}