@performant-software/visualize 3.0.7 → 3.1.0-beta.1

package/dist/index.es172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es172.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.es172.js","sources":["../../../node_modules/underscore/modules/last.js"],"sourcesContent":["import rest from './rest.js';\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport default function last(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[array.length - 1];\n  return rest(array, Math.max(0, array.length - n));\n}\n"],"names":["last","array","n","guard","rest"],"mappings":";AAIwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AACxC,SAAAF,KAAS,QAAQA,EAAM,SAAS,IAAUC,KAAK,QAAQC,IAAQ,SAAS,CAAA,IACxED,KAAK,QAAQC,IAAcF,EAAMA,EAAM,SAAS,CAAC,IAC9CG,EAAKH,GAAO,KAAK,IAAI,GAAGA,EAAM,SAASC,CAAC,CAAC;AAClD;","x_google_ignoreList":[0]}

package/dist/index.es173.js

@@ -1,12 +1,8 @@
-function o(e) {
-  "@babel/helpers - typeof";
-  return o = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(t) {
-    return typeof t;
-  } : function(t) {
-    return t && typeof Symbol == "function" && t.constructor === Symbol && t !== Symbol.prototype ? "symbol" : typeof t;
-  }, o(e);
+import { slice as e } from "./index.es6.js";
+function u(r, l, t) {
+  return e.call(r, l == null || t ? 1 : l);
 }
 export {
-  o as default
+  u as default
 };
 //# sourceMappingURL=index.es173.js.map

package/dist/index.es173.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es173.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}"],"names":["_typeof","o"],"mappings":"AAAA,SAAwBA,EAAQC,GAAG;AACjC;AAEO,SAAAD,IAAwB,OAAO,UAArB,cAA2C,OAAO,OAAO,YAA1B,WAAqC,SAAUC,GAAG;AAChG,WAAO,OAAOA;AAAAA,EAChB,IAAI,SAAUA,GAAG;AACRA,WAAAA,KAAmB,OAAO,UAArB,cAA+BA,EAAE,gBAAgB,UAAUA,MAAM,OAAO,YAAY,WAAW,OAAOA;AAAAA,EAAA,GACjHD,EAAQC,CAAC;AACd;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es173.js","sources":["../../../node_modules/underscore/modules/rest.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the first entry of the `array`. Especially useful on\n// the `arguments` object. Passing an **n** will return the rest N values in the\n// `array`.\nexport default function rest(array, n, guard) {\n  return slice.call(array, n == null || guard ? 1 : n);\n}\n"],"names":["rest","array","n","guard","slice"],"mappings":";AAKwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAOC,EAAM,KAAKH,GAAOC,KAAK,QAAQC,IAAQ,IAAID,CAAC;AACrD;","x_google_ignoreList":[0]}

package/dist/index.es174.js

@@ -1,8 +1,8 @@
-function c(a, n) {
-  if (!(a instanceof n))
-    throw new TypeError("Cannot call a class as a function");
+import t from "./index.es152.js";
+function e(o) {
+  return t(o, Boolean);
 }
 export {
-  c as default
+  e as default
 };
 //# sourceMappingURL=index.es174.js.map

package/dist/index.es174.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es174.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js"],"sourcesContent":["export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}"],"names":["_classCallCheck","instance","Constructor"],"mappings":"AAAwB,SAAAA,EAAgBC,GAAUC,GAAa;AACzD,MAAA,EAAED,aAAoBC;AAClB,UAAA,IAAI,UAAU,mCAAmC;AAE3D;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es174.js","sources":["../../../node_modules/underscore/modules/compact.js"],"sourcesContent":["import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n  return filter(array, Boolean);\n}\n"],"names":["compact","array","filter"],"mappings":";AAGA,SAAwBA,EAAQC,GAAO;AAC9B,SAAAC,EAAOD,GAAO,OAAO;AAC9B;","x_google_ignoreList":[0]}

