@performant-software/visualize 3.0.5-beta.2 → 3.0.5-beta.3

package/dist/index.es170.js.map

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

package/dist/index.es171.js

@@ -1,8 +1,36 @@
-import r from "./index.es242.js";
-const f = r(function(o, t, n) {
-  o[n] = t;
-});
+import s from "react";
+import { parseMergedHandlers as a, Controller as f } from "./index.es234.js";
+import { r as u, e as l, f as p, s as d, w as m, m as g, h } from "./index.es235.js";
+import { C as H, E as R } from "./index.es235.js";
+function v(r, n = {}, o, t) {
+  const e = s.useMemo(() => new f(r), []);
+  if (e.applyHandlers(r, t), e.applyConfig(n, o), s.useEffect(e.effect.bind(e)), s.useEffect(() => e.clean.bind(e), []), n.target === void 0)
+    return e.bind.bind(e);
+}
+function A(r) {
+  return r.forEach(u), function(o, t) {
+    const {
+      handlers: e,
+      nativeHandlers: i,
+      config: c
+    } = a(o, t || {});
+    return v(e, c, void 0, i);
+  };
+}
+function M(r, n) {
+  return A([l, p, d, m, g, h])(r, n || {});
+}
 export {
-  f as default
+  H as ConfigResolverMap,
+  R as EngineMap,
+  A as createUseGesture,
+  l as dragAction,
+  h as hoverAction,
+  g as moveAction,
+  p as pinchAction,
+  u as registerAction,
+  d as scrollAction,
+  M as useGesture,
+  m as wheelAction
 };
 //# sourceMappingURL=index.es171.js.map

package/dist/index.es171.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es171.js","sources":["../../../node_modules/underscore/modules/indexBy.js"],"sourcesContent":["import group from './_group.js';\n\n// Indexes the object's values by a criterion, similar to `_.groupBy`, but for\n// when you know that your index values will be unique.\nexport default group(function(result, value, key) {\n  result[key] = value;\n});\n"],"names":["indexBy","group","result","value","key"],"mappings":";AAIA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAChD,EAAAF,EAAOE,CAAG,IAAID;AAChB,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es171.js","sources":["../../../node_modules/@use-gesture/react/dist/use-gesture-react.esm.js"],"sourcesContent":["import { registerAction, dragAction, pinchAction, wheelAction, scrollAction, moveAction, hoverAction } from '@use-gesture/core/actions';\nexport * from '@use-gesture/core/actions';\nimport React from 'react';\nimport { Controller, parseMergedHandlers } from '@use-gesture/core';\nexport * from '@use-gesture/core/utils';\nexport * from '@use-gesture/core/types';\n\nfunction useRecognizers(handlers, config = {}, gestureKey, nativeHandlers) {\n  const ctrl = React.useMemo(() => new Controller(handlers), []);\n  ctrl.applyHandlers(handlers, nativeHandlers);\n  ctrl.applyConfig(config, gestureKey);\n  React.useEffect(ctrl.effect.bind(ctrl));\n  React.useEffect(() => {\n    return ctrl.clean.bind(ctrl);\n  }, []);\n  if (config.target === undefined) {\n    return ctrl.bind.bind(ctrl);\n  }\n  return undefined;\n}\n\nfunction useDrag(handler, config) {\n  registerAction(dragAction);\n  return useRecognizers({\n    drag: handler\n  }, config || {}, 'drag');\n}\n\nfunction usePinch(handler, config) {\n  registerAction(pinchAction);\n  return useRecognizers({\n    pinch: handler\n  }, config || {}, 'pinch');\n}\n\nfunction useWheel(handler, config) {\n  registerAction(wheelAction);\n  return useRecognizers({\n    wheel: handler\n  }, config || {}, 'wheel');\n}\n\nfunction useScroll(handler, config) {\n  registerAction(scrollAction);\n  return useRecognizers({\n    scroll: handler\n  }, config || {}, 'scroll');\n}\n\nfunction useMove(handler, config) {\n  registerAction(moveAction);\n  return useRecognizers({\n    move: handler\n  }, config || {}, 'move');\n}\n\nfunction useHover(handler, config) {\n  registerAction(hoverAction);\n  return useRecognizers({\n    hover: handler\n  }, config || {}, 'hover');\n}\n\nfunction createUseGesture(actions) {\n  actions.forEach(registerAction);\n  return function useGesture(_handlers, _config) {\n    const {\n      handlers,\n      nativeHandlers,\n      config\n    } = parseMergedHandlers(_handlers, _config || {});\n    return useRecognizers(handlers, config, undefined, nativeHandlers);\n  };\n}\n\nfunction useGesture(handlers, config) {\n  const hook = createUseGesture([dragAction, pinchAction, scrollAction, wheelAction, moveAction, hoverAction]);\n  return hook(handlers, config || {});\n}\n\nexport { createUseGesture, useDrag, useGesture, useHover, useMove, usePinch, useScroll, useWheel };\n"],"names":["useRecognizers","handlers","config","gestureKey","nativeHandlers","ctrl","React","Controller","createUseGesture","actions","registerAction","_handlers","_config","parseMergedHandlers","useGesture","dragAction","pinchAction","scrollAction","wheelAction","moveAction","hoverAction"],"mappings":";;;;AAOA,SAASA,EAAeC,GAAUC,IAAS,CAAA,GAAIC,GAAYC,GAAgB;AACnE,QAAAC,IAAOC,EAAM,QAAQ,MAAM,IAAIC,EAAWN,CAAQ,GAAG,CAAA,CAAE;AAOzD,MANCI,EAAA,cAAcJ,GAAUG,CAAc,GACtCC,EAAA,YAAYH,GAAQC,CAAU,GACnCG,EAAM,UAAUD,EAAK,OAAO,KAAKA,CAAI,CAAC,GACtCC,EAAM,UAAU,MACPD,EAAK,MAAM,KAAKA,CAAI,GAC1B,CAAE,CAAA,GACDH,EAAO,WAAW;AACb,WAAAG,EAAK,KAAK,KAAKA,CAAI;AAG9B;AA4CA,SAASG,EAAiBC,GAAS;AACjC,SAAAA,EAAQ,QAAQC,CAAc,GACvB,SAAoBC,GAAWC,GAAS;AACvC,UAAA;AAAA,MACJ,UAAAX;AAAA,MACA,gBAAAG;AAAA,MACA,QAAAF;AAAA,IACE,IAAAW,EAAoBF,GAAWC,KAAW,CAAE,CAAA;AAChD,WAAOZ,EAAeC,GAAUC,GAAQ,QAAWE,CAAc;AAAA,EAAA;AAErE;AAEA,SAASU,EAAWb,GAAUC,GAAQ;AAEpC,SADaM,EAAiB,CAACO,GAAYC,GAAaC,GAAcC,GAAaC,GAAYC,CAAW,CAAC,EAC/FnB,GAAUC,KAAU,CAAE,CAAA;AACpC;","x_google_ignoreList":[0]}

