@hkyhy/marsun-components-core 0.1.113 → 0.1.115

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

@@ -0,0 +1 @@
+{"version":3,"file":"remove.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/remove.js"],"sourcesContent":["function tree_remove(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1 = this._x1,\n      y1 = this._y1,\n      z1 = this._z1,\n      x,\n      y,\n      z,\n      xm,\n      ym,\n      zm,\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 this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\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 this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 7] || parent[(i + 2) & 7] || parent[(i + 3) & 7] || parent[(i + 4) & 7] || parent[(i + 5) & 7] || parent[(i + 6) & 7] || parent[(i + 7) & 7]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3] || parent[4] || parent[5] || parent[6] || parent[7])\n      && node === (parent[7] || parent[6] || parent[5] || parent[4] || parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nfunction removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n\nexport { tree_remove as default, removeAll };\n//# sourceMappingURL=remove.js.map\n"],"names":["tree_remove","d","x","y","z","parent","node","retainer","previous","next","x0","y0","z0","x1","y1","z1","xm","ym","zm","right","bottom","deep","j","removeAll","data","i","n"],"mappings":"AAAA,SAASA,EAAYC,GAAG;AACtB,MAAI,MAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,CAAC,KAAK,MAAME,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,KAAK,MAAMG,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMH,CAAC,CAAC,EAAG,QAAO;AAExH,MAAII,GACAC,IAAO,KAAK,OACZC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVb,GACAC,GACAC,GACAY,GACAC,GACAC,GACAC,GACAC,GACAC,GACA,GACAC;AAGJ,MAAI,CAAChB,EAAM,QAAO;AAIlB,MAAIA,EAAK,OAAQ,YAAa;AAI5B,SAHIa,IAAQjB,MAAMc,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,IACtDI,IAASjB,MAAMc,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,IACvDI,IAAOjB,MAAMc,KAAMN,IAAKG,KAAM,MAAIH,IAAKM,IAASH,IAAKG,GACnDb,IAASC,GAAM,EAAAA,IAAOA,EAAK,IAAIe,KAAQ,IAAID,KAAU,IAAID,CAAK,GAAI,QAAO;AAC/E,QAAI,CAACb,EAAK,OAAQ;AAClB,KAAID,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,OAAGE,IAAWF,GAAQiB,IAAI;AAAA,EAC5L;AAGA,SAAOhB,EAAK,SAASL,IAAG,KAAMO,IAAWF,GAAM,EAAAA,IAAOA,EAAK,MAAO,QAAO;AAIzE,UAHIG,IAAOH,EAAK,SAAM,OAAOA,EAAK,MAG9BE,KAAkBC,IAAOD,EAAS,OAAOC,IAAO,OAAOD,EAAS,MAAO,QAGtEH,KAGLI,IAAOJ,EAAO,CAAC,IAAII,IAAO,OAAOJ,EAAO,CAAC,IAGpCC,IAAOD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACxGC,OAAUD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MAC7G,CAACC,EAAK,WACPC,IAAUA,EAASe,CAAC,IAAIhB,IACvB,KAAK,QAAQA,IAGb,SAba,KAAK,QAAQG,GAAM;AAczC;AAEA,SAASc,EAAUC,GAAM;AACvB,WAASC,IAAI,GAAGC,IAAIF,EAAK,QAAQC,IAAIC,GAAG,EAAED,EAAG,MAAK,OAAOD,EAAKC,CAAC,CAAC;AAChE,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,7 @@
+function t() {
+  return this._root;
+}
+export {
+  t as default
+};
+//# sourceMappingURL=root.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"root.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/root.js"],"sourcesContent":["function tree_root() {\n  return this._root;\n}\n\nexport { tree_root as default };\n//# sourceMappingURL=root.js.map\n"],"names":["tree_root"],"mappings":"AAAA,SAASA,IAAY;AACnB,SAAO,KAAK;AACd;","x_google_ignoreList":[0]}

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

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

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

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

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

