@performant-software/visualize 3.1.13-beta.1 → 3.1.13-beta.3

package/dist/index.es188.js

@@ -1,86 +1,55 @@
-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);
+var v = Math.PI, p = 2 * v, M = 1e-6, q = p - M;
+function y() {
+  this._x0 = this._y0 = // start of current subpath
+  this._x1 = this._y1 = null, this._ = "";
+}
+function C() {
+  return new y();
+}
+y.prototype = C.prototype = {
+  constructor: y,
+  moveTo: function(i, s) {
+    this._ += "M" + (this._x0 = this._x1 = +i) + "," + (this._y0 = this._y1 = +s);
+  },
+  closePath: function() {
+    this._x1 !== null && (this._x1 = this._x0, this._y1 = this._y0, this._ += "Z");
+  },
+  lineTo: function(i, s) {
+    this._ += "L" + (this._x1 = +i) + "," + (this._y1 = +s);
+  },
+  quadraticCurveTo: function(i, s, t, h) {
+    this._ += "Q" + +i + "," + +s + "," + (this._x1 = +t) + "," + (this._y1 = +h);
+  },
+  bezierCurveTo: function(i, s, t, h, _, e) {
+    this._ += "C" + +i + "," + +s + "," + +t + "," + +h + "," + (this._x1 = +_) + "," + (this._y1 = +e);
+  },
+  arcTo: function(i, s, t, h, _) {
+    i = +i, s = +s, t = +t, h = +h, _ = +_;
+    var e = this._x1, c = this._y1, f = t - i, a = h - s, n = e - i, u = c - s, o = n * n + u * u;
+    if (_ < 0) throw new Error("negative radius: " + _);
+    if (this._x1 === null)
+      this._ += "M" + (this._x1 = i) + "," + (this._y1 = s);
+    else if (o > M) if (!(Math.abs(u * f - a * n) > M) || !_)
+      this._ += "L" + (this._x1 = i) + "," + (this._y1 = s);
     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 * _;
-      });
+      var l = t - e, r = h - c, d = f * f + a * a, g = l * l + r * r, b = Math.sqrt(d), T = Math.sqrt(o), A = _ * Math.tan((v - Math.acos((d + o - g) / (2 * b * T))) / 2), x = A / T, L = A / b;
+      Math.abs(x - 1) > M && (this._ += "L" + (i + x * n) + "," + (s + x * u)), this._ += "A" + _ + "," + _ + ",0,0," + +(u * l > n * r) + "," + (this._x1 = i + L * f) + "," + (this._y1 = s + L * a);
     }
-    return e;
+  },
+  arc: function(i, s, t, h, _, e) {
+    i = +i, s = +s, t = +t, e = !!e;
+    var c = t * Math.cos(h), f = t * Math.sin(h), a = i + c, n = s + f, u = 1 ^ e, o = e ? h - _ : _ - h;
+    if (t < 0) throw new Error("negative radius: " + t);
+    this._x1 === null ? this._ += "M" + a + "," + n : (Math.abs(this._x1 - a) > M || Math.abs(this._y1 - n) > M) && (this._ += "L" + a + "," + n), t && (o < 0 && (o = o % p + p), o > q ? this._ += "A" + t + "," + t + ",0,1," + u + "," + (i - c) + "," + (s - f) + "A" + t + "," + t + ",0,1," + u + "," + (this._x1 = a) + "," + (this._y1 = n) : o > M && (this._ += "A" + t + "," + t + ",0," + +(o >= v) + "," + u + "," + (this._x1 = i + t * Math.cos(_)) + "," + (this._y1 = s + t * Math.sin(_))));
+  },
+  rect: function(i, s, t, h) {
+    this._ += "M" + (this._x0 = this._x1 = +i) + "," + (this._y0 = this._y1 = +s) + "h" + +t + "v" + +h + "h" + -t + "Z";
+  },
+  toString: function() {
+    return this._;
   }
-  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 {
-  L as default
+  C as default
 };
 //# sourceMappingURL=index.es188.js.map