package/dist/index.es172.js

@@ -1,9 +1,98 @@
-import t from "./index.es242.js";
-import a from "./index.es219.js";
-const p = t(function(o, i, f) {
-  a(o, f) ? o[f]++ : o[f] = 1;
-});
+function f() {
+  return {
+    scaleX: 1,
+    scaleY: 1,
+    translateX: 0,
+    translateY: 0,
+    skewX: 0,
+    skewY: 0
+  };
+}
+function w(e) {
+  var s = e.scaleX, a = s === void 0 ? 1 : s, n = e.scaleY, r = n === void 0 ? 1 : n, t = e.translateX, c = t === void 0 ? 0 : t, l = e.translateY, u = l === void 0 ? 0 : l, X = e.skewX, k = X === void 0 ? 0 : X, Y = e.skewY, v = Y === void 0 ? 0 : Y;
+  return {
+    scaleX: a,
+    scaleY: r,
+    translateX: c,
+    translateY: u,
+    skewX: k,
+    skewY: v
+  };
+}
+function d(e) {
+  var s = e.scaleX, a = e.scaleY, n = e.translateX, r = e.translateY, t = e.skewX, c = e.skewY, l = s * a - c * t;
+  return {
+    scaleX: a / l,
+    scaleY: s / l,
+    translateX: (a * n - t * r) / -l,
+    translateY: (c * n - s * r) / l,
+    skewX: t / -l,
+    skewY: c / -l
+  };
+}
+function p(e, s) {
+  var a = s.x, n = s.y;
+  return {
+    x: e.scaleX * a + e.skewX * n + e.translateX,
+    y: e.skewY * a + e.scaleY * n + e.translateY
+  };
+}
+function g(e, s) {
+  var a = s.x, n = s.y;
+  return p(d(e), {
+    x: a,
+    y: n
+  });
+}
+function y(e, s) {
+  s === void 0 && (s = void 0);
+  var a = s || e;
+  return w({
+    scaleX: e,
+    scaleY: a
+  });
+}
+function $(e, s) {
+  return w({
+    translateX: e,
+    translateY: s
+  });
+}
+function o(e, s) {
+  return {
+    scaleX: e.scaleX * s.scaleX + e.skewX * s.skewY,
+    scaleY: e.skewY * s.skewX + e.scaleY * s.scaleY,
+    translateX: e.scaleX * s.translateX + e.skewX * s.translateY + e.translateX,
+    translateY: e.skewY * s.translateX + e.scaleY * s.translateY + e.translateY,
+    skewX: e.scaleX * s.skewX + e.skewX * s.scaleY,
+    skewY: e.skewY * s.scaleX + e.scaleY * s.skewY
+  };
+}
+function M() {
+  for (var e = arguments.length, s = new Array(e), a = 0; a < e; a++)
+    s[a] = arguments[a];
+  switch (s.length) {
+    case 0:
+      throw new Error("composeMatrices() requires arguments: was called with no args");
+    case 1:
+      return s[0];
+    case 2:
+      return o(s[0], s[1]);
+    default: {
+      var n = s[0], r = s[1], t = s.slice(2), c = o(n, r);
+      return M.apply(void 0, [c].concat(t));
+    }
+  }
+}
 export {
-  p as default
+  g as applyInverseMatrixToPoint,
+  p as applyMatrixToPoint,
+  M as composeMatrices,
+  w as createMatrix,
+  f as identityMatrix,
+  d as inverseMatrix,
+  o as multiplyMatrices,
+  y as scaleMatrix,
+  $ as translateMatrix
 };
 //# sourceMappingURL=index.es172.js.map

