@performant-software/visualize 3.0.6-beta.9 → 3.0.7-beta.0

package/dist/index.es44.js

@@ -1,5 +1,5 @@
 import p from "react";
-import x from "./index.es63.js";
+import x from "./index.es65.js";
 import { getX as y, getY as b, getSource as O, getTarget as j } from "./index.es185.js";
 import $ from "./index.es187.js";
 var L = ["className", "innerRef", "data", "path", "x", "y", "source", "target", "children"];

package/dist/index.es45.js

@@ -1,5 +1,5 @@
 import c from "react";
-import x from "./index.es63.js";
+import x from "./index.es65.js";
 import { getX as y, getY as b, getSource as O, getTarget as j } from "./index.es185.js";
 import { linkVertical as k } from "./index.es186.js";
 var N = ["className", "children", "data", "innerRef", "path", "x", "y", "source", "target"];

package/dist/index.es46.js

@@ -1,5 +1,5 @@
 import m from "react";
-import b from "./index.es63.js";
+import b from "./index.es65.js";
 import { getY as O, getX as $, getSource as j, getTarget as T } from "./index.es185.js";
 import N from "./index.es187.js";
 var R = ["className", "innerRef", "data", "path", "percent", "x", "y", "source", "target", "children"];

package/dist/index.es47.js

@@ -1,5 +1,5 @@
 import f from "react";
-import b from "./index.es63.js";
+import b from "./index.es65.js";
 import { getY as O, getX as $, getSource as j, getTarget as z } from "./index.es185.js";
 import N from "./index.es187.js";
 var R = ["className", "children", "data", "innerRef", "path", "percent", "x", "y", "source", "target"];

package/dist/index.es48.js

@@ -1,5 +1,5 @@
 import p from "react";
-import x from "./index.es63.js";
+import x from "./index.es65.js";
 import { getY as y, getX as b, getSource as O, getTarget as j } from "./index.es185.js";
 import $ from "./index.es187.js";
 var L = ["className", "children", "innerRef", "data", "path", "x", "y", "source", "target"];

package/dist/index.es49.js

@@ -1,5 +1,5 @@
 import l from "react";
-import x from "./index.es63.js";
+import x from "./index.es65.js";
 import { getY as y, getX as b, getSource as O, getTarget as j } from "./index.es185.js";
 import { linkHorizontal as k } from "./index.es186.js";
 var z = ["className", "children", "data", "innerRef", "path", "x", "y", "source", "target"];

package/dist/index.es5.js

