@hkyhy/marsun-components-core 0.1.113 → 0.1.114

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/manyBody.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"manyBody.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/manyBody.js"],"sourcesContent":["import constant from './constant.js';\nimport jiggle from './jiggle.js';\nimport { x, y, z } from './simulation.js';\nimport binarytree from '../../d3-binarytree/src/binarytree.js';\nimport quadtree from '../../d3-quadtree/src/quadtree.js';\nimport octree from '../../d3-octree/src/octree.js';\n\nfunction forceManyBody() {\n  var nodes,\n      nDim,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i,\n        n = nodes.length,\n        tree =\n            (nDim === 1 ? binarytree(nodes, x)\n            :(nDim === 2 ? quadtree(nodes, x, y)\n            :(nDim === 3 ? octree(nodes, x, y, z)\n            :null\n        ))).visitAfter(accumulate);\n\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(treeNode) {\n    var strength = 0, q, c, weight = 0, x, y, z, i;\n    var numChildren = treeNode.length;\n\n    // For internal nodes, accumulate forces from children.\n    if (numChildren) {\n      for (x = y = z = i = 0; i < numChildren; ++i) {\n        if ((q = treeNode[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * (q.x || 0), y += c * (q.y || 0), z += c * (q.z || 0);\n        }\n      }\n      strength *= Math.sqrt(4 / numChildren); // scale accumulated strength according to number of dimensions\n\n      treeNode.x = x / weight;\n      if (nDim > 1) { treeNode.y = y / weight; }\n      if (nDim > 2) { treeNode.z = z / weight; }\n    }\n\n    // For leaf nodes, accumulate forces from coincident nodes.\n    else {\n      q = treeNode;\n      q.x = q.data.x;\n      if (nDim > 1) { q.y = q.data.y; }\n      if (nDim > 2) { q.z = q.data.z; }\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    treeNode.value = strength;\n  }\n\n  function apply(treeNode, x1, arg1, arg2, arg3) {\n    if (!treeNode.value) return true;\n    var x2 = [arg1, arg2, arg3][nDim-1];\n\n    var x = treeNode.x - node.x,\n        y = (nDim > 1 ? treeNode.y - node.y : 0),\n        z = (nDim > 2 ? treeNode.z - node.z : 0),\n        w = x2 - x1,\n        l = x * x + y * y + z * z;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (nDim > 1 && y === 0) y = jiggle(random), l += y * y;\n        if (nDim > 2 && z === 0) z = jiggle(random), l += z * z;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * treeNode.value * alpha / l;\n        if (nDim > 1) { node.vy += y * treeNode.value * alpha / l; }\n        if (nDim > 2) { node.vz += z * treeNode.value * alpha / l; }\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (treeNode.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (treeNode.data !== node || treeNode.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (nDim > 1 && y === 0) y = jiggle(random), l += y * y;\n      if (nDim > 2 && z === 0) z = jiggle(random), l += z * z;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (treeNode.data !== node) {\n      w = strengths[treeNode.data.index] * alpha / l;\n      node.vx += x * w;\n      if (nDim > 1) { node.vy += y * w; }\n      if (nDim > 2) { node.vz += z * w; }\n    } while (treeNode = treeNode.next);\n  }\n\n  force.initialize = function(_nodes, ...args) {\n    nodes = _nodes;\n    random = args.find(arg => typeof arg === 'function') || Math.random;\n    nDim = args.find(arg => [1, 2, 3].includes(arg)) || 2;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n\nexport { forceManyBody as default };\n//# sourceMappingURL=manyBody.js.map\n"],"names":["forceManyBody","nodes","nDim","node","random","alpha","strength","constant","strengths","distanceMin2","distanceMax2","theta2","force","_","i","n","tree","binarytree","x","quadtree","y","octree","z","accumulate","apply","initialize","treeNode","q","c","weight","numChildren","x1","arg1","arg2","arg3","x2","w","l","jiggle","_nodes","args","arg"],"mappings":";;;;;;AAOA,SAASA,IAAgB;AACvB,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,IAAWC,EAAS,GAAG,GACvBC,GACAC,IAAe,GACfC,IAAe,OACfC,IAAS;AAEb,WAASC,EAAMC,GAAG;AAChB,QAAIC,GACAC,IAAId,EAAM,QACVe,KACKd,MAAS,IAAIe,EAAWhB,GAAOiB,CAAC,IAC/BhB,MAAS,IAAIiB,EAASlB,GAAOiB,GAAGE,CAAC,IACjClB,MAAS,IAAImB,EAAOpB,GAAOiB,GAAGE,GAAGE,CAAC,IACnC,MACD,WAAWC,CAAU;AAE7B,SAAKlB,IAAQQ,GAAGC,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAX,IAAOF,EAAMa,CAAC,GAAGE,EAAK,MAAMQ,CAAK;AAAA,EACtE;AAEA,WAASC,IAAa;AACpB,QAAKxB,GACL;AAAA,UAAIa,GAAGC,IAAId,EAAM,QAAQE;AAEzB,WADAK,IAAY,IAAI,MAAMO,CAAC,GAClBD,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAX,IAAOF,EAAMa,CAAC,GAAGN,EAAUL,EAAK,KAAK,IAAI,CAACG,EAASH,GAAMW,GAAGb,CAAK;AAAA;AAAA,EAC3F;AAEA,WAASsB,EAAWG,GAAU;AAC5B,QAAIpB,IAAW,GAAGqB,GAAGC,GAAGC,IAAS,GAAGX,GAAGE,GAAGE,GAAGR,GACzCgB,IAAcJ,EAAS;AAG3B,QAAII,GAAa;AACf,WAAKZ,IAAIE,IAAIE,IAAIR,IAAI,GAAGA,IAAIgB,GAAa,EAAEhB;AACzC,SAAKa,IAAID,EAASZ,CAAC,OAAOc,IAAI,KAAK,IAAID,EAAE,KAAK,OAC5CrB,KAAYqB,EAAE,OAAOE,KAAUD,GAAGV,KAAKU,KAAKD,EAAE,KAAK,IAAIP,KAAKQ,KAAKD,EAAE,KAAK,IAAIL,KAAKM,KAAKD,EAAE,KAAK;AAGjG,MAAArB,KAAY,KAAK,KAAK,IAAIwB,CAAW,GAErCJ,EAAS,IAAIR,IAAIW,GACb3B,IAAO,MAAKwB,EAAS,IAAIN,IAAIS,IAC7B3B,IAAO,MAAKwB,EAAS,IAAIJ,IAAIO;AAAA,IACnC,OAGK;AACH,MAAAF,IAAID,GACJC,EAAE,IAAIA,EAAE,KAAK,GACTzB,IAAO,MAAKyB,EAAE,IAAIA,EAAE,KAAK,IACzBzB,IAAO,MAAKyB,EAAE,IAAIA,EAAE,KAAK;AAC7B;AAAG,QAAArB,KAAYE,EAAUmB,EAAE,KAAK,KAAK;AAAA,aAC9BA,IAAIA,EAAE;AAAA,IACf;AAEA,IAAAD,EAAS,QAAQpB;AAAA,EACnB;AAEA,WAASkB,EAAME,GAAUK,GAAIC,GAAMC,GAAMC,GAAM;AAC7C,QAAI,CAACR,EAAS,MAAO,QAAO;AAC5B,QAAIS,IAAK,CAACH,GAAMC,GAAMC,CAAI,EAAEhC,IAAK,CAAC,GAE9BgB,IAAIQ,EAAS,IAAIvB,EAAK,GACtBiB,IAAKlB,IAAO,IAAIwB,EAAS,IAAIvB,EAAK,IAAI,GACtCmB,IAAKpB,IAAO,IAAIwB,EAAS,IAAIvB,EAAK,IAAI,GACtCiC,IAAID,IAAKJ,GACTM,IAAInB,IAAIA,IAAIE,IAAIA,IAAIE,IAAIA;AAI5B,QAAIc,IAAIA,IAAIzB,IAAS0B;AACnB,aAAIA,IAAI3B,MACFQ,MAAM,MAAGA,IAAIoB,EAAOlC,CAAM,GAAGiC,KAAKnB,IAAIA,IACtChB,IAAO,KAAKkB,MAAM,MAAGA,IAAIkB,EAAOlC,CAAM,GAAGiC,KAAKjB,IAAIA,IAClDlB,IAAO,KAAKoB,MAAM,MAAGA,IAAIgB,EAAOlC,CAAM,GAAGiC,KAAKf,IAAIA,IAClDe,IAAI5B,MAAc4B,IAAI,KAAK,KAAK5B,IAAe4B,CAAC,IACpDlC,EAAK,MAAMe,IAAIQ,EAAS,QAAQrB,IAAQgC,GACpCnC,IAAO,MAAKC,EAAK,MAAMiB,IAAIM,EAAS,QAAQrB,IAAQgC,IACpDnC,IAAO,MAAKC,EAAK,MAAMmB,IAAII,EAAS,QAAQrB,IAAQgC,KAEnD;AAIJ,QAAIX,EAAS,UAAUW,KAAK3B,EAAc;AAG/C,KAAIgB,EAAS,SAASvB,KAAQuB,EAAS,UACjCR,MAAM,MAAGA,IAAIoB,EAAOlC,CAAM,GAAGiC,KAAKnB,IAAIA,IACtChB,IAAO,KAAKkB,MAAM,MAAGA,IAAIkB,EAAOlC,CAAM,GAAGiC,KAAKjB,IAAIA,IAClDlB,IAAO,KAAKoB,MAAM,MAAGA,IAAIgB,EAAOlC,CAAM,GAAGiC,KAAKf,IAAIA,IAClDe,IAAI5B,MAAc4B,IAAI,KAAK,KAAK5B,IAAe4B,CAAC;AAGtD;AAAG,MAAIX,EAAS,SAASvB,MACvBiC,IAAI5B,EAAUkB,EAAS,KAAK,KAAK,IAAIrB,IAAQgC,GAC7ClC,EAAK,MAAMe,IAAIkB,GACXlC,IAAO,MAAKC,EAAK,MAAMiB,IAAIgB,IAC3BlC,IAAO,MAAKC,EAAK,MAAMmB,IAAIc;AAAA,WACxBV,IAAWA,EAAS;AAAA,EAC/B;AAEA,SAAAd,EAAM,aAAa,SAAS2B,MAAWC,GAAM;AAC3C,IAAAvC,IAAQsC,GACRnC,IAASoC,EAAK,KAAK,CAAAC,MAAO,OAAOA,KAAQ,UAAU,KAAK,KAAK,QAC7DvC,IAAOsC,EAAK,KAAK,CAAAC,MAAO,CAAC,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG,CAAC,KAAK,GACpDhB,EAAU;AAAA,EACZ,GAEAb,EAAM,WAAW,SAASC,GAAG;AAC3B,WAAO,UAAU,UAAUP,IAAW,OAAOO,KAAM,aAAaA,IAAIN,EAAS,CAACM,CAAC,GAAGY,EAAU,GAAIb,KAASN;AAAA,EAC3G,GAEAM,EAAM,cAAc,SAASC,GAAG;AAC9B,WAAO,UAAU,UAAUJ,IAAeI,IAAIA,GAAGD,KAAS,KAAK,KAAKH,CAAY;AAAA,EAClF,GAEAG,EAAM,cAAc,SAASC,GAAG;AAC9B,WAAO,UAAU,UAAUH,IAAeG,IAAIA,GAAGD,KAAS,KAAK,KAAKF,CAAY;AAAA,EAClF,GAEAE,EAAM,QAAQ,SAASC,GAAG;AACxB,WAAO,UAAU,UAAUF,IAASE,IAAIA,GAAGD,KAAS,KAAK,KAAKD,CAAM;AAAA,EACtE,GAEOC;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/radial.js

