@performant-software/visualize 2.2.24-beta.13 → 2.2.24-beta.15

package/dist/index.es82.js

@@ -1,88 +1,9 @@
-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;
-  }
-  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;
+import { _isNaN as i } from "./index.es6.js";
+import t from "./index.es73.js";
+function N(r) {
+  return t(r) && i(r);
 }
 export {
-  L as default
+  N as default
 };
 //# sourceMappingURL=index.es82.js.map

package/dist/index.es82.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es82.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.es82.js","sources":["../../../node_modules/underscore/modules/isNaN.js"],"sourcesContent":["import { _isNaN } from './_setup.js';\nimport isNumber from './isNumber.js';\n\n// Is the given value `NaN`?\nexport default function isNaN(obj) {\n  return isNumber(obj) && _isNaN(obj);\n}\n"],"names":["isNaN","obj","isNumber","_isNaN"],"mappings":";;AAIA,SAAwBA,EAAMC,GAAK;AACjC,SAAOC,EAASD,CAAG,KAAKE,EAAOF,CAAG;AACpC;","x_google_ignoreList":[0]}

package/dist/index.es83.js

@@ -1,276 +1,13 @@
-import { VERSION as r } from "./index.es6.js";
-import { default as o } from "./index.es85.js";
-import { default as l } from "./index.es86.js";
-import { default as u } from "./index.es87.js";
-import { default as m } from "./index.es88.js";
-import { default as i } from "./index.es89.js";
-import { default as c } from "./index.es90.js";
-import { default as h } from "./index.es91.js";
-import { default as b } from "./index.es92.js";
-import { default as A } from "./index.es93.js";
-import { default as O } from "./index.es94.js";
-import { default as B } from "./index.es95.js";
-import { default as S } from "./index.es96.js";
-import { default as N } from "./index.es97.js";
-import { default as v } from "./index.es98.js";
-import { default as M } from "./index.es99.js";
-import { default as W } from "./index.es7.js";
-import { default as F } from "./index.es9.js";
-import { default as V } from "./index.es100.js";
-import { default as P } from "./index.es101.js";
-import { default as U } from "./index.es102.js";
-import { default as G } from "./index.es103.js";
-import { default as J } from "./index.es104.js";
-import { default as X } from "./index.es105.js";
-import { default as Z } from "./index.es11.js";
-import { default as $ } from "./index.es12.js";
-import { default as te } from "./index.es13.js";
-import { default as re } from "./index.es106.js";
-import { default as oe } from "./index.es107.js";
-import { default as le } from "./index.es108.js";
-import { default as ue } from "./index.es109.js";
-import { default as me } from "./index.es110.js";
-import { default as ie } from "./index.es111.js";
-import { default as ce, default as ye } from "./index.es112.js";
-import { default as ge } from "./index.es113.js";
-import { default as ke, default as Ae } from "./index.es114.js";
-import { default as Oe } from "./index.es115.js";
-import { default as Be } from "./index.es116.js";
-import { default as Se } from "./index.es117.js";
-import { default as Ne } from "./index.es118.js";
-import { default as ve } from "./index.es119.js";
-import { default as Me } from "./index.es120.js";
-import { default as We } from "./index.es121.js";
-import { default as Fe } from "./index.es122.js";
-import { default as Ve } from "./index.es123.js";
-import { default as Pe } from "./index.es124.js";
-import { default as Ue } from "./index.es14.js";
-import { default as Ge } from "./index.es125.js";
-import { default as Je } from "./index.es126.js";
-import { default as Xe, default as Ye } from "./index.es127.js";
-import { default as _e } from "./index.es128.js";
-import { default as et } from "./index.es129.js";
-import { default as at } from "./index.es130.js";
-import { default as ft } from "./index.es16.js";
-import { default as st } from "./index.es17.js";
-import { default as dt } from "./index.es18.js";
-import { default as pt } from "./index.es131.js";
-import { default as xt } from "./index.es132.js";
-import { default as nt } from "./index.es133.js";
-import { default as yt } from "./index.es134.js";
-import { default as gt } from "./index.es15.js";
-import { default as kt } from "./index.es19.js";
-import { default as Et } from "./index.es20.js";
-import { default as wt } from "./index.es21.js";
-import { default as It } from "./index.es135.js";
-import { default as jt } from "./index.es22.js";
-import { default as qt } from "./index.es23.js";
-import { default as zt } from "./index.es136.js";
-import { default as Rt } from "./index.es137.js";
-import { default as Dt } from "./index.es138.js";
-import { default as Kt } from "./index.es139.js";
-import { default as Lt } from "./index.es140.js";
-import { default as Tt } from "./index.es141.js";
-import { default as Ct } from "./index.es142.js";
-import { default as Ht } from "./index.es24.js";
-import { default as Qt } from "./index.es143.js";
-import { default as Yt } from "./index.es144.js";
-import { default as _t } from "./index.es145.js";
-import { default as ea } from "./index.es146.js";
-import { default as aa } from "./index.es147.js";
-import { default as fa } from "./index.es148.js";
-import { default as sa, default as la } from "./index.es149.js";
-import { default as ua } from "./index.es150.js";
-import { default as ma, default as xa } from "./index.es151.js";
-import { default as na, default as ca } from "./index.es152.js";
-import { default as ha, default as ga, default as ba } from "./index.es153.js";
-import { default as Aa, default as Ea } from "./index.es154.js";
-import { default as wa, default as Ba } from "./index.es155.js";
-import { default as Sa } from "./index.es156.js";
-import { default as Na, default as qa } from "./index.es157.js";
-import { default as za, default as Ma } from "./index.es158.js";
-import { default as Wa, default as Da, default as Fa } from "./index.es159.js";
-import { default as Va } from "./index.es25.js";
-import { default as Pa } from "./index.es160.js";
-import { default as Ua } from "./index.es161.js";
-import { default as Ga } from "./index.es162.js";
-import { default as Ja } from "./index.es163.js";
-import { default as Xa } from "./index.es164.js";
-import { default as Za } from "./index.es165.js";
-import { default as $a } from "./index.es166.js";
-import { default as tr } from "./index.es167.js";
-import { default as rr } from "./index.es168.js";
-import { default as or } from "./index.es169.js";
-import { default as lr } from "./index.es170.js";
-import { default as ur } from "./index.es171.js";
-import { default as mr } from "./index.es172.js";
-import { default as ir } from "./index.es26.js";
-import { default as cr } from "./index.es27.js";
-import { default as hr, default as gr, default as br } from "./index.es173.js";
-import { default as Ar } from "./index.es174.js";
-import { default as Or } from "./index.es175.js";
-import { default as Br, default as Ir, default as Sr } from "./index.es176.js";
-import { default as Nr } from "./index.es177.js";
-import { default as vr } from "./index.es178.js";
-import { default as Mr } from "./index.es28.js";
-import { default as Wr, default as Dr } from "./index.es179.js";
-import { default as Kr } from "./index.es29.js";
-import { default as Lr } from "./index.es180.js";
-import { default as Tr } from "./index.es30.js";
-import { default as Cr, default as Gr } from "./index.es181.js";
-import { default as Jr } from "./index.es31.js";
-import { default as Xr } from "./index.es182.js";
-import { default as Zr } from "./index.es183.js";
-import { default as $r } from "./index.es184.js";
-import { default as tf } from "./index.es84.js";
-import "./index.es32.js";
-import { default as rf } from "./index.es10.js";
+import { supportsArrayBuffer as i, nativeIsView as t, toString as a } from "./index.es6.js";
+import e from "./index.es79.js";
+import o from "./index.es104.js";
+import n from "./index.es198.js";
+var s = /\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;
+function f(r) {
+  return t ? t(r) && !e(r) : n(r) && s.test(a.call(r));
+}
+const u = i ? f : o(!1);
 export {
-  r as VERSION,
-  Tt as after,
-  Na as all,
-  le as allKeys,
-  za as any,
-  ke as assign,
-  Ct as before,
-  Et as bind,
-  wt as bindAll,
-  yt as chain,
-  $r as chunk,
-  Se as clone,
-  na as collect,
-  Nr as compact,
-  Lt as compose,
-  Ve as constant,
-  Wa as contains,
-  or as countBy,
-  Be as create,
-  Rt as debounce,
-  rf as default,
-  Oe as defaults,
-  qt as defer,
-  jt as delay,
-  sa as detect,
-  Tr as difference,
-  Br as drop,
-  ma as each,
-  ft as escape,
-  qa as every,
-  ge as extend,
-  Ae as extendOwn,
-  wa as filter,
-  la as find,
-  Yt as findIndex,
-  Qt as findKey,
-  _t as findLastIndex,
-  ua as findWhere,
-  hr as first,
-  vr as flatten,
-  ha as foldl,
-  Aa as foldr,
-  xa as forEach,
-  ce as functions,
-  ve as get,
-  tr as groupBy,
-  Me as has,
-  gr as head,
-  Fe as identity,
-  Da as include,
-  Fa as includes,
-  rr as indexBy,
-  aa as indexOf,
-  Ar as initial,
-  ga as inject,
-  Lr as intersection,
-  ie as invert,
-  Va as invoke,
-  F as isArguments,
-  M as isArray,
-  N as isArrayBuffer,
-  i as isBoolean,
-  v as isDataView,
-  A as isDate,
-  c as isElement,
-  G as isEmpty,
-  X as isEqual,
-  B as isError,
-  V as isFinite,
-  W as isFunction,
-  Z as isMap,
-  J as isMatch,
-  P as isNaN,
-  u as isNull,
-  b as isNumber,
-  l as isObject,
-  O as isRegExp,
-  te as isSet,
-  h as isString,
-  S as isSymbol,
-  U as isTypedArray,
-  m as isUndefined,
-  $ as isWeakMap,
-  re as isWeakSet,
-  gt as iteratee,
-  oe as keys,
-  Or as last,
-  fa as lastIndexOf,
-  ca as map,
-  We as mapObject,
-  Xe as matcher,
-  Ye as matches,
-  Ga as max,
-  It as memoize,
-  ye as methods,
-  Ja as min,
-  tf as mixin,
-  Kt as negate,
-  Pe as noop,
-  at as now,
-  Xr as object,
-  cr as omit,
-  Ht as once,
-  me as pairs,
-  kt as partial,
-  lr as partition,
-  ir as pick,
-  Pa as pluck,
-  Ge as property,
-  Je as propertyOf,
-  et as random,
-  Zr as range,
-  ba as reduce,
-  Ea as reduceRight,
-  Sa as reject,
-  Ir as rest,
-  o as restArguments,
-  xt as result,
-  Za as sample,
-  Ba as select,
-  Xa as shuffle,
-  mr as size,
-  Ma as some,
-  $a as sortBy,
-  ea as sortedIndex,
-  Sr as tail,
-  br as take,
-  Ne as tap,
-  pt as template,
-  dt as templateSettings,
-  zt as throttle,
-  _e as times,
-  ur as toArray,
-  Ue as toPath,
-  Cr as transpose,
-  st as unescape,
-  Kr as union,
-  Wr as uniq,
-  Dr as unique,
-  nt as uniqueId,
-  Gr as unzip,
-  ue as values,
-  Ua as where,
-  Mr as without,
-  Dt as wrap,
-  Jr as zip
+  u as default
 };
 //# sourceMappingURL=index.es83.js.map