@@ -1,5 +1,5 @@
-import * as i from "./index.es70.js";
-import m from "./index.es71.js";
+import * as i from "./index.es69.js";
+import m from "./index.es70.js";
 var r = m(i);
 r._ = r;
 export {

package/dist/index.es53.js

@@ -1,5 +1,5 @@
-import f from "./index.es174.js";
-import { isElement as a, isEvent as o } from "./index.es175.js";
+import f from "./index.es62.js";
+import { isElement as a, isEvent as o } from "./index.es63.js";
 function c(r, i) {
   if (a(r) && i)
     return f(r, i);

package/dist/index.es54.js

@@ -1,7 +1,7 @@
-import d from "./index.es62.js";
+import d from "./index.es64.js";
 import sa, { useRef as ca, useState as I, useCallback as l } from "react";
-import { useGesture as Ma } from "./index.es172.js";
-import { applyMatrixToPoint as Da, applyInverseMatrixToPoint as K, composeMatrices as oa, translateMatrix as z, scaleMatrix as Sa, inverseMatrix as wa, identityMatrix as Pa } from "./index.es173.js";
+import { useGesture as Ma } from "./index.es183.js";
+import { applyMatrixToPoint as Da, applyInverseMatrixToPoint as K, composeMatrices as oa, translateMatrix as z, scaleMatrix as Sa, inverseMatrix as wa, identityMatrix as Pa } from "./index.es184.js";
 import B from "./index.es53.js";
 function F() {
   return F = Object.assign ? Object.assign.bind() : function(s) {

package/dist/index.es58.js

@@ -1,12 +1,12 @@
-import Y from "./index.es176.js";
-import k from "./index.es177.js";
-import j from "./index.es178.js";
-import _ from "./index.es179.js";
-import ne from "./index.es180.js";
-import G from "./index.es181.js";
-import E from "./index.es182.js";
-import D from "./index.es183.js";
-import $e from "./index.es184.js";
+import Y from "./index.es171.js";
+import k from "./index.es172.js";
+import j from "./index.es173.js";
+import _ from "./index.es174.js";
+import ne from "./index.es175.js";
+import G from "./index.es176.js";
+import E from "./index.es177.js";
+import D from "./index.es178.js";
+import $e from "./index.es179.js";
 function ye(o, a) {
   var n = Object.keys(o);
   if (Object.getOwnPropertySymbols) {

package/dist/index.es62.js

@@ -1,16 +1,24 @@
-import { getDefaultExportFromCjs as e } from "./index.es188.js";
-import { __module as r } from "./index.es189.js";
-import { __require as o } from "./index.es190.js";
-import { __require as t } from "./index.es191.js";
-import { __require as p } from "./index.es192.js";
-if (process.env.NODE_ENV !== "production") {
-  var s = o(), i = !0;
-  r.exports = t()(s.isElement, i);
-} else
-  r.exports = p()();
-var m = r.exports;
-const q = /* @__PURE__ */ e(m);
+import { isSVGElement as c, isSVGGraphicsElement as f, isSVGSVGElement as s } from "./index.es63.js";
+import o from "./index.es188.js";
+import a from "./index.es189.js";
+function G(r, l) {
+  if (!r || !l)
+    return null;
+  var t = o(l), n = c(r) ? r.ownerSVGElement : r, i = f(n) ? n.getScreenCTM() : null;
+  if (s(n) && i) {
+    var e = n.createSVGPoint();
+    return e.x = t.x, e.y = t.y, e = e.matrixTransform(i.inverse()), new a({
+      x: e.x,
+      y: e.y
+    });
+  }
+  var m = r.getBoundingClientRect();
+  return new a({
+    x: t.x - m.left - r.clientLeft,
+    y: t.y - m.top - r.clientTop
+  });
+}
 export {
-  q as default
+  G as default
 };
 //# sourceMappingURL=index.es62.js.map

package/dist/index.es62.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es62.js","sources":["../../../node_modules/prop-types/index.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactIs = require('react-is');\n\n  // By explicitly using `prop-types` you are opting into new development behavior.\n  // http://fb.me/prop-types-in-prod\n  var throwOnDirectAccess = true;\n  module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = require('./factoryWithThrowingShims')();\n}\n"],"names":["ReactIs","require$$0","throwOnDirectAccess","propTypesModule","require$$1","require$$2"],"mappings":";;;;;AAOA,IAAI,QAAQ,IAAI,aAAa,cAAc;AACrC,MAAAA,IAAUC,KAIVC,IAAsB;AAC1BC,EAAAA,EAAA,UAAiBC,EAAA,EAAqCJ,EAAQ,WAAWE,CAAmB;AAC9F;AAGSC,EAAAA,EAAA,UAAUE,EAAsC;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es62.js","sources":["../../../node_modules/@visx/event/esm/localPointGeneric.js"],"sourcesContent":["import { Point } from '@visx/point';\nimport { isSVGElement, isSVGGraphicsElement, isSVGSVGElement } from './typeGuards';\nimport getXAndYFromEvent from './getXAndYFromEvent';\nexport default function localPoint(node, event) {\n  if (!node || !event) return null;\n  var coords = getXAndYFromEvent(event);\n\n  // find top-most SVG\n  var svg = isSVGElement(node) ? node.ownerSVGElement : node;\n  var screenCTM = isSVGGraphicsElement(svg) ? svg.getScreenCTM() : null;\n  if (isSVGSVGElement(svg) && screenCTM) {\n    var point = svg.createSVGPoint();\n    point.x = coords.x;\n    point.y = coords.y;\n    point = point.matrixTransform(screenCTM.inverse());\n    return new Point({\n      x: point.x,\n      y: point.y\n    });\n  }\n\n  // fall back to bounding box\n  var rect = node.getBoundingClientRect();\n  return new Point({\n    x: coords.x - rect.left - node.clientLeft,\n    y: coords.y - rect.top - node.clientTop\n  });\n}"],"names":["localPoint","node","event","coords","getXAndYFromEvent","svg","isSVGElement","screenCTM","isSVGGraphicsElement","isSVGSVGElement","point","Point","rect"],"mappings":";;;AAGwB,SAAAA,EAAWC,GAAMC,GAAO;AAC1C,MAAA,CAACD,KAAQ,CAACC;AAAc,WAAA;AACxB,MAAAC,IAASC,EAAkBF,CAAK,GAGhCG,IAAMC,EAAaL,CAAI,IAAIA,EAAK,kBAAkBA,GAClDM,IAAYC,EAAqBH,CAAG,IAAIA,EAAI,aAAiB,IAAA;AAC7D,MAAAI,EAAgBJ,CAAG,KAAKE,GAAW;AACjC,QAAAG,IAAQL,EAAI;AAChB,WAAAK,EAAM,IAAIP,EAAO,GACjBO,EAAM,IAAIP,EAAO,GACjBO,IAAQA,EAAM,gBAAgBH,EAAU,QAAS,CAAA,GAC1C,IAAII,EAAM;AAAA,MACf,GAAGD,EAAM;AAAA,MACT,GAAGA,EAAM;AAAA,IAAA,CACV;AAAA,EACH;AAGI,MAAAE,IAAOX,EAAK;AAChB,SAAO,IAAIU,EAAM;AAAA,IACf,GAAGR,EAAO,IAAIS,EAAK,OAAOX,EAAK;AAAA,IAC/B,GAAGE,EAAO,IAAIS,EAAK,MAAMX,EAAK;AAAA,EAAA,CAC/B;AACH;","x_google_ignoreList":[0]}

package/dist/index.es63.js

@@ -1,43 +1,31 @@
-import { getDefaultExportFromCjs as p } from "./index.es188.js";
-import { __module as i } from "./index.es204.js";
-/*!
-	Copyright (c) 2018 Jed Watson.
-	Licensed under the MIT License (MIT), see
-	http://jedwatson.github.io/classnames
-*/
-(function(o) {
-  (function() {
-    var f = {}.hasOwnProperty;
-    function e() {
-      for (var t = "", r = 0; r < arguments.length; r++) {
-        var n = arguments[r];
-        n && (t = s(t, u(n)));
-      }
-      return t;
-    }
-    function u(t) {
-      if (typeof t == "string" || typeof t == "number")
-        return t;
-      if (typeof t != "object")
-        return "";
-      if (Array.isArray(t))
-        return e.apply(null, t);
-      if (t.toString !== Object.prototype.toString && !t.toString.toString().includes("[native code]"))
-        return t.toString();
-      var r = "";
-      for (var n in t)
-        f.call(t, n) && t[n] && (r = s(r, n));
-      return r;
-    }
-    function s(t, r) {
-      return r ? t ? t + " " + r : t + r : t;
-    }
-    o.exports ? (e.default = e, o.exports = e) : window.classNames = e;
-  })();
-})(i);
-var a = i.exports;
-const m = /* @__PURE__ */ p(a);
+function t(n) {
+  return !!n && n instanceof Element;
+}
+function i(n) {
+  return !!n && (n instanceof SVGElement || "ownerSVGElement" in n);
+}
+function e(n) {
+  return !!n && "createSVGPoint" in n;
+}
+function r(n) {
+  return !!n && "getScreenCTM" in n;
+}
+function c(n) {
+  return !!n && "changedTouches" in n;
+}
+function o(n) {
+  return !!n && "clientX" in n;
+}
+function u(n) {
+  return !!n && (n instanceof Event || "nativeEvent" in n && n.nativeEvent instanceof Event);
+}
 export {
-  m as default
+  t as isElement,
+  u as isEvent,
+  o as isMouseEvent,
+  i as isSVGElement,
+  r as isSVGGraphicsElement,
+  e as isSVGSVGElement,
+  c as isTouchEvent
 };
 //# sourceMappingURL=index.es63.js.map

package/dist/index.es63.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es63.js","sources":["../../../node_modules/classnames/index.js"],"sourcesContent":["/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = '';\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (arg) {\n\t\t\t\tclasses = appendClass(classes, parseValue(arg));\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction parseValue (arg) {\n\t\tif (typeof arg === 'string' || typeof arg === 'number') {\n\t\t\treturn arg;\n\t\t}\n\n\t\tif (typeof arg !== 'object') {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (Array.isArray(arg)) {\n\t\t\treturn classNames.apply(null, arg);\n\t\t}\n\n\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\treturn arg.toString();\n\t\t}\n\n\t\tvar classes = '';\n\n\t\tfor (var key in arg) {\n\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\tclasses = appendClass(classes, key);\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction appendClass (value, newClass) {\n\t\tif (!newClass) {\n\t\t\treturn value;\n\t\t}\n\t\n\t\tif (value) {\n\t\t\treturn value + ' ' + newClass;\n\t\t}\n\t\n\t\treturn value + newClass;\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n"],"names":["hasOwn","classNames","classes","i","arg","appendClass","parseValue","key","value","newClass","module"],"mappings":";;;;;;;;AAAA,GAOC,WAAY;AAGR,QAAAA,IAAS,CAAG,EAAA;AAEhB,aAASC,IAAc;AAGtB,eAFIC,IAAU,IAELC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AACtC,YAAAC,IAAM,UAAUD,CAAC;AACrB,QAAIC,MACHF,IAAUG,EAAYH,GAASI,EAAWF,CAAG,CAAC;AAAA,MAEhD;AAEO,aAAAF;AAAA,IACR;AAEA,aAASI,EAAYF,GAAK;AACzB,UAAI,OAAOA,KAAQ,YAAY,OAAOA,KAAQ;AACtC,eAAAA;AAGJ,UAAA,OAAOA,KAAQ;AACX,eAAA;AAGJ,UAAA,MAAM,QAAQA,CAAG;AACb,eAAAH,EAAW,MAAM,MAAMG,CAAG;AAGlC,UAAIA,EAAI,aAAa,OAAO,UAAU,YAAY,CAACA,EAAI,SAAS,SAAS,EAAE,SAAS,eAAe;AAClG,eAAOA,EAAI;AAGZ,UAAIF,IAAU;AAEd,eAASK,KAAOH;AACf,QAAIJ,EAAO,KAAKI,GAAKG,CAAG,KAAKH,EAAIG,CAAG,MACzBL,IAAAG,EAAYH,GAASK,CAAG;AAI7B,aAAAL;AAAA,IACR;AAES,aAAAG,EAAaG,GAAOC,GAAU;AACtC,aAAKA,IAIDD,IACIA,IAAQ,MAAMC,IAGfD,IAAQC,IAPPD;AAAA,IAQT;AAEA,IAAqCE,EAAO,WAC3CT,EAAW,UAAUA,GACrBS,EAAA,UAAiBT,KAOjB,OAAO,aAAaA;AAAA,EAEtB;;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es63.js","sources":["../../../node_modules/@visx/event/esm/typeGuards.js"],"sourcesContent":["export function isElement(elem) {\n  return !!elem && elem instanceof Element;\n}\n\n// functional definition of isSVGElement. Note that SVGSVGElements are HTMLElements\nexport function isSVGElement(elem) {\n  return !!elem && (elem instanceof SVGElement || 'ownerSVGElement' in elem);\n}\n\n// functional definition of SVGGElement\nexport function isSVGSVGElement(elem) {\n  return !!elem && 'createSVGPoint' in elem;\n}\nexport function isSVGGraphicsElement(elem) {\n  return !!elem && 'getScreenCTM' in elem;\n}\n\n// functional definition of TouchEvent\nexport function isTouchEvent(event) {\n  return !!event && 'changedTouches' in event;\n}\n\n// functional definition of MouseEvent\nexport function isMouseEvent(event) {\n  return !!event && 'clientX' in event;\n}\n\n// functional definition of event\nexport function isEvent(event) {\n  return !!event && (event instanceof Event || 'nativeEvent' in event && event.nativeEvent instanceof Event);\n}"],"names":["isElement","elem","isSVGElement","isSVGSVGElement","isSVGGraphicsElement","isTouchEvent","event","isMouseEvent","isEvent"],"mappings":"AAAO,SAASA,EAAUC,GAAM;AACvB,SAAA,CAAC,CAACA,KAAQA,aAAgB;AACnC;AAGO,SAASC,EAAaD,GAAM;AACjC,SAAO,CAAC,CAACA,MAASA,aAAgB,cAAc,qBAAqBA;AACvE;AAGO,SAASE,EAAgBF,GAAM;AAC7B,SAAA,CAAC,CAACA,KAAQ,oBAAoBA;AACvC;AACO,SAASG,EAAqBH,GAAM;AAClC,SAAA,CAAC,CAACA,KAAQ,kBAAkBA;AACrC;AAGO,SAASI,EAAaC,GAAO;AAC3B,SAAA,CAAC,CAACA,KAAS,oBAAoBA;AACxC;AAGO,SAASC,EAAaD,GAAO;AAC3B,SAAA,CAAC,CAACA,KAAS,aAAaA;AACjC;AAGO,SAASE,EAAQF,GAAO;AACtB,SAAA,CAAC,CAACA,MAAUA,aAAiB,SAAS,iBAAiBA,KAASA,EAAM,uBAAuB;AACtG;","x_google_ignoreList":[0]}

package/dist/index.es64.js

@@ -1,40 +1,16 @@
-import e from "./index.es62.js";
-import s from "react";
-var u = {
-  source: {
-    x: 0,
-    y: 0
-  },
-  target: {
-    x: 0,
-    y: 0
-  }
-};
-function a(t) {
-  var i = t.link, r = i === void 0 ? u : i;
-  return /* @__PURE__ */ s.createElement("line", {
-    x1: r.source.x,
-    y1: r.source.y,
-    x2: r.target.x,
-    y2: r.target.y,
-    strokeWidth: 2,
-    stroke: "#999",
-    strokeOpacity: 0.6
-  });
-}
-a.propTypes = {
-  link: e.shape({
-    source: e.shape({
-      x: e.number.isRequired,
-      y: e.number.isRequired
-    }).isRequired,
-    target: e.shape({
-      x: e.number.isRequired,
-      y: e.number.isRequired
-    }).isRequired
-  })
-};
+import { getDefaultExportFromCjs as e } from "./index.es190.js";
+import { __module as r } from "./index.es191.js";
+import { __require as o } from "./index.es192.js";
+import { __require as t } from "./index.es193.js";
+import { __require as p } from "./index.es194.js";
+if (process.env.NODE_ENV !== "production") {
+  var s = o(), i = !0;
+  r.exports = t()(s.isElement, i);
+} else
+  r.exports = p()();
+var m = r.exports;
+const q = /* @__PURE__ */ e(m);
 export {
-  a as default
+  q as default
 };
 //# sourceMappingURL=index.es64.js.map

package/dist/index.es64.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es64.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n  source: {\n    x: 0,\n    y: 0\n  },\n  target: {\n    x: 0,\n    y: 0\n  }\n};\nexport default function HierarchyDefaultLink(_ref) {\n  var _ref$link = _ref.link,\n    link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n  return /*#__PURE__*/React.createElement(\"line\", {\n    x1: link.source.x,\n    y1: link.source.y,\n    x2: link.target.x,\n    y2: link.target.y,\n    strokeWidth: 2,\n    stroke: \"#999\",\n    strokeOpacity: 0.6\n  });\n}\nHierarchyDefaultLink.propTypes = {\n  link: _pt.shape({\n    source: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired,\n    target: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired\n  })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":";;AAEA,IAAIA,IAAe;AAAA,EACjB,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AAAA,EACA,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC3B,SAAA,gBAAAE,EAAM,cAAc,QAAQ;AAAA,IAC9C,IAAID,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,eAAe;AAAA,EAAA,CAChB;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es64.js","sources":["../../../node_modules/prop-types/index.js"],"sourcesContent":["/**\n * Copyright (c) 2013-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\nif (process.env.NODE_ENV !== 'production') {\n  var ReactIs = require('react-is');\n\n  // By explicitly using `prop-types` you are opting into new development behavior.\n  // http://fb.me/prop-types-in-prod\n  var throwOnDirectAccess = true;\n  module.exports = require('./factoryWithTypeCheckers')(ReactIs.isElement, throwOnDirectAccess);\n} else {\n  // By explicitly using `prop-types` you are opting into new production behavior.\n  // http://fb.me/prop-types-in-prod\n  module.exports = require('./factoryWithThrowingShims')();\n}\n"],"names":["ReactIs","require$$0","throwOnDirectAccess","propTypesModule","require$$1","require$$2"],"mappings":";;;;;AAOA,IAAI,QAAQ,IAAI,aAAa,cAAc;AACrC,MAAAA,IAAUC,KAIVC,IAAsB;AAC1BC,EAAAA,EAAA,UAAiBC,EAAA,EAAqCJ,EAAQ,WAAWE,CAAmB;AAC9F;AAGSC,EAAAA,EAAA,UAAUE,EAAsC;;;","x_google_ignoreList":[0]}

package/dist/index.es65.js

@@ -1,26 +1,43 @@
-import e from "./index.es62.js";
-import n from "react";
-function t(i) {
-  var o = i.node, r = o === void 0 ? {
-    x: 0,
-    y: 0,
-    r: 15
-  } : o;
-  return /* @__PURE__ */ n.createElement("circle", {
-    cx: r.x,
-    cy: r.y,
-    r: r.r || 15,
-    fill: "#21D4FD"
-  });
-}
-t.propTypes = {
-  node: e.shape({
-    x: e.number.isRequired,
-    y: e.number.isRequired,
-    r: e.number
-  })
-};
+import { getDefaultExportFromCjs as p } from "./index.es190.js";
+import { __module as i } from "./index.es195.js";
+/*!
+	Copyright (c) 2018 Jed Watson.
+	Licensed under the MIT License (MIT), see
+	http://jedwatson.github.io/classnames
+*/
+(function(o) {
+  (function() {
+    var f = {}.hasOwnProperty;
+    function e() {
+      for (var t = "", r = 0; r < arguments.length; r++) {
+        var n = arguments[r];
+        n && (t = s(t, u(n)));
+      }
+      return t;
+    }
+    function u(t) {
+      if (typeof t == "string" || typeof t == "number")
+        return t;
+      if (typeof t != "object")
+        return "";
+      if (Array.isArray(t))
+        return e.apply(null, t);
+      if (t.toString !== Object.prototype.toString && !t.toString.toString().includes("[native code]"))
+        return t.toString();
+      var r = "";
+      for (var n in t)
+        f.call(t, n) && t[n] && (r = s(r, n));
+      return r;
+    }
+    function s(t, r) {
+      return r ? t ? t + " " + r : t + r : t;
+    }
+    o.exports ? (e.default = e, o.exports = e) : window.classNames = e;
+  })();
+})(i);
+var a = i.exports;
+const m = /* @__PURE__ */ p(a);
 export {
-  t as default
+  m as default
 };
 //# sourceMappingURL=index.es65.js.map

package/dist/index.es65.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es65.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n  var _ref$node = _ref.node,\n    node = _ref$node === void 0 ? {\n      x: 0,\n      y: 0,\n      r: 15\n    } : _ref$node;\n  return /*#__PURE__*/React.createElement(\"circle\", {\n    cx: node.x,\n    cy: node.y,\n    r: node.r || 15,\n    fill: \"#21D4FD\"\n  });\n}\nHierarchyDefaultNode.propTypes = {\n  node: _pt.shape({\n    x: _pt.number.isRequired,\n    y: _pt.number.isRequired,\n    r: _pt.number\n  })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es65.js","sources":["../../../node_modules/classnames/index.js"],"sourcesContent":["/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = '';\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (arg) {\n\t\t\t\tclasses = appendClass(classes, parseValue(arg));\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction parseValue (arg) {\n\t\tif (typeof arg === 'string' || typeof arg === 'number') {\n\t\t\treturn arg;\n\t\t}\n\n\t\tif (typeof arg !== 'object') {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (Array.isArray(arg)) {\n\t\t\treturn classNames.apply(null, arg);\n\t\t}\n\n\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\treturn arg.toString();\n\t\t}\n\n\t\tvar classes = '';\n\n\t\tfor (var key in arg) {\n\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\tclasses = appendClass(classes, key);\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction appendClass (value, newClass) {\n\t\tif (!newClass) {\n\t\t\treturn value;\n\t\t}\n\t\n\t\tif (value) {\n\t\t\treturn value + ' ' + newClass;\n\t\t}\n\t\n\t\treturn value + newClass;\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n"],"names":["hasOwn","classNames","classes","i","arg","appendClass","parseValue","key","value","newClass","module"],"mappings":";;;;;;;;AAAA,GAOC,WAAY;AAGR,QAAAA,IAAS,CAAG,EAAA;AAEhB,aAASC,IAAc;AAGtB,eAFIC,IAAU,IAELC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AACtC,YAAAC,IAAM,UAAUD,CAAC;AACrB,QAAIC,MACHF,IAAUG,EAAYH,GAASI,EAAWF,CAAG,CAAC;AAAA,MAEhD;AAEO,aAAAF;AAAA,IACR;AAEA,aAASI,EAAYF,GAAK;AACzB,UAAI,OAAOA,KAAQ,YAAY,OAAOA,KAAQ;AACtC,eAAAA;AAGJ,UAAA,OAAOA,KAAQ;AACX,eAAA;AAGJ,UAAA,MAAM,QAAQA,CAAG;AACb,eAAAH,EAAW,MAAM,MAAMG,CAAG;AAGlC,UAAIA,EAAI,aAAa,OAAO,UAAU,YAAY,CAACA,EAAI,SAAS,SAAS,EAAE,SAAS,eAAe;AAClG,eAAOA,EAAI;AAGZ,UAAIF,IAAU;AAEd,eAASK,KAAOH;AACf,QAAIJ,EAAO,KAAKI,GAAKG,CAAG,KAAKH,EAAIG,CAAG,MACzBL,IAAAG,EAAYH,GAASK,CAAG;AAI7B,aAAAL;AAAA,IACR;AAES,aAAAG,EAAaG,GAAOC,GAAU;AACtC,aAAKA,IAIDD,IACIA,IAAQ,MAAMC,IAGfD,IAAQC,IAPPD;AAAA,IAQT;AAEA,IAAqCE,EAAO,WAC3CT,EAAW,UAAUA,GACrBS,EAAA,UAAiBT,KAOjB,OAAO,aAAaA;AAAA,EAEtB;;;;","x_google_ignoreList":[0]}

package/dist/index.es66.js

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

package/dist/index.es66.js.map

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