@@ -0,0 +1,35 @@
+import c from "./constant.js";
+function D(f, u, o, l) {
+  var r, g, s = c(0.1), h, a;
+  typeof f != "function" && (f = c(+f)), u == null && (u = 0), o == null && (o = 0), l == null && (l = 0);
+  function t(n) {
+    for (var e = 0, v = r.length; e < v; ++e) {
+      var i = r[e], p = i.x - u || 1e-6, w = (i.y || 0) - o || 1e-6, y = (i.z || 0) - l || 1e-6, N = Math.sqrt(p * p + w * w + y * y), A = (a[e] - N) * h[e] * n / N;
+      i.vx += p * A, g > 1 && (i.vy += w * A), g > 2 && (i.vz += y * A);
+    }
+  }
+  function m() {
+    if (r) {
+      var n, e = r.length;
+      for (h = new Array(e), a = new Array(e), n = 0; n < e; ++n)
+        a[n] = +f(r[n], n, r), h[n] = isNaN(a[n]) ? 0 : +s(r[n], n, r);
+    }
+  }
+  return t.initialize = function(n, ...e) {
+    r = n, g = e.find((v) => [1, 2, 3].includes(v)) || 2, m();
+  }, t.strength = function(n) {
+    return arguments.length ? (s = typeof n == "function" ? n : c(+n), m(), t) : s;
+  }, t.radius = function(n) {
+    return arguments.length ? (f = typeof n == "function" ? n : c(+n), m(), t) : f;
+  }, t.x = function(n) {
+    return arguments.length ? (u = +n, t) : u;
+  }, t.y = function(n) {
+    return arguments.length ? (o = +n, t) : o;
+  }, t.z = function(n) {
+    return arguments.length ? (l = +n, t) : l;
+  }, t;
+}
+export {
+  D as default
+};
+//# sourceMappingURL=radial.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/radial.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"radial.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/radial.js"],"sourcesContent":["import constant from './constant.js';\n\nfunction forceRadial(radius, x, y, z) {\n  var nodes,\n      nDim,\n      strength = constant(0.1),\n      strengths,\n      radiuses;\n\n  if (typeof radius !== \"function\") radius = constant(+radius);\n  if (x == null) x = 0;\n  if (y == null) y = 0;\n  if (z == null) z = 0;\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length; i < n; ++i) {\n      var node = nodes[i],\n          dx = node.x - x || 1e-6,\n          dy = (node.y || 0) - y || 1e-6,\n          dz = (node.z || 0) - z || 1e-6,\n          r = Math.sqrt(dx * dx + dy * dy + dz * dz),\n          k = (radiuses[i] - r) * strengths[i] * alpha / r;\n      node.vx += dx * k;\n      if (nDim>1) { node.vy += dy * k; }\n      if (nDim>2) { node.vz += dz * k; }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    radiuses = new Array(n);\n    for (i = 0; i < n; ++i) {\n      radiuses[i] = +radius(nodes[i], i, nodes);\n      strengths[i] = isNaN(radiuses[i]) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(initNodes, ...args) {\n    nodes = initNodes;\n    nDim = args.find(arg => [1, 2, 3].includes(arg)) || 2;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.radius = function(_) {\n    return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = +_, force) : x;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = +_, force) : y;\n  };\n\n  force.z = function(_) {\n    return arguments.length ? (z = +_, force) : z;\n  };\n\n  return force;\n}\n\nexport { forceRadial as default };\n//# sourceMappingURL=radial.js.map\n"],"names":["forceRadial","radius","x","y","z","nodes","nDim","strength","constant","strengths","radiuses","force","alpha","i","n","node","dx","dy","dz","r","k","initialize","initNodes","args","arg","_"],"mappings":";AAEA,SAASA,EAAYC,GAAQC,GAAGC,GAAGC,GAAG;AACpC,MAAIC,GACAC,GACAC,IAAWC,EAAS,GAAG,GACvBC,GACAC;AAEJ,EAAI,OAAOT,KAAW,eAAYA,IAASO,EAAS,CAACP,CAAM,IACvDC,KAAK,SAAMA,IAAI,IACfC,KAAK,SAAMA,IAAI,IACfC,KAAK,SAAMA,IAAI;AAEnB,WAASO,EAAMC,GAAO;AACpB,aAASC,IAAI,GAAGC,IAAIT,EAAM,QAAQQ,IAAIC,GAAG,EAAED,GAAG;AAC5C,UAAIE,IAAOV,EAAMQ,CAAC,GACdG,IAAKD,EAAK,IAAIb,KAAK,MACnBe,KAAMF,EAAK,KAAK,KAAKZ,KAAK,MAC1Be,KAAMH,EAAK,KAAK,KAAKX,KAAK,MAC1Be,IAAI,KAAK,KAAKH,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,CAAE,GACzCE,KAAKV,EAASG,CAAC,IAAIM,KAAKV,EAAUI,CAAC,IAAID,IAAQO;AACnD,MAAAJ,EAAK,MAAMC,IAAKI,GACZd,IAAK,MAAKS,EAAK,MAAME,IAAKG,IAC1Bd,IAAK,MAAKS,EAAK,MAAMG,IAAKE;AAAA,IAChC;AAAA,EACF;AAEA,WAASC,IAAa;AACpB,QAAKhB,GACL;AAAA,UAAIQ,GAAGC,IAAIT,EAAM;AAGjB,WAFAI,IAAY,IAAI,MAAMK,CAAC,GACvBJ,IAAW,IAAI,MAAMI,CAAC,GACjBD,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAH,EAASG,CAAC,IAAI,CAACZ,EAAOI,EAAMQ,CAAC,GAAGA,GAAGR,CAAK,GACxCI,EAAUI,CAAC,IAAI,MAAMH,EAASG,CAAC,CAAC,IAAI,IAAI,CAACN,EAASF,EAAMQ,CAAC,GAAGA,GAAGR,CAAK;AAAA;AAAA,EAExE;AAEA,SAAAM,EAAM,aAAa,SAASW,MAAcC,GAAM;AAC9C,IAAAlB,IAAQiB,GACRhB,IAAOiB,EAAK,KAAK,CAAAC,MAAO,CAAC,GAAG,GAAG,CAAC,EAAE,SAASA,CAAG,CAAC,KAAK,GACpDH,EAAU;AAAA,EACZ,GAEAV,EAAM,WAAW,SAASc,GAAG;AAC3B,WAAO,UAAU,UAAUlB,IAAW,OAAOkB,KAAM,aAAaA,IAAIjB,EAAS,CAACiB,CAAC,GAAGJ,EAAU,GAAIV,KAASJ;AAAA,EAC3G,GAEAI,EAAM,SAAS,SAASc,GAAG;AACzB,WAAO,UAAU,UAAUxB,IAAS,OAAOwB,KAAM,aAAaA,IAAIjB,EAAS,CAACiB,CAAC,GAAGJ,EAAU,GAAIV,KAASV;AAAA,EACzG,GAEAU,EAAM,IAAI,SAASc,GAAG;AACpB,WAAO,UAAU,UAAUvB,IAAI,CAACuB,GAAGd,KAAST;AAAA,EAC9C,GAEAS,EAAM,IAAI,SAASc,GAAG;AACpB,WAAO,UAAU,UAAUtB,IAAI,CAACsB,GAAGd,KAASR;AAAA,EAC9C,GAEAQ,EAAM,IAAI,SAASc,GAAG;AACpB,WAAO,UAAU,UAAUrB,IAAI,CAACqB,GAAGd,KAASP;AAAA,EAC9C,GAEOO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/simulation.js

