@performant-software/shared-components 3.1.13-beta.2 → 3.1.13-beta.3

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

@@ -1,12 +1,16 @@
-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 b from "./index.es130.js";
+import q from "./index.es283.js";
+import B from "./index.es274.js";
+import r from "./index.es200.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 {
-  n as default
+  w as default
 };
 //# sourceMappingURL=index.es220.js.map

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/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.es221.js

@@ -1,10 +1,18 @@
-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 u from "./index.es274.js";
+import f from "./index.es200.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.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/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.es222.js

@@ -1,10 +1,12 @@
-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 f from "./index.es203.js";
+import p from "./index.es274.js";
+import u from "./index.es201.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 {
-  u as default
+  n 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/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.es223.js

@@ -1,11 +1,10 @@
-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 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;
 }
 export {
-  h as default
+  u 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/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]}

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);
+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;
 }
-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

package/dist/index.es224.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es224.js","sources":["../../../node_modules/axios/lib/utils.js"],"sourcesContent":["'use strict';\n\nimport bind from './helpers/bind.js';\n\n// utils is a library of generic helper functions non-specific to axios\n\nconst {toString} = Object.prototype;\nconst {getPrototypeOf} = Object;\nconst {iterator, toStringTag} = Symbol;\n\nconst kindOf = (cache => thing => {\n    const str = toString.call(thing);\n    return cache[str] || (cache[str] = str.slice(8, -1).toLowerCase());\n})(Object.create(null));\n\nconst kindOfTest = (type) => {\n  type = type.toLowerCase();\n  return (thing) => kindOf(thing) === type\n}\n\nconst typeOfTest = type => thing => typeof thing === type;\n\n/**\n * Determine if a value is an Array\n *\n * @param {Object} val The value to test\n *\n * @returns {boolean} True if value is an Array, otherwise false\n */\nconst {isArray} = Array;\n\n/**\n * Determine if a value is undefined\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if the value is undefined, otherwise false\n */\nconst isUndefined = typeOfTest('undefined');\n\n/**\n * Determine if a value is a Buffer\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a Buffer, otherwise false\n */\nfunction isBuffer(val) {\n  return val !== null && !isUndefined(val) && val.constructor !== null && !isUndefined(val.constructor)\n    && isFunction(val.constructor.isBuffer) && val.constructor.isBuffer(val);\n}\n\n/**\n * Determine if a value is an ArrayBuffer\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is an ArrayBuffer, otherwise false\n */\nconst isArrayBuffer = kindOfTest('ArrayBuffer');\n\n\n/**\n * Determine if a value is a view on an ArrayBuffer\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a view on an ArrayBuffer, otherwise false\n */\nfunction isArrayBufferView(val) {\n  let result;\n  if ((typeof ArrayBuffer !== 'undefined') && (ArrayBuffer.isView)) {\n    result = ArrayBuffer.isView(val);\n  } else {\n    result = (val) && (val.buffer) && (isArrayBuffer(val.buffer));\n  }\n  return result;\n}\n\n/**\n * Determine if a value is a String\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a String, otherwise false\n */\nconst isString = typeOfTest('string');\n\n/**\n * Determine if a value is a Function\n *\n * @param {*} val The value to test\n * @returns {boolean} True if value is a Function, otherwise false\n */\nconst isFunction = typeOfTest('function');\n\n/**\n * Determine if a value is a Number\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a Number, otherwise false\n */\nconst isNumber = typeOfTest('number');\n\n/**\n * Determine if a value is an Object\n *\n * @param {*} thing The value to test\n *\n * @returns {boolean} True if value is an Object, otherwise false\n */\nconst isObject = (thing) => thing !== null && typeof thing === 'object';\n\n/**\n * Determine if a value is a Boolean\n *\n * @param {*} thing The value to test\n * @returns {boolean} True if value is a Boolean, otherwise false\n */\nconst isBoolean = thing => thing === true || thing === false;\n\n/**\n * Determine if a value is a plain Object\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a plain Object, otherwise false\n */\nconst isPlainObject = (val) => {\n  if (kindOf(val) !== 'object') {\n    return false;\n  }\n\n  const prototype = getPrototypeOf(val);\n  return (prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null) && !(toStringTag in val) && !(iterator in val);\n}\n\n/**\n * Determine if a value is a Date\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a Date, otherwise false\n */\nconst isDate = kindOfTest('Date');\n\n/**\n * Determine if a value is a File\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a File, otherwise false\n */\nconst isFile = kindOfTest('File');\n\n/**\n * Determine if a value is a Blob\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a Blob, otherwise false\n */\nconst isBlob = kindOfTest('Blob');\n\n/**\n * Determine if a value is a FileList\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a File, otherwise false\n */\nconst isFileList = kindOfTest('FileList');\n\n/**\n * Determine if a value is a Stream\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a Stream, otherwise false\n */\nconst isStream = (val) => isObject(val) && isFunction(val.pipe);\n\n/**\n * Determine if a value is a FormData\n *\n * @param {*} thing The value to test\n *\n * @returns {boolean} True if value is an FormData, otherwise false\n */\nconst isFormData = (thing) => {\n  let kind;\n  return thing && (\n    (typeof FormData === 'function' && thing instanceof FormData) || (\n      isFunction(thing.append) && (\n        (kind = kindOf(thing)) === 'formdata' ||\n        // detect form-data instance\n        (kind === 'object' && isFunction(thing.toString) && thing.toString() === '[object FormData]')\n      )\n    )\n  )\n}\n\n/**\n * Determine if a value is a URLSearchParams object\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a URLSearchParams object, otherwise false\n */\nconst isURLSearchParams = kindOfTest('URLSearchParams');\n\nconst [isReadableStream, isRequest, isResponse, isHeaders] = ['ReadableStream', 'Request', 'Response', 'Headers'].map(kindOfTest);\n\n/**\n * Trim excess whitespace off the beginning and end of a string\n *\n * @param {String} str The String to trim\n *\n * @returns {String} The String freed of excess whitespace\n */\nconst trim = (str) => str.trim ?\n  str.trim() : str.replace(/^[\\s\\uFEFF\\xA0]+|[\\s\\uFEFF\\xA0]+$/g, '');\n\n/**\n * Iterate over an Array or an Object invoking a function for each item.\n *\n * If `obj` is an Array callback will be called passing\n * the value, index, and complete array for each item.\n *\n * If 'obj' is an Object callback will be called passing\n * the value, key, and complete object for each property.\n *\n * @param {Object|Array} obj The object to iterate\n * @param {Function} fn The callback to invoke for each item\n *\n * @param {Boolean} [allOwnKeys = false]\n * @returns {any}\n */\nfunction forEach(obj, fn, {allOwnKeys = false} = {}) {\n  // Don't bother if no value provided\n  if (obj === null || typeof obj === 'undefined') {\n    return;\n  }\n\n  let i;\n  let l;\n\n  // Force an array if not already something iterable\n  if (typeof obj !== 'object') {\n    /*eslint no-param-reassign:0*/\n    obj = [obj];\n  }\n\n  if (isArray(obj)) {\n    // Iterate over array values\n    for (i = 0, l = obj.length; i < l; i++) {\n      fn.call(null, obj[i], i, obj);\n    }\n  } else {\n    // Iterate over object keys\n    const keys = allOwnKeys ? Object.getOwnPropertyNames(obj) : Object.keys(obj);\n    const len = keys.length;\n    let key;\n\n    for (i = 0; i < len; i++) {\n      key = keys[i];\n      fn.call(null, obj[key], key, obj);\n    }\n  }\n}\n\nfunction findKey(obj, key) {\n  key = key.toLowerCase();\n  const keys = Object.keys(obj);\n  let i = keys.length;\n  let _key;\n  while (i-- > 0) {\n    _key = keys[i];\n    if (key === _key.toLowerCase()) {\n      return _key;\n    }\n  }\n  return null;\n}\n\nconst _global = (() => {\n  /*eslint no-undef:0*/\n  if (typeof globalThis !== \"undefined\") return globalThis;\n  return typeof self !== \"undefined\" ? self : (typeof window !== 'undefined' ? window : global)\n})();\n\nconst isContextDefined = (context) => !isUndefined(context) && context !== _global;\n\n/**\n * Accepts varargs expecting each argument to be an object, then\n * immutably merges the properties of each object and returns result.\n *\n * When multiple objects contain the same key the later object in\n * the arguments list will take precedence.\n *\n * Example:\n *\n * ```js\n * var result = merge({foo: 123}, {foo: 456});\n * console.log(result.foo); // outputs 456\n * ```\n *\n * @param {Object} obj1 Object to merge\n *\n * @returns {Object} Result of all merge properties\n */\nfunction merge(/* obj1, obj2, obj3, ... */) {\n  const {caseless} = isContextDefined(this) && this || {};\n  const result = {};\n  const assignValue = (val, key) => {\n    const targetKey = caseless && findKey(result, key) || key;\n    if (isPlainObject(result[targetKey]) && isPlainObject(val)) {\n      result[targetKey] = merge(result[targetKey], val);\n    } else if (isPlainObject(val)) {\n      result[targetKey] = merge({}, val);\n    } else if (isArray(val)) {\n      result[targetKey] = val.slice();\n    } else {\n      result[targetKey] = val;\n    }\n  }\n\n  for (let i = 0, l = arguments.length; i < l; i++) {\n    arguments[i] && forEach(arguments[i], assignValue);\n  }\n  return result;\n}\n\n/**\n * Extends object a by mutably adding to it the properties of object b.\n *\n * @param {Object} a The object to be extended\n * @param {Object} b The object to copy properties from\n * @param {Object} thisArg The object to bind function to\n *\n * @param {Boolean} [allOwnKeys]\n * @returns {Object} The resulting value of object a\n */\nconst extend = (a, b, thisArg, {allOwnKeys}= {}) => {\n  forEach(b, (val, key) => {\n    if (thisArg && isFunction(val)) {\n      a[key] = bind(val, thisArg);\n    } else {\n      a[key] = val;\n    }\n  }, {allOwnKeys});\n  return a;\n}\n\n/**\n * Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)\n *\n * @param {string} content with BOM\n *\n * @returns {string} content value without BOM\n */\nconst stripBOM = (content) => {\n  if (content.charCodeAt(0) === 0xFEFF) {\n    content = content.slice(1);\n  }\n  return content;\n}\n\n/**\n * Inherit the prototype methods from one constructor into another\n * @param {function} constructor\n * @param {function} superConstructor\n * @param {object} [props]\n * @param {object} [descriptors]\n *\n * @returns {void}\n */\nconst inherits = (constructor, superConstructor, props, descriptors) => {\n  constructor.prototype = Object.create(superConstructor.prototype, descriptors);\n  constructor.prototype.constructor = constructor;\n  Object.defineProperty(constructor, 'super', {\n    value: superConstructor.prototype\n  });\n  props && Object.assign(constructor.prototype, props);\n}\n\n/**\n * Resolve object with deep prototype chain to a flat object\n * @param {Object} sourceObj source object\n * @param {Object} [destObj]\n * @param {Function|Boolean} [filter]\n * @param {Function} [propFilter]\n *\n * @returns {Object}\n */\nconst toFlatObject = (sourceObj, destObj, filter, propFilter) => {\n  let props;\n  let i;\n  let prop;\n  const merged = {};\n\n  destObj = destObj || {};\n  // eslint-disable-next-line no-eq-null,eqeqeq\n  if (sourceObj == null) return destObj;\n\n  do {\n    props = Object.getOwnPropertyNames(sourceObj);\n    i = props.length;\n    while (i-- > 0) {\n      prop = props[i];\n      if ((!propFilter || propFilter(prop, sourceObj, destObj)) && !merged[prop]) {\n        destObj[prop] = sourceObj[prop];\n        merged[prop] = true;\n      }\n    }\n    sourceObj = filter !== false && getPrototypeOf(sourceObj);\n  } while (sourceObj && (!filter || filter(sourceObj, destObj)) && sourceObj !== Object.prototype);\n\n  return destObj;\n}\n\n/**\n * Determines whether a string ends with the characters of a specified string\n *\n * @param {String} str\n * @param {String} searchString\n * @param {Number} [position= 0]\n *\n * @returns {boolean}\n */\nconst endsWith = (str, searchString, position) => {\n  str = String(str);\n  if (position === undefined || position > str.length) {\n    position = str.length;\n  }\n  position -= searchString.length;\n  const lastIndex = str.indexOf(searchString, position);\n  return lastIndex !== -1 && lastIndex === position;\n}\n\n\n/**\n * Returns new array from array like object or null if failed\n *\n * @param {*} [thing]\n *\n * @returns {?Array}\n */\nconst toArray = (thing) => {\n  if (!thing) return null;\n  if (isArray(thing)) return thing;\n  let i = thing.length;\n  if (!isNumber(i)) return null;\n  const arr = new Array(i);\n  while (i-- > 0) {\n    arr[i] = thing[i];\n  }\n  return arr;\n}\n\n/**\n * Checking if the Uint8Array exists and if it does, it returns a function that checks if the\n * thing passed in is an instance of Uint8Array\n *\n * @param {TypedArray}\n *\n * @returns {Array}\n */\n// eslint-disable-next-line func-names\nconst isTypedArray = (TypedArray => {\n  // eslint-disable-next-line func-names\n  return thing => {\n    return TypedArray && thing instanceof TypedArray;\n  };\n})(typeof Uint8Array !== 'undefined' && getPrototypeOf(Uint8Array));\n\n/**\n * For each entry in the object, call the function with the key and value.\n *\n * @param {Object<any, any>} obj - The object to iterate over.\n * @param {Function} fn - The function to call for each entry.\n *\n * @returns {void}\n */\nconst forEachEntry = (obj, fn) => {\n  const generator = obj && obj[iterator];\n\n  const _iterator = generator.call(obj);\n\n  let result;\n\n  while ((result = _iterator.next()) && !result.done) {\n    const pair = result.value;\n    fn.call(obj, pair[0], pair[1]);\n  }\n}\n\n/**\n * It takes a regular expression and a string, and returns an array of all the matches\n *\n * @param {string} regExp - The regular expression to match against.\n * @param {string} str - The string to search.\n *\n * @returns {Array<boolean>}\n */\nconst matchAll = (regExp, str) => {\n  let matches;\n  const arr = [];\n\n  while ((matches = regExp.exec(str)) !== null) {\n    arr.push(matches);\n  }\n\n  return arr;\n}\n\n/* Checking if the kindOfTest function returns true when passed an HTMLFormElement. */\nconst isHTMLForm = kindOfTest('HTMLFormElement');\n\nconst toCamelCase = str => {\n  return str.toLowerCase().replace(/[-_\\s]([a-z\\d])(\\w*)/g,\n    function replacer(m, p1, p2) {\n      return p1.toUpperCase() + p2;\n    }\n  );\n};\n\n/* Creating a function that will check if an object has a property. */\nconst hasOwnProperty = (({hasOwnProperty}) => (obj, prop) => hasOwnProperty.call(obj, prop))(Object.prototype);\n\n/**\n * Determine if a value is a RegExp object\n *\n * @param {*} val The value to test\n *\n * @returns {boolean} True if value is a RegExp object, otherwise false\n */\nconst isRegExp = kindOfTest('RegExp');\n\nconst reduceDescriptors = (obj, reducer) => {\n  const descriptors = Object.getOwnPropertyDescriptors(obj);\n  const reducedDescriptors = {};\n\n  forEach(descriptors, (descriptor, name) => {\n    let ret;\n    if ((ret = reducer(descriptor, name, obj)) !== false) {\n      reducedDescriptors[name] = ret || descriptor;\n    }\n  });\n\n  Object.defineProperties(obj, reducedDescriptors);\n}\n\n/**\n * Makes all methods read-only\n * @param {Object} obj\n */\n\nconst freezeMethods = (obj) => {\n  reduceDescriptors(obj, (descriptor, name) => {\n    // skip restricted props in strict mode\n    if (isFunction(obj) && ['arguments', 'caller', 'callee'].indexOf(name) !== -1) {\n      return false;\n    }\n\n    const value = obj[name];\n\n    if (!isFunction(value)) return;\n\n    descriptor.enumerable = false;\n\n    if ('writable' in descriptor) {\n      descriptor.writable = false;\n      return;\n    }\n\n    if (!descriptor.set) {\n      descriptor.set = () => {\n        throw Error('Can not rewrite read-only method \\'' + name + '\\'');\n      };\n    }\n  });\n}\n\nconst toObjectSet = (arrayOrString, delimiter) => {\n  const obj = {};\n\n  const define = (arr) => {\n    arr.forEach(value => {\n      obj[value] = true;\n    });\n  }\n\n  isArray(arrayOrString) ? define(arrayOrString) : define(String(arrayOrString).split(delimiter));\n\n  return obj;\n}\n\nconst noop = () => {}\n\nconst toFiniteNumber = (value, defaultValue) => {\n  return value != null && Number.isFinite(value = +value) ? value : defaultValue;\n}\n\n/**\n * If the thing is a FormData object, return true, otherwise return false.\n *\n * @param {unknown} thing - The thing to check.\n *\n * @returns {boolean}\n */\nfunction isSpecCompliantForm(thing) {\n  return !!(thing && isFunction(thing.append) && thing[toStringTag] === 'FormData' && thing[iterator]);\n}\n\nconst toJSONObject = (obj) => {\n  const stack = new Array(10);\n\n  const visit = (source, i) => {\n\n    if (isObject(source)) {\n      if (stack.indexOf(source) >= 0) {\n        return;\n      }\n\n      if(!('toJSON' in source)) {\n        stack[i] = source;\n        const target = isArray(source) ? [] : {};\n\n        forEach(source, (value, key) => {\n          const reducedValue = visit(value, i + 1);\n          !isUndefined(reducedValue) && (target[key] = reducedValue);\n        });\n\n        stack[i] = undefined;\n\n        return target;\n      }\n    }\n\n    return source;\n  }\n\n  return visit(obj, 0);\n}\n\nconst isAsyncFn = kindOfTest('AsyncFunction');\n\nconst isThenable = (thing) =>\n  thing && (isObject(thing) || isFunction(thing)) && isFunction(thing.then) && isFunction(thing.catch);\n\n// original code\n// https://github.com/DigitalBrainJS/AxiosPromise/blob/16deab13710ec09779922131f3fa5954320f83ab/lib/utils.js#L11-L34\n\nconst _setImmediate = ((setImmediateSupported, postMessageSupported) => {\n  if (setImmediateSupported) {\n    return setImmediate;\n  }\n\n  return postMessageSupported ? ((token, callbacks) => {\n    _global.addEventListener(\"message\", ({source, data}) => {\n      if (source === _global && data === token) {\n        callbacks.length && callbacks.shift()();\n      }\n    }, false);\n\n    return (cb) => {\n      callbacks.push(cb);\n      _global.postMessage(token, \"*\");\n    }\n  })(`axios@${Math.random()}`, []) : (cb) => setTimeout(cb);\n})(\n  typeof setImmediate === 'function',\n  isFunction(_global.postMessage)\n);\n\nconst asap = typeof queueMicrotask !== 'undefined' ?\n  queueMicrotask.bind(_global) : ( typeof process !== 'undefined' && process.nextTick || _setImmediate);\n\n// *********************\n\n\nconst isIterable = (thing) => thing != null && isFunction(thing[iterator]);\n\n\nexport default {\n  isArray,\n  isArrayBuffer,\n  isBuffer,\n  isFormData,\n  isArrayBufferView,\n  isString,\n  isNumber,\n  isBoolean,\n  isObject,\n  isPlainObject,\n  isReadableStream,\n  isRequest,\n  isResponse,\n  isHeaders,\n  isUndefined,\n  isDate,\n  isFile,\n  isBlob,\n  isRegExp,\n  isFunction,\n  isStream,\n  isURLSearchParams,\n  isTypedArray,\n  isFileList,\n  forEach,\n  merge,\n  extend,\n  trim,\n  stripBOM,\n  inherits,\n  toFlatObject,\n  kindOf,\n  kindOfTest,\n  endsWith,\n  toArray,\n  forEachEntry,\n  matchAll,\n  isHTMLForm,\n  hasOwnProperty,\n  hasOwnProp: hasOwnProperty, // an alias to avoid ESLint no-prototype-builtins detection\n  reduceDescriptors,\n  freezeMethods,\n  toObjectSet,\n  toCamelCase,\n  noop,\n  toFiniteNumber,\n  findKey,\n  global: _global,\n  isContextDefined,\n  isSpecCompliantForm,\n  toJSONObject,\n  isAsyncFn,\n  isThenable,\n  setImmediate: _setImmediate,\n  asap,\n  isIterable\n};\n"],"names":["toString","getPrototypeOf","iterator","toStringTag","kindOf","thing","str","cache","kindOfTest","type","typeOfTest","isArray","isUndefined","isBuffer","val","isFunction","isArrayBuffer","isArrayBufferView","result","isString","isNumber","isObject","isBoolean","isPlainObject","prototype","isDate","isFile","isBlob","isFileList","isStream","isFormData","kind","isURLSearchParams","isReadableStream","isRequest","isResponse","isHeaders","trim","forEach","obj","fn","allOwnKeys","i","l","keys","len","key","findKey","_key","_global","isContextDefined","context","merge","caseless","assignValue","targetKey","extend","a","b","thisArg","bind","stripBOM","content","inherits","constructor","superConstructor","props","descriptors","toFlatObject","sourceObj","destObj","filter","propFilter","prop","merged","endsWith","searchString","position","lastIndex","toArray","arr","isTypedArray","TypedArray","forEachEntry","_iterator","pair","matchAll","regExp","matches","isHTMLForm","toCamelCase","m","p1","p2","hasOwnProperty","isRegExp","reduceDescriptors","reducer","reducedDescriptors","descriptor","name","ret","freezeMethods","value","toObjectSet","arrayOrString","delimiter","define","noop","toFiniteNumber","defaultValue","isSpecCompliantForm","toJSONObject","stack","visit","source","target","reducedValue","isAsyncFn","isThenable","_setImmediate","setImmediateSupported","postMessageSupported","token","callbacks","data","cb","asap","isIterable","utils"],"mappings":";AAMA,MAAM,EAAC,UAAAA,EAAA,IAAY,OAAO,WACpB,EAAC,gBAAAC,MAAkB,QACnB,EAAC,UAAAC,GAAU,aAAAC,EAAA,IAAe,QAE1BC,4BAAmB,CAAAC,MAAS;AAC9B,QAAMC,IAAMN,EAAS,KAAKK,CAAK;AAC/B,SAAOE,EAAMD,CAAG,MAAMC,EAAMD,CAAG,IAAIA,EAAI,MAAM,GAAG,EAAE,EAAE,YAAA;AACxD,GAAG,uBAAO,OAAO,IAAI,CAAC,GAEhBE,IAAa,CAACC,OAClBA,IAAOA,EAAK,YAAA,GACL,CAACJ,MAAUD,EAAOC,CAAK,MAAMI,IAGhCC,IAAa,CAAAD,MAAQ,CAAAJ,MAAS,OAAOA,MAAUI,GAS/C,EAAC,SAAAE,MAAW,OASZC,IAAcF,EAAW,WAAW;AAS1C,SAASG,EAASC,GAAK;AACrB,SAAOA,MAAQ,QAAQ,CAACF,EAAYE,CAAG,KAAKA,EAAI,gBAAgB,QAAQ,CAACF,EAAYE,EAAI,WAAW,KAC/FC,EAAWD,EAAI,YAAY,QAAQ,KAAKA,EAAI,YAAY,SAASA,CAAG;AAC3E;AASA,MAAME,IAAgBR,EAAW,aAAa;AAU9C,SAASS,EAAkBH,GAAK;AAC9B,MAAII;AACJ,SAAK,OAAO,cAAgB,OAAiB,YAAY,SACvDA,IAAS,YAAY,OAAOJ,CAAG,IAE/BI,IAAUJ,KAASA,EAAI,UAAYE,EAAcF,EAAI,MAAM,GAEtDI;AACT;AASA,MAAMC,IAAWT,EAAW,QAAQ,GAQ9BK,IAAaL,EAAW,UAAU,GASlCU,IAAWV,EAAW,QAAQ,GAS9BW,IAAW,CAAChB,MAAUA,MAAU,QAAQ,OAAOA,KAAU,UAQzDiB,IAAY,CAAAjB,MAASA,MAAU,MAAQA,MAAU,IASjDkB,IAAgB,CAACT,MAAQ;AAC7B,MAAIV,EAAOU,CAAG,MAAM;AAClB,WAAO;AAGT,QAAMU,IAAYvB,EAAea,CAAG;AACpC,UAAQU,MAAc,QAAQA,MAAc,OAAO,aAAa,OAAO,eAAeA,CAAS,MAAM,SAAS,EAAErB,KAAeW,MAAQ,EAAEZ,KAAYY;AACvJ,GASMW,IAASjB,EAAW,MAAM,GAS1BkB,IAASlB,EAAW,MAAM,GAS1BmB,IAASnB,EAAW,MAAM,GAS1BoB,IAAapB,EAAW,UAAU,GASlCqB,IAAW,CAACf,MAAQO,EAASP,CAAG,KAAKC,EAAWD,EAAI,IAAI,GASxDgB,IAAa,CAACzB,MAAU;AAC5B,MAAI0B;AACJ,SAAO1B,MACJ,OAAO,YAAa,cAAcA,aAAiB,YAClDU,EAAWV,EAAM,MAAM,OACpB0B,IAAO3B,EAAOC,CAAK,OAAO;AAAA,EAE1B0B,MAAS,YAAYhB,EAAWV,EAAM,QAAQ,KAAKA,EAAM,eAAe;AAIjF,GASM2B,IAAoBxB,EAAW,iBAAiB,GAEhD,CAACyB,GAAkBC,GAAWC,GAAYC,CAAS,IAAI,CAAC,kBAAkB,WAAW,YAAY,SAAS,EAAE,IAAI5B,CAAU,GAS1H6B,IAAO,CAAC/B,MAAQA,EAAI,OACxBA,EAAI,KAAA,IAASA,EAAI,QAAQ,sCAAsC,EAAE;AAiBnE,SAASgC,EAAQC,GAAKC,GAAI,EAAC,YAAAC,IAAa,GAAA,IAAS,IAAI;AAEnD,MAAIF,MAAQ,QAAQ,OAAOA,IAAQ;AACjC;AAGF,MAAIG,GACAC;AAQJ,MALI,OAAOJ,KAAQ,aAEjBA,IAAM,CAACA,CAAG,IAGR5B,EAAQ4B,CAAG;AAEb,SAAKG,IAAI,GAAGC,IAAIJ,EAAI,QAAQG,IAAIC,GAAGD;AACjC,MAAAF,EAAG,KAAK,MAAMD,EAAIG,CAAC,GAAGA,GAAGH,CAAG;AAAA,OAEzB;AAEL,UAAMK,IAAOH,IAAa,OAAO,oBAAoBF,CAAG,IAAI,OAAO,KAAKA,CAAG,GACrEM,IAAMD,EAAK;AACjB,QAAIE;AAEJ,SAAKJ,IAAI,GAAGA,IAAIG,GAAKH;AACnB,MAAAI,IAAMF,EAAKF,CAAC,GACZF,EAAG,KAAK,MAAMD,EAAIO,CAAG,GAAGA,GAAKP,CAAG;AAAA,EAEpC;AACF;AAEA,SAASQ,EAAQR,GAAKO,GAAK;AACzB,EAAAA,IAAMA,EAAI,YAAA;AACV,QAAMF,IAAO,OAAO,KAAKL,CAAG;AAC5B,MAAIG,IAAIE,EAAK,QACTI;AACJ,SAAON,MAAM;AAEX,QADAM,IAAOJ,EAAKF,CAAC,GACTI,MAAQE,EAAK;AACf,aAAOA;AAGX,SAAO;AACT;AAEA,MAAMC,IAEA,OAAO,aAAe,MAAoB,aACvC,OAAO,OAAS,MAAc,OAAQ,OAAO,SAAW,MAAc,SAAS,QAGlFC,IAAmB,CAACC,MAAY,CAACvC,EAAYuC,CAAO,KAAKA,MAAYF;AAoB3E,SAASG,IAAmC;AAC1C,QAAM,EAAC,UAAAC,EAAA,IAAYH,EAAiB,IAAI,KAAK,QAAQ,CAAA,GAC/ChC,IAAS,CAAA,GACToC,IAAc,CAACxC,GAAKgC,MAAQ;AAChC,UAAMS,IAAYF,KAAYN,EAAQ7B,GAAQ4B,CAAG,KAAKA;AACtD,IAAIvB,EAAcL,EAAOqC,CAAS,CAAC,KAAKhC,EAAcT,CAAG,IACvDI,EAAOqC,CAAS,IAAIH,EAAMlC,EAAOqC,CAAS,GAAGzC,CAAG,IACvCS,EAAcT,CAAG,IAC1BI,EAAOqC,CAAS,IAAIH,EAAM,CAAA,GAAItC,CAAG,IACxBH,EAAQG,CAAG,IACpBI,EAAOqC,CAAS,IAAIzC,EAAI,MAAA,IAExBI,EAAOqC,CAAS,IAAIzC;AAAA,EAExB;AAEA,WAAS4B,IAAI,GAAGC,IAAI,UAAU,QAAQD,IAAIC,GAAGD;AAC3C,cAAUA,CAAC,KAAKJ,EAAQ,UAAUI,CAAC,GAAGY,CAAW;AAEnD,SAAOpC;AACT;AAYA,MAAMsC,IAAS,CAACC,GAAGC,GAAGC,GAAS,EAAC,YAAAlB,EAAA,IAAa,QAC3CH,EAAQoB,GAAG,CAAC5C,GAAKgC,MAAQ;AACvB,EAAIa,KAAW5C,EAAWD,CAAG,IAC3B2C,EAAEX,CAAG,IAAIc,EAAK9C,GAAK6C,CAAO,IAE1BF,EAAEX,CAAG,IAAIhC;AAEb,GAAG,EAAC,YAAA2B,GAAW,GACRgB,IAUHI,IAAW,CAACC,OACZA,EAAQ,WAAW,CAAC,MAAM,UAC5BA,IAAUA,EAAQ,MAAM,CAAC,IAEpBA,IAYHC,IAAW,CAACC,GAAaC,GAAkBC,GAAOC,MAAgB;AACtE,EAAAH,EAAY,YAAY,OAAO,OAAOC,EAAiB,WAAWE,CAAW,GAC7EH,EAAY,UAAU,cAAcA,GACpC,OAAO,eAAeA,GAAa,SAAS;AAAA,IAC1C,OAAOC,EAAiB;AAAA,EAAA,CACzB,GACDC,KAAS,OAAO,OAAOF,EAAY,WAAWE,CAAK;AACrD,GAWME,IAAe,CAACC,GAAWC,GAASC,GAAQC,MAAe;AAC/D,MAAIN,GACAxB,GACA+B;AACJ,QAAMC,IAAS,CAAA;AAIf,MAFAJ,IAAUA,KAAW,CAAA,GAEjBD,KAAa,KAAM,QAAOC;AAE9B,KAAG;AAGD,SAFAJ,IAAQ,OAAO,oBAAoBG,CAAS,GAC5C3B,IAAIwB,EAAM,QACHxB,MAAM;AACX,MAAA+B,IAAOP,EAAMxB,CAAC,IACT,CAAC8B,KAAcA,EAAWC,GAAMJ,GAAWC,CAAO,MAAM,CAACI,EAAOD,CAAI,MACvEH,EAAQG,CAAI,IAAIJ,EAAUI,CAAI,GAC9BC,EAAOD,CAAI,IAAI;AAGnB,IAAAJ,IAAYE,MAAW,MAAStE,EAAeoE,CAAS;AAAA,EAC1D,SAASA,MAAc,CAACE,KAAUA,EAAOF,GAAWC,CAAO,MAAMD,MAAc,OAAO;AAEtF,SAAOC;AACT,GAWMK,IAAW,CAACrE,GAAKsE,GAAcC,MAAa;AAChD,EAAAvE,IAAM,OAAOA,CAAG,IACZuE,MAAa,UAAaA,IAAWvE,EAAI,YAC3CuE,IAAWvE,EAAI,SAEjBuE,KAAYD,EAAa;AACzB,QAAME,IAAYxE,EAAI,QAAQsE,GAAcC,CAAQ;AACpD,SAAOC,MAAc,MAAMA,MAAcD;AAC3C,GAUME,IAAU,CAAC1E,MAAU;AACzB,MAAI,CAACA,EAAO,QAAO;AACnB,MAAIM,EAAQN,CAAK,EAAG,QAAOA;AAC3B,MAAIqC,IAAIrC,EAAM;AACd,MAAI,CAACe,EAASsB,CAAC,EAAG,QAAO;AACzB,QAAMsC,IAAM,IAAI,MAAMtC,CAAC;AACvB,SAAOA,MAAM;AACX,IAAAsC,EAAItC,CAAC,IAAIrC,EAAMqC,CAAC;AAElB,SAAOsC;AACT,GAWMC,KAAgB,kBAAAC,MAEb,CAAA7E,MACE6E,KAAc7E,aAAiB6E,GAEvC,OAAO,aAAe,OAAejF,EAAe,UAAU,CAAC,GAU5DkF,KAAe,CAAC5C,GAAKC,MAAO;AAGhC,QAAM4C,KAFY7C,KAAOA,EAAIrC,CAAQ,GAET,KAAKqC,CAAG;AAEpC,MAAIrB;AAEJ,UAAQA,IAASkE,EAAU,KAAA,MAAW,CAAClE,EAAO,QAAM;AAClD,UAAMmE,IAAOnE,EAAO;AACpB,IAAAsB,EAAG,KAAKD,GAAK8C,EAAK,CAAC,GAAGA,EAAK,CAAC,CAAC;AAAA,EAC/B;AACF,GAUMC,KAAW,CAACC,GAAQjF,MAAQ;AAChC,MAAIkF;AACJ,QAAMR,IAAM,CAAA;AAEZ,UAAQQ,IAAUD,EAAO,KAAKjF,CAAG,OAAO;AACtC,IAAA0E,EAAI,KAAKQ,CAAO;AAGlB,SAAOR;AACT,GAGMS,KAAajF,EAAW,iBAAiB,GAEzCkF,KAAc,CAAApF,MACXA,EAAI,cAAc;AAAA,EAAQ;AAAA,EAC/B,SAAkBqF,GAAGC,GAAIC,GAAI;AAC3B,WAAOD,EAAG,gBAAgBC;AAAA,EAC5B;AAAA,GAKEC,KAAkB,CAAC,EAAC,gBAAAA,QAAoB,CAACvD,GAAKkC,MAASqB,EAAe,KAAKvD,GAAKkC,CAAI,GAAG,OAAO,SAAS,GASvGsB,KAAWvF,EAAW,QAAQ,GAE9BwF,IAAoB,CAACzD,GAAK0D,MAAY;AAC1C,QAAM9B,IAAc,OAAO,0BAA0B5B,CAAG,GAClD2D,IAAqB,CAAA;AAE3B,EAAA5D,EAAQ6B,GAAa,CAACgC,GAAYC,MAAS;AACzC,QAAIC;AACJ,KAAKA,IAAMJ,EAAQE,GAAYC,GAAM7D,CAAG,OAAO,OAC7C2D,EAAmBE,CAAI,IAAIC,KAAOF;AAAA,EAEtC,CAAC,GAED,OAAO,iBAAiB5D,GAAK2D,CAAkB;AACjD,GAOMI,KAAgB,CAAC/D,MAAQ;AAC7B,EAAAyD,EAAkBzD,GAAK,CAAC4D,GAAYC,MAAS;AAE3C,QAAIrF,EAAWwB,CAAG,KAAK,CAAC,aAAa,UAAU,QAAQ,EAAE,QAAQ6D,CAAI,MAAM;AACzE,aAAO;AAGT,UAAMG,IAAQhE,EAAI6D,CAAI;AAEtB,QAAKrF,EAAWwF,CAAK,GAIrB;AAAA,UAFAJ,EAAW,aAAa,IAEpB,cAAcA,GAAY;AAC5B,QAAAA,EAAW,WAAW;AACtB;AAAA,MACF;AAEA,MAAKA,EAAW,QACdA,EAAW,MAAM,MAAM;AACrB,cAAM,MAAM,uCAAwCC,IAAO,GAAI;AAAA,MACjE;AAAA;AAAA,EAEJ,CAAC;AACH,GAEMI,KAAc,CAACC,GAAeC,MAAc;AAChD,QAAMnE,IAAM,CAAA,GAENoE,IAAS,CAAC3B,MAAQ;AACtB,IAAAA,EAAI,QAAQ,CAAAuB,MAAS;AACnB,MAAAhE,EAAIgE,CAAK,IAAI;AAAA,IACf,CAAC;AAAA,EACH;AAEA,SAAA5F,EAAQ8F,CAAa,IAAIE,EAAOF,CAAa,IAAIE,EAAO,OAAOF,CAAa,EAAE,MAAMC,CAAS,CAAC,GAEvFnE;AACT,GAEMqE,KAAO,MAAM;AAAC,GAEdC,KAAiB,CAACN,GAAOO,MACtBP,KAAS,QAAQ,OAAO,SAASA,IAAQ,CAACA,CAAK,IAAIA,IAAQO;AAUpE,SAASC,GAAoB1G,GAAO;AAClC,SAAO,CAAC,EAAEA,KAASU,EAAWV,EAAM,MAAM,KAAKA,EAAMF,CAAW,MAAM,cAAcE,EAAMH,CAAQ;AACpG;AAEA,MAAM8G,KAAe,CAACzE,MAAQ;AAC5B,QAAM0E,IAAQ,IAAI,MAAM,EAAE,GAEpBC,IAAQ,CAACC,GAAQzE,MAAM;AAE3B,QAAIrB,EAAS8F,CAAM,GAAG;AACpB,UAAIF,EAAM,QAAQE,CAAM,KAAK;AAC3B;AAGF,UAAG,EAAE,YAAYA,IAAS;AACxB,QAAAF,EAAMvE,CAAC,IAAIyE;AACX,cAAMC,IAASzG,EAAQwG,CAAM,IAAI,CAAA,IAAK,CAAA;AAEtC,eAAA7E,EAAQ6E,GAAQ,CAACZ,GAAOzD,MAAQ;AAC9B,gBAAMuE,IAAeH,EAAMX,GAAO7D,IAAI,CAAC;AACvC,WAAC9B,EAAYyG,CAAY,MAAMD,EAAOtE,CAAG,IAAIuE;AAAA,QAC/C,CAAC,GAEDJ,EAAMvE,CAAC,IAAI,QAEJ0E;AAAA,MACT;AAAA,IACF;AAEA,WAAOD;AAAA,EACT;AAEA,SAAOD,EAAM3E,GAAK,CAAC;AACrB,GAEM+E,KAAY9G,EAAW,eAAe,GAEtC+G,KAAa,CAAClH,MAClBA,MAAUgB,EAAShB,CAAK,KAAKU,EAAWV,CAAK,MAAMU,EAAWV,EAAM,IAAI,KAAKU,EAAWV,EAAM,KAAK,GAK/FmH,KAAiB,CAACC,GAAuBC,MACzCD,IACK,eAGFC,KAAwB,CAACC,GAAOC,OACrC3E,EAAQ,iBAAiB,WAAW,CAAC,EAAC,QAAAkE,GAAQ,MAAAU,QAAU;AACtD,EAAIV,MAAWlE,KAAW4E,MAASF,KACjCC,EAAU,UAAUA,EAAU,QAAM;AAExC,GAAG,EAAK,GAED,CAACE,MAAO;AACb,EAAAF,EAAU,KAAKE,CAAE,GACjB7E,EAAQ,YAAY0E,GAAO,GAAG;AAChC,IACC,SAAS,KAAK,OAAA,CAAQ,IAAI,CAAA,CAAE,IAAI,CAACG,MAAO,WAAWA,CAAE;AAAA,EAExD,OAAO,gBAAiB;AAAA,EACxB/G,EAAWkC,EAAQ,WAAW;AAChC,GAEM8E,KAAO,OAAO,iBAAmB,MACrC,eAAe,KAAK9E,CAAO,IAAM,OAAO,UAAY,OAAe,QAAQ,YAAYuE,GAKnFQ,KAAa,CAAC3H,MAAUA,KAAS,QAAQU,EAAWV,EAAMH,CAAQ,CAAC,GAGzE+H,KAAe;AAAA,EACb,SAAAtH;AAAA,EACA,eAAAK;AAAA,EACA,UAAAH;AAAA,EACA,YAAAiB;AAAA,EACA,mBAAAb;AAAA,EACA,UAAAE;AAAA,EACA,UAAAC;AAAA,EACA,WAAAE;AAAA,EACA,UAAAD;AAAA,EACA,eAAAE;AAAA,EACA,kBAAAU;AAAA,EACA,WAAAC;AAAA,EACA,YAAAC;AAAA,EACA,WAAAC;AAAA,EACA,aAAAxB;AAAA,EACA,QAAAa;AAAA,EACA,QAAAC;AAAA,EACA,QAAAC;AAAA,EACA,UAAAoE;AAAA,EACA,YAAAhF;AAAA,EACA,UAAAc;AAAA,EACA,mBAAAG;AAAA,EACA,cAAAiD;AAAA,EACA,YAAArD;AAAA,EACA,SAAAU;AAAA,EACA,OAAAc;AAAA,EACA,QAAAI;AAAA,EACA,MAAAnB;AAAA,EACA,UAAAwB;AAAA,EACA,UAAAE;AAAA,EACA,cAAAK;AAAA,EACA,QAAAhE;AAAA,EACA,YAAAI;AAAA,EACA,UAAAmE;AAAA,EACA,SAAAI;AAAA,EACA,cAAAI;AAAA,EACA,UAAAG;AAAA,EACA,YAAAG;AAAA,EACA,gBAAAK;AAAA,EACA,YAAYA;AAAA;AAAA,EACZ,mBAAAE;AAAA,EACA,eAAAM;AAAA,EACA,aAAAE;AAAA,EACA,aAAAd;AAAA,EACA,MAAAkB;AAAA,EACA,gBAAAC;AAAA,EACA,SAAA9D;AAAA,EACA,QAAQE;AAAA,EACR,kBAAAC;AAAA,EACA,qBAAA6D;AAAA,EACA,cAAAC;AAAA,EACA,WAAAM;AAAA,EACA,YAAAC;AAAA,EACA,cAAcC;AAAA,EACd,MAAAO;AAAA,EACA,YAAAC;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es224.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]}

package/dist/index.es225.js

@@ -1,9 +1,11 @@
-function u(n, r) {
-  return function() {
-    return n.apply(r, arguments);
-  };
+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;
 }
 export {
-  u as default
+  h as default
 };
 //# sourceMappingURL=index.es225.js.map

package/dist/index.es225.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es225.js","sources":["../../../node_modules/axios/lib/helpers/bind.js"],"sourcesContent":["'use strict';\n\nexport default function bind(fn, thisArg) {\n  return function wrap() {\n    return fn.apply(thisArg, arguments);\n  };\n}\n"],"names":["bind","fn","thisArg"],"mappings":"AAEA,SAAwBA,EAAKC,GAAIC,GAAS;AACxC,SAAO,WAAgB;AACrB,WAAOD,EAAG,MAAMC,GAAS,SAAS;AAAA,EACpC;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es225.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]}