package/dist/index.es175.js

@@ -1,16 +1,8 @@
-import t from "./index.es239.js";
-function n(f, l) {
-  for (var a = 0; a < l.length; a++) {
-    var e = l[a];
-    e.enumerable = e.enumerable || !1, e.configurable = !0, "value" in e && (e.writable = !0), Object.defineProperty(f, t(e.key), e);
-  }
-}
-function u(f, l, a) {
-  return l && n(f.prototype, l), a && n(f, a), Object.defineProperty(f, "prototype", {
-    writable: !1
-  }), f;
+import f from "./index.es228.js";
+function n(t, e) {
+  return f(t, e, !1);
 }
 export {
-  u as default
+  n as default
 };
 //# sourceMappingURL=index.es175.js.map

package/dist/index.es175.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es175.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/createClass.js"],"sourcesContent":["import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, toPropertyKey(descriptor.key), descriptor);\n  }\n}\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}"],"names":["_defineProperties","target","props","i","descriptor","toPropertyKey","_createClass","Constructor","protoProps","staticProps"],"mappings":";AACA,SAASA,EAAkBC,GAAQC,GAAO;AACxC,WAASC,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK;AACjC,QAAAC,IAAaF,EAAMC,CAAC;AACb,IAAAC,EAAA,aAAaA,EAAW,cAAc,IACjDA,EAAW,eAAe,IACtB,WAAWA,MAAYA,EAAW,WAAW,KACjD,OAAO,eAAeH,GAAQI,EAAcD,EAAW,GAAG,GAAGA,CAAU;AAAA,EACzE;AACF;AACwB,SAAAE,EAAaC,GAAaC,GAAYC,GAAa;AACrE,SAAAD,KAA8BR,EAAAO,EAAY,WAAWC,CAAU,GAC/DC,KAAaT,EAAkBO,GAAaE,CAAW,GACpD,OAAA,eAAeF,GAAa,aAAa;AAAA,IAC9C,UAAU;AAAA,EAAA,CACX,GACMA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es175.js","sources":["../../../node_modules/underscore/modules/flatten.js"],"sourcesContent":["import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n  return _flatten(array, depth, false);\n}\n"],"names":["flatten","array","depth","_flatten"],"mappings":";AAIwB,SAAAA,EAAQC,GAAOC,GAAO;AACrC,SAAAC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}

package/dist/index.es176.js

@@ -1,9 +1,16 @@
-function i(e) {
-  if (e === void 0)
-    throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
-  return e;
+import b from "./index.es86.js";
+import q from "./index.es221.js";
+import B from "./index.es212.js";
+import r from "./index.es156.js";
+function w(l, p, f, g) {
+  b(p) || (g = f, f = p, p = !1), f != null && (f = q(f, g));
+  for (var s = [], h = [], o = 0, u = B(l); o < u; o++) {
+    var n = l[o], m = f ? f(n, o, l) : n;
+    p && !f ? ((!o || h !== m) && s.push(n), h = m) : f ? r(h, m) || (h.push(m), s.push(n)) : r(s, n) || s.push(n);
+  }
+  return s;
 }
 export {
-  i as default
+  w as default
 };
 //# sourceMappingURL=index.es176.js.map

package/dist/index.es176.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es176.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js"],"sourcesContent":["export default function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n  return self;\n}"],"names":["_assertThisInitialized","self"],"mappings":"AAAA,SAAwBA,EAAuBC,GAAM;AACnD,MAAIA,MAAS;AACL,UAAA,IAAI,eAAe,2DAA2D;AAE/E,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es176.js","sources":["../../../node_modules/underscore/modules/uniq.js"],"sourcesContent":["import isBoolean from './isBoolean.js';\nimport cb from './_cb.js';\nimport getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce a duplicate-free version of the array. If the array has already\n// been sorted, you have the option of using a faster algorithm.\n// The faster algorithm will not work with an iteratee if the iteratee\n// is not a one-to-one function, so providing an iteratee will disable\n// the faster algorithm.\nexport default function uniq(array, isSorted, iteratee, context) {\n  if (!isBoolean(isSorted)) {\n    context = iteratee;\n    iteratee = isSorted;\n    isSorted = false;\n  }\n  if (iteratee != null) iteratee = cb(iteratee, context);\n  var result = [];\n  var seen = [];\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var value = array[i],\n        computed = iteratee ? iteratee(value, i, array) : value;\n    if (isSorted && !iteratee) {\n      if (!i || seen !== computed) result.push(value);\n      seen = computed;\n    } else if (iteratee) {\n      if (!contains(seen, computed)) {\n        seen.push(computed);\n        result.push(value);\n      }\n    } else if (!contains(result, value)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n"],"names":["uniq","array","isSorted","iteratee","context","isBoolean","cb","result","seen","i","length","getLength","value","computed","contains"],"mappings":";;;;AAUA,SAAwBA,EAAKC,GAAOC,GAAUC,GAAUC,GAAS;AAC3D,EAACC,EAAUH,CAAQ,MACXE,IAAAD,GACCA,IAAAD,GACAA,IAAA,KAETC,KAAY,SAAiBA,IAAAG,EAAGH,GAAUC,CAAO;AAG5C,WAFLG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AAClD,IAAAV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GACvCJ,IAAAK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es177.js