@@ -0,0 +1,96 @@
+import T from "./lcg.js";
+import { timer as b } from "../../d3-timer/src/timer.js";
+import F from "../../d3-dispatch/src/dispatch.js";
+var P = 3;
+function G(a) {
+  return a.x;
+}
+function H(a) {
+  return a.y;
+}
+function J(a) {
+  return a.z;
+}
+var O = 10, X = Math.PI * (3 - Math.sqrt(5)), Y = Math.PI * 20 / (9 + Math.sqrt(221));
+function K(a, o) {
+  o = o || 2;
+  var r = Math.min(P, Math.max(1, Math.round(o))), f, h = 1, g = 1e-3, x = 1 - Math.pow(g, 1 / 300), p = 0, s = 0.6, c = /* @__PURE__ */ new Map(), m = b(S), v = F("tick", "end"), z = T();
+  a == null && (a = []);
+  function S() {
+    k(), v.call("tick", f), h < g && (m.stop(), v.call("end", f));
+  }
+  function k(t) {
+    var u, i = a.length, n;
+    t === void 0 && (t = 1);
+    for (var l = 0; l < t; ++l)
+      for (h += (p - h) * x, c.forEach(function(e) {
+        e(h);
+      }), u = 0; u < i; ++u)
+        n = a[u], n.fx == null ? n.x += n.vx *= s : (n.x = n.fx, n.vx = 0), r > 1 && (n.fy == null ? n.y += n.vy *= s : (n.y = n.fy, n.vy = 0)), r > 2 && (n.fz == null ? n.z += n.vz *= s : (n.z = n.fz, n.vz = 0));
+    return f;
+  }
+  function q() {
+    for (var t = 0, u = a.length, i; t < u; ++t) {
+      if (i = a[t], i.index = t, i.fx != null && (i.x = i.fx), i.fy != null && (i.y = i.fy), i.fz != null && (i.z = i.fz), isNaN(i.x) || r > 1 && isNaN(i.y) || r > 2 && isNaN(i.z)) {
+        var n = O * (r > 2 ? Math.cbrt(0.5 + t) : r > 1 ? Math.sqrt(0.5 + t) : t), l = t * X, e = t * Y;
+        r === 1 ? i.x = n : r === 2 ? (i.x = n * Math.cos(l), i.y = n * Math.sin(l)) : (i.x = n * Math.sin(l) * Math.cos(e), i.y = n * Math.cos(l), i.z = n * Math.sin(l) * Math.sin(e));
+      }
+      (isNaN(i.vx) || r > 1 && isNaN(i.vy) || r > 2 && isNaN(i.vz)) && (i.vx = 0, r > 1 && (i.vy = 0), r > 2 && (i.vz = 0));
+    }
+  }
+  function M(t) {
+    return t.initialize && t.initialize(a, z, r), t;
+  }
+  return q(), f = {
+    tick: k,
+    restart: function() {
+      return m.restart(S), f;
+    },
+    stop: function() {
+      return m.stop(), f;
+    },
+    numDimensions: function(t) {
+      return arguments.length ? (r = Math.min(P, Math.max(1, Math.round(t))), c.forEach(M), f) : r;
+    },
+    nodes: function(t) {
+      return arguments.length ? (a = t, q(), c.forEach(M), f) : a;
+    },
+    alpha: function(t) {
+      return arguments.length ? (h = +t, f) : h;
+    },
+    alphaMin: function(t) {
+      return arguments.length ? (g = +t, f) : g;
+    },
+    alphaDecay: function(t) {
+      return arguments.length ? (x = +t, f) : +x;
+    },
+    alphaTarget: function(t) {
+      return arguments.length ? (p = +t, f) : p;
+    },
+    velocityDecay: function(t) {
+      return arguments.length ? (s = 1 - t, f) : 1 - s;
+    },
+    randomSource: function(t) {
+      return arguments.length ? (z = t, c.forEach(M), f) : z;
+    },
+    force: function(t, u) {
+      return arguments.length > 1 ? (u == null ? c.delete(t) : c.set(t, M(u)), f) : c.get(t);
+    },
+    find: function() {
+      var t = Array.prototype.slice.call(arguments), u = t.shift() || 0, i = (r > 1 ? t.shift() : null) || 0, n = (r > 2 ? t.shift() : null) || 0, l = t.shift() || 1 / 0, e = 0, R = a.length, N, D, E, I, y, w;
+      for (l *= l, e = 0; e < R; ++e)
+        y = a[e], N = u - y.x, D = i - (y.y || 0), E = n - (y.z || 0), I = N * N + D * D + E * E, I < l && (w = y, l = I);
+      return w;
+    },
+    on: function(t, u) {
+      return arguments.length > 1 ? (v.on(t, u), f) : v.on(t);
+    }
+  };
+}
+export {
+  K as default,
+  G as x,
+  H as y,
+  J as z
+};
+//# sourceMappingURL=simulation.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/simulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"simulation.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/simulation.js"],"sourcesContent":["import lcg from './lcg.js';\nimport { timer } from '../../d3-timer/src/timer.js';\nimport dispatch from '../../d3-dispatch/src/dispatch.js';\n\nvar MAX_DIMENSIONS = 3;\n\nfunction x(d) {\n  return d.x;\n}\n\nfunction y(d) {\n  return d.y;\n}\n\nfunction z(d) {\n  return d.z;\n}\n\nvar initialRadius = 10,\n    initialAngleRoll = Math.PI * (3 - Math.sqrt(5)), // Golden ratio angle\n    initialAngleYaw = Math.PI * 20 / (9 + Math.sqrt(221)); // Markov irrational number\n\nfunction forceSimulation(nodes, numDimensions) {\n  numDimensions = numDimensions || 2;\n\n  var nDim = Math.min(MAX_DIMENSIONS, Math.max(1, Math.round(numDimensions))),\n      simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function (force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (nDim > 1) {\n          if (node.fy == null) node.y += node.vy *= velocityDecay;\n          else node.y = node.fy, node.vy = 0;\n        }\n        if (nDim > 2) {\n          if (node.fz == null) node.z += node.vz *= velocityDecay;\n          else node.z = node.fz, node.vz = 0;\n        }\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (node.fz != null) node.z = node.fz;\n      if (isNaN(node.x) || (nDim > 1 && isNaN(node.y)) || (nDim > 2 && isNaN(node.z))) {\n        var radius = initialRadius * (nDim > 2 ? Math.cbrt(0.5 + i) : (nDim > 1 ? Math.sqrt(0.5 + i) : i)),\n          rollAngle = i * initialAngleRoll,\n          yawAngle = i * initialAngleYaw;\n\n        if (nDim === 1) {\n          node.x = radius;\n        } else if (nDim === 2) {\n          node.x = radius * Math.cos(rollAngle);\n          node.y = radius * Math.sin(rollAngle);\n        } else { // 3 dimensions: use spherical distribution along 2 irrational number angles\n          node.x = radius * Math.sin(rollAngle) * Math.cos(yawAngle);\n          node.y = radius * Math.cos(rollAngle);\n          node.z = radius * Math.sin(rollAngle) * Math.sin(yawAngle);\n        }\n      }\n      if (isNaN(node.vx) || (nDim > 1 && isNaN(node.vy)) || (nDim > 2 && isNaN(node.vz))) {\n        node.vx = 0;\n        if (nDim > 1) { node.vy = 0; }\n        if (nDim > 2) { node.vz = 0; }\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random, nDim);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    numDimensions: function(_) {\n      return arguments.length\n          ? (nDim = Math.min(MAX_DIMENSIONS, Math.max(1, Math.round(_))), forces.forEach(initializeForce), simulation)\n          : nDim;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function() {\n      var args = Array.prototype.slice.call(arguments);\n      var x = args.shift() || 0,\n          y = (nDim > 1 ? args.shift() : null) || 0,\n          z = (nDim > 2 ? args.shift() : null) || 0,\n          radius = args.shift() || Infinity;\n\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          dz,\n          d2,\n          node,\n          closest;\n\n      radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - (node.y || 0);\n        dz = z - (node.z ||0);\n        d2 = dx * dx + dy * dy + dz * dz;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n\nexport { forceSimulation as default, x, y, z };\n//# sourceMappingURL=simulation.js.map\n"],"names":["MAX_DIMENSIONS","x","d","y","z","initialRadius","initialAngleRoll","initialAngleYaw","forceSimulation","nodes","numDimensions","nDim","simulation","alpha","alphaMin","alphaDecay","alphaTarget","velocityDecay","forces","stepper","timer","step","event","dispatch","random","lcg","tick","iterations","i","n","node","k","force","initializeNodes","radius","rollAngle","yawAngle","initializeForce","_","name","args","dx","dy","dz","d2","closest"],"mappings":";;;AAIA,IAAIA,IAAiB;AAErB,SAASC,EAAEC,GAAG;AACZ,SAAOA,EAAE;AACX;AAEA,SAASC,EAAED,GAAG;AACZ,SAAOA,EAAE;AACX;AAEA,SAASE,EAAEF,GAAG;AACZ,SAAOA,EAAE;AACX;AAEA,IAAIG,IAAgB,IAChBC,IAAmB,KAAK,MAAM,IAAI,KAAK,KAAK,CAAC,IAC7CC,IAAkB,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,GAAG;AAEvD,SAASC,EAAgBC,GAAOC,GAAe;AAC7C,EAAAA,IAAgBA,KAAiB;AAEjC,MAAIC,IAAO,KAAK,IAAIX,GAAgB,KAAK,IAAI,GAAG,KAAK,MAAMU,CAAa,CAAC,CAAC,GACtEE,GACAC,IAAQ,GACRC,IAAW,MACXC,IAAa,IAAI,KAAK,IAAID,GAAU,IAAI,GAAG,GAC3CE,IAAc,GACdC,IAAgB,KAChBC,IAAS,oBAAI,IAAG,GAChBC,IAAUC,EAAMC,CAAI,GACpBC,IAAQC,EAAS,QAAQ,KAAK,GAC9BC,IAASC,EAAG;AAEhB,EAAIhB,KAAS,SAAMA,IAAQ,CAAA;AAE3B,WAASY,IAAO;AACd,IAAAK,EAAI,GACJJ,EAAM,KAAK,QAAQV,CAAU,GACzBC,IAAQC,MACVK,EAAQ,KAAI,GACZG,EAAM,KAAK,OAAOV,CAAU;AAAA,EAEhC;AAEA,WAASc,EAAKC,GAAY;AACxB,QAAIC,GAAGC,IAAIpB,EAAM,QAAQqB;AAEzB,IAAIH,MAAe,WAAWA,IAAa;AAE3C,aAASI,IAAI,GAAGA,IAAIJ,GAAY,EAAEI;AAOhC,WANAlB,MAAUG,IAAcH,KAASE,GAEjCG,EAAO,QAAQ,SAAUc,GAAO;AAC9B,QAAAA,EAAMnB,CAAK;AAAA,MACb,CAAC,GAEIe,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAE,IAAOrB,EAAMmB,CAAC,GACVE,EAAK,MAAM,OAAMA,EAAK,KAAKA,EAAK,MAAMb,KACrCa,EAAK,IAAIA,EAAK,IAAIA,EAAK,KAAK,IAC7BnB,IAAO,MACLmB,EAAK,MAAM,OAAMA,EAAK,KAAKA,EAAK,MAAMb,KACrCa,EAAK,IAAIA,EAAK,IAAIA,EAAK,KAAK,KAE/BnB,IAAO,MACLmB,EAAK,MAAM,OAAMA,EAAK,KAAKA,EAAK,MAAMb,KACrCa,EAAK,IAAIA,EAAK,IAAIA,EAAK,KAAK;AAKvC,WAAOlB;AAAA,EACT;AAEA,WAASqB,IAAkB;AACzB,aAASL,IAAI,GAAGC,IAAIpB,EAAM,QAAQqB,GAAMF,IAAIC,GAAG,EAAED,GAAG;AAKlD,UAJAE,IAAOrB,EAAMmB,CAAC,GAAGE,EAAK,QAAQF,GAC1BE,EAAK,MAAM,SAAMA,EAAK,IAAIA,EAAK,KAC/BA,EAAK,MAAM,SAAMA,EAAK,IAAIA,EAAK,KAC/BA,EAAK,MAAM,SAAMA,EAAK,IAAIA,EAAK,KAC/B,MAAMA,EAAK,CAAC,KAAMnB,IAAO,KAAK,MAAMmB,EAAK,CAAC,KAAOnB,IAAO,KAAK,MAAMmB,EAAK,CAAC,GAAI;AAC/E,YAAII,IAAS7B,KAAiBM,IAAO,IAAI,KAAK,KAAK,MAAMiB,CAAC,IAAKjB,IAAO,IAAI,KAAK,KAAK,MAAMiB,CAAC,IAAIA,IAC7FO,IAAYP,IAAItB,GAChB8B,IAAWR,IAAIrB;AAEjB,QAAII,MAAS,IACXmB,EAAK,IAAII,IACAvB,MAAS,KAClBmB,EAAK,IAAII,IAAS,KAAK,IAAIC,CAAS,GACpCL,EAAK,IAAII,IAAS,KAAK,IAAIC,CAAS,MAEpCL,EAAK,IAAII,IAAS,KAAK,IAAIC,CAAS,IAAI,KAAK,IAAIC,CAAQ,GACzDN,EAAK,IAAII,IAAS,KAAK,IAAIC,CAAS,GACpCL,EAAK,IAAII,IAAS,KAAK,IAAIC,CAAS,IAAI,KAAK,IAAIC,CAAQ;AAAA,MAE7D;AACA,OAAI,MAAMN,EAAK,EAAE,KAAMnB,IAAO,KAAK,MAAMmB,EAAK,EAAE,KAAOnB,IAAO,KAAK,MAAMmB,EAAK,EAAE,OAC9EA,EAAK,KAAK,GACNnB,IAAO,MAAKmB,EAAK,KAAK,IACtBnB,IAAO,MAAKmB,EAAK,KAAK;AAAA,IAE9B;AAAA,EACF;AAEA,WAASO,EAAgBL,GAAO;AAC9B,WAAIA,EAAM,cAAYA,EAAM,WAAWvB,GAAOe,GAAQb,CAAI,GACnDqB;AAAA,EACT;AAEA,SAAAC,EAAe,GAERrB,IAAa;AAAA,IAClB,MAAMc;AAAA,IAEN,SAAS,WAAW;AAClB,aAAOP,EAAQ,QAAQE,CAAI,GAAGT;AAAA,IAChC;AAAA,IAEA,MAAM,WAAW;AACf,aAAOO,EAAQ,KAAI,GAAIP;AAAA,IACzB;AAAA,IAEA,eAAe,SAAS0B,GAAG;AACzB,aAAO,UAAU,UACV3B,IAAO,KAAK,IAAIX,GAAgB,KAAK,IAAI,GAAG,KAAK,MAAMsC,CAAC,CAAC,CAAC,GAAGpB,EAAO,QAAQmB,CAAe,GAAGzB,KAC/FD;AAAA,IACR;AAAA,IAEA,OAAO,SAAS2B,GAAG;AACjB,aAAO,UAAU,UAAU7B,IAAQ6B,GAAGL,KAAmBf,EAAO,QAAQmB,CAAe,GAAGzB,KAAcH;AAAA,IAC1G;AAAA,IAEA,OAAO,SAAS6B,GAAG;AACjB,aAAO,UAAU,UAAUzB,IAAQ,CAACyB,GAAG1B,KAAcC;AAAA,IACvD;AAAA,IAEA,UAAU,SAASyB,GAAG;AACpB,aAAO,UAAU,UAAUxB,IAAW,CAACwB,GAAG1B,KAAcE;AAAA,IAC1D;AAAA,IAEA,YAAY,SAASwB,GAAG;AACtB,aAAO,UAAU,UAAUvB,IAAa,CAACuB,GAAG1B,KAAc,CAACG;AAAA,IAC7D;AAAA,IAEA,aAAa,SAASuB,GAAG;AACvB,aAAO,UAAU,UAAUtB,IAAc,CAACsB,GAAG1B,KAAcI;AAAA,IAC7D;AAAA,IAEA,eAAe,SAASsB,GAAG;AACzB,aAAO,UAAU,UAAUrB,IAAgB,IAAIqB,GAAG1B,KAAc,IAAIK;AAAA,IACtE;AAAA,IAEA,cAAc,SAASqB,GAAG;AACxB,aAAO,UAAU,UAAUd,IAASc,GAAGpB,EAAO,QAAQmB,CAAe,GAAGzB,KAAcY;AAAA,IACxF;AAAA,IAEA,OAAO,SAASe,GAAMD,GAAG;AACvB,aAAO,UAAU,SAAS,KAAMA,KAAK,OAAOpB,EAAO,OAAOqB,CAAI,IAAIrB,EAAO,IAAIqB,GAAMF,EAAgBC,CAAC,CAAC,GAAI1B,KAAcM,EAAO,IAAIqB,CAAI;AAAA,IACxI;AAAA,IAEA,MAAM,WAAW;AACf,UAAIC,IAAO,MAAM,UAAU,MAAM,KAAK,SAAS,GAC3CvC,IAAIuC,EAAK,MAAK,KAAM,GACpBrC,KAAKQ,IAAO,IAAI6B,EAAK,MAAK,IAAK,SAAS,GACxCpC,KAAKO,IAAO,IAAI6B,EAAK,MAAK,IAAK,SAAS,GACxCN,IAASM,EAAK,MAAK,KAAM,OAEzBZ,IAAI,GACJC,IAAIpB,EAAM,QACVgC,GACAC,GACAC,GACAC,GACAd,GACAe;AAIJ,WAFAX,KAAUA,GAELN,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAE,IAAOrB,EAAMmB,CAAC,GACda,IAAKxC,IAAI6B,EAAK,GACdY,IAAKvC,KAAK2B,EAAK,KAAK,IACpBa,IAAKvC,KAAK0B,EAAK,KAAI,IACnBc,IAAKH,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA,GAC1BC,IAAKV,MAAQW,IAAUf,GAAMI,IAASU;AAG5C,aAAOC;AAAA,IACT;AAAA,IAEA,IAAI,SAASN,GAAMD,GAAG;AACpB,aAAO,UAAU,SAAS,KAAKhB,EAAM,GAAGiB,GAAMD,CAAC,GAAG1B,KAAcU,EAAM,GAAGiB,CAAI;AAAA,IAC/E;AAAA,EACJ;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/x.js

