@performant-software/visualize 3.1.12-beta.3 → 3.1.12

package/dist/index.cjs81.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs81.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,EAAK,CACpC,IAAIC,EAAO,OAAOD,EAClB,OAAOC,IAAS,YAAeA,IAAS,UAAY,CAAC,CAACD,CACxD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs81.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n  source: {\n    x: 0,\n    y: 0\n  },\n  target: {\n    x: 0,\n    y: 0\n  }\n};\nexport default function HierarchyDefaultLink(_ref) {\n  var _ref$link = _ref.link,\n    link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n  return /*#__PURE__*/React.createElement(\"line\", {\n    x1: link.source.x,\n    y1: link.source.y,\n    x2: link.target.x,\n    y2: link.target.y,\n    strokeWidth: 2,\n    stroke: \"#999\",\n    strokeOpacity: 0.6\n  });\n}\nHierarchyDefaultLink.propTypes = {\n  link: _pt.shape({\n    source: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired,\n    target: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired\n  })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":"oEAEA,IAAIA,EAAe,CACjB,OAAQ,CACN,EAAG,EACH,EAAG,CAAA,EAEL,OAAQ,CACN,EAAG,EACH,EAAG,CAAA,CAEP,EACA,SAAwBC,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAASH,EAAeG,EAC/C,OAAoBE,EAAM,cAAc,OAAQ,CAC9C,GAAID,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,YAAa,EACb,OAAQ,OACR,cAAe,EAAA,CAChB,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UAAA,CACf,EAAE,WACH,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UAAA,CACf,EAAE,UAAA,CACJ,CACH","x_google_ignoreList":[0]}

package/dist/index.cjs82.js

@@ -1,2 +1,2 @@
-"use strict";function u(t){return t===null}module.exports=u;
+"use strict";const e=require("./index.cjs63.js"),o=require("react");function i(c){var n=c.node,r=n===void 0?{x:0,y:0,r:15}:n;return o.createElement("circle",{cx:r.x,cy:r.y,r:r.r||15,fill:"#21D4FD"})}i.propTypes={node:e.shape({x:e.number.isRequired,y:e.number.isRequired,r:e.number})};module.exports=i;
 //# sourceMappingURL=index.cjs82.js.map

package/dist/index.cjs82.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs82.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,EAAK,CAClC,OAAOA,IAAQ,IACjB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs82.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":"oEAEA,SAAwBA,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAAS,CAC5B,EAAG,EACH,EAAG,EACH,EAAG,EAAA,EACDA,EACN,OAAoBE,EAAM,cAAc,SAAU,CAChD,GAAID,EAAK,EACT,GAAIA,EAAK,EACT,EAAGA,EAAK,GAAK,GACb,KAAM,SAAA,CACP,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,MAAA,CACR,CACH","x_google_ignoreList":[0]}

package/dist/index.cjs83.js

@@ -1,2 +1,2 @@
-"use strict";function i(e){return e===void 0}module.exports=i;
+"use strict";const k=require("./index.cjs37.js");function R(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 W(r,n,c){var l=c/(n.i-r.i);n.c-=l,n.s+=c,r.c+=l,n.z+=c,n.m+=c}function b(r){for(var n=0,c=0,l=r.children,u=l.length,s;--u>=0;)s=l[u],s.z+=n,s.m+=n,n+=s.s+(c+=s.c)}function j(r,n,c){return r.a.parent===n.parent?r.a:c}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.Node.prototype);function o(r){for(var n=new A(r,0),c,l=[n],u,s,x,y;c=l.pop();)if(s=c._.children)for(c.children=new Array(y=s.length),x=y-1;x>=0;--x)l.push(u=c.children[x]=new A(s[x],x)),u.parent=c;return(n.parent=new A(null,0)).children=[n],n}function q(){var r=R,n=1,c=1,l=null;function u(e){var f=o(e);if(f.eachAfter(s),f.parent.m=-f.z,f.eachBefore(x),l)e.eachBefore(N);else{var d=e,t=e,a=e;e.eachBefore(function(i){i.x<d.x&&(d=i),i.x>t.x&&(t=i),i.depth>a.depth&&(a=i)});var h=d===t?1:r(d,t)/2,z=h-d.x,g=n/(t.x+h+z),_=c/(a.depth||1);e.eachBefore(function(i){i.x=(i.x+z)*g,i.y=i.depth*_})}return e}function s(e){var f=e.children,d=e.parent.children,t=e.i?d[e.i-1]:null;if(f){b(e);var a=(f[0].z+f[f.length-1].z)/2;t?(e.z=t.z+r(e._,t._),e.m=e.z-a):e.z=a}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,a=e,h=f,z=t.parent.children[0],g=t.m,_=a.m,i=h.m,w=z.m,p;h=B(h),t=S(t),h&&t;)z=S(z),a=B(a),a.a=e,p=h.z+i-t.z-g+r(h._,t._),p>0&&(W(j(h,e,d),e,p),g+=p,_+=p),i+=h.m,g+=t.m,w+=z.m,_+=a.m;h&&!B(a)&&(a.t=h,a.m+=i-_),t&&!S(z)&&(z.t=t,z.m+=g-w,d=e)}return d}function N(e){e.x*=n,e.y=e.depth*c}return u.separation=function(e){return arguments.length?(r=e,u):r},u.size=function(e){return arguments.length?(l=!1,n=+e[0],c=+e[1],u):l?null:[n,c]},u.nodeSize=function(e){return arguments.length?(l=!0,n=+e[0],c=+e[1],u):l?[n,c]:null},u}module.exports=q;
 //# sourceMappingURL=index.cjs83.js.map

