@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/@antv/layout/lib/algorithm/force/repulsive.js

@@ -0,0 +1,86 @@
+import q from "../../node_modules/d3-quadtree/src/quadtree.js";
+import M from "../../node_modules/d3-octree/src/octree.js";
+function S(t = 1, n = 5e-3, u = 2) {
+  function s(r, h) {
+    const l = n * n;
+    B(r, t, l, h, u);
+  }
+  return s.factor = function(r) {
+    return arguments.length ? (t = r, s) : t;
+  }, s.coulombDisScale = function(r) {
+    return arguments.length ? (n = r, s) : n;
+  }, s.dimensions = function(r) {
+    return arguments.length ? (u = r, s) : u;
+  }, s;
+}
+const A = 0.81, w = 0.1;
+function B(t, n, u, s, r = 2) {
+  const h = n / u, a = t.nodes().map((i, z) => {
+    const { nodeStrength: v, x, y, z: m, size: o, mass: p } = i;
+    return {
+      x,
+      y,
+      z: m,
+      size: o,
+      index: z,
+      id: i.id,
+      vx: 0,
+      vy: 0,
+      vz: 0,
+      weight: h * v,
+      mass: p || 1
+    };
+  }), c = (r === 2 ? q(a, (i) => i.x, (i) => i.y) : M(a, (i) => i.x, (i) => i.y, (i) => i.z)).visitAfter(C), f = /* @__PURE__ */ new Map();
+  return a.forEach((i) => {
+    f.set(i.id, i), F(i, c, r);
+  }), a.map((i) => {
+    const z = i.id;
+    s[z] = {
+      x: i.vx / i.mass,
+      y: i.vy / i.mass,
+      z: i.vz / i.mass
+    };
+  }), s;
+}
+function C(t) {
+  let n = 0, u = 0, s = 0, r = 0, h = 0;
+  const l = t.length;
+  if (l) {
+    for (let a = 0; a < l; a++) {
+      const c = t[a];
+      c && c.weight && (n += c.weight, u += c.x * c.weight, s += c.y * c.weight, r += c.z * c.weight, h += c.size * c.weight);
+    }
+    t.x = u / n, t.y = s / n, t.z = r / n, t.size = h / n, t.weight = n;
+  } else {
+    const a = t;
+    t.x = a.data.x, t.y = a.data.y, t.z = a.data.z, t.size = a.data.size, t.weight = a.data.weight;
+  }
+}
+const E = (t, n, u, s, r, h, l, a, c) => {
+  var f;
+  if (((f = t.data) === null || f === void 0 ? void 0 : f.id) === a.id)
+    return;
+  const i = c === 2 ? s : c === 3 ? h : u, z = a.x - t.x || w, v = a.y - t.y || w, x = a.z - t.z || w, y = [z, v, x], m = i - n;
+  let o = 0;
+  for (let g = 0; g < c; g++)
+    o += y[g] * y[g];
+  const e = Math.sqrt(o) * o;
+  if (m * m * A < o) {
+    const g = t.weight / e;
+    return a.vx += z * g, a.vy += v * g, a.vz += x * g, !0;
+  }
+  if (t.length)
+    return !1;
+  if (t.data !== a) {
+    const g = t.data.weight / e;
+    a.vx += z * g, a.vy += v * g, a.vz += x * g;
+  }
+};
+function F(t, n, u) {
+  n.visit((s, r, h, l, a, c, f) => E(s, r, h, l, a, c, f, t, u));
+}
+export {
+  B as forceNBody,
+  S as forceRepulsive
+};
+//# sourceMappingURL=repulsive.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/force/repulsive.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"repulsive.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/force/repulsive.js"],"sourcesContent":["import quadtree from '../../node_modules/d3-quadtree/src/quadtree.js';\nimport octree from '../../node_modules/d3-octree/src/octree.js';\n\n/**\n * Repulsive force based on Coulomb's law\n * Uses Barnes-Hut optimization with quadtree/octree\n */\nfunction forceRepulsive(factor = 1, coulombDisScale = 0.005, dimensions = 2) {\n    function force(model, accMap) {\n        const coulombDisScale2 = coulombDisScale * coulombDisScale;\n        forceNBody(model, factor, coulombDisScale2, accMap, dimensions);\n    }\n    force.factor = function (_) {\n        return arguments.length ? ((factor = _), force) : factor;\n    };\n    force.coulombDisScale = function (_) {\n        return arguments.length ? ((coulombDisScale = _), force) : coulombDisScale;\n    };\n    force.dimensions = function (_) {\n        return arguments.length ? ((dimensions = _), force) : dimensions;\n    };\n    return force;\n}\nconst theta2 = 0.81; // Barnes-Hut approximation threshold\nconst epsilon = 0.1; // 为了防止出现除0的情况，加一个epsilon\nfunction forceNBody(model, factor, coulombDisScale2, accMap, dimensions = 2) {\n    const weightParam = factor / coulombDisScale2;\n    const nodes = model.nodes();\n    const data = nodes.map((node, i) => {\n        const { nodeStrength, x, y, z, size, mass } = node;\n        return {\n            x,\n            y,\n            z,\n            size,\n            index: i,\n            id: node.id,\n            vx: 0,\n            vy: 0,\n            vz: 0,\n            weight: weightParam * nodeStrength,\n            mass: mass || 1,\n        };\n    });\n    const tree = (dimensions === 2\n        ? quadtree(data, (d) => d.x, (d) => d.y)\n        : octree(data, (d) => d.x, (d) => d.y, (d) => d.z)).visitAfter(accumulate); // init internal node\n    const nodeMap = new Map();\n    data.forEach((n) => {\n        nodeMap.set(n.id, n);\n        // @ts-ignore\n        computeForce(n, tree, dimensions);\n    });\n    data.map((n) => {\n        const id = n.id;\n        // 从 0 开始，= 初始化 + 加斥力\n        accMap[id] = {\n            x: n.vx / n.mass,\n            y: n.vy / n.mass,\n            z: n.vz / n.mass,\n        };\n    });\n    return accMap;\n}\nfunction accumulate(treeNode) {\n    let accWeight = 0;\n    let accX = 0;\n    let accY = 0;\n    let accZ = 0;\n    let accSize = 0;\n    const numChildren = treeNode.length;\n    if (numChildren) {\n        // internal node, accumulate 4 child quads\n        for (let i = 0; i < numChildren; i++) {\n            const q = treeNode[i];\n            if (q && q.weight) {\n                accWeight += q.weight;\n                accX += q.x * q.weight;\n                accY += q.y * q.weight;\n                accZ += q.z * q.weight;\n                accSize += q.size * q.weight;\n            }\n        }\n        treeNode.x = accX / accWeight;\n        treeNode.y = accY / accWeight;\n        treeNode.z = accZ / accWeight;\n        treeNode.size = accSize / accWeight;\n        treeNode.weight = accWeight;\n    }\n    else {\n        // leaf node\n        const q = treeNode;\n        treeNode.x = q.data.x;\n        treeNode.y = q.data.y;\n        treeNode.z = q.data.z;\n        treeNode.size = q.data.size;\n        treeNode.weight = q.data.weight;\n    }\n}\nconst apply = (treeNode, x1, arg1, arg2, arg3, arg4, arg5, node, dimensions) => {\n    var _a;\n    if (((_a = treeNode.data) === null || _a === void 0 ? void 0 : _a.id) === node.id)\n        return;\n    const x2 = dimensions === 2 ? arg2 : dimensions === 3 ? arg4 : arg1;\n    const dx = node.x - treeNode.x || epsilon;\n    const dy = node.y - treeNode.y || epsilon;\n    const dz = node.z - treeNode.z || epsilon;\n    const pos = [dx, dy, dz];\n    const width = x2 - x1;\n    let len2 = 0;\n    for (let i = 0; i < dimensions; i++) {\n        len2 += pos[i] * pos[i];\n    }\n    const len1 = Math.sqrt(len2);\n    const len3 = len1 * len2;\n    // far node, apply Barnes-Hut approximation\n    if (width * width * theta2 < len2) {\n        const param = treeNode.weight / len3;\n        node.vx += dx * param;\n        node.vy += dy * param;\n        node.vz += dz * param;\n        return true;\n    }\n    // near quad, compute force directly\n    if (treeNode.length)\n        return false; // internal node, visit children\n    // leaf node\n    if (treeNode.data !== node) {\n        const param = treeNode.data.weight / len3;\n        node.vx += dx * param;\n        node.vy += dy * param;\n        node.vz += dz * param;\n    }\n};\n// @ts-ignore\nfunction computeForce(node, tree, dimensions) {\n    // @ts-ignore\n    tree.visit((treeNode, x1, y1, arg2, arg3, arg4, arg5) => apply(treeNode, x1, y1, arg2, arg3, arg4, arg5, node, dimensions));\n}\n\nexport { forceNBody, forceRepulsive };\n//# sourceMappingURL=repulsive.js.map\n"],"names":["forceRepulsive","factor","coulombDisScale","dimensions","force","model","accMap","coulombDisScale2","forceNBody","_","theta2","epsilon","weightParam","data","node","i","nodeStrength","z","size","mass","tree","quadtree","d","octree","accumulate","nodeMap","n","computeForce","id","treeNode","accWeight","accX","accY","accZ","accSize","numChildren","q","apply","x1","arg1","arg2","arg3","arg4","arg5","_a","x2","dx","dy","dz","pos","width","len2","len3","param","y1"],"mappings":";;AAOA,SAASA,EAAeC,IAAS,GAAGC,IAAkB,MAAOC,IAAa,GAAG;AACzE,WAASC,EAAMC,GAAOC,GAAQ;AAC1B,UAAMC,IAAmBL,IAAkBA;AAC3C,IAAAM,EAAWH,GAAOJ,GAAQM,GAAkBD,GAAQH,CAAU;AAAA,EAClE;AACA,SAAAC,EAAM,SAAS,SAAUK,GAAG;AACxB,WAAO,UAAU,UAAWR,IAASQ,GAAIL,KAASH;AAAA,EACtD,GACAG,EAAM,kBAAkB,SAAUK,GAAG;AACjC,WAAO,UAAU,UAAWP,IAAkBO,GAAIL,KAASF;AAAA,EAC/D,GACAE,EAAM,aAAa,SAAUK,GAAG;AAC5B,WAAO,UAAU,UAAWN,IAAaM,GAAIL,KAASD;AAAA,EAC1D,GACOC;AACX;AACA,MAAMM,IAAS,MACTC,IAAU;AAChB,SAASH,EAAWH,GAAOJ,GAAQM,GAAkBD,GAAQH,IAAa,GAAG;AACzE,QAAMS,IAAcX,IAASM,GAEvBM,IADQR,EAAM,MAAK,EACN,IAAI,CAACS,GAAMC,MAAM;AAChC,UAAM,EAAE,cAAAC,GAAc,GAAG,GAAG,GAAAC,GAAG,MAAAC,GAAM,MAAAC,EAAI,IAAKL;AAC9C,WAAO;AAAA,MACH;AAAA,MACA;AAAA,MACA,GAAAG;AAAA,MACA,MAAAC;AAAA,MACA,OAAOH;AAAA,MACP,IAAID,EAAK;AAAA,MACT,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,QAAQF,IAAcI;AAAA,MACtB,MAAMG,KAAQ;AAAA,IAC1B;AAAA,EACI,CAAC,GACKC,KAAQjB,MAAe,IACvBkB,EAASR,GAAM,CAACS,MAAMA,EAAE,GAAG,CAACA,MAAMA,EAAE,CAAC,IACrCC,EAAOV,GAAM,CAACS,MAAMA,EAAE,GAAG,CAACA,MAAMA,EAAE,GAAG,CAACA,MAAMA,EAAE,CAAC,GAAG,WAAWE,CAAU,GACvEC,IAAU,oBAAI,IAAG;AACvB,SAAAZ,EAAK,QAAQ,CAACa,MAAM;AAChB,IAAAD,EAAQ,IAAIC,EAAE,IAAIA,CAAC,GAEnBC,EAAaD,GAAGN,GAAMjB,CAAU;AAAA,EACpC,CAAC,GACDU,EAAK,IAAI,CAACa,MAAM;AACZ,UAAME,IAAKF,EAAE;AAEb,IAAApB,EAAOsB,CAAE,IAAI;AAAA,MACT,GAAGF,EAAE,KAAKA,EAAE;AAAA,MACZ,GAAGA,EAAE,KAAKA,EAAE;AAAA,MACZ,GAAGA,EAAE,KAAKA,EAAE;AAAA,IACxB;AAAA,EACI,CAAC,GACMpB;AACX;AACA,SAASkB,EAAWK,GAAU;AAC1B,MAAIC,IAAY,GACZC,IAAO,GACPC,IAAO,GACPC,IAAO,GACPC,IAAU;AACd,QAAMC,IAAcN,EAAS;AAC7B,MAAIM,GAAa;AAEb,aAASpB,IAAI,GAAGA,IAAIoB,GAAapB,KAAK;AAClC,YAAMqB,IAAIP,EAASd,CAAC;AACpB,MAAIqB,KAAKA,EAAE,WACPN,KAAaM,EAAE,QACfL,KAAQK,EAAE,IAAIA,EAAE,QAChBJ,KAAQI,EAAE,IAAIA,EAAE,QAChBH,KAAQG,EAAE,IAAIA,EAAE,QAChBF,KAAWE,EAAE,OAAOA,EAAE;AAAA,IAE9B;AACA,IAAAP,EAAS,IAAIE,IAAOD,GACpBD,EAAS,IAAIG,IAAOF,GACpBD,EAAS,IAAII,IAAOH,GACpBD,EAAS,OAAOK,IAAUJ,GAC1BD,EAAS,SAASC;AAAA,EACtB,OACK;AAED,UAAMM,IAAIP;AACV,IAAAA,EAAS,IAAIO,EAAE,KAAK,GACpBP,EAAS,IAAIO,EAAE,KAAK,GACpBP,EAAS,IAAIO,EAAE,KAAK,GACpBP,EAAS,OAAOO,EAAE,KAAK,MACvBP,EAAS,SAASO,EAAE,KAAK;AAAA,EAC7B;AACJ;AACA,MAAMC,IAAQ,CAACR,GAAUS,GAAIC,GAAMC,GAAMC,GAAMC,GAAMC,GAAM7B,GAAMX,MAAe;AAC5E,MAAIyC;AACJ,QAAMA,IAAKf,EAAS,UAAU,QAAQe,MAAO,SAAS,SAASA,EAAG,QAAQ9B,EAAK;AAC3E;AACJ,QAAM+B,IAAK1C,MAAe,IAAIqC,IAAOrC,MAAe,IAAIuC,IAAOH,GACzDO,IAAKhC,EAAK,IAAIe,EAAS,KAAKlB,GAC5BoC,IAAKjC,EAAK,IAAIe,EAAS,KAAKlB,GAC5BqC,IAAKlC,EAAK,IAAIe,EAAS,KAAKlB,GAC5BsC,IAAM,CAACH,GAAIC,GAAIC,CAAE,GACjBE,IAAQL,IAAKP;AACnB,MAAIa,IAAO;AACX,WAASpC,IAAI,GAAGA,IAAIZ,GAAYY;AAC5B,IAAAoC,KAAQF,EAAIlC,CAAC,IAAIkC,EAAIlC,CAAC;AAG1B,QAAMqC,IADO,KAAK,KAAKD,CAAI,IACPA;AAEpB,MAAID,IAAQA,IAAQxC,IAASyC,GAAM;AAC/B,UAAME,IAAQxB,EAAS,SAASuB;AAChC,WAAAtC,EAAK,MAAMgC,IAAKO,GAChBvC,EAAK,MAAMiC,IAAKM,GAChBvC,EAAK,MAAMkC,IAAKK,GACT;AAAA,EACX;AAEA,MAAIxB,EAAS;AACT,WAAO;AAEX,MAAIA,EAAS,SAASf,GAAM;AACxB,UAAMuC,IAAQxB,EAAS,KAAK,SAASuB;AACrC,IAAAtC,EAAK,MAAMgC,IAAKO,GAChBvC,EAAK,MAAMiC,IAAKM,GAChBvC,EAAK,MAAMkC,IAAKK;AAAA,EACpB;AACJ;AAEA,SAAS1B,EAAab,GAAMM,GAAMjB,GAAY;AAE1C,EAAAiB,EAAK,MAAM,CAACS,GAAUS,GAAIgB,GAAId,GAAMC,GAAMC,GAAMC,MAASN,EAAMR,GAAUS,GAAIgB,GAAId,GAAMC,GAAMC,GAAMC,GAAM7B,GAAMX,CAAU,CAAC;AAC9H;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,89 @@
+import { BaseSimulation as u } from "../base-simulation.js";
+import m from "../../node_modules/@antv/util/esm/lodash/is-number.js";
+class y extends u {
+  constructor() {
+    super(...arguments), this.forces = /* @__PURE__ */ new Map(), this.velMap = {};
+  }
+  data(s) {
+    return this.model = s, s.forEachNode((i) => {
+      this.velMap[i.id] = { x: 0, y: 0, z: 0 };
+    }), this;
+  }
+  force(s, i) {
+    return arguments.length === 1 ? this.forces.get(s) || null : (i === null ? this.forces.delete(s) : i && this.forces.set(s, i), i || null);
+  }
+  runOneStep() {
+    const s = {}, i = this.model.nodes();
+    if (!i.length)
+      return 0;
+    i.forEach((e) => {
+      s[e.id] = { x: 0, y: 0, z: 0 };
+    }), this.forces.forEach((e) => {
+      e(this.model, s);
+    }), this.updateVelocity(s);
+    const o = this.updatePosition();
+    return this.monitor(s, i), o;
+  }
+  setFixedPosition(s, i) {
+    const o = this.model.node(s);
+    if (!o)
+      return;
+    const e = ["fx", "fy", "fz"];
+    if (i === null) {
+      e.forEach((n) => delete o[n]);
+      return;
+    }
+    i.forEach((n, t) => {
+      t < e.length && (typeof n == "number" || n === null) && (o[e[t]] = n);
+    });
+    const r = this.velMap[s];
+    r && (r.x = 0, r.y = 0, r.z = 0);
+  }
+  updateVelocity(s) {
+    const { damping: i = 0.9, maxSpeed: o = 100, interval: e = 0.02, dimensions: r = 2 } = this.options;
+    this.model.nodes().forEach((n) => {
+      const t = n.id;
+      let l = (this.velMap[t].x + s[t].x * e) * i, h = (this.velMap[t].y + s[t].y * e) * i, a = r === 3 ? (this.velMap[t].z + s[t].z * e) * i : 0;
+      const c = Math.sqrt(l * l + h * h + a * a);
+      if (c > o) {
+        const f = o / c;
+        l *= f, h *= f, a *= f;
+      }
+      this.velMap[t] = { x: l, y: h, z: a };
+    });
+  }
+  updatePosition() {
+    const { distanceThresholdMode: s = "mean", interval: i = 0.02, dimensions: o = 2 } = this.options, e = this.model.nodes();
+    let r = 0, n = s === "max" ? -1 / 0 : s === "min" ? 1 / 0 : 0;
+    return e.forEach((t) => {
+      const l = t.id;
+      if (m(t.fx) && m(t.fy)) {
+        t.x = t.fx, t.y = t.fy, o === 3 && m(t.fz) && (t.z = t.fz);
+        return;
+      }
+      const h = this.velMap[l].x * i, a = this.velMap[l].y * i, c = o === 3 ? this.velMap[l].z * i : 0;
+      t.x += h, t.y += a, o === 3 && (t.z = (t.z || 0) + c);
+      const f = Math.sqrt(h * h + a * a + c * c);
+      s === "max" ? n = Math.max(n, f) : s === "min" ? n = Math.min(n, f) : r += f;
+    }), s === "mean" ? r / e.length : n;
+  }
+  monitor(s, i) {
+    const { monitor: o, dimensions: e = 2 } = this.options;
+    if (!o)
+      return;
+    let r = 0;
+    i.forEach((n) => {
+      const t = s[n.id], l = t.x * t.x + t.y * t.y + (e === 3 ? t.z * t.z : 0);
+      r += (n.mass || 1) * l * 0.5;
+    }), o({
+      energy: r,
+      nodes: i,
+      edges: this.model.edges(),
+      iterations: this.iteration
+    });
+  }
+}
+export {
+  y as ForceSimulation
+};
+//# sourceMappingURL=simulation.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"simulation.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/force/simulation.js"],"sourcesContent":["import { BaseSimulation } from '../base-simulation.js';\nimport isNumber from '../../node_modules/@antv/util/esm/lodash/is-number.js';\n\nclass ForceSimulation extends BaseSimulation {\n    constructor() {\n        super(...arguments);\n        this.forces = new Map();\n        this.velMap = {};\n    }\n    data(model) {\n        this.model = model;\n        model.forEachNode((node) => {\n            this.velMap[node.id] = { x: 0, y: 0, z: 0 };\n        });\n        return this;\n    }\n    force(name, force) {\n        if (arguments.length === 1)\n            return this.forces.get(name) || null;\n        if (force === null)\n            this.forces.delete(name);\n        else if (force)\n            this.forces.set(name, force);\n        return force || null;\n    }\n    runOneStep() {\n        const accMap = {};\n        const nodes = this.model.nodes();\n        if (!nodes.length)\n            return 0;\n        nodes.forEach((n) => {\n            accMap[n.id] = { x: 0, y: 0, z: 0 };\n        });\n        this.forces.forEach((force) => {\n            force(this.model, accMap);\n        });\n        this.updateVelocity(accMap);\n        const distance = this.updatePosition();\n        this.monitor(accMap, nodes);\n        return distance;\n    }\n    setFixedPosition(nodeId, position) {\n        const node = this.model.node(nodeId);\n        if (!node)\n            return;\n        const keys = ['fx', 'fy', 'fz'];\n        if (position === null) {\n            keys.forEach((k) => delete node[k]);\n            return;\n        }\n        position.forEach((v, i) => {\n            if (i < keys.length && (typeof v === 'number' || v === null)) {\n                node[keys[i]] = v;\n            }\n        });\n        const vel = this.velMap[nodeId];\n        if (vel) {\n            vel.x = 0;\n            vel.y = 0;\n            vel.z = 0;\n        }\n    }\n    updateVelocity(accMap) {\n        const { damping = 0.9, maxSpeed = 100, interval = 0.02, dimensions = 2, } = this.options;\n        this.model.nodes().forEach((node) => {\n            const id = node.id;\n            let vx = (this.velMap[id].x + accMap[id].x * interval) * damping;\n            let vy = (this.velMap[id].y + accMap[id].y * interval) * damping;\n            let vz = dimensions === 3\n                ? (this.velMap[id].z + accMap[id].z * interval) * damping\n                : 0;\n            const vLen = Math.sqrt(vx * vx + vy * vy + vz * vz);\n            if (vLen > maxSpeed) {\n                const k = maxSpeed / vLen;\n                vx *= k;\n                vy *= k;\n                vz *= k;\n            }\n            this.velMap[id] = { x: vx, y: vy, z: vz };\n        });\n    }\n    updatePosition() {\n        const { distanceThresholdMode = 'mean', interval = 0.02, dimensions = 2, } = this.options;\n        const nodes = this.model.nodes();\n        let sum = 0;\n        let judge = distanceThresholdMode === 'max'\n            ? -Infinity\n            : distanceThresholdMode === 'min'\n                ? Infinity\n                : 0;\n        nodes.forEach((node) => {\n            const id = node.id;\n            if (isNumber(node.fx) && isNumber(node.fy)) {\n                node.x = node.fx;\n                node.y = node.fy;\n                if (dimensions === 3 && isNumber(node.fz))\n                    node.z = node.fz;\n                return;\n            }\n            const dx = this.velMap[id].x * interval;\n            const dy = this.velMap[id].y * interval;\n            const dz = dimensions === 3 ? this.velMap[id].z * interval : 0;\n            node.x += dx;\n            node.y += dy;\n            if (dimensions === 3)\n                node.z = (node.z || 0) + dz;\n            const dist = Math.sqrt(dx * dx + dy * dy + dz * dz);\n            if (distanceThresholdMode === 'max')\n                judge = Math.max(judge, dist);\n            else if (distanceThresholdMode === 'min')\n                judge = Math.min(judge, dist);\n            else\n                sum += dist;\n        });\n        return distanceThresholdMode === 'mean' ? sum / nodes.length : judge;\n    }\n    monitor(accMap, nodes) {\n        const { monitor, dimensions = 2 } = this.options;\n        if (!monitor)\n            return;\n        let energy = 0;\n        nodes.forEach((node) => {\n            const a = accMap[node.id];\n            const v2 = a.x * a.x + a.y * a.y + (dimensions === 3 ? a.z * a.z : 0);\n            energy += (node.mass || 1) * v2 * 0.5;\n        });\n        monitor({\n            energy,\n            nodes,\n            edges: this.model.edges(),\n            iterations: this.iteration,\n        });\n    }\n}\n\nexport { ForceSimulation };\n//# sourceMappingURL=simulation.js.map\n"],"names":["ForceSimulation","BaseSimulation","model","node","name","force","accMap","nodes","n","distance","nodeId","position","keys","k","v","i","vel","damping","maxSpeed","interval","dimensions","id","vx","vy","vz","vLen","distanceThresholdMode","sum","judge","isNumber","dx","dy","dz","dist","monitor","energy","a","v2"],"mappings":";;AAGA,MAAMA,UAAwBC,EAAe;AAAA,EACzC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,SAAS,oBAAI,IAAG,GACrB,KAAK,SAAS,CAAA;AAAA,EAClB;AAAA,EACA,KAAKC,GAAO;AACR,gBAAK,QAAQA,GACbA,EAAM,YAAY,CAACC,MAAS;AACxB,WAAK,OAAOA,EAAK,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC;AAAA,IAC7C,CAAC,GACM;AAAA,EACX;AAAA,EACA,MAAMC,GAAMC,GAAO;AACf,WAAI,UAAU,WAAW,IACd,KAAK,OAAO,IAAID,CAAI,KAAK,QAChCC,MAAU,OACV,KAAK,OAAO,OAAOD,CAAI,IAClBC,KACL,KAAK,OAAO,IAAID,GAAMC,CAAK,GACxBA,KAAS;AAAA,EACpB;AAAA,EACA,aAAa;AACT,UAAMC,IAAS,CAAA,GACTC,IAAQ,KAAK,MAAM,MAAK;AAC9B,QAAI,CAACA,EAAM;AACP,aAAO;AACX,IAAAA,EAAM,QAAQ,CAACC,MAAM;AACjB,MAAAF,EAAOE,EAAE,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,EAAC;AAAA,IACrC,CAAC,GACD,KAAK,OAAO,QAAQ,CAACH,MAAU;AAC3B,MAAAA,EAAM,KAAK,OAAOC,CAAM;AAAA,IAC5B,CAAC,GACD,KAAK,eAAeA,CAAM;AAC1B,UAAMG,IAAW,KAAK,eAAc;AACpC,gBAAK,QAAQH,GAAQC,CAAK,GACnBE;AAAA,EACX;AAAA,EACA,iBAAiBC,GAAQC,GAAU;AAC/B,UAAMR,IAAO,KAAK,MAAM,KAAKO,CAAM;AACnC,QAAI,CAACP;AACD;AACJ,UAAMS,IAAO,CAAC,MAAM,MAAM,IAAI;AAC9B,QAAID,MAAa,MAAM;AACnB,MAAAC,EAAK,QAAQ,CAACC,MAAM,OAAOV,EAAKU,CAAC,CAAC;AAClC;AAAA,IACJ;AACA,IAAAF,EAAS,QAAQ,CAACG,GAAGC,MAAM;AACvB,MAAIA,IAAIH,EAAK,WAAW,OAAOE,KAAM,YAAYA,MAAM,UACnDX,EAAKS,EAAKG,CAAC,CAAC,IAAID;AAAA,IAExB,CAAC;AACD,UAAME,IAAM,KAAK,OAAON,CAAM;AAC9B,IAAIM,MACAA,EAAI,IAAI,GACRA,EAAI,IAAI,GACRA,EAAI,IAAI;AAAA,EAEhB;AAAA,EACA,eAAeV,GAAQ;AACnB,UAAM,EAAE,SAAAW,IAAU,KAAK,UAAAC,IAAW,KAAK,UAAAC,IAAW,MAAM,YAAAC,IAAa,EAAC,IAAM,KAAK;AACjF,SAAK,MAAM,MAAK,EAAG,QAAQ,CAACjB,MAAS;AACjC,YAAMkB,IAAKlB,EAAK;AAChB,UAAImB,KAAM,KAAK,OAAOD,CAAE,EAAE,IAAIf,EAAOe,CAAE,EAAE,IAAIF,KAAYF,GACrDM,KAAM,KAAK,OAAOF,CAAE,EAAE,IAAIf,EAAOe,CAAE,EAAE,IAAIF,KAAYF,GACrDO,IAAKJ,MAAe,KACjB,KAAK,OAAOC,CAAE,EAAE,IAAIf,EAAOe,CAAE,EAAE,IAAIF,KAAYF,IAChD;AACN,YAAMQ,IAAO,KAAK,KAAKH,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,CAAE;AAClD,UAAIC,IAAOP,GAAU;AACjB,cAAML,IAAIK,IAAWO;AACrB,QAAAH,KAAMT,GACNU,KAAMV,GACNW,KAAMX;AAAA,MACV;AACA,WAAK,OAAOQ,CAAE,IAAI,EAAE,GAAGC,GAAI,GAAGC,GAAI,GAAGC,EAAE;AAAA,IAC3C,CAAC;AAAA,EACL;AAAA,EACA,iBAAiB;AACb,UAAM,EAAE,uBAAAE,IAAwB,QAAQ,UAAAP,IAAW,MAAM,YAAAC,IAAa,MAAO,KAAK,SAC5Eb,IAAQ,KAAK,MAAM,MAAK;AAC9B,QAAIoB,IAAM,GACNC,IAAQF,MAA0B,QAChC,SACAA,MAA0B,QACtB,QACA;AACV,WAAAnB,EAAM,QAAQ,CAACJ,MAAS;AACpB,YAAMkB,IAAKlB,EAAK;AAChB,UAAI0B,EAAS1B,EAAK,EAAE,KAAK0B,EAAS1B,EAAK,EAAE,GAAG;AACxC,QAAAA,EAAK,IAAIA,EAAK,IACdA,EAAK,IAAIA,EAAK,IACViB,MAAe,KAAKS,EAAS1B,EAAK,EAAE,MACpCA,EAAK,IAAIA,EAAK;AAClB;AAAA,MACJ;AACA,YAAM2B,IAAK,KAAK,OAAOT,CAAE,EAAE,IAAIF,GACzBY,IAAK,KAAK,OAAOV,CAAE,EAAE,IAAIF,GACzBa,IAAKZ,MAAe,IAAI,KAAK,OAAOC,CAAE,EAAE,IAAIF,IAAW;AAC7D,MAAAhB,EAAK,KAAK2B,GACV3B,EAAK,KAAK4B,GACNX,MAAe,MACfjB,EAAK,KAAKA,EAAK,KAAK,KAAK6B;AAC7B,YAAMC,IAAO,KAAK,KAAKH,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,CAAE;AAClD,MAAIN,MAA0B,QAC1BE,IAAQ,KAAK,IAAIA,GAAOK,CAAI,IACvBP,MAA0B,QAC/BE,IAAQ,KAAK,IAAIA,GAAOK,CAAI,IAE5BN,KAAOM;AAAA,IACf,CAAC,GACMP,MAA0B,SAASC,IAAMpB,EAAM,SAASqB;AAAA,EACnE;AAAA,EACA,QAAQtB,GAAQC,GAAO;AACnB,UAAM,EAAE,SAAA2B,GAAS,YAAAd,IAAa,EAAC,IAAK,KAAK;AACzC,QAAI,CAACc;AACD;AACJ,QAAIC,IAAS;AACb,IAAA5B,EAAM,QAAQ,CAACJ,MAAS;AACpB,YAAMiC,IAAI9B,EAAOH,EAAK,EAAE,GAClBkC,IAAKD,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,KAAKhB,MAAe,IAAIgB,EAAE,IAAIA,EAAE,IAAI;AACnE,MAAAD,MAAWhC,EAAK,QAAQ,KAAKkC,IAAK;AAAA,IACtC,CAAC,GACDH,EAAQ;AAAA,MACJ,QAAAC;AAAA,MACA,OAAA5B;AAAA,MACA,OAAO,KAAK,MAAM,MAAK;AAAA,MACvB,YAAY,KAAK;AAAA,IAC7B,CAAS;AAAA,EACL;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,42 @@
+class h {
+  constructor(s) {
+    this.id = s.id || 0, this.rx = s.rx, this.ry = s.ry, this.fx = 0, this.fy = 0, this.mass = s.mass, this.degree = s.degree, this.g = s.g || 0;
+  }
+  // returns the euclidean distance
+  distanceTo(s) {
+    const t = this.rx - s.rx, e = this.ry - s.ry;
+    return Math.hypot(t, e);
+  }
+  setPos(s, t) {
+    this.rx = s, this.ry = t;
+  }
+  // resets the forces
+  resetForce() {
+    this.fx = 0, this.fy = 0;
+  }
+  addForce(s) {
+    const t = s.rx - this.rx, e = s.ry - this.ry;
+    let r = Math.hypot(t, e);
+    r = r < 1e-4 ? 1e-4 : r;
+    const i = this.g * (this.degree + 1) * (s.degree + 1) / r;
+    this.fx += i * t / r, this.fy += i * e / r;
+  }
+  // if quad contains this body
+  in(s) {
+    return s.contains(this.rx, this.ry);
+  }
+  // returns a new body
+  add(s) {
+    const t = this.mass + s.mass, e = (this.rx * this.mass + s.rx * s.mass) / t, r = (this.ry * this.mass + s.ry * s.mass) / t, i = this.degree + s.degree, d = {
+      rx: e,
+      ry: r,
+      mass: t,
+      degree: i
+    };
+    return new h(d);
+  }
+}
+export {
+  h as default
+};
+//# sourceMappingURL=body.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"body.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/force-atlas2/body.js"],"sourcesContent":["// represents a body(a point mass) and its position\nclass Body {\n    constructor(params) {\n        /**\n         * the id of this body, the same with the node id\n         * @type  {number}\n         */\n        this.id = params.id || 0;\n        /**\n         * the position of this body\n         * @type  {number}\n         */\n        this.rx = params.rx;\n        /**\n         * the position of this body\n         * @type  {number}\n         */\n        this.ry = params.ry;\n        /**\n         * the force acting on this body\n         * @type  {number}\n         */\n        this.fx = 0;\n        /**\n         * the force acting on this body\n         * @type  {number}\n         */\n        this.fy = 0;\n        /**\n         * the mass of this body, =1 for a node\n         * @type  {number}\n         */\n        this.mass = params.mass;\n        /**\n         * the degree of the node represented by this body\n         * @type  {number}\n         */\n        this.degree = params.degree;\n        /**\n         * the parameter for repulsive force, = kr\n         * @type  {number}\n         */\n        this.g = params.g || 0;\n    }\n    // returns the euclidean distance\n    distanceTo(bo) {\n        const dx = this.rx - bo.rx;\n        const dy = this.ry - bo.ry;\n        return Math.hypot(dx, dy);\n    }\n    setPos(x, y) {\n        this.rx = x;\n        this.ry = y;\n    }\n    // resets the forces\n    resetForce() {\n        this.fx = 0;\n        this.fy = 0;\n    }\n    addForce(b) {\n        const dx = b.rx - this.rx;\n        const dy = b.ry - this.ry;\n        let dist = Math.hypot(dx, dy);\n        dist = dist < 0.0001 ? 0.0001 : dist;\n        // the repulsive defined by force atlas 2\n        const F = (this.g * (this.degree + 1) * (b.degree + 1)) / dist;\n        this.fx += (F * dx) / dist;\n        this.fy += (F * dy) / dist;\n    }\n    // if quad contains this body\n    in(quad) {\n        return quad.contains(this.rx, this.ry);\n    }\n    // returns a new body\n    add(bo) {\n        const nenwMass = this.mass + bo.mass;\n        const x = (this.rx * this.mass + bo.rx * bo.mass) / nenwMass;\n        const y = (this.ry * this.mass + bo.ry * bo.mass) / nenwMass;\n        const dg = this.degree + bo.degree;\n        const params = {\n            rx: x,\n            ry: y,\n            mass: nenwMass,\n            degree: dg,\n        };\n        return new Body(params);\n    }\n}\n\nexport { Body as default };\n//# sourceMappingURL=body.js.map\n"],"names":["Body","params","bo","dx","dy","x","y","b","dist","F","quad","nenwMass","dg"],"mappings":"AACA,MAAMA,EAAK;AAAA,EACP,YAAYC,GAAQ;AAKhB,SAAK,KAAKA,EAAO,MAAM,GAKvB,KAAK,KAAKA,EAAO,IAKjB,KAAK,KAAKA,EAAO,IAKjB,KAAK,KAAK,GAKV,KAAK,KAAK,GAKV,KAAK,OAAOA,EAAO,MAKnB,KAAK,SAASA,EAAO,QAKrB,KAAK,IAAIA,EAAO,KAAK;AAAA,EACzB;AAAA;AAAA,EAEA,WAAWC,GAAI;AACX,UAAMC,IAAK,KAAK,KAAKD,EAAG,IAClBE,IAAK,KAAK,KAAKF,EAAG;AACxB,WAAO,KAAK,MAAMC,GAAIC,CAAE;AAAA,EAC5B;AAAA,EACA,OAAOC,GAAGC,GAAG;AACT,SAAK,KAAKD,GACV,KAAK,KAAKC;AAAA,EACd;AAAA;AAAA,EAEA,aAAa;AACT,SAAK,KAAK,GACV,KAAK,KAAK;AAAA,EACd;AAAA,EACA,SAASC,GAAG;AACR,UAAMJ,IAAKI,EAAE,KAAK,KAAK,IACjBH,IAAKG,EAAE,KAAK,KAAK;AACvB,QAAIC,IAAO,KAAK,MAAML,GAAIC,CAAE;AAC5B,IAAAI,IAAOA,IAAO,OAAS,OAASA;AAEhC,UAAMC,IAAK,KAAK,KAAK,KAAK,SAAS,MAAMF,EAAE,SAAS,KAAMC;AAC1D,SAAK,MAAOC,IAAIN,IAAMK,GACtB,KAAK,MAAOC,IAAIL,IAAMI;AAAA,EAC1B;AAAA;AAAA,EAEA,GAAGE,GAAM;AACL,WAAOA,EAAK,SAAS,KAAK,IAAI,KAAK,EAAE;AAAA,EACzC;AAAA;AAAA,EAEA,IAAIR,GAAI;AACJ,UAAMS,IAAW,KAAK,OAAOT,EAAG,MAC1BG,KAAK,KAAK,KAAK,KAAK,OAAOH,EAAG,KAAKA,EAAG,QAAQS,GAC9CL,KAAK,KAAK,KAAK,KAAK,OAAOJ,EAAG,KAAKA,EAAG,QAAQS,GAC9CC,IAAK,KAAK,SAASV,EAAG,QACtBD,IAAS;AAAA,MACX,IAAII;AAAA,MACJ,IAAIC;AAAA,MACJ,MAAMK;AAAA,MACN,QAAQC;AAAA,IACpB;AACQ,WAAO,IAAIZ,EAAKC,CAAM;AAAA,EAC1B;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,94 @@
+import { __awaiter as k } from "../../node_modules/tslib/tslib.es6.js";
+import { initNodePosition as S } from "../../model/data.js";
+import { applySingleNodeLayout as y } from "../../util/common.js";
+import { formatNodeSizeFn as O } from "../../util/format.js";
+import { normalizeViewport as _ } from "../../util/viewport.js";
+import { BaseLayoutWithIterations as z } from "../base-layout.js";
+import { Simulation as b } from "./simulation.js";
+const h = {
+  nodeSize: 10,
+  nodeSpacing: 0,
+  width: 300,
+  height: 300,
+  kr: 5,
+  kg: 1,
+  mode: "normal",
+  preventOverlap: !1,
+  dissuadeHubs: !1,
+  maxIteration: 0,
+  ks: 0.1,
+  ksmax: 10,
+  tao: 0.1
+};
+class H extends z {
+  constructor() {
+    super(...arguments), this.id = "force-atlas2", this.simulation = null;
+  }
+  getDefaultOptions() {
+    return h;
+  }
+  layout(t) {
+    return k(this, void 0, void 0, function* () {
+      const i = this.parseOptions(t), { width: o, height: r, prune: n, center: m } = i, e = this.model.nodeCount();
+      if (!e || e === 1)
+        return y(this.model, m);
+      S(this.model, o, r);
+      const s = this.getSizes(i.nodeSize, i.nodeSpacing), a = this.setSimulation();
+      a.data(this.model, s), a.initialize(i), a.restart();
+      const f = () => new Promise((l) => {
+        a.on("end", l);
+      });
+      if (!n)
+        return f();
+      if (yield f(), n) {
+        const l = this.model.edges();
+        for (let c = 0; c < l.length; c += 1) {
+          const { source: g, target: p } = l[c], v = this.model.degree(g), x = this.model.degree(p), d = this.model.node(g), u = this.model.node(p);
+          v <= 1 ? (d.x = u.x, d.y = u.y) : x <= 1 && (u.x = d.x, u.y = d.y);
+        }
+        a.initialize(Object.assign(Object.assign({}, i), { prune: !1, barnesHut: !1 })), a.tick(100);
+      }
+    });
+  }
+  getSizes(t, i) {
+    const o = {}, r = O(t, i, h.nodeSize, h.nodeSpacing);
+    return this.model.forEachNode((n) => {
+      o[n.id] = Math.max(...r(n._original));
+    }), o;
+  }
+  setSimulation() {
+    const t = this.simulation || new b();
+    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;
+  }
+  parseOptions(t = {}) {
+    const { barnesHut: i, prune: o, maxIteration: r, kr: n, kg: m } = t, e = {}, s = this.model.nodeCount();
+    return i === void 0 && s > 250 && (e.barnesHut = !0), o === void 0 && s > 100 && (e.prune = !0), r === 0 && !o ? (e.maxIteration = 250, s <= 200 && s > 100 ? e.maxIteration = 1e3 : s > 200 && (e.maxIteration = 1200)) : r === 0 && o && (e.maxIteration = 100, s <= 200 && s > 100 ? e.maxIteration = 500 : s > 200 && (e.maxIteration = 950)), n || (e.kr = 50, s > 100 && s <= 500 ? e.kr = 20 : s > 500 && (e.kr = 1)), m || (e.kg = 20, s > 100 && s <= 500 ? e.kg = 10 : s > 500 && (e.kg = 1)), Object.assign(Object.assign(Object.assign({}, t), e), _(t));
+  }
+  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);
+  }
+  restart() {
+    var t;
+    (t = this.simulation) === null || t === void 0 || t.restart();
+  }
+  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 {
+  H as ForceAtlas2Layout
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/force-atlas2/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 { formatNodeSizeFn } 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$4 = {\n    nodeSize: 10,\n    nodeSpacing: 0,\n    width: 300,\n    height: 300,\n    kr: 5,\n    kg: 1,\n    mode: 'normal',\n    preventOverlap: false,\n    dissuadeHubs: false,\n    maxIteration: 0,\n    ks: 0.1,\n    ksmax: 10,\n    tao: 0.1,\n};\nclass ForceAtlas2Layout extends BaseLayoutWithIterations {\n    constructor() {\n        super(...arguments);\n        this.id = 'force-atlas2';\n        this.simulation = null;\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS$4;\n    }\n    layout(options) {\n        return __awaiter(this, void 0, void 0, function* () {\n            const merged = this.parseOptions(options);\n            const { width, height, prune, center } = merged;\n            const n = this.model.nodeCount();\n            if (!n || n === 1) {\n                return applySingleNodeLayout(this.model, center);\n            }\n            initNodePosition(this.model, width, height);\n            const sizes = this.getSizes(merged.nodeSize, merged.nodeSpacing);\n            const simulation = this.setSimulation();\n            simulation.data(this.model, sizes);\n            simulation.initialize(merged);\n            simulation.restart();\n            const run = () => new Promise((resolve) => {\n                simulation.on('end', resolve);\n            });\n            if (!prune)\n                return run();\n            yield run();\n            // prune: 把叶子节点贴到父节点并再运行若干次以收敛\n            if (prune) {\n                const edges = this.model.edges();\n                for (let j = 0; j < edges.length; j += 1) {\n                    const { source, target } = edges[j];\n                    const sourceDegree = this.model.degree(source);\n                    const targetDegree = this.model.degree(target);\n                    const sourceNode = this.model.node(source);\n                    const targetNode = this.model.node(target);\n                    if (sourceDegree <= 1) {\n                        sourceNode.x = targetNode.x;\n                        sourceNode.y = targetNode.y;\n                    }\n                    else if (targetDegree <= 1) {\n                        targetNode.x = sourceNode.x;\n                        targetNode.y = sourceNode.y;\n                    }\n                }\n                simulation.initialize(Object.assign(Object.assign({}, merged), { prune: false, barnesHut: false }));\n                simulation.tick(100);\n            }\n        });\n    }\n    getSizes(nodeSize, nodeSpacing) {\n        const result = {};\n        const nodeSizeFn = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULTS_LAYOUT_OPTIONS$4.nodeSize, DEFAULTS_LAYOUT_OPTIONS$4.nodeSpacing);\n        this.model.forEachNode((node) => {\n            result[node.id] = Math.max(...nodeSizeFn(node._original));\n        });\n        return result;\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    parseOptions(options = {}) {\n        const { barnesHut, prune, maxIteration, kr, kg } = options;\n        const auto = {};\n        const n = this.model.nodeCount();\n        if (barnesHut === undefined && n > 250)\n            auto.barnesHut = true;\n        if (prune === undefined && n > 100)\n            auto.prune = true;\n        if (maxIteration === 0 && !prune) {\n            auto.maxIteration = 250;\n            if (n <= 200 && n > 100)\n                auto.maxIteration = 1000;\n            else if (n > 200)\n                auto.maxIteration = 1200;\n        }\n        else if (maxIteration === 0 && prune) {\n            auto.maxIteration = 100;\n            if (n <= 200 && n > 100)\n                auto.maxIteration = 500;\n            else if (n > 200)\n                auto.maxIteration = 950;\n        }\n        if (!kr) {\n            auto.kr = 50;\n            if (n > 100 && n <= 500)\n                auto.kr = 20;\n            else if (n > 500)\n                auto.kr = 1;\n        }\n        if (!kg) {\n            auto.kg = 20;\n            if (n > 100 && n <= 500)\n                auto.kg = 10;\n            else if (n > 500)\n                auto.kg = 1;\n        }\n        return Object.assign(Object.assign(Object.assign({}, options), auto), normalizeViewport(options));\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    restart() {\n        var _a;\n        (_a = this.simulation) === null || _a === void 0 ? void 0 : _a.restart();\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 { ForceAtlas2Layout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULTS_LAYOUT_OPTIONS$4","ForceAtlas2Layout","BaseLayoutWithIterations","options","__awaiter","merged","width","height","prune","center","n","applySingleNodeLayout","initNodePosition","sizes","simulation","run","resolve","edges","j","source","target","sourceDegree","targetDegree","sourceNode","targetNode","nodeSize","nodeSpacing","result","nodeSizeFn","formatNodeSizeFn","node","Simulation","_a","_b","barnesHut","maxIteration","kr","kg","auto","normalizeViewport","iterations","id","position"],"mappings":";;;;;;;AASA,MAAMA,IAA4B;AAAA,EAC9B,UAAU;AAAA,EACV,aAAa;AAAA,EACb,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,MAAM;AAAA,EACN,gBAAgB;AAAA,EAChB,cAAc;AAAA,EACd,cAAc;AAAA,EACd,IAAI;AAAA,EACJ,OAAO;AAAA,EACP,KAAK;AACT;AACA,MAAMC,UAA0BC,EAAyB;AAAA,EACrD,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK,gBACV,KAAK,aAAa;AAAA,EACtB;AAAA,EACA,oBAAoB;AAChB,WAAOF;AAAA,EACX;AAAA,EACA,OAAOG,GAAS;AACZ,WAAOC,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAMC,IAAS,KAAK,aAAaF,CAAO,GAClC,EAAE,OAAAG,GAAO,QAAAC,GAAQ,OAAAC,GAAO,QAAAC,EAAM,IAAKJ,GACnCK,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAI,CAACA,KAAKA,MAAM;AACZ,eAAOC,EAAsB,KAAK,OAAOF,CAAM;AAEnD,MAAAG,EAAiB,KAAK,OAAON,GAAOC,CAAM;AAC1C,YAAMM,IAAQ,KAAK,SAASR,EAAO,UAAUA,EAAO,WAAW,GACzDS,IAAa,KAAK,cAAa;AACrC,MAAAA,EAAW,KAAK,KAAK,OAAOD,CAAK,GACjCC,EAAW,WAAWT,CAAM,GAC5BS,EAAW,QAAO;AAClB,YAAMC,IAAM,MAAM,IAAI,QAAQ,CAACC,MAAY;AACvC,QAAAF,EAAW,GAAG,OAAOE,CAAO;AAAA,MAChC,CAAC;AACD,UAAI,CAACR;AACD,eAAOO,EAAG;AAGd,UAFA,MAAMA,EAAG,GAELP,GAAO;AACP,cAAMS,IAAQ,KAAK,MAAM,MAAK;AAC9B,iBAASC,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK,GAAG;AACtC,gBAAM,EAAE,QAAAC,GAAQ,QAAAC,MAAWH,EAAMC,CAAC,GAC5BG,IAAe,KAAK,MAAM,OAAOF,CAAM,GACvCG,IAAe,KAAK,MAAM,OAAOF,CAAM,GACvCG,IAAa,KAAK,MAAM,KAAKJ,CAAM,GACnCK,IAAa,KAAK,MAAM,KAAKJ,CAAM;AACzC,UAAIC,KAAgB,KAChBE,EAAW,IAAIC,EAAW,GAC1BD,EAAW,IAAIC,EAAW,KAErBF,KAAgB,MACrBE,EAAW,IAAID,EAAW,GAC1BC,EAAW,IAAID,EAAW;AAAA,QAElC;AACA,QAAAT,EAAW,WAAW,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIT,CAAM,GAAG,EAAE,OAAO,IAAO,WAAW,GAAK,CAAE,CAAC,GAClGS,EAAW,KAAK,GAAG;AAAA,MACvB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,SAASW,GAAUC,GAAa;AAC5B,UAAMC,IAAS,CAAA,GACTC,IAAaC,EAAiBJ,GAAUC,GAAa1B,EAA0B,UAAUA,EAA0B,WAAW;AACpI,gBAAK,MAAM,YAAY,CAAC8B,MAAS;AAC7B,MAAAH,EAAOG,EAAK,EAAE,IAAI,KAAK,IAAI,GAAGF,EAAWE,EAAK,SAAS,CAAC;AAAA,IAC5D,CAAC,GACMH;AAAA,EACX;AAAA,EACA,gBAAgB;AACZ,UAAMb,IAAa,KAAK,cAAc,IAAIiB,EAAU;AACpD,WAAK,KAAK,eACN,KAAK,aAAajB,EAAW,GAAG,QAAQ,MAAM;AAAE,UAAIkB,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,aAAa7B,IAAU,IAAI;AACvB,UAAM,EAAE,WAAA+B,GAAW,OAAA1B,GAAO,cAAA2B,GAAc,IAAAC,GAAI,IAAAC,EAAE,IAAKlC,GAC7CmC,IAAO,CAAA,GACP5B,IAAI,KAAK,MAAM,UAAS;AAC9B,WAAIwB,MAAc,UAAaxB,IAAI,QAC/B4B,EAAK,YAAY,KACjB9B,MAAU,UAAaE,IAAI,QAC3B4B,EAAK,QAAQ,KACbH,MAAiB,KAAK,CAAC3B,KACvB8B,EAAK,eAAe,KAChB5B,KAAK,OAAOA,IAAI,MAChB4B,EAAK,eAAe,MACf5B,IAAI,QACT4B,EAAK,eAAe,SAEnBH,MAAiB,KAAK3B,MAC3B8B,EAAK,eAAe,KAChB5B,KAAK,OAAOA,IAAI,MAChB4B,EAAK,eAAe,MACf5B,IAAI,QACT4B,EAAK,eAAe,OAEvBF,MACDE,EAAK,KAAK,IACN5B,IAAI,OAAOA,KAAK,MAChB4B,EAAK,KAAK,KACL5B,IAAI,QACT4B,EAAK,KAAK,KAEbD,MACDC,EAAK,KAAK,IACN5B,IAAI,OAAOA,KAAK,MAChB4B,EAAK,KAAK,KACL5B,IAAI,QACT4B,EAAK,KAAK,KAEX,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,CAAA,GAAInC,CAAO,GAAGmC,CAAI,GAAGC,EAAkBpC,CAAO,CAAC;AAAA,EACpG;AAAA,EACA,OAAO;AACH,QAAI6B;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,KAAI;AAAA,EACvE;AAAA,EACA,KAAKQ,IAAa,GAAG;AACjB,QAAIR;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,KAAKQ,CAAU;AAAA,EAClF;AAAA,EACA,UAAU;AACN,QAAIR;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,QAAO;AAAA,EAC1E;AAAA,EACA,iBAAiBS,GAAIC,GAAU;AAC3B,QAAIV;AACJ,KAACA,IAAK,KAAK,gBAAgB,QAAQA,MAAO,UAAkBA,EAAG,iBAAiBS,GAAIC,CAAQ;AAAA,EAChG;AAAA,EACA,UAAU;AACN,QAAIV;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/force-atlas2/quad-tree.js

@@ -0,0 +1,38 @@
+class i {
+  // each quadtree represents a quadrant and an aggregate body
+  // that represents all bodies inside the quadrant
+  constructor(t) {
+    this.body = null, this.quad = null, this.NW = null, this.NE = null, this.SW = null, this.SE = null, this.theta = 0.5, t != null && (this.quad = t);
+  }
+  // insert a body(node) into the tree
+  insert(t) {
+    if (this.body == null) {
+      this.body = t;
+      return;
+    }
+    this._isExternal() ? (this.quad && (this.NW = new i(this.quad.NW()), this.NE = new i(this.quad.NE()), this.SW = new i(this.quad.SW()), this.SE = new i(this.quad.SE())), this._putBody(this.body), this._putBody(t), this.body = this.body.add(t)) : (this.body = this.body.add(t), this._putBody(t));
+  }
+  // inserts bo into a quad
+  // tslint:disable-next-line
+  _putBody(t) {
+    this.quad && (t.in(this.quad.NW()) && this.NW ? this.NW.insert(t) : t.in(this.quad.NE()) && this.NE ? this.NE.insert(t) : t.in(this.quad.SW()) && this.SW ? this.SW.insert(t) : t.in(this.quad.SE()) && this.SE && this.SE.insert(t));
+  }
+  // tslint:disable-next-line
+  _isExternal() {
+    return this.NW == null && this.NE == null && this.SW == null && this.SE == null;
+  }
+  // update the forces
+  updateForce(t) {
+    if (!(this.body == null || t === this.body))
+      if (this._isExternal())
+        t.addForce(this.body);
+      else {
+        const s = this.quad ? this.quad.getLength() : 0, h = this.body.distanceTo(t);
+        s / h < this.theta ? t.addForce(this.body) : (this.NW && this.NW.updateForce(t), this.NE && this.NE.updateForce(t), this.SW && this.SW.updateForce(t), this.SE && this.SE.updateForce(t));
+      }
+  }
+}
+export {
+  i as default
+};
+//# sourceMappingURL=quad-tree.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"quad-tree.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/force-atlas2/quad-tree.js"],"sourcesContent":["/**\n * @fileOverview quadTree\n * @author shiwu.wyy@antfin.com\n */\nclass QuadTree {\n    // each quadtree represents a quadrant and an aggregate body\n    // that represents all bodies inside the quadrant\n    constructor(param) {\n        /**\n         * (aggregated) body in this quad\n         * @type  {object}\n         */\n        this.body = null;\n        /**\n         * tree representing the northwest quadrant\n         * @type  {object}\n         */\n        this.quad = null;\n        this.NW = null;\n        this.NE = null;\n        this.SW = null;\n        this.SE = null;\n        /**\n         * threshold\n         * @type  {number}\n         */\n        this.theta = 0.5;\n        if (param != null)\n            this.quad = param;\n    }\n    // insert a body(node) into the tree\n    insert(bo) {\n        // if this node does not contain a body, put the new body bo here\n        if (this.body == null) {\n            this.body = bo;\n            return;\n        }\n        // internal node\n        if (!this._isExternal()) {\n            // update mass info\n            this.body = this.body.add(bo);\n            // insert body into quadrant\n            this._putBody(bo);\n        }\n        else {\n            // external node\n            // divide this region into four children\n            if (this.quad) {\n                this.NW = new QuadTree(this.quad.NW());\n                this.NE = new QuadTree(this.quad.NE());\n                this.SW = new QuadTree(this.quad.SW());\n                this.SE = new QuadTree(this.quad.SE());\n            }\n            // insert this body and bo\n            this._putBody(this.body);\n            this._putBody(bo);\n            // update the mass info\n            this.body = this.body.add(bo);\n        }\n    }\n    // inserts bo into a quad\n    // tslint:disable-next-line\n    _putBody(bo) {\n        if (!this.quad)\n            return;\n        if (bo.in(this.quad.NW()) && this.NW)\n            this.NW.insert(bo);\n        else if (bo.in(this.quad.NE()) && this.NE)\n            this.NE.insert(bo);\n        else if (bo.in(this.quad.SW()) && this.SW)\n            this.SW.insert(bo);\n        else if (bo.in(this.quad.SE()) && this.SE)\n            this.SE.insert(bo);\n    }\n    // tslint:disable-next-line\n    _isExternal() {\n        // four children are null\n        return (this.NW == null && this.NE == null && this.SW == null && this.SE == null);\n    }\n    // update the forces\n    updateForce(bo) {\n        if (this.body == null || bo === this.body) {\n            return;\n        }\n        // if the current node is external\n        if (this._isExternal())\n            bo.addForce(this.body);\n        // internal nodes\n        else {\n            const s = this.quad ? this.quad.getLength() : 0;\n            const d = this.body.distanceTo(bo);\n            // b is far enough\n            if (s / d < this.theta)\n                bo.addForce(this.body);\n            else {\n                this.NW && this.NW.updateForce(bo);\n                this.NE && this.NE.updateForce(bo);\n                this.SW && this.SW.updateForce(bo);\n                this.SE && this.SE.updateForce(bo);\n            }\n        }\n    }\n}\n\nexport { QuadTree as default };\n//# sourceMappingURL=quad-tree.js.map\n"],"names":["QuadTree","param","bo","d"],"mappings":"AAIA,MAAMA,EAAS;AAAA;AAAA;AAAA,EAGX,YAAYC,GAAO;AAKf,SAAK,OAAO,MAKZ,KAAK,OAAO,MACZ,KAAK,KAAK,MACV,KAAK,KAAK,MACV,KAAK,KAAK,MACV,KAAK,KAAK,MAKV,KAAK,QAAQ,KACTA,KAAS,SACT,KAAK,OAAOA;AAAA,EACpB;AAAA;AAAA,EAEA,OAAOC,GAAI;AAEP,QAAI,KAAK,QAAQ,MAAM;AACnB,WAAK,OAAOA;AACZ;AAAA,IACJ;AAEA,IAAK,KAAK,iBASF,KAAK,SACL,KAAK,KAAK,IAAIF,EAAS,KAAK,KAAK,IAAI,GACrC,KAAK,KAAK,IAAIA,EAAS,KAAK,KAAK,IAAI,GACrC,KAAK,KAAK,IAAIA,EAAS,KAAK,KAAK,IAAI,GACrC,KAAK,KAAK,IAAIA,EAAS,KAAK,KAAK,IAAI,IAGzC,KAAK,SAAS,KAAK,IAAI,GACvB,KAAK,SAASE,CAAE,GAEhB,KAAK,OAAO,KAAK,KAAK,IAAIA,CAAE,MAjB5B,KAAK,OAAO,KAAK,KAAK,IAAIA,CAAE,GAE5B,KAAK,SAASA,CAAE;AAAA,EAiBxB;AAAA;AAAA;AAAA,EAGA,SAASA,GAAI;AACT,IAAK,KAAK,SAENA,EAAG,GAAG,KAAK,KAAK,GAAE,CAAE,KAAK,KAAK,KAC9B,KAAK,GAAG,OAAOA,CAAE,IACZA,EAAG,GAAG,KAAK,KAAK,GAAE,CAAE,KAAK,KAAK,KACnC,KAAK,GAAG,OAAOA,CAAE,IACZA,EAAG,GAAG,KAAK,KAAK,GAAE,CAAE,KAAK,KAAK,KACnC,KAAK,GAAG,OAAOA,CAAE,IACZA,EAAG,GAAG,KAAK,KAAK,GAAE,CAAE,KAAK,KAAK,MACnC,KAAK,GAAG,OAAOA,CAAE;AAAA,EACzB;AAAA;AAAA,EAEA,cAAc;AAEV,WAAQ,KAAK,MAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK,MAAM,QAAQ,KAAK,MAAM;AAAA,EAChF;AAAA;AAAA,EAEA,YAAYA,GAAI;AACZ,QAAI,OAAK,QAAQ,QAAQA,MAAO,KAAK;AAIrC,UAAI,KAAK,YAAW;AAChB,QAAAA,EAAG,SAAS,KAAK,IAAI;AAAA,WAEpB;AACD,cAAM,IAAI,KAAK,OAAO,KAAK,KAAK,UAAS,IAAK,GACxCC,IAAI,KAAK,KAAK,WAAWD,CAAE;AAEjC,QAAI,IAAIC,IAAI,KAAK,QACbD,EAAG,SAAS,KAAK,IAAI,KAErB,KAAK,MAAM,KAAK,GAAG,YAAYA,CAAE,GACjC,KAAK,MAAM,KAAK,GAAG,YAAYA,CAAE,GACjC,KAAK,MAAM,KAAK,GAAG,YAAYA,CAAE,GACjC,KAAK,MAAM,KAAK,GAAG,YAAYA,CAAE;AAAA,MAEzC;AAAA,EACJ;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,56 @@
+class h {
+  constructor(t) {
+    this.xmid = t.xmid, this.ymid = t.ymid, this.length = t.length, this.massCenter = t.massCenter || [0, 0], this.mass = t.mass || 1;
+  }
+  getLength() {
+    return this.length;
+  }
+  contains(t, n) {
+    const s = this.length / 2;
+    return t <= this.xmid + s && t >= this.xmid - s && n <= this.ymid + s && n >= this.ymid - s;
+  }
+  // northwest quadrant
+  // tslint:disable-next-line
+  NW() {
+    const t = this.xmid - this.length / 4, n = this.ymid + this.length / 4, s = this.length / 2, i = {
+      xmid: t,
+      ymid: n,
+      length: s
+    };
+    return new h(i);
+  }
+  // northeast
+  // tslint:disable-next-line
+  NE() {
+    const t = this.xmid + this.length / 4, n = this.ymid + this.length / 4, s = this.length / 2, i = {
+      xmid: t,
+      ymid: n,
+      length: s
+    };
+    return new h(i);
+  }
+  // southwest
+  // tslint:disable-next-line
+  SW() {
+    const t = this.xmid - this.length / 4, n = this.ymid - this.length / 4, s = this.length / 2, i = {
+      xmid: t,
+      ymid: n,
+      length: s
+    };
+    return new h(i);
+  }
+  // southeast
+  // tslint:disable-next-line
+  SE() {
+    const t = this.xmid + this.length / 4, n = this.ymid - this.length / 4, s = this.length / 2, i = {
+      xmid: t,
+      ymid: n,
+      length: s
+    };
+    return new h(i);
+  }
+}
+export {
+  h as default
+};
+//# sourceMappingURL=quad.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"quad.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/force-atlas2/quad.js"],"sourcesContent":["class Quad {\n    constructor(params) {\n        /**\n         * the center position of this quad\n         * @type  {number}\n         */\n        this.xmid = params.xmid;\n        /**\n         * the center position of this quad\n         * @type  {number}\n         */\n        this.ymid = params.ymid;\n        /**\n         * the length of this quad\n         * @type  {number}\n         */\n        this.length = params.length;\n        /**\n         * the mass center of this quad\n         * @type  {number}\n         */\n        this.massCenter = params.massCenter || [0, 0];\n        /**\n         * the mass of this quad\n         * @type  {number}\n         */\n        this.mass = params.mass || 1;\n    }\n    getLength() {\n        return this.length;\n    }\n    contains(x, y) {\n        const halfLen = this.length / 2;\n        return (x <= this.xmid + halfLen &&\n            x >= this.xmid - halfLen &&\n            y <= this.ymid + halfLen &&\n            y >= this.ymid - halfLen);\n    }\n    // northwest quadrant\n    // tslint:disable-next-line\n    NW() {\n        const x = this.xmid - this.length / 4;\n        const y = this.ymid + this.length / 4;\n        const len = this.length / 2;\n        const params = {\n            xmid: x,\n            ymid: y,\n            length: len,\n        };\n        const NW = new Quad(params);\n        return NW;\n    }\n    // northeast\n    // tslint:disable-next-line\n    NE() {\n        const x = this.xmid + this.length / 4;\n        const y = this.ymid + this.length / 4;\n        const len = this.length / 2;\n        const params = {\n            xmid: x,\n            ymid: y,\n            length: len,\n        };\n        const NE = new Quad(params);\n        return NE;\n    }\n    // southwest\n    // tslint:disable-next-line\n    SW() {\n        const x = this.xmid - this.length / 4;\n        const y = this.ymid - this.length / 4;\n        const len = this.length / 2;\n        const params = {\n            xmid: x,\n            ymid: y,\n            length: len,\n        };\n        const SW = new Quad(params);\n        return SW;\n    }\n    // southeast\n    // tslint:disable-next-line\n    SE() {\n        const x = this.xmid + this.length / 4;\n        const y = this.ymid - this.length / 4;\n        const len = this.length / 2;\n        const params = {\n            xmid: x,\n            ymid: y,\n            length: len,\n        };\n        const SE = new Quad(params);\n        return SE;\n    }\n}\n\nexport { Quad as default };\n//# sourceMappingURL=quad.js.map\n"],"names":["Quad","params","x","y","halfLen","len"],"mappings":"AAAA,MAAMA,EAAK;AAAA,EACP,YAAYC,GAAQ;AAKhB,SAAK,OAAOA,EAAO,MAKnB,KAAK,OAAOA,EAAO,MAKnB,KAAK,SAASA,EAAO,QAKrB,KAAK,aAAaA,EAAO,cAAc,CAAC,GAAG,CAAC,GAK5C,KAAK,OAAOA,EAAO,QAAQ;AAAA,EAC/B;AAAA,EACA,YAAY;AACR,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,SAASC,GAAGC,GAAG;AACX,UAAMC,IAAU,KAAK,SAAS;AAC9B,WAAQF,KAAK,KAAK,OAAOE,KACrBF,KAAK,KAAK,OAAOE,KACjBD,KAAK,KAAK,OAAOC,KACjBD,KAAK,KAAK,OAAOC;AAAA,EACzB;AAAA;AAAA;AAAA,EAGA,KAAK;AACD,UAAMF,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BE,IAAM,KAAK,SAAS,GACpBJ,IAAS;AAAA,MACX,MAAMC;AAAA,MACN,MAAMC;AAAA,MACN,QAAQE;AAAA,IACpB;AAEQ,WADW,IAAIL,EAAKC,CAAM;AAAA,EAE9B;AAAA;AAAA;AAAA,EAGA,KAAK;AACD,UAAMC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BE,IAAM,KAAK,SAAS,GACpBJ,IAAS;AAAA,MACX,MAAMC;AAAA,MACN,MAAMC;AAAA,MACN,QAAQE;AAAA,IACpB;AAEQ,WADW,IAAIL,EAAKC,CAAM;AAAA,EAE9B;AAAA;AAAA;AAAA,EAGA,KAAK;AACD,UAAMC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BE,IAAM,KAAK,SAAS,GACpBJ,IAAS;AAAA,MACX,MAAMC;AAAA,MACN,MAAMC;AAAA,MACN,QAAQE;AAAA,IACpB;AAEQ,WADW,IAAIL,EAAKC,CAAM;AAAA,EAE9B;AAAA;AAAA;AAAA,EAGA,KAAK;AACD,UAAMC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BC,IAAI,KAAK,OAAO,KAAK,SAAS,GAC9BE,IAAM,KAAK,SAAS,GACpBJ,IAAS;AAAA,MACX,MAAMC;AAAA,MACN,MAAMC;AAAA,MACN,QAAQE;AAAA,IACpB;AAEQ,WADW,IAAIL,EAAKC,CAAM;AAAA,EAE9B;AACJ;","x_google_ignoreList":[0]}