@performant-software/visualize 3.0.1 → 3.0.2-beta.0

package/dist/index.es153.js

@@ -1,9 +1,9 @@
-import t from "./index.es221.js";
-import a from "./index.es198.js";
-const p = t(function(o, i, f) {
-  a(o, f) ? o[f]++ : o[f] = 1;
-});
+import e from "./index.es221.js";
+import t from "./index.es88.js";
+function f(r) {
+  return r == null ? 0 : e(r) ? r.length : t(r).length;
+}
 export {
-  p as default
+  f as default
 };
 //# sourceMappingURL=index.es153.js.map

package/dist/index.es153.js.map

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

package/dist/index.es154.js

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

package/dist/index.es154.js.map

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

package/dist/index.es155.js

@@ -1,15 +1,8 @@
-import f from "./index.es83.js";
-import { slice as t } from "./index.es6.js";
-import i from "./index.es75.js";
-import m from "./index.es219.js";
-import u from "./index.es136.js";
-import e from "./index.es106.js";
-import o from "./index.es93.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) : [];
+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)));
 }
 export {
-  A as default
+  a as default
 };
 //# sourceMappingURL=index.es155.js.map

package/dist/index.es155.js.map

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

package/dist/index.es156.js

@@ -1,7 +1,6 @@
-import e from "./index.es219.js";
-import t from "./index.es91.js";
-function f(r) {
-  return r == null ? 0 : e(r) ? r.length : t(r).length;
+import n from "./index.es157.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));
 }
 export {
   f as default

package/dist/index.es156.js.map

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

package/dist/index.es157.js

@@ -1,6 +1,6 @@
-import n from "./index.es158.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);
+import { slice as e } from "./index.es6.js";
+function u(r, l, t) {
+  return e.call(r, l == null || t ? 1 : l);
 }
 export {
   u as default

package/dist/index.es157.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es157.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.es157.js","sources":["../../../node_modules/underscore/modules/rest.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the first entry of the `array`. Especially useful on\n// the `arguments` object. Passing an **n** will return the rest N values in the\n// `array`.\nexport default function rest(array, n, guard) {\n  return slice.call(array, n == null || guard ? 1 : n);\n}\n"],"names":["rest","array","n","guard","slice"],"mappings":";AAKwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAOC,EAAM,KAAKH,GAAOC,KAAK,QAAQC,IAAQ,IAAID,CAAC;AACrD;","x_google_ignoreList":[0]}

package/dist/index.es158.js

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

package/dist/index.es158.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es158.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.es158.js","sources":["../../../node_modules/underscore/modules/compact.js"],"sourcesContent":["import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n  return filter(array, Boolean);\n}\n"],"names":["compact","array","filter"],"mappings":";AAGA,SAAwBA,EAAQC,GAAO;AAC9B,SAAAC,EAAOD,GAAO,OAAO;AAC9B;","x_google_ignoreList":[0]}

package/dist/index.es159.js

@@ -1,8 +1,8 @@
-import n from "./index.es160.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 f from "./index.es218.js";
+function n(t, e) {
+  return f(t, e, !1);
 }
 export {
-  f as default
+  n as default
 };
 //# sourceMappingURL=index.es159.js.map

package/dist/index.es159.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es159.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.es159.js","sources":["../../../node_modules/underscore/modules/flatten.js"],"sourcesContent":["import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n  return _flatten(array, depth, false);\n}\n"],"names":["flatten","array","depth","_flatten"],"mappings":";AAIwB,SAAAA,EAAQC,GAAOC,GAAO;AACrC,SAAAC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}

package/dist/index.es16.js

