@performant-software/shared-components 3.1.3 → 3.1.4-beta.0

package/dist/index.es211.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es211.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.es211.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,MAAAA,IAAeC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAChD,EAAIC,EAAIH,GAAQE,CAAG,MAAUA,CAAG,MAAUF,EAAOE,CAAG,IAAI;AAC1D,CAAC;","x_google_ignoreList":[0]}

package/dist/index.es212.js

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

package/dist/index.es212.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es212.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":";AAIA,SAAwBA,EAAMC,GAAOC,GAAGC,GAAO;AAC7C,SAAIF,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.es212.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,MAAAA,IAAeC,EAAM,SAASC,GAAQC,GAAOC,GAAM;AACjD,EAAAF,EAAOE,IAAO,IAAI,CAAC,EAAE,KAAKD,CAAK;AACjC,GAAG,EAAI;","x_google_ignoreList":[0]}

package/dist/index.es213.js

@@ -1,8 +1,15 @@
-import { slice as e } from "./index.es40.js";
-function a(l, t, i) {
-  return e.call(l, 0, Math.max(0, l.length - (t == null || i ? 1 : t)));
+import f from "./index.es141.js";
+import { slice as t } from "./index.es40.js";
+import i from "./index.es133.js";
+import m from "./index.es293.js";
+import u from "./index.es194.js";
+import e from "./index.es164.js";
+import o from "./index.es151.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) : [];
 }
 export {
-  a as default
+  A as default
 };
 //# sourceMappingURL=index.es213.js.map

package/dist/index.es213.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es213.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":";AAKA,SAAwBA,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.es213.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,CAAA;AAQnB;","x_google_ignoreList":[0]}

package/dist/index.es214.js

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

package/dist/index.es214.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es214.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":";AAIA,SAAwBA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAIF,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.es214.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.es215.js

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

package/dist/index.es215.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es215.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":";AAKA,SAAwBA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAOC,EAAM,KAAKH,GAAOC,KAAK,QAAQC,IAAQ,IAAID,CAAC;AACrD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es215.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":";AAIA,SAAwBA,EAAMC,GAAOC,GAAGC,GAAO;AAC7C,SAAIF,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.es216.js

@@ -1,8 +1,8 @@
-import t from "./index.es194.js";
-function e(o) {
-  return t(o, Boolean);
+import { slice as e } from "./index.es40.js";
+function a(l, t, i) {
+  return e.call(l, 0, Math.max(0, l.length - (t == null || i ? 1 : t)));
 }
 export {
-  e as default
+  a as default
 };
 //# sourceMappingURL=index.es216.js.map

package/dist/index.es216.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es216.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;AACrC,SAAOC,EAAOD,GAAO,OAAO;AAC9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es216.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":";AAKA,SAAwBA,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.es217.js

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

package/dist/index.es217.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es217.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":";AAIA,SAAwBA,EAAQC,GAAOC,GAAO;AAC5C,SAAOC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es217.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":";AAIA,SAAwBA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAIF,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.es218.js

@@ -1,16 +1,8 @@
-import b from "./index.es128.js";
-import q from "./index.es283.js";
-import B from "./index.es274.js";
-import r from "./index.es198.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 { slice as e } from "./index.es40.js";
+function u(r, l, t) {
+  return e.call(r, l == null || t ? 1 : l);
 }
 export {
-  w as default
+  u as default
 };
 //# sourceMappingURL=index.es218.js.map

package/dist/index.es218.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es218.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;AAC/D,EAAKC,EAAUH,CAAQ,MACrBE,IAAUD,GACVA,IAAWD,GACXA,IAAW,KAETC,KAAY,SAAMA,IAAWG,EAAGH,GAAUC,CAAO;AAGrD,WAFIG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AACtD,IAAIV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GAC9CJ,IAAOK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es218.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":";AAKA,SAAwBA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAOC,EAAM,KAAKH,GAAOC,KAAK,QAAQC,IAAQ,IAAID,CAAC;AACrD;","x_google_ignoreList":[0]}

package/dist/index.es219.js

@@ -1,18 +1,8 @@
-import u from "./index.es274.js";
-import f from "./index.es198.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;
+import t from "./index.es197.js";
+function e(o) {
+  return t(o, Boolean);
 }
 export {
-  v as default
+  e as default
 };
 //# sourceMappingURL=index.es219.js.map

package/dist/index.es219.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es219.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;AAG1C,WAFIC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAON,EAAMG,CAAC;AAClB,QAAI,CAAAI,EAASN,GAAQK,CAAI,GACzB;AAAA,UAAIE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es219.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;AACrC,SAAOC,EAAOD,GAAO,OAAO;AAC9B;","x_google_ignoreList":[0]}

package/dist/index.es220.js

@@ -1,10 +1,6 @@
-import f from "./index.es201.js";
-import p from "./index.es274.js";
-import u from "./index.es199.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 f from "./index.es290.js";
+function n(t, e) {
+  return f(t, e, !1);
 }
 export {
   n as default

package/dist/index.es220.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es220.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;AAEpC,SAAOD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es220.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":";AAIA,SAAwBA,EAAQC,GAAOC,GAAO;AAC5C,SAAOC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}

package/dist/index.es221.js

@@ -1,10 +1,16 @@
-import n from "./index.es274.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 b from "./index.es131.js";
+import q from "./index.es283.js";
+import B from "./index.es274.js";
+import r from "./index.es201.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.es221.js.map

package/dist/index.es221.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es221.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":";AAKA,SAAwBA,EAAOC,GAAMC,GAAQ;AAE3C,WADIC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAE1BD,EAAOF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAGlC,SAAOD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es221.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;AAC/D,EAAKC,EAAUH,CAAQ,MACrBE,IAAUD,GACVA,IAAWD,GACXA,IAAW,KAETC,KAAY,SAAMA,IAAWG,EAAGH,GAAUC,CAAO;AAGrD,WAFIG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AACtD,IAAIV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GAC9CJ,IAAOK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es222.js

@@ -1,10 +1,18 @@
-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;
+import u from "./index.es274.js";
+import f from "./index.es201.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 {
-  u as default
+  v as default
 };
 //# sourceMappingURL=index.es222.js.map

