@hkyhy/marsun-components-core 0.1.113 → 0.1.114

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"add.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/add.js"],"sourcesContent":["function tree_add$1(d) {\n  const x = +this._x.call(null, d);\n  return add$1(this.cover(x), x, d);\n}\n\nfunction add$1(tree, x, d) {\n  if (isNaN(x)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      x1 = tree._x1,\n      xm,\n      xp,\n      right,\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 (parent = node, !(node = node[i = +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  if (x === xp) 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(2) : tree._root = new Array(2);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n  } while ((i = +right) === (j = +(xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nfunction addAll$1(data) {\n  if (!Array.isArray(data)) data = Array.from(data);\n  const n = data.length;\n  const xz = new Float64Array(n);\n  let x0 = Infinity,\n      x1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (let i = 0, x; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, data[i]))) continue;\n    xz[i] = x;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0).cover(x1);\n\n  // Add the new points.\n  for (let i = 0; i < n; ++i) {\n    add$1(this, xz[i], data[i]);\n  }\n\n  return this;\n}\n\nexport { addAll$1 as addAll, tree_add$1 as default };\n//# sourceMappingURL=add.js.map\n"],"names":["tree_add$1","d","x","add$1","tree","parent","node","leaf","x0","x1","xm","xp","right","i","j","addAll$1","data","n","xz"],"mappings":"AAAA,SAASA,EAAWC,GAAG;AACrB,QAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC;AAC/B,SAAOE,EAAM,KAAK,MAAMD,CAAC,GAAGA,GAAGD,CAAC;AAClC;AAEA,SAASE,EAAMC,GAAMF,GAAGD,GAAG;AACzB,MAAI,MAAMC,CAAC,EAAG,QAAOE;AAErB,MAAIC,GACAC,IAAOF,EAAK,OACZG,IAAO,EAAC,MAAMN,EAAC,GACfO,IAAKJ,EAAK,KACVK,IAAKL,EAAK,KACVM,GACAC,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACR,EAAM,QAAOF,EAAK,QAAQG,GAAMH;AAGrC,SAAOE,EAAK;AAEV,SADIM,IAAQV,MAAMQ,KAAMF,IAAKC,KAAM,MAAID,IAAKE,IAASD,IAAKC,GACtDL,IAASC,GAAM,EAAEA,IAAOA,EAAKO,IAAI,CAACD,CAAK,GAAI,QAAOP,EAAOQ,CAAC,IAAIN,GAAMH;AAK1E,MADAO,IAAK,CAACP,EAAK,GAAG,KAAK,MAAME,EAAK,IAAI,GAC9BJ,MAAMS,EAAI,QAAOJ,EAAK,OAAOD,GAAMD,IAASA,EAAOQ,CAAC,IAAIN,IAAOH,EAAK,QAAQG,GAAMH;AAGtF;AACE,IAAAC,IAASA,IAASA,EAAOQ,CAAC,IAAI,IAAI,MAAM,CAAC,IAAIT,EAAK,QAAQ,IAAI,MAAM,CAAC,IACjEQ,IAAQV,MAAMQ,KAAMF,IAAKC,KAAM,MAAID,IAAKE,IAASD,IAAKC;AAAA,UAClDG,IAAI,CAACD,OAAYE,IAAI,EAAEH,KAAMD;AACvC,SAAOL,EAAOS,CAAC,IAAIR,GAAMD,EAAOQ,CAAC,IAAIN,GAAMH;AAC7C;AAEA,SAASW,EAASC,GAAM;AACtB,EAAK,MAAM,QAAQA,CAAI,MAAGA,IAAO,MAAM,KAAKA,CAAI;AAChD,QAAMC,IAAID,EAAK,QACTE,IAAK,IAAI,aAAaD,CAAC;AAC7B,MAAIT,IAAK,OACLC,IAAK;AAGT,WAASI,IAAI,GAAGX,GAAGW,IAAII,GAAG,EAAEJ;AAC1B,IAAI,MAAMX,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMc,EAAKH,CAAC,CAAC,CAAC,MAC1CK,EAAGL,CAAC,IAAIX,GACJA,IAAIM,MAAIA,IAAKN,IACbA,IAAIO,MAAIA,IAAKP;AAInB,MAAIM,IAAKC,EAAI,QAAO;AAGpB,OAAK,MAAMD,CAAE,EAAE,MAAMC,CAAE;AAGvB,WAASI,IAAI,GAAGA,IAAII,GAAG,EAAEJ;AACvB,IAAAV,EAAM,MAAMe,EAAGL,CAAC,GAAGG,EAAKH,CAAC,CAAC;AAG5B,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"binarytree.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/binarytree.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';\n\nfunction binarytree(nodes, x) {\n  var tree = new Binarytree(x == null ? defaultX : x, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Binarytree(x, x0, x1) {\n  this._x = x;\n  this._x0 = x0;\n  this._x1 = x1;\n  this._root = undefined;\n}\n\nfunction leaf_copy$1(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$1 = binarytree.prototype = Binarytree.prototype;\n\ntreeProto$1.copy = function() {\n  var copy = new Binarytree(this._x, this._x0, this._x1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy$1(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(2)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 2; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(2)});\n        else node.target[i] = leaf_copy$1(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto$1.add = tree_add;\ntreeProto$1.addAll = addAll;\ntreeProto$1.cover = tree_cover;\ntreeProto$1.data = tree_data;\ntreeProto$1.extent = tree_extent;\ntreeProto$1.find = tree_find;\ntreeProto$1.remove = tree_remove;\ntreeProto$1.removeAll = removeAll;\ntreeProto$1.root = tree_root;\ntreeProto$1.size = tree_size;\ntreeProto$1.visit = tree_visit;\ntreeProto$1.visitAfter = tree_visitAfter;\ntreeProto$1.x = tree_x;\n\nexport { binarytree as default };\n//# sourceMappingURL=binarytree.js.map\n"],"names":["binarytree","nodes","x","tree","Binarytree","defaultX","x0","x1","leaf_copy$1","leaf","copy","next","treeProto$1","node","child","tree_add","addAll","tree_cover","tree_data","tree_extent","tree_find","tree_remove","removeAll","tree_root","tree_size","tree_visit","tree_visitAfter","tree_x"],"mappings":";;;;;;;;;;;AAYA,SAASA,EAAWC,GAAOC,GAAG;AAC5B,MAAIC,IAAO,IAAIC,EAAWF,KAAYG,GAAc,KAAK,GAAG;AAC5D,SAAOJ,KAAS,OAAOE,IAAOA,EAAK,OAAOF,CAAK;AACjD;AAEA,SAASG,EAAWF,GAAGI,GAAIC,GAAI;AAC7B,OAAK,KAAKL,GACV,KAAK,MAAMI,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,IAAcZ,EAAW,YAAYI,EAAW;AAEpDQ,EAAY,OAAO,WAAW;AAC5B,MAAIF,IAAO,IAAIN,EAAW,KAAK,IAAI,KAAK,KAAK,KAAK,GAAG,GACjDS,IAAO,KAAK,OACZZ,GACAa;AAEJ,MAAI,CAACD,EAAM,QAAOH;AAElB,MAAI,CAACG,EAAK,OAAQ,QAAOH,EAAK,QAAQF,EAAYK,CAAI,GAAGH;AAGzD,OADAT,IAAQ,CAAC,EAAC,QAAQY,GAAM,QAAQH,EAAK,QAAQ,IAAI,MAAM,CAAC,EAAC,CAAC,GACnDG,IAAOZ,EAAM;AAClB,aAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,OAAIa,IAAQD,EAAK,OAAO,CAAC,OACnBC,EAAM,SAAQb,EAAM,KAAK,EAAC,QAAQa,GAAO,QAAQD,EAAK,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,EAAC,CAAC,IAC9EA,EAAK,OAAO,CAAC,IAAIL,EAAYM,CAAK;AAK7C,SAAOJ;AACT;AAEAE,EAAY,MAAMG;AAClBH,EAAY,SAASI;AACrBJ,EAAY,QAAQK;AACpBL,EAAY,OAAOM;AACnBN,EAAY,SAASO;AACrBP,EAAY,OAAOQ;AACnBR,EAAY,SAASS;AACrBT,EAAY,YAAYU;AACxBV,EAAY,OAAOW;AACnBX,EAAY,OAAOY;AACnBZ,EAAY,QAAQa;AACpBb,EAAY,aAAac;AACzBd,EAAY,IAAIe;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"cover.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/cover.js"],"sourcesContent":["function tree_cover$1(x) {\n  if (isNaN(x = +x)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      x1 = this._x1;\n\n  // If the binarytree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing half boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 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) {\n      i = +(x < x0);\n      parent = new Array(2), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z; break;\n        case 1: x0 = x1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._x1 = x1;\n  return this;\n}\n\nexport { tree_cover$1 as default };\n//# sourceMappingURL=cover.js.map\n"],"names":["tree_cover$1","x","x0","x1","z","node","parent","i"],"mappings":"AAAA,SAASA,EAAaC,GAAG;AACvB,MAAI,MAAMA,IAAI,CAACA,CAAC,EAAG,QAAO;AAE1B,MAAIC,IAAK,KAAK,KACVC,IAAK,KAAK;AAKd,MAAI,MAAMD,CAAE;AACV,IAAAC,KAAMD,IAAK,KAAK,MAAMD,CAAC,KAAK;AAAA,OAIzB;AAMH,aALIG,IAAID,IAAKD,KAAM,GACfG,IAAO,KAAK,OACZC,GACAC,GAEGL,IAAKD,KAAKA,KAAKE;AAGpB,cAFAI,IAAI,EAAEN,IAAIC,IACVI,IAAS,IAAI,MAAM,CAAC,GAAGA,EAAOC,CAAC,IAAIF,GAAMA,IAAOC,GAAQF,KAAK,GACrDG,GAAC;AAAA,QACP,KAAK;AAAG,UAAAJ,IAAKD,IAAKE;AAAG;AAAA,QACrB,KAAK;AAAG,UAAAF,IAAKC,IAAKC;AAAG;AAAA,MAC7B;AAGI,IAAI,KAAK,SAAS,KAAK,MAAM,WAAQ,KAAK,QAAQC;AAAA,EACpD;AAEA,cAAK,MAAMH,GACX,KAAK,MAAMC,GACJ;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-binarytree/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-binarytree/src/data.js.map

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

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

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

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

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