package/dist/index.cjs83.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs83.js","sources":["../../../node_modules/underscore/modules/isUndefined.js"],"sourcesContent":["// Is a given variable undefined?\nexport default function isUndefined(obj) {\n  return obj === void 0;\n}\n"],"names":["isUndefined","obj"],"mappings":"aACA,SAAwBA,EAAYC,EAAK,CACvC,OAAOA,IAAQ,MACjB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs83.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":"iDAEA,SAASA,EAAkBC,EAAGC,EAAG,CAC/B,OAAOD,EAAE,SAAWC,EAAE,OAAS,EAAI,CACrC,CAUA,SAASC,EAASC,EAAG,CACnB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAAS,CAAC,EAAID,EAAE,CACpC,CAGA,SAASE,EAAUF,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAASA,EAAS,OAAS,CAAC,EAAID,EAAE,CACtD,CAIA,SAASG,EAAYC,EAAIC,EAAIC,EAAO,CAClC,IAAIC,EAASD,GAASD,EAAG,EAAID,EAAG,GAChCC,EAAG,GAAKE,EACRF,EAAG,GAAKC,EACRF,EAAG,GAAKG,EACRF,EAAG,GAAKC,EACRD,EAAG,GAAKC,CACV,CAKA,SAASE,EAAcR,EAAG,CAMxB,QALIM,EAAQ,EACRC,EAAS,EACTN,EAAWD,EAAE,SACbS,EAAIR,EAAS,OACbS,EACG,EAAED,GAAK,GACZC,EAAIT,EAASQ,CAAC,EACdC,EAAE,GAAKJ,EACPI,EAAE,GAAKJ,EACPA,GAASI,EAAE,GAAKH,GAAUG,EAAE,EAEhC,CAIA,SAASC,EAAaC,EAAKZ,EAAGa,EAAU,CACtC,OAAOD,EAAI,EAAE,SAAWZ,EAAE,OAASY,EAAI,EAAIC,CAC7C,CAEA,SAASC,EAASC,EAAMN,EAAG,CACzB,KAAK,EAAIM,EACT,KAAK,OAAS,KACd,KAAK,SAAW,KAChB,KAAK,EAAI,KACT,KAAK,EAAI,KACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,KACT,KAAK,EAAIN,CACX,CAEAK,EAAS,UAAY,OAAO,OAAOE,EAAAA,KAAK,SAAS,EAEjD,SAASC,EAASC,EAAM,CAStB,QARIC,EAAO,IAAIL,EAASI,EAAM,CAAC,EAC3BH,EACAK,EAAQ,CAACD,CAAI,EACbE,EACApB,EACAQ,EACAa,EAEGP,EAAOK,EAAM,OAClB,GAAInB,EAAWc,EAAK,EAAE,SAEpB,IADAA,EAAK,SAAW,IAAI,MAAMO,EAAIrB,EAAS,MAAM,EACxCQ,EAAIa,EAAI,EAAGb,GAAK,EAAG,EAAEA,EACxBW,EAAM,KAAKC,EAAQN,EAAK,SAASN,CAAC,EAAI,IAAIK,EAASb,EAASQ,CAAC,EAAGA,CAAC,CAAC,EAClEY,EAAM,OAASN,EAKrB,OAACI,EAAK,OAAS,IAAIL,EAAS,KAAM,CAAC,GAAG,SAAW,CAACK,CAAI,EAC/CA,CACT,CAGA,SAAAI,GAA0B,CACxB,IAAIC,EAAa5B,EACb6B,EAAK,EACLC,EAAK,EACLC,EAAW,KAEf,SAASR,EAAKD,EAAM,CAClB,IAAIU,EAAIX,EAASC,CAAI,EAOrB,GAJAU,EAAE,UAAUC,CAAS,EAAGD,EAAE,OAAO,EAAI,CAACA,EAAE,EACxCA,EAAE,WAAWE,CAAU,EAGnBH,EAAUT,EAAK,WAAWa,CAAQ,MAIjC,CACH,IAAIC,EAAOd,EACPe,EAAQf,EACRgB,EAAShB,EACbA,EAAK,WAAW,SAASH,EAAM,CACzBA,EAAK,EAAIiB,EAAK,IAAGA,EAAOjB,GACxBA,EAAK,EAAIkB,EAAM,IAAGA,EAAQlB,GAC1BA,EAAK,MAAQmB,EAAO,QAAOA,EAASnB,EAC1C,CAAC,EACD,IAAIoB,EAAIH,IAASC,EAAQ,EAAIT,EAAWQ,EAAMC,CAAK,EAAI,EACnDG,EAAKD,EAAIH,EAAK,EACdK,EAAKZ,GAAMQ,EAAM,EAAIE,EAAIC,GACzBE,EAAKZ,GAAMQ,EAAO,OAAS,GAC/BhB,EAAK,WAAW,SAASH,EAAM,CAC7BA,EAAK,GAAKA,EAAK,EAAIqB,GAAMC,EACzBtB,EAAK,EAAIA,EAAK,MAAQuB,CACxB,CAAC,CACH,CAEA,OAAOpB,CACT,CAMA,SAASW,EAAU7B,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACbuC,EAAWvC,EAAE,OAAO,SACpBU,EAAIV,EAAE,EAAIuC,EAASvC,EAAE,EAAI,CAAC,EAAI,KAClC,GAAIC,EAAU,CACZO,EAAcR,CAAC,EACf,IAAIwC,GAAYvC,EAAS,CAAC,EAAE,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,GAAK,EAC/DS,GACFV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,EAC/BV,EAAE,EAAIA,EAAE,EAAIwC,GAEZxC,EAAE,EAAIwC,CAEV,MAAW9B,IACTV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,GAEjCV,EAAE,OAAO,EAAIyC,EAAUzC,EAAGU,EAAGV,EAAE,OAAO,GAAKuC,EAAS,CAAC,CAAC,CACxD,CAGA,SAAST,EAAW9B,EAAG,CACrBA,EAAE,EAAE,EAAIA,EAAE,EAAIA,EAAE,OAAO,EACvBA,EAAE,GAAKA,EAAE,OAAO,CAClB,CAaA,SAASyC,EAAUzC,EAAGU,EAAGG,EAAU,CACjC,GAAIH,EAAG,CAUL,QATIgC,EAAM1C,EACN2C,EAAM3C,EACNY,EAAMF,EACNkC,EAAMF,EAAI,OAAO,SAAS,CAAC,EAC3BG,EAAMH,EAAI,EACVI,EAAMH,EAAI,EACVI,EAAMnC,EAAI,EACVoC,EAAMJ,EAAI,EACVtC,EACGM,EAAMV,EAAUU,CAAG,EAAG8B,EAAM3C,EAAS2C,CAAG,EAAG9B,GAAO8B,GACvDE,EAAM7C,EAAS6C,CAAG,EAClBD,EAAMzC,EAAUyC,CAAG,EACnBA,EAAI,EAAI3C,EACRM,EAAQM,EAAI,EAAImC,EAAML,EAAI,EAAIG,EAAMrB,EAAWZ,EAAI,EAAG8B,EAAI,CAAC,EACvDpC,EAAQ,IACVH,EAAYQ,EAAaC,EAAKZ,EAAGa,CAAQ,EAAGb,EAAGM,CAAK,EACpDuC,GAAOvC,EACPwC,GAAOxC,GAETyC,GAAOnC,EAAI,EACXiC,GAAOH,EAAI,EACXM,GAAOJ,EAAI,EACXE,GAAOH,EAAI,EAET/B,GAAO,CAACV,EAAUyC,CAAG,IACvBA,EAAI,EAAI/B,EACR+B,EAAI,GAAKI,EAAMD,GAEbJ,GAAO,CAAC3C,EAAS6C,CAAG,IACtBA,EAAI,EAAIF,EACRE,EAAI,GAAKC,EAAMG,EACfnC,EAAWb,EAEf,CACA,OAAOa,CACT,CAEA,SAASkB,EAAShB,EAAM,CACtBA,EAAK,GAAKU,EACVV,EAAK,EAAIA,EAAK,MAAQW,CACxB,CAEA,OAAAP,EAAK,WAAa,SAAS8B,EAAG,CAC5B,OAAO,UAAU,QAAUzB,EAAayB,EAAG9B,GAAQK,CACrD,EAEAL,EAAK,KAAO,SAAS8B,EAAG,CACtB,OAAO,UAAU,QAAUtB,EAAW,GAAOF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,KAAO,CAACF,EAAIC,CAAE,CACzG,EAEAP,EAAK,SAAW,SAAS8B,EAAG,CAC1B,OAAO,UAAU,QAAUtB,EAAW,GAAMF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,CAACF,EAAIC,CAAE,EAAI,IACrG,EAEOP,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs84.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs6.js");function r(e){return e===!0||e===!1||t.toString.call(e)==="[object Boolean]"}module.exports=r;
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const y=require("./index.cjs6.js"),h=require("./index.cjs86.js"),g=require("./index.cjs87.js"),x=require("./index.cjs88.js"),b=require("./index.cjs89.js"),k=require("./index.cjs90.js"),O=require("./index.cjs91.js"),A=require("./index.cjs92.js"),S=require("./index.cjs93.js"),E=require("./index.cjs94.js"),w=require("./index.cjs95.js"),B=require("./index.cjs96.js"),I=require("./index.cjs97.js"),j=require("./index.cjs98.js"),v=require("./index.cjs99.js"),N=require("./index.cjs100.js"),z=require("./index.cjs7.js"),M=require("./index.cjs9.js"),R=require("./index.cjs101.js"),W=require("./index.cjs102.js"),D=require("./index.cjs103.js"),F=require("./index.cjs104.js"),K=require("./index.cjs105.js"),V=require("./index.cjs106.js"),P=require("./index.cjs11.js"),T=require("./index.cjs12.js"),_=require("./index.cjs13.js"),L=require("./index.cjs107.js"),U=require("./index.cjs108.js"),C=require("./index.cjs109.js"),G=require("./index.cjs110.js"),H=require("./index.cjs111.js"),J=require("./index.cjs112.js"),n=require("./index.cjs113.js"),Q=require("./index.cjs114.js"),s=require("./index.cjs115.js"),X=require("./index.cjs116.js"),Y=require("./index.cjs117.js"),Z=require("./index.cjs118.js"),$=require("./index.cjs119.js"),ee=require("./index.cjs120.js"),re=require("./index.cjs121.js"),ie=require("./index.cjs122.js"),te=require("./index.cjs123.js"),ne=require("./index.cjs124.js"),se=require("./index.cjs125.js"),oe=require("./index.cjs14.js"),ce=require("./index.cjs126.js"),ue=require("./index.cjs127.js"),o=require("./index.cjs128.js"),qe=require("./index.cjs129.js"),ae=require("./index.cjs130.js"),de=require("./index.cjs131.js"),le=require("./index.cjs16.js"),pe=require("./index.cjs17.js"),fe=require("./index.cjs18.js"),me=require("./index.cjs132.js"),ye=require("./index.cjs133.js"),he=require("./index.cjs134.js"),ge=require("./index.cjs135.js"),xe=require("./index.cjs15.js"),be=require("./index.cjs19.js"),ke=require("./index.cjs20.js"),Oe=require("./index.cjs21.js"),Ae=require("./index.cjs136.js"),Se=require("./index.cjs22.js"),Ee=require("./index.cjs23.js"),we=require("./index.cjs137.js"),Be=require("./index.cjs138.js"),Ie=require("./index.cjs139.js"),je=require("./index.cjs140.js"),ve=require("./index.cjs141.js"),Ne=require("./index.cjs142.js"),ze=require("./index.cjs143.js"),Me=require("./index.cjs24.js"),Re=require("./index.cjs144.js"),We=require("./index.cjs145.js"),De=require("./index.cjs146.js"),Fe=require("./index.cjs147.js"),Ke=require("./index.cjs148.js"),Ve=require("./index.cjs149.js"),c=require("./index.cjs150.js"),Pe=require("./index.cjs151.js"),u=require("./index.cjs152.js"),q=require("./index.cjs153.js"),e=require("./index.cjs154.js"),a=require("./index.cjs155.js"),d=require("./index.cjs156.js"),Te=require("./index.cjs157.js"),l=require("./index.cjs158.js"),p=require("./index.cjs159.js"),r=require("./index.cjs160.js"),_e=require("./index.cjs25.js"),Le=require("./index.cjs161.js"),Ue=require("./index.cjs162.js"),Ce=require("./index.cjs163.js"),Ge=require("./index.cjs164.js"),He=require("./index.cjs165.js"),Je=require("./index.cjs166.js"),Qe=require("./index.cjs167.js"),Xe=require("./index.cjs168.js"),Ye=require("./index.cjs169.js"),Ze=require("./index.cjs170.js"),$e=require("./index.cjs171.js"),er=require("./index.cjs172.js"),rr=require("./index.cjs173.js"),ir=require("./index.cjs26.js"),tr=require("./index.cjs27.js"),i=require("./index.cjs174.js"),nr=require("./index.cjs175.js"),sr=require("./index.cjs176.js"),t=require("./index.cjs177.js"),or=require("./index.cjs178.js"),cr=require("./index.cjs179.js"),ur=require("./index.cjs28.js"),f=require("./index.cjs180.js"),qr=require("./index.cjs29.js"),ar=require("./index.cjs181.js"),dr=require("./index.cjs30.js"),m=require("./index.cjs182.js"),lr=require("./index.cjs31.js"),pr=require("./index.cjs183.js"),fr=require("./index.cjs184.js"),mr=require("./index.cjs185.js"),yr=require("./index.cjs85.js");require("./index.cjs32.js");const hr=require("./index.cjs10.js");exports.VERSION=y.VERSION;exports.restArguments=h;exports.isObject=g;exports.isNull=x;exports.isUndefined=b;exports.isBoolean=k;exports.isElement=O;exports.isString=A;exports.isNumber=S;exports.isDate=E;exports.isRegExp=w;exports.isError=B;exports.isSymbol=I;exports.isArrayBuffer=j;exports.isDataView=v;exports.isArray=N;exports.isFunction=z;exports.isArguments=M;exports.isFinite=R;exports.isNaN=W;exports.isTypedArray=D;exports.isEmpty=F;exports.isMatch=K;exports.isEqual=V;exports.isMap=P;exports.isWeakMap=T;exports.isSet=_;exports.isWeakSet=L;exports.keys=U;exports.allKeys=C;exports.values=G;exports.pairs=H;exports.invert=J;exports.functions=n;exports.methods=n;exports.extend=Q;exports.assign=s;exports.extendOwn=s;exports.defaults=X;exports.create=Y;exports.clone=Z;exports.tap=$;exports.get=ee;exports.has=re;exports.mapObject=ie;exports.identity=te;exports.constant=ne;exports.noop=se;exports.toPath=oe;exports.property=ce;exports.propertyOf=ue;exports.matcher=o;exports.matches=o;exports.times=qe;exports.random=ae;exports.now=de;exports.escape=le;exports.unescape=pe;exports.templateSettings=fe;exports.template=me;exports.result=ye;exports.uniqueId=he;exports.chain=ge;exports.iteratee=xe;exports.partial=be;exports.bind=ke;exports.bindAll=Oe;exports.memoize=Ae;exports.delay=Se;exports.defer=Ee;exports.throttle=we;exports.debounce=Be;exports.wrap=Ie;exports.negate=je;exports.compose=ve;exports.after=Ne;exports.before=ze;exports.once=Me;exports.findKey=Re;exports.findIndex=We;exports.findLastIndex=De;exports.sortedIndex=Fe;exports.indexOf=Ke;exports.lastIndexOf=Ve;exports.detect=c;exports.find=c;exports.findWhere=Pe;exports.each=u;exports.forEach=u;exports.collect=q;exports.map=q;exports.foldl=e;exports.inject=e;exports.reduce=e;exports.foldr=a;exports.reduceRight=a;exports.filter=d;exports.select=d;exports.reject=Te;exports.all=l;exports.every=l;exports.any=p;exports.some=p;exports.contains=r;exports.include=r;exports.includes=r;exports.invoke=_e;exports.pluck=Le;exports.where=Ue;exports.max=Ce;exports.min=Ge;exports.shuffle=He;exports.sample=Je;exports.sortBy=Qe;exports.groupBy=Xe;exports.indexBy=Ye;exports.countBy=Ze;exports.partition=$e;exports.toArray=er;exports.size=rr;exports.pick=ir;exports.omit=tr;exports.first=i;exports.head=i;exports.take=i;exports.initial=nr;exports.last=sr;exports.drop=t;exports.rest=t;exports.tail=t;exports.compact=or;exports.flatten=cr;exports.without=ur;exports.uniq=f;exports.unique=f;exports.union=qr;exports.intersection=ar;exports.difference=dr;exports.transpose=m;exports.unzip=m;exports.zip=lr;exports.object=pr;exports.range=fr;exports.chunk=mr;exports.mixin=yr;exports.default=hr;
 //# sourceMappingURL=index.cjs84.js.map