package/dist/index.es188.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es188.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;AAMxB,WALIM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACPA,KAASI,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;AAStB,WARIC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AAClB,QAAInB,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;AAKrB,UAACI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAGA,SAAAI,IAA0B;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AAClB,QAAIU,IAAIX,EAASC,CAAI;AAOrB,QAJAU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH,EAAU,CAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACb,MAAAA,EAAK,WAAW,SAASH,GAAM;AAC7B,QAAIA,EAAK,IAAIiB,EAAK,MAAGA,IAAOjB,IACxBA,EAAK,IAAIkB,EAAM,MAAGA,IAAQlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAOA,IAASnB;AAAA,MAC1C,CAAC;AACD,UAAIoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC/B,MAAAhB,EAAK,WAAW,SAASH,GAAM;AAC7B,QAAAA,EAAK,KAAKA,EAAK,IAAIqB,KAAMC,GACzBtB,EAAK,IAAIA,EAAK,QAAQuB;AAAA,MACxB,CAAC;AAAA,IACH;AAEA,WAAOpB;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;AACf,UAAIwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC/BV,EAAE,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA,IAEV,OAAW9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAEjC,IAAAV,EAAE,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,GACvBA,EAAE,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaA,WAASyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUL,eATIgC,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,GACRM,IAAQM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GACpDuC,KAAOvC,GACPwC,KAAOxC,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,GACfnC,IAAWb;AAAA,IAEf;AACA,WAAOa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACVV,EAAK,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEA,SAAAP,EAAK,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EACrD,GAEAL,EAAK,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,EACzG,GAEAP,EAAK,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,EACrG,GAEOP;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es188.js","sources":["../../../node_modules/d3-path/src/path.js"],"sourcesContent":["var pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction Path() {\n  this._x0 = this._y0 = // start of current subpath\n  this._x1 = this._y1 = null; // end of current subpath\n  this._ = \"\";\n}\n\nfunction path() {\n  return new Path;\n}\n\nPath.prototype = path.prototype = {\n  constructor: Path,\n  moveTo: function(x, y) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y);\n  },\n  closePath: function() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._ += \"Z\";\n    }\n  },\n  lineTo: function(x, y) {\n    this._ += \"L\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  quadraticCurveTo: function(x1, y1, x, y) {\n    this._ += \"Q\" + (+x1) + \",\" + (+y1) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  bezierCurveTo: function(x1, y1, x2, y2, x, y) {\n    this._ += \"C\" + (+x1) + \",\" + (+y1) + \",\" + (+x2) + \",\" + (+y2) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  arcTo: function(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n    var x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._ += \"M\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._ += \"L\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      var x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._ += \"L\" + (x1 + t01 * x01) + \",\" + (y1 + t01 * y01);\n      }\n\n      this._ += \"A\" + r + \",\" + r + \",0,0,\" + (+(y01 * x20 > x01 * y20)) + \",\" + (this._x1 = x1 + t21 * x21) + \",\" + (this._y1 = y1 + t21 * y21);\n    }\n  },\n  arc: function(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n    var dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._ += \"M\" + x0 + \",\" + y0;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._ += \"L\" + x0 + \",\" + y0;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (x - dx) + \",\" + (y - dy) + \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (this._x1 = x0) + \",\" + (this._y1 = y0);\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,\" + (+(da >= pi)) + \",\" + cw + \",\" + (this._x1 = x + r * Math.cos(a1)) + \",\" + (this._y1 = y + r * Math.sin(a1));\n    }\n  },\n  rect: function(x, y, w, h) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y) + \"h\" + (+w) + \"v\" + (+h) + \"h\" + (-w) + \"Z\";\n  },\n  toString: function() {\n    return this._;\n  }\n};\n\nexport default path;\n"],"names":["pi","tau","epsilon","tauEpsilon","Path","path","x","y","x1","y1","x2","y2","r","x0","y0","x21","y21","x01","y01","l01_2","x20","y20","l21_2","l20_2","l21","l01","l","t01","t21","a0","a1","ccw","dx","dy","cw","da","w"],"mappings":"AAAA,IAAIA,IAAK,KAAK,IACVC,IAAM,IAAID,GACVE,IAAU,MACVC,IAAaF,IAAMC;AAEvB,SAASE,IAAO;AACd,OAAK,MAAM,KAAK;AAAA,EAChB,KAAK,MAAM,KAAK,MAAM,MACtB,KAAK,IAAI;AACX;AAEA,SAASC,IAAO;AACd,SAAO,IAAID,EAAA;AACb;AAEAA,EAAK,YAAYC,EAAK,YAAY;AAAA,EAChC,aAAaD;AAAA,EACb,QAAQ,SAASE,GAAGC,GAAG;AACrB,SAAK,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAACD,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAACC;AAAA,EAC7E;AAAA,EACA,WAAW,WAAW;AACpB,IAAI,KAAK,QAAQ,SACf,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KACrC,KAAK,KAAK;AAAA,EAEd;AAAA,EACA,QAAQ,SAASD,GAAGC,GAAG;AACrB,SAAK,KAAK,OAAO,KAAK,MAAM,CAACD,KAAK,OAAO,KAAK,MAAM,CAACC;AAAA,EACvD;AAAA,EACA,kBAAkB,SAASC,GAAIC,GAAIH,GAAGC,GAAG;AACvC,SAAK,KAAK,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,OAAO,KAAK,MAAM,CAACH,KAAK,OAAO,KAAK,MAAM,CAACC;AAAA,EACnF;AAAA,EACA,eAAe,SAASC,GAAIC,GAAIC,GAAIC,GAAIL,GAAGC,GAAG;AAC5C,SAAK,KAAK,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,OAAO,KAAK,MAAM,CAACL,KAAK,OAAO,KAAK,MAAM,CAACC;AAAA,EAC/G;AAAA,EACA,OAAO,SAASC,GAAIC,GAAIC,GAAIC,GAAIC,GAAG;AACjC,IAAAJ,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAI,CAACA;AAC7C,QAAIC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAML,IAAKF,GACXQ,IAAML,IAAKF,GACXQ,IAAMJ,IAAKL,GACXU,IAAMJ,IAAKL,GACXU,IAAQF,IAAMA,IAAMC,IAAMA;AAG9B,QAAIN,IAAI,EAAG,OAAM,IAAI,MAAM,sBAAsBA,CAAC;AAGlD,QAAI,KAAK,QAAQ;AACf,WAAK,KAAK,OAAO,KAAK,MAAMJ,KAAM,OAAO,KAAK,MAAMC;AAAA,aAI3CU,IAAQjB,EAAS,KAKnB,EAAE,KAAK,IAAIgB,IAAMH,IAAMC,IAAMC,CAAG,IAAIf,MAAY,CAACU;AACxD,WAAK,KAAK,OAAO,KAAK,MAAMJ,KAAM,OAAO,KAAK,MAAMC;AAAA,SAIjD;AACH,UAAIW,IAAMV,IAAKG,GACXQ,IAAMV,IAAKG,GACXQ,IAAQP,IAAMA,IAAMC,IAAMA,GAC1BO,IAAQH,IAAMA,IAAMC,IAAMA,GAC1BG,IAAM,KAAK,KAAKF,CAAK,GACrBG,IAAM,KAAK,KAAKN,CAAK,GACrBO,IAAId,IAAI,KAAK,KAAKZ,IAAK,KAAK,MAAMsB,IAAQH,IAAQI,MAAU,IAAIC,IAAMC,EAAI,KAAK,CAAC,GAChFE,IAAMD,IAAID,GACVG,IAAMF,IAAIF;AAGd,MAAI,KAAK,IAAIG,IAAM,CAAC,IAAIzB,MACtB,KAAK,KAAK,OAAOM,IAAKmB,IAAMV,KAAO,OAAOR,IAAKkB,IAAMT,KAGvD,KAAK,KAAK,MAAMN,IAAI,MAAMA,IAAI,UAAW,EAAEM,IAAME,IAAMH,IAAMI,KAAQ,OAAO,KAAK,MAAMb,IAAKoB,IAAMb,KAAO,OAAO,KAAK,MAAMN,IAAKmB,IAAMZ;AAAA,IACxI;AAAA,EACF;AAAA,EACA,KAAK,SAASV,GAAGC,GAAGK,GAAGiB,GAAIC,GAAIC,GAAK;AAClC,IAAAzB,IAAI,CAACA,GAAGC,IAAI,CAACA,GAAGK,IAAI,CAACA,GAAGmB,IAAM,CAAC,CAACA;AAChC,QAAIC,IAAKpB,IAAI,KAAK,IAAIiB,CAAE,GACpBI,IAAKrB,IAAI,KAAK,IAAIiB,CAAE,GACpBhB,IAAKP,IAAI0B,GACTlB,IAAKP,IAAI0B,GACTC,IAAK,IAAIH,GACTI,IAAKJ,IAAMF,IAAKC,IAAKA,IAAKD;AAG9B,QAAIjB,IAAI,EAAG,OAAM,IAAI,MAAM,sBAAsBA,CAAC;AAalD,IAVI,KAAK,QAAQ,OACf,KAAK,KAAK,MAAMC,IAAK,MAAMC,KAIpB,KAAK,IAAI,KAAK,MAAMD,CAAE,IAAIX,KAAW,KAAK,IAAI,KAAK,MAAMY,CAAE,IAAIZ,OACtE,KAAK,KAAK,MAAMW,IAAK,MAAMC,IAIxBF,MAGDuB,IAAK,MAAGA,IAAKA,IAAKlC,IAAMA,IAGxBkC,IAAKhC,IACP,KAAK,KAAK,MAAMS,IAAI,MAAMA,IAAI,UAAUsB,IAAK,OAAO5B,IAAI0B,KAAM,OAAOzB,IAAI0B,KAAM,MAAMrB,IAAI,MAAMA,IAAI,UAAUsB,IAAK,OAAO,KAAK,MAAMrB,KAAM,OAAO,KAAK,MAAMC,KAIrJqB,IAAKjC,MACZ,KAAK,KAAK,MAAMU,IAAI,MAAMA,IAAI,QAAS,EAAEuB,KAAMnC,KAAO,MAAMkC,IAAK,OAAO,KAAK,MAAM5B,IAAIM,IAAI,KAAK,IAAIkB,CAAE,KAAK,OAAO,KAAK,MAAMvB,IAAIK,IAAI,KAAK,IAAIkB,CAAE;AAAA,EAEpJ;AAAA,EACA,MAAM,SAASxB,GAAGC,GAAG6B,GAAG,GAAG;AACzB,SAAK,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC9B,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAACC,KAAK,MAAO,CAAC6B,IAAK,MAAO,CAAC,IAAK,MAAO,CAACA,IAAK;AAAA,EACzH;AAAA,EACA,UAAU,WAAW;AACnB,WAAO,KAAK;AAAA,EACd;AACF;","x_google_ignoreList":[0]}

package/dist/index.es189.js

@@ -1,4 +1,4 @@
-import { isTouchEvent as a, isMouseEvent as c } from "./index.es64.js";
+import { isTouchEvent as a, isMouseEvent as c } from "./index.es67.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,5 +1,5 @@
 import m from "./index.es86.js";
-import p from "./index.es252.js";
+import p from "./index.es240.js";
 import s from "./index.es10.js";
 var l = m(function(u, e) {
   var h = l.placeholder, o = function() {

package/dist/index.es193.js

@@ -1,6 +1,6 @@
-import { __module as e } from "./index.es209.js";
-import { __require as o } from "./index.es210.js";
-import { __require as t } from "./index.es211.js";
+import { __module as e } from "./index.es249.js";
+import { __require as o } from "./index.es250.js";
+import { __require as t } from "./index.es251.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.es194.js

@@ -1,8 +1,8 @@
 import { __require as F } from "./index.es193.js";
-import { __require as N } from "./index.es212.js";
-import { __require as ee } from "./index.es213.js";
-import { __require as re } from "./index.es214.js";
-import { __require as ne } from "./index.es215.js";
+import { __require as N } from "./index.es252.js";
+import { __require as ee } from "./index.es253.js";
+import { __require as re } from "./index.es254.js";
+import { __require as ne } from "./index.es255.js";
 var A, C;
 function oe() {
   if (C) return A;

package/dist/index.es195.js

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

package/dist/index.es197.js

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

package/dist/index.es198.js

@@ -1,10 +1,9 @@
-import o from "./index.es68.js";
-import i from "./index.es218.js";
-function f(t) {
-  var r = i(t, "string");
-  return o(r) == "symbol" ? r : String(r);
+var o = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function l(e) {
+  return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
 export {
-  f as default
+  o as commonjsGlobal,
+  l as getDefaultExportFromCjs
 };
 //# sourceMappingURL=index.es198.js.map

package/dist/index.es198.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es198.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;AACvC,MAAIC,IAAIC,EAAY,GAAG,QAAQ;AAC/B,SAAmBC,EAAQF,CAAC,KAArB,WAAyBA,IAAI,OAAOA,CAAC;AAC9C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es198.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/index.es199.js

@@ -1,9 +1,10 @@
-function e(o, r) {
-  return e = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(t, f) {
-    return t.__proto__ = f, t;
-  }, e(o, r);
+import o from "./index.es68.js";
+import i from "./index.es256.js";
+function f(t) {
+  var r = i(t, "string");
+  return o(r) == "symbol" ? r : String(r);
 }
 export {
-  e as default
+  f as default
 };
 //# sourceMappingURL=index.es199.js.map

package/dist/index.es199.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es199.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":"AAAA,SAAwBA,EAAgB,GAAGC,GAAG;AAC5C,SAAAD,IAAkB,OAAO,iBAAiB,OAAO,eAAe,SAAS,SAAyBE,GAAGD,GAAG;AACtGC,WAAAA,EAAE,YAAYD,GACPC;AAAAA,EACT,GACOF,EAAgB,GAAGC,CAAC;AAC7B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es199.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;AACvC,MAAIC,IAAIC,EAAY,GAAG,QAAQ;AAC/B,SAAmBC,EAAQF,CAAC,KAArB,WAAyBA,IAAI,OAAOA,CAAC;AAC9C;","x_google_ignoreList":[0]}

package/dist/index.es20.js

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

package/dist/index.es200.js

@@ -1,7 +1,9 @@
-function a(r) {
-  if (Array.isArray(r)) return r;
+function e(o, r) {
+  return e = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function(t, f) {
+    return t.__proto__ = f, t;
+  }, e(o, r);
 }
 export {
-  a as default
+  e as default
 };
 //# sourceMappingURL=index.es200.js.map

package/dist/index.es200.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es200.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;AAC3C,MAAI,MAAM,QAAQA,CAAG,EAAG,QAAOA;AACjC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es200.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":"AAAA,SAAwBA,EAAgB,GAAGC,GAAG;AAC5C,SAAAD,IAAkB,OAAO,iBAAiB,OAAO,eAAe,SAAS,SAAyBE,GAAGD,GAAG;AACtGC,WAAAA,EAAE,YAAYD,GACPC;AAAAA,EACT,GACOF,EAAgB,GAAGC,CAAC;AAC7B;","x_google_ignoreList":[0]}

package/dist/index.es201.js

@@ -1,7 +1,7 @@
-function o(r) {
-  if (typeof Symbol < "u" && r[Symbol.iterator] != null || r["@@iterator"] != null) return Array.from(r);
+function a(r) {
+  if (Array.isArray(r)) return r;
 }
 export {
-  o as default
+  a as default
 };
 //# sourceMappingURL=index.es201.js.map

package/dist/index.es201.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es201.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;AAC7C,MAAI,OAAO,SAAW,OAAeA,EAAK,OAAO,QAAQ,KAAK,QAAQA,EAAK,YAAY,KAAK,KAAM,QAAO,MAAM,KAAKA,CAAI;AAC1H;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es201.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;AAC3C,MAAI,MAAM,QAAQA,CAAG,EAAG,QAAOA;AACjC;","x_google_ignoreList":[0]}

package/dist/index.es202.js

@@ -1,13 +1,7 @@
-import a from "./index.es230.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);
-  }
+function o(r) {
+  if (typeof Symbol < "u" && r[Symbol.iterator] != null || r["@@iterator"] != null) return Array.from(r);
 }
 export {
-  i as default
+  o as default
 };
 //# sourceMappingURL=index.es202.js.map

package/dist/index.es202.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es202.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":";AACA,SAAwBA,EAA4BC,GAAGC,GAAQ;AAC7D,MAAKD,GACL;AAAA,QAAI,OAAOA,KAAM,SAAU,QAAOE,EAAiBF,GAAGC,CAAM;AAC5D,QAAIE,IAAI,OAAO,UAAU,SAAS,KAAKH,CAAC,EAAE,MAAM,GAAG,EAAE;AAErD,QADIG,MAAM,YAAYH,EAAE,gBAAaG,IAAIH,EAAE,YAAY,OACnDG,MAAM,SAASA,MAAM,MAAO,QAAO,MAAM,KAAKH,CAAC;AACnD,QAAIG,MAAM,eAAe,2CAA2C,KAAKA,CAAC,EAAG,QAAOD,EAAiBF,GAAGC,CAAM;AAAA;AAChH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es202.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;AAC7C,MAAI,OAAO,SAAW,OAAeA,EAAK,OAAO,QAAQ,KAAK,QAAQA,EAAK,YAAY,KAAK,KAAM,QAAO,MAAM,KAAKA,CAAI;AAC1H;","x_google_ignoreList":[0]}

package/dist/index.es203.js

@@ -1,8 +1,13 @@
-function e() {
-  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
-In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+import a from "./index.es257.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 {
-  e as default
+  i as default
 };
 //# sourceMappingURL=index.es203.js.map

package/dist/index.es203.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es203.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/nonIterableRest.js"],"sourcesContent":["export default function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}"],"names":["_nonIterableRest"],"mappings":"AAAA,SAAwBA,IAAmB;AACzC,QAAM,IAAI,UAAU;AAAA,mFAA2I;AACjK;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es203.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":";AACA,SAAwBA,EAA4BC,GAAGC,GAAQ;AAC7D,MAAKD,GACL;AAAA,QAAI,OAAOA,KAAM,SAAU,QAAOE,EAAiBF,GAAGC,CAAM;AAC5D,QAAIE,IAAI,OAAO,UAAU,SAAS,KAAKH,CAAC,EAAE,MAAM,GAAG,EAAE;AAErD,QADIG,MAAM,YAAYH,EAAE,gBAAaG,IAAIH,EAAE,YAAY,OACnDG,MAAM,SAASA,MAAM,MAAO,QAAO,MAAM,KAAKH,CAAC;AACnD,QAAIG,MAAM,eAAe,2CAA2C,KAAKA,CAAC,EAAG,QAAOD,EAAiBF,GAAGC,CAAM;AAAA;AAChH;","x_google_ignoreList":[0]}

package/dist/index.es204.js

@@ -1,9 +1,8 @@
-var o = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function l(e) {
-  return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
+function e() {
+  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
 }
 export {
-  o as commonjsGlobal,
-  l as getDefaultExportFromCjs
+  e as default
 };
 //# sourceMappingURL=index.es204.js.map

package/dist/index.es204.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es204.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}
+{"version":3,"file":"index.es204.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/nonIterableRest.js"],"sourcesContent":["export default function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}"],"names":["_nonIterableRest"],"mappings":"AAAA,SAAwBA,IAAmB;AACzC,QAAM,IAAI,UAAU;AAAA,mFAA2I;AACjK;","x_google_ignoreList":[0]}

package/dist/index.es205.js

@@ -1,61 +1,13 @@
-import { __require as j } from "./index.es206.js";
-import { __require as A } from "./index.es207.js";
-import { __require as D } from "./index.es208.js";
-var h, p;
-function z() {
-  if (p) return h;
-  p = 1;
-  var W = j(), d = A(), b = D(), C = "Expected a function", L = Math.max, M = Math.min;
-  function N(q, i, u) {
-    var a, c, v, o, r, t, f = 0, x = !1, m = !1, g = !0;
-    if (typeof q != "function")
-      throw new TypeError(C);
-    i = b(i) || 0, W(u) && (x = !!u.leading, m = "maxWait" in u, v = m ? L(b(u.maxWait) || 0, i) : v, g = "trailing" in u ? !!u.trailing : g);
-    function T(e) {
-      var n = a, l = c;
-      return a = c = void 0, f = e, o = q.apply(l, n), o;
-    }
-    function R(e) {
-      return f = e, r = setTimeout(s, i), x ? T(e) : o;
-    }
-    function S(e) {
-      var n = e - t, l = e - f, k = i - n;
-      return m ? M(k, v - l) : k;
-    }
-    function E(e) {
-      var n = e - t, l = e - f;
-      return t === void 0 || n >= i || n < 0 || m && l >= v;
-    }
-    function s() {
-      var e = d();
-      if (E(e))
-        return I(e);
-      r = setTimeout(s, S(e));
-    }
-    function I(e) {
-      return r = void 0, g && a ? T(e) : (a = c = void 0, o);
-    }
-    function y() {
-      r !== void 0 && clearTimeout(r), f = 0, a = t = c = r = void 0;
-    }
-    function O() {
-      return r === void 0 ? o : I(d());
-    }
-    function _() {
-      var e = d(), n = E(e);
-      if (a = arguments, c = this, t = e, n) {
-        if (r === void 0)
-          return R(t);
-        if (m)
-          return clearTimeout(r), r = setTimeout(s, i), T(t);
-      }
-      return r === void 0 && (r = setTimeout(s, i)), o;
-    }
-    return _.cancel = y, _.flush = O, _;
-  }
-  return h = N, h;
+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 {
-  z as __require
+  l as default
 };
 //# sourceMappingURL=index.es205.js.map

package/dist/index.es205.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es205.js","sources":["../../../node_modules/lodash/debounce.js"],"sourcesContent":["var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n"],"names":["isObject","require$$0","now","require$$1","toNumber","require$$2","FUNC_ERROR_TEXT","nativeMax","nativeMin","debounce","func","wait","options","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","invokeFunc","time","args","thisArg","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","debounce_1"],"mappings":";;;;;;;AAAA,MAAIA,IAAWC,KACXC,IAAMC,EAAA,GACNC,IAAWC,EAAA,GAGXC,IAAkB,uBAGlBC,IAAY,KAAK,KACjBC,IAAY,KAAK;AAwDrB,WAASC,EAASC,GAAMC,GAAMC,GAAS;AACrC,QAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,IAAiB,GACjBC,IAAU,IACVC,IAAS,IACTC,IAAW;AAEf,QAAI,OAAOZ,KAAQ;AACjB,YAAM,IAAI,UAAUJ,CAAe;AAErC,IAAAK,IAAOP,EAASO,CAAI,KAAK,GACrBX,EAASY,CAAO,MAClBQ,IAAU,CAAC,CAACR,EAAQ,SACpBS,IAAS,aAAaT,GACtBG,IAAUM,IAASd,EAAUH,EAASQ,EAAQ,OAAO,KAAK,GAAGD,CAAI,IAAII,GACrEO,IAAW,cAAcV,IAAU,CAAC,CAACA,EAAQ,WAAWU;AAG1D,aAASC,EAAWC,GAAM;AACxB,UAAIC,IAAOZ,GACPa,IAAUZ;AAEd,aAAAD,IAAWC,IAAW,QACtBK,IAAiBK,GACjBR,IAASN,EAAK,MAAMgB,GAASD,CAAI,GAC1BT;AAAA,IAAA;AAGT,aAASW,EAAYH,GAAM;AAEzB,aAAAL,IAAiBK,GAEjBP,IAAU,WAAWW,GAAcjB,CAAI,GAEhCS,IAAUG,EAAWC,CAAI,IAAIR;AAAA,IAAA;AAGtC,aAASa,EAAcL,GAAM;AAC3B,UAAIM,IAAoBN,IAAON,GAC3Ba,IAAsBP,IAAOL,GAC7Ba,IAAcrB,IAAOmB;AAEzB,aAAOT,IACHb,EAAUwB,GAAajB,IAAUgB,CAAmB,IACpDC;AAAA,IAAA;AAGN,aAASC,EAAaT,GAAM;AAC1B,UAAIM,IAAoBN,IAAON,GAC3Ba,IAAsBP,IAAOL;AAKjC,aAAQD,MAAiB,UAAcY,KAAqBnB,KACzDmB,IAAoB,KAAOT,KAAUU,KAAuBhB;AAAA,IAAA;AAGjE,aAASa,IAAe;AACtB,UAAIJ,IAAOtB,EAAA;AACX,UAAI+B,EAAaT,CAAI;AACnB,eAAOU,EAAaV,CAAI;AAG1B,MAAAP,IAAU,WAAWW,GAAcC,EAAcL,CAAI,CAAC;AAAA,IAAA;AAGxD,aAASU,EAAaV,GAAM;AAK1B,aAJAP,IAAU,QAINK,KAAYT,IACPU,EAAWC,CAAI,KAExBX,IAAWC,IAAW,QACfE;AAAA,IAAA;AAGT,aAASmB,IAAS;AAChB,MAAIlB,MAAY,UACd,aAAaA,CAAO,GAEtBE,IAAiB,GACjBN,IAAWK,IAAeJ,IAAWG,IAAU;AAAA,IAAA;AAGjD,aAASmB,IAAQ;AACf,aAAOnB,MAAY,SAAYD,IAASkB,EAAahC,GAAK;AAAA,IAAA;AAG5D,aAASmC,IAAY;AACnB,UAAIb,IAAOtB,EAAA,GACPoC,IAAaL,EAAaT,CAAI;AAMlC,UAJAX,IAAW,WACXC,IAAW,MACXI,IAAeM,GAEXc,GAAY;AACd,YAAIrB,MAAY;AACd,iBAAOU,EAAYT,CAAY;AAEjC,YAAIG;AAEF,8BAAaJ,CAAO,GACpBA,IAAU,WAAWW,GAAcjB,CAAI,GAChCY,EAAWL,CAAY;AAAA,MAChC;AAEF,aAAID,MAAY,WACdA,IAAU,WAAWW,GAAcjB,CAAI,IAElCK;AAAA,IAAA;AAET,WAAAqB,EAAU,SAASF,GACnBE,EAAU,QAAQD,GACXC;AAAA,EACT;AAEA,SAAAE,IAAiB9B;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es205.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,EAAG,CAAAF,IAAM;AAAA,cACF,EAAEE,KAAK,IAAG,CAAAF,KAAOC,EAASC,CAAC,EAAE;AACzC,EAAAH,EAAK,QAAQC;AACf;AAEA,SAAAG,IAA0B;AACxB,SAAO,KAAK,UAAUL,CAAK;AAC7B;","x_google_ignoreList":[0]}

package/dist/index.es206.js

@@ -1,14 +1,13 @@
-var e, n;
-function u() {
-  if (n) return e;
-  n = 1;
-  function i(r) {
-    var t = typeof r;
-    return r != null && (t == "object" || t == "function");
-  }
-  return e = i, e;
+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 {
-  u as __require
+  o as default
 };
 //# sourceMappingURL=index.es206.js.map

package/dist/index.es206.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es206.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,WAASA,EAASC,GAAO;AACvB,QAAIC,IAAO,OAAOD;AAClB,WAAOA,KAAS,SAASC,KAAQ,YAAYA,KAAQ;AAAA,EACvD;AAEA,SAAAC,IAAiBH;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es206.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;AAChC,MAAIC,IAAO,MAAMC,GAASC,IAAO,CAACF,CAAI,GAAGG,GAAUC,GAAGC;AACtD;AAEE,SADAJ,IAAUC,EAAK,QAAA,GAAWA,IAAO,CAAA,GAC1BF,IAAOC,EAAQ;AAEpB,UADAF,EAASC,CAAI,GAAGG,IAAWH,EAAK,UAC5BG,EAAU,MAAKC,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AACtD,QAAAF,EAAK,KAAKC,EAASC,CAAC,CAAC;AAAA,SAGlBF,EAAK;AACd,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/index.es207.js

@@ -1,14 +1,10 @@
-import { __require as t } from "./index.es231.js";
-var r, e;
-function i() {
-  if (e) return r;
-  e = 1;
-  var o = t(), n = function() {
-    return o.Date.now();
-  };
-  return r = n, r;
+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 {
-  i as __require
+  r as default
 };
 //# sourceMappingURL=index.es207.js.map

package/dist/index.es207.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es207.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,MAAIA,IAAOC,EAAA,GAkBPC,IAAM,WAAW;AACnB,WAAOF,EAAK,KAAK,IAAA;AAAA,EACnB;AAEA,SAAAG,IAAiBD;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es207.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;AAEhC,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,GAAUC,GACpCH,IAAOC,EAAM;AAElB,QADAF,EAASC,CAAI,GAAGE,IAAWF,EAAK,UAC5BE,QAAeC,IAAID,EAAS,SAAS,GAAGC,KAAK,GAAG,EAAEA;AACpD,MAAAF,EAAM,KAAKC,EAASC,CAAC,CAAC;AAG1B,SAAO;AACT;","x_google_ignoreList":[0]}