package/dist/index.es83.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es83.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"index.es83.js","sources":["../../../node_modules/underscore/modules/isTypedArray.js"],"sourcesContent":["import { supportsArrayBuffer, nativeIsView, toString } from './_setup.js';\nimport isDataView from './isDataView.js';\nimport constant from './constant.js';\nimport isBufferLike from './_isBufferLike.js';\n\n// Is a given value a typed array?\nvar typedArrayPattern = /\\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\\]/;\nfunction isTypedArray(obj) {\n  // `ArrayBuffer.isView` is the most future-proof, so use it when available.\n  // Otherwise, fall back on the above regular expression.\n  return nativeIsView ? (nativeIsView(obj) && !isDataView(obj)) :\n                isBufferLike(obj) && typedArrayPattern.test(toString.call(obj));\n}\n\nexport default supportsArrayBuffer ? isTypedArray : constant(false);\n"],"names":["typedArrayPattern","isTypedArray","obj","nativeIsView","isDataView","isBufferLike","toString","isTypedArray$1","supportsArrayBuffer","constant"],"mappings":";;;;AAMA,IAAIA,IAAoB;AACxB,SAASC,EAAaC,GAAK;AAGzB,SAAOC,IAAgBA,EAAaD,CAAG,KAAK,CAACE,EAAWF,CAAG,IAC7CG,EAAaH,CAAG,KAAKF,EAAkB,KAAKM,EAAS,KAAKJ,CAAG,CAAC;AAC9E;AAEA,MAAAK,IAAeC,IAAsBP,IAAeQ,EAAS,EAAK;","x_google_ignoreList":[0]}