package/dist/index.cjs84.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs84.js","sources":["../../../node_modules/underscore/modules/isBoolean.js"],"sourcesContent":["import { toString } from './_setup.js';\n\n// Is a given value a boolean?\nexport default function isBoolean(obj) {\n  return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n}\n"],"names":["isBoolean","obj","toString"],"mappings":"gDAGA,SAAwBA,EAAUC,EAAK,CACrC,OAAOA,IAAQ,IAAQA,IAAQ,IAASC,EAAAA,SAAS,KAAKD,CAAG,IAAM,kBACjE","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs84.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/index.cjs85.js

@@ -1,2 +1,2 @@
-"use strict";function t(e){return!!(e&&e.nodeType===1)}module.exports=t;
+"use strict";const r=require("./index.cjs10.js"),s=require("./index.cjs152.js"),i=require("./index.cjs113.js"),c=require("./index.cjs6.js"),o=require("./index.cjs248.js");function p(e){return s(i(e),function(t){var u=r[t]=e[t];r.prototype[t]=function(){var n=[this._wrapped];return c.push.apply(n,arguments),o(this,u.apply(r,n))}}),r}module.exports=p;
 //# sourceMappingURL=index.cjs85.js.map

package/dist/index.cjs85.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs85.js","sources":["../../../node_modules/underscore/modules/isElement.js"],"sourcesContent":["// Is a given value a DOM element?\nexport default function isElement(obj) {\n  return !!(obj && obj.nodeType === 1);\n}\n"],"names":["isElement","obj"],"mappings":"aACA,SAAwBA,EAAUC,EAAK,CACrC,MAAO,CAAC,EAAEA,GAAOA,EAAI,WAAa,EACpC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs85.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":"2KAOA,SAAwBA,EAAMC,EAAK,CACjC,OAAAC,EAAKC,EAAUF,CAAG,EAAG,SAASG,EAAM,CAClC,IAAIC,EAAOC,EAAEF,CAAI,EAAIH,EAAIG,CAAI,EAC7BE,EAAE,UAAUF,CAAI,EAAI,UAAW,CAC7B,IAAIG,EAAO,CAAC,KAAK,QAAQ,EACzBC,OAAAA,OAAK,MAAMD,EAAM,SAAS,EACnBE,EAAY,KAAMJ,EAAK,MAAMC,EAAGC,CAAI,CAAC,CAC9C,CACF,CAAC,EACMD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs86.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs221.js"),r=t("String");module.exports=r;
+"use strict";function u(s,r){return r=r==null?s.length-1:+r,function(){for(var t=Math.max(arguments.length-r,0),a=Array(t),e=0;e<t;e++)a[e]=arguments[e+r];switch(r){case 0:return s.call(this,a);case 1:return s.call(this,arguments[0],a);case 2:return s.call(this,arguments[0],arguments[1],a)}var l=Array(r+1);for(e=0;e<r;e++)l[e]=arguments[e];return l[r]=a,s.apply(this,l)}}module.exports=u;
 //# sourceMappingURL=index.cjs86.js.map

