@performant-software/visualize 2.3.10-beta.0 → 2.3.10-beta.2

package/dist/index.es189.js

@@ -1,88 +1,19 @@
-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;
+var a = /* @__PURE__ */ function() {
+  function r(t) {
+    var o = t.x, y = o === void 0 ? 0 : o, n = t.y, u = n === void 0 ? 0 : n;
+    this.x = 0, this.y = 0, this.x = y, this.y = u;
   }
-  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;
-}
+  var i = r.prototype;
+  return i.value = function() {
+    return {
+      x: this.x,
+      y: this.y
+    };
+  }, i.toArray = function() {
+    return [this.x, this.y];
+  }, r;
+}();
 export {
-  L as default
+  a as default
 };
 //# sourceMappingURL=index.es189.js.map

package/dist/index.es189.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es189.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]}
+{"version":3,"file":"index.es189.js","sources":["../../../node_modules/@visx/point/esm/Point.js"],"sourcesContent":["var Point = /*#__PURE__*/function () {\n  function Point(_ref) {\n    var _ref$x = _ref.x,\n      x = _ref$x === void 0 ? 0 : _ref$x,\n      _ref$y = _ref.y,\n      y = _ref$y === void 0 ? 0 : _ref$y;\n    this.x = 0;\n    this.y = 0;\n    this.x = x;\n    this.y = y;\n  }\n  var _proto = Point.prototype;\n  _proto.value = function value() {\n    return {\n      x: this.x,\n      y: this.y\n    };\n  };\n  _proto.toArray = function toArray() {\n    return [this.x, this.y];\n  };\n  return Point;\n}();\nexport { Point as default };"],"names":["Point","_ref","_ref$x","x","_ref$y","y","_proto"],"mappings":"AAAA,IAAIA,IAAiC,2BAAA;AACnC,WAASA,EAAMC,GAAM;AACnB,QAAIC,IAASD,EAAK,GAChBE,IAAID,MAAW,SAAS,IAAIA,GAC5BE,IAASH,EAAK,GACdI,IAAID,MAAW,SAAS,IAAIA;AAC9B,SAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAID,GACT,KAAK,IAAIE;AAAA,EACX;AACA,MAAIC,IAASN,EAAM;AACZ,SAAAM,EAAA,QAAQ,WAAiB;AACvB,WAAA;AAAA,MACL,GAAG,KAAK;AAAA,MACR,GAAG,KAAK;AAAA,IAAA;AAAA,EACV,GAEKA,EAAA,UAAU,WAAmB;AAClC,WAAO,CAAC,KAAK,GAAG,KAAK,CAAC;AAAA,EAAA,GAEjBN;AACT,EAAE;","x_google_ignoreList":[0]}

package/dist/index.es19.js

@@ -1,5 +1,5 @@
 import m from "./index.es78.js";
