@performant-software/visualize 2.3.3-beta.7 → 2.3.3-beta.8

package/dist/index.es189.js

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

package/dist/index.es189.js.map

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

package/dist/index.es192.js

@@ -1,6 +1,6 @@
-import { __module as e } from "./index.es245.js";
-import { __require as o } from "./index.es246.js";
-import { __require as t } from "./index.es247.js";
+import { __module as e } from "./index.es234.js";
+import { __require as o } from "./index.es235.js";
+import { __require as t } from "./index.es236.js";
 var r;
 function p() {
   return r ? e.exports : (r = 1, process.env.NODE_ENV === "production" ? e.exports = o() : e.exports = t(), e.exports);

package/dist/index.es193.js

@@ -1,8 +1,8 @@
 import { __require as F } from "./index.es192.js";
-import { __require as N } from "./index.es248.js";
-import { __require as ee } from "./index.es249.js";
-import { __require as re } from "./index.es250.js";
-import { __require as ne } from "./index.es251.js";
+import { __require as N } from "./index.es237.js";
+import { __require as ee } from "./index.es238.js";
+import { __require as re } from "./index.es239.js";
+import { __require as ne } from "./index.es240.js";
 var A, C;
 function oe() {
   if (C)

package/dist/index.es194.js

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

package/dist/index.es197.js

@@ -1,5 +1,9 @@
-var s = { exports: {} };
+function n(t) {
+  var e = typeof t;
+  return t != null && (e == "object" || e == "function");
+}
+var c = n;
 export {
-  s as __module
+  c as i
 };
 //# sourceMappingURL=index.es197.js.map

package/dist/index.es197.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es197.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index.es197.js","sources":["../../../node_modules/lodash/isObject.js"],"sourcesContent":["/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n"],"names":["isObject","value","type","isObject_1"],"mappings":"AAyBA,SAASA,EAASC,GAAO;AACvB,MAAIC,IAAO,OAAOD;AAClB,SAAOA,KAAS,SAASC,KAAQ,YAAYA,KAAQ;AACvD;AAEA,IAAAC,IAAiBH;","x_google_ignoreList":[0]}

package/dist/index.es198.js

@@ -1,9 +1,8 @@
-function n(t) {
-  var e = typeof t;
-  return t != null && (e == "object" || e == "function");
-}
-var c = n;
+import { _ as o } from "./index.es252.js";
+var r = o, n = function() {
+  return r.Date.now();
+}, a = n;
 export {
-  c as i
+  a as n
 };
 //# sourceMappingURL=index.es198.js.map

package/dist/index.es198.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es198.js","sources":["../../../node_modules/lodash/isObject.js"],"sourcesContent":["/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n"],"names":["isObject","value","type","isObject_1"],"mappings":"AAyBA,SAASA,EAASC,GAAO;AACvB,MAAIC,IAAO,OAAOD;AAClB,SAAOA,KAAS,SAASC,KAAQ,YAAYA,KAAQ;AACvD;AAEA,IAAAC,IAAiBH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es198.js","sources":["../../../node_modules/lodash/now.js"],"sourcesContent":["var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n"],"names":["root","require$$0","now","now_1"],"mappings":";AAAA,IAAIA,IAAOC,GAkBPC,IAAM,WAAW;AACZ,SAAAF,EAAK,KAAK;AACnB,GAEAG,IAAiBD;","x_google_ignoreList":[0]}

package/dist/index.es199.js

@@ -1,8 +1,24 @@
-import { _ as o } from "./index.es252.js";
-var r = o, n = function() {
-  return r.Date.now();
-}, a = n;
+import { _ as o } from "./index.es253.js";
+import { i as n } from "./index.es197.js";
+import { i as m } from "./index.es254.js";
+var b = o, s = n, e = m, f = NaN, p = /^[-+]0x[0-9a-f]+$/i, y = /^0b[01]+$/i, a = /^0o[0-7]+$/i, c = parseInt;
+function I(r) {
+  if (typeof r == "number")
+    return r;
+  if (e(r))
+    return f;
+  if (s(r)) {
+    var t = typeof r.valueOf == "function" ? r.valueOf() : r;
+    r = s(t) ? t + "" : t;
+  }
+  if (typeof r != "string")
+    return r === 0 ? r : +r;
+  r = b(r);
+  var i = y.test(r);
+  return i || a.test(r) ? c(r.slice(2), i ? 2 : 8) : p.test(r) ? f : +r;
+}
+var x = I;
 export {
-  a as n
+  x as t
 };
 //# sourceMappingURL=index.es199.js.map

package/dist/index.es199.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es199.js","sources":["../../../node_modules/lodash/now.js"],"sourcesContent":["var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n"],"names":["root","require$$0","now","now_1"],"mappings":";AAAA,IAAIA,IAAOC,GAkBPC,IAAM,WAAW;AACZ,SAAAF,EAAK,KAAK;AACnB,GAEAG,IAAiBD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es199.js","sources":["../../../node_modules/lodash/toNumber.js"],"sourcesContent":["var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n"],"names":["baseTrim","require$$0","isObject","require$$1","isSymbol","require$$2","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","value","other","isBinary","toNumber_1"],"mappings":";;;AAAA,IAAIA,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GAGXC,IAAM,KAGNC,IAAa,sBAGbC,IAAa,cAGbC,IAAY,eAGZC,IAAe;AAyBnB,SAASC,EAASC,GAAO;AACnB,MAAA,OAAOA,KAAS;AACX,WAAAA;AAEL,MAAAR,EAASQ,CAAK;AACT,WAAAN;AAEL,MAAAJ,EAASU,CAAK,GAAG;AACnB,QAAIC,IAAQ,OAAOD,EAAM,WAAW,aAAaA,EAAM,QAAY,IAAAA;AACnE,IAAAA,IAAQV,EAASW,CAAK,IAAKA,IAAQ,KAAMA;AAAA,EAC3C;AACI,MAAA,OAAOD,KAAS;AACX,WAAAA,MAAU,IAAIA,IAAQ,CAACA;AAEhC,EAAAA,IAAQZ,EAASY,CAAK;AAClB,MAAAE,IAAWN,EAAW,KAAKI,CAAK;AACpC,SAAQE,KAAYL,EAAU,KAAKG,CAAK,IACpCF,EAAaE,EAAM,MAAM,CAAC,GAAGE,IAAW,IAAI,CAAC,IAC5CP,EAAW,KAAKK,CAAK,IAAIN,IAAM,CAACM;AACvC;AAEA,IAAAG,IAAiBJ;","x_google_ignoreList":[0]}

package/dist/index.es200.js

@@ -1,24 +1,5 @@
-import { _ as o } from "./index.es253.js";
-import { i as n } from "./index.es198.js";
-import { i as m } from "./index.es254.js";
-var b = o, s = n, e = m, f = NaN, p = /^[-+]0x[0-9a-f]+$/i, y = /^0b[01]+$/i, a = /^0o[0-7]+$/i, c = parseInt;
-function I(r) {
-  if (typeof r == "number")
-    return r;
-  if (e(r))
-    return f;
-  if (s(r)) {
-    var t = typeof r.valueOf == "function" ? r.valueOf() : r;
-    r = s(t) ? t + "" : t;
-  }
-  if (typeof r != "string")
-    return r === 0 ? r : +r;
-  r = b(r);
-  var i = y.test(r);
-  return i || a.test(r) ? c(r.slice(2), i ? 2 : 8) : p.test(r) ? f : +r;
-}
-var x = I;
+var s = { exports: {} };
 export {
-  x as t
+  s as __module
 };
 //# sourceMappingURL=index.es200.js.map

package/dist/index.es200.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es200.js","sources":["../../../node_modules/lodash/toNumber.js"],"sourcesContent":["var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n"],"names":["baseTrim","require$$0","isObject","require$$1","isSymbol","require$$2","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","value","other","isBinary","toNumber_1"],"mappings":";;;AAAA,IAAIA,IAAWC,GACXC,IAAWC,GACXC,IAAWC,GAGXC,IAAM,KAGNC,IAAa,sBAGbC,IAAa,cAGbC,IAAY,eAGZC,IAAe;AAyBnB,SAASC,EAASC,GAAO;AACnB,MAAA,OAAOA,KAAS;AACX,WAAAA;AAEL,MAAAR,EAASQ,CAAK;AACT,WAAAN;AAEL,MAAAJ,EAASU,CAAK,GAAG;AACnB,QAAIC,IAAQ,OAAOD,EAAM,WAAW,aAAaA,EAAM,QAAY,IAAAA;AACnE,IAAAA,IAAQV,EAASW,CAAK,IAAKA,IAAQ,KAAMA;AAAA,EAC3C;AACI,MAAA,OAAOD,KAAS;AACX,WAAAA,MAAU,IAAIA,IAAQ,CAACA;AAEhC,EAAAA,IAAQZ,EAASY,CAAK;AAClB,MAAAE,IAAWN,EAAW,KAAKI,CAAK;AACpC,SAAQE,KAAYL,EAAU,KAAKG,CAAK,IACpCF,EAAaE,EAAM,MAAM,CAAC,GAAGE,IAAW,IAAI,CAAC,IAC5CP,EAAW,KAAKK,CAAK,IAAIN,IAAM,CAACM;AACvC;AAEA,IAAAG,IAAiBJ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es200.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es203.js

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

package/dist/index.es204.js

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

package/dist/index.es205.js

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

package/dist/index.es223.js

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

package/dist/index.es232.js

@@ -1,4 +1,4 @@
-import a from "./index.es264.js";
+import a from "./index.es268.js";
 function i(r, e) {
   if (r) {
     if (typeof r == "string")

package/dist/index.es234.js

@@ -1,16 +1,5 @@
-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);
-}
+var e = { exports: {} };
 export {
-  l as default
+  e as __module
 };
 //# sourceMappingURL=index.es234.js.map

package/dist/index.es234.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es234.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.es234.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es235.js

@@ -1,14 +1,80 @@
-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 { __exports as r } from "./index.es269.js";
+var _;
+function g() {
+  if (_)
+    return r;
+  _ = 1;
+  /** @license React v16.13.1
+   * react-is.production.min.js
+   *
+   * Copyright (c) Facebook, Inc. and its affiliates.
+   *
+   * This source code is licensed under the MIT license found in the
+   * LICENSE file in the root directory of this source tree.
+   */
+  var t = typeof Symbol == "function" && Symbol.for, a = t ? Symbol.for("react.element") : 60103, b = t ? Symbol.for("react.portal") : 60106, n = t ? Symbol.for("react.fragment") : 60107, c = t ? Symbol.for("react.strict_mode") : 60108, f = t ? Symbol.for("react.profiler") : 60114, i = t ? Symbol.for("react.provider") : 60109, s = t ? Symbol.for("react.context") : 60110, d = t ? Symbol.for("react.async_mode") : 60111, u = t ? Symbol.for("react.concurrent_mode") : 60111, y = t ? Symbol.for("react.forward_ref") : 60112, l = t ? Symbol.for("react.suspense") : 60113, x = t ? Symbol.for("react.suspense_list") : 60120, m = t ? Symbol.for("react.memo") : 60115, p = t ? Symbol.for("react.lazy") : 60116, C = t ? Symbol.for("react.block") : 60121, M = t ? Symbol.for("react.fundamental") : 60117, v = t ? Symbol.for("react.responder") : 60118, w = t ? Symbol.for("react.scope") : 60119;
+  function o(e) {
+    if (typeof e == "object" && e !== null) {
+      var S = e.$$typeof;
+      switch (S) {
+        case a:
+          switch (e = e.type, e) {
+            case d:
+            case u:
+            case n:
+            case f:
+            case c:
+            case l:
+              return e;
+            default:
+              switch (e = e && e.$$typeof, e) {
+                case s:
+                case y:
+                case p:
+                case m:
+                case i:
+                  return e;
+                default:
+                  return S;
+              }
+          }
+        case b:
+          return S;
+      }
+    }
+  }
+  function $(e) {
+    return o(e) === u;
+  }
+  return r.AsyncMode = d, r.ConcurrentMode = u, r.ContextConsumer = s, r.ContextProvider = i, r.Element = a, r.ForwardRef = y, r.Fragment = n, r.Lazy = p, r.Memo = m, r.Portal = b, r.Profiler = f, r.StrictMode = c, r.Suspense = l, r.isAsyncMode = function(e) {
+    return $(e) || o(e) === d;
+  }, r.isConcurrentMode = $, r.isContextConsumer = function(e) {
+    return o(e) === s;
+  }, r.isContextProvider = function(e) {
+    return o(e) === i;
+  }, r.isElement = function(e) {
+    return typeof e == "object" && e !== null && e.$$typeof === a;
+  }, r.isForwardRef = function(e) {
+    return o(e) === y;
+  }, r.isFragment = function(e) {
+    return o(e) === n;
+  }, r.isLazy = function(e) {
+    return o(e) === p;
+  }, r.isMemo = function(e) {
+    return o(e) === m;
+  }, r.isPortal = function(e) {
+    return o(e) === b;
+  }, r.isProfiler = function(e) {
+    return o(e) === f;
+  }, r.isStrictMode = function(e) {
+    return o(e) === c;
+  }, r.isSuspense = function(e) {
+    return o(e) === l;
+  }, r.isValidElementType = function(e) {
+    return typeof e == "string" || typeof e == "function" || e === n || e === u || e === f || e === c || e === l || e === x || typeof e == "object" && e !== null && (e.$$typeof === p || e.$$typeof === m || e.$$typeof === i || e.$$typeof === s || e.$$typeof === y || e.$$typeof === M || e.$$typeof === v || e.$$typeof === w || e.$$typeof === C);
+  }, r.typeOf = o, r;
 }
 export {
-  o as default
+  g as __require
 };
 //# sourceMappingURL=index.es235.js.map

package/dist/index.es235.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es235.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.es235.js","sources":["../../../node_modules/react-is/cjs/react-is.production.min.js"],"sourcesContent":["/** @license React v16.13.1\n * react-is.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';var b=\"function\"===typeof Symbol&&Symbol.for,c=b?Symbol.for(\"react.element\"):60103,d=b?Symbol.for(\"react.portal\"):60106,e=b?Symbol.for(\"react.fragment\"):60107,f=b?Symbol.for(\"react.strict_mode\"):60108,g=b?Symbol.for(\"react.profiler\"):60114,h=b?Symbol.for(\"react.provider\"):60109,k=b?Symbol.for(\"react.context\"):60110,l=b?Symbol.for(\"react.async_mode\"):60111,m=b?Symbol.for(\"react.concurrent_mode\"):60111,n=b?Symbol.for(\"react.forward_ref\"):60112,p=b?Symbol.for(\"react.suspense\"):60113,q=b?\nSymbol.for(\"react.suspense_list\"):60120,r=b?Symbol.for(\"react.memo\"):60115,t=b?Symbol.for(\"react.lazy\"):60116,v=b?Symbol.for(\"react.block\"):60121,w=b?Symbol.for(\"react.fundamental\"):60117,x=b?Symbol.for(\"react.responder\"):60118,y=b?Symbol.for(\"react.scope\"):60119;\nfunction z(a){if(\"object\"===typeof a&&null!==a){var u=a.$$typeof;switch(u){case c:switch(a=a.type,a){case l:case m:case e:case g:case f:case p:return a;default:switch(a=a&&a.$$typeof,a){case k:case n:case t:case r:case h:return a;default:return u}}case d:return u}}}function A(a){return z(a)===m}exports.AsyncMode=l;exports.ConcurrentMode=m;exports.ContextConsumer=k;exports.ContextProvider=h;exports.Element=c;exports.ForwardRef=n;exports.Fragment=e;exports.Lazy=t;exports.Memo=r;exports.Portal=d;\nexports.Profiler=g;exports.StrictMode=f;exports.Suspense=p;exports.isAsyncMode=function(a){return A(a)||z(a)===l};exports.isConcurrentMode=A;exports.isContextConsumer=function(a){return z(a)===k};exports.isContextProvider=function(a){return z(a)===h};exports.isElement=function(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===c};exports.isForwardRef=function(a){return z(a)===n};exports.isFragment=function(a){return z(a)===e};exports.isLazy=function(a){return z(a)===t};\nexports.isMemo=function(a){return z(a)===r};exports.isPortal=function(a){return z(a)===d};exports.isProfiler=function(a){return z(a)===g};exports.isStrictMode=function(a){return z(a)===f};exports.isSuspense=function(a){return z(a)===p};\nexports.isValidElementType=function(a){return\"string\"===typeof a||\"function\"===typeof a||a===e||a===m||a===g||a===f||a===p||a===q||\"object\"===typeof a&&null!==a&&(a.$$typeof===t||a.$$typeof===r||a.$$typeof===h||a.$$typeof===k||a.$$typeof===n||a.$$typeof===w||a.$$typeof===x||a.$$typeof===y||a.$$typeof===v)};exports.typeOf=z;\n"],"names":["b","c","d","e","f","g","h","k","l","m","n","p","q","r","t","v","w","x","y","z","a","u","A","reactIs_production_min"],"mappings":";;;;;;EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASa,MAAIA,IAAe,OAAO,UAApB,cAA4B,OAAO,KAAIC,IAAED,IAAE,OAAO,IAAI,eAAe,IAAE,OAAME,IAAEF,IAAE,OAAO,IAAI,cAAc,IAAE,OAAMG,IAAEH,IAAE,OAAO,IAAI,gBAAgB,IAAE,OAAMI,IAAEJ,IAAE,OAAO,IAAI,mBAAmB,IAAE,OAAMK,IAAEL,IAAE,OAAO,IAAI,gBAAgB,IAAE,OAAMM,IAAEN,IAAE,OAAO,IAAI,gBAAgB,IAAE,OAAMO,IAAEP,IAAE,OAAO,IAAI,eAAe,IAAE,OAAMQ,IAAER,IAAE,OAAO,IAAI,kBAAkB,IAAE,OAAMS,IAAET,IAAE,OAAO,IAAI,uBAAuB,IAAE,OAAMU,IAAEV,IAAE,OAAO,IAAI,mBAAmB,IAAE,OAAMW,IAAEX,IAAE,OAAO,IAAI,gBAAgB,IAAE,OAAMY,IAAEZ,IACpf,OAAO,IAAI,qBAAqB,IAAE,OAAMa,IAAEb,IAAE,OAAO,IAAI,YAAY,IAAE,OAAMc,IAAEd,IAAE,OAAO,IAAI,YAAY,IAAE,OAAMe,IAAEf,IAAE,OAAO,IAAI,aAAa,IAAE,OAAMgB,IAAEhB,IAAE,OAAO,IAAI,mBAAmB,IAAE,OAAMiB,IAAEjB,IAAE,OAAO,IAAI,iBAAiB,IAAE,OAAMkB,IAAElB,IAAE,OAAO,IAAI,aAAa,IAAE;AAClQ,WAASmB,EAAEC,GAAE;AAAC,QAAc,OAAOA,KAAlB,YAA4BA,MAAP,MAAS;AAAC,UAAIC,IAAED,EAAE;AAAS,cAAOC,GAAE;AAAA,QAAC,KAAKpB;AAAS,kBAAAmB,IAAEA,EAAE,MAAKA,GAAE;AAAA,YAAC,KAAKZ;AAAA,YAAE,KAAKC;AAAA,YAAE,KAAKN;AAAA,YAAE,KAAKE;AAAA,YAAE,KAAKD;AAAA,YAAE,KAAKO;AAAS,qBAAAS;AAAA,YAAE;AAAQ,sBAAOA,IAAEA,KAAGA,EAAE,UAASA,GAAE;AAAA,gBAAC,KAAKb;AAAA,gBAAE,KAAKG;AAAA,gBAAE,KAAKI;AAAA,gBAAE,KAAKD;AAAA,gBAAE,KAAKP;AAAS,yBAAAc;AAAA,gBAAE;AAAe,yBAAAC;AAAA,cAAC;AAAA,UAAC;AAAA,QAAC,KAAKnB;AAAS,iBAAAmB;AAAA,MAAC;AAAA,IAAC;AAAA,EAAC;AAAC,WAASC,EAAEF,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIX;AAAA,EAAC;AAAmB,SAAAc,EAAA,YAAAf,GAAyBe,EAAA,iBAAAd,GAA0Bc,EAAA,kBAAAhB,GAA0BgB,EAAA,kBAAAjB,GAAkBiB,EAAA,UAAAtB,GAAqBsB,EAAA,aAAAb,GAAmBa,EAAA,WAAApB,GAAeoB,EAAA,OAAAT,GAAeS,EAAA,OAAAV,GAAiBU,EAAA,SAAArB,GAC/dqB,EAAA,WAAAlB,GAAqBkB,EAAA,aAAAnB,GAAmBmB,EAAA,WAAAZ,GAAUY,EAAA,cAAY,SAASH,GAAE;AAAC,WAAOE,EAAEF,CAAC,KAAGD,EAAEC,CAAC,MAAIZ;AAAA,EAAC,GAA2Be,EAAA,mBAAAD,GAAUC,EAAA,oBAAkB,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIb;AAAA,EAAC,GAAUgB,EAAA,oBAAkB,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAId;AAAA,EAAC,GAAUiB,EAAA,YAAU,SAASH,GAAE;AAAC,WAAiB,OAAOA,KAAlB,YAA4BA,MAAP,QAAUA,EAAE,aAAWnB;AAAA,EAAC,GAAUsB,EAAA,eAAa,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIV;AAAA,EAAC,GAAUa,EAAA,aAAW,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIjB;AAAA,EAAC,GAAUoB,EAAA,SAAO,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIN;AAAA,EAAC,GACldS,EAAA,SAAO,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIP;AAAA,EAAC,GAAUU,EAAA,WAAS,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIlB;AAAA,EAAC,GAAUqB,EAAA,aAAW,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIf;AAAA,EAAC,GAAUkB,EAAA,eAAa,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIhB;AAAA,EAAC,GAAUmB,EAAA,aAAW,SAASH,GAAE;AAAQ,WAAAD,EAAEC,CAAC,MAAIT;AAAA,EAAC,GAClOY,EAAA,qBAAmB,SAASH,GAAE;AAAO,WAAW,OAAOA,KAAlB,YAAkC,OAAOA,KAApB,cAAuBA,MAAIjB,KAAGiB,MAAIX,KAAGW,MAAIf,KAAGe,MAAIhB,KAAGgB,MAAIT,KAAGS,MAAIR,KAAc,OAAOQ,KAAlB,YAA4BA,MAAP,SAAWA,EAAE,aAAWN,KAAGM,EAAE,aAAWP,KAAGO,EAAE,aAAWd,KAAGc,EAAE,aAAWb,KAAGa,EAAE,aAAWV,KAAGU,EAAE,aAAWJ,KAAGI,EAAE,aAAWH,KAAGG,EAAE,aAAWF,KAAGE,EAAE,aAAWL;AAAA,EAAE,GAAEQ,EAAA,SAAeJ;;","x_google_ignoreList":[0]}

package/dist/index.es236.js

@@ -1,11 +1,99 @@
-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 { __exports as e } from "./index.es270.js";
+var A;
+function er() {
+  if (A)
+    return e;
+  A = 1;
+  /** @license React v16.13.1
+   * react-is.development.js
+   *
+   * Copyright (c) Facebook, Inc. and its affiliates.
+   *
+   * This source code is licensed under the MIT license found in the
+   * LICENSE file in the root directory of this source tree.
+   */
+  return process.env.NODE_ENV !== "production" && function() {
+    var o = typeof Symbol == "function" && Symbol.for, d = o ? Symbol.for("react.element") : 60103, v = o ? Symbol.for("react.portal") : 60106, n = o ? Symbol.for("react.fragment") : 60107, a = o ? Symbol.for("react.strict_mode") : 60108, s = o ? Symbol.for("react.profiler") : 60114, c = o ? Symbol.for("react.provider") : 60109, i = o ? Symbol.for("react.context") : 60110, T = o ? Symbol.for("react.async_mode") : 60111, f = o ? Symbol.for("react.concurrent_mode") : 60111, u = o ? Symbol.for("react.forward_ref") : 60112, E = o ? Symbol.for("react.suspense") : 60113, y = o ? Symbol.for("react.suspense_list") : 60120, l = o ? Symbol.for("react.memo") : 60115, m = o ? Symbol.for("react.lazy") : 60116, M = o ? Symbol.for("react.block") : 60121, b = o ? Symbol.for("react.fundamental") : 60117, p = o ? Symbol.for("react.responder") : 60118, Y = o ? Symbol.for("react.scope") : 60119;
+    function $(r) {
+      return typeof r == "string" || typeof r == "function" || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.
+      r === n || r === f || r === s || r === a || r === E || r === y || typeof r == "object" && r !== null && (r.$$typeof === m || r.$$typeof === l || r.$$typeof === c || r.$$typeof === i || r.$$typeof === u || r.$$typeof === b || r.$$typeof === p || r.$$typeof === Y || r.$$typeof === M);
+    }
+    function t(r) {
+      if (typeof r == "object" && r !== null) {
+        var C = r.$$typeof;
+        switch (C) {
+          case d:
+            var _ = r.type;
+            switch (_) {
+              case T:
+              case f:
+              case n:
+              case s:
+              case a:
+              case E:
+                return _;
+              default:
+                var P = _ && _.$$typeof;
+                switch (P) {
+                  case i:
+                  case u:
+                  case m:
+                  case l:
+                  case c:
+                    return P;
+                  default:
+                    return C;
+                }
+            }
+          case v:
+            return C;
+        }
+      }
+    }
+    var O = T, F = f, N = i, x = c, I = d, L = u, h = n, w = m, D = l, g = v, z = s, U = a, V = E, R = !1;
+    function q(r) {
+      return R || (R = !0, console.warn("The ReactIs.isAsyncMode() alias has been deprecated, and will be removed in React 17+. Update your code to use ReactIs.isConcurrentMode() instead. It has the exact same API.")), S(r) || t(r) === T;
+    }
+    function S(r) {
+      return t(r) === f;
+    }
+    function W(r) {
+      return t(r) === i;
+    }
+    function k(r) {
+      return t(r) === c;
+    }
+    function B(r) {
+      return typeof r == "object" && r !== null && r.$$typeof === d;
+    }
+    function G(r) {
+      return t(r) === u;
+    }
+    function K(r) {
+      return t(r) === n;
+    }
+    function X(r) {
+      return t(r) === m;
+    }
+    function Z(r) {
+      return t(r) === l;
+    }
+    function H(r) {
+      return t(r) === v;
+    }
+    function J(r) {
+      return t(r) === s;
+    }
+    function Q(r) {
+      return t(r) === a;
+    }
+    function j(r) {
+      return t(r) === E;
+    }
+    e.AsyncMode = O, e.ConcurrentMode = F, e.ContextConsumer = N, e.ContextProvider = x, e.Element = I, e.ForwardRef = L, e.Fragment = h, e.Lazy = w, e.Memo = D, e.Portal = g, e.Profiler = z, e.StrictMode = U, e.Suspense = V, e.isAsyncMode = q, e.isConcurrentMode = S, e.isContextConsumer = W, e.isContextProvider = k, e.isElement = B, e.isForwardRef = G, e.isFragment = K, e.isLazy = X, e.isMemo = Z, e.isPortal = H, e.isProfiler = J, e.isStrictMode = Q, e.isSuspense = j, e.isValidElementType = $, e.typeOf = t;
+  }(), e;
 }
 export {
-  r as default
+  er as __require
 };
 //# sourceMappingURL=index.es236.js.map

package/dist/index.es236.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es236.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.es236.js","sources":["../../../node_modules/react-is/cjs/react-is.development.js"],"sourcesContent":["/** @license React v16.13.1\n * react-is.development.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';\n\n\n\nif (process.env.NODE_ENV !== \"production\") {\n  (function() {\n'use strict';\n\n// The Symbol used to tag the ReactElement-like types. If there is no native Symbol\n// nor polyfill, then a plain number is used for performance.\nvar hasSymbol = typeof Symbol === 'function' && Symbol.for;\nvar REACT_ELEMENT_TYPE = hasSymbol ? Symbol.for('react.element') : 0xeac7;\nvar REACT_PORTAL_TYPE = hasSymbol ? Symbol.for('react.portal') : 0xeaca;\nvar REACT_FRAGMENT_TYPE = hasSymbol ? Symbol.for('react.fragment') : 0xeacb;\nvar REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol.for('react.strict_mode') : 0xeacc;\nvar REACT_PROFILER_TYPE = hasSymbol ? Symbol.for('react.profiler') : 0xead2;\nvar REACT_PROVIDER_TYPE = hasSymbol ? Symbol.for('react.provider') : 0xeacd;\nvar REACT_CONTEXT_TYPE = hasSymbol ? Symbol.for('react.context') : 0xeace; // TODO: We don't use AsyncMode or ConcurrentMode anymore. They were temporary\n// (unstable) APIs that have been removed. Can we remove the symbols?\n\nvar REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol.for('react.async_mode') : 0xeacf;\nvar REACT_CONCURRENT_MODE_TYPE = hasSymbol ? Symbol.for('react.concurrent_mode') : 0xeacf;\nvar REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol.for('react.forward_ref') : 0xead0;\nvar REACT_SUSPENSE_TYPE = hasSymbol ? Symbol.for('react.suspense') : 0xead1;\nvar REACT_SUSPENSE_LIST_TYPE = hasSymbol ? Symbol.for('react.suspense_list') : 0xead8;\nvar REACT_MEMO_TYPE = hasSymbol ? Symbol.for('react.memo') : 0xead3;\nvar REACT_LAZY_TYPE = hasSymbol ? Symbol.for('react.lazy') : 0xead4;\nvar REACT_BLOCK_TYPE = hasSymbol ? Symbol.for('react.block') : 0xead9;\nvar REACT_FUNDAMENTAL_TYPE = hasSymbol ? Symbol.for('react.fundamental') : 0xead5;\nvar REACT_RESPONDER_TYPE = hasSymbol ? Symbol.for('react.responder') : 0xead6;\nvar REACT_SCOPE_TYPE = hasSymbol ? Symbol.for('react.scope') : 0xead7;\n\nfunction isValidElementType(type) {\n  return typeof type === 'string' || typeof type === 'function' || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.\n  type === REACT_FRAGMENT_TYPE || type === REACT_CONCURRENT_MODE_TYPE || type === REACT_PROFILER_TYPE || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || typeof type === 'object' && type !== null && (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_FUNDAMENTAL_TYPE || type.$$typeof === REACT_RESPONDER_TYPE || type.$$typeof === REACT_SCOPE_TYPE || type.$$typeof === REACT_BLOCK_TYPE);\n}\n\nfunction typeOf(object) {\n  if (typeof object === 'object' && object !== null) {\n    var $$typeof = object.$$typeof;\n\n    switch ($$typeof) {\n      case REACT_ELEMENT_TYPE:\n        var type = object.type;\n\n        switch (type) {\n          case REACT_ASYNC_MODE_TYPE:\n          case REACT_CONCURRENT_MODE_TYPE:\n          case REACT_FRAGMENT_TYPE:\n          case REACT_PROFILER_TYPE:\n          case REACT_STRICT_MODE_TYPE:\n          case REACT_SUSPENSE_TYPE:\n            return type;\n\n          default:\n            var $$typeofType = type && type.$$typeof;\n\n            switch ($$typeofType) {\n              case REACT_CONTEXT_TYPE:\n              case REACT_FORWARD_REF_TYPE:\n              case REACT_LAZY_TYPE:\n              case REACT_MEMO_TYPE:\n              case REACT_PROVIDER_TYPE:\n                return $$typeofType;\n\n              default:\n                return $$typeof;\n            }\n\n        }\n\n      case REACT_PORTAL_TYPE:\n        return $$typeof;\n    }\n  }\n\n  return undefined;\n} // AsyncMode is deprecated along with isAsyncMode\n\nvar AsyncMode = REACT_ASYNC_MODE_TYPE;\nvar ConcurrentMode = REACT_CONCURRENT_MODE_TYPE;\nvar ContextConsumer = REACT_CONTEXT_TYPE;\nvar ContextProvider = REACT_PROVIDER_TYPE;\nvar Element = REACT_ELEMENT_TYPE;\nvar ForwardRef = REACT_FORWARD_REF_TYPE;\nvar Fragment = REACT_FRAGMENT_TYPE;\nvar Lazy = REACT_LAZY_TYPE;\nvar Memo = REACT_MEMO_TYPE;\nvar Portal = REACT_PORTAL_TYPE;\nvar Profiler = REACT_PROFILER_TYPE;\nvar StrictMode = REACT_STRICT_MODE_TYPE;\nvar Suspense = REACT_SUSPENSE_TYPE;\nvar hasWarnedAboutDeprecatedIsAsyncMode = false; // AsyncMode should be deprecated\n\nfunction isAsyncMode(object) {\n  {\n    if (!hasWarnedAboutDeprecatedIsAsyncMode) {\n      hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint\n\n      console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');\n    }\n  }\n\n  return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;\n}\nfunction isConcurrentMode(object) {\n  return typeOf(object) === REACT_CONCURRENT_MODE_TYPE;\n}\nfunction isContextConsumer(object) {\n  return typeOf(object) === REACT_CONTEXT_TYPE;\n}\nfunction isContextProvider(object) {\n  return typeOf(object) === REACT_PROVIDER_TYPE;\n}\nfunction isElement(object) {\n  return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;\n}\nfunction isForwardRef(object) {\n  return typeOf(object) === REACT_FORWARD_REF_TYPE;\n}\nfunction isFragment(object) {\n  return typeOf(object) === REACT_FRAGMENT_TYPE;\n}\nfunction isLazy(object) {\n  return typeOf(object) === REACT_LAZY_TYPE;\n}\nfunction isMemo(object) {\n  return typeOf(object) === REACT_MEMO_TYPE;\n}\nfunction isPortal(object) {\n  return typeOf(object) === REACT_PORTAL_TYPE;\n}\nfunction isProfiler(object) {\n  return typeOf(object) === REACT_PROFILER_TYPE;\n}\nfunction isStrictMode(object) {\n  return typeOf(object) === REACT_STRICT_MODE_TYPE;\n}\nfunction isSuspense(object) {\n  return typeOf(object) === REACT_SUSPENSE_TYPE;\n}\n\nexports.AsyncMode = AsyncMode;\nexports.ConcurrentMode = ConcurrentMode;\nexports.ContextConsumer = ContextConsumer;\nexports.ContextProvider = ContextProvider;\nexports.Element = Element;\nexports.ForwardRef = ForwardRef;\nexports.Fragment = Fragment;\nexports.Lazy = Lazy;\nexports.Memo = Memo;\nexports.Portal = Portal;\nexports.Profiler = Profiler;\nexports.StrictMode = StrictMode;\nexports.Suspense = Suspense;\nexports.isAsyncMode = isAsyncMode;\nexports.isConcurrentMode = isConcurrentMode;\nexports.isContextConsumer = isContextConsumer;\nexports.isContextProvider = isContextProvider;\nexports.isElement = isElement;\nexports.isForwardRef = isForwardRef;\nexports.isFragment = isFragment;\nexports.isLazy = isLazy;\nexports.isMemo = isMemo;\nexports.isPortal = isPortal;\nexports.isProfiler = isProfiler;\nexports.isStrictMode = isStrictMode;\nexports.isSuspense = isSuspense;\nexports.isValidElementType = isValidElementType;\nexports.typeOf = typeOf;\n  })();\n}\n"],"names":["hasSymbol","REACT_ELEMENT_TYPE","REACT_PORTAL_TYPE","REACT_FRAGMENT_TYPE","REACT_STRICT_MODE_TYPE","REACT_PROFILER_TYPE","REACT_PROVIDER_TYPE","REACT_CONTEXT_TYPE","REACT_ASYNC_MODE_TYPE","REACT_CONCURRENT_MODE_TYPE","REACT_FORWARD_REF_TYPE","REACT_SUSPENSE_TYPE","REACT_SUSPENSE_LIST_TYPE","REACT_MEMO_TYPE","REACT_LAZY_TYPE","REACT_BLOCK_TYPE","REACT_FUNDAMENTAL_TYPE","REACT_RESPONDER_TYPE","REACT_SCOPE_TYPE","isValidElementType","type","typeOf","object","$$typeof","$$typeofType","AsyncMode","ConcurrentMode","ContextConsumer","ContextProvider","Element","ForwardRef","Fragment","Lazy","Memo","Portal","Profiler","StrictMode","Suspense","hasWarnedAboutDeprecatedIsAsyncMode","isAsyncMode","isConcurrentMode","isContextConsumer","isContextProvider","isElement","isForwardRef","isFragment","isLazy","isMemo","isPortal","isProfiler","isStrictMode","isSuspense","reactIs_development"],"mappings":";;;;;;EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAaA,SAAI,QAAQ,IAAI,aAAa,gBAC1B,WAAW;AAKd,QAAIA,IAAY,OAAO,UAAW,cAAc,OAAO,KACnDC,IAAqBD,IAAY,OAAO,IAAI,eAAe,IAAI,OAC/DE,IAAoBF,IAAY,OAAO,IAAI,cAAc,IAAI,OAC7DG,IAAsBH,IAAY,OAAO,IAAI,gBAAgB,IAAI,OACjEI,IAAyBJ,IAAY,OAAO,IAAI,mBAAmB,IAAI,OACvEK,IAAsBL,IAAY,OAAO,IAAI,gBAAgB,IAAI,OACjEM,IAAsBN,IAAY,OAAO,IAAI,gBAAgB,IAAI,OACjEO,IAAqBP,IAAY,OAAO,IAAI,eAAe,IAAI,OAG/DQ,IAAwBR,IAAY,OAAO,IAAI,kBAAkB,IAAI,OACrES,IAA6BT,IAAY,OAAO,IAAI,uBAAuB,IAAI,OAC/EU,IAAyBV,IAAY,OAAO,IAAI,mBAAmB,IAAI,OACvEW,IAAsBX,IAAY,OAAO,IAAI,gBAAgB,IAAI,OACjEY,IAA2BZ,IAAY,OAAO,IAAI,qBAAqB,IAAI,OAC3Ea,IAAkBb,IAAY,OAAO,IAAI,YAAY,IAAI,OACzDc,IAAkBd,IAAY,OAAO,IAAI,YAAY,IAAI,OACzDe,IAAmBf,IAAY,OAAO,IAAI,aAAa,IAAI,OAC3DgB,IAAyBhB,IAAY,OAAO,IAAI,mBAAmB,IAAI,OACvEiB,IAAuBjB,IAAY,OAAO,IAAI,iBAAiB,IAAI,OACnEkB,IAAmBlB,IAAY,OAAO,IAAI,aAAa,IAAI;AAE/D,aAASmB,EAAmBC,GAAM;AAChC,aAAO,OAAOA,KAAS,YAAY,OAAOA,KAAS;AAAA,MACnDA,MAASjB,KAAuBiB,MAASX,KAA8BW,MAASf,KAAuBe,MAAShB,KAA0BgB,MAAST,KAAuBS,MAASR,KAA4B,OAAOQ,KAAS,YAAYA,MAAS,SAASA,EAAK,aAAaN,KAAmBM,EAAK,aAAaP,KAAmBO,EAAK,aAAad,KAAuBc,EAAK,aAAab,KAAsBa,EAAK,aAAaV,KAA0BU,EAAK,aAAaJ,KAA0BI,EAAK,aAAaH,KAAwBG,EAAK,aAAaF,KAAoBE,EAAK,aAAaL;AAAA,IACplB;AAEA,aAASM,EAAOC,GAAQ;AACtB,UAAI,OAAOA,KAAW,YAAYA,MAAW,MAAM;AACjD,YAAIC,IAAWD,EAAO;AAEtB,gBAAQC,GAAU;AAAA,UAChB,KAAKtB;AACH,gBAAImB,IAAOE,EAAO;AAElB,oBAAQF,GAAM;AAAA,cACZ,KAAKZ;AAAA,cACL,KAAKC;AAAA,cACL,KAAKN;AAAA,cACL,KAAKE;AAAA,cACL,KAAKD;AAAA,cACL,KAAKO;AACI,uBAAAS;AAAA,cAET;AACM,oBAAAI,IAAeJ,KAAQA,EAAK;AAEhC,wBAAQI,GAAc;AAAA,kBACpB,KAAKjB;AAAA,kBACL,KAAKG;AAAA,kBACL,KAAKI;AAAA,kBACL,KAAKD;AAAA,kBACL,KAAKP;AACI,2BAAAkB;AAAA,kBAET;AACS,2BAAAD;AAAA,gBACX;AAAA,YAEJ;AAAA,UAEF,KAAKrB;AACI,mBAAAqB;AAAA,QACX;AAAA,MACF;AAAA,IAGF;AAEA,QAAIE,IAAYjB,GACZkB,IAAiBjB,GACjBkB,IAAkBpB,GAClBqB,IAAkBtB,GAClBuB,IAAU5B,GACV6B,IAAapB,GACbqB,IAAW5B,GACX6B,IAAOlB,GACPmB,IAAOpB,GACPqB,IAAShC,GACTiC,IAAW9B,GACX+B,IAAahC,GACbiC,IAAW1B,GACX2B,IAAsC;AAE1C,aAASC,EAAYjB,GAAQ;AAEzB,aAAKgB,MACmCA,IAAA,IAE9B,QAAA,KAAQ,+KAAyL,IAItME,EAAiBlB,CAAM,KAAKD,EAAOC,CAAM,MAAMd;AAAA,IACxD;AACA,aAASgC,EAAiBlB,GAAQ;AACzB,aAAAD,EAAOC,CAAM,MAAMb;AAAA,IAC5B;AACA,aAASgC,EAAkBnB,GAAQ;AAC1B,aAAAD,EAAOC,CAAM,MAAMf;AAAA,IAC5B;AACA,aAASmC,EAAkBpB,GAAQ;AAC1B,aAAAD,EAAOC,CAAM,MAAMhB;AAAA,IAC5B;AACA,aAASqC,EAAUrB,GAAQ;AACzB,aAAO,OAAOA,KAAW,YAAYA,MAAW,QAAQA,EAAO,aAAarB;AAAA,IAC9E;AACA,aAAS2C,EAAatB,GAAQ;AACrB,aAAAD,EAAOC,CAAM,MAAMZ;AAAA,IAC5B;AACA,aAASmC,EAAWvB,GAAQ;AACnB,aAAAD,EAAOC,CAAM,MAAMnB;AAAA,IAC5B;AACA,aAAS2C,EAAOxB,GAAQ;AACf,aAAAD,EAAOC,CAAM,MAAMR;AAAA,IAC5B;AACA,aAASiC,EAAOzB,GAAQ;AACf,aAAAD,EAAOC,CAAM,MAAMT;AAAA,IAC5B;AACA,aAASmC,EAAS1B,GAAQ;AACjB,aAAAD,EAAOC,CAAM,MAAMpB;AAAA,IAC5B;AACA,aAAS+C,EAAW3B,GAAQ;AACnB,aAAAD,EAAOC,CAAM,MAAMjB;AAAA,IAC5B;AACA,aAAS6C,EAAa5B,GAAQ;AACrB,aAAAD,EAAOC,CAAM,MAAMlB;AAAA,IAC5B;AACA,aAAS+C,EAAW7B,GAAQ;AACnB,aAAAD,EAAOC,CAAM,MAAMX;AAAA,IAC5B;AAEA,IAAAyC,EAAA,YAAoB3B,GACpB2B,EAAA,iBAAyB1B,GACzB0B,EAAA,kBAA0BzB,GAC1ByB,EAAA,kBAA0BxB,GAC1BwB,EAAA,UAAkBvB,GAClBuB,EAAA,aAAqBtB,GACrBsB,EAAA,WAAmBrB,GACnBqB,EAAA,OAAepB,GACfoB,EAAA,OAAenB,GACfmB,EAAA,SAAiBlB,GACjBkB,EAAA,WAAmBjB,GACnBiB,EAAA,aAAqBhB,GACrBgB,EAAA,WAAmBf,GACnBe,EAAA,cAAsBb,GACtBa,EAAA,mBAA2BZ,GAC3BY,EAAA,oBAA4BX,GAC5BW,EAAA,oBAA4BV,GAC5BU,EAAA,YAAoBT,GACpBS,EAAA,eAAuBR,GACvBQ,EAAA,aAAqBP,GACrBO,EAAA,SAAiBN,GACjBM,EAAA,SAAiBL,GACjBK,EAAA,WAAmBJ,GACnBI,EAAA,aAAqBH,GACrBG,EAAA,eAAuBF,GACvBE,EAAA,aAAqBD,GACrBC,EAAA,qBAA6BjC,GAC7BiC,EAAA,SAAiB/B;AAAA,EAAA;;","x_google_ignoreList":[0]}