package/dist/index.cjs86.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs86.js","sources":["../../../node_modules/underscore/modules/isString.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('String');\n"],"names":["isString","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs86.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":"aAKA,SAAwBA,EAAcC,EAAMC,EAAY,CACtD,OAAAA,EAAaA,GAAc,KAAOD,EAAK,OAAS,EAAI,CAACC,EAC9C,UAAW,CAIhB,QAHIC,EAAS,KAAK,IAAI,UAAU,OAASD,EAAY,CAAC,EAClDE,EAAO,MAAMD,CAAM,EACnBE,EAAQ,EACLA,EAAQF,EAAQE,IACrBD,EAAKC,CAAK,EAAI,UAAUA,EAAQH,CAAU,EAE5C,OAAQA,EAAA,CACN,IAAK,GAAG,OAAOD,EAAK,KAAK,KAAMG,CAAI,EACnC,IAAK,GAAG,OAAOH,EAAK,KAAK,KAAM,UAAU,CAAC,EAAGG,CAAI,EACjD,IAAK,GAAG,OAAOH,EAAK,KAAK,KAAM,UAAU,CAAC,EAAG,UAAU,CAAC,EAAGG,CAAI,CAAA,CAEjE,IAAIE,EAAO,MAAMJ,EAAa,CAAC,EAC/B,IAAKG,EAAQ,EAAGA,EAAQH,EAAYG,IAClCC,EAAKD,CAAK,EAAI,UAAUA,CAAK,EAE/B,OAAAC,EAAKJ,CAAU,EAAIE,EACZH,EAAK,MAAM,KAAMK,CAAI,CAC9B,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs87.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs221.js"),r=e("Number");module.exports=r;
+"use strict";function c(t){var e=typeof t;return e==="function"||e==="object"&&!!t}module.exports=c;
 //# sourceMappingURL=index.cjs87.js.map

package/dist/index.cjs87.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs87.js","sources":["../../../node_modules/underscore/modules/isNumber.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Number');\n"],"names":["isNumber","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs87.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,EAAK,CACpC,IAAIC,EAAO,OAAOD,EAClB,OAAOC,IAAS,YAAeA,IAAS,UAAY,CAAC,CAACD,CACxD","x_google_ignoreList":[0]}

package/dist/index.cjs88.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs221.js"),e=t("Date");module.exports=e;
+"use strict";function u(t){return t===null}module.exports=u;
 //# sourceMappingURL=index.cjs88.js.map

package/dist/index.cjs88.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs88.js","sources":["../../../node_modules/underscore/modules/isDate.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Date');\n"],"names":["isDate","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,MAAM","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs88.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,EAAK,CAClC,OAAOA,IAAQ,IACjB","x_google_ignoreList":[0]}