-import p from "./index.es216.js";
+import p from "./index.es236.js";
 import s from "./index.es10.js";
 var l = m(function(u, e) {
   var h = l.placeholder, o = function() {

package/dist/index.es198.js

@@ -1,11 +1,16 @@
-import { toString as n } from "./index.es6.js";
-function a(t) {
-  var r = "[object " + t + "]";
-  return function(e) {
-    return n.call(e) === r;
-  };
+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);
 }
 export {
-  a as default
+  l as default
 };
 //# sourceMappingURL=index.es198.js.map

package/dist/index.es198.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es198.js","sources":["../../../node_modules/underscore/modules/_tagTester.js"],"sourcesContent":["import { toString } from './_setup.js';\n\n// Internal function for creating a `toString`-based type tester.\nexport default function tagTester(name) {\n  var tag = '[object ' + name + ']';\n  return function(obj) {\n    return toString.call(obj) === tag;\n  };\n}\n"],"names":["tagTester","name","tag","obj","toString"],"mappings":";AAGA,SAAwBA,EAAUC,GAAM;AAClC,MAAAC,IAAM,aAAaD,IAAO;AAC9B,SAAO,SAASE,GAAK;AACZ,WAAAC,EAAS,KAAKD,CAAG,MAAMD;AAAA,EAAA;AAElC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es198.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]}

package/dist/index.es199.js

@@ -1,8 +1,14 @@
-import { hasOwnProperty as a } from "./index.es6.js";
-function n(r, t) {
-  return r != null && a.call(r, t);
+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;
 }
 export {
-  n as default
+  o as default
 };
 //# sourceMappingURL=index.es199.js.map

package/dist/index.es199.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es199.js","sources":["../../../node_modules/underscore/modules/_has.js"],"sourcesContent":["import { hasOwnProperty } from './_setup.js';\n\n// Internal function to check whether `key` is an own property name of `obj`.\nexport default function has(obj, key) {\n  return obj != null && hasOwnProperty.call(obj, key);\n}\n"],"names":["has","obj","key","hasOwnProperty"],"mappings":";AAGwB,SAAAA,EAAIC,GAAKC,GAAK;AACpC,SAAOD,KAAO,QAAQE,EAAe,KAAKF,GAAKC,CAAG;AACpD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es199.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]}

package/dist/index.es20.js

@@ -1,6 +1,6 @@
 import o from "./index.es78.js";
 import u from "./index.es7.js";
-import c from "./index.es216.js";
+import c from "./index.es236.js";
 const a = o(function(t, r, e) {
   if (!u(t))
     throw new TypeError("Bind must be called on a function");

package/dist/index.es200.js

@@ -1,7 +1,11 @@
-import e from "./index.es254.js";
-import t from "./index.es202.js";
-const f = e(t);
+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;
+}
 export {
-  f as default
+  r as default
 };
 //# sourceMappingURL=index.es200.js.map

package/dist/index.es200.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es200.js","sources":["../../../node_modules/underscore/modules/_isBufferLike.js"],"sourcesContent":["import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getByteLength from './_getByteLength.js';\n\n// Internal helper to determine whether we should spend extensive checks against\n// `ArrayBuffer` et al.\nexport default createSizePropertyCheck(getByteLength);\n"],"names":["isBufferLike","createSizePropertyCheck","getByteLength"],"mappings":";;AAKA,MAAeA,IAAAC,EAAwBC,CAAa;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es200.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]}

package/dist/index.es201.js

@@ -1,6 +1,13 @@
-import t from "./index.es253.js";
-const o = t("length");
+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;
+}
 export {
-  o as default
+  p as default
 };
 //# sourceMappingURL=index.es201.js.map

package/dist/index.es201.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es201.js","sources":["../../../node_modules/underscore/modules/_getLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `length` property of an object.\nexport default shallowProperty('length');\n"],"names":["getLength","shallowProperty"],"mappings":";AAGA,MAAeA,IAAAC,EAAgB,QAAQ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es201.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]}

package/dist/index.es202.js

@@ -1,6 +1,11 @@
-import t from "./index.es253.js";
-const o = t("byteLength");
+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;
+  });
+}
 export {
-  o as default
+  l as default
 };
 //# sourceMappingURL=index.es202.js.map

package/dist/index.es202.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es202.js","sources":["../../../node_modules/underscore/modules/_getByteLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `byteLength` property of an object.\nexport default shallowProperty('byteLength');\n"],"names":["getByteLength","shallowProperty"],"mappings":";AAGA,MAAeA,IAAAC,EAAgB,YAAY;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es202.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]}

package/dist/index.es203.js