package/dist/index.es84.js

@@ -1,18 +1,15 @@
-import r from "./index.es10.js";
-import n from "./index.es151.js";
-import f from "./index.es112.js";
-import { push as u } from "./index.es6.js";
-import m from "./index.es227.js";
-function l(o) {
-  return n(f(o), function(t) {
-    var i = r[t] = o[t];
-    r.prototype[t] = function() {
-      var p = [this._wrapped];
-      return u.apply(p, arguments), m(this, i.apply(r, p));
-    };
-  }), r;
+import e from "./index.es199.js";
+import i from "./index.es80.js";
+import m from "./index.es72.js";
+import n from "./index.es9.js";
+import f from "./index.es88.js";
+function a(r) {
+  if (r == null)
+    return !0;
+  var t = e(r);
+  return typeof t == "number" && (i(r) || m(r) || n(r)) ? t === 0 : e(f(r)) === 0;
 }
 export {
-  l as default
+  a as default
 };
 //# sourceMappingURL=index.es84.js.map

package/dist/index.es84.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es84.js","sources":["../../../node_modules/underscore/modules/mixin.js"],"sourcesContent":["import _ from './underscore.js';\nimport each from './each.js';\nimport functions from './functions.js';\nimport { push } from './_setup.js';\nimport chainResult from './_chainResult.js';\n\n// Add your own custom functions to the Underscore object.\nexport default function mixin(obj) {\n  each(functions(obj), function(name) {\n    var func = _[name] = obj[name];\n    _.prototype[name] = function() {\n      var args = [this._wrapped];\n      push.apply(args, arguments);\n      return chainResult(this, func.apply(_, args));\n    };\n  });\n  return _;\n}\n"],"names":["mixin","obj","each","functions","name","func","_","args","push","chainResult"],"mappings":";;;;;AAOA,SAAwBA,EAAMC,GAAK;AACjC,SAAAC,EAAKC,EAAUF,CAAG,GAAG,SAASG,GAAM;AAClC,QAAIC,IAAOC,EAAEF,CAAI,IAAIH,EAAIG,CAAI;AAC3B,IAAAE,EAAA,UAAUF,CAAI,IAAI,WAAW;AACzB,UAAAG,IAAO,CAAC,KAAK,QAAQ;AACpB,aAAAC,EAAA,MAAMD,GAAM,SAAS,GACnBE,EAAY,MAAMJ,EAAK,MAAMC,GAAGC,CAAI,CAAC;AAAA,IAAA;AAAA,EAC9C,CACD,GACMD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es84.js","sources":["../../../node_modules/underscore/modules/isEmpty.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isArray from './isArray.js';\nimport isString from './isString.js';\nimport isArguments from './isArguments.js';\nimport keys from './keys.js';\n\n// Is a given array, string, or object empty?\n// An \"empty\" object has no enumerable own-properties.\nexport default function isEmpty(obj) {\n  if (obj == null) return true;\n  // Skip the more expensive `toString`-based type checks if `obj` has no\n  // `.length`.\n  var length = getLength(obj);\n  if (typeof length == 'number' && (\n    isArray(obj) || isString(obj) || isArguments(obj)\n  )) return length === 0;\n  return getLength(keys(obj)) === 0;\n}\n"],"names":["isEmpty","obj","length","getLength","isArray","isString","isArguments","keys"],"mappings":";;;;;AAQA,SAAwBA,EAAQC,GAAK;AACnC,MAAIA,KAAO;AAAa,WAAA;AAGpB,MAAAC,IAASC,EAAUF,CAAG;AACtB,SAAA,OAAOC,KAAU,aACnBE,EAAQH,CAAG,KAAKI,EAASJ,CAAG,KAAKK,EAAYL,CAAG,KACxCC,MAAW,IACdC,EAAUI,EAAKN,CAAG,CAAC,MAAM;AAClC;","x_google_ignoreList":[0]}

package/dist/index.es85.js

@@ -1,22 +1,16 @@
-function s(a, r) {
-  return r = r == null ? a.length - 1 : +r, function() {
-    for (var g = Math.max(arguments.length - r, 0), l = Array(g), e = 0; e < g; e++)
-      l[e] = arguments[e + r];
-    switch (r) {
-      case 0:
-        return a.call(this, l);
-      case 1:
-        return a.call(this, arguments[0], l);
-      case 2:
-        return a.call(this, arguments[0], arguments[1], l);
-    }
-    var u = Array(r + 1);
-    for (e = 0; e < r; e++)
-      u[e] = arguments[e];
-    return u[r] = l, a.apply(this, u);
-  };
+import l from "./index.es88.js";
+function i(n, t) {
+  var a = l(t), f = a.length;
+  if (n == null)
+    return !f;
+  for (var u = Object(n), r = 0; r < f; r++) {
+    var e = a[r];
+    if (t[e] !== u[e] || !(e in u))
+      return !1;
+  }
+  return !0;
 }
 export {
-  s as default
+  i as default
 };
 //# sourceMappingURL=index.es85.js.map

package/dist/index.es85.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es85.js","sources":["../../../node_modules/underscore/modules/restArguments.js"],"sourcesContent":["// Some functions take a variable number of arguments, or a few expected\n// arguments at the beginning and then a variable number of values to operate\n// on. This helper accumulates all remaining arguments past the function’s\n// argument length (or an explicit `startIndex`), into an array that becomes\n// the last argument. Similar to ES6’s \"rest parameter\".\nexport default function restArguments(func, startIndex) {\n  startIndex = startIndex == null ? func.length - 1 : +startIndex;\n  return function() {\n    var length = Math.max(arguments.length - startIndex, 0),\n        rest = Array(length),\n        index = 0;\n    for (; index < length; index++) {\n      rest[index] = arguments[index + startIndex];\n    }\n    switch (startIndex) {\n      case 0: return func.call(this, rest);\n      case 1: return func.call(this, arguments[0], rest);\n      case 2: return func.call(this, arguments[0], arguments[1], rest);\n    }\n    var args = Array(startIndex + 1);\n    for (index = 0; index < startIndex; index++) {\n      args[index] = arguments[index];\n    }\n    args[startIndex] = rest;\n    return func.apply(this, args);\n  };\n}\n"],"names":["restArguments","func","startIndex","length","rest","index","args"],"mappings":"AAKwB,SAAAA,EAAcC,GAAMC,GAAY;AACtD,SAAAA,IAAaA,KAAc,OAAOD,EAAK,SAAS,IAAI,CAACC,GAC9C,WAAW;AAIT,aAHHC,IAAS,KAAK,IAAI,UAAU,SAASD,GAAY,CAAC,GAClDE,IAAO,MAAMD,CAAM,GACnBE,IAAQ,GACLA,IAAQF,GAAQE;AACrB,MAAAD,EAAKC,CAAK,IAAI,UAAUA,IAAQH,CAAU;AAE5C,YAAQA,GAAY;AAAA,MAClB,KAAK;AAAU,eAAAD,EAAK,KAAK,MAAMG,CAAI;AAAA,MACnC,KAAK;AAAG,eAAOH,EAAK,KAAK,MAAM,UAAU,CAAC,GAAGG,CAAI;AAAA,MACjD,KAAK;AAAU,eAAAH,EAAK,KAAK,MAAM,UAAU,CAAC,GAAG,UAAU,CAAC,GAAGG,CAAI;AAAA,IACjE;AACI,QAAAE,IAAO,MAAMJ,IAAa,CAAC;AAC/B,SAAKG,IAAQ,GAAGA,IAAQH,GAAYG;AAC7B,MAAAC,EAAAD,CAAK,IAAI,UAAUA,CAAK;AAE/B,WAAAC,EAAKJ,CAAU,IAAIE,GACZH,EAAK,MAAM,MAAMK,CAAI;AAAA,EAAA;AAEhC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es85.js","sources":["../../../node_modules/underscore/modules/isMatch.js"],"sourcesContent":["import keys from './keys.js';\n\n// Returns whether an object has a given set of `key:value` pairs.\nexport default function isMatch(object, attrs) {\n  var _keys = keys(attrs), length = _keys.length;\n  if (object == null) return !length;\n  var obj = Object(object);\n  for (var i = 0; i < length; i++) {\n    var key = _keys[i];\n    if (attrs[key] !== obj[key] || !(key in obj)) return false;\n  }\n  return true;\n}\n"],"names":["isMatch","object","attrs","_keys","keys","length","obj","i","key"],"mappings":";AAGwB,SAAAA,EAAQC,GAAQC,GAAO;AAC7C,MAAIC,IAAQC,EAAKF,CAAK,GAAGG,IAASF,EAAM;AACxC,MAAIF,KAAU;AAAM,WAAO,CAACI;AAE5B,WADIC,IAAM,OAAOL,CAAM,GACdM,IAAI,GAAGA,IAAIF,GAAQE,KAAK;AAC3B,QAAAC,IAAML,EAAMI,CAAC;AACjB,QAAIL,EAAMM,CAAG,MAAMF,EAAIE,CAAG,KAAK,EAAEA,KAAOF;AAAa,aAAA;AAAA,EACvD;AACO,SAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es86.js

@@ -1,8 +1,89 @@
-function n(t) {
-  var e = typeof t;
-  return e === "function" || e === "object" && !!t;
+import m from "./index.es10.js";
+import { toString as g, SymbolProto as h } from "./index.es6.js";
+import j from "./index.es200.js";
+import D from "./index.es83.js";
+import y from "./index.es7.js";
+import { hasStringTagBug as V } from "./index.es8.js";
+import v from "./index.es79.js";
+import w from "./index.es88.js";
+import q from "./index.es197.js";
+import d from "./index.es201.js";
+var B = "[object DataView]";
+function c(e, r, f, n) {
+  if (e === r)
+    return e !== 0 || 1 / e === 1 / r;
+  if (e == null || r == null)
+    return !1;
+  if (e !== e)
+    return r !== r;
+  var o = typeof e;
+  return o !== "function" && o !== "object" && typeof r != "object" ? !1 : O(e, r, f, n);
+}
+function O(e, r, f, n) {
+  e instanceof m && (e = e._wrapped), r instanceof m && (r = r._wrapped);
+  var o = g.call(e);
+  if (o !== g.call(r))
+    return !1;
+  if (V && o == "[object Object]" && v(e)) {
+    if (!v(r))
+      return !1;
+    o = B;
+  }
+  switch (o) {
+    case "[object RegExp]":
+    case "[object String]":
+      return "" + e == "" + r;
+    case "[object Number]":
+      return +e != +e ? +r != +r : +e == 0 ? 1 / +e === 1 / r : +e == +r;
+    case "[object Date]":
+    case "[object Boolean]":
+      return +e == +r;
+    case "[object Symbol]":
+      return h.valueOf.call(e) === h.valueOf.call(r);
+    case "[object ArrayBuffer]":
+    case B:
+      return O(d(e), d(r), f, n);
+  }
+  var i = o === "[object Array]";
+  if (!i && D(e)) {
+    var A = j(e);
+    if (A !== j(r))
+      return !1;
+    if (e.buffer === r.buffer && e.byteOffset === r.byteOffset)
+      return !0;
+    i = !0;
+  }
+  if (!i) {
+    if (typeof e != "object" || typeof r != "object")
+      return !1;
+    var u = e.constructor, s = r.constructor;
+    if (u !== s && !(y(u) && u instanceof u && y(s) && s instanceof s) && "constructor" in e && "constructor" in r)
+      return !1;
+  }
+  f = f || [], n = n || [];
+  for (var t = f.length; t--; )
+    if (f[t] === e)
+      return n[t] === r;
+  if (f.push(e), n.push(r), i) {
+    if (t = e.length, t !== r.length)
+      return !1;
+    for (; t--; )
+      if (!c(e[t], r[t], f, n))
+        return !1;
+  } else {
+    var p = w(e), l;
+    if (t = p.length, w(r).length !== t)
+      return !1;
+    for (; t--; )
+      if (l = p[t], !(q(r, l) && c(e[l], r[l], f, n)))
+        return !1;
+  }
+  return f.pop(), n.pop(), !0;
+}
+function z(e, r) {
+  return c(e, r);
 }
 export {
-  n as default
+  z as default
 };
 //# sourceMappingURL=index.es86.js.map

package/dist/index.es86.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es86.js","sources":["../../../node_modules/underscore/modules/isObject.js"],"sourcesContent":["// Is a given variable an object?\nexport default function isObject(obj) {\n  var type = typeof obj;\n  return type === 'function' || (type === 'object' && !!obj);\n}\n"],"names":["isObject","obj","type"],"mappings":"AACA,SAAwBA,EAASC,GAAK;AACpC,MAAIC,IAAO,OAAOD;AAClB,SAAOC,MAAS,cAAeA,MAAS,YAAY,CAAC,CAACD;AACxD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es86.js","sources":["../../../node_modules/underscore/modules/isEqual.js"],"sourcesContent":["import _ from './underscore.js';\nimport { toString, SymbolProto } from './_setup.js';\nimport getByteLength from './_getByteLength.js';\nimport isTypedArray from './isTypedArray.js';\nimport isFunction from './isFunction.js';\nimport { hasStringTagBug }  from './_stringTagBug.js';\nimport isDataView from './isDataView.js';\nimport keys from './keys.js';\nimport has from './_has.js';\nimport toBufferView from './_toBufferView.js';\n\n// We use this string twice, so give it a name for minification.\nvar tagDataView = '[object DataView]';\n\n// Internal recursive comparison function for `_.isEqual`.\nfunction eq(a, b, aStack, bStack) {\n  // Identical objects are equal. `0 === -0`, but they aren't identical.\n  // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).\n  if (a === b) return a !== 0 || 1 / a === 1 / b;\n  // `null` or `undefined` only equal to itself (strict comparison).\n  if (a == null || b == null) return false;\n  // `NaN`s are equivalent, but non-reflexive.\n  if (a !== a) return b !== b;\n  // Exhaust primitive checks\n  var type = typeof a;\n  if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;\n  return deepEq(a, b, aStack, bStack);\n}\n\n// Internal recursive comparison function for `_.isEqual`.\nfunction deepEq(a, b, aStack, bStack) {\n  // Unwrap any wrapped objects.\n  if (a instanceof _) a = a._wrapped;\n  if (b instanceof _) b = b._wrapped;\n  // Compare `[[Class]]` names.\n  var className = toString.call(a);\n  if (className !== toString.call(b)) return false;\n  // Work around a bug in IE 10 - Edge 13.\n  if (hasStringTagBug && className == '[object Object]' && isDataView(a)) {\n    if (!isDataView(b)) return false;\n    className = tagDataView;\n  }\n  switch (className) {\n    // These types are compared by value.\n    case '[object RegExp]':\n      // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')\n    case '[object String]':\n      // Primitives and their corresponding object wrappers are equivalent; thus, `\"5\"` is\n      // equivalent to `new String(\"5\")`.\n      return '' + a === '' + b;\n    case '[object Number]':\n      // `NaN`s are equivalent, but non-reflexive.\n      // Object(NaN) is equivalent to NaN.\n      if (+a !== +a) return +b !== +b;\n      // An `egal` comparison is performed for other numeric values.\n      return +a === 0 ? 1 / +a === 1 / b : +a === +b;\n    case '[object Date]':\n    case '[object Boolean]':\n      // Coerce dates and booleans to numeric primitive values. Dates are compared by their\n      // millisecond representations. Note that invalid dates with millisecond representations\n      // of `NaN` are not equivalent.\n      return +a === +b;\n    case '[object Symbol]':\n      return SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b);\n    case '[object ArrayBuffer]':\n    case tagDataView:\n      // Coerce to typed array so we can fall through.\n      return deepEq(toBufferView(a), toBufferView(b), aStack, bStack);\n  }\n\n  var areArrays = className === '[object Array]';\n  if (!areArrays && isTypedArray(a)) {\n      var byteLength = getByteLength(a);\n      if (byteLength !== getByteLength(b)) return false;\n      if (a.buffer === b.buffer && a.byteOffset === b.byteOffset) return true;\n      areArrays = true;\n  }\n  if (!areArrays) {\n    if (typeof a != 'object' || typeof b != 'object') return false;\n\n    // Objects with different constructors are not equivalent, but `Object`s or `Array`s\n    // from different frames are.\n    var aCtor = a.constructor, bCtor = b.constructor;\n    if (aCtor !== bCtor && !(isFunction(aCtor) && aCtor instanceof aCtor &&\n                             isFunction(bCtor) && bCtor instanceof bCtor)\n                        && ('constructor' in a && 'constructor' in b)) {\n      return false;\n    }\n  }\n  // Assume equality for cyclic structures. The algorithm for detecting cyclic\n  // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.\n\n  // Initializing stack of traversed objects.\n  // It's done here since we only need them for objects and arrays comparison.\n  aStack = aStack || [];\n  bStack = bStack || [];\n  var length = aStack.length;\n  while (length--) {\n    // Linear search. Performance is inversely proportional to the number of\n    // unique nested structures.\n    if (aStack[length] === a) return bStack[length] === b;\n  }\n\n  // Add the first object to the stack of traversed objects.\n  aStack.push(a);\n  bStack.push(b);\n\n  // Recursively compare objects and arrays.\n  if (areArrays) {\n    // Compare array lengths to determine if a deep comparison is necessary.\n    length = a.length;\n    if (length !== b.length) return false;\n    // Deep compare the contents, ignoring non-numeric properties.\n    while (length--) {\n      if (!eq(a[length], b[length], aStack, bStack)) return false;\n    }\n  } else {\n    // Deep compare objects.\n    var _keys = keys(a), key;\n    length = _keys.length;\n    // Ensure that both objects contain the same number of properties before comparing deep equality.\n    if (keys(b).length !== length) return false;\n    while (length--) {\n      // Deep compare each member\n      key = _keys[length];\n      if (!(has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;\n    }\n  }\n  // Remove the first object from the stack of traversed objects.\n  aStack.pop();\n  bStack.pop();\n  return true;\n}\n\n// Perform a deep comparison to check if two objects are equal.\nexport default function isEqual(a, b) {\n  return eq(a, b);\n}\n"],"names":["tagDataView","eq","a","b","aStack","bStack","type","deepEq","_","className","toString","hasStringTagBug","isDataView","SymbolProto","toBufferView","areArrays","isTypedArray","byteLength","getByteLength","aCtor","bCtor","isFunction","length","_keys","keys","key","has","isEqual"],"mappings":";;;;;;;;;;AAYA,IAAIA,IAAc;AAGlB,SAASC,EAAGC,GAAGC,GAAGC,GAAQC,GAAQ;AAGhC,MAAIH,MAAMC;AAAG,WAAOD,MAAM,KAAK,IAAIA,MAAM,IAAIC;AAEzC,MAAAD,KAAK,QAAQC,KAAK;AAAa,WAAA;AAEnC,MAAID,MAAMA;AAAG,WAAOC,MAAMA;AAE1B,MAAIG,IAAO,OAAOJ;AAClB,SAAII,MAAS,cAAcA,MAAS,YAAY,OAAOH,KAAK,WAAiB,KACtEI,EAAOL,GAAGC,GAAGC,GAAQC,CAAM;AACpC;AAGA,SAASE,EAAOL,GAAGC,GAAGC,GAAQC,GAAQ;AAEpC,EAAIH,aAAaM,MAAGN,IAAIA,EAAE,WACtBC,aAAaK,MAAGL,IAAIA,EAAE;AAEtB,MAAAM,IAAYC,EAAS,KAAKR,CAAC;AAC3B,MAAAO,MAAcC,EAAS,KAAKP,CAAC;AAAU,WAAA;AAE3C,MAAIQ,KAAmBF,KAAa,qBAAqBG,EAAWV,CAAC,GAAG;AAClE,QAAA,CAACU,EAAWT,CAAC;AAAU,aAAA;AACf,IAAAM,IAAAT;AAAA,EACd;AACA,UAAQS,GAAW;AAAA,IAEjB,KAAK;AAAA,IAEL,KAAK;AAGI,aAAA,KAAKP,KAAM,KAAKC;AAAA,IACzB,KAAK;AAGC,aAAA,CAACD,KAAM,CAACA,IAAU,CAACC,KAAM,CAACA,IAEvB,CAACD,KAAM,IAAI,IAAI,CAACA,MAAM,IAAIC,IAAI,CAACD,KAAM,CAACC;AAAA,IAC/C,KAAK;AAAA,IACL,KAAK;AAII,aAAA,CAACD,KAAM,CAACC;AAAA,IACjB,KAAK;AACI,aAAAU,EAAY,QAAQ,KAAKX,CAAC,MAAMW,EAAY,QAAQ,KAAKV,CAAC;AAAA,IACnE,KAAK;AAAA,IACL,KAAKH;AAEI,aAAAO,EAAOO,EAAaZ,CAAC,GAAGY,EAAaX,CAAC,GAAGC,GAAQC,CAAM;AAAA,EAClE;AAEA,MAAIU,IAAYN,MAAc;AAC9B,MAAI,CAACM,KAAaC,EAAad,CAAC,GAAG;AAC3B,QAAAe,IAAaC,EAAchB,CAAC;AAC5B,QAAAe,MAAeC,EAAcf,CAAC;AAAU,aAAA;AAC5C,QAAID,EAAE,WAAWC,EAAE,UAAUD,EAAE,eAAeC,EAAE;AAAmB,aAAA;AACvD,IAAAY,IAAA;AAAA,EAChB;AACA,MAAI,CAACA,GAAW;AACd,QAAI,OAAOb,KAAK,YAAY,OAAOC,KAAK;AAAiB,aAAA;AAIzD,QAAIgB,IAAQjB,EAAE,aAAakB,IAAQjB,EAAE;AACrC,QAAIgB,MAAUC,KAAS,EAAEC,EAAWF,CAAK,KAAKA,aAAiBA,KACtCE,EAAWD,CAAK,KAAKA,aAAiBA,MACvC,iBAAiBlB,KAAK,iBAAiBC;AACtD,aAAA;AAAA,EAEX;AAMA,EAAAC,IAASA,KAAU,IACnBC,IAASA,KAAU;AAEnB,WADIiB,IAASlB,EAAO,QACbkB;AAGD,QAAAlB,EAAOkB,CAAM,MAAMpB;AAAU,aAAAG,EAAOiB,CAAM,MAAMnB;AAQtD,MAJAC,EAAO,KAAKF,CAAC,GACbG,EAAO,KAAKF,CAAC,GAGTY,GAAW;AAGb,QADAO,IAASpB,EAAE,QACPoB,MAAWnB,EAAE;AAAe,aAAA;AAEhC,WAAOmB;AACD,UAAA,CAACrB,EAAGC,EAAEoB,CAAM,GAAGnB,EAAEmB,CAAM,GAAGlB,GAAQC,CAAM;AAAU,eAAA;AAAA,EACxD,OACK;AAED,QAAAkB,IAAQC,EAAKtB,CAAC,GAAGuB;AAGjB,QAFJH,IAASC,EAAM,QAEXC,EAAKrB,CAAC,EAAE,WAAWmB;AAAe,aAAA;AACtC,WAAOA;AAGL,UADAG,IAAMF,EAAMD,CAAM,GACd,EAAEI,EAAIvB,GAAGsB,CAAG,KAAKxB,EAAGC,EAAEuB,CAAG,GAAGtB,EAAEsB,CAAG,GAAGrB,GAAQC,CAAM;AAAW,eAAA;AAAA,EAErE;AAEA,SAAAD,EAAO,IAAI,GACXC,EAAO,IAAI,GACJ;AACT;AAGwB,SAAAsB,EAAQzB,GAAGC,GAAG;AAC7B,SAAAF,EAAGC,GAAGC,CAAC;AAChB;","x_google_ignoreList":[0]}

package/dist/index.es87.js

@@ -1,7 +1,6 @@
-function u(l) {
-  return l === null;
-}
+import e from "./index.es196.js";
+const a = e("WeakSet");
 export {
-  u as default
+  a as default
 };
 //# sourceMappingURL=index.es87.js.map

package/dist/index.es87.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es87.js","sources":["../../../node_modules/underscore/modules/isNull.js"],"sourcesContent":["// Is a given value equal to null?\nexport default function isNull(obj) {\n  return obj === null;\n}\n"],"names":["isNull","obj"],"mappings":"AACA,SAAwBA,EAAOC,GAAK;AAClC,SAAOA,MAAQ;AACjB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es87.js","sources":["../../../node_modules/underscore/modules/isWeakSet.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('WeakSet');\n"],"names":["isWeakSet","tagTester"],"mappings":";AAEA,MAAeA,IAAAC,EAAU,SAAS;","x_google_ignoreList":[0]}