package/dist/index.es222.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es222.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":"AAGA,SAAwBA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GAChBA,IAAQ,IAELE,MACHA,IAAOD,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;AAGf,SAAOD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es222.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;AAG1C,WAFIC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAON,EAAMG,CAAC;AAClB,QAAI,CAAAI,EAASN,GAAQK,CAAI,GACzB;AAAA,UAAIE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es223.js

@@ -1,11 +1,12 @@
-import { slice as n } from "./index.es40.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 f from "./index.es204.js";
+import p from "./index.es274.js";
+import u from "./index.es202.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 {
-  h as default
+  n as default
 };
 //# sourceMappingURL=index.es223.js.map

package/dist/index.es223.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es223.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":";AAIA,SAAwBA,EAAMC,GAAOC,GAAO;AAC1C,MAAIA,KAAS,QAAQA,IAAQ,UAAU,CAAA;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAE9C,SAAOC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es223.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;AAEpC,SAAOD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es224.js

@@ -1,223 +1,10 @@
-import E from "./index.es225.js";
-const { toString: R } = Object.prototype, { getPrototypeOf: h } = Object, { iterator: m, toStringTag: x } = Symbol, w = /* @__PURE__ */ ((e) => (t) => {
-  const r = R.call(t);
-  return e[r] || (e[r] = r.slice(8, -1).toLowerCase());
-})(/* @__PURE__ */ Object.create(null)), l = (e) => (e = e.toLowerCase(), (t) => w(t) === e), g = (e) => (t) => typeof t === e, { isArray: u } = Array, p = g("undefined");
-function T(e) {
-  return e !== null && !p(e) && e.constructor !== null && !p(e.constructor) && i(e.constructor.isBuffer) && e.constructor.isBuffer(e);
+import n from "./index.es274.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;
 }
