@performant-software/visualize 2.1.3-beta.11 → 2.1.3-beta.2

package/dist/index.es187.js.map

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

package/dist/index.es188.js

@@ -1,56 +1,38 @@
-import { slice as g } from "./index.es268.js";
-import p from "./index.es269.js";
-import { x as v, y as h } from "./index.es270.js";
-import c from "./index.es267.js";
-import k from "./index.es189.js";
-function T(n) {
-  return n.source;
-}
-function d(n) {
-  return n.target;
-}
-function f(n) {
-  var e = T, r = d, i = v, o = h, a = null;
-  function u() {
-    var t, l = g.call(arguments), m = e.apply(this, l), s = r.apply(this, l);
-    if (a || (a = t = k()), n(a, +i.apply(this, (l[0] = m, l)), +o.apply(this, l), +i.apply(this, (l[0] = s, l)), +o.apply(this, l)), t)
-      return a = null, t + "" || null;
-  }
-  return u.source = function(t) {
-    return arguments.length ? (e = t, u) : e;
-  }, u.target = function(t) {
-    return arguments.length ? (r = t, u) : r;
-  }, u.x = function(t) {
-    return arguments.length ? (i = typeof t == "function" ? t : p(+t), u) : i;
-  }, u.y = function(t) {
-    return arguments.length ? (o = typeof t == "function" ? t : p(+t), u) : o;
-  }, u.context = function(t) {
-    return arguments.length ? (a = t ?? null, u) : a;
-  }, u;
-}
-function z(n, e, r, i, o) {
-  n.moveTo(e, r), n.bezierCurveTo(e = (e + i) / 2, r, e, o, i, o);
-}
-function b(n, e, r, i, o) {
-  n.moveTo(e, r), n.bezierCurveTo(e, r = (r + o) / 2, i, r, i, o);
-}
-function y(n, e, r, i, o) {
-  var a = c(e, r), u = c(e, r = (r + o) / 2), t = c(i, r), l = c(i, o);
-  n.moveTo(a[0], a[1]), n.bezierCurveTo(u[0], u[1], t[0], t[1], l[0], l[1]);
-}
-function S() {
-  return f(z);
-}
-function j() {
-  return f(b);
-}
-function q() {
-  var n = f(y);
-  return n.angle = n.x, delete n.x, n.radius = n.y, delete n.y, n;
+import { isTouchEvent as a, isMouseEvent as c } from "./index.es63.js";
+function i() {
+  return i = Object.assign ? Object.assign.bind() : function(n) {
+    for (var r = 1; r < arguments.length; r++) {
+      var t = arguments[r];
+      for (var e in t)
+        Object.prototype.hasOwnProperty.call(t, e) && (n[e] = t[e]);
+    }
+    return n;
+  }, i.apply(this, arguments);
+}
+var u = {
+  x: 0,
+  y: 0
+};
+function g(n) {
+  if (!n)
+    return i({}, u);
+  if (a(n))
+    return n.changedTouches.length > 0 ? {
+      x: n.changedTouches[0].clientX,
+      y: n.changedTouches[0].clientY
+    } : i({}, u);
+  if (c(n))
+    return {
+      x: n.clientX,
+      y: n.clientY
+    };
+  var r = n == null ? void 0 : n.target, t = r && "getBoundingClientRect" in r ? r.getBoundingClientRect() : null;
+  return t ? {
+    x: t.x + t.width / 2,
+    y: t.y + t.height / 2
+  } : i({}, u);
 }
 export {
-  S as linkHorizontal,
-  q as linkRadial,
-  j as linkVertical
+  g 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-shape/src/link/index.js"],"sourcesContent":["import {path} from \"d3-path\";\nimport {slice} from \"../array.js\";\nimport constant from \"../constant.js\";\nimport {x as pointX, y as pointY} from \"../point.js\";\nimport pointRadial from \"../pointRadial.js\";\n\nfunction linkSource(d) {\n  return d.source;\n}\n\nfunction linkTarget(d) {\n  return d.target;\n}\n\nfunction link(curve) {\n  var source = linkSource,\n      target = linkTarget,\n      x = pointX,\n      y = pointY,\n      context = null;\n\n  function link() {\n    var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);\n    if (!context) context = buffer = path();\n    curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  link.source = function(_) {\n    return arguments.length ? (source = _, link) : source;\n  };\n\n  link.target = function(_) {\n    return arguments.length ? (target = _, link) : target;\n  };\n\n  link.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), link) : x;\n  };\n\n  link.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), link) : y;\n  };\n\n  link.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), link) : context;\n  };\n\n  return link;\n}\n\nfunction curveHorizontal(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);\n}\n\nfunction curveVertical(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);\n}\n\nfunction curveRadial(context, x0, y0, x1, y1) {\n  var p0 = pointRadial(x0, y0),\n      p1 = pointRadial(x0, y0 = (y0 + y1) / 2),\n      p2 = pointRadial(x1, y0),\n      p3 = pointRadial(x1, y1);\n  context.moveTo(p0[0], p0[1]);\n  context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\nexport function linkHorizontal() {\n  return link(curveHorizontal);\n}\n\nexport function linkVertical() {\n  return link(curveVertical);\n}\n\nexport function linkRadial() {\n  var l = link(curveRadial);\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n  return l;\n}\n"],"names":["linkSource","d","linkTarget","link","curve","source","target","x","pointX","y","pointY","context","buffer","argv","slice","s","t","path","_","constant","curveHorizontal","x0","y0","x1","y1","curveVertical","curveRadial","p0","pointRadial","p1","p2","p3","linkHorizontal","linkVertical","linkRadial","l"],"mappings":";;;;;AAMA,SAASA,EAAWC,GAAG;AACrB,SAAOA,EAAE;AACX;AAEA,SAASC,EAAWD,GAAG;AACrB,SAAOA,EAAE;AACX;AAEA,SAASE,EAAKC,GAAO;AACf,MAAAC,IAASL,GACTM,IAASJ,GACTK,IAAIC,GACJC,IAAIC,GACJC,IAAU;AAEd,WAASR,IAAO;AACd,QAAIS,GAAQC,IAAOC,EAAM,KAAK,SAAS,GAAGC,IAAIV,EAAO,MAAM,MAAMQ,CAAI,GAAGG,IAAIV,EAAO,MAAM,MAAMO,CAAI;AAG/F,QAFCF,MAASA,IAAUC,IAASK,MACjCb,EAAMO,GAAS,CAACJ,EAAE,MAAM,OAAOM,EAAK,CAAC,IAAIE,GAAGF,EAAK,GAAG,CAACJ,EAAE,MAAM,MAAMI,CAAI,GAAG,CAACN,EAAE,MAAM,OAAOM,EAAK,CAAC,IAAIG,GAAGH,EAAK,GAAG,CAACJ,EAAE,MAAM,MAAMI,CAAI,CAAC,GAC/HD;AAAe,aAAAD,IAAU,MAAMC,IAAS,MAAM;AAAA,EACpD;AAEAT,SAAAA,EAAK,SAAS,SAASe,GAAG;AACxB,WAAO,UAAU,UAAUb,IAASa,GAAGf,KAAQE;AAAA,EAAA,GAGjDF,EAAK,SAAS,SAASe,GAAG;AACxB,WAAO,UAAU,UAAUZ,IAASY,GAAGf,KAAQG;AAAA,EAAA,GAGjDH,EAAK,IAAI,SAASe,GAAG;AACZ,WAAA,UAAU,UAAUX,IAAI,OAAOW,KAAM,aAAaA,IAAIC,EAAS,CAACD,CAAC,GAAGf,KAAQI;AAAAA,EAAA,GAGrFJ,EAAK,IAAI,SAASe,GAAG;AACZ,WAAA,UAAU,UAAUT,IAAI,OAAOS,KAAM,aAAaA,IAAIC,EAAS,CAACD,CAAC,GAAGf,KAAQM;AAAAA,EAAA,GAGrFN,EAAK,UAAU,SAASe,GAAG;AACzB,WAAO,UAAU,UAAWP,IAAUO,KAAY,MAAWf,KAAQQ;AAAA,EAAA,GAGhER;AACT;AAEA,SAASiB,EAAgBT,GAASU,GAAIC,GAAIC,GAAIC,GAAI;AACxC,EAAAb,EAAA,OAAOU,GAAIC,CAAE,GACbX,EAAA,cAAcU,KAAMA,IAAKE,KAAM,GAAGD,GAAID,GAAIG,GAAID,GAAIC,CAAE;AAC9D;AAEA,SAASC,EAAcd,GAASU,GAAIC,GAAIC,GAAIC,GAAI;AACtC,EAAAb,EAAA,OAAOU,GAAIC,CAAE,GACbX,EAAA,cAAcU,GAAIC,KAAMA,IAAKE,KAAM,GAAGD,GAAID,GAAIC,GAAIC,CAAE;AAC9D;AAEA,SAASE,EAAYf,GAASU,GAAIC,GAAIC,GAAIC,GAAI;AACxC,MAAAG,IAAKC,EAAYP,GAAIC,CAAE,GACvBO,IAAKD,EAAYP,GAAIC,KAAMA,IAAKE,KAAM,CAAC,GACvCM,IAAKF,EAAYL,GAAID,CAAE,GACvBS,IAAKH,EAAYL,GAAIC,CAAE;AAC3B,EAAAb,EAAQ,OAAOgB,EAAG,CAAC,GAAGA,EAAG,CAAC,CAAC,GAC3BhB,EAAQ,cAAckB,EAAG,CAAC,GAAGA,EAAG,CAAC,GAAGC,EAAG,CAAC,GAAGA,EAAG,CAAC,GAAGC,EAAG,CAAC,GAAGA,EAAG,CAAC,CAAC;AAChE;AAEO,SAASC,IAAiB;AAC/B,SAAO7B,EAAKiB,CAAe;AAC7B;AAEO,SAASa,IAAe;AAC7B,SAAO9B,EAAKsB,CAAa;AAC3B;AAEO,SAASS,IAAa;AACvB,MAAAC,IAAIhC,EAAKuB,CAAW;AACxB,SAAAS,EAAE,QAAQA,EAAE,GAAG,OAAOA,EAAE,GACxBA,EAAE,SAASA,EAAE,GAAG,OAAOA,EAAE,GAClBA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es188.js","sources":["../../../node_modules/@visx/event/esm/getXAndYFromEvent.js"],"sourcesContent":["function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }\nimport { isMouseEvent, isTouchEvent } from './typeGuards';\nvar DEFAULT_POINT = {\n  x: 0,\n  y: 0\n};\nexport default function getXAndYFromEvent(event) {\n  if (!event) return _extends({}, DEFAULT_POINT);\n  if (isTouchEvent(event)) {\n    return event.changedTouches.length > 0 ? {\n      x: event.changedTouches[0].clientX,\n      y: event.changedTouches[0].clientY\n    } : _extends({}, DEFAULT_POINT);\n  }\n  if (isMouseEvent(event)) {\n    return {\n      x: event.clientX,\n      y: event.clientY\n    };\n  }\n\n  // for focus events try to extract the center position of the target element\n  var target = event == null ? void 0 : event.target;\n  var boundingClientRect = target && 'getBoundingClientRect' in target ? target.getBoundingClientRect() : null;\n  if (!boundingClientRect) return _extends({}, DEFAULT_POINT);\n  return {\n    x: boundingClientRect.x + boundingClientRect.width / 2,\n    y: boundingClientRect.y + boundingClientRect.height / 2\n  };\n}"],"names":["_extends","target","i","source","key","DEFAULT_POINT","getXAndYFromEvent","event","isTouchEvent","isMouseEvent","boundingClientRect"],"mappings":";AAAA,SAASA,IAAW;AAAE,SAAAA,IAAW,OAAO,SAAS,OAAO,OAAO,KAAK,IAAI,SAAUC,GAAQ;AAAE,aAASC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAM,UAAAC,IAAS,UAAUD,CAAC;AAAG,eAASE,KAAOD;AAAU,QAAI,OAAO,UAAU,eAAe,KAAKA,GAAQC,CAAG,MAAYH,EAAAG,CAAG,IAAID,EAAOC,CAAG;AAAA,IAAO;AAAS,WAAAH;AAAA,EAAA,GAAkBD,EAAS,MAAM,MAAM,SAAS;AAAG;AAElV,IAAIK,IAAgB;AAAA,EAClB,GAAG;AAAA,EACH,GAAG;AACL;AACA,SAAwBC,EAAkBC,GAAO;AAC/C,MAAI,CAACA;AAAc,WAAAP,EAAS,IAAIK,CAAa;AACzC,MAAAG,EAAaD,CAAK;AACb,WAAAA,EAAM,eAAe,SAAS,IAAI;AAAA,MACvC,GAAGA,EAAM,eAAe,CAAC,EAAE;AAAA,MAC3B,GAAGA,EAAM,eAAe,CAAC,EAAE;AAAA,IAAA,IACzBP,EAAS,IAAIK,CAAa;AAE5B,MAAAI,EAAaF,CAAK;AACb,WAAA;AAAA,MACL,GAAGA,EAAM;AAAA,MACT,GAAGA,EAAM;AAAA,IAAA;AAKb,MAAIN,IAASM,KAAS,OAAO,SAASA,EAAM,QACxCG,IAAqBT,KAAU,2BAA2BA,IAASA,EAAO,sBAA0B,IAAA;AACxG,SAAKS,IACE;AAAA,IACL,GAAGA,EAAmB,IAAIA,EAAmB,QAAQ;AAAA,IACrD,GAAGA,EAAmB,IAAIA,EAAmB,SAAS;AAAA,EAAA,IAHxBV,EAAS,IAAIK,CAAa;AAK5D;","x_google_ignoreList":[0]}