package/dist/index.cjs89.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs221.js"),s=e("RegExp");module.exports=s;
+"use strict";function i(e){return e===void 0}module.exports=i;
 //# sourceMappingURL=index.cjs89.js.map

package/dist/index.cjs89.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs89.js","sources":["../../../node_modules/underscore/modules/isRegExp.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('RegExp');\n"],"names":["isRegExp","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs89.js","sources":["../../../node_modules/underscore/modules/isUndefined.js"],"sourcesContent":["// Is a given variable undefined?\nexport default function isUndefined(obj) {\n  return obj === void 0;\n}\n"],"names":["isUndefined","obj"],"mappings":"aACA,SAAwBA,EAAYC,EAAK,CACvC,OAAOA,IAAQ,MACjB","x_google_ignoreList":[0]}

package/dist/index.cjs9.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs221.js"),s=require("./index.cjs222.js");var e=r("Arguments");(function(){e(arguments)||(e=function(t){return s(t,"callee")})})();const n=e;module.exports=n;
+"use strict";const r=require("./index.cjs222.js"),s=require("./index.cjs223.js");var e=r("Arguments");(function(){e(arguments)||(e=function(t){return s(t,"callee")})})();const n=e;module.exports=n;
 //# sourceMappingURL=index.cjs9.js.map

package/dist/index.cjs90.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs221.js"),s=r("Error");module.exports=s;
+"use strict";const t=require("./index.cjs6.js");function r(e){return e===!0||e===!1||t.toString.call(e)==="[object Boolean]"}module.exports=r;
 //# sourceMappingURL=index.cjs90.js.map

package/dist/index.cjs90.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs90.js","sources":["../../../node_modules/underscore/modules/isError.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Error');\n"],"names":["isError","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,OAAO","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs90.js","sources":["../../../node_modules/underscore/modules/isBoolean.js"],"sourcesContent":["import { toString } from './_setup.js';\n\n// Is a given value a boolean?\nexport default function isBoolean(obj) {\n  return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n}\n"],"names":["isBoolean","obj","toString"],"mappings":"gDAGA,SAAwBA,EAAUC,EAAK,CACrC,OAAOA,IAAQ,IAAQA,IAAQ,IAASC,EAAAA,SAAS,KAAKD,CAAG,IAAM,kBACjE","x_google_ignoreList":[0]}

package/dist/index.cjs91.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs221.js"),t=s("Symbol");module.exports=t;
+"use strict";function t(e){return!!(e&&e.nodeType===1)}module.exports=t;
 //# sourceMappingURL=index.cjs91.js.map

package/dist/index.cjs91.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs91.js","sources":["../../../node_modules/underscore/modules/isSymbol.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Symbol');\n"],"names":["isSymbol","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs91.js","sources":["../../../node_modules/underscore/modules/isElement.js"],"sourcesContent":["// Is a given value a DOM element?\nexport default function isElement(obj) {\n  return !!(obj && obj.nodeType === 1);\n}\n"],"names":["isElement","obj"],"mappings":"aACA,SAAwBA,EAAUC,EAAK,CACrC,MAAO,CAAC,EAAEA,GAAOA,EAAI,WAAa,EACpC","x_google_ignoreList":[0]}

package/dist/index.cjs92.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs221.js"),e=r("ArrayBuffer");module.exports=e;
+"use strict";const t=require("./index.cjs222.js"),r=t("String");module.exports=r;
 //# sourceMappingURL=index.cjs92.js.map

package/dist/index.cjs92.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs92.js","sources":["../../../node_modules/underscore/modules/isArrayBuffer.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('ArrayBuffer');\n"],"names":["isArrayBuffer","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,aAAa","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs92.js","sources":["../../../node_modules/underscore/modules/isString.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('String');\n"],"names":["isString","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}

package/dist/index.cjs93.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs221.js"),r=require("./index.cjs7.js"),i=require("./index.cjs92.js"),s=require("./index.cjs8.js");var a=t("DataView");function n(e){return e!=null&&r(e.getInt8)&&i(e.buffer)}const u=s.hasStringTagBug?n:a;module.exports=u;
+"use strict";const e=require("./index.cjs222.js"),r=e("Number");module.exports=r;
 //# sourceMappingURL=index.cjs93.js.map

package/dist/index.cjs93.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs93.js","sources":["../../../node_modules/underscore/modules/isDataView.js"],"sourcesContent":["import tagTester from './_tagTester.js';\nimport isFunction from './isFunction.js';\nimport isArrayBuffer from './isArrayBuffer.js';\nimport { hasStringTagBug } from './_stringTagBug.js';\n\nvar isDataView = tagTester('DataView');\n\n// In IE 10 - Edge 13, we need a different heuristic\n// to determine whether an object is a `DataView`.\nfunction ie10IsDataView(obj) {\n  return obj != null && isFunction(obj.getInt8) && isArrayBuffer(obj.buffer);\n}\n\nexport default (hasStringTagBug ? ie10IsDataView : isDataView);\n"],"names":["isDataView","tagTester","ie10IsDataView","obj","isFunction","isArrayBuffer","isDataView$1","hasStringTagBug"],"mappings":"0IAKA,IAAIA,EAAaC,EAAU,UAAU,EAIrC,SAASC,EAAeC,EAAK,CAC3B,OAAOA,GAAO,MAAQC,EAAWD,EAAI,OAAO,GAAKE,EAAcF,EAAI,MAAM,CAC3E,CAEA,MAAAG,EAAgBC,EAAAA,gBAAkBL,EAAiBF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs93.js","sources":["../../../node_modules/underscore/modules/isNumber.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Number');\n"],"names":["isNumber","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}

package/dist/index.cjs94.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs6.js"),e=require("./index.cjs221.js"),s=r.nativeIsArray||e("Array");module.exports=s;
+"use strict";const t=require("./index.cjs222.js"),e=t("Date");module.exports=e;
 //# sourceMappingURL=index.cjs94.js.map

package/dist/index.cjs94.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs94.js","sources":["../../../node_modules/underscore/modules/isArray.js"],"sourcesContent":["import { nativeIsArray } from './_setup.js';\nimport tagTester from './_tagTester.js';\n\n// Is a given value an array?\n// Delegates to ECMA5's native `Array.isArray`.\nexport default nativeIsArray || tagTester('Array');\n"],"names":["isArray","nativeIsArray","tagTester"],"mappings":"+EAKAA,EAAeC,EAAAA,eAAiBC,EAAU,OAAO","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs94.js","sources":["../../../node_modules/underscore/modules/isDate.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Date');\n"],"names":["isDate","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,MAAM","x_google_ignoreList":[0]}

package/dist/index.cjs95.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs6.js"),s=require("./index.cjs91.js");function t(i){return!s(i)&&e._isFinite(i)&&!isNaN(parseFloat(i))}module.exports=t;
+"use strict";const e=require("./index.cjs222.js"),s=e("RegExp");module.exports=s;
 //# sourceMappingURL=index.cjs95.js.map