-const S = l("ArrayBuffer");
-function M(e) {
-  let t;
-  return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? t = ArrayBuffer.isView(e) : t = e && e.buffer && S(e.buffer), t;
-}
-const N = g("string"), i = g("function"), B = g("number"), F = (e) => e !== null && typeof e == "object", k = (e) => e === !0 || e === !1, y = (e) => {
-  if (w(e) !== "object")
-    return !1;
-  const t = h(e);
-  return (t === null || t === Object.prototype || Object.getPrototypeOf(t) === null) && !(x in e) && !(m in e);
-}, I = l("Date"), U = l("File"), V = l("Blob"), _ = l("FileList"), q = (e) => F(e) && i(e.pipe), H = (e) => {
-  let t;
-  return e && (typeof FormData == "function" && e instanceof FormData || i(e.append) && ((t = w(e)) === "formdata" || // detect form-data instance
-  t === "object" && i(e.toString) && e.toString() === "[object FormData]"));
-}, z = l("URLSearchParams"), [J, K, $, W] = ["ReadableStream", "Request", "Response", "Headers"].map(l), G = (e) => e.trim ? e.trim() : e.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
-function d(e, t, { allOwnKeys: r = !1 } = {}) {
-  if (e === null || typeof e > "u")
-    return;
-  let n, s;
-  if (typeof e != "object" && (e = [e]), u(e))
-    for (n = 0, s = e.length; n < s; n++)
-      t.call(null, e[n], n, e);
-  else {
-    const o = r ? Object.getOwnPropertyNames(e) : Object.keys(e), c = o.length;
-    let f;
-    for (n = 0; n < c; n++)
-      f = o[n], t.call(null, e[f], f, e);
-  }
-}
-function P(e, t) {
-  t = t.toLowerCase();
-  const r = Object.keys(e);
-  let n = r.length, s;
-  for (; n-- > 0; )
-    if (s = r[n], t === s.toLowerCase())
-      return s;
-  return null;
-}
-const a = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global, L = (e) => !p(e) && e !== a;
-function O() {
-  const { caseless: e } = L(this) && this || {}, t = {}, r = (n, s) => {
-    const o = e && P(t, s) || s;
-    y(t[o]) && y(n) ? t[o] = O(t[o], n) : y(n) ? t[o] = O({}, n) : u(n) ? t[o] = n.slice() : t[o] = n;
-  };
-  for (let n = 0, s = arguments.length; n < s; n++)
-    arguments[n] && d(arguments[n], r);
-  return t;
-}
-const Q = (e, t, r, { allOwnKeys: n } = {}) => (d(t, (s, o) => {
-  r && i(s) ? e[o] = E(s, r) : e[o] = s;
-}, { allOwnKeys: n }), e), X = (e) => (e.charCodeAt(0) === 65279 && (e = e.slice(1)), e), Y = (e, t, r, n) => {
-  e.prototype = Object.create(t.prototype, n), e.prototype.constructor = e, Object.defineProperty(e, "super", {
-    value: t.prototype
-  }), r && Object.assign(e.prototype, r);
-}, Z = (e, t, r, n) => {
-  let s, o, c;
-  const f = {};
-  if (t = t || {}, e == null) return t;
-  do {
-    for (s = Object.getOwnPropertyNames(e), o = s.length; o-- > 0; )
-      c = s[o], (!n || n(c, e, t)) && !f[c] && (t[c] = e[c], f[c] = !0);
-    e = r !== !1 && h(e);
-  } while (e && (!r || r(e, t)) && e !== Object.prototype);
-  return t;
-}, j = (e, t, r) => {
-  e = String(e), (r === void 0 || r > e.length) && (r = e.length), r -= t.length;
-  const n = e.indexOf(t, r);
-  return n !== -1 && n === r;
-}, v = (e) => {
-  if (!e) return null;
-  if (u(e)) return e;
-  let t = e.length;
-  if (!B(t)) return null;
-  const r = new Array(t);
-  for (; t-- > 0; )
-    r[t] = e[t];
-  return r;
-}, ee = /* @__PURE__ */ ((e) => (t) => e && t instanceof e)(typeof Uint8Array < "u" && h(Uint8Array)), te = (e, t) => {
-  const n = (e && e[m]).call(e);
-  let s;
-  for (; (s = n.next()) && !s.done; ) {
-    const o = s.value;
-    t.call(e, o[0], o[1]);
-  }
-}, ne = (e, t) => {
-  let r;
-  const n = [];
-  for (; (r = e.exec(t)) !== null; )
-    n.push(r);
-  return n;
-}, re = l("HTMLFormElement"), se = (e) => e.toLowerCase().replace(
-  /[-_\s]([a-z\d])(\w*)/g,
-  function(r, n, s) {
-    return n.toUpperCase() + s;
-  }
-), b = (({ hasOwnProperty: e }) => (t, r) => e.call(t, r))(Object.prototype), oe = l("RegExp"), C = (e, t) => {
-  const r = Object.getOwnPropertyDescriptors(e), n = {};
-  d(r, (s, o) => {
-    let c;
-    (c = t(s, o, e)) !== !1 && (n[o] = c || s);
-  }), Object.defineProperties(e, n);
-}, ie = (e) => {
-  C(e, (t, r) => {
-    if (i(e) && ["arguments", "caller", "callee"].indexOf(r) !== -1)
-      return !1;
-    const n = e[r];
-    if (i(n)) {
-      if (t.enumerable = !1, "writable" in t) {
-        t.writable = !1;
-        return;
-      }
-      t.set || (t.set = () => {
-        throw Error("Can not rewrite read-only method '" + r + "'");
-      });
-    }
-  });
-}, ce = (e, t) => {
-  const r = {}, n = (s) => {
-    s.forEach((o) => {
-      r[o] = !0;
-    });
-  };
-  return u(e) ? n(e) : n(String(e).split(t)), r;
-}, le = () => {
-}, fe = (e, t) => e != null && Number.isFinite(e = +e) ? e : t;
-function ae(e) {
-  return !!(e && i(e.append) && e[x] === "FormData" && e[m]);
-}
-const ue = (e) => {
-  const t = new Array(10), r = (n, s) => {
-    if (F(n)) {
-      if (t.indexOf(n) >= 0)
-        return;
-      if (!("toJSON" in n)) {
-        t[s] = n;
-        const o = u(n) ? [] : {};
-        return d(n, (c, f) => {
-          const A = r(c, s + 1);
-          !p(A) && (o[f] = A);
-        }), t[s] = void 0, o;
-      }
-    }
-    return n;
-  };
-  return r(e, 0);
-}, pe = l("AsyncFunction"), de = (e) => e && (F(e) || i(e)) && i(e.then) && i(e.catch), D = ((e, t) => e ? setImmediate : t ? ((r, n) => (a.addEventListener("message", ({ source: s, data: o }) => {
-  s === a && o === r && n.length && n.shift()();
-}, !1), (s) => {
-  n.push(s), a.postMessage(r, "*");
-}))(`axios@${Math.random()}`, []) : (r) => setTimeout(r))(
-  typeof setImmediate == "function",
-  i(a.postMessage)
-), ye = typeof queueMicrotask < "u" ? queueMicrotask.bind(a) : typeof process < "u" && process.nextTick || D, me = (e) => e != null && i(e[m]), ge = {
-  isArray: u,
-  isArrayBuffer: S,
-  isBuffer: T,
-  isFormData: H,
-  isArrayBufferView: M,
-  isString: N,
-  isNumber: B,
-  isBoolean: k,
-  isObject: F,
-  isPlainObject: y,
-  isReadableStream: J,
-  isRequest: K,
-  isResponse: $,
-  isHeaders: W,
-  isUndefined: p,
-  isDate: I,
-  isFile: U,
-  isBlob: V,
-  isRegExp: oe,
-  isFunction: i,
-  isStream: q,
-  isURLSearchParams: z,
-  isTypedArray: ee,
-  isFileList: _,
-  forEach: d,
-  merge: O,
-  extend: Q,
-  trim: G,
-  stripBOM: X,
-  inherits: Y,
-  toFlatObject: Z,
-  kindOf: w,
-  kindOfTest: l,
-  endsWith: j,
-  toArray: v,
-  forEachEntry: te,
-  matchAll: ne,
-  isHTMLForm: re,
-  hasOwnProperty: b,
-  hasOwnProp: b,
-  // an alias to avoid ESLint no-prototype-builtins detection
-  reduceDescriptors: C,
-  freezeMethods: ie,
-  toObjectSet: ce,
-  toCamelCase: se,
-  noop: le,
-  toFiniteNumber: fe,
-  findKey: P,
-  global: a,
-  isContextDefined: L,
-  isSpecCompliantForm: ae,
-  toJSONObject: ue,
-  isAsyncFn: pe,
-  isThenable: de,
-  setImmediate: D,
-  asap: ye,
-  isIterable: me
-};
 export {
-  ge as default
+  u as default
 };
 //# sourceMappingURL=index.es224.js.map