@@ -0,0 +1,14 @@
+import t from "./octant.js";
+function l(c) {
+  var s = [], e, h = this._root, i, u, o, w, r, _, a;
+  for (h && s.push(new t(h, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1)); e = s.pop(); )
+    if (!c(h = e.node, u = e.x0, o = e.y0, w = e.z0, r = e.x1, _ = e.y1, a = e.z1) && h.length) {
+      var n = (u + r) / 2, f = (o + _) / 2, p = (w + a) / 2;
+      (i = h[7]) && s.push(new t(i, n, f, p, r, _, a)), (i = h[6]) && s.push(new t(i, u, f, p, n, _, a)), (i = h[5]) && s.push(new t(i, n, o, p, r, f, a)), (i = h[4]) && s.push(new t(i, u, o, p, n, f, a)), (i = h[3]) && s.push(new t(i, n, f, w, r, _, p)), (i = h[2]) && s.push(new t(i, u, f, w, n, _, p)), (i = h[1]) && s.push(new t(i, n, o, w, r, f, p)), (i = h[0]) && s.push(new t(i, u, o, w, n, f, p));
+    }
+  return this;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=visit.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"visit.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/visit.js"],"sourcesContent":["import Octant from './octant.js';\n\nfunction tree_visit(callback) {\n  var octs = [], q, node = this._root, child, x0, y0, z0, x1, y1, z1;\n  if (node) octs.push(new Octant(node, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n  while (q = octs.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n      if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n      if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n      if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n      if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n      if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n      if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n      if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n      if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n    }\n  }\n  return this;\n}\n\nexport { tree_visit as default };\n//# sourceMappingURL=visit.js.map\n"],"names":["tree_visit","callback","octs","q","node","child","x0","y0","z0","x1","y1","z1","Octant","xm","ym","zm"],"mappings":";AAEA,SAASA,EAAWC,GAAU;AAC5B,MAAIC,IAAO,CAAA,GAAIC,GAAGC,IAAO,KAAK,OAAOC,GAAOC,GAAIC,GAAIC,GAAIC,GAAIC,GAAIC;AAEhE,OADIP,KAAMF,EAAK,KAAK,IAAIU,EAAOR,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACzFD,IAAID,EAAK;AACd,QAAI,CAACD,EAASG,IAAOD,EAAE,MAAMG,IAAKH,EAAE,IAAII,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,IAAIO,IAAKP,EAAE,IAAIQ,IAAKR,EAAE,EAAE,KAAKC,EAAK,QAAQ;AAC7G,UAAIS,KAAMP,IAAKG,KAAM,GAAGK,KAAMP,IAAKG,KAAM,GAAGK,KAAMP,IAAKG,KAAM;AAC7D,OAAIN,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOQ,GAAIC,GAAIC,GAAIN,GAAIC,GAAIC,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOC,GAAIQ,GAAIC,GAAIF,GAAIH,GAAIC,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOQ,GAAIN,GAAIQ,GAAIN,GAAIK,GAAIH,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOC,GAAIC,GAAIQ,GAAIF,GAAIC,GAAIH,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOQ,GAAIC,GAAIN,GAAIC,GAAIC,GAAIK,CAAE,CAAC,IACpEV,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOC,GAAIQ,GAAIN,GAAIK,GAAIH,GAAIK,CAAE,CAAC,IACpEV,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOQ,GAAIN,GAAIC,GAAIC,GAAIK,GAAIC,CAAE,CAAC,IACpEV,IAAQD,EAAK,CAAC,MAAGF,EAAK,KAAK,IAAIU,EAAOP,GAAOC,GAAIC,GAAIC,GAAIK,GAAIC,GAAIC,CAAE,CAAC;AAAA,IAC1E;AAEF,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,19 @@
+import e from "./octant.js";
+function A(g) {
+  var p = [], v = [], t;
+  for (this._root && p.push(new e(this._root, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1)); t = p.pop(); ) {
+    var f = t.node;
+    if (f.length) {
+      var s, i = t.x0, n = t.y0, _ = t.z0, h = t.x1, a = t.y1, o = t.z1, u = (i + h) / 2, r = (n + a) / 2, w = (_ + o) / 2;
+      (s = f[0]) && p.push(new e(s, i, n, _, u, r, w)), (s = f[1]) && p.push(new e(s, u, n, _, h, r, w)), (s = f[2]) && p.push(new e(s, i, r, _, u, a, w)), (s = f[3]) && p.push(new e(s, u, r, _, h, a, w)), (s = f[4]) && p.push(new e(s, i, n, w, u, r, o)), (s = f[5]) && p.push(new e(s, u, n, w, h, r, o)), (s = f[6]) && p.push(new e(s, i, r, w, u, a, o)), (s = f[7]) && p.push(new e(s, u, r, w, h, a, o));
+    }
+    v.push(t);
+  }
+  for (; t = v.pop(); )
+    g(t.node, t.x0, t.y0, t.z0, t.x1, t.y1, t.z1);
+  return this;
+}
+export {
+  A as default
+};
+//# sourceMappingURL=visitAfter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"visitAfter.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/visitAfter.js"],"sourcesContent":["import Octant from './octant.js';\n\nfunction tree_visitAfter(callback) {\n  var octs = [], next = [], q;\n  if (this._root) octs.push(new Octant(this._root, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n  while (q = octs.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n      if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n      if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n      if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n      if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n      if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n      if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n      if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n      if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.z0, q.x1, q.y1, q.z1);\n  }\n  return this;\n}\n\nexport { tree_visitAfter as default };\n//# sourceMappingURL=visitAfter.js.map\n"],"names":["tree_visitAfter","callback","octs","next","q","Octant","node","child","x0","y0","z0","x1","y1","z1","xm","ym","zm"],"mappings":";AAEA,SAASA,EAAgBC,GAAU;AACjC,MAAIC,IAAO,CAAA,GAAIC,IAAO,CAAA,GAAIC;AAE1B,OADI,KAAK,SAAOF,EAAK,KAAK,IAAIG,EAAO,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACrGD,IAAIF,EAAK,SAAO;AACrB,QAAII,IAAOF,EAAE;AACb,QAAIE,EAAK,QAAQ;AACf,UAAIC,GAAOC,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,IAAIO,IAAKP,EAAE,IAAIQ,IAAKR,EAAE,IAAIS,IAAKT,EAAE,IAAIU,KAAMN,IAAKG,KAAM,GAAGI,KAAMN,IAAKG,KAAM,GAAGI,KAAMN,IAAKG,KAAM;AACtI,OAAIN,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOC,GAAIC,GAAIC,GAAII,GAAIC,GAAIC,CAAE,CAAC,IACpET,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOO,GAAIL,GAAIC,GAAIC,GAAII,GAAIC,CAAE,CAAC,IACpET,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOC,GAAIO,GAAIL,GAAII,GAAIF,GAAII,CAAE,CAAC,IACpET,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOO,GAAIC,GAAIL,GAAIC,GAAIC,GAAII,CAAE,CAAC,IACpET,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOC,GAAIC,GAAIO,GAAIF,GAAIC,GAAIF,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOO,GAAIL,GAAIO,GAAIL,GAAII,GAAIF,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOC,GAAIO,GAAIC,GAAIF,GAAIF,GAAIC,CAAE,CAAC,IACpEN,IAAQD,EAAK,CAAC,MAAGJ,EAAK,KAAK,IAAIG,EAAOE,GAAOO,GAAIC,GAAIC,GAAIL,GAAIC,GAAIC,CAAE,CAAC;AAAA,IAC1E;AACA,IAAAV,EAAK,KAAKC,CAAC;AAAA,EACb;AACA,SAAOA,IAAID,EAAK;AACd,IAAAF,EAASG,EAAE,MAAMA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,EAAE;AAErD,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,11 @@
+function e(t) {
+  return t[0];
+}
+function n(t) {
+  return arguments.length ? (this._x = t, this) : this._x;
+}
+export {
+  n as default,
+  e as defaultX
+};
+//# sourceMappingURL=x.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"x.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/x.js"],"sourcesContent":["function defaultX(d) {\n  return d[0];\n}\n\nfunction tree_x(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n\nexport { tree_x as default, defaultX };\n//# sourceMappingURL=x.js.map\n"],"names":["defaultX","d","tree_x","_"],"mappings":"AAAA,SAASA,EAASC,GAAG;AACnB,SAAOA,EAAE,CAAC;AACZ;AAEA,SAASC,EAAOC,GAAG;AACjB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,11 @@
+function e(t) {
+  return t[1];
+}
+function n(t) {
+  return arguments.length ? (this._y = t, this) : this._y;
+}
+export {
+  n as default,
+  e as defaultY
+};
+//# sourceMappingURL=y.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"y.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/y.js"],"sourcesContent":["function defaultY(d) {\n  return d[1];\n}\n\nfunction tree_y(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n\nexport { tree_y as default, defaultY };\n//# sourceMappingURL=y.js.map\n"],"names":["defaultY","d","tree_y","_"],"mappings":"AAAA,SAASA,EAASC,GAAG;AACnB,SAAOA,EAAE,CAAC;AACZ;AAEA,SAASC,EAAOC,GAAG;AACjB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,11 @@
+function e(t) {
+  return t[2];
+}
+function n(t) {
+  return arguments.length ? (this._z = t, this) : this._z;
+}
+export {
+  n as default,
+  e as defaultZ
+};
+//# sourceMappingURL=z.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"z.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-octree/src/z.js"],"sourcesContent":["function defaultZ(d) {\n  return d[2];\n}\n\nfunction tree_z(_) {\n  return arguments.length ? (this._z = _, this) : this._z;\n}\n\nexport { tree_z as default, defaultZ };\n//# sourceMappingURL=z.js.map\n"],"names":["defaultZ","d","tree_z","_"],"mappings":"AAAA,SAASA,EAASC,GAAG;AACnB,SAAOA,EAAE,CAAC;AACZ;AAEA,SAASC,EAAOC,GAAG;AACjB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"add.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/add.js"],"sourcesContent":["function tree_add$2(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add$2(this.cover(x, y), x, y, d);\n}\n\nfunction add$2(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) 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      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\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 (parent = node, !(node = node[i = 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  if (x === xp && y === yp) 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(4) : tree._root = new Array(4);\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  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nfunction addAll$2(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\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  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add$2(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n\nexport { addAll$2 as addAll, tree_add$2 as default };\n//# sourceMappingURL=add.js.map\n"],"names":["tree_add$2","d","x","y","add$2","tree","parent","node","leaf","x0","y0","x1","y1","xm","ym","xp","yp","right","bottom","i","j","addAll$2","data","n","xz","yz"],"mappings":"AAAA,SAASA,EAAWC,GAAG;AACrB,QAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,GAC3BE,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC;AAC7B,SAAOG,EAAM,KAAK,MAAMF,GAAGC,CAAC,GAAGD,GAAGC,GAAGF,CAAC;AACxC;AAEA,SAASG,EAAMC,GAAMH,GAAGC,GAAGF,GAAG;AAC5B,MAAI,MAAMC,CAAC,KAAK,MAAMC,CAAC,EAAG,QAAOE;AAEjC,MAAIC,GACAC,IAAOF,EAAK,OACZG,IAAO,EAAC,MAAMP,EAAC,GACfQ,IAAKJ,EAAK,KACVK,IAAKL,EAAK,KACVM,IAAKN,EAAK,KACVO,IAAKP,EAAK,KACVQ,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACb,EAAM,QAAOF,EAAK,QAAQG,GAAMH;AAGrC,SAAOE,EAAK;AAGV,SAFIU,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACvDR,IAASC,GAAM,EAAEA,IAAOA,EAAKY,IAAID,KAAU,IAAID,CAAK,GAAI,QAAOX,EAAOa,CAAC,IAAIX,GAAMH;AAMvF,MAFAU,IAAK,CAACV,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAClCS,IAAK,CAACX,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAC9BL,MAAMa,KAAMZ,MAAMa,EAAI,QAAOR,EAAK,OAAOD,GAAMD,IAASA,EAAOa,CAAC,IAAIX,IAAOH,EAAK,QAAQG,GAAMH;AAGlG;AACE,IAAAC,IAASA,IAASA,EAAOa,CAAC,IAAI,IAAI,MAAM,CAAC,IAAId,EAAK,QAAQ,IAAI,MAAM,CAAC,IACjEY,IAAQf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDK,IAASf,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE;AAAA,UACnDK,IAAID,KAAU,IAAID,QAAYG,KAAKJ,KAAMF,MAAO,IAAKC,KAAMF;AACrE,SAAOP,EAAOc,CAAC,IAAIb,GAAMD,EAAOa,CAAC,IAAIX,GAAMH;AAC7C;AAEA,SAASgB,EAASC,GAAM;AACtB,MAAIrB,GAAGkB,GAAGI,IAAID,EAAK,QACfpB,GACAC,GACAqB,IAAK,IAAI,MAAMD,CAAC,GAChBE,IAAK,IAAI,MAAMF,CAAC,GAChBd,IAAK,OACLC,IAAK,OACLC,IAAK,QACLC,IAAK;AAGT,OAAKO,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,IAAI,MAAMjB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,IAAIqB,EAAKH,CAAC,CAAC,CAAC,KAAK,MAAMhB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,MACnFuB,EAAGL,CAAC,IAAIjB,GACRuB,EAAGN,CAAC,IAAIhB,GACJD,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT,IACbC,IAAIO,MAAIA,IAAKP,IACbA,IAAIS,MAAIA,IAAKT;AAInB,MAAIM,IAAKE,KAAMD,IAAKE,EAAI,QAAO;AAM/B,OAHA,KAAK,MAAMH,GAAIC,CAAE,EAAE,MAAMC,GAAIC,CAAE,GAG1BO,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACnB,IAAAf,EAAM,MAAMoB,EAAGL,CAAC,GAAGM,EAAGN,CAAC,GAAGG,EAAKH,CAAC,CAAC;AAGnC,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"cover.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/cover.js"],"sourcesContent":["function tree_cover$2(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant 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  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; 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._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n\nexport { tree_cover$2 as default };\n//# sourceMappingURL=cover.js.map\n"],"names":["tree_cover$2","x","y","x0","y0","x1","y1","z","node","parent","i"],"mappings":"AAAA,SAASA,EAAaC,GAAGC,GAAG;AAC1B,MAAI,MAAMD,IAAI,CAACA,CAAC,KAAK,MAAMC,IAAI,CAACA,CAAC,EAAG,QAAO;AAE3C,MAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK;AAKd,MAAI,MAAMH,CAAE;AACV,IAAAE,KAAMF,IAAK,KAAK,MAAMF,CAAC,KAAK,GAC5BK,KAAMF,IAAK,KAAK,MAAMF,CAAC,KAAK;AAAA,OAIzB;AAMH,aALIK,IAAIF,IAAKF,KAAM,GACfK,IAAO,KAAK,OACZC,GACAC,GAEGP,IAAKF,KAAKA,KAAKI,KAAMD,IAAKF,KAAKA,KAAKI;AAGzC,cAFAI,KAAKR,IAAIE,MAAO,IAAKH,IAAIE,GACzBM,IAAS,IAAI,MAAM,CAAC,GAAGA,EAAOC,CAAC,IAAIF,GAAMA,IAAOC,GAAQF,KAAK,GACrDG,GAAC;AAAA,QACP,KAAK;AAAG,UAAAL,IAAKF,IAAKI,GAAGD,IAAKF,IAAKG;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAJ,IAAKE,IAAKE,GAAGD,IAAKF,IAAKG;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAF,IAAKF,IAAKI,GAAGH,IAAKE,IAAKC;AAAG;AAAA,QAClC,KAAK;AAAG,UAAAJ,IAAKE,IAAKE,GAAGH,IAAKE,IAAKC;AAAG;AAAA,MAC1C;AAGI,IAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQC;AAAA,EACpD;AAEA,cAAK,MAAML,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-quadtree/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-quadtree/src/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/data.js"],"sourcesContent":["function tree_data$2() {\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$2 as default };\n//# sourceMappingURL=data.js.map\n"],"names":["tree_data$2","data","node"],"mappings":"AAAA,SAASA,IAAc;AACrB,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-quadtree/src/extent.js

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"extent.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/extent.js"],"sourcesContent":["function tree_extent$2(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n\nexport { tree_extent$2 as default };\n//# sourceMappingURL=extent.js.map\n"],"names":["tree_extent$2","_"],"mappings":"AAAA,SAASA,EAAcC,GAAG;AACxB,SAAO,UAAU,SACX,KAAK,MAAM,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,CAAC,IACvD,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC;AACjF;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,26 @@
+import o from "./quad.js";
+function j(h, i, n) {
+  var $, _ = this._x0, p = this._y0, w, g, s, c, v = this._x1, q = this._y1, t = [], e = this._root, l, u;
+  for (e && t.push(new o(e, _, p, v, q)), n == null ? n = 1 / 0 : (_ = h - n, p = i - n, v = h + n, q = i + n, n *= n); l = t.pop(); )
+    if (!(!(e = l.node) || (w = l.x0) > v || (g = l.y0) > q || (s = l.x1) < _ || (c = l.y1) < p))
+      if (e.length) {
+        var f = (w + s) / 2, a = (g + c) / 2;
+        t.push(
+          new o(e[3], f, a, s, c),
+          new o(e[2], w, a, f, c),
+          new o(e[1], f, g, s, a),
+          new o(e[0], w, g, f, a)
+        ), (u = (i >= a) << 1 | h >= f) && (l = t[t.length - 1], t[t.length - 1] = t[t.length - 1 - u], t[t.length - 1 - u] = l);
+      } else {
+        var I = h - +this._x.call(null, e.data), M = i - +this._y.call(null, e.data), Q = I * I + M * M;
+        if (Q < n) {
+          var r = Math.sqrt(n = Q);
+          _ = h - r, p = i - r, v = h + r, q = i + r, $ = e.data;
+        }
+      }
+  return $;
+}
+export {
+  j as default
+};
+//# sourceMappingURL=find.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/find.js"],"sourcesContent":["import Quad from './quad.js';\n\nfunction tree_find$2(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.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          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n\nexport { tree_find$2 as default };\n//# sourceMappingURL=find.js.map\n"],"names":["tree_find$2","x","y","radius","data","x0","y0","x1","y1","x2","y2","x3","y3","quads","node","q","i","Quad","xm","ym","dx","dy","d2","d"],"mappings":";AAEA,SAASA,EAAYC,GAAGC,GAAGC,GAAQ;AACjC,MAAIC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,GACAC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAQ,CAAA,GACRC,IAAO,KAAK,OACZC,GACAC;AAUJ,OARIF,KAAMD,EAAM,KAAK,IAAII,EAAKH,GAAMT,GAAIC,GAAIK,GAAIC,CAAE,CAAC,GAC/CT,KAAU,OAAMA,IAAS,SAE3BE,IAAKJ,IAAIE,GAAQG,IAAKJ,IAAIC,GAC1BQ,IAAKV,IAAIE,GAAQS,IAAKV,IAAIC,GAC1BA,KAAUA,IAGLY,IAAIF,EAAM;AAGf,QAAI,IAAEC,IAAOC,EAAE,UACPR,IAAKQ,EAAE,MAAMJ,MACbH,IAAKO,EAAE,MAAMH,MACbH,IAAKM,EAAE,MAAMV,MACbK,IAAKK,EAAE,MAAMT;AAGrB,UAAIQ,EAAK,QAAQ;AACf,YAAII,KAAMX,IAAKE,KAAM,GACjBU,KAAMX,IAAKE,KAAM;AAErB,QAAAG,EAAM;AAAA,UACJ,IAAII,EAAKH,EAAK,CAAC,GAAGI,GAAIC,GAAIV,GAAIC,CAAE;AAAA,UAChC,IAAIO,EAAKH,EAAK,CAAC,GAAGP,GAAIY,GAAID,GAAIR,CAAE;AAAA,UAChC,IAAIO,EAAKH,EAAK,CAAC,GAAGI,GAAIV,GAAIC,GAAIU,CAAE;AAAA,UAChC,IAAIF,EAAKH,EAAK,CAAC,GAAGP,GAAIC,GAAIU,GAAIC,CAAE;AAAA,QACxC,IAGUH,KAAKd,KAAKiB,MAAO,IAAKlB,KAAKiB,OAC7BH,IAAIF,EAAMA,EAAM,SAAS,CAAC,GAC1BA,EAAMA,EAAM,SAAS,CAAC,IAAIA,EAAMA,EAAM,SAAS,IAAIG,CAAC,GACpDH,EAAMA,EAAM,SAAS,IAAIG,CAAC,IAAID;AAAA,MAElC,OAGK;AACH,YAAIK,IAAKnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMa,EAAK,IAAI,GACtCO,IAAKnB,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMY,EAAK,IAAI,GACtCQ,IAAKF,IAAKA,IAAKC,IAAKA;AACxB,YAAIC,IAAKnB,GAAQ;AACf,cAAIoB,IAAI,KAAK,KAAKpB,IAASmB,CAAE;AAC7B,UAAAjB,IAAKJ,IAAIsB,GAAGjB,IAAKJ,IAAIqB,GACrBZ,IAAKV,IAAIsB,GAAGX,IAAKV,IAAIqB,GACrBnB,IAAOU,EAAK;AAAA,QACd;AAAA,MACF;AAGF,SAAOV;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"quad.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/quad.js"],"sourcesContent":["function Quad$1(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n\nexport { Quad$1 as default };\n//# sourceMappingURL=quad.js.map\n"],"names":["Quad$1","node","x0","y0","x1","y1"],"mappings":"AAAA,SAASA,EAAOC,GAAMC,GAAIC,GAAIC,GAAIC,GAAI;AACpC,OAAK,OAAOJ,GACZ,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-quadtree/src/quadtree.js

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"quadtree.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/quadtree.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 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';\n\nfunction quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy$2(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$2 = quadtree.prototype = Quadtree.prototype;\n\ntreeProto$2.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy$2(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy$2(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto$2.add = tree_add;\ntreeProto$2.addAll = addAll;\ntreeProto$2.cover = tree_cover;\ntreeProto$2.data = tree_data;\ntreeProto$2.extent = tree_extent;\ntreeProto$2.find = tree_find;\ntreeProto$2.remove = tree_remove;\ntreeProto$2.removeAll = removeAll;\ntreeProto$2.root = tree_root;\ntreeProto$2.size = tree_size;\ntreeProto$2.visit = tree_visit;\ntreeProto$2.visitAfter = tree_visitAfter;\ntreeProto$2.x = tree_x;\ntreeProto$2.y = tree_y;\n\nexport { quadtree as default };\n//# sourceMappingURL=quadtree.js.map\n"],"names":["quadtree","nodes","x","y","tree","Quadtree","defaultX","defaultY","x0","y0","x1","y1","leaf_copy$2","leaf","copy","next","treeProto$2","node","child","i","tree_add","addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x","tree_y"],"mappings":";;;;;;;;;;;;AAaA,SAASA,EAASC,GAAOC,GAAGC,GAAG;AAC7B,MAAIC,IAAO,IAAIC,EAASH,KAAYI,GAAcH,KAAYI,GAAc,KAAK,KAAK,KAAK,GAAG;AAC9F,SAAON,KAAS,OAAOG,IAAOA,EAAK,OAAOH,CAAK;AACjD;AAEA,SAASI,EAASH,GAAGC,GAAGK,GAAIC,GAAIC,GAAIC,GAAI;AACtC,OAAK,KAAKT,GACV,KAAK,KAAKC,GACV,KAAK,MAAMK,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,MAAMC,GACX,KAAK,QAAQ;AACf;AAEA,SAASC,EAAYC,GAAM;AAEzB,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,IAAchB,EAAS,YAAYK,EAAS;AAEhDW,EAAY,OAAO,WAAW;AAC5B,MAAIF,IAAO,IAAIT,EAAS,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,GAC5EY,IAAO,KAAK,OACZhB,GACAiB;AAEJ,MAAI,CAACD,EAAM,QAAOH;AAElB,MAAI,CAACG,EAAK,OAAQ,QAAOH,EAAK,QAAQF,EAAYK,CAAI,GAAGH;AAGzD,OADAb,IAAQ,CAAC,EAAC,QAAQgB,GAAM,QAAQH,EAAK,QAAQ,IAAI,MAAM,CAAC,EAAC,CAAC,GACnDG,IAAOhB,EAAM;AAClB,aAASkB,IAAI,GAAGA,IAAI,GAAG,EAAEA;AACvB,OAAID,IAAQD,EAAK,OAAOE,CAAC,OACnBD,EAAM,SAAQjB,EAAM,KAAK,EAAC,QAAQiB,GAAO,QAAQD,EAAK,OAAOE,CAAC,IAAI,IAAI,MAAM,CAAC,EAAC,CAAC,IAC9EF,EAAK,OAAOE,CAAC,IAAIP,EAAYM,CAAK;AAK7C,SAAOJ;AACT;AAEAE,EAAY,MAAMI;AAClBJ,EAAY,SAASK;AACrBL,EAAY,QAAQM;AACpBN,EAAY,OAAOO;AACnBP,EAAY,SAASQ;AACrBR,EAAY,OAAOS;AACnBT,EAAY,SAASU;AACrBV,EAAY,YAAYW;AACxBX,EAAY,OAAOY;AACnBZ,EAAY,OAAOa;AACnBb,EAAY,QAAQc;AACpBd,EAAY,aAAae;AACzBf,EAAY,IAAIgB;AAChBhB,EAAY,IAAIiB;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"remove.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/remove.js"],"sourcesContent":["function tree_remove$2(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\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 (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nfunction removeAll$2(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n\nexport { tree_remove$2 as default, removeAll$2 as removeAll };\n//# sourceMappingURL=remove.js.map\n"],"names":["tree_remove$2","d","x","y","parent","node","retainer","previous","next","x0","y0","x1","y1","xm","ym","right","bottom","j","removeAll$2","data","i","n"],"mappings":"AAAA,SAASA,EAAcC,GAAG;AACxB,MAAI,MAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,CAAC,KAAK,MAAME,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMF,CAAC,CAAC,EAAG,QAAO;AAEnF,MAAIG,GACAC,IAAO,KAAK,OACZC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVV,GACAC,GACAU,GACAC,GACAC,GACAC,GACA,GACAC;AAGJ,MAAI,CAACZ,EAAM,QAAO;AAIlB,MAAIA,EAAK,OAAQ,YAAa;AAG5B,SAFIU,IAAQb,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,IACtDG,IAASb,MAAMW,KAAMJ,IAAKE,KAAM,MAAIF,IAAKI,IAASF,IAAKE,GACrDV,IAASC,GAAM,EAAAA,IAAOA,EAAK,IAAIW,KAAU,IAAID,CAAK,GAAI,QAAO;AACnE,QAAI,CAACV,EAAK,OAAQ;AAClB,KAAID,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,KAAKA,EAAQ,IAAI,IAAK,CAAC,OAAGE,IAAWF,GAAQa,IAAI;AAAA,EAChG;AAGA,SAAOZ,EAAK,SAASJ,IAAG,KAAMM,IAAWF,GAAM,EAAAA,IAAOA,EAAK,MAAO,QAAO;AAIzE,UAHIG,IAAOH,EAAK,SAAM,OAAOA,EAAK,MAG9BE,KAAkBC,IAAOD,EAAS,OAAOC,IAAO,OAAOD,EAAS,MAAO,QAGtEH,KAGLI,IAAOJ,EAAO,CAAC,IAAII,IAAO,OAAOJ,EAAO,CAAC,IAGpCC,IAAOD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACpDC,OAAUD,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,KAAKA,EAAO,CAAC,MACzD,CAACC,EAAK,WACPC,IAAUA,EAASW,CAAC,IAAIZ,IACvB,KAAK,QAAQA,IAGb,SAba,KAAK,QAAQG,GAAM;AAczC;AAEA,SAASU,EAAYC,GAAM;AACzB,WAASC,IAAI,GAAGC,IAAIF,EAAK,QAAQC,IAAIC,GAAG,EAAED,EAAG,MAAK,OAAOD,EAAKC,CAAC,CAAC;AAChE,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,7 @@
+function t() {
+  return this._root;
+}
+export {
+  t as default
+};
+//# sourceMappingURL=root.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"root.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/root.js"],"sourcesContent":["function tree_root$2() {\n  return this._root;\n}\n\nexport { tree_root$2 as default };\n//# sourceMappingURL=root.js.map\n"],"names":["tree_root$2"],"mappings":"AAAA,SAASA,IAAc;AACrB,SAAO,KAAK;AACd;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"size.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/size.js"],"sourcesContent":["function tree_size$2() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n\nexport { tree_size$2 as default };\n//# sourceMappingURL=size.js.map\n"],"names":["tree_size$2","size","node"],"mappings":"AAAA,SAASA,IAAc;AACrB,MAAIC,IAAO;AACX,cAAK,MAAM,SAASC,GAAM;AACxB,QAAI,CAACA,EAAK,OAAQ;AAAG,QAAED;AAAA,WAAaC,IAAOA,EAAK;AAAA,EAClD,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,14 @@
+import s from "./quad.js";
+function w(a) {
+  var e = [], h, i = this._root, t, n, u, f, o;
+  for (i && e.push(new s(i, this._x0, this._y0, this._x1, this._y1)); h = e.pop(); )
+    if (!a(i = h.node, n = h.x0, u = h.y0, f = h.x1, o = h.y1) && i.length) {
+      var p = (n + f) / 2, r = (u + o) / 2;
+      (t = i[3]) && e.push(new s(t, p, r, f, o)), (t = i[2]) && e.push(new s(t, n, r, p, o)), (t = i[1]) && e.push(new s(t, p, u, f, r)), (t = i[0]) && e.push(new s(t, n, u, p, r));
+    }
+  return this;
+}
+export {
+  w as default
+};
+//# sourceMappingURL=visit.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"visit.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/visit.js"],"sourcesContent":["import Quad from './quad.js';\n\nfunction tree_visit$2(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n\nexport { tree_visit$2 as default };\n//# sourceMappingURL=visit.js.map\n"],"names":["tree_visit$2","callback","quads","q","node","child","x0","y0","x1","y1","Quad","xm","ym"],"mappings":";AAEA,SAASA,EAAaC,GAAU;AAC9B,MAAIC,IAAQ,CAAA,GAAIC,GAAGC,IAAO,KAAK,OAAOC,GAAOC,GAAIC,GAAIC,GAAIC;AAEzD,OADIL,KAAMF,EAAM,KAAK,IAAIQ,EAAKN,GAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GACpED,IAAID,EAAM;AACf,QAAI,CAACD,EAASG,IAAOD,EAAE,MAAMG,IAAKH,EAAE,IAAII,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,EAAE,KAAKC,EAAK,QAAQ;AACvF,UAAIO,KAAML,IAAKE,KAAM,GAAGI,KAAML,IAAKE,KAAM;AACzC,OAAIJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOM,GAAIC,GAAIJ,GAAIC,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOC,GAAIM,GAAID,GAAIF,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOM,GAAIJ,GAAIC,GAAII,CAAE,CAAC,IAC3DP,IAAQD,EAAK,CAAC,MAAGF,EAAM,KAAK,IAAIQ,EAAKL,GAAOC,GAAIC,GAAII,GAAIC,CAAE,CAAC;AAAA,IACjE;AAEF,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,19 @@
+import p from "./quad.js";
+function v(w) {
+  var e = [], a = [], t;
+  for (this._root && e.push(new p(this._root, this._x0, this._y0, this._x1, this._y1)); t = e.pop(); ) {
+    var i = t.node;
+    if (i.length) {
+      var s, f = t.x0, h = t.y0, n = t.x1, o = t.y1, r = (f + n) / 2, u = (h + o) / 2;
+      (s = i[0]) && e.push(new p(s, f, h, r, u)), (s = i[1]) && e.push(new p(s, r, h, n, u)), (s = i[2]) && e.push(new p(s, f, u, r, o)), (s = i[3]) && e.push(new p(s, r, u, n, o));
+    }
+    a.push(t);
+  }
+  for (; t = a.pop(); )
+    w(t.node, t.x0, t.y0, t.x1, t.y1);
+  return this;
+}
+export {
+  v as default
+};
+//# sourceMappingURL=visitAfter.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"visitAfter.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/visitAfter.js"],"sourcesContent":["import Quad from './quad.js';\n\nfunction tree_visitAfter$2(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n\nexport { tree_visitAfter$2 as default };\n//# sourceMappingURL=visitAfter.js.map\n"],"names":["tree_visitAfter$2","callback","quads","next","q","Quad","node","child","x0","y0","x1","y1","xm","ym"],"mappings":";AAEA,SAASA,EAAkBC,GAAU;AACnC,MAAIC,IAAQ,CAAA,GAAIC,IAAO,CAAA,GAAIC;AAE3B,OADI,KAAK,SAAOF,EAAM,KAAK,IAAIG,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,GAChFD,IAAIF,EAAM,SAAO;AACtB,QAAII,IAAOF,EAAE;AACb,QAAIE,EAAK,QAAQ;AACf,UAAIC,GAAOC,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,IAAKN,EAAE,IAAIO,IAAKP,EAAE,IAAIQ,KAAMJ,IAAKE,KAAM,GAAGG,KAAMJ,IAAKE,KAAM;AAC5F,OAAIJ,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOC,GAAIC,GAAIG,GAAIC,CAAE,CAAC,IAC3DN,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOK,GAAIH,GAAIC,GAAIG,CAAE,CAAC,IAC3DN,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOC,GAAIK,GAAID,GAAID,CAAE,CAAC,IAC3DJ,IAAQD,EAAK,CAAC,MAAGJ,EAAM,KAAK,IAAIG,EAAKE,GAAOK,GAAIC,GAAIH,GAAIC,CAAE,CAAC;AAAA,IACjE;AACA,IAAAR,EAAK,KAAKC,CAAC;AAAA,EACb;AACA,SAAOA,IAAID,EAAK;AACd,IAAAF,EAASG,EAAE,MAAMA,EAAE,IAAIA,EAAE,IAAIA,EAAE,IAAIA,EAAE,EAAE;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,11 @@
+function e(t) {
+  return t[0];
+}
+function n(t) {
+  return arguments.length ? (this._x = t, this) : this._x;
+}
+export {
+  n as default,
+  e as defaultX
+};
+//# sourceMappingURL=x.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"x.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/x.js"],"sourcesContent":["function defaultX$2(d) {\n  return d[0];\n}\n\nfunction tree_x$2(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n\nexport { tree_x$2 as default, defaultX$2 as defaultX };\n//# sourceMappingURL=x.js.map\n"],"names":["defaultX$2","d","tree_x$2","_"],"mappings":"AAAA,SAASA,EAAWC,GAAG;AACrB,SAAOA,EAAE,CAAC;AACZ;AAEA,SAASC,EAASC,GAAG;AACnB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,11 @@
+function e(t) {
+  return t[1];
+}
+function n(t) {
+  return arguments.length ? (this._y = t, this) : this._y;
+}
+export {
+  n as default,
+  e as defaultY
+};
+//# sourceMappingURL=y.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"y.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-quadtree/src/y.js"],"sourcesContent":["function defaultY$1(d) {\n  return d[1];\n}\n\nfunction tree_y$1(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n\nexport { tree_y$1 as default, defaultY$1 as defaultY };\n//# sourceMappingURL=y.js.map\n"],"names":["defaultY$1","d","tree_y$1","_"],"mappings":"AAAA,SAASA,EAAWC,GAAG;AACrB,SAAOA,EAAE,CAAC;AACZ;AAEA,SAASC,EAASC,GAAG;AACnB,SAAO,UAAU,UAAU,KAAK,KAAKA,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,63 @@
+var r = 0, a = 0, l = 0, p = 1e3, s, f, u = 0, i = 0, w = 0, c = typeof performance == "object" && performance.now ? performance : Date, y = typeof window == "object" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(t) {
+  setTimeout(t, 17);
+};
+function k() {
+  return i || (y(d), i = c.now() + w);
+}
+function d() {
+  i = 0;
+}
+function _() {
+  this._call = this._time = this._next = null;
+}
+_.prototype = v.prototype = {
+  constructor: _,
+  restart: function(t, n, e) {
+    if (typeof t != "function") throw new TypeError("callback is not a function");
+    e = (e == null ? k() : +e) + (n == null ? 0 : +n), !this._next && f !== this && (f ? f._next = this : s = this, f = this), this._call = t, this._time = e, m();
+  },
+  stop: function() {
+    this._call && (this._call = null, this._time = 1 / 0, m());
+  }
+};
+function v(t, n, e) {
+  var o = new _();
+  return o.restart(t, n, e), o;
+}
+function x() {
+  k(), ++r;
+  for (var t = s, n; t; )
+    (n = i - t._time) >= 0 && t._call.call(void 0, n), t = t._next;
+  --r;
+}
+function h() {
+  i = (u = c.now()) + w, r = a = 0;
+  try {
+    x();
+  } finally {
+    r = 0, I(), i = 0;
+  }
+}
+function T() {
+  var t = c.now(), n = t - u;
+  n > p && (w -= n, u = t);
+}
+function I() {
+  for (var t, n = s, e, o = 1 / 0; n; )
+    n._call ? (o > n._time && (o = n._time), t = n, n = n._next) : (e = n._next, n._next = null, n = t ? t._next = e : s = e);
+  f = t, m(o);
+}
+function m(t) {
+  if (!r) {
+    a && (a = clearTimeout(a));
+    var n = t - i;
+    n > 24 ? (t < 1 / 0 && (a = setTimeout(h, t - c.now() - w)), l && (l = clearInterval(l))) : (l || (u = c.now(), l = setInterval(T, p)), r = 1, y(h));
+  }
+}
+export {
+  _ as Timer,
+  k as now,
+  v as timer,
+  x as timerFlush
+};
+//# sourceMappingURL=timer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"timer.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-timer/src/timer.js"],"sourcesContent":["var frame = 0, // is an animation frame pending?\n    timeout = 0, // is a timeout pending?\n    interval = 0, // are any timers active?\n    pokeDelay = 1000, // how frequently we check for clock skew\n    taskHead,\n    taskTail,\n    clockLast = 0,\n    clockNow = 0,\n    clockSkew = 0,\n    clock = typeof performance === \"object\" && performance.now ? performance : Date,\n    setFrame = typeof window === \"object\" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };\n\nfunction now() {\n  return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);\n}\n\nfunction clearNow() {\n  clockNow = 0;\n}\n\nfunction Timer() {\n  this._call =\n  this._time =\n  this._next = null;\n}\n\nTimer.prototype = timer.prototype = {\n  constructor: Timer,\n  restart: function(callback, delay, time) {\n    if (typeof callback !== \"function\") throw new TypeError(\"callback is not a function\");\n    time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);\n    if (!this._next && taskTail !== this) {\n      if (taskTail) taskTail._next = this;\n      else taskHead = this;\n      taskTail = this;\n    }\n    this._call = callback;\n    this._time = time;\n    sleep();\n  },\n  stop: function() {\n    if (this._call) {\n      this._call = null;\n      this._time = Infinity;\n      sleep();\n    }\n  }\n};\n\nfunction timer(callback, delay, time) {\n  var t = new Timer;\n  t.restart(callback, delay, time);\n  return t;\n}\n\nfunction timerFlush() {\n  now(); // Get the current time, if not already set.\n  ++frame; // Pretend we’ve set an alarm, if we haven’t already.\n  var t = taskHead, e;\n  while (t) {\n    if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);\n    t = t._next;\n  }\n  --frame;\n}\n\nfunction wake() {\n  clockNow = (clockLast = clock.now()) + clockSkew;\n  frame = timeout = 0;\n  try {\n    timerFlush();\n  } finally {\n    frame = 0;\n    nap();\n    clockNow = 0;\n  }\n}\n\nfunction poke() {\n  var now = clock.now(), delay = now - clockLast;\n  if (delay > pokeDelay) clockSkew -= delay, clockLast = now;\n}\n\nfunction nap() {\n  var t0, t1 = taskHead, t2, time = Infinity;\n  while (t1) {\n    if (t1._call) {\n      if (time > t1._time) time = t1._time;\n      t0 = t1, t1 = t1._next;\n    } else {\n      t2 = t1._next, t1._next = null;\n      t1 = t0 ? t0._next = t2 : taskHead = t2;\n    }\n  }\n  taskTail = t0;\n  sleep(time);\n}\n\nfunction sleep(time) {\n  if (frame) return; // Soonest alarm already set, or will be.\n  if (timeout) timeout = clearTimeout(timeout);\n  var delay = time - clockNow; // Strictly less than if we recomputed clockNow.\n  if (delay > 24) {\n    if (time < Infinity) timeout = setTimeout(wake, time - clock.now() - clockSkew);\n    if (interval) interval = clearInterval(interval);\n  } else {\n    if (!interval) clockLast = clock.now(), interval = setInterval(poke, pokeDelay);\n    frame = 1, setFrame(wake);\n  }\n}\n\nexport { Timer, now, timer, timerFlush };\n//# sourceMappingURL=timer.js.map\n"],"names":["frame","timeout","interval","pokeDelay","taskHead","taskTail","clockLast","clockNow","clockSkew","clock","setFrame","f","now","clearNow","Timer","timer","callback","delay","time","sleep","t","timerFlush","e","wake","nap","poke","t0","t1","t2"],"mappings":"AAAA,IAAIA,IAAQ,GACRC,IAAU,GACVC,IAAW,GACXC,IAAY,KACZC,GACAC,GACAC,IAAY,GACZC,IAAW,GACXC,IAAY,GACZC,IAAQ,OAAO,eAAgB,YAAY,YAAY,MAAM,cAAc,MAC3EC,IAAW,OAAO,UAAW,YAAY,OAAO,wBAAwB,OAAO,sBAAsB,KAAK,MAAM,IAAI,SAASC,GAAG;AAAE,aAAWA,GAAG,EAAE;AAAG;AAEzJ,SAASC,IAAM;AACb,SAAOL,MAAaG,EAASG,CAAQ,GAAGN,IAAWE,EAAM,IAAG,IAAKD;AACnE;AAEA,SAASK,IAAW;AAClB,EAAAN,IAAW;AACb;AAEA,SAASO,IAAQ;AACf,OAAK,QACL,KAAK,QACL,KAAK,QAAQ;AACf;AAEAA,EAAM,YAAYC,EAAM,YAAY;AAAA,EAClC,aAAaD;AAAA,EACb,SAAS,SAASE,GAAUC,GAAOC,GAAM;AACvC,QAAI,OAAOF,KAAa,WAAY,OAAM,IAAI,UAAU,4BAA4B;AACpF,IAAAE,KAAQA,KAAQ,OAAON,EAAG,IAAK,CAACM,MAASD,KAAS,OAAO,IAAI,CAACA,IAC1D,CAAC,KAAK,SAASZ,MAAa,SAC1BA,IAAUA,EAAS,QAAQ,OAC1BD,IAAW,MAChBC,IAAW,OAEb,KAAK,QAAQW,GACb,KAAK,QAAQE,GACbC,EAAK;AAAA,EACP;AAAA,EACA,MAAM,WAAW;AACf,IAAI,KAAK,UACP,KAAK,QAAQ,MACb,KAAK,QAAQ,OACbA,EAAK;AAAA,EAET;AACF;AAEA,SAASJ,EAAMC,GAAUC,GAAOC,GAAM;AACpC,MAAIE,IAAI,IAAIN;AACZ,SAAAM,EAAE,QAAQJ,GAAUC,GAAOC,CAAI,GACxBE;AACT;AAEA,SAASC,IAAa;AACpB,EAAAT,KACA,EAAEZ;AAEF,WADI,IAAII,GAAUkB,GACX;AACL,KAAKA,IAAIf,IAAW,EAAE,UAAU,KAAG,EAAE,MAAM,KAAK,QAAWe,CAAC,GAC5D,IAAI,EAAE;AAER,IAAEtB;AACJ;AAEA,SAASuB,IAAO;AACd,EAAAhB,KAAYD,IAAYG,EAAM,IAAG,KAAMD,GACvCR,IAAQC,IAAU;AAClB,MAAI;AACF,IAAAoB,EAAU;AAAA,EACZ,UAAC;AACC,IAAArB,IAAQ,GACRwB,EAAG,GACHjB,IAAW;AAAA,EACb;AACF;AAEA,SAASkB,IAAO;AACd,MAAIb,IAAMH,EAAM,IAAG,GAAIQ,IAAQL,IAAMN;AACrC,EAAIW,IAAQd,MAAWK,KAAaS,GAAOX,IAAYM;AACzD;AAEA,SAASY,IAAM;AAEb,WADIE,GAAIC,IAAKvB,GAAUwB,GAAIV,IAAO,OAC3BS;AACL,IAAIA,EAAG,SACDT,IAAOS,EAAG,UAAOT,IAAOS,EAAG,QAC/BD,IAAKC,GAAIA,IAAKA,EAAG,UAEjBC,IAAKD,EAAG,OAAOA,EAAG,QAAQ,MAC1BA,IAAKD,IAAKA,EAAG,QAAQE,IAAKxB,IAAWwB;AAGzC,EAAAvB,IAAWqB,GACXP,EAAMD,CAAI;AACZ;AAEA,SAASC,EAAMD,GAAM;AACnB,MAAI,CAAAlB,GACJ;AAAA,IAAIC,MAASA,IAAU,aAAaA,CAAO;AAC3C,QAAIgB,IAAQC,IAAOX;AACnB,IAAIU,IAAQ,MACNC,IAAO,UAAUjB,IAAU,WAAWsB,GAAML,IAAOT,EAAM,IAAG,IAAKD,CAAS,IAC1EN,MAAUA,IAAW,cAAcA,CAAQ,OAE1CA,MAAUI,IAAYG,EAAM,IAAG,GAAIP,IAAW,YAAYuB,GAAMtB,CAAS,IAC9EH,IAAQ,GAAGU,EAASa,CAAI;AAAA;AAE5B;","x_google_ignoreList":[0]}