package/dist/index.es189.js

@@ -1,58 +1,19 @@
-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 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);
-      }
-  },
-  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._;
+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;
   }
-};
+  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 {
-  C 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-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;AAChB,IAAA,KAAK,QAAQ,SACf,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KACrC,KAAK,KAAK;AAAA,EAEd;AAAA,EACA,QAAQ,SAASD,GAAGC,GAAG;AAChB,SAAA,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;AACvC,SAAA,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;AACzC,QAAAC,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;AAAS,YAAA,IAAI,MAAM,sBAAsBA,CAAC;AAG9C,QAAA,KAAK,QAAQ;AACf,WAAK,KAAK,OAAO,KAAK,MAAMJ,KAAM,OAAO,KAAK,MAAMC;AAAA,aAI3CU,IAAQjB;AAKV,UAAA,EAAE,KAAK,IAAIgB,IAAMH,IAAMC,IAAMC,CAAG,IAAIf,MAAY,CAACU;AACxD,aAAK,KAAK,OAAO,KAAK,MAAMJ,KAAM,OAAO,KAAK,MAAMC;AAAA,WAIjD;AACC,YAAAW,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,QAAI,KAAK,IAAIG,IAAM,CAAC,IAAIzB,MACtB,KAAK,KAAK,OAAOM,IAAKmB,IAAMV,KAAO,OAAOR,IAAKkB,IAAMT,KAGlD,KAAA,KAAK,MAAMN,IAAI,MAAMA,IAAI,UAAW,EAAEM,IAAME,IAAMH,IAAMI,KAAQ,OAAO,KAAK,MAAMb,IAAKoB,IAAMb,KAAO,OAAO,KAAK,MAAMN,IAAKmB,IAAMZ;AAAA,MACxI;AAAA,EACF;AAAA,EACA,KAAK,SAASV,GAAGC,GAAGK,GAAGiB,GAAIC,GAAIC,GAAK;AAC9B,IAAAzB,IAAA,CAACA,GAAGC,IAAI,CAACA,GAAGK,IAAI,CAACA,GAAGmB,IAAM,CAAC,CAACA;AAC5B,QAAAC,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;AAAS,YAAA,IAAI,MAAM,sBAAsBA,CAAC;AAalD,IAVI,KAAK,QAAQ,OACV,KAAA,KAAK,MAAMC,IAAK,MAAMC,KAIpB,KAAK,IAAI,KAAK,MAAMD,CAAE,IAAIX,KAAW,KAAK,IAAI,KAAK,MAAMY,CAAE,IAAIZ,OACjE,KAAA,KAAK,MAAMW,IAAK,MAAMC,IAIxBF,MAGDuB,IAAK,MAAGA,IAAKA,IAAKlC,IAAMA,IAGxBkC,IAAKhC,IACF,KAAA,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,MACP,KAAA,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;AACpB,SAAA,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]}
+{"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.es82.js";
-import p from "./index.es227.js";
+import m from "./index.es79.js";
+import p from "./index.es216.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,16 +1,11 @@
-function i(u) {
-  var e = 0, n = u.children, t = n && n.length;
-  if (!t)
-    e = 1;
-  else
-    for (; --t >= 0; )
-      e += n[t].value;
-  u.value = e;
-}
-function l() {
-  return this.eachAfter(i);
+import { toString as n } from "./index.es6.js";
+function a(t) {
+  var r = "[object " + t + "]";
+  return function(e) {
+    return n.call(e) === r;
+  };
 }
 export {
-  l as default
+  a as default
 };
 //# sourceMappingURL=index.es198.js.map

package/dist/index.es198.js.map

@@ -1 +1 @@
-{"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]}
+{"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]}

package/dist/index.es199.js

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

package/dist/index.es199.js.map

@@ -1 +1 @@
-{"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]}
+{"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]}

package/dist/index.es20.js

@@ -1,6 +1,6 @@
-import o from "./index.es82.js";
+import o from "./index.es79.js";
 import u from "./index.es7.js";
-import c from "./index.es227.js";
+import c from "./index.es216.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,11 +1,7 @@
-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;
-}
+import e from "./index.es253.js";
+import t from "./index.es202.js";
+const f = e(t);
 export {
-  r as default
+  f as default
 };
 //# sourceMappingURL=index.es200.js.map

package/dist/index.es200.js.map

@@ -1 +1 @@
-{"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]}
+{"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]}

package/dist/index.es201.js

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

package/dist/index.es201.js.map

@@ -1 +1 @@
-{"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]}
+{"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]}

package/dist/index.es202.js

@@ -1,11 +1,6 @@
-function l(i) {
-  return this.eachAfter(function(e) {
-    for (var a = +i(e.data) || 0, t = e.children, u = t && t.length; --u >= 0; )
-      a += t[u].value;
-    e.value = a;
-  });
-}
+import t from "./index.es254.js";
+const o = t("byteLength");
 export {
-  l 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/d3-hierarchy/src/hierarchy/sum.js"],"sourcesContent":["export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n"],"names":["node_sum","value","node","sum","children","i"],"mappings":"AAAA,SAAAA,EAAwBC,GAAO;AACtB,SAAA,KAAK,UAAU,SAASC,GAAM;AAInC,aAHIC,IAAM,CAACF,EAAMC,EAAK,IAAI,KAAK,GAC3BE,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS,QACtB,EAAEC,KAAK;AAAU,MAAAF,KAAAC,EAASC,CAAC,EAAE;AACpC,IAAAH,EAAK,QAAQC;AAAA,EAAA,CACd;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.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]}

package/dist/index.es203.js

@@ -1,9 +1,12 @@
-function t(r) {
-  return this.eachBefore(function(e) {
-    e.children && e.children.sort(r);
-  });
+import e from "./index.es202.js";
+function i(t) {
+  return new Uint8Array(
+    t.buffer || t,
+    t.byteOffset || 0,
+    e(t)
+  );
 }
 export {
-  t 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/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]}
+{"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]}

package/dist/index.es204.js

@@ -1,19 +1,25 @@
-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;
+import o from "./index.es201.js";
+import f from "./index.es7.js";
+import m from "./index.es102.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]);
+  };
 }
+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 {
-  p as default
+  v as ie11fingerprint,
+  d as mapMethods,
+  M as setMethods,
+  u as weakMapMethods
 };
 //# sourceMappingURL=index.es204.js.map

package/dist/index.es204.js.map

@@ -1 +1 @@
-{"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]}
+{"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]}

package/dist/index.es205.js

@@ -1,9 +1,25 @@
-function t() {
-  for (var e = this, n = [e]; e = e.parent; )
-    n.push(e);
-  return n;
+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);
 }
 export {
-  t as default
+  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/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]}
+{"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]}

package/dist/index.es206.js

@@ -1,10 +1,17 @@
-function t() {
-  var n = [];
-  return this.each(function(e) {
-    n.push(e);
-  }), n;
+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;
+  };
 }
 export {
-  t as default
+  c as default
 };
 //# sourceMappingURL=index.es206.js.map

package/dist/index.es206.js.map

@@ -1 +1 @@
-{"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]}
+{"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]}