@@ -0,0 +1,27 @@
+import o from "./constant.js";
+function h(e) {
+  var i = o(0.1), t, u, a;
+  typeof e != "function" && (e = o(e == null ? 0 : +e));
+  function f(n) {
+    for (var r = 0, g = t.length, s; r < g; ++r)
+      s = t[r], s.vx += (a[r] - s.x) * u[r] * n;
+  }
+  function c() {
+    if (t) {
+      var n, r = t.length;
+      for (u = new Array(r), a = new Array(r), n = 0; n < r; ++n)
+        u[n] = isNaN(a[n] = +e(t[n], n, t)) ? 0 : +i(t[n], n, t);
+    }
+  }
+  return f.initialize = function(n) {
+    t = n, c();
+  }, f.strength = function(n) {
+    return arguments.length ? (i = typeof n == "function" ? n : o(+n), c(), f) : i;
+  }, f.x = function(n) {
+    return arguments.length ? (e = typeof n == "function" ? n : o(+n), c(), f) : e;
+  }, f;
+}
+export {
+  h as default
+};
+//# sourceMappingURL=x.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/x.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"x.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/x.js"],"sourcesContent":["import constant from './constant.js';\n\nfunction forceX(x) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      xz;\n\n  if (typeof x !== \"function\") x = constant(x == null ? 0 : +x);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vx += (xz[i] - node.x) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    xz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(xz[i] = +x(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : x;\n  };\n\n  return force;\n}\n\nexport { forceX as default };\n//# sourceMappingURL=x.js.map\n"],"names":["forceX","x","strength","constant","nodes","strengths","xz","force","alpha","i","n","node","initialize","_"],"mappings":";AAEA,SAASA,EAAOC,GAAG;AACjB,MAAIC,IAAWC,EAAS,GAAG,GACvBC,GACAC,GACAC;AAEJ,EAAI,OAAOL,KAAM,eAAYA,IAAIE,EAASF,KAAK,OAAO,IAAI,CAACA,CAAC;AAE5D,WAASM,EAAMC,GAAO;AACpB,aAASC,IAAI,GAAGC,IAAIN,EAAM,QAAQO,GAAMF,IAAIC,GAAG,EAAED;AAC/C,MAAAE,IAAOP,EAAMK,CAAC,GAAGE,EAAK,OAAOL,EAAGG,CAAC,IAAIE,EAAK,KAAKN,EAAUI,CAAC,IAAID;AAAA,EAElE;AAEA,WAASI,IAAa;AACpB,QAAKR,GACL;AAAA,UAAIK,GAAGC,IAAIN,EAAM;AAGjB,WAFAC,IAAY,IAAI,MAAMK,CAAC,GACvBJ,IAAK,IAAI,MAAMI,CAAC,GACXD,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAJ,EAAUI,CAAC,IAAI,MAAMH,EAAGG,CAAC,IAAI,CAACR,EAAEG,EAAMK,CAAC,GAAGA,GAAGL,CAAK,CAAC,IAAI,IAAI,CAACF,EAASE,EAAMK,CAAC,GAAGA,GAAGL,CAAK;AAAA;AAAA,EAE3F;AAEA,SAAAG,EAAM,aAAa,SAASM,GAAG;AAC7B,IAAAT,IAAQS,GACRD,EAAU;AAAA,EACZ,GAEAL,EAAM,WAAW,SAASM,GAAG;AAC3B,WAAO,UAAU,UAAUX,IAAW,OAAOW,KAAM,aAAaA,IAAIV,EAAS,CAACU,CAAC,GAAGD,EAAU,GAAIL,KAASL;AAAA,EAC3G,GAEAK,EAAM,IAAI,SAASM,GAAG;AACpB,WAAO,UAAU,UAAUZ,IAAI,OAAOY,KAAM,aAAaA,IAAIV,EAAS,CAACU,CAAC,GAAGD,EAAU,GAAIL,KAASN;AAAA,EACpG,GAEOM;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/y.js

@@ -0,0 +1,27 @@
+import o from "./constant.js";
+function h(e) {
+  var i = o(0.1), t, u, a;
+  typeof e != "function" && (e = o(e == null ? 0 : +e));
+  function f(n) {
+    for (var r = 0, g = t.length, s; r < g; ++r)
+      s = t[r], s.vy += (a[r] - s.y) * u[r] * n;
+  }
+  function c() {
+    if (t) {
+      var n, r = t.length;
+      for (u = new Array(r), a = new Array(r), n = 0; n < r; ++n)
+        u[n] = isNaN(a[n] = +e(t[n], n, t)) ? 0 : +i(t[n], n, t);
+    }
+  }
+  return f.initialize = function(n) {
+    t = n, c();
+  }, f.strength = function(n) {
+    return arguments.length ? (i = typeof n == "function" ? n : o(+n), c(), f) : i;
+  }, f.y = function(n) {
+    return arguments.length ? (e = typeof n == "function" ? n : o(+n), c(), f) : e;
+  }, f;
+}
+export {
+  h as default
+};
+//# sourceMappingURL=y.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/y.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"y.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/y.js"],"sourcesContent":["import constant from './constant.js';\n\nfunction forceY(y) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      yz;\n\n  if (typeof y !== \"function\") y = constant(y == null ? 0 : +y);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vy += (yz[i] - node.y) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    yz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(yz[i] = +y(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : y;\n  };\n\n  return force;\n}\n\nexport { forceY as default };\n//# sourceMappingURL=y.js.map\n"],"names":["forceY","y","strength","constant","nodes","strengths","yz","force","alpha","i","n","node","initialize","_"],"mappings":";AAEA,SAASA,EAAOC,GAAG;AACjB,MAAIC,IAAWC,EAAS,GAAG,GACvBC,GACAC,GACAC;AAEJ,EAAI,OAAOL,KAAM,eAAYA,IAAIE,EAASF,KAAK,OAAO,IAAI,CAACA,CAAC;AAE5D,WAASM,EAAMC,GAAO;AACpB,aAASC,IAAI,GAAGC,IAAIN,EAAM,QAAQO,GAAMF,IAAIC,GAAG,EAAED;AAC/C,MAAAE,IAAOP,EAAMK,CAAC,GAAGE,EAAK,OAAOL,EAAGG,CAAC,IAAIE,EAAK,KAAKN,EAAUI,CAAC,IAAID;AAAA,EAElE;AAEA,WAASI,IAAa;AACpB,QAAKR,GACL;AAAA,UAAIK,GAAGC,IAAIN,EAAM;AAGjB,WAFAC,IAAY,IAAI,MAAMK,CAAC,GACvBJ,IAAK,IAAI,MAAMI,CAAC,GACXD,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAJ,EAAUI,CAAC,IAAI,MAAMH,EAAGG,CAAC,IAAI,CAACR,EAAEG,EAAMK,CAAC,GAAGA,GAAGL,CAAK,CAAC,IAAI,IAAI,CAACF,EAASE,EAAMK,CAAC,GAAGA,GAAGL,CAAK;AAAA;AAAA,EAE3F;AAEA,SAAAG,EAAM,aAAa,SAASM,GAAG;AAC7B,IAAAT,IAAQS,GACRD,EAAU;AAAA,EACZ,GAEAL,EAAM,WAAW,SAASM,GAAG;AAC3B,WAAO,UAAU,UAAUX,IAAW,OAAOW,KAAM,aAAaA,IAAIV,EAAS,CAACU,CAAC,GAAGD,EAAU,GAAIL,KAASL;AAAA,EAC3G,GAEAK,EAAM,IAAI,SAASM,GAAG;AACpB,WAAO,UAAU,UAAUZ,IAAI,OAAOY,KAAM,aAAaA,IAAIV,EAAS,CAACU,CAAC,GAAGD,EAAU,GAAIL,KAASN;AAAA,EACpG,GAEOM;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/z.js