@@ -0,0 +1,21 @@
+import r from "./half.js";
+function w(n, l) {
+  var _, i = this._x0, o, p, f = this._x1, e = [], t = this._root, h, s;
+  for (t && e.push(new r(t, i, f)), l == null ? l = 1 / 0 : (i = n - l, f = n + l); h = e.pop(); )
+    if (!(!(t = h.node) || (o = h.x0) > f || (p = h.x1) < i))
+      if (t.length) {
+        var g = (o + p) / 2;
+        e.push(
+          new r(t[1], g, p),
+          new r(t[0], o, g)
+        ), (s = +(n >= g)) && (h = e[e.length - 1], e[e.length - 1] = e[e.length - 1 - s], e[e.length - 1 - s] = h);
+      } else {
+        var a = Math.abs(n - +this._x.call(null, t.data));
+        a < l && (l = a, i = n - a, f = n + a, _ = t.data);
+      }
+  return _;
+}
+export {
+  w as default
+};
+//# sourceMappingURL=find.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_find$1(x, radius) {\n  var data,\n      x0 = this._x0,\n      x1,\n      x2,\n      x3 = this._x1,\n      halves = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) halves.push(new Half(node, x0, x3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius;\n    x3 = x + radius;\n  }\n\n  while (q = halves.pop()) {\n\n    // Stop searching if this half can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (x2 = q.x1) < x0) continue;\n\n    // Bisect the current half.\n    if (node.length) {\n      var xm = (x1 + x2) / 2;\n\n      halves.push(\n        new Half(node[1], xm, x2),\n        new Half(node[0], x1, xm)\n      );\n\n      // Visit the closest half first.\n      if (i = +(x >= xm)) {\n        q = halves[halves.length - 1];\n        halves[halves.length - 1] = halves[halves.length - 1 - i];\n        halves[halves.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var d = Math.abs(x - +this._x.call(null, node.data));\n      if (d < radius) {\n        radius = d;\n        x0 = x - d;\n        x3 = x + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n\nexport { tree_find$1 as default };\n//# sourceMappingURL=find.js.map\n"],"names":["tree_find$1","x","radius","data","x0","x1","x2","x3","halves","node","q","i","Half","xm","d"],"mappings":";AAEA,SAASA,EAAYC,GAAGC,GAAQ;AAC9B,MAAIC,GACAC,IAAK,KAAK,KACVC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAS,CAAA,GACTC,IAAO,KAAK,OACZC,GACAC;AASJ,OAPIF,KAAMD,EAAO,KAAK,IAAII,EAAKH,GAAML,GAAIG,CAAE,CAAC,GACxCL,KAAU,OAAMA,IAAS,SAE3BE,IAAKH,IAAIC,GACTK,IAAKN,IAAIC,IAGJQ,IAAIF,EAAO;AAGhB,QAAI,IAAEC,IAAOC,EAAE,UACPL,IAAKK,EAAE,MAAMH,MACbD,IAAKI,EAAE,MAAMN;AAGrB,UAAIK,EAAK,QAAQ;AACf,YAAII,KAAMR,IAAKC,KAAM;AAErB,QAAAE,EAAO;AAAA,UACL,IAAII,EAAKH,EAAK,CAAC,GAAGI,GAAIP,CAAE;AAAA,UACxB,IAAIM,EAAKH,EAAK,CAAC,GAAGJ,GAAIQ,CAAE;AAAA,QAChC,IAGUF,IAAI,EAAEV,KAAKY,QACbH,IAAIF,EAAOA,EAAO,SAAS,CAAC,GAC5BA,EAAOA,EAAO,SAAS,CAAC,IAAIA,EAAOA,EAAO,SAAS,IAAIG,CAAC,GACxDH,EAAOA,EAAO,SAAS,IAAIG,CAAC,IAAID;AAAA,MAEpC,OAGK;AACH,YAAII,IAAI,KAAK,IAAIb,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMQ,EAAK,IAAI,CAAC;AACnD,QAAIK,IAAIZ,MACNA,IAASY,GACTV,IAAKH,IAAIa,GACTP,IAAKN,IAAIa,GACTX,IAAOM,EAAK;AAAA,MAEhB;AAGF,SAAON;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"half.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.js"],"sourcesContent":["function Half(node, x0, x1) {\n  this.node = node;\n  this.x0 = x0;\n  this.x1 = x1;\n}\n\nexport { Half as default };\n//# sourceMappingURL=half.js.map\n"],"names":["Half","node","x0","x1"],"mappings":"AAAA,SAASA,EAAKC,GAAMC,GAAIC,GAAI;AAC1B,OAAK,OAAOF,GACZ,KAAK,KAAKC,GACV,KAAK,KAAKC;AACZ;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"remove.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.js"],"sourcesContent":["function tree_remove$1(d) {\n  if (isNaN(x = +this._x.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      x1 = this._x1,\n      x,\n      xm,\n      right,\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 (!(parent = node, node = node[i = +right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 1]) 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])\n      && node === (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$1(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n\nexport { tree_remove$1 as default, removeAll$1 as removeAll };\n//# sourceMappingURL=remove.js.map\n"],"names":["tree_remove$1","d","x","parent","node","retainer","previous","next","x0","x1","xm","right","i","j","removeAll$1","data","n"],"mappings":"AAAA,SAASA,EAAcC,GAAG;AACxB,MAAI,MAAMC,IAAI,CAAC,KAAK,GAAG,KAAK,MAAMD,CAAC,CAAC,EAAG,QAAO;AAE9C,MAAIE,GACAC,IAAO,KAAK,OACZC,GACAC,GACAC,GACAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVP,GACAQ,GACAC,GACAC,GACAC;AAGJ,MAAI,CAACT,EAAM,QAAO;AAIlB,MAAIA,EAAK,OAAQ,YAAa;AAE5B,SADIO,IAAQT,MAAMQ,KAAMF,IAAKC,KAAM,MAAID,IAAKE,IAASD,IAAKC,GACpDP,IAASC,GAAM,EAAAA,IAAOA,EAAKQ,IAAI,CAACD,CAAK,GAAI,QAAO;AACtD,QAAI,CAACP,EAAK,OAAQ;AAClB,IAAID,EAAQS,IAAI,IAAK,CAAC,MAAGP,IAAWF,GAAQU,IAAID;AAAA,EAClD;AAGA,SAAOR,EAAK,SAASH,IAAG,KAAMK,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,EAAOS,CAAC,IAAIL,IAAO,OAAOJ,EAAOS,CAAC,IAGpCR,IAAOD,EAAO,CAAC,KAAKA,EAAO,CAAC,MAC1BC,OAAUD,EAAO,CAAC,KAAKA,EAAO,CAAC,MAC/B,CAACC,EAAK,WACPC,IAAUA,EAASQ,CAAC,IAAIT,IACvB,KAAK,QAAQA,IAGb,SAba,KAAK,QAAQG,GAAM;AAczC;AAEA,SAASO,EAAYC,GAAM;AACzB,WAASH,IAAI,GAAGI,IAAID,EAAK,QAAQH,IAAII,GAAG,EAAEJ,EAAG,MAAK,OAAOG,EAAKH,CAAC,CAAC;AAChE,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-binarytree/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-binarytree/src/root.js.map

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