@@ -1,18 +1,18 @@
-import o from "./index.es240.js";
-function i(e, t) {
-  if (typeof t != "function" && t !== null)
-    throw new TypeError("Super expression must either be null or a function");
-  e.prototype = Object.create(t && t.prototype, {
-    constructor: {
-      value: e,
-      writable: !0,
-      configurable: !0
+import u from "./index.es212.js";
+import f from "./index.es156.js";
+function v(o) {
+  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
+    var e = o[n];
+    if (!f(t, e)) {
+      var r;
+      for (r = 1; r < a && f(arguments[r], e); r++)
+        ;
+      r === a && t.push(e);
     }
-  }), Object.defineProperty(e, "prototype", {
-    writable: !1
-  }), t && o(e, t);
+  }
+  return t;
 }
 export {
-  i as default
+  v as default
 };
 //# sourceMappingURL=index.es177.js.map

package/dist/index.es177.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es177.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/inherits.js"],"sourcesContent":["import setPrototypeOf from \"./setPrototypeOf.js\";\nexport default function _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  Object.defineProperty(subClass, \"prototype\", {\n    writable: false\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}"],"names":["_inherits","subClass","superClass","setPrototypeOf"],"mappings":";AACwB,SAAAA,EAAUC,GAAUC,GAAY;AACtD,MAAI,OAAOA,KAAe,cAAcA,MAAe;AAC/C,UAAA,IAAI,UAAU,oDAAoD;AAE1E,EAAAD,EAAS,YAAY,OAAO,OAAOC,KAAcA,EAAW,WAAW;AAAA,IACrE,aAAa;AAAA,MACX,OAAOD;AAAA,MACP,UAAU;AAAA,MACV,cAAc;AAAA,IAChB;AAAA,EAAA,CACD,GACM,OAAA,eAAeA,GAAU,aAAa;AAAA,IAC3C,UAAU;AAAA,EAAA,CACX,GACGC,KAAYC,EAAeF,GAAUC,CAAU;AACrD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es177.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es178.js