package/dist/index.es172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es172.js","sources":["../../../node_modules/underscore/modules/countBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Counts instances of an object that group by a certain criterion. Pass\n// either a string attribute to count by, or a function that returns the\n// criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key]++; else result[key] = 1;\n});\n"],"names":["countBy","group","result","value","key","has"],"mappings":";;AAMA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAC5C,EAAAC,EAAIH,GAAQE,CAAG,IAAGF,EAAOE,CAAG,MAAUF,EAAOE,CAAG,IAAI;AAC1D,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es172.js","sources":["../../../node_modules/@visx/zoom/esm/util/matrix.js"],"sourcesContent":["export function identityMatrix() {\n  return {\n    scaleX: 1,\n    scaleY: 1,\n    translateX: 0,\n    translateY: 0,\n    skewX: 0,\n    skewY: 0\n  };\n}\nexport function createMatrix(_ref) {\n  var _ref$scaleX = _ref.scaleX,\n    scaleX = _ref$scaleX === void 0 ? 1 : _ref$scaleX,\n    _ref$scaleY = _ref.scaleY,\n    scaleY = _ref$scaleY === void 0 ? 1 : _ref$scaleY,\n    _ref$translateX = _ref.translateX,\n    translateX = _ref$translateX === void 0 ? 0 : _ref$translateX,\n    _ref$translateY = _ref.translateY,\n    translateY = _ref$translateY === void 0 ? 0 : _ref$translateY,\n    _ref$skewX = _ref.skewX,\n    skewX = _ref$skewX === void 0 ? 0 : _ref$skewX,\n    _ref$skewY = _ref.skewY,\n    skewY = _ref$skewY === void 0 ? 0 : _ref$skewY;\n  return {\n    scaleX: scaleX,\n    scaleY: scaleY,\n    translateX: translateX,\n    translateY: translateY,\n    skewX: skewX,\n    skewY: skewY\n  };\n}\nexport function inverseMatrix(_ref2) {\n  var scaleX = _ref2.scaleX,\n    scaleY = _ref2.scaleY,\n    translateX = _ref2.translateX,\n    translateY = _ref2.translateY,\n    skewX = _ref2.skewX,\n    skewY = _ref2.skewY;\n  var denominator = scaleX * scaleY - skewY * skewX;\n  return {\n    scaleX: scaleY / denominator,\n    scaleY: scaleX / denominator,\n    translateX: (scaleY * translateX - skewX * translateY) / -denominator,\n    translateY: (skewY * translateX - scaleX * translateY) / denominator,\n    skewX: skewX / -denominator,\n    skewY: skewY / -denominator\n  };\n}\nexport function applyMatrixToPoint(matrix, _ref3) {\n  var x = _ref3.x,\n    y = _ref3.y;\n  return {\n    x: matrix.scaleX * x + matrix.skewX * y + matrix.translateX,\n    y: matrix.skewY * x + matrix.scaleY * y + matrix.translateY\n  };\n}\nexport function applyInverseMatrixToPoint(matrix, _ref4) {\n  var x = _ref4.x,\n    y = _ref4.y;\n  return applyMatrixToPoint(inverseMatrix(matrix), {\n    x: x,\n    y: y\n  });\n}\nexport function scaleMatrix(scaleX, maybeScaleY) {\n  if (maybeScaleY === void 0) {\n    maybeScaleY = undefined;\n  }\n  var scaleY = maybeScaleY || scaleX;\n  return createMatrix({\n    scaleX: scaleX,\n    scaleY: scaleY\n  });\n}\nexport function translateMatrix(translateX, translateY) {\n  return createMatrix({\n    translateX: translateX,\n    translateY: translateY\n  });\n}\nexport function multiplyMatrices(matrix1, matrix2) {\n  return {\n    scaleX: matrix1.scaleX * matrix2.scaleX + matrix1.skewX * matrix2.skewY,\n    scaleY: matrix1.skewY * matrix2.skewX + matrix1.scaleY * matrix2.scaleY,\n    translateX: matrix1.scaleX * matrix2.translateX + matrix1.skewX * matrix2.translateY + matrix1.translateX,\n    translateY: matrix1.skewY * matrix2.translateX + matrix1.scaleY * matrix2.translateY + matrix1.translateY,\n    skewX: matrix1.scaleX * matrix2.skewX + matrix1.skewX * matrix2.scaleY,\n    skewY: matrix1.skewY * matrix2.scaleX + matrix1.scaleY * matrix2.skewY\n  };\n}\nexport function composeMatrices() {\n  for (var _len = arguments.length, matrices = new Array(_len), _key = 0; _key < _len; _key++) {\n    matrices[_key] = arguments[_key];\n  }\n  switch (matrices.length) {\n    case 0:\n      throw new Error('composeMatrices() requires arguments: was called with no args');\n    case 1:\n      return matrices[0];\n    case 2:\n      return multiplyMatrices(matrices[0], matrices[1]);\n    default:\n      {\n        var matrix1 = matrices[0],\n          matrix2 = matrices[1],\n          restMatrices = matrices.slice(2);\n        var matrix = multiplyMatrices(matrix1, matrix2);\n        return composeMatrices.apply(void 0, [matrix].concat(restMatrices));\n      }\n  }\n}"],"names":["identityMatrix","createMatrix","_ref","_ref$scaleX","scaleX","_ref$scaleY","scaleY","_ref$translateX","translateX","_ref$translateY","translateY","_ref$skewX","skewX","_ref$skewY","skewY","inverseMatrix","_ref2","denominator","applyMatrixToPoint","matrix","_ref3","x","y","applyInverseMatrixToPoint","_ref4","scaleMatrix","maybeScaleY","translateMatrix","multiplyMatrices","matrix1","matrix2","composeMatrices","_len","matrices","_key","restMatrices"],"mappings":"AAAO,SAASA,IAAiB;AACxB,SAAA;AAAA,IACL,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,OAAO;AAAA,IACP,OAAO;AAAA,EAAA;AAEX;AACO,SAASC,EAAaC,GAAM;AAC7B,MAAAC,IAAcD,EAAK,QACrBE,IAASD,MAAgB,SAAS,IAAIA,GACtCE,IAAcH,EAAK,QACnBI,IAASD,MAAgB,SAAS,IAAIA,GACtCE,IAAkBL,EAAK,YACvBM,IAAaD,MAAoB,SAAS,IAAIA,GAC9CE,IAAkBP,EAAK,YACvBQ,IAAaD,MAAoB,SAAS,IAAIA,GAC9CE,IAAaT,EAAK,OAClBU,IAAQD,MAAe,SAAS,IAAIA,GACpCE,IAAaX,EAAK,OAClBY,IAAQD,MAAe,SAAS,IAAIA;AAC/B,SAAA;AAAA,IACL,QAAAT;AAAA,IACA,QAAAE;AAAA,IACA,YAAAE;AAAA,IACA,YAAAE;AAAA,IACA,OAAAE;AAAA,IACA,OAAAE;AAAA,EAAA;AAEJ;AACO,SAASC,EAAcC,GAAO;AACnC,MAAIZ,IAASY,EAAM,QACjBV,IAASU,EAAM,QACfR,IAAaQ,EAAM,YACnBN,IAAaM,EAAM,YACnBJ,IAAQI,EAAM,OACdF,IAAQE,EAAM,OACZC,IAAcb,IAASE,IAASQ,IAAQF;AACrC,SAAA;AAAA,IACL,QAAQN,IAASW;AAAA,IACjB,QAAQb,IAASa;AAAA,IACjB,aAAaX,IAASE,IAAaI,IAAQF,KAAc,CAACO;AAAA,IAC1D,aAAaH,IAAQN,IAAaJ,IAASM,KAAcO;AAAA,IACzD,OAAOL,IAAQ,CAACK;AAAA,IAChB,OAAOH,IAAQ,CAACG;AAAA,EAAA;AAEpB;AACgB,SAAAC,EAAmBC,GAAQC,GAAO;AAChD,MAAIC,IAAID,EAAM,GACZE,IAAIF,EAAM;AACL,SAAA;AAAA,IACL,GAAGD,EAAO,SAASE,IAAIF,EAAO,QAAQG,IAAIH,EAAO;AAAA,IACjD,GAAGA,EAAO,QAAQE,IAAIF,EAAO,SAASG,IAAIH,EAAO;AAAA,EAAA;AAErD;AACgB,SAAAI,EAA0BJ,GAAQK,GAAO;AACvD,MAAIH,IAAIG,EAAM,GACZF,IAAIE,EAAM;AACL,SAAAN,EAAmBH,EAAcI,CAAM,GAAG;AAAA,IAC/C,GAAAE;AAAA,IACA,GAAAC;AAAA,EAAA,CACD;AACH;AACgB,SAAAG,EAAYrB,GAAQsB,GAAa;AAC/C,EAAIA,MAAgB,WACJA,IAAA;AAEhB,MAAIpB,IAASoB,KAAetB;AAC5B,SAAOH,EAAa;AAAA,IAClB,QAAAG;AAAA,IACA,QAAAE;AAAA,EAAA,CACD;AACH;AACgB,SAAAqB,EAAgBnB,GAAYE,GAAY;AACtD,SAAOT,EAAa;AAAA,IAClB,YAAAO;AAAA,IACA,YAAAE;AAAA,EAAA,CACD;AACH;AACgB,SAAAkB,EAAiBC,GAASC,GAAS;AAC1C,SAAA;AAAA,IACL,QAAQD,EAAQ,SAASC,EAAQ,SAASD,EAAQ,QAAQC,EAAQ;AAAA,IAClE,QAAQD,EAAQ,QAAQC,EAAQ,QAAQD,EAAQ,SAASC,EAAQ;AAAA,IACjE,YAAYD,EAAQ,SAASC,EAAQ,aAAaD,EAAQ,QAAQC,EAAQ,aAAaD,EAAQ;AAAA,IAC/F,YAAYA,EAAQ,QAAQC,EAAQ,aAAaD,EAAQ,SAASC,EAAQ,aAAaD,EAAQ;AAAA,IAC/F,OAAOA,EAAQ,SAASC,EAAQ,QAAQD,EAAQ,QAAQC,EAAQ;AAAA,IAChE,OAAOD,EAAQ,QAAQC,EAAQ,SAASD,EAAQ,SAASC,EAAQ;AAAA,EAAA;AAErE;AACO,SAASC,IAAkB;AAChC,WAASC,IAAO,UAAU,QAAQC,IAAW,IAAI,MAAMD,CAAI,GAAGE,IAAO,GAAGA,IAAOF,GAAME;AAC1E,IAAAD,EAAAC,CAAI,IAAI,UAAUA,CAAI;AAEjC,UAAQD,EAAS,QAAQ;AAAA,IACvB,KAAK;AACG,YAAA,IAAI,MAAM,+DAA+D;AAAA,IACjF,KAAK;AACH,aAAOA,EAAS,CAAC;AAAA,IACnB,KAAK;AACH,aAAOL,EAAiBK,EAAS,CAAC,GAAGA,EAAS,CAAC,CAAC;AAAA,IAClD,SACE;AACM,UAAAJ,IAAUI,EAAS,CAAC,GACtBH,IAAUG,EAAS,CAAC,GACpBE,IAAeF,EAAS,MAAM,CAAC,GAC7Bd,IAASS,EAAiBC,GAASC,CAAO;AACvC,aAAAC,EAAgB,MAAM,QAAQ,CAACZ,CAAM,EAAE,OAAOgB,CAAY,CAAC;AAAA,IACpE;AAAA,EACJ;AACF;","x_google_ignoreList":[0]}