package/dist/node_modules/@antv/layout/lib/node_modules/d3-binarytree/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-binarytree/src/size.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"size.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.js"],"sourcesContent":["function tree_size$1() {\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$1 as default };\n//# sourceMappingURL=size.js.map\n"],"names":["tree_size$1","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-binarytree/src/visit.js

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"visit.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_visit$1(callback) {\n  var halves = [], q, node = this._root, child, x0, x1;\n  if (node) halves.push(new Half(node, this._x0, this._x1));\n  while (q = halves.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, x1 = q.x1) && node.length) {\n      var xm = (x0 + x1) / 2;\n      if (child = node[1]) halves.push(new Half(child, xm, x1));\n      if (child = node[0]) halves.push(new Half(child, x0, xm));\n    }\n  }\n  return this;\n}\n\nexport { tree_visit$1 as default };\n//# sourceMappingURL=visit.js.map\n"],"names":["tree_visit$1","callback","halves","q","node","child","x0","x1","Half","xm"],"mappings":";AAEA,SAASA,EAAaC,GAAU;AAC9B,MAAIC,IAAS,CAAA,GAAIC,GAAGC,IAAO,KAAK,OAAOC,GAAOC,GAAIC;AAElD,OADIH,KAAMF,EAAO,KAAK,IAAIM,EAAKJ,GAAM,KAAK,KAAK,KAAK,GAAG,CAAC,GACjDD,IAAID,EAAO;AAChB,QAAI,CAACD,EAASG,IAAOD,EAAE,MAAMG,IAAKH,EAAE,IAAII,IAAKJ,EAAE,EAAE,KAAKC,EAAK,QAAQ;AACjE,UAAIK,KAAMH,IAAKC,KAAM;AACrB,OAAIF,IAAQD,EAAK,CAAC,MAAGF,EAAO,KAAK,IAAIM,EAAKH,GAAOI,GAAIF,CAAE,CAAC,IACpDF,IAAQD,EAAK,CAAC,MAAGF,EAAO,KAAK,IAAIM,EAAKH,GAAOC,GAAIG,CAAE,CAAC;AAAA,IAC1D;AAEF,SAAO;AACT;","x_google_ignoreList":[0]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"visitAfter.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_visitAfter$1(callback) {\n  var halves = [], next = [], q;\n  if (this._root) halves.push(new Half(this._root, this._x0, this._x1));\n  while (q = halves.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, x1 = q.x1, xm = (x0 + x1) / 2;\n      if (child = node[0]) halves.push(new Half(child, x0, xm));\n      if (child = node[1]) halves.push(new Half(child, xm, x1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.x1);\n  }\n  return this;\n}\n\nexport { tree_visitAfter$1 as default };\n//# sourceMappingURL=visitAfter.js.map\n"],"names":["tree_visitAfter$1","callback","halves","next","q","Half","node","child","x0","x1","xm"],"mappings":";AAEA,SAASA,EAAkBC,GAAU;AACnC,MAAIC,IAAS,CAAA,GAAIC,IAAO,CAAA,GAAIC;AAE5B,OADI,KAAK,SAAOF,EAAO,KAAK,IAAIG,EAAK,KAAK,OAAO,KAAK,KAAK,KAAK,GAAG,CAAC,GAC7DD,IAAIF,EAAO,SAAO;AACvB,QAAII,IAAOF,EAAE;AACb,QAAIE,EAAK,QAAQ;AACf,UAAIC,GAAOC,IAAKJ,EAAE,IAAIK,IAAKL,EAAE,IAAIM,KAAMF,IAAKC,KAAM;AAClD,OAAIF,IAAQD,EAAK,CAAC,MAAGJ,EAAO,KAAK,IAAIG,EAAKE,GAAOC,GAAIE,CAAE,CAAC,IACpDH,IAAQD,EAAK,CAAC,MAAGJ,EAAO,KAAK,IAAIG,EAAKE,GAAOG,GAAID,CAAE,CAAC;AAAA,IAC1D;AACA,IAAAN,EAAK,KAAKC,CAAC;AAAA,EACb;AACA,SAAOA,IAAID,EAAK;AACd,IAAAF,EAASG,EAAE,MAAMA,EAAE,IAAIA,EAAE,EAAE;AAE7B,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/node_modules/d3-binarytree/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-binarytree/src/x.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"x.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.js"],"sourcesContent":["function defaultX$1(d) {\n  return d[0];\n}\n\nfunction tree_x$1(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n\nexport { tree_x$1 as default, defaultX$1 as defaultX };\n//# sourceMappingURL=x.js.map\n"],"names":["defaultX$1","d","tree_x$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-dispatch/src/dispatch.js

@@ -0,0 +1,65 @@
+var a = { value: () => {
+} };
+function l() {
+  for (var n = 0, t = arguments.length, r = {}, e; n < t; ++n) {
+    if (!(e = arguments[n] + "") || e in r || /[\s.]/.test(e)) throw new Error("illegal type: " + e);
+    r[e] = [];
+  }
+  return new f(r);
+}
+function f(n) {
+  this._ = n;
+}
+function h(n, t) {
+  return n.trim().split(/^|\s+/).map(function(r) {
+    var e = "", o = r.indexOf(".");
+    if (o >= 0 && (e = r.slice(o + 1), r = r.slice(0, o)), r && !t.hasOwnProperty(r)) throw new Error("unknown type: " + r);
+    return { type: r, name: e };
+  });
+}
+f.prototype = l.prototype = {
+  constructor: f,
+  on: function(n, t) {
+    var r = this._, e = h(n + "", r), o, u = -1, i = e.length;
+    if (arguments.length < 2) {
+      for (; ++u < i; ) if ((o = (n = e[u]).type) && (o = w(r[o], n.name))) return o;
+      return;
+    }
+    if (t != null && typeof t != "function") throw new Error("invalid callback: " + t);
+    for (; ++u < i; )
+      if (o = (n = e[u]).type) r[o] = s(r[o], n.name, t);
+      else if (t == null) for (o in r) r[o] = s(r[o], n.name, null);
+    return this;
+  },
+  copy: function() {
+    var n = {}, t = this._;
+    for (var r in t) n[r] = t[r].slice();
+    return new f(n);
+  },
+  call: function(n, t) {
+    if ((o = arguments.length - 2) > 0) for (var r = new Array(o), e = 0, o, u; e < o; ++e) r[e] = arguments[e + 2];
+    if (!this._.hasOwnProperty(n)) throw new Error("unknown type: " + n);
+    for (u = this._[n], e = 0, o = u.length; e < o; ++e) u[e].value.apply(t, r);
+  },
+  apply: function(n, t, r) {
+    if (!this._.hasOwnProperty(n)) throw new Error("unknown type: " + n);
+    for (var e = this._[n], o = 0, u = e.length; o < u; ++o) e[o].value.apply(t, r);
+  }
+};
+function w(n, t) {
+  for (var r = 0, e = n.length, o; r < e; ++r)
+    if ((o = n[r]).name === t)
+      return o.value;
+}
+function s(n, t, r) {
+  for (var e = 0, o = n.length; e < o; ++e)
+    if (n[e].name === t) {
+      n[e] = a, n = n.slice(0, e).concat(n.slice(e + 1));
+      break;
+    }
+  return r != null && n.push({ name: t, value: r }), n;
+}
+export {
+  l as default
+};
+//# sourceMappingURL=dispatch.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dispatch.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-dispatch/src/dispatch.js"],"sourcesContent":["var noop = {value: () => {}};\n\nfunction dispatch() {\n  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {\n    if (!(t = arguments[i] + \"\") || (t in _) || /[\\s.]/.test(t)) throw new Error(\"illegal type: \" + t);\n    _[t] = [];\n  }\n  return new Dispatch(_);\n}\n\nfunction Dispatch(_) {\n  this._ = _;\n}\n\nfunction parseTypenames(typenames, types) {\n  return typenames.trim().split(/^|\\s+/).map(function(t) {\n    var name = \"\", i = t.indexOf(\".\");\n    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);\n    if (t && !types.hasOwnProperty(t)) throw new Error(\"unknown type: \" + t);\n    return {type: t, name: name};\n  });\n}\n\nDispatch.prototype = dispatch.prototype = {\n  constructor: Dispatch,\n  on: function(typename, callback) {\n    var _ = this._,\n        T = parseTypenames(typename + \"\", _),\n        t,\n        i = -1,\n        n = T.length;\n\n    // If no callback was specified, return the callback of the given type and name.\n    if (arguments.length < 2) {\n      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;\n      return;\n    }\n\n    // If a type was specified, set the callback for the given type and name.\n    // Otherwise, if a null callback was specified, remove callbacks of the given name.\n    if (callback != null && typeof callback !== \"function\") throw new Error(\"invalid callback: \" + callback);\n    while (++i < n) {\n      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);\n      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);\n    }\n\n    return this;\n  },\n  copy: function() {\n    var copy = {}, _ = this._;\n    for (var t in _) copy[t] = _[t].slice();\n    return new Dispatch(copy);\n  },\n  call: function(type, that) {\n    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  },\n  apply: function(type, that, args) {\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  }\n};\n\nfunction get(type, name) {\n  for (var i = 0, n = type.length, c; i < n; ++i) {\n    if ((c = type[i]).name === name) {\n      return c.value;\n    }\n  }\n}\n\nfunction set(type, name, callback) {\n  for (var i = 0, n = type.length; i < n; ++i) {\n    if (type[i].name === name) {\n      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));\n      break;\n    }\n  }\n  if (callback != null) type.push({name: name, value: callback});\n  return type;\n}\n\nexport { dispatch as default };\n//# sourceMappingURL=dispatch.js.map\n"],"names":["noop","dispatch","i","n","_","t","Dispatch","parseTypenames","typenames","types","name","typename","callback","T","get","set","copy","type","that","args","c"],"mappings":"AAAA,IAAIA,IAAO,EAAC,OAAO,MAAM;AAAC,EAAC;AAE3B,SAASC,IAAW;AAClB,WAASC,IAAI,GAAGC,IAAI,UAAU,QAAQC,IAAI,CAAA,GAAIC,GAAGH,IAAIC,GAAG,EAAED,GAAG;AAC3D,QAAI,EAAEG,IAAI,UAAUH,CAAC,IAAI,OAAQG,KAAKD,KAAM,QAAQ,KAAKC,CAAC,EAAG,OAAM,IAAI,MAAM,mBAAmBA,CAAC;AACjG,IAAAD,EAAEC,CAAC,IAAI,CAAA;AAAA,EACT;AACA,SAAO,IAAIC,EAASF,CAAC;AACvB;AAEA,SAASE,EAASF,GAAG;AACnB,OAAK,IAAIA;AACX;AAEA,SAASG,EAAeC,GAAWC,GAAO;AACxC,SAAOD,EAAU,OAAO,MAAM,OAAO,EAAE,IAAI,SAASH,GAAG;AACrD,QAAIK,IAAO,IAAIR,IAAIG,EAAE,QAAQ,GAAG;AAEhC,QADIH,KAAK,MAAGQ,IAAOL,EAAE,MAAMH,IAAI,CAAC,GAAGG,IAAIA,EAAE,MAAM,GAAGH,CAAC,IAC/CG,KAAK,CAACI,EAAM,eAAeJ,CAAC,EAAG,OAAM,IAAI,MAAM,mBAAmBA,CAAC;AACvE,WAAO,EAAC,MAAMA,GAAG,MAAMK,EAAI;AAAA,EAC7B,CAAC;AACH;AAEAJ,EAAS,YAAYL,EAAS,YAAY;AAAA,EACxC,aAAaK;AAAA,EACb,IAAI,SAASK,GAAUC,GAAU;AAC/B,QAAIR,IAAI,KAAK,GACTS,IAAIN,EAAeI,IAAW,IAAIP,CAAC,GACnCC,GACAH,IAAI,IACJC,IAAIU,EAAE;AAGV,QAAI,UAAU,SAAS,GAAG;AACxB,aAAO,EAAEX,IAAIC,IAAG,MAAKE,KAAKM,IAAWE,EAAEX,CAAC,GAAG,UAAUG,IAAIS,EAAIV,EAAEC,CAAC,GAAGM,EAAS,IAAI,GAAI,QAAON;AAC3F;AAAA,IACF;AAIA,QAAIO,KAAY,QAAQ,OAAOA,KAAa,WAAY,OAAM,IAAI,MAAM,uBAAuBA,CAAQ;AACvG,WAAO,EAAEV,IAAIC;AACX,UAAIE,KAAKM,IAAWE,EAAEX,CAAC,GAAG,KAAM,CAAAE,EAAEC,CAAC,IAAIU,EAAIX,EAAEC,CAAC,GAAGM,EAAS,MAAMC,CAAQ;AAAA,eAC/DA,KAAY,KAAM,MAAKP,KAAKD,EAAG,CAAAA,EAAEC,CAAC,IAAIU,EAAIX,EAAEC,CAAC,GAAGM,EAAS,MAAM,IAAI;AAG9E,WAAO;AAAA,EACT;AAAA,EACA,MAAM,WAAW;AACf,QAAIK,IAAO,CAAA,GAAIZ,IAAI,KAAK;AACxB,aAASC,KAAKD,EAAG,CAAAY,EAAKX,CAAC,IAAID,EAAEC,CAAC,EAAE,MAAK;AACrC,WAAO,IAAIC,EAASU,CAAI;AAAA,EAC1B;AAAA,EACA,MAAM,SAASC,GAAMC,GAAM;AACzB,SAAKf,IAAI,UAAU,SAAS,KAAK,EAAG,UAASgB,IAAO,IAAI,MAAMhB,CAAC,GAAGD,IAAI,GAAGC,GAAGE,GAAGH,IAAIC,GAAG,EAAED,EAAG,CAAAiB,EAAKjB,CAAC,IAAI,UAAUA,IAAI,CAAC;AACpH,QAAI,CAAC,KAAK,EAAE,eAAee,CAAI,EAAG,OAAM,IAAI,MAAM,mBAAmBA,CAAI;AACzE,SAAKZ,IAAI,KAAK,EAAEY,CAAI,GAAGf,IAAI,GAAGC,IAAIE,EAAE,QAAQH,IAAIC,GAAG,EAAED,EAAG,CAAAG,EAAEH,CAAC,EAAE,MAAM,MAAMgB,GAAMC,CAAI;AAAA,EACrF;AAAA,EACA,OAAO,SAASF,GAAMC,GAAMC,GAAM;AAChC,QAAI,CAAC,KAAK,EAAE,eAAeF,CAAI,EAAG,OAAM,IAAI,MAAM,mBAAmBA,CAAI;AACzE,aAASZ,IAAI,KAAK,EAAEY,CAAI,GAAGf,IAAI,GAAGC,IAAIE,EAAE,QAAQH,IAAIC,GAAG,EAAED,EAAG,CAAAG,EAAEH,CAAC,EAAE,MAAM,MAAMgB,GAAMC,CAAI;AAAA,EACzF;AACF;AAEA,SAASL,EAAIG,GAAMP,GAAM;AACvB,WAASR,IAAI,GAAGC,IAAIc,EAAK,QAAQG,GAAGlB,IAAIC,GAAG,EAAED;AAC3C,SAAKkB,IAAIH,EAAKf,CAAC,GAAG,SAASQ;AACzB,aAAOU,EAAE;AAGf;AAEA,SAASL,EAAIE,GAAMP,GAAME,GAAU;AACjC,WAASV,IAAI,GAAGC,IAAIc,EAAK,QAAQf,IAAIC,GAAG,EAAED;AACxC,QAAIe,EAAKf,CAAC,EAAE,SAASQ,GAAM;AACzB,MAAAO,EAAKf,CAAC,IAAIF,GAAMiB,IAAOA,EAAK,MAAM,GAAGf,CAAC,EAAE,OAAOe,EAAK,MAAMf,IAAI,CAAC,CAAC;AAChE;AAAA,IACF;AAEF,SAAIU,KAAY,QAAMK,EAAK,KAAK,EAAC,MAAMP,GAAM,OAAOE,EAAQ,CAAC,GACtDK;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,24 @@
+function s(r, u) {
+  var f, i = 1;
+  r == null && (r = 0), u == null && (u = 0);
+  function t() {
+    var n, o = f.length, e, l = 0, g = 0;
+    for (n = 0; n < o; ++n)
+      e = f[n], l += e.x, g += e.y;
+    for (l = (l / o - r) * i, g = (g / o - u) * i, n = 0; n < o; ++n)
+      e = f[n], e.x -= l, e.y -= g;
+  }
+  return t.initialize = function(n) {
+    f = n;
+  }, t.x = function(n) {
+    return arguments.length ? (r = +n, t) : r;
+  }, t.y = function(n) {
+    return arguments.length ? (u = +n, t) : u;
+  }, t.strength = function(n) {
+    return arguments.length ? (i = +n, t) : i;
+  }, t;
+}
+export {
+  s as default
+};
+//# sourceMappingURL=center.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"center.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force/src/center.js"],"sourcesContent":["function forceCenter$1(x, y) {\n  var nodes, strength = 1;\n\n  if (x == null) x = 0;\n  if (y == null) y = 0;\n\n  function force() {\n    var i,\n        n = nodes.length,\n        node,\n        sx = 0,\n        sy = 0;\n\n    for (i = 0; i < n; ++i) {\n      node = nodes[i], sx += node.x, sy += node.y;\n    }\n\n    for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {\n      node = nodes[i], node.x -= sx, node.y -= sy;\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\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.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  return force;\n}\n\nexport { forceCenter$1 as default };\n//# sourceMappingURL=center.js.map\n"],"names":["forceCenter$1","x","y","nodes","strength","force","i","n","node","sx","sy","_"],"mappings":"AAAA,SAASA,EAAcC,GAAGC,GAAG;AAC3B,MAAIC,GAAOC,IAAW;AAEtB,EAAIH,KAAK,SAAMA,IAAI,IACfC,KAAK,SAAMA,IAAI;AAEnB,WAASG,IAAQ;AACf,QAAIC,GACAC,IAAIJ,EAAM,QACVK,GACAC,IAAK,GACLC,IAAK;AAET,SAAKJ,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,MAAAE,IAAOL,EAAMG,CAAC,GAAGG,KAAMD,EAAK,GAAGE,KAAMF,EAAK;AAG5C,SAAKC,KAAMA,IAAKF,IAAIN,KAAKG,GAAUM,KAAMA,IAAKH,IAAIL,KAAKE,GAAUE,IAAI,GAAGA,IAAIC,GAAG,EAAED;AAC/E,MAAAE,IAAOL,EAAMG,CAAC,GAAGE,EAAK,KAAKC,GAAID,EAAK,KAAKE;AAAA,EAE7C;AAEA,SAAAL,EAAM,aAAa,SAASM,GAAG;AAC7B,IAAAR,IAAQQ;AAAA,EACV,GAEAN,EAAM,IAAI,SAASM,GAAG;AACpB,WAAO,UAAU,UAAUV,IAAI,CAACU,GAAGN,KAASJ;AAAA,EAC9C,GAEAI,EAAM,IAAI,SAASM,GAAG;AACpB,WAAO,UAAU,UAAUT,IAAI,CAACS,GAAGN,KAASH;AAAA,EAC9C,GAEAG,EAAM,WAAW,SAASM,GAAG;AAC3B,WAAO,UAAU,UAAUP,IAAW,CAACO,GAAGN,KAASD;AAAA,EACrD,GAEOC;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,53 @@
+import w from "./constant.js";
+import C from "./jiggle.js";
+import G from "../../d3-quadtree/src/quadtree.js";
+function H(r) {
+  return r.x + r.vx;
+}
+function I(r) {
+  return r.y + r.vy;
+}
+function N(r) {
+  var f, m, y, l = 1, $ = 1;
+  typeof r != "function" && (r = w(r == null ? 1 : +r));
+  function v() {
+    for (var n, t = f.length, g, i, p, x, h, z, A = 0; A < $; ++A)
+      for (g = G(f, H, I).visitAfter(M), n = 0; n < t; ++n)
+        i = f[n], h = m[i.index], z = h * h, p = i.x + i.vx, x = i.y + i.vy, g.visit(b);
+    function b(d, B, D, E, F) {
+      var a = d.data, s = d.r, e = h + s;
+      if (a) {
+        if (a.index > i.index) {
+          var c = p - a.x - a.vx, u = x - a.y - a.vy, o = c * c + u * u;
+          o < e * e && (c === 0 && (c = C(y), o += c * c), u === 0 && (u = C(y), o += u * u), o = (e - (o = Math.sqrt(o))) / o * l, i.vx += (c *= o) * (e = (s *= s) / (z + s)), i.vy += (u *= o) * e, a.vx -= c * (e = 1 - e), a.vy -= u * e);
+        }
+        return;
+      }
+      return B > p + e || E < p - e || D > x + e || F < x - e;
+    }
+  }
+  function M(n) {
+    if (n.data) return n.r = m[n.data.index];
+    for (var t = n.r = 0; t < 4; ++t)
+      n[t] && n[t].r > n.r && (n.r = n[t].r);
+  }
+  function j() {
+    if (f) {
+      var n, t = f.length, g;
+      for (m = new Array(t), n = 0; n < t; ++n) g = f[n], m[g.index] = +r(g, n, f);
+    }
+  }
+  return v.initialize = function(n, t) {
+    f = n, y = t, j();
+  }, v.iterations = function(n) {
+    return arguments.length ? ($ = +n, v) : $;
+  }, v.strength = function(n) {
+    return arguments.length ? (l = +n, v) : l;
+  }, v.radius = function(n) {
+    return arguments.length ? (r = typeof n == "function" ? n : w(+n), j(), v) : r;
+  }, v;
+}
+export {
+  N as default
+};
+//# sourceMappingURL=collide.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"collide.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force/src/collide.js"],"sourcesContent":["import constant from './constant.js';\nimport jiggle from './jiggle.js';\nimport quadtree from '../../d3-quadtree/src/quadtree.js';\n\nfunction x$3(d) {\n  return d.x + d.vx;\n}\n\nfunction y$3(d) {\n  return d.y + d.vy;\n}\n\nfunction forceCollide$2(radius) {\n  var nodes,\n      radii,\n      random,\n      strength = 1,\n      iterations = 1;\n\n  if (typeof radius !== \"function\") radius = constant(radius == null ? 1 : +radius);\n\n  function force() {\n    var i, n = nodes.length,\n        tree,\n        node,\n        xi,\n        yi,\n        ri,\n        ri2;\n\n    for (var k = 0; k < iterations; ++k) {\n      tree = quadtree(nodes, x$3, y$3).visitAfter(prepare);\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        ri = radii[node.index], ri2 = ri * ri;\n        xi = node.x + node.vx;\n        yi = node.y + node.vy;\n        tree.visit(apply);\n      }\n    }\n\n    function apply(quad, x0, y0, x1, y1) {\n      var data = quad.data, rj = quad.r, r = ri + rj;\n      if (data) {\n        if (data.index > node.index) {\n          var x = xi - data.x - data.vx,\n              y = yi - data.y - data.vy,\n              l = x * x + y * y;\n          if (l < r * r) {\n            if (x === 0) x = jiggle(random), l += x * x;\n            if (y === 0) y = jiggle(random), l += y * y;\n            l = (r - (l = Math.sqrt(l))) / l * strength;\n            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));\n            node.vy += (y *= l) * r;\n            data.vx -= x * (r = 1 - r);\n            data.vy -= y * r;\n          }\n        }\n        return;\n      }\n      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;\n    }\n  }\n\n  function prepare(quad) {\n    if (quad.data) return quad.r = radii[quad.data.index];\n    for (var i = quad.r = 0; i < 4; ++i) {\n      if (quad[i] && quad[i].r > quad.r) {\n        quad.r = quad[i].r;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    radii = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  force.radius = function(_) {\n    return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n  };\n\n  return force;\n}\n\nexport { forceCollide$2 as default };\n//# sourceMappingURL=collide.js.map\n"],"names":["x$3","d","y$3","forceCollide$2","radius","nodes","radii","random","strength","iterations","constant","force","i","n","tree","node","xi","yi","ri","ri2","k","quadtree","prepare","apply","quad","x0","y0","x1","y1","data","rj","r","x","y","l","jiggle","initialize","_nodes","_random","_"],"mappings":";;;AAIA,SAASA,EAAIC,GAAG;AACd,SAAOA,EAAE,IAAIA,EAAE;AACjB;AAEA,SAASC,EAAID,GAAG;AACd,SAAOA,EAAE,IAAIA,EAAE;AACjB;AAEA,SAASE,EAAeC,GAAQ;AAC9B,MAAIC,GACAC,GACAC,GACAC,IAAW,GACXC,IAAa;AAEjB,EAAI,OAAOL,KAAW,eAAYA,IAASM,EAASN,KAAU,OAAO,IAAI,CAACA,CAAM;AAEhF,WAASO,IAAQ;AASf,aARIC,GAAGC,IAAIR,EAAM,QACbS,GACAC,GACAC,GACAC,GACAC,GACAC,GAEKC,IAAI,GAAGA,IAAIX,GAAY,EAAEW;AAEhC,WADAN,IAAOO,EAAShB,GAAOL,GAAKE,CAAG,EAAE,WAAWoB,CAAO,GAC9CV,IAAI,GAAGA,IAAIC,GAAG,EAAED;AACnB,QAAAG,IAAOV,EAAMO,CAAC,GACdM,IAAKZ,EAAMS,EAAK,KAAK,GAAGI,IAAMD,IAAKA,GACnCF,IAAKD,EAAK,IAAIA,EAAK,IACnBE,IAAKF,EAAK,IAAIA,EAAK,IACnBD,EAAK,MAAMS,CAAK;AAIpB,aAASA,EAAMC,GAAMC,GAAIC,GAAIC,GAAIC,GAAI;AACnC,UAAIC,IAAOL,EAAK,MAAMM,IAAKN,EAAK,GAAGO,IAAIb,IAAKY;AAC5C,UAAID,GAAM;AACR,YAAIA,EAAK,QAAQd,EAAK,OAAO;AAC3B,cAAIiB,IAAIhB,IAAKa,EAAK,IAAIA,EAAK,IACvBI,IAAIhB,IAAKY,EAAK,IAAIA,EAAK,IACvBK,IAAIF,IAAIA,IAAIC,IAAIA;AACpB,UAAIC,IAAIH,IAAIA,MACNC,MAAM,MAAGA,IAAIG,EAAO5B,CAAM,GAAG2B,KAAKF,IAAIA,IACtCC,MAAM,MAAGA,IAAIE,EAAO5B,CAAM,GAAG2B,KAAKD,IAAIA,IAC1CC,KAAKH,KAAKG,IAAI,KAAK,KAAKA,CAAC,MAAMA,IAAI1B,GACnCO,EAAK,OAAOiB,KAAKE,MAAMH,KAAKD,KAAMA,MAAOX,IAAMW,KAC/Cf,EAAK,OAAOkB,KAAKC,KAAKH,GACtBF,EAAK,MAAMG,KAAKD,IAAI,IAAIA,IACxBF,EAAK,MAAMI,IAAIF;AAAA,QAEnB;AACA;AAAA,MACF;AACA,aAAON,IAAKT,IAAKe,KAAKJ,IAAKX,IAAKe,KAAKL,IAAKT,IAAKc,KAAKH,IAAKX,IAAKc;AAAA,IAChE;AAAA,EACF;AAEA,WAAST,EAAQE,GAAM;AACrB,QAAIA,EAAK,KAAM,QAAOA,EAAK,IAAIlB,EAAMkB,EAAK,KAAK,KAAK;AACpD,aAASZ,IAAIY,EAAK,IAAI,GAAGZ,IAAI,GAAG,EAAEA;AAChC,MAAIY,EAAKZ,CAAC,KAAKY,EAAKZ,CAAC,EAAE,IAAIY,EAAK,MAC9BA,EAAK,IAAIA,EAAKZ,CAAC,EAAE;AAAA,EAGvB;AAEA,WAASwB,IAAa;AACpB,QAAK/B,GACL;AAAA,UAAIO,GAAGC,IAAIR,EAAM,QAAQU;AAEzB,WADAT,IAAQ,IAAI,MAAMO,CAAC,GACdD,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAG,IAAOV,EAAMO,CAAC,GAAGN,EAAMS,EAAK,KAAK,IAAI,CAACX,EAAOW,GAAMH,GAAGP,CAAK;AAAA;AAAA,EACrF;AAEA,SAAAM,EAAM,aAAa,SAAS0B,GAAQC,GAAS;AAC3C,IAAAjC,IAAQgC,GACR9B,IAAS+B,GACTF,EAAU;AAAA,EACZ,GAEAzB,EAAM,aAAa,SAAS4B,GAAG;AAC7B,WAAO,UAAU,UAAU9B,IAAa,CAAC8B,GAAG5B,KAASF;AAAA,EACvD,GAEAE,EAAM,WAAW,SAAS4B,GAAG;AAC3B,WAAO,UAAU,UAAU/B,IAAW,CAAC+B,GAAG5B,KAASH;AAAA,EACrD,GAEAG,EAAM,SAAS,SAAS4B,GAAG;AACzB,WAAO,UAAU,UAAUnC,IAAS,OAAOmC,KAAM,aAAaA,IAAI7B,EAAS,CAAC6B,CAAC,GAAGH,EAAU,GAAIzB,KAASP;AAAA,EACzG,GAEOO;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,9 @@
+function t(n) {
+  return function() {
+    return n;
+  };
+}
+export {
+  t as default
+};
+//# sourceMappingURL=constant.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"constant.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force/src/constant.js"],"sourcesContent":["function constant$1(x) {\n  return function() {\n    return x;\n  };\n}\n\nexport { constant$1 as default };\n//# sourceMappingURL=constant.js.map\n"],"names":["constant$1","x"],"mappings":"AAAA,SAASA,EAAWC,GAAG;AACrB,SAAO,WAAW;AAChB,WAAOA;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,7 @@
+function t(e) {
+  return (e() - 0.5) * 1e-6;
+}
+export {
+  t as default
+};
+//# sourceMappingURL=jiggle.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"jiggle.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force/src/jiggle.js"],"sourcesContent":["function jiggle$1(random) {\n  return (random() - 0.5) * 1e-6;\n}\n\nexport { jiggle$1 as default };\n//# sourceMappingURL=jiggle.js.map\n"],"names":["jiggle$1","random"],"mappings":"AAAA,SAASA,EAASC,GAAQ;AACxB,UAAQA,MAAW,OAAO;AAC5B;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,8 @@
+function $() {
+  let t = 1;
+  return () => (t = (1664525 * t + 1013904223) % 4294967296) / 4294967296;
+}
+export {
+  $ as default
+};
+//# sourceMappingURL=lcg.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"lcg.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/node_modules/d3-force/src/lcg.js"],"sourcesContent":["// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a$1 = 1664525;\nconst c$1 = 1013904223;\nconst m$1 = 4294967296; // 2^32\n\nfunction lcg$1() {\n  let s = 1;\n  return () => (s = (a$1 * s + c$1) % m$1) / m$1;\n}\n\nexport { lcg$1 as default };\n//# sourceMappingURL=lcg.js.map\n"],"names":["lcg$1","s"],"mappings":"AAKA,SAASA,IAAQ;AACf,MAAIC,IAAI;AACR,SAAO,OAAOA,KAAK,UAAMA,IAAI,cAAO,cAAO;AAC7C;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,59 @@
+import j from "./constant.js";
+import B from "./jiggle.js";
+function L(e) {
+  return e.index;
+}
+function D(e, d) {
+  var h = e.get(d);
+  if (!h) throw new Error("node not found: " + d);
+  return h;
+}
+function G(e) {
+  var d = L, h = E, y, p = j(30), w, c, o, $, z, A = 1;
+  e == null && (e = []);
+  function E(n) {
+    return 1 / Math.min(o[n.source.index], o[n.target.index]);
+  }
+  function r(n) {
+    for (var f = 0, g = e.length; f < A; ++f)
+      for (var u = 0, t, i, a, v, x, m, s; u < g; ++u)
+        t = e[u], i = t.source, a = t.target, v = a.x + a.vx - i.x - i.vx || B(z), x = a.y + a.vy - i.y - i.vy || B(z), m = Math.sqrt(v * v + x * x), m = (m - w[u]) / m * n * y[u], v *= m, x *= m, a.vx -= v * (s = $[u]), a.vy -= x * s, i.vx += v * (s = 1 - s), i.vy += x * s;
+  }
+  function M() {
+    if (c) {
+      var n, f = c.length, g = e.length, u = new Map(c.map((i, a) => [d(i, a, c), i])), t;
+      for (n = 0, o = new Array(f); n < g; ++n)
+        t = e[n], t.index = n, typeof t.source != "object" && (t.source = D(u, t.source)), typeof t.target != "object" && (t.target = D(u, t.target)), o[t.source.index] = (o[t.source.index] || 0) + 1, o[t.target.index] = (o[t.target.index] || 0) + 1;
+      for (n = 0, $ = new Array(g); n < g; ++n)
+        t = e[n], $[n] = o[t.source.index] / (o[t.source.index] + o[t.target.index]);
+      y = new Array(g), S(), w = new Array(g), q();
+    }
+  }
+  function S() {
+    if (c)
+      for (var n = 0, f = e.length; n < f; ++n)
+        y[n] = +h(e[n], n, e);
+  }
+  function q() {
+    if (c)
+      for (var n = 0, f = e.length; n < f; ++n)
+        w[n] = +p(e[n], n, e);
+  }
+  return r.initialize = function(n, f) {
+    c = n, z = f, M();
+  }, r.links = function(n) {
+    return arguments.length ? (e = n, M(), r) : e;
+  }, r.id = function(n) {
+    return arguments.length ? (d = n, r) : d;
+  }, r.iterations = function(n) {
+    return arguments.length ? (A = +n, r) : A;
+  }, r.strength = function(n) {
+    return arguments.length ? (h = typeof n == "function" ? n : j(+n), S(), r) : h;
+  }, r.distance = function(n) {
+    return arguments.length ? (p = typeof n == "function" ? n : j(+n), q(), r) : p;
+  }, r;
+}
+export {
+  G as default
+};
+//# sourceMappingURL=link.js.map