@@ -1,12 +1,9 @@
-import e from "./index.es202.js";
-function i(t) {
-  return new Uint8Array(
-    t.buffer || t,
-    t.byteOffset || 0,
-    e(t)
-  );
+function t(r) {
+  return this.eachBefore(function(e) {
+    e.children && e.children.sort(r);
+  });
 }
 export {
-  i as default
+  t as default
 };
 //# sourceMappingURL=index.es203.js.map

package/dist/index.es203.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es203.js","sources":["../../../node_modules/underscore/modules/_toBufferView.js"],"sourcesContent":["import getByteLength from './_getByteLength.js';\n\n// Internal function to wrap or shallow-copy an ArrayBuffer,\n// typed array or DataView to a new view, reusing the buffer.\nexport default function toBufferView(bufferSource) {\n  return new Uint8Array(\n    bufferSource.buffer || bufferSource,\n    bufferSource.byteOffset || 0,\n    getByteLength(bufferSource)\n  );\n}\n"],"names":["toBufferView","bufferSource","getByteLength"],"mappings":";AAIA,SAAwBA,EAAaC,GAAc;AACjD,SAAO,IAAI;AAAA,IACTA,EAAa,UAAUA;AAAA,IACvBA,EAAa,cAAc;AAAA,IAC3BC,EAAcD,CAAY;AAAA,EAAA;AAE9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es203.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/sort.js"],"sourcesContent":["export default function(compare) {\n  return this.eachBefore(function(node) {\n    if (node.children) {\n      node.children.sort(compare);\n    }\n  });\n}\n"],"names":["node_sort","compare","node"],"mappings":"AAAA,SAAAA,EAAwBC,GAAS;AACxB,SAAA,KAAK,WAAW,SAASC,GAAM;AACpC,IAAIA,EAAK,YACFA,EAAA,SAAS,KAAKD,CAAO;AAAA,EAC5B,CACD;AACH;","x_google_ignoreList":[0]}

package/dist/index.es204.js

@@ -1,25 +1,19 @@
-import o from "./index.es201.js";
-import f from "./index.es7.js";
-import m from "./index.es101.js";
-function v(e) {
-  var l = o(e);
-  return function(r) {
-    if (r == null)
-      return !1;
-    var s = m(r);
-    if (o(s))
-      return !1;
-    for (var a = 0; a < l; a++)
-      if (!f(r[e[a]]))
-        return !1;
-    return e !== u || !f(r[t]);
-  };
+function p(t) {
+  for (var e = this, r = n(e, t), o = [e]; e !== r; )
+    e = e.parent, o.push(e);
+  for (var s = o.length; t !== r; )
+    o.splice(s, 0, t), t = t.parent;
+  return o;
+}
+function n(t, e) {
+  if (t === e)
+    return t;
+  var r = t.ancestors(), o = e.ancestors(), s = null;
+  for (t = r.pop(), e = o.pop(); t === e; )
+    s = t, t = r.pop(), e = o.pop();
+  return s;
 }
-var t = "forEach", c = "has", n = ["clear", "delete"], i = ["get", c, "set"], d = n.concat(t, i), u = n.concat(i), M = ["add"].concat(n, t, c);
 export {
-  v as ie11fingerprint,
-  d as mapMethods,
-  M as setMethods,
-  u as weakMapMethods
+  p as default
 };
 //# sourceMappingURL=index.es204.js.map

package/dist/index.es204.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es204.js","sources":["../../../node_modules/underscore/modules/_methodFingerprint.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isFunction from './isFunction.js';\nimport allKeys from './allKeys.js';\n\n// Since the regular `Object.prototype.toString` type tests don't work for\n// some types in IE 11, we use a fingerprinting heuristic instead, based\n// on the methods. It's not great, but it's the best we got.\n// The fingerprint method lists are defined below.\nexport function ie11fingerprint(methods) {\n  var length = getLength(methods);\n  return function(obj) {\n    if (obj == null) return false;\n    // `Map`, `WeakMap` and `Set` have no enumerable keys.\n    var keys = allKeys(obj);\n    if (getLength(keys)) return false;\n    for (var i = 0; i < length; i++) {\n      if (!isFunction(obj[methods[i]])) return false;\n    }\n    // If we are testing against `WeakMap`, we need to ensure that\n    // `obj` doesn't have a `forEach` method in order to distinguish\n    // it from a regular `Map`.\n    return methods !== weakMapMethods || !isFunction(obj[forEachName]);\n  };\n}\n\n// In the interest of compact minification, we write\n// each string in the fingerprints only once.\nvar forEachName = 'forEach',\n    hasName = 'has',\n    commonInit = ['clear', 'delete'],\n    mapTail = ['get', hasName, 'set'];\n\n// `Map`, `WeakMap` and `Set` each have slightly different\n// combinations of the above sublists.\nexport var mapMethods = commonInit.concat(forEachName, mapTail),\n    weakMapMethods = commonInit.concat(mapTail),\n    setMethods = ['add'].concat(commonInit, forEachName, hasName);\n"],"names":["ie11fingerprint","methods","length","getLength","obj","keys","allKeys","i","isFunction","weakMapMethods","forEachName","hasName","commonInit","mapTail","mapMethods","setMethods"],"mappings":";;;AAQO,SAASA,EAAgBC,GAAS;AACnC,MAAAC,IAASC,EAAUF,CAAO;AAC9B,SAAO,SAASG,GAAK;AACnB,QAAIA,KAAO;AAAa,aAAA;AAEpB,QAAAC,IAAOC,EAAQF,CAAG;AACtB,QAAID,EAAUE,CAAI;AAAU,aAAA;AAC5B,aAASE,IAAI,GAAGA,IAAIL,GAAQK;AAC1B,UAAI,CAACC,EAAWJ,EAAIH,EAAQM,CAAC,CAAC,CAAC;AAAU,eAAA;AAK3C,WAAON,MAAYQ,KAAkB,CAACD,EAAWJ,EAAIM,CAAW,CAAC;AAAA,EAAA;AAErE;AAIA,IAAIA,IAAc,WACdC,IAAU,OACVC,IAAa,CAAC,SAAS,QAAQ,GAC/BC,IAAU,CAAC,OAAOF,GAAS,KAAK,GAIzBG,IAAaF,EAAW,OAAOF,GAAaG,CAAO,GAC1DJ,IAAiBG,EAAW,OAAOC,CAAO,GAC1CE,IAAa,CAAC,KAAK,EAAE,OAAOH,GAAYF,GAAaC,CAAO;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es204.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/path.js"],"sourcesContent":["export default function(end) {\n  var start = this,\n      ancestor = leastCommonAncestor(start, end),\n      nodes = [start];\n  while (start !== ancestor) {\n    start = start.parent;\n    nodes.push(start);\n  }\n  var k = nodes.length;\n  while (end !== ancestor) {\n    nodes.splice(k, 0, end);\n    end = end.parent;\n  }\n  return nodes;\n}\n\nfunction leastCommonAncestor(a, b) {\n  if (a === b) return a;\n  var aNodes = a.ancestors(),\n      bNodes = b.ancestors(),\n      c = null;\n  a = aNodes.pop();\n  b = bNodes.pop();\n  while (a === b) {\n    c = a;\n    a = aNodes.pop();\n    b = bNodes.pop();\n  }\n  return c;\n}\n"],"names":["node_path","end","start","ancestor","leastCommonAncestor","nodes","k","a","b","aNodes","bNodes","c"],"mappings":"AAAA,SAAAA,EAAwBC,GAAK;AAI3B,WAHIC,IAAQ,MACRC,IAAWC,EAAoBF,GAAOD,CAAG,GACzCI,IAAQ,CAACH,CAAK,GACXA,MAAUC;AACf,IAAAD,IAAQA,EAAM,QACdG,EAAM,KAAKH,CAAK;AAGlB,WADII,IAAID,EAAM,QACPJ,MAAQE;AACP,IAAAE,EAAA,OAAOC,GAAG,GAAGL,CAAG,GACtBA,IAAMA,EAAI;AAEL,SAAAI;AACT;AAEA,SAASD,EAAoBG,GAAGC,GAAG;AACjC,MAAID,MAAMC;AAAU,WAAAD;AAChB,MAAAE,IAASF,EAAE,aACXG,IAASF,EAAE,UAAA,GACXG,IAAI;AAGR,OAFAJ,IAAIE,EAAO,OACXD,IAAIE,EAAO,OACJH,MAAMC;AACP,IAAAG,IAAAJ,GACJA,IAAIE,EAAO,OACXD,IAAIE,EAAO;AAEN,SAAAC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es205.js

@@ -1,25 +1,9 @@
-import { ObjProto as p, nonEnumerableProps as a } from "./index.es6.js";
-import i from "./index.es7.js";
-import f from "./index.es199.js";
-function e(n) {
-  for (var r = {}, c = n.length, o = 0; o < c; ++o)
-    r[n[o]] = !0;
-  return {
-    contains: function(u) {
-      return r[u] === !0;
-    },
-    push: function(u) {
-      return r[u] = !0, n.push(u);
-    }
-  };
-}
-function l(n, r) {
-  r = e(r);
-  var c = a.length, o = n.constructor, u = i(o) && o.prototype || p, t = "constructor";
-  for (f(n, t) && !r.contains(t) && r.push(t); c--; )
-    t = a[c], t in n && n[t] !== u[t] && !r.contains(t) && r.push(t);
+function t() {
+  for (var e = this, n = [e]; e = e.parent; )
+    n.push(e);
+  return n;
 }
 export {
-  l as default
+  t as default
 };
 //# sourceMappingURL=index.es205.js.map

package/dist/index.es205.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es205.js","sources":["../../../node_modules/underscore/modules/_collectNonEnumProps.js"],"sourcesContent":["import { nonEnumerableProps, ObjProto } from './_setup.js';\nimport isFunction from './isFunction.js';\nimport has from './_has.js';\n\n// Internal helper to create a simple lookup structure.\n// `collectNonEnumProps` used to depend on `_.contains`, but this led to\n// circular imports. `emulatedSet` is a one-off solution that only works for\n// arrays of strings.\nfunction emulatedSet(keys) {\n  var hash = {};\n  for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;\n  return {\n    contains: function(key) { return hash[key] === true; },\n    push: function(key) {\n      hash[key] = true;\n      return keys.push(key);\n    }\n  };\n}\n\n// Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't\n// be iterated by `for key in ...` and thus missed. Extends `keys` in place if\n// needed.\nexport default function collectNonEnumProps(obj, keys) {\n  keys = emulatedSet(keys);\n  var nonEnumIdx = nonEnumerableProps.length;\n  var constructor = obj.constructor;\n  var proto = (isFunction(constructor) && constructor.prototype) || ObjProto;\n\n  // Constructor is a special case.\n  var prop = 'constructor';\n  if (has(obj, prop) && !keys.contains(prop)) keys.push(prop);\n\n  while (nonEnumIdx--) {\n    prop = nonEnumerableProps[nonEnumIdx];\n    if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {\n      keys.push(prop);\n    }\n  }\n}\n"],"names":["emulatedSet","keys","hash","l","i","key","collectNonEnumProps","obj","nonEnumIdx","nonEnumerableProps","constructor","proto","isFunction","ObjProto","prop","has"],"mappings":";;;AAQA,SAASA,EAAYC,GAAM;AAEzB,WADIC,IAAO,CAAA,GACFC,IAAIF,EAAK,QAAQG,IAAI,GAAGA,IAAID,GAAG,EAAEC;AAAQ,IAAAF,EAAAD,EAAKG,CAAC,CAAC,IAAI;AACtD,SAAA;AAAA,IACL,UAAU,SAASC,GAAK;AAAS,aAAAH,EAAKG,CAAG,MAAM;AAAA,IAAM;AAAA,IACrD,MAAM,SAASA,GAAK;AAClB,aAAAH,EAAKG,CAAG,IAAI,IACLJ,EAAK,KAAKI,CAAG;AAAA,IACtB;AAAA,EAAA;AAEJ;AAKwB,SAAAC,EAAoBC,GAAKN,GAAM;AACrD,EAAAA,IAAOD,EAAYC,CAAI;AACvB,MAAIO,IAAaC,EAAmB,QAChCC,IAAcH,EAAI,aAClBI,IAASC,EAAWF,CAAW,KAAKA,EAAY,aAAcG,GAG9DC,IAAO;AAGX,OAFIC,EAAIR,GAAKO,CAAI,KAAK,CAACb,EAAK,SAASa,CAAI,KAAGb,EAAK,KAAKa,CAAI,GAEnDN;AACL,IAAAM,IAAOL,EAAmBD,CAAU,GAChCM,KAAQP,KAAOA,EAAIO,CAAI,MAAMH,EAAMG,CAAI,KAAK,CAACb,EAAK,SAASa,CAAI,KACjEb,EAAK,KAAKa,CAAI;AAGpB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es205.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/ancestors.js"],"sourcesContent":["export default function() {\n  var node = this, nodes = [node];\n  while (node = node.parent) {\n    nodes.push(node);\n  }\n  return nodes;\n}\n"],"names":["node_ancestors","node","nodes"],"mappings":"AAA0B,SAAAA,IAAA;AAEjB,WADHC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GACvBA,IAAOA,EAAK;AACjB,IAAAC,EAAM,KAAKD,CAAI;AAEV,SAAAC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es206.js

@@ -1,17 +1,10 @@
-function c(v, e) {
-  return function(r) {
-    var f = arguments.length;
-    if (e && (r = Object(r)), f < 2 || r == null)
-      return r;
-    for (var t = 1; t < f; t++)
-      for (var u = arguments[t], g = v(u), l = g.length, n = 0; n < l; n++) {
-        var a = g[n];
-        (!e || r[a] === void 0) && (r[a] = u[a]);
-      }
-    return r;
-  };
+function t() {
+  var n = [];
+  return this.each(function(e) {
+    n.push(e);
+  }), n;
 }
 export {
-  c as default
+  t as default
 };
 //# sourceMappingURL=index.es206.js.map

package/dist/index.es206.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es206.js","sources":["../../../node_modules/underscore/modules/_createAssigner.js"],"sourcesContent":["// An internal function for creating assigner functions.\nexport default function createAssigner(keysFunc, defaults) {\n  return function(obj) {\n    var length = arguments.length;\n    if (defaults) obj = Object(obj);\n    if (length < 2 || obj == null) return obj;\n    for (var index = 1; index < length; index++) {\n      var source = arguments[index],\n          keys = keysFunc(source),\n          l = keys.length;\n      for (var i = 0; i < l; i++) {\n        var key = keys[i];\n        if (!defaults || obj[key] === void 0) obj[key] = source[key];\n      }\n    }\n    return obj;\n  };\n}\n"],"names":["createAssigner","keysFunc","defaults","obj","length","index","source","keys","i","key"],"mappings":"AACwB,SAAAA,EAAeC,GAAUC,GAAU;AACzD,SAAO,SAASC,GAAK;AACnB,QAAIC,IAAS,UAAU;AAEnB,QADAF,MAAUC,IAAM,OAAOA,CAAG,IAC1BC,IAAS,KAAKD,KAAO;AAAa,aAAAA;AACtC,aAASE,IAAQ,GAAGA,IAAQD,GAAQC;AAIlC,eAHIC,IAAS,UAAUD,CAAK,GACxBE,IAAON,EAASK,CAAM,GACtB,IAAIC,EAAK,QACJC,IAAI,GAAGA,IAAI,GAAGA,KAAK;AACtB,YAAAC,IAAMF,EAAKC,CAAC;AAChB,SAAI,CAACN,KAAYC,EAAIM,CAAG,MAAM,YAAYN,EAAAM,CAAG,IAAIH,EAAOG,CAAG;AAAA,MAC7D;AAEK,WAAAN;AAAA,EAAA;AAEX;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es206.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/descendants.js"],"sourcesContent":["export default function() {\n  var nodes = [];\n  this.each(function(node) {\n    nodes.push(node);\n  });\n  return nodes;\n}\n"],"names":["node_descendants","nodes","node"],"mappings":"AAA0B,SAAAA,IAAA;AACxB,MAAIC,IAAQ,CAAA;AACP,cAAA,KAAK,SAASC,GAAM;AACvB,IAAAD,EAAM,KAAKC,CAAI;AAAA,EAAA,CAChB,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es207.js

@@ -1,20 +1,10 @@
-import o from "./index.es79.js";
-import { nativeCreate as e } from "./index.es6.js";
-function u() {
-  return function() {
-  };
-}
-function f(r) {
-  if (!o(r))
-    return {};
-  if (e)
-    return e(r);
-  var t = u();
-  t.prototype = r;
-  var n = new t();
-  return t.prototype = null, n;
+function n() {
+  var e = [];
+  return this.eachBefore(function(a) {
+    a.children || e.push(a);
+  }), e;
 }
 export {
-  f as default
+  n as default
 };
 //# sourceMappingURL=index.es207.js.map

package/dist/index.es207.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es207.js","sources":["../../../node_modules/underscore/modules/_baseCreate.js"],"sourcesContent":["import isObject from './isObject.js';\nimport { nativeCreate } from './_setup.js';\n\n// Create a naked function reference for surrogate-prototype-swapping.\nfunction ctor() {\n  return function(){};\n}\n\n// An internal function for creating a new object that inherits from another.\nexport default function baseCreate(prototype) {\n  if (!isObject(prototype)) return {};\n  if (nativeCreate) return nativeCreate(prototype);\n  var Ctor = ctor();\n  Ctor.prototype = prototype;\n  var result = new Ctor;\n  Ctor.prototype = null;\n  return result;\n}\n"],"names":["ctor","baseCreate","prototype","isObject","nativeCreate","Ctor","result"],"mappings":";;AAIA,SAASA,IAAO;AACd,SAAO,WAAU;AAAA,EAAA;AACnB;AAGA,SAAwBC,EAAWC,GAAW;AACxC,MAAA,CAACC,EAASD,CAAS;AAAG,WAAO;AAC7B,MAAAE;AAAc,WAAOA,EAAaF,CAAS;AAC/C,MAAIG,IAAOL;AACX,EAAAK,EAAK,YAAYH;AACjB,MAAII,IAAS,IAAID;AACjB,SAAAA,EAAK,YAAY,MACVC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es207.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/leaves.js"],"sourcesContent":["export default function() {\n  var leaves = [];\n  this.eachBefore(function(node) {\n    if (!node.children) {\n      leaves.push(node);\n    }\n  });\n  return leaves;\n}\n"],"names":["node_leaves","leaves","node"],"mappings":"AAA0B,SAAAA,IAAA;AACxB,MAAIC,IAAS,CAAA;AACR,cAAA,WAAW,SAASC,GAAM;AACzB,IAACA,EAAK,YACRD,EAAO,KAAKC,CAAI;AAAA,EAClB,CACD,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es208.js

@@ -1,9 +1,10 @@
-import o from "./index.es10.js";
-import "./index.es14.js";
-function e(t) {
-  return o.toPath(t);
+function a() {
+  var r = this, n = [];
+  return r.each(function(t) {
+    t !== r && n.push({ source: t.parent, target: t });
+  }), n;
 }
 export {
-  e as default
+  a as default
 };
 //# sourceMappingURL=index.es208.js.map

package/dist/index.es208.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es208.js","sources":["../../../node_modules/underscore/modules/_toPath.js"],"sourcesContent":["import _ from './underscore.js';\nimport './toPath.js';\n\n// Internal wrapper for `_.toPath` to enable minification.\n// Similar to `cb` for `_.iteratee`.\nexport default function toPath(path) {\n  return _.toPath(path);\n}\n"],"names":["toPath","path","_"],"mappings":";;AAKA,SAAwBA,EAAOC,GAAM;AAC5B,SAAAC,EAAE,OAAOD,CAAI;AACtB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es208.js","sources":["../../../node_modules/d3-hierarchy/src/hierarchy/links.js"],"sourcesContent":["export default function() {\n  var root = this, links = [];\n  root.each(function(node) {\n    if (node !== root) { // Don’t include the root’s parent, if any.\n      links.push({source: node.parent, target: node});\n    }\n  });\n  return links;\n}\n"],"names":["node_links","root","links","node"],"mappings":"AAA0B,SAAAA,IAAA;AACpB,MAAAC,IAAO,MAAMC,IAAQ;AACpB,SAAAD,EAAA,KAAK,SAASE,GAAM;AACvB,IAAIA,MAASF,KACXC,EAAM,KAAK,EAAC,QAAQC,EAAK,QAAQ,QAAQA,GAAK;AAAA,EAChD,CACD,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es209.js

@@ -1,12 +1,9 @@
-function l(e, n) {
-  for (var t = n.length, r = 0; r < t; r++) {
-    if (e == null)
-      return;
-    e = e[n[r]];
-  }
-  return t ? e : void 0;
+function n(t) {
+  var e = typeof t;
+  return t != null && (e == "object" || e == "function");
 }
+var c = n;
 export {
-  l as default
+  c as i
 };
 //# sourceMappingURL=index.es209.js.map

package/dist/index.es209.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es209.js","sources":["../../../node_modules/underscore/modules/_deepGet.js"],"sourcesContent":["// Internal function to obtain a nested property in `obj` along `path`.\nexport default function deepGet(obj, path) {\n  var length = path.length;\n  for (var i = 0; i < length; i++) {\n    if (obj == null) return void 0;\n    obj = obj[path[i]];\n  }\n  return length ? obj : void 0;\n}\n"],"names":["deepGet","obj","path","length","i"],"mappings":"AACwB,SAAAA,EAAQC,GAAKC,GAAM;AAEzC,WADIC,IAASD,EAAK,QACTE,IAAI,GAAGA,IAAID,GAAQC,KAAK;AAC/B,QAAIH,KAAO;AAAa;AAClB,IAAAA,IAAAA,EAAIC,EAAKE,CAAC,CAAC;AAAA,EACnB;AACA,SAAOD,IAASF,IAAM;AACxB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es209.js","sources":["../../../node_modules/lodash/isObject.js"],"sourcesContent":["/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n"],"names":["isObject","value","type","isObject_1"],"mappings":"AAyBA,SAASA,EAASC,GAAO;AACvB,MAAIC,IAAO,OAAOD;AAClB,SAAOA,KAAS,SAASC,KAAQ,YAAYA,KAAQ;AACvD;AAEA,IAAAC,IAAiBH;","x_google_ignoreList":[0]}

package/dist/index.es21.js

@@ -1,5 +1,5 @@
 import i from "./index.es78.js";
-import f from "./index.es217.js";
+import f from "./index.es237.js";
 import l from "./index.es20.js";
 const s = i(function(r, t) {
   t = f(t, !1, !1);

package/dist/index.es210.js

@@ -1,10 +1,8 @@
-import t from "./index.es10.js";
-import o from "./index.es215.js";
-import a from "./index.es15.js";
-function n(e, r, i) {
-  return t.iteratee !== a ? t.iteratee(e, r) : o(e, r, i);
-}
+import { _ as o } from "./index.es252.js";
+var r = o, n = function() {
+  return r.Date.now();
+}, a = n;
 export {
-  n as default
+  a as n
 };
 //# sourceMappingURL=index.es210.js.map

package/dist/index.es210.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es210.js","sources":["../../../node_modules/underscore/modules/_cb.js"],"sourcesContent":["import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\nimport iteratee from './iteratee.js';\n\n// The function we call internally to generate a callback. It invokes\n// `_.iteratee` if overridden, otherwise `baseIteratee`.\nexport default function cb(value, context, argCount) {\n  if (_.iteratee !== iteratee) return _.iteratee(value, context);\n  return baseIteratee(value, context, argCount);\n}\n"],"names":["cb","value","context","argCount","_","iteratee","baseIteratee"],"mappings":";;;AAMwB,SAAAA,EAAGC,GAAOC,GAASC,GAAU;AACnD,SAAIC,EAAE,aAAaC,IAAiBD,EAAE,SAASH,GAAOC,CAAO,IACtDI,EAAaL,GAAOC,GAASC,CAAQ;AAC9C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es210.js","sources":["../../../node_modules/lodash/now.js"],"sourcesContent":["var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n"],"names":["root","require$$0","now","now_1"],"mappings":";AAAA,IAAIA,IAAOC,GAkBPC,IAAM,WAAW;AACZ,SAAAF,EAAK,KAAK;AACnB,GAEAG,IAAiBD;","x_google_ignoreList":[0]}