package/dist/index.cjs95.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs95.js","sources":["../../../node_modules/underscore/modules/isFinite.js"],"sourcesContent":["import { _isFinite } from './_setup.js';\nimport isSymbol from './isSymbol.js';\n\n// Is a given object a finite number?\nexport default function isFinite(obj) {\n  return !isSymbol(obj) && _isFinite(obj) && !isNaN(parseFloat(obj));\n}\n"],"names":["isFinite","obj","isSymbol","_isFinite"],"mappings":"8EAIA,SAAwBA,EAASC,EAAK,CACpC,MAAO,CAACC,EAASD,CAAG,GAAKE,EAAAA,UAAUF,CAAG,GAAK,CAAC,MAAM,WAAWA,CAAG,CAAC,CACnE","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs95.js","sources":["../../../node_modules/underscore/modules/isRegExp.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('RegExp');\n"],"names":["isRegExp","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}

package/dist/index.cjs96.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs6.js"),s=require("./index.cjs87.js");function t(e){return s(e)&&r._isNaN(e)}module.exports=t;
+"use strict";const r=require("./index.cjs222.js"),s=r("Error");module.exports=s;
 //# sourceMappingURL=index.cjs96.js.map

package/dist/index.cjs96.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs96.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":"8EAIA,SAAwBA,EAAMC,EAAK,CACjC,OAAOC,EAASD,CAAG,GAAKE,EAAAA,OAAOF,CAAG,CACpC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs96.js","sources":["../../../node_modules/underscore/modules/isError.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Error');\n"],"names":["isError","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,OAAO","x_google_ignoreList":[0]}

package/dist/index.cjs97.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs6.js"),r=require("./index.cjs93.js"),i=require("./index.cjs118.js"),s=require("./index.cjs223.js");var n=/\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;function a(t){return e.nativeIsView?e.nativeIsView(t)&&!r(t):s(t)&&n.test(e.toString.call(t))}const u=e.supportsArrayBuffer?a:i(!1);module.exports=u;
+"use strict";const s=require("./index.cjs222.js"),t=s("Symbol");module.exports=t;
 //# sourceMappingURL=index.cjs97.js.map

package/dist/index.cjs97.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs97.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":"4IAMA,IAAIA,EAAoB,8EACxB,SAASC,EAAaC,EAAK,CAGzB,OAAOC,EAAAA,aAAgBA,EAAAA,aAAaD,CAAG,GAAK,CAACE,EAAWF,CAAG,EAC7CG,EAAaH,CAAG,GAAKF,EAAkB,KAAKM,EAAAA,SAAS,KAAKJ,CAAG,CAAC,CAC9E,CAEA,MAAAK,EAAeC,sBAAsBP,EAAeQ,EAAS,EAAK","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs97.js","sources":["../../../node_modules/underscore/modules/isSymbol.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('Symbol');\n"],"names":["isSymbol","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,QAAQ","x_google_ignoreList":[0]}

package/dist/index.cjs98.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs224.js"),n=require("./index.cjs94.js"),i=require("./index.cjs86.js"),s=require("./index.cjs9.js"),u=require("./index.cjs102.js");function c(r){if(r==null)return!0;var e=t(r);return typeof e=="number"&&(n(r)||i(r)||s(r))?e===0:t(u(r))===0}module.exports=c;
+"use strict";const r=require("./index.cjs222.js"),e=r("ArrayBuffer");module.exports=e;
 //# sourceMappingURL=index.cjs98.js.map

package/dist/index.cjs98.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs98.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":"0KAQA,SAAwBA,EAAQC,EAAK,CACnC,GAAIA,GAAO,KAAM,MAAO,GAGxB,IAAIC,EAASC,EAAUF,CAAG,EAC1B,OAAI,OAAOC,GAAU,WACnBE,EAAQH,CAAG,GAAKI,EAASJ,CAAG,GAAKK,EAAYL,CAAG,GACxCC,IAAW,EACdC,EAAUI,EAAKN,CAAG,CAAC,IAAM,CAClC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs98.js","sources":["../../../node_modules/underscore/modules/isArrayBuffer.js"],"sourcesContent":["import tagTester from './_tagTester.js';\n\nexport default tagTester('ArrayBuffer');\n"],"names":["isArrayBuffer","tagTester"],"mappings":"kDAEAA,EAAeC,EAAU,aAAa","x_google_ignoreList":[0]}

package/dist/index.cjs99.js

@@ -1,2 +1,2 @@
-"use strict";const f=require("./index.cjs102.js");function i(n,t){var u=f(t),s=u.length;if(n==null)return!s;for(var a=Object(n),r=0;r<s;r++){var e=u[r];if(t[e]!==a[e]||!(e in a))return!1}return!0}module.exports=i;
+"use strict";const t=require("./index.cjs222.js"),r=require("./index.cjs7.js"),i=require("./index.cjs98.js"),s=require("./index.cjs8.js");var a=t("DataView");function n(e){return e!=null&&r(e.getInt8)&&i(e.buffer)}const u=s.hasStringTagBug?n:a;module.exports=u;
 //# sourceMappingURL=index.cjs99.js.map

package/dist/index.cjs99.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs99.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":"kDAGA,SAAwBA,EAAQC,EAAQC,EAAO,CAC7C,IAAIC,EAAQC,EAAKF,CAAK,EAAGG,EAASF,EAAM,OACxC,GAAIF,GAAU,KAAM,MAAO,CAACI,EAE5B,QADIC,EAAM,OAAOL,CAAM,EACdM,EAAI,EAAGA,EAAIF,EAAQE,IAAK,CAC/B,IAAIC,EAAML,EAAMI,CAAC,EACjB,GAAIL,EAAMM,CAAG,IAAMF,EAAIE,CAAG,GAAK,EAAEA,KAAOF,GAAM,MAAO,EACvD,CACA,MAAO,EACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs99.js","sources":["../../../node_modules/underscore/modules/isDataView.js"],"sourcesContent":["import tagTester from './_tagTester.js';\nimport isFunction from './isFunction.js';\nimport isArrayBuffer from './isArrayBuffer.js';\nimport { hasStringTagBug } from './_stringTagBug.js';\n\nvar isDataView = tagTester('DataView');\n\n// In IE 10 - Edge 13, we need a different heuristic\n// to determine whether an object is a `DataView`.\nfunction ie10IsDataView(obj) {\n  return obj != null && isFunction(obj.getInt8) && isArrayBuffer(obj.buffer);\n}\n\nexport default (hasStringTagBug ? ie10IsDataView : isDataView);\n"],"names":["isDataView","tagTester","ie10IsDataView","obj","isFunction","isArrayBuffer","isDataView$1","hasStringTagBug"],"mappings":"0IAKA,IAAIA,EAAaC,EAAU,UAAU,EAIrC,SAASC,EAAeC,EAAK,CAC3B,OAAOA,GAAO,MAAQC,EAAWD,EAAI,OAAO,GAAKE,EAAcF,EAAI,MAAM,CAC3E,CAEA,MAAAG,EAAgBC,EAAAA,gBAAkBL,EAAiBF","x_google_ignoreList":[0]}

package/dist/index.es100.js