@@ -0,0 +1,27 @@
+import o from "./constant.js";
+function h(e) {
+  var i = o(0.1), t, u, a;
+  typeof e != "function" && (e = o(e == null ? 0 : +e));
+  function f(n) {
+    for (var r = 0, g = t.length, s; r < g; ++r)
+      s = t[r], s.vz += (a[r] - s.z) * u[r] * n;
+  }
+  function c() {
+    if (t) {
+      var n, r = t.length;
+      for (u = new Array(r), a = new Array(r), n = 0; n < r; ++n)
+        u[n] = isNaN(a[n] = +e(t[n], n, t)) ? 0 : +i(t[n], n, t);
+    }
+  }
+  return f.initialize = function(n) {
+    t = n, c();
+  }, f.strength = function(n) {
+    return arguments.length ? (i = typeof n == "function" ? n : o(+n), c(), f) : i;
+  }, f.z = function(n) {
+    return arguments.length ? (e = typeof n == "function" ? n : o(+n), c(), f) : e;
+  }, f;
+}
+export {
+  h as default
+};
+//# sourceMappingURL=z.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/z.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"z.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force-3d/src/z.js"],"sourcesContent":["import constant from './constant.js';\n\nfunction forceZ(z) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      zz;\n\n  if (typeof z !== \"function\") z = constant(z == null ? 0 : +z);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vz += (zz[i] - node.z) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    zz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(zz[i] = +z(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.z = function(_) {\n    return arguments.length ? (z = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : z;\n  };\n\n  return force;\n}\n\nexport { forceZ as default };\n//# sourceMappingURL=z.js.map\n"],"names":["forceZ","z","strength","constant","nodes","strengths","zz","force","alpha","i","n","node","initialize","_"],"mappings":";AAEA,SAASA,EAAOC,GAAG;AACjB,MAAIC,IAAWC,EAAS,GAAG,GACvBC,GACAC,GACAC;AAEJ,EAAI,OAAOL,KAAM,eAAYA,IAAIE,EAASF,KAAK,OAAO,IAAI,CAACA,CAAC;AAE5D,WAASM,EAAMC,GAAO;AACpB,aAASC,IAAI,GAAGC,IAAIN,EAAM,QAAQO,GAAMF,IAAIC,GAAG,EAAED;AAC/C,MAAAE,IAAOP,EAAMK,CAAC,GAAGE,EAAK,OAAOL,EAAGG,CAAC,IAAIE,EAAK,KAAKN,EAAUI,CAAC,IAAID;AAAA,EAElE;AAEA,WAASI,IAAa;AACpB,QAAKR,GACL;AAAA,UAAIK,GAAGC,IAAIN,EAAM;AAGjB,WAFAC,IAAY,IAAI,MAAMK,CAAC,GACvBJ,IAAK,IAAI,MAAMI,CAAC,GACXD,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAJ,EAAUI,CAAC,IAAI,MAAMH,EAAGG,CAAC,IAAI,CAACR,EAAEG,EAAMK,CAAC,GAAGA,GAAGL,CAAK,CAAC,IAAI,IAAI,CAACF,EAASE,EAAMK,CAAC,GAAGA,GAAGL,CAAK;AAAA;AAAA,EAE3F;AAEA,SAAAG,EAAM,aAAa,SAASM,GAAG;AAC7B,IAAAT,IAAQS,GACRD,EAAU;AAAA,EACZ,GAEAL,EAAM,WAAW,SAASM,GAAG;AAC3B,WAAO,UAAU,UAAUX,IAAW,OAAOW,KAAM,aAAaA,IAAIV,EAAS,CAACU,CAAC,GAAGD,EAAU,GAAIL,KAASL;AAAA,EAC3G,GAEAK,EAAM,IAAI,SAASM,GAAG;AACpB,WAAO,UAAU,UAAUZ,IAAI,OAAOY,KAAM,aAAaA,IAAIV,EAAS,CAACU,CAAC,GAAGD,EAAU,GAAIL,KAASN;AAAA,EACpG,GAEOM;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/add.js

@@ -0,0 +1,33 @@
+function F(i) {
+  const o = +this._x.call(null, i), y = +this._y.call(null, i), u = +this._z.call(null, i);
+  return g(this.cover(o, y, u), o, y, u, i);
+}
+function g(i, o, y, u, N) {
+  if (isNaN(o) || isNaN(y) || isNaN(u)) return i;
+  var t, n = i._root, r = { data: N }, c = i._x0, _ = i._y0, h = i._z0, l = i._x1, z = i._y1, s = i._z1, f, a, x, p, I, m, A, d, w, e, v;
+  if (!n) return i._root = r, i;
+  for (; n.length; )
+    if ((A = o >= (f = (c + l) / 2)) ? c = f : l = f, (d = y >= (a = (_ + z) / 2)) ? _ = a : z = a, (w = u >= (x = (h + s) / 2)) ? h = x : s = x, t = n, !(n = n[e = w << 2 | d << 1 | A])) return t[e] = r, i;
+  if (p = +i._x.call(null, n.data), I = +i._y.call(null, n.data), m = +i._z.call(null, n.data), o === p && y === I && u === m) return r.next = n, t ? t[e] = r : i._root = r, i;
+  do
+    t = t ? t[e] = new Array(8) : i._root = new Array(8), (A = o >= (f = (c + l) / 2)) ? c = f : l = f, (d = y >= (a = (_ + z) / 2)) ? _ = a : z = a, (w = u >= (x = (h + s) / 2)) ? h = x : s = x;
+  while ((e = w << 2 | d << 1 | A) === (v = (m >= x) << 2 | (I >= a) << 1 | p >= f));
+  return t[v] = n, t[e] = r, i;
+}
+function b(i) {
+  Array.isArray(i) || (i = Array.from(i));
+  const o = i.length, y = new Float64Array(o), u = new Float64Array(o), N = new Float64Array(o);
+  let t = 1 / 0, n = 1 / 0, r = 1 / 0, c = -1 / 0, _ = -1 / 0, h = -1 / 0;
+  for (let l = 0, z, s, f, a; l < o; ++l)
+    isNaN(s = +this._x.call(null, z = i[l])) || isNaN(f = +this._y.call(null, z)) || isNaN(a = +this._z.call(null, z)) || (y[l] = s, u[l] = f, N[l] = a, s < t && (t = s), s > c && (c = s), f < n && (n = f), f > _ && (_ = f), a < r && (r = a), a > h && (h = a));
+  if (t > c || n > _ || r > h) return this;
+  this.cover(t, n, r).cover(c, _, h);
+  for (let l = 0; l < o; ++l)
+    g(this, y[l], u[l], N[l], i[l]);
+  return this;
+}
+export {
+  b as addAll,
+  F as default
+};
+//# sourceMappingURL=add.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/add.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/add.js"],"sourcesContent":["function tree_add(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d),\n      z = +this._z.call(null, d);\n  return add(this.cover(x, y, z), x, y, z, d);\n}\n\nfunction add(tree, x, y, z, d) {\n  if (isNaN(x) || isNaN(y) || isNaN(z)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      z0 = tree._z0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      z1 = tree._z1,\n      xm,\n      ym,\n      zm,\n      xp,\n      yp,\n      zp,\n      right,\n      bottom,\n      deep,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n    if (parent = node, !(node = node[i = deep << 2 | bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  zp = +tree._z.call(null, node.data);\n  if (x === xp && y === yp && z === zp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(8) : tree._root = new Array(8);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n  } while ((i = deep << 2 | bottom << 1 | right) === (j = (zp >= zm) << 2 | (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nfunction addAll(data) {\n  if (!Array.isArray(data)) data = Array.from(data);\n  const n = data.length;\n  const xz = new Float64Array(n);\n  const yz = new Float64Array(n);\n  const zz = new Float64Array(n);\n  let x0 = Infinity,\n      y0 = Infinity,\n      z0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity,\n      z1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (let i = 0, d, x, y, z; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    zz[i] = z;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n    if (z < z0) z0 = z;\n    if (z > z1) z1 = z;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1 || z0 > z1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0, z0).cover(x1, y1, z1);\n\n  // Add the new points.\n  for (let i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], zz[i], data[i]);\n  }\n\n  return this;\n}\n\nexport { addAll, tree_add as default };\n//# sourceMappingURL=add.js.map\n"],"names":["tree_add","d","x","z","add","tree","parent","node","leaf","x0","y0","z0","x1","y1","z1","xm","ym","zm","xp","yp","zp","right","bottom","deep","i","j","addAll","data","n","xz","yz","zz","y"],"mappings":"AAAA,SAASA,EAASC,GAAG;AACnB,QAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,GAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMA,CAAC,GACzBE,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC;AAC7B,SAAOG,EAAI,KAAK,MAAMF,GAAG,GAAGC,CAAC,GAAGD,GAAG,GAAGC,GAAGF,CAAC;AAC5C;AAEA,SAASG,EAAIC,GAAMH,GAAG,GAAGC,GAAGF,GAAG;AAC7B,MAAI,MAAMC,CAAC,KAAK,MAAM,CAAC,KAAK,MAAMC,CAAC,EAAG,QAAOE;AAE7C,MAAIC,GACAC,IAAOF,EAAK,OACZG,IAAO,EAAC,MAAMP,EAAC,GACfQ,IAAKJ,EAAK,KACVK,IAAKL,EAAK,KACVM,IAAKN,EAAK,KACVO,IAAKP,EAAK,KACVQ,IAAKR,EAAK,KACVS,IAAKT,EAAK,KACVU,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAI,CAAClB,EAAM,QAAOF,EAAK,QAAQG,GAAMH;AAGrC,SAAOE,EAAK;AAIV,SAHIc,IAAQnB,MAAMa,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,IACtDO,IAAS,MAAMN,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,IACvDO,IAAOpB,MAAMc,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,GACrDX,IAASC,GAAM,EAAEA,IAAOA,EAAKiB,IAAID,KAAQ,IAAID,KAAU,IAAID,CAAK,GAAI,QAAOf,EAAOkB,CAAC,IAAIhB,GAAMH;AAOnG,MAHAa,IAAK,CAACb,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAClCY,IAAK,CAACd,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAClCa,IAAK,CAACf,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAC9BL,MAAMgB,KAAM,MAAMC,KAAMhB,MAAMiB,EAAI,QAAOZ,EAAK,OAAOD,GAAMD,IAASA,EAAOkB,CAAC,IAAIhB,IAAOH,EAAK,QAAQG,GAAMH;AAG9G;AACE,IAAAC,IAASA,IAASA,EAAOkB,CAAC,IAAI,IAAI,MAAM,CAAC,IAAInB,EAAK,QAAQ,IAAI,MAAM,CAAC,IACjEgB,IAAQnB,MAAMa,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,IACtDO,IAAS,MAAMN,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,IACvDO,IAAOpB,MAAMc,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG;AAAA,UACjDO,IAAID,KAAQ,IAAID,KAAU,IAAID,QAAYI,KAAKL,KAAMH,MAAO,KAAKE,KAAMH,MAAO,IAAKE,KAAMH;AACnG,SAAOT,EAAOmB,CAAC,IAAIlB,GAAMD,EAAOkB,CAAC,IAAIhB,GAAMH;AAC7C;AAEA,SAASqB,EAAOC,GAAM;AACpB,EAAK,MAAM,QAAQA,CAAI,MAAGA,IAAO,MAAM,KAAKA,CAAI;AAChD,QAAMC,IAAID,EAAK,QACTE,IAAK,IAAI,aAAaD,CAAC,GACvBE,IAAK,IAAI,aAAaF,CAAC,GACvBG,IAAK,IAAI,aAAaH,CAAC;AAC7B,MAAInB,IAAK,OACLC,IAAK,OACLC,IAAK,OACLC,IAAK,QACLC,IAAK,QACLC,IAAK;AAGT,WAASU,IAAI,GAAGvB,GAAGC,GAAG8B,GAAG7B,GAAGqB,IAAII,GAAG,EAAEJ;AACnC,IAAI,MAAMtB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,IAAI0B,EAAKH,CAAC,CAAC,CAAC,KAAK,MAAMQ,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM/B,CAAC,CAAC,KAAK,MAAME,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,MACxH4B,EAAGL,CAAC,IAAItB,GACR4B,EAAGN,CAAC,IAAIQ,GACRD,EAAGP,CAAC,IAAIrB,GACJD,IAAIO,MAAIA,IAAKP,IACbA,IAAIU,MAAIA,IAAKV,IACb8B,IAAItB,MAAIA,IAAKsB,IACbA,IAAInB,MAAIA,IAAKmB,IACb7B,IAAIQ,MAAIA,IAAKR,IACbA,IAAIW,MAAIA,IAAKX;AAInB,MAAIM,IAAKG,KAAMF,IAAKG,KAAMF,IAAKG,EAAI,QAAO;AAG1C,OAAK,MAAML,GAAIC,GAAIC,CAAE,EAAE,MAAMC,GAAIC,GAAIC,CAAE;AAGvC,WAASU,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACvB,IAAApB,EAAI,MAAMyB,EAAGL,CAAC,GAAGM,EAAGN,CAAC,GAAGO,EAAGP,CAAC,GAAGG,EAAKH,CAAC,CAAC;AAGxC,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/cover.js

