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

package/dist/index.es186.js

@@ -1,26 +1,56 @@
-import e from "./index.es71.js";
-import n from "react";
-function t(i) {
-  var o = i.node, r = o === void 0 ? {
-    x: 0,
-    y: 0,
-    r: 15
-  } : o;
-  return /* @__PURE__ */ n.createElement("circle", {
-    cx: r.x,
-    cy: r.y,
-    r: r.r || 15,
-    fill: "#21D4FD"
-  });
-}
-t.propTypes = {
-  node: e.shape({
-    x: e.number.isRequired,
-    y: e.number.isRequired,
-    r: e.number
-  })
-};
+import { slice as g } from "./index.es268.js";
+import p from "./index.es269.js";
+import { x as v, y as h } from "./index.es270.js";
+import c from "./index.es267.js";
+import k from "./index.es187.js";
+function T(n) {
+  return n.source;
+}
+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;
+}
 export {
-  t as default
+  S as linkHorizontal,
+  q as linkRadial,
+  j as linkVertical
 };
 //# sourceMappingURL=index.es186.js.map

package/dist/index.es186.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es186.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n  var _ref$node = _ref.node,\n    node = _ref$node === void 0 ? {\n      x: 0,\n      y: 0,\n      r: 15\n    } : _ref$node;\n  return /*#__PURE__*/React.createElement(\"circle\", {\n    cx: node.x,\n    cy: node.y,\n    r: node.r || 15,\n    fill: \"#21D4FD\"\n  });\n}\nHierarchyDefaultNode.propTypes = {\n  node: _pt.shape({\n    x: _pt.number.isRequired,\n    y: _pt.number.isRequired,\n    r: _pt.number\n  })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es186.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]}

package/dist/index.es187.js

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

package/dist/index.es187.js.map

@@ -1 +1 @@
-{"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]}
+{"version":3,"file":"index.es187.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]}

package/dist/index.es188.js

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

package/dist/index.es19.js

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

package/dist/index.es192.js

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

package/dist/index.es193.js

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

package/dist/index.es194.js

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

package/dist/index.es196.js

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

package/dist/index.es198.js

@@ -1,11 +1,9 @@
-import { toString as n } from "./index.es6.js";
-function a(t) {
-  var r = "[object " + t + "]";
-  return function(e) {
-    return n.call(e) === r;
-  };
+function n(t) {
+  var e = typeof t;
+  return t != null && (e == "object" || e == "function");
 }
+var c = n;
 export {
-  a as default
+  c as i
 };
 //# sourceMappingURL=index.es198.js.map

package/dist/index.es198.js.map

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

@@ -1,8 +1,8 @@
-import { hasOwnProperty as a } from "./index.es6.js";
-function n(r, t) {
-  return r != null && a.call(r, t);
-}
+import { _ as o } from "./index.es257.js";
+var r = o, n = function() {
+  return r.Date.now();
+}, a = n;
 export {
-  n as default
+  a as n
 };
 //# sourceMappingURL=index.es199.js.map

package/dist/index.es199.js.map

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

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

package/dist/index.es200.js

@@ -1,7 +1,24 @@
-import e from "./index.es254.js";
-import t from "./index.es202.js";
-const f = e(t);
+import { _ as o } from "./index.es258.js";
+import { i as n } from "./index.es198.js";
+import { i as m } from "./index.es259.js";
+var b = o, s = n, e = m, f = NaN, p = /^[-+]0x[0-9a-f]+$/i, y = /^0b[01]+$/i, a = /^0o[0-7]+$/i, c = parseInt;
+function I(r) {
+  if (typeof r == "number")
+    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 {
-  f as default
+  x as t
 };
 //# sourceMappingURL=index.es200.js.map

package/dist/index.es200.js.map

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

@@ -1,6 +1,11 @@
-import t from "./index.es252.js";
-const o = t("length");
+import { toString as n } from "./index.es6.js";
+function a(t) {
+  var r = "[object " + t + "]";
+  return function(e) {
+    return n.call(e) === r;
+  };
+}
 export {
-  o as default
+  a as default
 };
 //# sourceMappingURL=index.es201.js.map

package/dist/index.es201.js.map

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

@@ -1,6 +1,8 @@
-import t from "./index.es252.js";
-const o = t("byteLength");
+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.es202.js.map

package/dist/index.es202.js.map

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

@@ -1,12 +1,7 @@
-import e from "./index.es202.js";
-function i(t) {
-  return new Uint8Array(
-    t.buffer || t,
-    t.byteOffset || 0,
-    e(t)
-  );
-}
+import e from "./index.es262.js";
+import t from "./index.es205.js";
+const f = e(t);
 export {
-  i as default
+  f as default
 };
 //# sourceMappingURL=index.es203.js.map

package/dist/index.es203.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es203.js","sources":["../../../node_modules/underscore/modules/_toBufferView.js"],"sourcesContent":["import getByteLength from './_getByteLength.js';\n\n// Internal function to wrap or shallow-copy an ArrayBuffer,\n// typed array or DataView to a new view, reusing the buffer.\nexport default function toBufferView(bufferSource) {\n  return new Uint8Array(\n    bufferSource.buffer || bufferSource,\n    bufferSource.byteOffset || 0,\n    getByteLength(bufferSource)\n  );\n}\n"],"names":["toBufferView","bufferSource","getByteLength"],"mappings":";AAIA,SAAwBA,EAAaC,GAAc;AACjD,SAAO,IAAI;AAAA,IACTA,EAAa,UAAUA;AAAA,IACvBA,EAAa,cAAc;AAAA,IAC3BC,EAAcD,CAAY;AAAA,EAAA;AAE9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es203.js","sources":["../../../node_modules/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.es204.js

@@ -1,25 +1,6 @@
-import o from "./index.es201.js";
-import f from "./index.es7.js";
-import m from "./index.es101.js";
-function v(e) {
-  var l = o(e);
-  return function(r) {
-    if (r == null)
-      return !1;
-    var s = m(r);
-    if (o(s))
-      return !1;
-    for (var a = 0; a < l; a++)
-      if (!f(r[e[a]]))
-        return !1;
-    return e !== u || !f(r[t]);
-  };
-}
-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);
+import t from "./index.es261.js";
+const o = t("length");
 export {
-  v as ie11fingerprint,
-  d as mapMethods,
-  M as setMethods,
-  u as weakMapMethods
+  o as default
 };
 //# sourceMappingURL=index.es204.js.map

package/dist/index.es204.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es204.js","sources":["../../../node_modules/underscore/modules/_methodFingerprint.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isFunction from './isFunction.js';\nimport allKeys from './allKeys.js';\n\n// Since the regular `Object.prototype.toString` type tests don't work for\n// some types in IE 11, we use a fingerprinting heuristic instead, based\n// on the methods. It's not great, but it's the best we got.\n// The fingerprint method lists are defined below.\nexport function ie11fingerprint(methods) {\n  var length = getLength(methods);\n  return function(obj) {\n    if (obj == null) return false;\n    // `Map`, `WeakMap` and `Set` have no enumerable keys.\n    var keys = allKeys(obj);\n    if (getLength(keys)) return false;\n    for (var i = 0; i < length; i++) {\n      if (!isFunction(obj[methods[i]])) return false;\n    }\n    // If we are testing against `WeakMap`, we need to ensure that\n    // `obj` doesn't have a `forEach` method in order to distinguish\n    // it from a regular `Map`.\n    return methods !== weakMapMethods || !isFunction(obj[forEachName]);\n  };\n}\n\n// In the interest of compact minification, we write\n// each string in the fingerprints only once.\nvar forEachName = 'forEach',\n    hasName = 'has',\n    commonInit = ['clear', 'delete'],\n    mapTail = ['get', hasName, 'set'];\n\n// `Map`, `WeakMap` and `Set` each have slightly different\n// combinations of the above sublists.\nexport var mapMethods = commonInit.concat(forEachName, mapTail),\n    weakMapMethods = commonInit.concat(mapTail),\n    setMethods = ['add'].concat(commonInit, forEachName, hasName);\n"],"names":["ie11fingerprint","methods","length","getLength","obj","keys","allKeys","i","isFunction","weakMapMethods","forEachName","hasName","commonInit","mapTail","mapMethods","setMethods"],"mappings":";;;AAQO,SAASA,EAAgBC,GAAS;AACnC,MAAAC,IAASC,EAAUF,CAAO;AAC9B,SAAO,SAASG,GAAK;AACnB,QAAIA,KAAO;AAAa,aAAA;AAEpB,QAAAC,IAAOC,EAAQF,CAAG;AACtB,QAAID,EAAUE,CAAI;AAAU,aAAA;AAC5B,aAASE,IAAI,GAAGA,IAAIL,GAAQK;AAC1B,UAAI,CAACC,EAAWJ,EAAIH,EAAQM,CAAC,CAAC,CAAC;AAAU,eAAA;AAK3C,WAAON,MAAYQ,KAAkB,CAACD,EAAWJ,EAAIM,CAAW,CAAC;AAAA,EAAA;AAErE;AAIA,IAAIA,IAAc,WACdC,IAAU,OACVC,IAAa,CAAC,SAAS,QAAQ,GAC/BC,IAAU,CAAC,OAAOF,GAAS,KAAK,GAIzBG,IAAaF,EAAW,OAAOF,GAAaG,CAAO,GAC1DJ,IAAiBG,EAAW,OAAOC,CAAO,GAC1CE,IAAa,CAAC,KAAK,EAAE,OAAOH,GAAYF,GAAaC,CAAO;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es204.js","sources":["../../../node_modules/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.es205.js

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