@@ -1,78 +1,7 @@
-import m from "./index.es10.js";
-import { toString as g, SymbolProto as h } from "./index.es6.js";
-import j from "./index.es225.js";
-import D from "./index.es97.js";
-import y from "./index.es7.js";
-import { hasStringTagBug as V } from "./index.es8.js";
-import v from "./index.es93.js";
-import w from "./index.es102.js";
-import q from "./index.es222.js";
-import d from "./index.es226.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) {
-    // These types are compared by value.
-    case "[object RegExp]":
-    // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')
-    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);
-}
+import { nativeIsArray as r } from "./index.es6.js";
+import t from "./index.es222.js";
+const e = r || t("Array");
 export {
-  z as default
+  e as default
 };
 //# sourceMappingURL=index.es100.js.map

package/dist/index.es100.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es100.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,EAAG,QAAOD,MAAM,KAAK,IAAIA,MAAM,IAAIC;AAE7C,MAAID,KAAK,QAAQC,KAAK,KAAM,QAAO;AAEnC,MAAID,MAAMA,EAAG,QAAOC,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;AAE1B,MAAIM,IAAYC,EAAS,KAAKR,CAAC;AAC/B,MAAIO,MAAcC,EAAS,KAAKP,CAAC,EAAG,QAAO;AAE3C,MAAIQ,KAAmBF,KAAa,qBAAqBG,EAAWV,CAAC,GAAG;AACtE,QAAI,CAACU,EAAWT,CAAC,EAAG,QAAO;AAC3B,IAAAM,IAAYT;AAAA,EACd;AACA,UAAQS,GAAA;AAAA;AAAA,IAEN,KAAK;AAAA;AAAA,IAEL,KAAK;AAGH,aAAO,KAAKP,KAAM,KAAKC;AAAA,IACzB,KAAK;AAGH,aAAI,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;AAIH,aAAO,CAACD,KAAM,CAACC;AAAA,IACjB,KAAK;AACH,aAAOU,EAAY,QAAQ,KAAKX,CAAC,MAAMW,EAAY,QAAQ,KAAKV,CAAC;AAAA,IACnE,KAAK;AAAA,IACL,KAAKH;AAEH,aAAOO,EAAOO,EAAaZ,CAAC,GAAGY,EAAaX,CAAC,GAAGC,GAAQC,CAAM;AAAA,EAAA;AAGlE,MAAIU,IAAYN,MAAc;AAC9B,MAAI,CAACM,KAAaC,EAAad,CAAC,GAAG;AAC/B,QAAIe,IAAaC,EAAchB,CAAC;AAChC,QAAIe,MAAeC,EAAcf,CAAC,EAAG,QAAO;AAC5C,QAAID,EAAE,WAAWC,EAAE,UAAUD,EAAE,eAAeC,EAAE,WAAY,QAAO;AACnE,IAAAY,IAAY;AAAA,EAChB;AACA,MAAI,CAACA,GAAW;AACd,QAAI,OAAOb,KAAK,YAAY,OAAOC,KAAK,SAAU,QAAO;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;AAC7D,aAAO;AAAA,EAEX;AAMA,EAAAC,IAASA,KAAU,CAAA,GACnBC,IAASA,KAAU,CAAA;AAEnB,WADIiB,IAASlB,EAAO,QACbkB;AAGL,QAAIlB,EAAOkB,CAAM,MAAMpB,EAAG,QAAOG,EAAOiB,CAAM,MAAMnB;AAQtD,MAJAC,EAAO,KAAKF,CAAC,GACbG,EAAO,KAAKF,CAAC,GAGTY,GAAW;AAGb,QADAO,IAASpB,EAAE,QACPoB,MAAWnB,EAAE,OAAQ,QAAO;AAEhC,WAAOmB;AACL,UAAI,CAACrB,EAAGC,EAAEoB,CAAM,GAAGnB,EAAEmB,CAAM,GAAGlB,GAAQC,CAAM,EAAG,QAAO;AAAA,EAE1D,OAAO;AAEL,QAAIkB,IAAQC,EAAKtB,CAAC,GAAGuB;AAGrB,QAFAH,IAASC,EAAM,QAEXC,EAAKrB,CAAC,EAAE,WAAWmB,EAAQ,QAAO;AACtC,WAAOA;AAGL,UADAG,IAAMF,EAAMD,CAAM,GACd,EAAEI,EAAIvB,GAAGsB,CAAG,KAAKxB,EAAGC,EAAEuB,CAAG,GAAGtB,EAAEsB,CAAG,GAAGrB,GAAQC,CAAM,GAAI,QAAO;AAAA,EAErE;AAEA,SAAAD,EAAO,IAAA,GACPC,EAAO,IAAA,GACA;AACT;AAGA,SAAwBsB,EAAQzB,GAAGC,GAAG;AACpC,SAAOF,EAAGC,GAAGC,CAAC;AAChB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es100.js","sources":["../../../node_modules/underscore/modules/isArray.js"],"sourcesContent":["import { nativeIsArray } from './_setup.js';\nimport tagTester from './_tagTester.js';\n\n// Is a given value an array?\n// Delegates to ECMA5's native `Array.isArray`.\nexport default nativeIsArray || tagTester('Array');\n"],"names":["isArray","nativeIsArray","tagTester"],"mappings":";;AAKA,MAAAA,IAAeC,KAAiBC,EAAU,OAAO;","x_google_ignoreList":[0]}

package/dist/index.es101.js

@@ -1,6 +1,9 @@
-import e from "./index.es221.js";
-const a = e("WeakSet");
+import { _isFinite as t } from "./index.es6.js";
+import r from "./index.es97.js";
+function s(i) {
+  return !r(i) && t(i) && !isNaN(parseFloat(i));
+}
 export {
-  a as default
+  s as default
 };
 //# sourceMappingURL=index.es101.js.map

package/dist/index.es101.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es101.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,MAAAA,IAAeC,EAAU,SAAS;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es101.js","sources":["../../../node_modules/underscore/modules/isFinite.js"],"sourcesContent":["import { _isFinite } from './_setup.js';\nimport isSymbol from './isSymbol.js';\n\n// Is a given object a finite number?\nexport default function isFinite(obj) {\n  return !isSymbol(obj) && _isFinite(obj) && !isNaN(parseFloat(obj));\n}\n"],"names":["isFinite","obj","isSymbol","_isFinite"],"mappings":";;AAIA,SAAwBA,EAASC,GAAK;AACpC,SAAO,CAACC,EAASD,CAAG,KAAKE,EAAUF,CAAG,KAAK,CAAC,MAAM,WAAWA,CAAG,CAAC;AACnE;","x_google_ignoreList":[0]}

package/dist/index.es102.js