@@ -1,13 +1,12 @@
-import o from "./index.es173.js";
-import t from "./index.es176.js";
-function f(e, r) {
-  if (r && (o(r) === "object" || typeof r == "function"))
-    return r;
-  if (r !== void 0)
-    throw new TypeError("Derived constructors may only return object or undefined");
-  return t(e);
+import f from "./index.es159.js";
+import p from "./index.es212.js";
+import u from "./index.es157.js";
+function n(t) {
+  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
+    m[r] = u(t, r);
+  return m;
 }
 export {
-  f as default
+  n as default
 };
 //# sourceMappingURL=index.es178.js.map

package/dist/index.es178.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es178.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js"],"sourcesContent":["import _typeof from \"./typeof.js\";\nimport assertThisInitialized from \"./assertThisInitialized.js\";\nexport default function _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  } else if (call !== void 0) {\n    throw new TypeError(\"Derived constructors may only return object or undefined\");\n  }\n  return assertThisInitialized(self);\n}"],"names":["_possibleConstructorReturn","self","call","_typeof","assertThisInitialized"],"mappings":";;AAEwB,SAAAA,EAA2BC,GAAMC,GAAM;AAC7D,MAAIA,MAASC,EAAQD,CAAI,MAAM,YAAY,OAAOA,KAAS;AAClD,WAAAA;AACT,MAAWA,MAAS;AACZ,UAAA,IAAI,UAAU,0DAA0D;AAEhF,SAAOE,EAAsBH,CAAI;AACnC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es178.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es179.js

@@ -1,9 +1,10 @@
-function e(o) {
-  return e = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function(t) {
-    return t.__proto__ || Object.getPrototypeOf(t);
-  }, e(o);
+import n from "./index.es212.js";
+function u(e, t) {
+  for (var o = {}, r = 0, f = n(e); r < f; r++)
+    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
+  return o;
 }
 export {
-  e as default
+  u as default
 };
 //# sourceMappingURL=index.es179.js.map

package/dist/index.es179.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es179.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js"],"sourcesContent":["export default function _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}"],"names":["_getPrototypeOf","o"],"mappings":"AAAA,SAAwBA,EAAgB,GAAG;AACvB,SAAAA,IAAA,OAAO,iBAAiB,OAAO,eAAe,KAAS,IAAA,SAAyBC,GAAG;AACnG,WAAOA,EAAE,aAAa,OAAO,eAAeA,CAAC;AAAA,EAAA,GAExCD,EAAgB,CAAC;AAC1B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es179.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es180.js

@@ -1,13 +1,10 @@
-import i from "./index.es239.js";
-function f(r, e, t) {
-  return e = i(e), e in r ? Object.defineProperty(r, e, {
-    value: t,
-    enumerable: !0,
-    configurable: !0,
-    writable: !0
-  }) : r[e] = t, r;
+function u(n, a, r) {
+  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
+  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
+    e[f] = n;
+  return e;
 }
 export {
-  f as default
+  u as default
 };
 //# sourceMappingURL=index.es180.js.map

package/dist/index.es180.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es180.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/defineProperty.js"],"sourcesContent":["import toPropertyKey from \"./toPropertyKey.js\";\nexport default function _defineProperty(obj, key, value) {\n  key = toPropertyKey(key);\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n  return obj;\n}"],"names":["_defineProperty","obj","key","value","toPropertyKey"],"mappings":";AACwB,SAAAA,EAAgBC,GAAKC,GAAKC,GAAO;AACvD,SAAAD,IAAME,EAAcF,CAAG,GACnBA,KAAOD,IACF,OAAA,eAAeA,GAAKC,GAAK;AAAA,IAC9B,OAAAC;AAAA,IACA,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,EAAA,CACX,IAEDF,EAAIC,CAAG,IAAIC,GAENF;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es180.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es181.js