package/dist/index.es173.js

@@ -1,8 +1,12 @@
-import p from "./index.es242.js";
-const i = p(function(t, o, r) {
-  t[r ? 0 : 1].push(o);
-}, !0);
+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);
+}
 export {
-  i as default
+  o as default
 };
 //# sourceMappingURL=index.es173.js.map

package/dist/index.es173.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es173.js","sources":["../../../node_modules/underscore/modules/partition.js"],"sourcesContent":["import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n  result[pass ? 0 : 1].push(value);\n}, true);\n"],"names":["partition","group","result","value","pass"],"mappings":";AAIA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAM;AACjD,EAAAF,EAAOE,IAAO,IAAI,CAAC,EAAE,KAAKD,CAAK;AACjC,GAAG,EAAI;","x_google_ignoreList":[0]}
+{"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]}

package/dist/index.es174.js

@@ -1,15 +1,8 @@
-import f from "./index.es102.js";
-import { slice as t } from "./index.es6.js";
-import i from "./index.es94.js";
-import m from "./index.es240.js";
-import u from "./index.es155.js";
-import e from "./index.es125.js";
-import o from "./index.es112.js";
-var a = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
-function A(r) {
-  return r ? f(r) ? t.call(r) : i(r) ? r.match(a) : m(r) ? u(r, e) : o(r) : [];
+function c(a, n) {
+  if (!(a instanceof n))
+    throw new TypeError("Cannot call a class as a function");
 }
 export {
-  A as default
+  c as default
 };
 //# sourceMappingURL=index.es174.js.map

package/dist/index.es174.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es174.js","sources":["../../../node_modules/underscore/modules/toArray.js"],"sourcesContent":["import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default function toArray(obj) {\n  if (!obj) return [];\n  if (isArray(obj)) return slice.call(obj);\n  if (isString(obj)) {\n    // Keep surrogate pair characters together.\n    return obj.match(reStrSymbol);\n  }\n  if (isArrayLike(obj)) return map(obj, identity);\n  return values(obj);\n}\n"],"names":["reStrSymbol","toArray","obj","isArray","slice","isString","isArrayLike","map","identity","values"],"mappings":";;;;;;;AASA,IAAIA,IAAc;AAClB,SAAwBC,EAAQC,GAAK;AACnC,SAAKA,IACDC,EAAQD,CAAG,IAAUE,EAAM,KAAKF,CAAG,IACnCG,EAASH,CAAG,IAEPA,EAAI,MAAMF,CAAW,IAE1BM,EAAYJ,CAAG,IAAUK,EAAIL,GAAKM,CAAQ,IACvCC,EAAOP,CAAG,IAPA;AAQnB;","x_google_ignoreList":[0]}
+{"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]}

package/dist/index.es175.js

@@ -1,9 +1,16 @@
-import e from "./index.es240.js";
-import t from "./index.es110.js";
-function f(r) {
-  return r == null ? 0 : e(r) ? r.length : t(r).length;
+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;
 }
 export {
-  f as default
+  u as default
 };
 //# sourceMappingURL=index.es175.js.map

package/dist/index.es175.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es175.js","sources":["../../../node_modules/underscore/modules/size.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the number of elements in a collection.\nexport default function size(obj) {\n  if (obj == null) return 0;\n  return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n"],"names":["size","obj","isArrayLike","keys"],"mappings":";;AAIA,SAAwBA,EAAKC,GAAK;AAChC,SAAIA,KAAO,OAAa,IACjBC,EAAYD,CAAG,IAAIA,EAAI,SAASE,EAAKF,CAAG,EAAE;AACnD;","x_google_ignoreList":[0]}
+{"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]}

package/dist/index.es176.js

@@ -1,8 +1,9 @@
-import n from "./index.es177.js";
-function u(t, l, i) {
-  return t == null || t.length < 1 ? l == null || i ? void 0 : [] : l == null || i ? t[0] : n(t, t.length - l);
+function i(e) {
+  if (e === void 0)
+    throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  return e;
 }
 export {
-  u as default
+  i as default
 };
 //# sourceMappingURL=index.es176.js.map

package/dist/index.es176.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es176.js","sources":["../../../node_modules/underscore/modules/first.js"],"sourcesContent":["import initial from './initial.js';\n\n// Get the first element of an array. Passing **n** will return the first N\n// values in the array. The **guard** check allows it to work with `_.map`.\nexport default function first(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[0];\n  return initial(array, array.length - n);\n}\n"],"names":["first","array","n","guard","initial"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAGC,GAAO;AACzC,SAAAF,KAAS,QAAQA,EAAM,SAAS,IAAUC,KAAK,QAAQC,IAAQ,SAAS,CAAA,IACxED,KAAK,QAAQC,IAAcF,EAAM,CAAC,IAC/BG,EAAQH,GAAOA,EAAM,SAASC,CAAC;AACxC;","x_google_ignoreList":[0]}
+{"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]}

package/dist/index.es177.js

@@ -1,8 +1,18 @@
-import { slice as e } from "./index.es6.js";
-function a(l, t, i) {
-  return e.call(l, 0, Math.max(0, l.length - (t == null || i ? 1 : t)));
+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
+    }
+  }), Object.defineProperty(e, "prototype", {
+    writable: !1
+  }), t && o(e, t);
 }
 export {
-  a as default
+  i as default
 };
 //# sourceMappingURL=index.es177.js.map

package/dist/index.es177.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es177.js","sources":["../../../node_modules/underscore/modules/initial.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the last entry of the array. Especially useful on\n// the arguments object. Passing **n** will return all the values in\n// the array, excluding the last N.\nexport default function initial(array, n, guard) {\n  return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n"],"names":["initial","array","n","guard","slice"],"mappings":";AAKwB,SAAAA,EAAQC,GAAOC,GAAGC,GAAO;AAC/C,SAAOC,EAAM,KAAKH,GAAO,GAAG,KAAK,IAAI,GAAGA,EAAM,UAAUC,KAAK,QAAQC,IAAQ,IAAID,EAAE,CAAC;AACtF;","x_google_ignoreList":[0]}
+{"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]}

package/dist/index.es178.js

@@ -1,6 +1,11 @@
-import n from "./index.es179.js";
-function f(t, l, e) {
-  return t == null || t.length < 1 ? l == null || e ? void 0 : [] : l == null || e ? t[t.length - 1] : n(t, Math.max(0, t.length - l));
+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);
 }
 export {
   f as default

package/dist/index.es178.js.map

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

package/dist/index.es179.js

@@ -1,8 +1,9 @@
-import { slice as e } from "./index.es6.js";
-function u(r, l, t) {
-  return e.call(r, l == null || t ? 1 : l);
+function e(o) {
+  return e = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function(t) {
+    return t.__proto__ || Object.getPrototypeOf(t);
+  }, e(o);
 }
 export {
-  u as default
+  e as default
 };
 //# sourceMappingURL=index.es179.js.map

package/dist/index.es179.js.map

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

package/dist/index.es180.js

@@ -1,8 +1,13 @@
-import t from "./index.es158.js";
-function e(o) {
-  return t(o, Boolean);
+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;
 }
 export {
-  e as default
+  f as default
 };
 //# sourceMappingURL=index.es180.js.map

package/dist/index.es180.js.map

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

package/dist/index.es181.js

@@ -1,6 +1,9 @@
-import f from "./index.es237.js";
-function n(t, e) {
-  return f(t, e, !1);
+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();
 }
 export {
   n as default

package/dist/index.es181.js.map

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

package/dist/index.es182.js

@@ -1,16 +1,58 @@
-import b from "./index.es92.js";
-import q from "./index.es230.js";
-import B from "./index.es221.js";
-import r from "./index.es162.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;
+import { getDefaultExportFromCjs as M } from "./index.es190.js";
+import { i as S } from "./index.es236.js";
+import { n as j } from "./index.es237.js";
+import { t as y } from "./index.es238.js";
+var F = S, x = j, I = y, N = "Expected a function", O = Math.max, R = Math.min;
+function A(h, t, a) {
+  var o, m, s, u, i, r, f = 0, b = !1, c = !1, d = !0;
+  if (typeof h != "function")
+    throw new TypeError(N);
+  t = I(t) || 0, F(a) && (b = !!a.leading, c = "maxWait" in a, s = c ? O(I(a.maxWait) || 0, t) : s, d = "trailing" in a ? !!a.trailing : d);
+  function g(e) {
+    var n = o, l = m;
+    return o = m = void 0, f = e, u = h.apply(l, n), u;
+  }
+  function _(e) {
+    return f = e, i = setTimeout(v, t), b ? g(e) : u;
+  }
+  function C(e) {
+    var n = e - r, l = e - f, k = t - n;
+    return c ? R(k, s - l) : k;
+  }
+  function E(e) {
+    var n = e - r, l = e - f;
+    return r === void 0 || n >= t || n < 0 || c && l >= s;
+  }
+  function v() {
+    var e = x();
+    if (E(e))
+      return p(e);
+    i = setTimeout(v, C(e));
+  }
+  function p(e) {
+    return i = void 0, d && o ? g(e) : (o = m = void 0, u);
+  }
+  function W() {
+    i !== void 0 && clearTimeout(i), f = 0, o = r = m = i = void 0;
+  }
+  function L() {
+    return i === void 0 ? u : p(x());
+  }
+  function T() {
+    var e = x(), n = E(e);
+    if (o = arguments, m = this, r = e, n) {
+      if (i === void 0)
+        return _(r);
+      if (c)
+        return clearTimeout(i), i = setTimeout(v, t), g(r);
+    }
+    return i === void 0 && (i = setTimeout(v, t)), u;
+  }
+  return T.cancel = W, T.flush = L, T;
 }
+var D = A;
+const z = /* @__PURE__ */ M(D);
 export {
-  w as default
+  z as default
 };
 //# sourceMappingURL=index.es182.js.map

package/dist/index.es182.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es182.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]}
+{"version":3,"file":"index.es182.js","sources":["../../../node_modules/lodash/debounce.js"],"sourcesContent":["var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n"],"names":["isObject","require$$0","now","require$$1","toNumber","require$$2","FUNC_ERROR_TEXT","nativeMax","nativeMin","debounce","func","wait","options","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","invokeFunc","time","args","thisArg","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","debounce_1"],"mappings":";;;;AAAA,IAAIA,IAAWC,GACXC,IAAMC,GACNC,IAAWC,GAGXC,IAAkB,uBAGlBC,IAAY,KAAK,KACjBC,IAAY,KAAK;AAwDrB,SAASC,EAASC,GAAMC,GAAMC,GAAS;AACrC,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,IAAiB,GACjBC,IAAU,IACVC,IAAS,IACTC,IAAW;AAEX,MAAA,OAAOZ,KAAQ;AACX,UAAA,IAAI,UAAUJ,CAAe;AAE9B,EAAAK,IAAAP,EAASO,CAAI,KAAK,GACrBX,EAASY,CAAO,MACRQ,IAAA,CAAC,CAACR,EAAQ,SACpBS,IAAS,aAAaT,GACZG,IAAAM,IAASd,EAAUH,EAASQ,EAAQ,OAAO,KAAK,GAAGD,CAAI,IAAII,GACrEO,IAAW,cAAcV,IAAU,CAAC,CAACA,EAAQ,WAAWU;AAG1D,WAASC,EAAWC,GAAM;AACpB,QAAAC,IAAOZ,GACPa,IAAUZ;AAEd,WAAAD,IAAWC,IAAW,QACLK,IAAAK,GACRR,IAAAN,EAAK,MAAMgB,GAASD,CAAI,GAC1BT;AAAA,EACT;AAEA,WAASW,EAAYH,GAAM;AAER,WAAAL,IAAAK,GAEPP,IAAA,WAAWW,GAAcjB,CAAI,GAEhCS,IAAUG,EAAWC,CAAI,IAAIR;AAAA,EACtC;AAEA,WAASa,EAAcL,GAAM;AAC3B,QAAIM,IAAoBN,IAAON,GAC3Ba,IAAsBP,IAAOL,GAC7Ba,IAAcrB,IAAOmB;AAEzB,WAAOT,IACHb,EAAUwB,GAAajB,IAAUgB,CAAmB,IACpDC;AAAA,EACN;AAEA,WAASC,EAAaT,GAAM;AAC1B,QAAIM,IAAoBN,IAAON,GAC3Ba,IAAsBP,IAAOL;AAKjC,WAAQD,MAAiB,UAAcY,KAAqBnB,KACzDmB,IAAoB,KAAOT,KAAUU,KAAuBhB;AAAA,EACjE;AAEA,WAASa,IAAe;AACtB,QAAIJ,IAAOtB;AACP,QAAA+B,EAAaT,CAAI;AACnB,aAAOU,EAAaV,CAAI;AAG1B,IAAAP,IAAU,WAAWW,GAAcC,EAAcL,CAAI,CAAC;AAAA,EACxD;AAEA,WAASU,EAAaV,GAAM;AAK1B,WAJUP,IAAA,QAINK,KAAYT,IACPU,EAAWC,CAAI,KAExBX,IAAWC,IAAW,QACfE;AAAA,EACT;AAEA,WAASmB,IAAS;AAChB,IAAIlB,MAAY,UACd,aAAaA,CAAO,GAELE,IAAA,GACNN,IAAAK,IAAeJ,IAAWG,IAAU;AAAA,EACjD;AAEA,WAASmB,IAAQ;AACf,WAAOnB,MAAY,SAAYD,IAASkB,EAAahC,GAAK;AAAA,EAC5D;AAEA,WAASmC,IAAY;AACnB,QAAIb,IAAOtB,EACP,GAAAoC,IAAaL,EAAaT,CAAI;AAMlC,QAJWX,IAAA,WACAC,IAAA,MACII,IAAAM,GAEXc,GAAY;AACd,UAAIrB,MAAY;AACd,eAAOU,EAAYT,CAAY;AAEjC,UAAIG;AAEF,4BAAaJ,CAAO,GACVA,IAAA,WAAWW,GAAcjB,CAAI,GAChCY,EAAWL,CAAY;AAAA,IAElC;AACA,WAAID,MAAY,WACJA,IAAA,WAAWW,GAAcjB,CAAI,IAElCK;AAAA,EACT;AACA,SAAAqB,EAAU,SAASF,GACnBE,EAAU,QAAQD,GACXC;AACT;AAEA,IAAAE,IAAiB9B;;","x_google_ignoreList":[0]}