@@ -1,5 +1,5 @@
-import e from "./index.es211.js";
-import a from "./index.es212.js";
+import e from "./index.es213.js";
+import a from "./index.es214.js";
 const o = e(a);
 export {
   o as default

package/dist/index.es160.js

@@ -1,8 +1,16 @@
-import { slice as e } from "./index.es6.js";
-function u(r, l, t) {
-  return e.call(r, l == null || t ? 1 : l);
+import b from "./index.es70.js";
+import q from "./index.es211.js";
+import B from "./index.es202.js";
+import r from "./index.es140.js";
+function w(l, p, f, g) {
+  b(p) || (g = f, f = p, p = !1), f != null && (f = q(f, g));
+  for (var s = [], h = [], o = 0, u = B(l); o < u; o++) {
+    var n = l[o], m = f ? f(n, o, l) : n;
+    p && !f ? ((!o || h !== m) && s.push(n), h = m) : f ? r(h, m) || (h.push(m), s.push(n)) : r(s, n) || s.push(n);
+  }
+  return s;
 }
 export {
-  u as default
+  w as default
 };
 //# sourceMappingURL=index.es160.js.map

package/dist/index.es160.js.map

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

package/dist/index.es161.js

@@ -1,8 +1,18 @@
-import t from "./index.es139.js";
-function e(o) {
-  return t(o, Boolean);
+import u from "./index.es202.js";
+import f from "./index.es140.js";
+function v(o) {
+  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
+    var e = o[n];
+    if (!f(t, e)) {
+      var r;
+      for (r = 1; r < a && f(arguments[r], e); r++)
+        ;
+      r === a && t.push(e);
+    }
+  }
+  return t;
 }
 export {
-  e as default
+  v as default
 };
 //# sourceMappingURL=index.es161.js.map

package/dist/index.es161.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es161.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.es161.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es162.js

@@ -1,6 +1,10 @@
-import f from "./index.es216.js";
-function n(t, e) {
-  return f(t, e, !1);
+import f from "./index.es143.js";
+import p from "./index.es202.js";
+import u from "./index.es141.js";
+function n(t) {
+  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
+    m[r] = u(t, r);
+  return m;
 }
 export {
   n as default

package/dist/index.es162.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es162.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.es162.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es163.js

@@ -1,16 +1,10 @@
-import b from "./index.es73.js";
-import q from "./index.es209.js";
-import B from "./index.es200.js";
-import r from "./index.es143.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 n from "./index.es202.js";
+function u(e, t) {
+  for (var o = {}, r = 0, f = n(e); r < f; r++)
+    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
+  return o;
 }
 export {
-  w as default
+  u as default
 };
 //# sourceMappingURL=index.es163.js.map

package/dist/index.es163.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es163.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.es163.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es164.js

@@ -1,18 +1,10 @@
-import u from "./index.es200.js";
-import f from "./index.es143.js";
-function v(o) {
-  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
-    var e = o[n];
-    if (!f(t, e)) {
-      var r;
-      for (r = 1; r < a && f(arguments[r], e); r++)
-        ;
-      r === a && t.push(e);
-    }
-  }
-  return t;
+function u(n, a, r) {
+  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
+  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
+    e[f] = n;
+  return e;
 }
 export {
-  v as default
+  u as default
 };
 //# sourceMappingURL=index.es164.js.map

package/dist/index.es164.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es164.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es164.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es165.js

@@ -1,12 +1,12 @@
-import f from "./index.es146.js";
-import p from "./index.es200.js";
-import u from "./index.es144.js";
-function n(t) {
-  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
-    m[r] = u(t, r);
-  return m;
+import { slice as n } from "./index.es6.js";
+function h(r, l) {
+  if (l == null || l < 1)
+    return [];
+  for (var t = [], e = 0, i = r.length; e < i; )
+    t.push(n.call(r, e, e += l));
+  return t;
 }
 export {
-  n as default
+  h as default
 };
 //# sourceMappingURL=index.es165.js.map

package/dist/index.es165.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es165.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es165.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es166.js

@@ -1,10 +1,24 @@
-import n from "./index.es200.js";
-function u(e, t) {
-  for (var o = {}, r = 0, f = n(e); r < f; r++)
-    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
-  return o;
+import { isSVGElement as c, isSVGGraphicsElement as f, isSVGSVGElement as s } from "./index.es167.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 {
-  u as default
+  G as default
 };
 //# sourceMappingURL=index.es166.js.map

package/dist/index.es166.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es166.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es166.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.es167.js

@@ -1,10 +1,31 @@
-function u(n, a, r) {
-  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
-  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
-    e[f] = n;
-  return e;
+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 {
-  u 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.es167.js.map

package/dist/index.es167.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es167.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es167.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.es168.js

@@ -1,12 +1,58 @@
-import { slice as n } from "./index.es6.js";
-function h(r, l) {
-  if (l == null || l < 1)
-    return [];
-  for (var t = [], e = 0, i = r.length; e < i; )
-    t.push(n.call(r, e, e += l));
-  return t;
+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 _(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 {
-  h as default
+  z as default
 };
 //# sourceMappingURL=index.es168.js.map

package/dist/index.es168.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es168.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es168.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]}