@@ -1,11 +1,12 @@
-import o from "./index.es241.js";
-import t from "./index.es242.js";
-import e from "./index.es243.js";
-import a from "./index.es244.js";
-function n(r) {
-  return o(r) || t(r) || e(r) || a();
+import { slice as n } from "./index.es6.js";
+function h(r, l) {
+  if (l == null || l < 1)
+    return [];
+  for (var t = [], e = 0, i = r.length; e < i; )
+    t.push(n.call(r, e, e += l));
+  return t;
 }
 export {
-  n as default
+  h as default
 };
 //# sourceMappingURL=index.es181.js.map

package/dist/index.es181.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es181.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/toArray.js"],"sourcesContent":["import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _toArray(arr) {\n  return arrayWithHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableRest();\n}"],"names":["_toArray","arr","arrayWithHoles","iterableToArray","unsupportedIterableToArray","nonIterableRest"],"mappings":";;;;AAIA,SAAwBA,EAASC,GAAK;AAC7B,SAAAC,EAAeD,CAAG,KAAKE,EAAgBF,CAAG,KAAKG,EAA2BH,CAAG,KAAKI;AAC3F;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es181.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es183.js

@@ -1,5 +1,5 @@
-import { ResizeObserverController as t } from "./index.es255.js";
-import { isElement as o } from "./index.es256.js";
+import { ResizeObserverController as t } from "./index.es258.js";
+import { isElement as o } from "./index.es259.js";
 var u = function() {
   function r(e) {
     if (arguments.length === 0)

package/dist/index.es184.js

@@ -1,9 +1,9 @@
-import { ResizeObserverBoxOptions as z } from "./index.es272.js";
-import { ResizeObserverSize as X } from "./index.es259.js";
-import { DOMRectReadOnly as P } from "./index.es273.js";
-import { isHidden as A, isSVG as I } from "./index.es256.js";
-import { freeze as O } from "./index.es258.js";
-import { global as R } from "./index.es274.js";
+import { ResizeObserverBoxOptions as z } from "./index.es280.js";
+import { ResizeObserverSize as X } from "./index.es262.js";
+import { DOMRectReadOnly as P } from "./index.es281.js";
+import { isHidden as A, isSVG as I } from "./index.es259.js";
+import { freeze as O } from "./index.es261.js";
+import { global as R } from "./index.es282.js";
 var l = /* @__PURE__ */ new WeakMap(), S = /auto|scroll/, G = /^tb|vertical/, N = /msie|trident/i.test(R.navigator && R.navigator.userAgent), i = function(e) {
   return parseFloat(e || "0");
 }, a = function(e, t, r) {

package/dist/index.es19.js

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

package/dist/index.es20.js

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

package/dist/index.es207.js

@@ -1,11 +1,243 @@
-import { toString as n } from "./index.es6.js";
-function a(t) {
-  var r = "[object " + t + "]";
-  return function(e) {
-    return n.call(e) === r;
+import { a as l, i as S, b as y, E, _ as p, c as O, p as P, d as T, C as m, t as I, S as N } from "./index.es208.js";
+function j(t, e) {
+  if (t == null)
+    return {};
+  var s = {}, n = Object.keys(t), r, o;
+  for (o = 0; o < n.length; o++)
+    r = n[o], !(e.indexOf(r) >= 0) && (s[r] = t[r]);
+  return s;
+}
+function M(t, e) {
+  if (t == null)
+    return {};
+  var s = j(t, e), n, r;
+  if (Object.getOwnPropertySymbols) {
+    var o = Object.getOwnPropertySymbols(t);
+    for (r = 0; r < o.length; r++)
+      n = o[r], !(e.indexOf(n) >= 0) && Object.prototype.propertyIsEnumerable.call(t, n) && (s[n] = t[n]);
+  }
+  return s;
+}
+const k = {
+  target(t) {
+    if (t)
+      return () => "current" in t ? t.current : t;
+  },
+  enabled(t = !0) {
+    return t;
+  },
+  window(t = N.isBrowser ? window : void 0) {
+    return t;
+  },
+  eventOptions({
+    passive: t = !0,
+    capture: e = !1
+  } = {}) {
+    return {
+      passive: t,
+      capture: e
+    };
+  },
+  transform(t) {
+    return t;
+  }
+}, D = ["target", "eventOptions", "window", "enabled", "transform"];
+function g(t = {}, e) {
+  const s = {};
+  for (const [n, r] of Object.entries(e))
+    switch (typeof r) {
+      case "function":
+        if (process.env.NODE_ENV === "development") {
+          const o = r.call(s, t[n], n, t);
+          Number.isNaN(o) || (s[n] = o);
+        } else
+          s[n] = r.call(s, t[n], n, t);
+        break;
+      case "object":
+        s[n] = g(t[n], r);
+        break;
+      case "boolean":
+        r && (s[n] = t[n]);
+        break;
+    }
+  return s;
+}
+function H(t, e, s = {}) {
+  const n = t, {
+    target: r,
+    eventOptions: o,
+    window: i,
+    enabled: h,
+    transform: u
+  } = n, a = M(n, D);
+  if (s.shared = g({
+    target: r,
+    eventOptions: o,
+    window: i,
+    enabled: h,
+    transform: u
+  }, k), e) {
+    const c = m.get(e);
+    s[e] = g(p({
+      shared: s.shared
+    }, a), c);
+  } else
+    for (const c in a) {
+      const v = m.get(c);
+      if (v)
+        s[c] = g(p({
+          shared: s.shared
+        }, a[c]), v);
+      else if (process.env.NODE_ENV === "development" && !["drag", "pinch", "scroll", "wheel", "move", "hover"].includes(c)) {
+        if (c === "domTarget")
+          throw Error("[@use-gesture]: `domTarget` option has been renamed to `target`.");
+        console.warn(`[@use-gesture]: Unknown config key \`${c}\` was used. Please read the documentation for further information.`);
+      }
+    }
+  return s;
+}
+class _ {
+  constructor(e, s) {
+    l(this, "_listeners", /* @__PURE__ */ new Set()), this._ctrl = e, this._gestureKey = s;
+  }
+  add(e, s, n, r, o) {
+    const i = this._listeners, h = I(s, n), u = this._gestureKey ? this._ctrl.config[this._gestureKey].eventOptions : {}, a = p(p({}, u), o);
+    e.addEventListener(h, r, a);
+    const c = () => {
+      e.removeEventListener(h, r, a), i.delete(c);
+    };
+    return i.add(c), c;
+  }
+  clean() {
+    this._listeners.forEach((e) => e()), this._listeners.clear();
+  }
+}
+class R {
+  constructor() {
+    l(this, "_timeouts", /* @__PURE__ */ new Map());
+  }
+  add(e, s, n = 140, ...r) {
+    this.remove(e), this._timeouts.set(e, window.setTimeout(s, n, ...r));
+  }
+  remove(e) {
+    const s = this._timeouts.get(e);
+    s && window.clearTimeout(s);
+  }
+  clean() {
+    this._timeouts.forEach((e) => void window.clearTimeout(e)), this._timeouts.clear();
+  }
+}
+class G {
+  constructor(e) {
+    l(this, "gestures", /* @__PURE__ */ new Set()), l(this, "_targetEventStore", new _(this)), l(this, "gestureEventStores", {}), l(this, "gestureTimeoutStores", {}), l(this, "handlers", {}), l(this, "config", {}), l(this, "pointerIds", /* @__PURE__ */ new Set()), l(this, "touchIds", /* @__PURE__ */ new Set()), l(this, "state", {
+      shared: {
+        shiftKey: !1,
+        metaKey: !1,
+        ctrlKey: !1,
+        altKey: !1
+      }
+    }), W(this, e);
+  }
+  setEventIds(e) {
+    if (S(e))
+      return this.touchIds = new Set(y(e)), this.touchIds;
+    if ("pointerId" in e)
+      return e.type === "pointerup" || e.type === "pointercancel" ? this.pointerIds.delete(e.pointerId) : e.type === "pointerdown" && this.pointerIds.add(e.pointerId), this.pointerIds;
+  }
+  applyHandlers(e, s) {
+    this.handlers = e, this.nativeHandlers = s;
+  }
+  applyConfig(e, s) {
+    this.config = H(e, s, this.config);
+  }
+  clean() {
+    this._targetEventStore.clean();
+    for (const e of this.gestures)
+      this.gestureEventStores[e].clean(), this.gestureTimeoutStores[e].clean();
+  }
+  effect() {
+    return this.config.shared.target && this.bind(), () => this._targetEventStore.clean();
+  }
+  bind(...e) {
+    const s = this.config.shared, n = {};
+    let r;
+    if (!(s.target && (r = s.target(), !r))) {
+      if (s.enabled) {
+        for (const i of this.gestures) {
+          const h = this.config[i], u = b(n, h.eventOptions, !!r);
+          if (h.enabled) {
+            const a = E.get(i);
+            new a(this, e, i).bind(u);
+          }
+        }
+        const o = b(n, s.eventOptions, !!r);
+        for (const i in this.nativeHandlers)
+          o(i, "", (h) => this.nativeHandlers[i](p(p({}, this.state.shared), {}, {
+            event: h,
+            args: e
+          })), void 0, !0);
+      }
+      for (const o in n)
+        n[o] = O(...n[o]);
+      if (!r)
+        return n;
+      for (const o in n) {
+        const {
+          device: i,
+          capture: h,
+          passive: u
+        } = P(o);
+        this._targetEventStore.add(r, i, "", n[o], {
+          capture: h,
+          passive: u
+        });
+      }
+    }
+  }
+}
+function d(t, e) {
+  t.gestures.add(e), t.gestureEventStores[e] = new _(t, e), t.gestureTimeoutStores[e] = new R();
+}
+function W(t, e) {
+  e.drag && d(t, "drag"), e.wheel && d(t, "wheel"), e.scroll && d(t, "scroll"), e.move && d(t, "move"), e.pinch && d(t, "pinch"), e.hover && d(t, "hover");
+}
+const b = (t, e, s) => (n, r, o, i = {}, h = !1) => {
+  var u, a;
+  const c = (u = i.capture) !== null && u !== void 0 ? u : e.capture, v = (a = i.passive) !== null && a !== void 0 ? a : e.passive;
+  let w = h ? n : T(n, r, c);
+  s && v && (w += "Passive"), t[w] = t[w] || [], t[w].push(o);
+}, $ = /^on(Drag|Wheel|Scroll|Move|Pinch|Hover)/;
+function x(t) {
+  const e = {}, s = {}, n = /* @__PURE__ */ new Set();
+  for (let r in t)
+    $.test(r) ? (n.add(RegExp.lastMatch), s[r] = t[r]) : e[r] = t[r];
+  return [s, e, n];
+}
+function f(t, e, s, n, r, o) {
+  if (!t.has(s))
+    return;
+  if (!E.has(n)) {
+    process.env.NODE_ENV === "development" && console.warn(`[@use-gesture]: You've created a custom handler that that uses the \`${n}\` gesture but isn't properly configured.
+
+Please add \`${n}Action\` when creating your handler.`);
+    return;
+  }
+  const i = s + "Start", h = s + "End", u = (a) => {
+    let c;
+    return a.first && i in e && e[i](a), s in e && (c = e[s](a)), a.last && h in e && e[h](a), c;
+  };
+  r[n] = u, o[n] = o[n] || {};
+}
+function L(t, e) {
+  const [s, n, r] = x(t), o = {};
+  return f(r, s, "onDrag", "drag", o, e), f(r, s, "onWheel", "wheel", o, e), f(r, s, "onScroll", "scroll", o, e), f(r, s, "onPinch", "pinch", o, e), f(r, s, "onMove", "move", o, e), f(r, s, "onHover", "hover", o, e), {
+    handlers: o,
+    config: e,
+    nativeHandlers: n
   };
 }
 export {
-  a as default
+  G as Controller,
+  L as parseMergedHandlers
 };
 //# sourceMappingURL=index.es207.js.map