@@ -1,15 +1,9 @@
-import e from "./index.es81.js";
-import { nativeKeys as f, hasEnumBug as m } from "./index.es6.js";
-import n from "./index.es222.js";
-import o from "./index.es228.js";
-function c(r) {
-  if (!e(r)) return [];
-  if (f) return f(r);
-  var t = [];
-  for (var i in r) n(r, i) && t.push(i);
-  return m && o(r, t), t;
+import { _isNaN as i } from "./index.es6.js";
+import t from "./index.es93.js";
+function N(r) {
+  return t(r) && i(r);
 }
 export {
-  c as default
+  N as default
 };
 //# sourceMappingURL=index.es102.js.map

package/dist/index.es102.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es102.js","sources":["../../../node_modules/underscore/modules/keys.js"],"sourcesContent":["import isObject from './isObject.js';\nimport { nativeKeys, hasEnumBug } from './_setup.js';\nimport has from './_has.js';\nimport collectNonEnumProps from './_collectNonEnumProps.js';\n\n// Retrieve the names of an object's own properties.\n// Delegates to **ECMAScript 5**'s native `Object.keys`.\nexport default function keys(obj) {\n  if (!isObject(obj)) return [];\n  if (nativeKeys) return nativeKeys(obj);\n  var keys = [];\n  for (var key in obj) if (has(obj, key)) keys.push(key);\n  // Ahem, IE < 9.\n  if (hasEnumBug) collectNonEnumProps(obj, keys);\n  return keys;\n}\n"],"names":["keys","obj","isObject","nativeKeys","key","has","hasEnumBug","collectNonEnumProps"],"mappings":";;;;AAOA,SAAwBA,EAAKC,GAAK;AAChC,MAAI,CAACC,EAASD,CAAG,UAAU,CAAA;AAC3B,MAAIE,EAAY,QAAOA,EAAWF,CAAG;AACrC,MAAID,IAAO,CAAA;AACX,WAASI,KAAOH,EAAK,CAAII,EAAIJ,GAAKG,CAAG,KAAGJ,EAAK,KAAKI,CAAG;AAErD,SAAIE,KAAYC,EAAoBN,GAAKD,CAAI,GACtCA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es102.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.es103.js

@@ -1,13 +1,13 @@
-import e from "./index.es81.js";
-import { hasEnumBug as f } from "./index.es6.js";
-import i from "./index.es228.js";
-function s(r) {
-  if (!e(r)) return [];
-  var o = [];
-  for (var t in r) o.push(t);
-  return f && i(r, o), o;
+import { supportsArrayBuffer as i, nativeIsView as t, toString as a } from "./index.es6.js";
+import e from "./index.es99.js";
+import o from "./index.es124.js";
+import n from "./index.es224.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 {
-  s as default
+  u as default
 };
 //# sourceMappingURL=index.es103.js.map

package/dist/index.es103.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es103.js","sources":["../../../node_modules/underscore/modules/allKeys.js"],"sourcesContent":["import isObject from './isObject.js';\nimport { hasEnumBug } from './_setup.js';\nimport collectNonEnumProps from './_collectNonEnumProps.js';\n\n// Retrieve all the enumerable property names of an object.\nexport default function allKeys(obj) {\n  if (!isObject(obj)) return [];\n  var keys = [];\n  for (var key in obj) keys.push(key);\n  // Ahem, IE < 9.\n  if (hasEnumBug) collectNonEnumProps(obj, keys);\n  return keys;\n}\n"],"names":["allKeys","obj","isObject","keys","key","hasEnumBug","collectNonEnumProps"],"mappings":";;;AAKA,SAAwBA,EAAQC,GAAK;AACnC,MAAI,CAACC,EAASD,CAAG,UAAU,CAAA;AAC3B,MAAIE,IAAO,CAAA;AACX,WAASC,KAAOH,EAAK,CAAAE,EAAK,KAAKC,CAAG;AAElC,SAAIC,KAAYC,EAAoBL,GAAKE,CAAI,GACtCA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es103.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.es104.js

@@ -1,10 +1,14 @@
-import l from "./index.es102.js";
-function s(a) {
-  for (var e = l(a), t = e.length, v = Array(t), r = 0; r < t; r++)
-    v[r] = a[e[r]];
-  return v;
+import e from "./index.es225.js";
+import i from "./index.es100.js";
+import m from "./index.es92.js";
+import n from "./index.es9.js";
+import f from "./index.es108.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 {
-  s as default
+  a as default
 };
 //# sourceMappingURL=index.es104.js.map

package/dist/index.es104.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es104.js","sources":["../../../node_modules/underscore/modules/values.js"],"sourcesContent":["import keys from './keys.js';\n\n// Retrieve the values of an object's properties.\nexport default function values(obj) {\n  var _keys = keys(obj);\n  var length = _keys.length;\n  var values = Array(length);\n  for (var i = 0; i < length; i++) {\n    values[i] = obj[_keys[i]];\n  }\n  return values;\n}\n"],"names":["values","obj","_keys","keys","length","i"],"mappings":";AAGA,SAAwBA,EAAOC,GAAK;AAIlC,WAHIC,IAAQC,EAAKF,CAAG,GAChBG,IAASF,EAAM,QACfF,IAAS,MAAMI,CAAM,GAChBC,IAAI,GAAGA,IAAID,GAAQC;AAC1BL,IAAAA,EAAOK,CAAC,IAAIJ,EAAIC,EAAMG,CAAC,CAAC;AAE1B,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es104.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,KAAM,QAAO;AAGxB,MAAIC,IAASC,EAAUF,CAAG;AAC1B,SAAI,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.es105.js

@@ -1,10 +1,14 @@
-import s from "./index.es102.js";
-function o(e) {
-  for (var a = s(e), t = a.length, n = Array(t), r = 0; r < t; r++)
-    n[r] = [a[r], e[a[r]]];
-  return n;
+import l from "./index.es108.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 {
-  o as default
+  i as default
 };
 //# sourceMappingURL=index.es105.js.map

package/dist/index.es105.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es105.js","sources":["../../../node_modules/underscore/modules/pairs.js"],"sourcesContent":["import keys from './keys.js';\n\n// Convert an object into a list of `[key, value]` pairs.\n// The opposite of `_.object` with one argument.\nexport default function pairs(obj) {\n  var _keys = keys(obj);\n  var length = _keys.length;\n  var pairs = Array(length);\n  for (var i = 0; i < length; i++) {\n    pairs[i] = [_keys[i], obj[_keys[i]]];\n  }\n  return pairs;\n}\n"],"names":["pairs","obj","_keys","keys","length","i"],"mappings":";AAIA,SAAwBA,EAAMC,GAAK;AAIjC,WAHIC,IAAQC,EAAKF,CAAG,GAChBG,IAASF,EAAM,QACfF,IAAQ,MAAMI,CAAM,GACfC,IAAI,GAAGA,IAAID,GAAQC;AAC1BL,IAAAA,EAAMK,CAAC,IAAI,CAACH,EAAMG,CAAC,GAAGJ,EAAIC,EAAMG,CAAC,CAAC,CAAC;AAErC,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es105.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":";AAGA,SAAwBA,EAAQC,GAAQC,GAAO;AAC7C,MAAIC,IAAQC,EAAKF,CAAK,GAAGG,IAASF,EAAM;AACxC,MAAIF,KAAU,KAAM,QAAO,CAACI;AAE5B,WADIC,IAAM,OAAOL,CAAM,GACdM,IAAI,GAAGA,IAAIF,GAAQE,KAAK;AAC/B,QAAIC,IAAML,EAAMI,CAAC;AACjB,QAAIL,EAAMM,CAAG,MAAMF,EAAIE,CAAG,KAAK,EAAEA,KAAOF,GAAM,QAAO;AAAA,EACvD;AACA,SAAO;AACT;","x_google_ignoreList":[0]}