@performant-software/visualize 2.3.5 → 2.3.6-beta.0

package/dist/index.es182.js

@@ -1,10 +1,40 @@
-import n from "./index.es204.js";
-function u(e, t) {
-  for (var o = {}, r = 0, f = n(e); r < f; r++)
-    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
-  return o;
+import e from "./index.es64.js";
+import s from "react";
+var u = {
+  source: {
+    x: 0,
+    y: 0
+  },
+  target: {
+    x: 0,
+    y: 0
+  }
+};
+function a(t) {
+  var i = t.link, r = i === void 0 ? u : i;
+  return /* @__PURE__ */ s.createElement("line", {
+    x1: r.source.x,
+    y1: r.source.y,
+    x2: r.target.x,
+    y2: r.target.y,
+    strokeWidth: 2,
+    stroke: "#999",
+    strokeOpacity: 0.6
+  });
 }
+a.propTypes = {
+  link: e.shape({
+    source: e.shape({
+      x: e.number.isRequired,
+      y: e.number.isRequired
+    }).isRequired,
+    target: e.shape({
+      x: e.number.isRequired,
+      y: e.number.isRequired
+    }).isRequired
+  })
+};
 export {
-  u as default
+  a as default
 };
 //# sourceMappingURL=index.es182.js.map

package/dist/index.es182.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es182.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es182.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n  source: {\n    x: 0,\n    y: 0\n  },\n  target: {\n    x: 0,\n    y: 0\n  }\n};\nexport default function HierarchyDefaultLink(_ref) {\n  var _ref$link = _ref.link,\n    link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n  return /*#__PURE__*/React.createElement(\"line\", {\n    x1: link.source.x,\n    y1: link.source.y,\n    x2: link.target.x,\n    y2: link.target.y,\n    strokeWidth: 2,\n    stroke: \"#999\",\n    strokeOpacity: 0.6\n  });\n}\nHierarchyDefaultLink.propTypes = {\n  link: _pt.shape({\n    source: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired,\n    target: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired\n  })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":";;AAEA,IAAIA,IAAe;AAAA,EACjB,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AAAA,EACA,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC3B,SAAA,gBAAAE,EAAM,cAAc,QAAQ;AAAA,IAC9C,IAAID,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,eAAe;AAAA,EAAA,CAChB;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}

package/dist/index.es183.js

@@ -1,10 +1,26 @@
-function u(n, a, r) {
-  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
-  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
-    e[f] = n;
-  return e;
+import e from "./index.es64.js";
+import n from "react";
+function t(i) {
+  var o = i.node, r = o === void 0 ? {
+    x: 0,
+    y: 0,
+    r: 15
+  } : o;
+  return /* @__PURE__ */ n.createElement("circle", {
+    cx: r.x,
+    cy: r.y,
+    r: r.r || 15,
+    fill: "#21D4FD"
+  });
 }
+t.propTypes = {
+  node: e.shape({
+    x: e.number.isRequired,
+    y: e.number.isRequired,
+    r: e.number
+  })
+};
 export {
-  u as default
+  t as default
 };
 //# sourceMappingURL=index.es183.js.map

package/dist/index.es183.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es183.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es183.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n  var _ref$node = _ref.node,\n    node = _ref$node === void 0 ? {\n      x: 0,\n      y: 0,\n      r: 15\n    } : _ref$node;\n  return /*#__PURE__*/React.createElement(\"circle\", {\n    cx: node.x,\n    cy: node.y,\n    r: node.r || 15,\n    fill: \"#21D4FD\"\n  });\n}\nHierarchyDefaultNode.propTypes = {\n  node: _pt.shape({\n    x: _pt.number.isRequired,\n    y: _pt.number.isRequired,\n    r: _pt.number\n  })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}

package/dist/index.es184.js

@@ -1,12 +1,88 @@
-import { slice as n } from "./index.es6.js";
-function h(r, l) {
-  if (l == null || l < 1)
-    return [];
-  for (var t = [], e = 0, i = r.length; e < i; )
-    t.push(n.call(r, e, e += l));
-  return t;
+import { Node as k } from "./index.es37.js";
+function o(r, n) {
+  return r.parent === n.parent ? 1 : 2;
+}
+function S(r) {
+  var n = r.children;
+  return n ? n[0] : r.t;
+}
+function B(r) {
+  var n = r.children;
+  return n ? n[n.length - 1] : r.t;
+}
+function R(r, n, a) {
+  var i = a / (n.i - r.i);
+  n.c -= i, n.s += a, r.c += i, n.z += a, n.m += a;
+}
+function W(r) {
+  for (var n = 0, a = 0, i = r.children, u = i.length, z; --u >= 0; )
+    z = i[u], z.z += n, z.m += n, n += z.s + (a += z.c);
+}
+function b(r, n, a) {
+  return r.a.parent === n.parent ? r.a : a;
+}
+function A(r, n) {
+  this._ = r, this.parent = null, this.children = null, this.A = null, this.a = this, this.z = 0, this.m = 0, this.c = 0, this.s = 0, this.t = null, this.i = n;
+}
+A.prototype = Object.create(k.prototype);
+function j(r) {
+  for (var n = new A(r, 0), a, i = [n], u, z, x, y; a = i.pop(); )
+    if (z = a._.children)
+      for (a.children = new Array(y = z.length), x = y - 1; x >= 0; --x)
+        i.push(u = a.children[x] = new A(z[x], x)), u.parent = a;
+  return (n.parent = new A(null, 0)).children = [n], n;
+}
+function L() {
+  var r = o, n = 1, a = 1, i = null;
+  function u(e) {
+    var f = j(e);
+    if (f.eachAfter(z), f.parent.m = -f.z, f.eachBefore(x), i)
+      e.eachBefore(N);
+    else {
+      var d = e, t = e, c = e;
+      e.eachBefore(function(l) {
+        l.x < d.x && (d = l), l.x > t.x && (t = l), l.depth > c.depth && (c = l);
+      });
+      var h = d === t ? 1 : r(d, t) / 2, s = h - d.x, g = n / (t.x + h + s), _ = a / (c.depth || 1);
+      e.eachBefore(function(l) {
+        l.x = (l.x + s) * g, l.y = l.depth * _;
+      });
+    }
+    return e;
+  }
+  function z(e) {
+    var f = e.children, d = e.parent.children, t = e.i ? d[e.i - 1] : null;
+    if (f) {
+      W(e);
+      var c = (f[0].z + f[f.length - 1].z) / 2;
+      t ? (e.z = t.z + r(e._, t._), e.m = e.z - c) : e.z = c;
+    } else
+      t && (e.z = t.z + r(e._, t._));
+    e.parent.A = y(e, t, e.parent.A || d[0]);
+  }
+  function x(e) {
+    e._.x = e.z + e.parent.m, e.m += e.parent.m;
+  }
+  function y(e, f, d) {
+    if (f) {
+      for (var t = e, c = e, h = f, s = t.parent.children[0], g = t.m, _ = c.m, l = h.m, w = s.m, p; h = B(h), t = S(t), h && t; )
+        s = S(s), c = B(c), c.a = e, p = h.z + l - t.z - g + r(h._, t._), p > 0 && (R(b(h, e, d), e, p), g += p, _ += p), l += h.m, g += t.m, w += s.m, _ += c.m;
+      h && !B(c) && (c.t = h, c.m += l - _), t && !S(s) && (s.t = t, s.m += g - w, d = e);
+    }
+    return d;
+  }
+  function N(e) {
+    e.x *= n, e.y = e.depth * a;
+  }
+  return u.separation = function(e) {
+    return arguments.length ? (r = e, u) : r;
+  }, u.size = function(e) {
+    return arguments.length ? (i = !1, n = +e[0], a = +e[1], u) : i ? null : [n, a];
+  }, u.nodeSize = function(e) {
+    return arguments.length ? (i = !0, n = +e[0], a = +e[1], u) : i ? [n, a] : null;
+  }, u;
 }
 export {
-  h as default
+  L as default
 };
 //# sourceMappingURL=index.es184.js.map

package/dist/index.es184.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es184.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es184.js","sources":["../../../node_modules/d3-hierarchy/src/tree.js"],"sourcesContent":["import {Node} from \"./hierarchy/index.js\";\n\nfunction defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\n// function radialSeparation(a, b) {\n//   return (a.parent === b.parent ? 1 : 2) / a.depth;\n// }\n\n// This function is used to traverse the left contour of a subtree (or\n// subforest). It returns the successor of v on this contour. This successor is\n// either given by the leftmost child of v or by the thread of v. The function\n// returns null if and only if v is on the highest level of its subtree.\nfunction nextLeft(v) {\n  var children = v.children;\n  return children ? children[0] : v.t;\n}\n\n// This function works analogously to nextLeft.\nfunction nextRight(v) {\n  var children = v.children;\n  return children ? children[children.length - 1] : v.t;\n}\n\n// Shifts the current subtree rooted at w+. This is done by increasing\n// prelim(w+) and mod(w+) by shift.\nfunction moveSubtree(wm, wp, shift) {\n  var change = shift / (wp.i - wm.i);\n  wp.c -= change;\n  wp.s += shift;\n  wm.c += change;\n  wp.z += shift;\n  wp.m += shift;\n}\n\n// All other shifts, applied to the smaller subtrees between w- and w+, are\n// performed by this function. To prepare the shifts, we have to adjust\n// change(w+), shift(w+), and change(w-).\nfunction executeShifts(v) {\n  var shift = 0,\n      change = 0,\n      children = v.children,\n      i = children.length,\n      w;\n  while (--i >= 0) {\n    w = children[i];\n    w.z += shift;\n    w.m += shift;\n    shift += w.s + (change += w.c);\n  }\n}\n\n// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,\n// returns the specified (default) ancestor.\nfunction nextAncestor(vim, v, ancestor) {\n  return vim.a.parent === v.parent ? vim.a : ancestor;\n}\n\nfunction TreeNode(node, i) {\n  this._ = node;\n  this.parent = null;\n  this.children = null;\n  this.A = null; // default ancestor\n  this.a = this; // ancestor\n  this.z = 0; // prelim\n  this.m = 0; // mod\n  this.c = 0; // change\n  this.s = 0; // shift\n  this.t = null; // thread\n  this.i = i; // number\n}\n\nTreeNode.prototype = Object.create(Node.prototype);\n\nfunction treeRoot(root) {\n  var tree = new TreeNode(root, 0),\n      node,\n      nodes = [tree],\n      child,\n      children,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if (children = node._.children) {\n      node.children = new Array(n = children.length);\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = node.children[i] = new TreeNode(children[i], i));\n        child.parent = node;\n      }\n    }\n  }\n\n  (tree.parent = new TreeNode(null, 0)).children = [tree];\n  return tree;\n}\n\n// Node-link tree diagram using the Reingold-Tilford \"tidy\" algorithm\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = null;\n\n  function tree(root) {\n    var t = treeRoot(root);\n\n    // Compute the layout using Buchheim et al.’s algorithm.\n    t.eachAfter(firstWalk), t.parent.m = -t.z;\n    t.eachBefore(secondWalk);\n\n    // If a fixed node size is specified, scale x and y.\n    if (nodeSize) root.eachBefore(sizeNode);\n\n    // If a fixed tree size is specified, scale x and y based on the extent.\n    // Compute the left-most, right-most, and depth-most nodes for extents.\n    else {\n      var left = root,\n          right = root,\n          bottom = root;\n      root.eachBefore(function(node) {\n        if (node.x < left.x) left = node;\n        if (node.x > right.x) right = node;\n        if (node.depth > bottom.depth) bottom = node;\n      });\n      var s = left === right ? 1 : separation(left, right) / 2,\n          tx = s - left.x,\n          kx = dx / (right.x + s + tx),\n          ky = dy / (bottom.depth || 1);\n      root.eachBefore(function(node) {\n        node.x = (node.x + tx) * kx;\n        node.y = node.depth * ky;\n      });\n    }\n\n    return root;\n  }\n\n  // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is\n  // applied recursively to the children of v, as well as the function\n  // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the\n  // node v is placed to the midpoint of its outermost children.\n  function firstWalk(v) {\n    var children = v.children,\n        siblings = v.parent.children,\n        w = v.i ? siblings[v.i - 1] : null;\n    if (children) {\n      executeShifts(v);\n      var midpoint = (children[0].z + children[children.length - 1].z) / 2;\n      if (w) {\n        v.z = w.z + separation(v._, w._);\n        v.m = v.z - midpoint;\n      } else {\n        v.z = midpoint;\n      }\n    } else if (w) {\n      v.z = w.z + separation(v._, w._);\n    }\n    v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\n  }\n\n  // Computes all real x-coordinates by summing up the modifiers recursively.\n  function secondWalk(v) {\n    v._.x = v.z + v.parent.m;\n    v.m += v.parent.m;\n  }\n\n  // The core of the algorithm. Here, a new subtree is combined with the\n  // previous subtrees. Threads are used to traverse the inside and outside\n  // contours of the left and right subtree up to the highest common level. The\n  // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the\n  // superscript o means outside and i means inside, the subscript - means left\n  // subtree and + means right subtree. For summing up the modifiers along the\n  // contour, we use respective variables si+, si-, so-, and so+. Whenever two\n  // nodes of the inside contours conflict, we compute the left one of the\n  // greatest uncommon ancestors using the function ANCESTOR and call MOVE\n  // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.\n  // Finally, we add a new thread (if necessary).\n  function apportion(v, w, ancestor) {\n    if (w) {\n      var vip = v,\n          vop = v,\n          vim = w,\n          vom = vip.parent.children[0],\n          sip = vip.m,\n          sop = vop.m,\n          sim = vim.m,\n          som = vom.m,\n          shift;\n      while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {\n        vom = nextLeft(vom);\n        vop = nextRight(vop);\n        vop.a = v;\n        shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\n        if (shift > 0) {\n          moveSubtree(nextAncestor(vim, v, ancestor), v, shift);\n          sip += shift;\n          sop += shift;\n        }\n        sim += vim.m;\n        sip += vip.m;\n        som += vom.m;\n        sop += vop.m;\n      }\n      if (vim && !nextRight(vop)) {\n        vop.t = vim;\n        vop.m += sim - sop;\n      }\n      if (vip && !nextLeft(vom)) {\n        vom.t = vip;\n        vom.m += sip - som;\n        ancestor = v;\n      }\n    }\n    return ancestor;\n  }\n\n  function sizeNode(node) {\n    node.x *= dx;\n    node.y = node.depth * dy;\n  }\n\n  tree.separation = function(x) {\n    return arguments.length ? (separation = x, tree) : separation;\n  };\n\n  tree.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);\n  };\n\n  tree.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return tree;\n}\n"],"names":["defaultSeparation","a","b","nextLeft","v","children","nextRight","moveSubtree","wm","wp","shift","change","executeShifts","i","w","nextAncestor","vim","ancestor","TreeNode","node","Node","treeRoot","root","tree","nodes","child","n","d3tree","separation","dx","dy","nodeSize","t","firstWalk","secondWalk","sizeNode","left","right","bottom","s","tx","kx","ky","siblings","midpoint","apportion","vip","vop","vom","sip","sop","sim","som","x"],"mappings":";AAEA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAUA,SAASC,EAASC,GAAG;AACnB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAAS,CAAC,IAAID,EAAE;AACpC;AAGA,SAASE,EAAUF,GAAG;AACpB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAASA,EAAS,SAAS,CAAC,IAAID,EAAE;AACtD;AAIA,SAASG,EAAYC,GAAIC,GAAIC,GAAO;AAClC,MAAIC,IAASD,KAASD,EAAG,IAAID,EAAG;AAChC,EAAAC,EAAG,KAAKE,GACRF,EAAG,KAAKC,GACRF,EAAG,KAAKG,GACRF,EAAG,KAAKC,GACRD,EAAG,KAAKC;AACV;AAKA,SAASE,EAAcR,GAAG;AAMjB,WALHM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACEA,KAAAI,EAAE,KAAKH,KAAUG,EAAE;AAEhC;AAIA,SAASC,EAAaC,GAAKZ,GAAGa,GAAU;AACtC,SAAOD,EAAI,EAAE,WAAWZ,EAAE,SAASY,EAAI,IAAIC;AAC7C;AAEA,SAASC,EAASC,GAAMN,GAAG;AACzB,OAAK,IAAIM,GACT,KAAK,SAAS,MACd,KAAK,WAAW,MAChB,KAAK,IAAI,MACT,KAAK,IAAI,MACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,MACT,KAAK,IAAIN;AACX;AAEAK,EAAS,YAAY,OAAO,OAAOE,EAAK,SAAS;AAEjD,SAASC,EAASC,GAAM;AASf,WARHC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AACd,QAAAnB,IAAWc,EAAK,EAAE;AAEpB,WADAA,EAAK,WAAW,IAAI,MAAMO,IAAIrB,EAAS,MAAM,GACxCQ,IAAIa,IAAI,GAAGb,KAAK,GAAG,EAAEA;AACxB,QAAAW,EAAM,KAAKC,IAAQN,EAAK,SAASN,CAAC,IAAI,IAAIK,EAASb,EAASQ,CAAC,GAAGA,CAAC,CAAC,GAClEY,EAAM,SAASN;AAKpB,UAAAI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAG0B,SAAAI,IAAA;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AACd,QAAAU,IAAIX,EAASC,CAAI;AAOjB,QAJJU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH;AAAU,MAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACR,MAAAA,EAAA,WAAW,SAASH,GAAM;AACzB,QAAAA,EAAK,IAAIiB,EAAK,MAAUA,IAAAjB,IACxBA,EAAK,IAAIkB,EAAM,MAAWA,IAAAlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAgBA,IAAAnB;AAAA,MAAA,CACzC;AACG,UAAAoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC1B,MAAAhB,EAAA,WAAW,SAASH,GAAM;AACxB,QAAAA,EAAA,KAAKA,EAAK,IAAIqB,KAAMC,GACpBtB,EAAA,IAAIA,EAAK,QAAQuB;AAAA,MAAA,CACvB;AAAA,IACH;AAEO,WAAApB;AAAA,EACT;AAMA,WAASW,EAAU7B,GAAG;AACpB,QAAIC,IAAWD,EAAE,UACbuC,IAAWvC,EAAE,OAAO,UACpBU,IAAIV,EAAE,IAAIuC,EAASvC,EAAE,IAAI,CAAC,IAAI;AAClC,QAAIC,GAAU;AACZ,MAAAO,EAAcR,CAAC;AACX,UAAAwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC7BV,EAAA,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA;MAEC9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAE/B,IAAAV,EAAA,OAAO,IAAIyC,EAAUzC,GAAGU,GAAGV,EAAE,OAAO,KAAKuC,EAAS,CAAC,CAAC;AAAA,EACxD;AAGA,WAAST,EAAW9B,GAAG;AACrB,IAAAA,EAAE,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,GACrBA,EAAA,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaS,WAAAyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUE,eATHgC,IAAM1C,GACN2C,IAAM3C,GACNY,IAAMF,GACNkC,IAAMF,EAAI,OAAO,SAAS,CAAC,GAC3BG,IAAMH,EAAI,GACVI,IAAMH,EAAI,GACVI,IAAMnC,EAAI,GACVoC,IAAMJ,EAAI,GACVtC,GACGM,IAAMV,EAAUU,CAAG,GAAG8B,IAAM3C,EAAS2C,CAAG,GAAG9B,KAAO8B;AACvD,QAAAE,IAAM7C,EAAS6C,CAAG,GAClBD,IAAMzC,EAAUyC,CAAG,GACnBA,EAAI,IAAI3C,GACAM,IAAAM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GAC7CuC,KAAAvC,GACAwC,KAAAxC,IAETyC,KAAOnC,EAAI,GACXiC,KAAOH,EAAI,GACXM,KAAOJ,EAAI,GACXE,KAAOH,EAAI;AAEb,MAAI/B,KAAO,CAACV,EAAUyC,CAAG,MACvBA,EAAI,IAAI/B,GACR+B,EAAI,KAAKI,IAAMD,IAEbJ,KAAO,CAAC3C,EAAS6C,CAAG,MACtBA,EAAI,IAAIF,GACRE,EAAI,KAAKC,IAAMG,GACJnC,IAAAb;AAAA,IAEf;AACO,WAAAa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACLV,EAAA,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEK,SAAAP,EAAA,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EAAA,GAGhDL,EAAA,OAAO,SAAS8B,GAAG;AACtB,WAAO,UAAU,UAAUtB,IAAW,IAAOF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAAA,GAGpGP,EAAA,WAAW,SAAS8B,GAAG;AAC1B,WAAO,UAAU,UAAUtB,IAAW,IAAMF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EAAA,GAG9FP;AACT;","x_google_ignoreList":[0]}

package/dist/index.es186.js

@@ -1,7 +1,7 @@
-import { slice as g } from "./index.es266.js";
-import p from "./index.es267.js";
-import { x as v, y as h } from "./index.es268.js";
-import c from "./index.es265.js";
+import { slice as g } from "./index.es268.js";
+import p from "./index.es269.js";
+import { x as v, y as h } from "./index.es270.js";
+import c from "./index.es267.js";
 import k from "./index.es187.js";
 function T(n) {
   return n.source;

package/dist/index.es188.js

@@ -1,4 +1,4 @@
-import { isTouchEvent as a, isMouseEvent as c } from "./index.es66.js";
+import { isTouchEvent as a, isMouseEvent as c } from "./index.es63.js";
 function i() {
   return i = Object.assign ? Object.assign.bind() : function(n) {
     for (var r = 1; r < arguments.length; r++) {

package/dist/index.es19.js

@@ -1,4 +1,4 @@
-import m from "./index.es85.js";
+import m from "./index.es82.js";
 import p from "./index.es219.js";
 import s from "./index.es10.js";
 var l = m(function(u, e) {

package/dist/index.es192.js

@@ -1,6 +1,6 @@
-import { __module as e } from "./index.es248.js";
-import { __require as o } from "./index.es249.js";
-import { __require as t } from "./index.es250.js";
+import { __module as e } from "./index.es250.js";
+import { __require as o } from "./index.es251.js";
+import { __require as t } from "./index.es252.js";
 var r;
 function p() {
   return r ? e.exports : (r = 1, process.env.NODE_ENV === "production" ? e.exports = o() : e.exports = t(), e.exports);

package/dist/index.es193.js

@@ -1,8 +1,8 @@
 import { __require as F } from "./index.es192.js";
-import { __require as N } from "./index.es251.js";
-import { __require as ee } from "./index.es252.js";
-import { __require as re } from "./index.es253.js";
-import { __require as ne } from "./index.es254.js";
+import { __require as N } from "./index.es253.js";
+import { __require as ee } from "./index.es254.js";
+import { __require as re } from "./index.es255.js";
+import { __require as ne } from "./index.es256.js";
 var A, C;
 function oe() {
   if (C)

package/dist/index.es194.js

@@ -1,4 +1,4 @@
-import { __require as u } from "./index.es252.js";
+import { __require as u } from "./index.es254.js";
 var o, p;
 function g() {
   if (p)

package/dist/index.es196.js

@@ -1,4 +1,4 @@
-import { V as a, c as et } from "./index.es275.js";
+import { V as a, c as et } from "./index.es274.js";
 function st(s, t) {
   if (typeof s != "object" || s === null)
     return s;

package/dist/index.es199.js

@@ -1,4 +1,4 @@
-import { _ as o } from "./index.es245.js";
+import { _ as o } from "./index.es257.js";
 var r = o, n = function() {
   return r.Date.now();
 }, a = n;

package/dist/index.es20.js

@@ -1,4 +1,4 @@
-import o from "./index.es85.js";
+import o from "./index.es82.js";
 import u from "./index.es7.js";
 import c from "./index.es219.js";
 const a = o(function(t, r, e) {

package/dist/index.es200.js

@@ -1,6 +1,6 @@
-import { _ as o } from "./index.es246.js";
+import { _ as o } from "./index.es258.js";
 import { i as n } from "./index.es198.js";
-import { i as m } from "./index.es247.js";
+import { i as m } from "./index.es259.js";
 var b = o, s = n, e = m, f = NaN, p = /^[-+]0x[0-9a-f]+$/i, y = /^0b[01]+$/i, a = /^0o[0-7]+$/i, c = parseInt;
 function I(r) {
   if (typeof r == "number")

package/dist/index.es203.js

@@ -1,4 +1,4 @@
-import e from "./index.es260.js";
+import e from "./index.es262.js";
 import t from "./index.es205.js";
 const f = e(t);
 export {

package/dist/index.es204.js

@@ -1,4 +1,4 @@
-import t from "./index.es262.js";
+import t from "./index.es261.js";
 const o = t("length");
 export {
   o as default

package/dist/index.es205.js

@@ -1,4 +1,4 @@
-import t from "./index.es262.js";
+import t from "./index.es261.js";
 const o = t("byteLength");
 export {
   o as default

package/dist/index.es207.js

@@ -1,6 +1,6 @@
 import o from "./index.es204.js";
 import f from "./index.es7.js";
-import m from "./index.es108.js";
+import m from "./index.es105.js";
 function v(e) {
   var l = o(e);
   return function(r) {

package/dist/index.es21.js

@@ -1,4 +1,4 @@
-import i from "./index.es85.js";
+import i from "./index.es82.js";
 import f from "./index.es220.js";
 import l from "./index.es20.js";
 const s = i(function(r, t) {

package/dist/index.es210.js

@@ -1,4 +1,4 @@
-import o from "./index.es86.js";
+import o from "./index.es83.js";
 import { nativeCreate as e } from "./index.es6.js";
 function u() {
   return function() {

package/dist/index.es215.js

@@ -1,4 +1,4 @@
-import u from "./index.es107.js";
+import u from "./index.es104.js";
 function n(r) {
   var c = function(e) {
     return r[e];

package/dist/index.es217.js

@@ -1,4 +1,4 @@
-import e from "./index.es111.js";
+import e from "./index.es108.js";
 import p from "./index.es216.js";
 const r = e(p);
 export {

package/dist/index.es218.js

@@ -1,9 +1,9 @@
-import o from "./index.es122.js";
+import o from "./index.es119.js";
 import m from "./index.es7.js";
-import f from "./index.es86.js";
-import p from "./index.es99.js";
-import n from "./index.es127.js";
-import e from "./index.es125.js";
+import f from "./index.es83.js";
+import p from "./index.es96.js";
+import n from "./index.es124.js";
+import e from "./index.es122.js";
 import s from "./index.es214.js";
 function x(r, t, i) {
   return r == null ? o : m(r) ? s(r, t, i) : f(r) && !p(r) ? n(r) : e(r);

package/dist/index.es219.js

@@ -1,5 +1,5 @@
 import i from "./index.es210.js";
-import n from "./index.es86.js";
+import n from "./index.es83.js";
 function u(t, a, f, o, e) {
   if (!(o instanceof a))
     return t.apply(f, e);

package/dist/index.es22.js

@@ -1,4 +1,4 @@
-import r from "./index.es85.js";
+import r from "./index.es82.js";
 const o = r(function(t, e, n) {
   return setTimeout(function() {
     return t.apply(null, n);

package/dist/index.es220.js

@@ -1,6 +1,6 @@
 import l from "./index.es204.js";
 import y from "./index.es223.js";
-import A from "./index.es99.js";
+import A from "./index.es96.js";
 import c from "./index.es9.js";
 function x(n, i, s, r) {
   if (r = r || [], !i && i !== 0)

package/dist/index.es222.js

@@ -1,6 +1,6 @@
 import c from "./index.es204.js";
 import { slice as m } from "./index.es6.js";
-import p from "./index.es101.js";
+import p from "./index.es98.js";
 function M(o, l, u) {
   return function(t, f, e) {
     var r = 0, n = c(t);

package/dist/index.es223.js

@@ -1,4 +1,4 @@
-import e from "./index.es260.js";
+import e from "./index.es262.js";
 import r from "./index.es204.js";
 const i = e(r);
 export {

package/dist/index.es224.js

@@ -1,5 +1,5 @@
 import p from "./index.es223.js";
-import s from "./index.es107.js";
+import s from "./index.es104.js";
 import g from "./index.es214.js";
 function k(i) {
   var l = function(r, a, n, f) {

package/dist/index.es225.js

@@ -1,5 +1,5 @@
 import i from "./index.es213.js";
-import a from "./index.es151.js";
+import a from "./index.es148.js";
 function g(f, t) {
   return function(n, r, c) {
     var o = t ? [[], []] : {};

package/dist/index.es228.js

@@ -1,16 +1,10 @@
-function i(u) {
-  var e = 0, n = u.children, t = n && n.length;
-  if (!t)
-    e = 1;
-  else
-    for (; --t >= 0; )
-      e += n[t].value;
-  u.value = e;
-}
-function l() {
-  return this.eachAfter(i);
+import o from "./index.es67.js";
+import i from "./index.es263.js";
+function f(t) {
+  var r = i(t, "string");
+  return o(r) == "symbol" ? r : String(r);
 }
 export {
-  l as default
+  f as default
 };
 //# sourceMappingURL=index.es228.js.map

package/dist/index.es228.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es228.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/count.js"],"sourcesContent":["function count(node) {\n  var sum = 0,\n      children = node.children,\n      i = children && children.length;\n  if (!i) sum = 1;\n  else while (--i >= 0) sum += children[i].value;\n  node.value = sum;\n}\n\nexport default function() {\n  return this.eachAfter(count);\n}\n"],"names":["count","node","sum","children","i","node_count"],"mappings":"AAAA,SAASA,EAAMC,GAAM;AACnB,MAAIC,IAAM,GACNC,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS;AAC7B,MAAI,CAACC;AAAS,IAAAF,IAAA;AAAA;AACT,WAAO,EAAEE,KAAK;AAAU,MAAAF,KAAAC,EAASC,CAAC,EAAE;AACzC,EAAAH,EAAK,QAAQC;AACf;AAE0B,SAAAG,IAAA;AACjB,SAAA,KAAK,UAAUL,CAAK;AAC7B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es228.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js"],"sourcesContent":["import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nexport default function toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : String(i);\n}"],"names":["toPropertyKey","i","toPrimitive","_typeof"],"mappings":";;AAEA,SAAwBA,EAAc,GAAG;AACnC,MAAAC,IAAIC,EAAY,GAAG,QAAQ;AAC/B,SAAmBC,EAAQF,CAAC,KAArB,WAAyBA,IAAI,OAAOA,CAAC;AAC9C;","x_google_ignoreList":[0]}

package/dist/index.es229.js

@@ -1,14 +1,9 @@
-function o(l) {
-  var e = this, t, n = [e], r, h, i;
-  do
-    for (t = n.reverse(), n = []; e = t.pop(); )
-      if (l(e), r = e.children, r)
-        for (h = 0, i = r.length; h < i; ++h)
-          n.push(r[h]);
-  while (n.length);
-  return this;
+function e(o, r) {
+  return e = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(t, f) {
+    return t.__proto__ = f, t;
+  }, e(o, r);
 }
 export {
-  o as default
+  e as default
 };
 //# sourceMappingURL=index.es229.js.map

package/dist/index.es229.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es229.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/each.js"],"sourcesContent":["export default function(callback) {\n  var node = this, current, next = [node], children, i, n;\n  do {\n    current = next.reverse(), next = [];\n    while (node = current.pop()) {\n      callback(node), children = node.children;\n      if (children) for (i = 0, n = children.length; i < n; ++i) {\n        next.push(children[i]);\n      }\n    }\n  } while (next.length);\n  return this;\n}\n"],"names":["node_each","callback","node","current","next","children","i","n"],"mappings":"AAAA,SAAAA,EAAwBC,GAAU;AAC5B,MAAAC,IAAO,MAAMC,GAASC,IAAO,CAACF,CAAI,GAAGG,GAAUC,GAAGC;AACnD;AAEM,SADPJ,IAAUC,EAAK,WAAWA,IAAO,CAAA,GAC1BF,IAAOC,EAAQ;AAEhB,UADKF,EAAAC,CAAI,GAAGG,IAAWH,EAAK,UAC5BG;AAAe,aAAAC,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AACjD,UAAAF,EAAA,KAAKC,EAASC,CAAC,CAAC;AAAA,SAGlBF,EAAK;AACP,SAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es229.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js"],"sourcesContent":["export default function _setPrototypeOf(o, p) {\n  _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {\n    o.__proto__ = p;\n    return o;\n  };\n  return _setPrototypeOf(o, p);\n}"],"names":["_setPrototypeOf","p","o"],"mappings":"AAAwB,SAAAA,EAAgB,GAAGC,GAAG;AAC1B,SAAAD,IAAA,OAAO,iBAAiB,OAAO,eAAe,SAAS,SAAyBE,GAAGD,GAAG;AACtGC,WAAAA,EAAE,YAAYD,GACPC;AAAAA,EAAA,GAEFF,EAAgB,GAAGC,CAAC;AAC7B;","x_google_ignoreList":[0]}

package/dist/index.es230.js

@@ -1,11 +1,8 @@
-function r(o) {
-  for (var e = this, i = [e], n, h; e = i.pop(); )
-    if (o(e), n = e.children, n)
-      for (h = n.length - 1; h >= 0; --h)
-        i.push(n[h]);
-  return this;
+function a(r) {
+  if (Array.isArray(r))
+    return r;
 }
 export {
-  r as default
+  a as default
 };
 //# sourceMappingURL=index.es230.js.map

package/dist/index.es230.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es230.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/eachBefore.js"],"sourcesContent":["export default function(callback) {\n  var node = this, nodes = [node], children, i;\n  while (node = nodes.pop()) {\n    callback(node), children = node.children;\n    if (children) for (i = children.length - 1; i >= 0; --i) {\n      nodes.push(children[i]);\n    }\n  }\n  return this;\n}\n"],"names":["node_eachBefore","callback","node","nodes","children","i"],"mappings":"AAAA,SAAAA,EAAwBC,GAAU;AAEzB,WADHC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,GAAUC,GACpCH,IAAOC,EAAM;AAEd,QADKF,EAAAC,CAAI,GAAGE,IAAWF,EAAK,UAC5BE;AAAU,WAAKC,IAAID,EAAS,SAAS,GAAGC,KAAK,GAAG,EAAEA;AAC9C,QAAAF,EAAA,KAAKC,EAASC,CAAC,CAAC;AAGnB,SAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es230.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js"],"sourcesContent":["export default function _arrayWithHoles(arr) {\n  if (Array.isArray(arr)) return arr;\n}"],"names":["_arrayWithHoles","arr"],"mappings":"AAAA,SAAwBA,EAAgBC,GAAK;AACvC,MAAA,MAAM,QAAQA,CAAG;AAAU,WAAAA;AACjC;","x_google_ignoreList":[0]}

package/dist/index.es231.js

@@ -1,13 +1,8 @@
-function p(r) {
-  for (var e = this, i = [e], t = [], n, h, o; e = i.pop(); )
-    if (t.push(e), n = e.children, n)
-      for (h = 0, o = n.length; h < o; ++h)
-        i.push(n[h]);
-  for (; e = t.pop(); )
-    r(e);
-  return this;
+function o(r) {
+  if (typeof Symbol < "u" && r[Symbol.iterator] != null || r["@@iterator"] != null)
+    return Array.from(r);
 }
 export {
-  p as default
+  o as default
 };
 //# sourceMappingURL=index.es231.js.map

package/dist/index.es231.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es231.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/eachAfter.js"],"sourcesContent":["export default function(callback) {\n  var node = this, nodes = [node], next = [], children, i, n;\n  while (node = nodes.pop()) {\n    next.push(node), children = node.children;\n    if (children) for (i = 0, n = children.length; i < n; ++i) {\n      nodes.push(children[i]);\n    }\n  }\n  while (node = next.pop()) {\n    callback(node);\n  }\n  return this;\n}\n"],"names":["node_eachAfter","callback","node","nodes","next","children","i","n"],"mappings":"AAAA,SAAAA,EAAwBC,GAAU;AAEzB,WADHC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,IAAO,IAAIC,GAAUC,GAAGC,GAClDL,IAAOC,EAAM;AAEd,QADJC,EAAK,KAAKF,CAAI,GAAGG,IAAWH,EAAK,UAC7BG;AAAe,WAAAC,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AAChD,QAAAH,EAAA,KAAKE,EAASC,CAAC,CAAC;AAGnB,SAAAJ,IAAOE,EAAK;AACjB,IAAAH,EAASC,CAAI;AAER,SAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es231.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/iterableToArray.js"],"sourcesContent":["export default function _iterableToArray(iter) {\n  if (typeof Symbol !== \"undefined\" && iter[Symbol.iterator] != null || iter[\"@@iterator\"] != null) return Array.from(iter);\n}"],"names":["_iterableToArray","iter"],"mappings":"AAAA,SAAwBA,EAAiBC,GAAM;AACzC,MAAA,OAAO,SAAW,OAAeA,EAAK,OAAO,QAAQ,KAAK,QAAQA,EAAK,YAAY,KAAK;AAAa,WAAA,MAAM,KAAKA,CAAI;AAC1H;","x_google_ignoreList":[0]}

package/dist/index.es232.js

@@ -1,11 +1,16 @@
-function l(i) {
-  return this.eachAfter(function(e) {
-    for (var a = +i(e.data) || 0, t = e.children, u = t && t.length; --u >= 0; )
-      a += t[u].value;
-    e.value = a;
-  });
+import a from "./index.es264.js";
+function i(r, e) {
+  if (r) {
+    if (typeof r == "string")
+      return a(r, e);
+    var t = Object.prototype.toString.call(r).slice(8, -1);
+    if (t === "Object" && r.constructor && (t = r.constructor.name), t === "Map" || t === "Set")
+      return Array.from(r);
+    if (t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t))
+      return a(r, e);
+  }
 }
 export {
-  l as default
+  i as default
 };
 //# sourceMappingURL=index.es232.js.map

package/dist/index.es232.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es232.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/sum.js"],"sourcesContent":["export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n"],"names":["node_sum","value","node","sum","children","i"],"mappings":"AAAA,SAAAA,EAAwBC,GAAO;AACtB,SAAA,KAAK,UAAU,SAASC,GAAM;AAInC,aAHIC,IAAM,CAACF,EAAMC,EAAK,IAAI,KAAK,GAC3BE,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS,QACtB,EAAEC,KAAK;AAAU,MAAAF,KAAAC,EAASC,CAAC,EAAE;AACpC,IAAAH,EAAK,QAAQC;AAAA,EAAA,CACd;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es232.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js"],"sourcesContent":["import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}"],"names":["_unsupportedIterableToArray","o","minLen","arrayLikeToArray","n"],"mappings":";AACwB,SAAAA,EAA4BC,GAAGC,GAAQ;AAC7D,MAAKD,GACL;AAAA,QAAI,OAAOA,KAAM;AAAiB,aAAAE,EAAiBF,GAAGC,CAAM;AACxD,QAAAE,IAAI,OAAO,UAAU,SAAS,KAAKH,CAAC,EAAE,MAAM,GAAG,EAAE;AAEjD,QADAG,MAAM,YAAYH,EAAE,gBAAaG,IAAIH,EAAE,YAAY,OACnDG,MAAM,SAASA,MAAM;AAAc,aAAA,MAAM,KAAKH,CAAC;AACnD,QAAIG,MAAM,eAAe,2CAA2C,KAAKA,CAAC;AAAU,aAAAD,EAAiBF,GAAGC,CAAM;AAAA;AAChH;","x_google_ignoreList":[0]}