@@ -0,0 +1,41 @@
+function l(o, c, b) {
+  if (isNaN(o = +o) || isNaN(c = +c) || isNaN(b = +b)) return this;
+  var a = this._x0, i = this._y0, e = this._z0, h = this._x1, r = this._y1, _ = this._z1;
+  if (isNaN(a))
+    h = (a = Math.floor(o)) + 1, r = (i = Math.floor(c)) + 1, _ = (e = Math.floor(b)) + 1;
+  else {
+    for (var s = h - a || 1, f = this._root, k, N; a > o || o >= h || i > c || c >= r || e > b || b >= _; )
+      switch (N = (b < e) << 2 | (c < i) << 1 | o < a, k = new Array(8), k[N] = f, f = k, s *= 2, N) {
+        case 0:
+          h = a + s, r = i + s, _ = e + s;
+          break;
+        case 1:
+          a = h - s, r = i + s, _ = e + s;
+          break;
+        case 2:
+          h = a + s, i = r - s, _ = e + s;
+          break;
+        case 3:
+          a = h - s, i = r - s, _ = e + s;
+          break;
+        case 4:
+          h = a + s, r = i + s, e = _ - s;
+          break;
+        case 5:
+          a = h - s, r = i + s, e = _ - s;
+          break;
+        case 6:
+          h = a + s, i = r - s, e = _ - s;
+          break;
+        case 7:
+          a = h - s, i = r - s, e = _ - s;
+          break;
+      }
+    this._root && this._root.length && (this._root = f);
+  }
+  return this._x0 = a, this._y0 = i, this._z0 = e, this._x1 = h, this._y1 = r, this._z1 = _, this;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=cover.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/cover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cover.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/cover.js"],"sourcesContent":["function tree_cover(x, y, z) {\n  if (isNaN(x = +x) || isNaN(y = +y) || isNaN(z = +z)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1 = this._x1,\n      y1 = this._y1,\n      z1 = this._z1;\n\n  // If the octree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing octant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n    z1 = (z0 = Math.floor(z)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var t = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1 || z0 > z || z >= z1) {\n      i = (z < z0) << 2 | (y < y0) << 1 | (x < x0);\n      parent = new Array(8), parent[i] = node, node = parent, t *= 2;\n      switch (i) {\n        case 0: x1 = x0 + t, y1 = y0 + t, z1 = z0 + t; break;\n        case 1: x0 = x1 - t, y1 = y0 + t, z1 = z0 + t; break;\n        case 2: x1 = x0 + t, y0 = y1 - t, z1 = z0 + t; break;\n        case 3: x0 = x1 - t, y0 = y1 - t, z1 = z0 + t; break;\n        case 4: x1 = x0 + t, y1 = y0 + t, z0 = z1 - t; break;\n        case 5: x0 = x1 - t, y1 = y0 + t, z0 = z1 - t; break;\n        case 6: x1 = x0 + t, y0 = y1 - t, z0 = z1 - t; break;\n        case 7: x0 = x1 - t, y0 = y1 - t, z0 = z1 - t; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._z0 = z0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._z1 = z1;\n  return this;\n}\n\nexport { tree_cover as default };\n//# sourceMappingURL=cover.js.map\n"],"names":["tree_cover","x","y","z","x0","y0","z0","x1","y1","z1","t","node","parent","i"],"mappings":"AAAA,SAASA,EAAWC,GAAGC,GAAGC,GAAG;AAC3B,MAAI,MAAMF,IAAI,CAACA,CAAC,KAAK,MAAMC,IAAI,CAACA,CAAC,KAAK,MAAMC,IAAI,CAACA,CAAC,EAAG,QAAO;AAE5D,MAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK;AAKd,MAAI,MAAML,CAAE;AACV,IAAAG,KAAMH,IAAK,KAAK,MAAMH,CAAC,KAAK,GAC5BO,KAAMH,IAAK,KAAK,MAAMH,CAAC,KAAK,GAC5BO,KAAMH,IAAK,KAAK,MAAMH,CAAC,KAAK;AAAA,OAIzB;AAMH,aALIO,IAAIH,IAAKH,KAAM,GACfO,IAAO,KAAK,OACZC,GACAC,GAEGT,IAAKH,KAAKA,KAAKM,KAAMF,IAAKH,KAAKA,KAAKM,KAAMF,IAAKH,KAAKA,KAAKM;AAG9D,cAFAI,KAAKV,IAAIG,MAAO,KAAKJ,IAAIG,MAAO,IAAKJ,IAAIG,GACzCQ,IAAS,IAAI,MAAM,CAAC,GAAGA,EAAOC,CAAC,IAAIF,GAAMA,IAAOC,GAAQF,KAAK,GACrDG,GAAC;AAAA,QACP,KAAK;AAAG,UAAAN,IAAKH,IAAKM,GAAGF,IAAKH,IAAKK,GAAGD,IAAKH,IAAKI;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAN,IAAKG,IAAKG,GAAGF,IAAKH,IAAKK,GAAGD,IAAKH,IAAKI;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAH,IAAKH,IAAKM,GAAGL,IAAKG,IAAKE,GAAGD,IAAKH,IAAKI;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAN,IAAKG,IAAKG,GAAGL,IAAKG,IAAKE,GAAGD,IAAKH,IAAKI;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAH,IAAKH,IAAKM,GAAGF,IAAKH,IAAKK,GAAGJ,IAAKG,IAAKC;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAN,IAAKG,IAAKG,GAAGF,IAAKH,IAAKK,GAAGJ,IAAKG,IAAKC;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAH,IAAKH,IAAKM,GAAGL,IAAKG,IAAKE,GAAGJ,IAAKG,IAAKC;AAAG;AAAA,QAC/C,KAAK;AAAG,UAAAN,IAAKG,IAAKG,GAAGL,IAAKG,IAAKE,GAAGJ,IAAKG,IAAKC;AAAG;AAAA,MACvD;AAGI,IAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQC;AAAA,EACpD;AAEA,cAAK,MAAMP,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACJ;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/data.js

@@ -0,0 +1,12 @@
+function i() {
+  var a = [];
+  return this.visit(function(t) {
+    if (!t.length) do
+      a.push(t.data);
+    while (t = t.next);
+  }), a;
+}
+export {
+  i as default
+};
+//# sourceMappingURL=data.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/data.js"],"sourcesContent":["function tree_data() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n\nexport { tree_data as default };\n//# sourceMappingURL=data.js.map\n"],"names":["tree_data","data","node"],"mappings":"AAAA,SAASA,IAAY;AACnB,MAAIC,IAAO,CAAA;AACX,cAAK,MAAM,SAASC,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,MAAAD,EAAK,KAAKC,EAAK,IAAI;AAAA,WAAUA,IAAOA,EAAK;AAAA,EAChE,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/extent.js

@@ -0,0 +1,7 @@
+function e(t) {
+  return arguments.length ? this.cover(+t[0][0], +t[0][1], +t[0][2]).cover(+t[1][0], +t[1][1], +t[1][2]) : isNaN(this._x0) ? void 0 : [[this._x0, this._y0, this._z0], [this._x1, this._y1, this._z1]];
+}
+export {
+  e as default
+};
+//# sourceMappingURL=extent.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/extent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extent.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/extent.js"],"sourcesContent":["function tree_extent(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1], +_[0][2]).cover(+_[1][0], +_[1][1], +_[1][2])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0, this._z0], [this._x1, this._y1, this._z1]];\n}\n\nexport { tree_extent as default };\n//# sourceMappingURL=extent.js.map\n"],"names":["tree_extent","_"],"mappings":"AAAA,SAASA,EAAYC,GAAG;AACtB,SAAO,UAAU,SACX,KAAK,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,GAAG,CAACA,EAAE,CAAC,EAAE,CAAC,CAAC,IAC3E,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AACrG;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/find.js

@@ -0,0 +1,30 @@
+import o from "./octant.js";
+function H(_, a, w, n) {
+  var B, I = this._x0, M = this._y0, O = this._z0, c, p, s, g, v, q, b = this._x1, j = this._y1, k = this._z1, e = [], t = this._root, l, A;
+  for (t && e.push(new o(t, I, M, O, b, j, k)), n == null ? n = 1 / 0 : (I = _ - n, M = a - n, O = w - n, b = _ + n, j = a + n, k = w + n, n *= n); l = e.pop(); )
+    if (!(!(t = l.node) || (c = l.x0) > b || (p = l.y0) > j || (s = l.z0) > k || (g = l.x1) < I || (v = l.y1) < M || (q = l.z1) < O))
+      if (t.length) {
+        var h = (c + g) / 2, i = (p + v) / 2, f = (s + q) / 2;
+        e.push(
+          new o(t[7], h, i, f, g, v, q),
+          new o(t[6], c, i, f, h, v, q),
+          new o(t[5], h, p, f, g, i, q),
+          new o(t[4], c, p, f, h, i, q),
+          new o(t[3], h, i, s, g, v, f),
+          new o(t[2], c, i, s, h, v, f),
+          new o(t[1], h, p, s, g, i, f),
+          new o(t[0], c, p, s, h, i, f)
+        ), (A = (w >= f) << 2 | (a >= i) << 1 | _ >= h) && (l = e[e.length - 1], e[e.length - 1] = e[e.length - 1 - A], e[e.length - 1 - A] = l);
+      } else {
+        var C = _ - +this._x.call(null, t.data), D = a - +this._y.call(null, t.data), E = w - +this._z.call(null, t.data), F = C * C + D * D + E * E;
+        if (F < n) {
+          var r = Math.sqrt(n = F);
+          I = _ - r, M = a - r, O = w - r, b = _ + r, j = a + r, k = w + r, B = t.data;
+        }
+      }
+  return B;
+}
+export {
+  H as default
+};
+//# sourceMappingURL=find.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/find.js"],"sourcesContent":["import Octant from './octant.js';\n\nfunction tree_find(x, y, z, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1,\n      y1,\n      z1,\n      x2,\n      y2,\n      z2,\n      x3 = this._x1,\n      y3 = this._y1,\n      z3 = this._z1,\n      octs = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) octs.push(new Octant(node, x0, y0, z0, x3, y3, z3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius, z0 = z - radius;\n    x3 = x + radius, y3 = y + radius, z3 = z + radius;\n    radius *= radius;\n  }\n\n  while (q = octs.pop()) {\n\n    // Stop searching if this octant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (z1 = q.z0) > z3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0\n        || (z2 = q.z1) < z0) continue;\n\n    // Bisect the current octant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2,\n          zm = (z1 + z2) / 2;\n\n      octs.push(\n        new Octant(node[7], xm, ym, zm, x2, y2, z2),\n        new Octant(node[6], x1, ym, zm, xm, y2, z2),\n        new Octant(node[5], xm, y1, zm, x2, ym, z2),\n        new Octant(node[4], x1, y1, zm, xm, ym, z2),\n        new Octant(node[3], xm, ym, z1, x2, y2, zm),\n        new Octant(node[2], x1, ym, z1, xm, y2, zm),\n        new Octant(node[1], xm, y1, z1, x2, ym, zm),\n        new Octant(node[0], x1, y1, z1, xm, ym, zm)\n      );\n\n      // Visit the closest octant first.\n      if (i = (z >= zm) << 2 | (y >= ym) << 1 | (x >= xm)) {\n        q = octs[octs.length - 1];\n        octs[octs.length - 1] = octs[octs.length - 1 - i];\n        octs[octs.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          dz = z - +this._z.call(null, node.data),\n          d2 = dx * dx + dy * dy + dz * dz;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d, z0 = z - d;\n        x3 = x + d, y3 = y + d, z3 = z + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n\nexport { tree_find as default };\n//# sourceMappingURL=find.js.map\n"],"names":["tree_find","x","y","z","radius","data","x0","y0","z0","x1","y1","z1","x2","y2","z2","x3","y3","z3","octs","node","q","i","Octant","xm","ym","zm","dx","dy","dz","d2","d"],"mappings":";AAEA,SAASA,EAAUC,GAAGC,GAAGC,GAAGC,GAAQ;AAClC,MAAIC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAO,CAAA,GACPC,IAAO,KAAK,OACZC,GACAC;AAUJ,OARIF,KAAMD,EAAK,KAAK,IAAII,EAAOH,GAAMb,GAAIC,GAAIC,GAAIO,GAAIC,GAAIC,CAAE,CAAC,GACxDb,KAAU,OAAMA,IAAS,SAE3BE,IAAKL,IAAIG,GAAQG,IAAKL,IAAIE,GAAQI,IAAKL,IAAIC,GAC3CW,IAAKd,IAAIG,GAAQY,IAAKd,IAAIE,GAAQa,IAAKd,IAAIC,GAC3CA,KAAUA,IAGLgB,IAAIF,EAAK;AAGd,QAAI,IAAEC,IAAOC,EAAE,UACPX,IAAKW,EAAE,MAAML,MACbL,IAAKU,EAAE,MAAMJ,MACbL,IAAKS,EAAE,MAAMH,MACbL,IAAKQ,EAAE,MAAMd,MACbO,IAAKO,EAAE,MAAMb,MACbO,IAAKM,EAAE,MAAMZ;AAGrB,UAAIW,EAAK,QAAQ;AACf,YAAII,KAAMd,IAAKG,KAAM,GACjBY,KAAMd,IAAKG,KAAM,GACjBY,KAAMd,IAAKG,KAAM;AAErB,QAAAI,EAAK;AAAA,UACH,IAAII,EAAOH,EAAK,CAAC,GAAGI,GAAIC,GAAIC,GAAIb,GAAIC,GAAIC,CAAE;AAAA,UAC1C,IAAIQ,EAAOH,EAAK,CAAC,GAAGV,GAAIe,GAAIC,GAAIF,GAAIV,GAAIC,CAAE;AAAA,UAC1C,IAAIQ,EAAOH,EAAK,CAAC,GAAGI,GAAIb,GAAIe,GAAIb,GAAIY,GAAIV,CAAE;AAAA,UAC1C,IAAIQ,EAAOH,EAAK,CAAC,GAAGV,GAAIC,GAAIe,GAAIF,GAAIC,GAAIV,CAAE;AAAA,UAC1C,IAAIQ,EAAOH,EAAK,CAAC,GAAGI,GAAIC,GAAIb,GAAIC,GAAIC,GAAIY,CAAE;AAAA,UAC1C,IAAIH,EAAOH,EAAK,CAAC,GAAGV,GAAIe,GAAIb,GAAIY,GAAIV,GAAIY,CAAE;AAAA,UAC1C,IAAIH,EAAOH,EAAK,CAAC,GAAGI,GAAIb,GAAIC,GAAIC,GAAIY,GAAIC,CAAE;AAAA,UAC1C,IAAIH,EAAOH,EAAK,CAAC,GAAGV,GAAIC,GAAIC,GAAIY,GAAIC,GAAIC,CAAE;AAAA,QAClD,IAGUJ,KAAKlB,KAAKsB,MAAO,KAAKvB,KAAKsB,MAAO,IAAKvB,KAAKsB,OAC9CH,IAAIF,EAAKA,EAAK,SAAS,CAAC,GACxBA,EAAKA,EAAK,SAAS,CAAC,IAAIA,EAAKA,EAAK,SAAS,IAAIG,CAAC,GAChDH,EAAKA,EAAK,SAAS,IAAIG,CAAC,IAAID;AAAA,MAEhC,OAGK;AACH,YAAIM,IAAKzB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMkB,EAAK,IAAI,GACtCQ,IAAKzB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMiB,EAAK,IAAI,GACtCS,IAAKzB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMgB,EAAK,IAAI,GACtCU,IAAKH,IAAKA,IAAKC,IAAKA,IAAKC,IAAKA;AAClC,YAAIC,IAAKzB,GAAQ;AACf,cAAI0B,IAAI,KAAK,KAAK1B,IAASyB,CAAE;AAC7B,UAAAvB,IAAKL,IAAI6B,GAAGvB,IAAKL,IAAI4B,GAAGtB,IAAKL,IAAI2B,GACjCf,IAAKd,IAAI6B,GAAGd,IAAKd,IAAI4B,GAAGb,IAAKd,IAAI2B,GACjCzB,IAAOc,EAAK;AAAA,QACd;AAAA,MACF;AAGF,SAAOd;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/findAll.js

@@ -0,0 +1,16 @@
+const w = (n, s, i, t, c, M) => Math.sqrt((n - t) ** 2 + (s - c) ** 2 + (i - M) ** 2);
+function y(n, s, i, t) {
+  const c = [], M = n - t, x = s - t, e = i - t, l = n + t, f = s + t, _ = i + t;
+  return this.visit((h, a, p, g, q, r, v) => {
+    if (!h.length)
+      do {
+        const o = h.data;
+        w(n, s, i, this._x(o), this._y(o), this._z(o)) <= t && c.push(o);
+      } while (h = h.next);
+    return a > l || p > f || g > _ || q < M || r < x || v < e;
+  }), c;
+}
+export {
+  y as findAllWithinRadius
+};
+//# sourceMappingURL=findAll.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/findAll.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findAll.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/findAll.js"],"sourcesContent":["const distance = (x1, y1, z1, x2, y2, z2) => Math.sqrt((x1-x2)**2 + (y1-y2)**2 + (z1-z2)**2);\n\nfunction findAllWithinRadius(x, y, z, radius) {\n  const result = [];\n\n  const xMin = x - radius;\n  const yMin = y - radius;\n  const zMin = z - radius;\n  const xMax = x + radius;\n  const yMax = y + radius;\n  const zMax = z + radius;\n\n  this.visit((node, x1, y1, z1, x2, y2, z2) => {\n    if (!node.length) {\n      do {\n        const d = node.data;\n        if (distance(x, y, z, this._x(d), this._y(d), this._z(d)) <= radius) {\n          result.push(d);\n        }\n      } while (node = node.next);\n    }\n    return x1 > xMax || y1 > yMax || z1 > zMax || x2 < xMin || y2 < yMin || z2 < zMin;\n  });\n\n  return result;\n}\n\nexport { findAllWithinRadius };\n//# sourceMappingURL=findAll.js.map\n"],"names":["distance","x1","y1","z1","x2","y2","z2","findAllWithinRadius","x","y","z","radius","result","xMin","yMin","zMin","xMax","yMax","zMax","node","d"],"mappings":"AAAA,MAAMA,IAAW,CAACC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,MAAO,KAAK,MAAML,IAAGG,MAAK,KAAKF,IAAGG,MAAK,KAAKF,IAAGG,MAAK,CAAC;AAE3F,SAASC,EAAoBC,GAAGC,GAAGC,GAAGC,GAAQ;AAC5C,QAAMC,IAAS,CAAA,GAETC,IAAOL,IAAIG,GACXG,IAAOL,IAAIE,GACXI,IAAOL,IAAIC,GACXK,IAAOR,IAAIG,GACXM,IAAOR,IAAIE,GACXO,IAAOR,IAAIC;AAEjB,cAAK,MAAM,CAACQ,GAAMlB,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,MAAO;AAC3C,QAAI,CAACa,EAAK;AACR,SAAG;AACD,cAAMC,IAAID,EAAK;AACf,QAAInB,EAASQ,GAAGC,GAAGC,GAAG,KAAK,GAAGU,CAAC,GAAG,KAAK,GAAGA,CAAC,GAAG,KAAK,GAAGA,CAAC,CAAC,KAAKT,KAC3DC,EAAO,KAAKQ,CAAC;AAAA,MAEjB,SAASD,IAAOA,EAAK;AAEvB,WAAOlB,IAAKe,KAAQd,IAAKe,KAAQd,IAAKe,KAAQd,IAAKS,KAAQR,IAAKS,KAAQR,IAAKS;AAAA,EAC/E,CAAC,GAEMH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/octant.js

@@ -0,0 +1,7 @@
+function o(t, i, s, h, n, a, e) {
+  this.node = t, this.x0 = i, this.y0 = s, this.z0 = h, this.x1 = n, this.y1 = a, this.z1 = e;
+}
+export {
+  o as default
+};
+//# sourceMappingURL=octant.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/octant.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"octant.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/octant.js"],"sourcesContent":["function Octant(node, x0, y0, z0, x1, y1, z1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.z0 = z0;\n  this.x1 = x1;\n  this.y1 = y1;\n  this.z1 = z1;\n}\n\nexport { Octant as default };\n//# sourceMappingURL=octant.js.map\n"],"names":["Octant","node","x0","y0","z0","x1","y1","z1"],"mappings":"AAAA,SAASA,EAAOC,GAAMC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAC5C,OAAK,OAAON,GACZ,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC;AACZ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/octree.js

@@ -0,0 +1,55 @@
+import l, { addAll as h } from "./add.js";
+import p from "./cover.js";
+import u from "./data.js";
+import c from "./extent.js";
+import v from "./find.js";
+import { findAllWithinRadius as y } from "./findAll.js";
+import x, { removeAll as N } from "./remove.js";
+import A from "./root.js";
+import z from "./size.js";
+import g from "./visit.js";
+import w from "./visitAfter.js";
+import R, { defaultX as W } from "./x.js";
+import O, { defaultY as P } from "./y.js";
+import X, { defaultZ as Y } from "./z.js";
+function Z(e, r, o, a) {
+  var i = new n(r ?? W, o ?? P, a ?? Y, NaN, NaN, NaN, NaN, NaN, NaN);
+  return e == null ? i : i.addAll(e);
+}
+function n(e, r, o, a, i, s, f, m, d) {
+  this._x = e, this._y = r, this._z = o, this._x0 = a, this._y0 = i, this._z0 = s, this._x1 = f, this._y1 = m, this._z1 = d, this._root = void 0;
+}
+function _(e) {
+  for (var r = { data: e.data }, o = r; e = e.next; ) o = o.next = { data: e.data };
+  return r;
+}
+var t = Z.prototype = n.prototype;
+t.copy = function() {
+  var e = new n(this._x, this._y, this._z, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1), r = this._root, o, a;
+  if (!r) return e;
+  if (!r.length) return e._root = _(r), e;
+  for (o = [{ source: r, target: e._root = new Array(8) }]; r = o.pop(); )
+    for (var i = 0; i < 8; ++i)
+      (a = r.source[i]) && (a.length ? o.push({ source: a, target: r.target[i] = new Array(8) }) : r.target[i] = _(a));
+  return e;
+};
+t.add = l;
+t.addAll = h;
+t.cover = p;
+t.data = u;
+t.extent = c;
+t.find = v;
+t.findAllWithinRadius = y;
+t.remove = x;
+t.removeAll = N;
+t.root = A;
+t.size = z;
+t.visit = g;
+t.visitAfter = w;
+t.x = R;
+t.y = O;
+t.z = X;
+export {
+  Z as default
+};
+//# sourceMappingURL=octree.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/octree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"octree.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/octree.js"],"sourcesContent":["import tree_add, { addAll } from './add.js';\nimport tree_cover from './cover.js';\nimport tree_data from './data.js';\nimport tree_extent from './extent.js';\nimport tree_find from './find.js';\nimport { findAllWithinRadius } from './findAll.js';\nimport tree_remove, { removeAll } from './remove.js';\nimport tree_root from './root.js';\nimport tree_size from './size.js';\nimport tree_visit from './visit.js';\nimport tree_visitAfter from './visitAfter.js';\nimport tree_x, { defaultX } from './x.js';\nimport tree_y, { defaultY } from './y.js';\nimport tree_z, { defaultZ } from './z.js';\n\nfunction octree(nodes, x, y, z) {\n  var tree = new Octree(x == null ? defaultX : x, y == null ? defaultY : y, z == null ? defaultZ : z, NaN, NaN, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Octree(x, y, z, x0, y0, z0, x1, y1, z1) {\n  this._x = x;\n  this._y = y;\n  this._z = z;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._z0 = z0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._z1 = z1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = octree.prototype = Octree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Octree(this._x, this._y, this._z, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(8)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 8; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(8)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.findAllWithinRadius = findAllWithinRadius;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\ntreeProto.z = tree_z;\n\nexport { octree as default };\n//# sourceMappingURL=octree.js.map\n"],"names":["octree","nodes","x","y","z","tree","Octree","defaultX","defaultY","defaultZ","x0","y0","z0","x1","y1","z1","leaf_copy","leaf","copy","next","treeProto","node","child","tree_add","addAll","tree_cover","tree_data","tree_extent","tree_find","findAllWithinRadius","tree_remove","removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y","tree_z"],"mappings":";;;;;;;;;;;;;;AAeA,SAASA,EAAOC,GAAOC,GAAGC,GAAGC,GAAG;AAC9B,MAAIC,IAAO,IAAIC,EAAOJ,KAAYK,GAAcJ,KAAYK,GAAcJ,KAAYK,GAAc,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAChI,SAAOR,KAAS,OAAOI,IAAOA,EAAK,OAAOJ,CAAK;AACjD;AAEA,SAASK,EAAOJ,GAAGC,GAAGC,GAAGM,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC,GAAI;AAC/C,OAAK,KAAKb,GACV,KAAK,KAAKC,GACV,KAAK,KAAKC,GACV,KAAK,MAAMM,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,QAAQ;AACf;AAEA,SAASC,EAAUC,GAAM;AAEvB,WADIC,IAAO,EAAC,MAAMD,EAAK,KAAI,GAAGE,IAAOD,GAC9BD,IAAOA,EAAK,OAAM,CAAAE,IAAOA,EAAK,OAAO,EAAC,MAAMF,EAAK,KAAI;AAC5D,SAAOC;AACT;AAEA,IAAIE,IAAYpB,EAAO,YAAYM,EAAO;AAE1Cc,EAAU,OAAO,WAAW;AAC1B,MAAIF,IAAO,IAAIZ,EAAO,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GACvGe,IAAO,KAAK,OACZpB,GACAqB;AAEJ,MAAI,CAACD,EAAM,QAAOH;AAElB,MAAI,CAACG,EAAK,OAAQ,QAAOH,EAAK,QAAQF,EAAUK,CAAI,GAAGH;AAGvD,OADAjB,IAAQ,CAAC,EAAC,QAAQoB,GAAM,QAAQH,EAAK,QAAQ,IAAI,MAAM,CAAC,EAAC,CAAC,GACnDG,IAAOpB,EAAM;AAClB,aAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,OAAIqB,IAAQD,EAAK,OAAO,CAAC,OACnBC,EAAM,SAAQrB,EAAM,KAAK,EAAC,QAAQqB,GAAO,QAAQD,EAAK,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,EAAC,CAAC,IAC9EA,EAAK,OAAO,CAAC,IAAIL,EAAUM,CAAK;AAK3C,SAAOJ;AACT;AAEAE,EAAU,MAAMG;AAChBH,EAAU,SAASI;AACnBJ,EAAU,QAAQK;AAClBL,EAAU,OAAOM;AACjBN,EAAU,SAASO;AACnBP,EAAU,OAAOQ;AACjBR,EAAU,sBAAsBS;AAChCT,EAAU,SAASU;AACnBV,EAAU,YAAYW;AACtBX,EAAU,OAAOY;AACjBZ,EAAU,OAAOa;AACjBb,EAAU,QAAQc;AAClBd,EAAU,aAAae;AACvBf,EAAU,IAAIgB;AACdhB,EAAU,IAAIiB;AACdjB,EAAU,IAAIkB;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-octree/src/remove.js

@@ -0,0 +1,21 @@
+function b(r) {
+  if (isNaN(z = +this._x.call(null, r)) || isNaN(v = +this._y.call(null, r)) || isNaN(N = +this._z.call(null, r))) return this;
+  var e, t = this._root, l, h, s, u = this._x0, x = this._y0, a = this._z0, _ = this._x1, m = this._y1, y = this._z1, z, v, N, n, f, o, c, g, p, i, d;
+  if (!t) return this;
+  if (t.length) for (; ; ) {
+    if ((c = z >= (n = (u + _) / 2)) ? u = n : _ = n, (g = v >= (f = (x + m) / 2)) ? x = f : m = f, (p = N >= (o = (a + y) / 2)) ? a = o : y = o, e = t, !(t = t[i = p << 2 | g << 1 | c])) return this;
+    if (!t.length) break;
+    (e[i + 1 & 7] || e[i + 2 & 7] || e[i + 3 & 7] || e[i + 4 & 7] || e[i + 5 & 7] || e[i + 6 & 7] || e[i + 7 & 7]) && (l = e, d = i);
+  }
+  for (; t.data !== r; ) if (h = t, !(t = t.next)) return this;
+  return (s = t.next) && delete t.next, h ? (s ? h.next = s : delete h.next, this) : e ? (s ? e[i] = s : delete e[i], (t = e[0] || e[1] || e[2] || e[3] || e[4] || e[5] || e[6] || e[7]) && t === (e[7] || e[6] || e[5] || e[4] || e[3] || e[2] || e[1] || e[0]) && !t.length && (l ? l[d] = t : this._root = t), this) : (this._root = s, this);
+}
+function w(r) {
+  for (var e = 0, t = r.length; e < t; ++e) this.remove(r[e]);
+  return this;
+}
+export {
+  b as default,
+  w as removeAll
+};
+//# sourceMappingURL=remove.js.map