@performant-software/core-data 2.1.0-beta.28 → 2.1.0-beta.29

package/dist/index.es255.js

@@ -1,20 +1,9 @@
-import s from "./index.es361.js";
-import v from "./index.es199.js";
-import u from "./index.es342.js";
-import o from "./index.es219.js";
-import h from "./index.es261.js";
-function M(r, a, e) {
-  if (a == null || e)
-    return s(r) || (r = v(r)), r[o(r.length - 1)];
-  var t = h(r), f = u(t);
-  a = Math.max(Math.min(a, f), 0);
-  for (var i = f - 1, m = 0; m < a; m++) {
-    var l = o(m, i), p = t[m];
-    t[m] = t[l], t[l] = p;
-  }
-  return t.slice(0, a);
-}
+import t from "./index.es363.js";
+import a from "./index.es340.js";
+const p = t(function(o, i, f) {
+  a(o, f) ? o[f]++ : o[f] = 1;
+});
 export {
-  M as default
+  p as default
 };
 //# sourceMappingURL=index.es255.js.map

package/dist/index.es255.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es255.js","sources":["../../../node_modules/underscore/modules/sample.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport getLength from './_getLength.js';\nimport random from './random.js';\nimport toArray from './toArray.js';\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `_.map`.\nexport default function sample(obj, n, guard) {\n  if (n == null || guard) {\n    if (!isArrayLike(obj)) obj = values(obj);\n    return obj[random(obj.length - 1)];\n  }\n  var sample = toArray(obj);\n  var length = getLength(sample);\n  n = Math.max(Math.min(n, length), 0);\n  var last = length - 1;\n  for (var index = 0; index < n; index++) {\n    var rand = random(index, last);\n    var temp = sample[index];\n    sample[index] = sample[rand];\n    sample[rand] = temp;\n  }\n  return sample.slice(0, n);\n}\n"],"names":["sample","obj","n","guard","isArrayLike","values","random","toArray","length","getLength","last","index","rand","temp"],"mappings":";;;;;AAUwB,SAAAA,EAAOC,GAAKC,GAAGC,GAAO;AACxC,MAAAD,KAAK,QAAQC;AACX,WAACC,EAAYH,CAAG,MAAGA,IAAMI,EAAOJ,CAAG,IAChCA,EAAIK,EAAOL,EAAI,SAAS,CAAC,CAAC;AAE/BD,MAAAA,IAASO,EAAQN,CAAG,GACpBO,IAASC,EAAUT,CAAM;AAC7B,EAAAE,IAAI,KAAK,IAAI,KAAK,IAAIA,GAAGM,CAAM,GAAG,CAAC;AAEnC,WADIE,IAAOF,IAAS,GACXG,IAAQ,GAAGA,IAAQT,GAAGS,KAAS;AAClC,QAAAC,IAAON,EAAOK,GAAOD,CAAI,GACzBG,IAAOb,EAAOW,CAAK;AACvBX,IAAAA,EAAOW,CAAK,IAAIX,EAAOY,CAAI,GAC3BZ,EAAOY,CAAI,IAAIC;AAAA,EACjB;AACOb,SAAAA,EAAO,MAAM,GAAGE,CAAC;AAC1B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es255.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]}

package/dist/index.es256.js

@@ -1,26 +1,8 @@
-import c from "./index.es351.js";
-import d from "./index.es250.js";
-import e from "./index.es242.js";
-function x(u, t, f) {
-  var a = 0;
-  return t = c(t, f), d(e(u, function(i, n, r) {
-    return {
-      value: i,
-      index: a++,
-      criteria: t(i, n, r)
-    };
-  }).sort(function(i, n) {
-    var r = i.criteria, o = n.criteria;
-    if (r !== o) {
-      if (r > o || r === void 0)
-        return 1;
-      if (r < o || o === void 0)
-        return -1;
-    }
-    return i.index - n.index;
-  }), "value");
-}
+import p from "./index.es363.js";
+const i = p(function(t, o, r) {
+  t[r ? 0 : 1].push(o);
+}, !0);
 export {
-  x as default
+  i as default
 };
 //# sourceMappingURL=index.es256.js.map

package/dist/index.es256.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es256.js","sources":["../../../node_modules/underscore/modules/sortBy.js"],"sourcesContent":["import cb from './_cb.js';\nimport pluck from './pluck.js';\nimport map from './map.js';\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport default function sortBy(obj, iteratee, context) {\n  var index = 0;\n  iteratee = cb(iteratee, context);\n  return pluck(map(obj, function(value, key, list) {\n    return {\n      value: value,\n      index: index++,\n      criteria: iteratee(value, key, list)\n    };\n  }).sort(function(left, right) {\n    var a = left.criteria;\n    var b = right.criteria;\n    if (a !== b) {\n      if (a > b || a === void 0) return 1;\n      if (a < b || b === void 0) return -1;\n    }\n    return left.index - right.index;\n  }), 'value');\n}\n"],"names":["sortBy","obj","iteratee","context","index","cb","pluck","map","value","key","list","left","right","a","b"],"mappings":";;;AAKwB,SAAAA,EAAOC,GAAKC,GAAUC,GAAS;AACrD,MAAIC,IAAQ;AACD,SAAAF,IAAAG,EAAGH,GAAUC,CAAO,GACxBG,EAAMC,EAAIN,GAAK,SAASO,GAAOC,GAAKC,GAAM;AACxC,WAAA;AAAA,MACL,OAAAF;AAAA,MACA,OAAOJ;AAAA,MACP,UAAUF,EAASM,GAAOC,GAAKC,CAAI;AAAA,IAAA;AAAA,EAEtC,CAAA,EAAE,KAAK,SAASC,GAAMC,GAAO;AAC5B,QAAIC,IAAIF,EAAK,UACTG,IAAIF,EAAM;AACd,QAAIC,MAAMC,GAAG;AACP,UAAAD,IAAIC,KAAKD,MAAM;AAAe,eAAA;AAC9B,UAAAA,IAAIC,KAAKA,MAAM;AAAe,eAAA;AAAA,IACpC;AACO,WAAAH,EAAK,QAAQC,EAAM;AAAA,EAAA,CAC3B,GAAG,OAAO;AACb;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es256.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]}

package/dist/index.es257.js

@@ -1,9 +1,15 @@
-import r from "./index.es363.js";
-import i from "./index.es340.js";
-const n = r(function(o, f, p) {
-  i(o, p) ? o[p].push(f) : o[p] = [f];
-});
+import f from "./index.es185.js";
+import { slice as t } from "./index.es34.js";
+import i from "./index.es177.js";
+import m from "./index.es361.js";
+import u from "./index.es238.js";
+import e from "./index.es208.js";
+import o from "./index.es195.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 {
-  n as default
+  A as default
 };
 //# sourceMappingURL=index.es257.js.map

package/dist/index.es257.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es257.js","sources":["../../../node_modules/underscore/modules/groupBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Groups the object's values by a criterion. Pass either a string attribute\n// to group by, or a function that returns the criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key].push(value); else result[key] = [value];\n});\n"],"names":["groupBy","group","result","value","key","has"],"mappings":";;AAKA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAC5C,EAAAC,EAAIH,GAAQE,CAAG,IAAUF,EAAAE,CAAG,EAAE,KAAKD,CAAK,IAAeD,EAAAE,CAAG,IAAI,CAACD,CAAK;AAC1E,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es257.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]}

package/dist/index.es258.js

@@ -1,7 +1,8 @@
-import r from "./index.es363.js";
-const f = r(function(o, t, n) {
-  o[n] = t;
-});
+import e from "./index.es361.js";
+import t from "./index.es193.js";
+function f(r) {
+  return r == null ? 0 : e(r) ? r.length : t(r).length;
+}
 export {
   f as default
 };

package/dist/index.es258.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es258.js","sources":["../../../node_modules/underscore/modules/indexBy.js"],"sourcesContent":["import group from './_group.js';\n\n// Indexes the object's values by a criterion, similar to `_.groupBy`, but for\n// when you know that your index values will be unique.\nexport default group(function(result, value, key) {\n  result[key] = value;\n});\n"],"names":["indexBy","group","result","value","key"],"mappings":";AAIA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAChD,EAAAF,EAAOE,CAAG,IAAID;AAChB,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es258.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.es259.js

@@ -1,9 +1,8 @@
-import t from "./index.es363.js";
-import a from "./index.es340.js";
-const p = t(function(o, i, f) {
-  a(o, f) ? o[f]++ : o[f] = 1;
-});
+import n from "./index.es260.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 {
-  p as default
+  u as default
 };
 //# sourceMappingURL=index.es259.js.map

package/dist/index.es259.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es259.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.es259.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.es26.js

@@ -1,21 +1,24 @@
 import { dequal as C } from "./index.es87.js";
-import { useState as S, useRef as d, useCallback as f, useEffect as b } from "react";
-import n from "./index.es30.js";
-const k = (r) => {
-  const [l, h] = S(n.createCachedHits([])), a = d(), s = d([]), m = f((e) => {
-    s.current = [...s.current, e];
-  }, []), g = f((e) => {
-    s.current = s.current.filter((t) => t !== e);
-  }, []), i = (e, t, c) => (c && e && delete e.page, c && t && delete t.page, !C(e, t));
-  return b(() => {
-    const { results: e } = r, t = e.page === 0, c = e.page + 1 >= e.nbPages, o = n.normalizeResults(e.hits);
-    t && i(e._state, a.current, !0) ? h(() => n.createCachedHits(o)) : h(({ merge: u }) => u(o)), !c && r.showMore ? setTimeout(() => r.showMore(), 25) : i(e._state, a.current) && s.current.forEach((u) => {
-      const p = l.merge(o);
-      u(p.hits);
-    }), a.current = e._state;
-  }, [r.results]), { cachedHits: l.hits, observe: m, unobserve: g };
+import { useState as S, useRef as i, useCallback as d, useEffect as m } from "react";
+import a from "./index.es30.js";
+const R = (r) => {
+  const [o, l] = S(a.createCachedHits([])), u = i(), c = i([]), f = d((e) => {
+    c.current = [...c.current, e];
+  }, []), g = d((e) => {
+    c.current = c.current.filter((t) => t !== e);
+  }, []), h = (e, t, s) => (s && e && delete e.page, s && t && delete t.page, !C(e, t));
+  return m(() => {
+    const { results: e } = r, t = e.page === 0, s = a.normalizeResults(e.hits);
+    t && h(e._state, u.current, !0) ? l(() => a.createCachedHits(s)) : l(({ merge: n }) => n(s));
+  }, [r.results]), m(() => {
+    const { results: e } = r, t = a.normalizeResults(e.hits);
+    !(e.page + 1 >= e.nbPages) && r.showMore ? setTimeout(() => r.showMore(), 25) : h(e._state, u.current) && c.current.forEach((n) => {
+      const p = o.merge(t);
+      n(p.hits);
+    }), u.current = e._state;
+  }, [o]), { cachedHits: o.hits, observe: f, unobserve: g };
 };
 export {
-  k as default
+  R as default
 };
 //# sourceMappingURL=index.es26.js.map

package/dist/index.es26.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es26.js","sources":["../src/hooks/ProgressiveSearch.js"],"sourcesContent":["// @flow\n\nimport { dequal } from 'dequal/lite';\nimport {\n  useCallback,\n  useEffect,\n  useRef,\n  useState\n} from 'react';\nimport type { SearchResult } from '../types/typesense/SearchResult';\nimport TypesenseUtils from '../utils/Typesense';\n\ntype OnCompleteCallback = (results: Array<SearchResult>) => void;\n\nconst useProgressiveSearch = (infiniteHits) => {\n  const [cachedHits, setCachedHits] = useState(TypesenseUtils.createCachedHits([]));\n\n  const lastSearchState = useRef<any>();\n  const callbacks = useRef<Array<OnCompleteCallback>>([]);\n\n  /**\n   * Adds the passed callback to the list of callbacks.\n   *\n   * @type {(function(OnCompleteCallback): void)|*}\n   */\n  const observe = useCallback((callback: OnCompleteCallback) => {\n    callbacks.current = [...callbacks.current, callback];\n  }, []);\n\n  /**\n   * Removes the passed callback from the list of callbacks.\n   *\n   * @type {(function(OnCompleteCallback): void)|*}\n   */\n  const unobserve = useCallback((callback: OnCompleteCallback) => {\n    callbacks.current = callbacks.current.filter((c) => c !== callback);\n  }, []);\n\n  /**\n   * Returns true if the state has changed.\n   *\n   * @param a\n   * @param b\n   * @param ignorePageNo\n   *\n   * @returns {boolean}\n   */\n  const hasStateChanged = (a: any, b: any, ignorePageNo?: boolean) => {\n    if (ignorePageNo && a) {\n      // eslint-disable-next-line no-param-reassign\n      delete a.page;\n    }\n\n    if (ignorePageNo && b) {\n      // eslint-disable-next-line no-param-reassign\n      delete b.page;\n    }\n\n    return !dequal(a, b);\n  };\n\n  useEffect(() => {\n    const { results } = infiniteHits;\n\n    const isFirstPage = results.page === 0;\n    const isLastPage = results.page + 1 >= results.nbPages;\n\n    const hits = TypesenseUtils.normalizeResults(results.hits);\n\n    // Add to cache and load next page\n    if (isFirstPage && hasStateChanged(results._state, lastSearchState.current, true)) {\n      setCachedHits(() => TypesenseUtils.createCachedHits(hits));\n    } else {\n      setCachedHits(({ merge }) => merge(hits));\n    }\n\n    if (!isLastPage && infiniteHits.showMore) {\n      setTimeout(() => infiniteHits.showMore(), 25);\n    } else if (hasStateChanged(results._state, lastSearchState.current)) {\n      callbacks.current.forEach((callback) => {\n        const merged = cachedHits.merge(hits);\n        callback(merged.hits);\n      });\n    }\n\n    lastSearchState.current = results._state;\n  }, [infiniteHits.results]);\n\n  return { cachedHits: cachedHits.hits, observe, unobserve };\n};\n\nexport default useProgressiveSearch;\n"],"names":["useProgressiveSearch","infiniteHits","cachedHits","setCachedHits","useState","TypesenseUtils","lastSearchState","useRef","callbacks","observe","useCallback","callback","unobserve","c","hasStateChanged","a","b","ignorePageNo","dequal","useEffect","results","isFirstPage","isLastPage","hits","merge","merged"],"mappings":";;;AAcM,MAAAA,IAAuB,CAACC,MAAiB;AACvC,QAAA,CAACC,GAAYC,CAAa,IAAIC,EAASC,EAAe,iBAAiB,CAAE,CAAA,CAAC,GAE1EC,IAAkBC,KAClBC,IAAYD,EAAkC,CAAA,CAAE,GAOhDE,IAAUC,EAAY,CAACC,MAAiC;AAC5D,IAAAH,EAAU,UAAU,CAAC,GAAGA,EAAU,SAASG,CAAQ;AAAA,EACrD,GAAG,CAAE,CAAA,GAOCC,IAAYF,EAAY,CAACC,MAAiC;AAC9D,IAAAH,EAAU,UAAUA,EAAU,QAAQ,OAAO,CAACK,MAAMA,MAAMF,CAAQ;AAAA,EACpE,GAAG,CAAE,CAAA,GAWCG,IAAkB,CAACC,GAAQC,GAAQC,OACnCA,KAAgBF,KAElB,OAAOA,EAAE,MAGPE,KAAgBD,KAElB,OAAOA,EAAE,MAGJ,CAACE,EAAOH,GAAGC,CAAC;AAGrB,SAAAG,EAAU,MAAM;AACR,UAAA,EAAE,SAAAC,EAAY,IAAAnB,GAEdoB,IAAcD,EAAQ,SAAS,GAC/BE,IAAaF,EAAQ,OAAO,KAAKA,EAAQ,SAEzCG,IAAOlB,EAAe,iBAAiBe,EAAQ,IAAI;AAGzD,IAAIC,KAAeP,EAAgBM,EAAQ,QAAQd,EAAgB,SAAS,EAAI,IAC9EH,EAAc,MAAME,EAAe,iBAAiBkB,CAAI,CAAC,IAEzDpB,EAAc,CAAC,EAAE,OAAAqB,EAAA,MAAYA,EAAMD,CAAI,CAAC,GAGtC,CAACD,KAAcrB,EAAa,WAC9B,WAAW,MAAMA,EAAa,SAAS,GAAG,EAAE,IACnCa,EAAgBM,EAAQ,QAAQd,EAAgB,OAAO,KACtDE,EAAA,QAAQ,QAAQ,CAACG,MAAa;AAChC,YAAAc,IAASvB,EAAW,MAAMqB,CAAI;AACpC,MAAAZ,EAASc,EAAO,IAAI;AAAA,IAAA,CACrB,GAGHnB,EAAgB,UAAUc,EAAQ;AAAA,EAAA,GACjC,CAACnB,EAAa,OAAO,CAAC,GAElB,EAAE,YAAYC,EAAW,MAAM,SAAAO,GAAS,WAAAG,EAAU;AAC3D;"}
+{"version":3,"file":"index.es26.js","sources":["../src/hooks/ProgressiveSearch.js"],"sourcesContent":["// @flow\n\nimport { dequal } from 'dequal/lite';\nimport {\n  useCallback,\n  useEffect,\n  useRef,\n  useState\n} from 'react';\nimport type { SearchResult } from '../types/typesense/SearchResult';\nimport TypesenseUtils from '../utils/Typesense';\n\ntype OnCompleteCallback = (results: Array<SearchResult>) => void;\n\nconst useProgressiveSearch = (infiniteHits) => {\n  const [cachedHits, setCachedHits] = useState(TypesenseUtils.createCachedHits([]));\n\n  const lastSearchState = useRef<any>();\n  const callbacks = useRef<Array<OnCompleteCallback>>([]);\n\n  /**\n   * Adds the passed callback to the list of callbacks.\n   *\n   * @type {(function(OnCompleteCallback): void)|*}\n   */\n  const observe = useCallback((callback: OnCompleteCallback) => {\n    callbacks.current = [...callbacks.current, callback];\n  }, []);\n\n  /**\n   * Removes the passed callback from the list of callbacks.\n   *\n   * @type {(function(OnCompleteCallback): void)|*}\n   */\n  const unobserve = useCallback((callback: OnCompleteCallback) => {\n    callbacks.current = callbacks.current.filter((c) => c !== callback);\n  }, []);\n\n  /**\n   * Returns true if the state has changed.\n   *\n   * @param a\n   * @param b\n   * @param ignorePageNo\n   *\n   * @returns {boolean}\n   */\n  const hasStateChanged = (a: any, b: any, ignorePageNo?: boolean) => {\n    if (ignorePageNo && a) {\n      // eslint-disable-next-line no-param-reassign\n      delete a.page;\n    }\n\n    if (ignorePageNo && b) {\n      // eslint-disable-next-line no-param-reassign\n      delete b.page;\n    }\n\n    return !dequal(a, b);\n  };\n\n  useEffect(() => {\n    const { results } = infiniteHits;\n\n    const isFirstPage = results.page === 0;\n    const hits = TypesenseUtils.normalizeResults(results.hits);\n\n    // Add to cache and load next page\n    if (isFirstPage && hasStateChanged(results._state, lastSearchState.current, true)) {\n      setCachedHits(() => TypesenseUtils.createCachedHits(hits));\n    } else {\n      setCachedHits(({ merge }) => merge(hits));\n    }\n  }, [infiniteHits.results]);\n\n  useEffect(() => {\n    const { results } = infiniteHits;\n\n    const hits = TypesenseUtils.normalizeResults(results.hits);\n    const isLastPage = results.page + 1 >= results.nbPages;\n\n    if (!isLastPage && infiniteHits.showMore) {\n      setTimeout(() => infiniteHits.showMore(), 25);\n    } else if (hasStateChanged(results._state, lastSearchState.current)) {\n      callbacks.current.forEach((callback) => {\n        const merged = cachedHits.merge(hits);\n        callback(merged.hits);\n      });\n    }\n\n    lastSearchState.current = results._state;\n  }, [cachedHits]);\n\n  return { cachedHits: cachedHits.hits, observe, unobserve };\n};\n\nexport default useProgressiveSearch;\n"],"names":["useProgressiveSearch","infiniteHits","cachedHits","setCachedHits","useState","TypesenseUtils","lastSearchState","useRef","callbacks","observe","useCallback","callback","unobserve","c","hasStateChanged","a","b","ignorePageNo","dequal","useEffect","results","isFirstPage","hits","merge","merged"],"mappings":";;;AAcM,MAAAA,IAAuB,CAACC,MAAiB;AACvC,QAAA,CAACC,GAAYC,CAAa,IAAIC,EAASC,EAAe,iBAAiB,CAAE,CAAA,CAAC,GAE1EC,IAAkBC,KAClBC,IAAYD,EAAkC,CAAA,CAAE,GAOhDE,IAAUC,EAAY,CAACC,MAAiC;AAC5D,IAAAH,EAAU,UAAU,CAAC,GAAGA,EAAU,SAASG,CAAQ;AAAA,EACrD,GAAG,CAAE,CAAA,GAOCC,IAAYF,EAAY,CAACC,MAAiC;AAC9D,IAAAH,EAAU,UAAUA,EAAU,QAAQ,OAAO,CAACK,MAAMA,MAAMF,CAAQ;AAAA,EACpE,GAAG,CAAE,CAAA,GAWCG,IAAkB,CAACC,GAAQC,GAAQC,OACnCA,KAAgBF,KAElB,OAAOA,EAAE,MAGPE,KAAgBD,KAElB,OAAOA,EAAE,MAGJ,CAACE,EAAOH,GAAGC,CAAC;AAGrB,SAAAG,EAAU,MAAM;AACR,UAAA,EAAE,SAAAC,EAAY,IAAAnB,GAEdoB,IAAcD,EAAQ,SAAS,GAC/BE,IAAOjB,EAAe,iBAAiBe,EAAQ,IAAI;AAGzD,IAAIC,KAAeP,EAAgBM,EAAQ,QAAQd,EAAgB,SAAS,EAAI,IAC9EH,EAAc,MAAME,EAAe,iBAAiBiB,CAAI,CAAC,IAEzDnB,EAAc,CAAC,EAAE,OAAAoB,EAAA,MAAYA,EAAMD,CAAI,CAAC;AAAA,EAC1C,GACC,CAACrB,EAAa,OAAO,CAAC,GAEzBkB,EAAU,MAAM;AACR,UAAA,EAAE,SAAAC,EAAY,IAAAnB,GAEdqB,IAAOjB,EAAe,iBAAiBe,EAAQ,IAAI;AAGrD,IAAA,EAFeA,EAAQ,OAAO,KAAKA,EAAQ,YAE5BnB,EAAa,WAC9B,WAAW,MAAMA,EAAa,SAAS,GAAG,EAAE,IACnCa,EAAgBM,EAAQ,QAAQd,EAAgB,OAAO,KACtDE,EAAA,QAAQ,QAAQ,CAACG,MAAa;AAChC,YAAAa,IAAStB,EAAW,MAAMoB,CAAI;AACpC,MAAAX,EAASa,EAAO,IAAI;AAAA,IAAA,CACrB,GAGHlB,EAAgB,UAAUc,EAAQ;AAAA,EAAA,GACjC,CAAClB,CAAU,CAAC,GAER,EAAE,YAAYA,EAAW,MAAM,SAAAO,GAAS,WAAAG,EAAU;AAC3D;"}

package/dist/index.es260.js

@@ -1,8 +1,8 @@
-import p from "./index.es363.js";
-const i = p(function(t, o, r) {
-  t[r ? 0 : 1].push(o);
-}, !0);
+import { slice as e } from "./index.es34.js";
+function a(l, t, i) {
+  return e.call(l, 0, Math.max(0, l.length - (t == null || i ? 1 : t)));
+}
 export {
-  i as default
+  a as default
 };
 //# sourceMappingURL=index.es260.js.map

package/dist/index.es260.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es260.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.es260.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.es261.js

@@ -1,15 +1,8 @@
-import f from "./index.es189.js";
-import { slice as t } from "./index.es34.js";
-import i from "./index.es181.js";
-import m from "./index.es361.js";
-import u from "./index.es242.js";
-import e from "./index.es212.js";
-import o from "./index.es199.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 n from "./index.es262.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 {
-  A as default
+  f as default
 };
 //# sourceMappingURL=index.es261.js.map

package/dist/index.es261.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es261.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.es261.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.es262.js

@@ -1,9 +1,8 @@
-import e from "./index.es361.js";
-import t from "./index.es197.js";
-function f(r) {
-  return r == null ? 0 : e(r) ? r.length : t(r).length;
+import { slice as e } from "./index.es34.js";
+function u(r, l, t) {
+  return e.call(r, l == null || t ? 1 : l);
 }
 export {
-  f as default
+  u as default
 };
 //# sourceMappingURL=index.es262.js.map

package/dist/index.es262.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es262.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.es262.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.es263.js

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

package/dist/index.es263.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es263.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.es263.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.es264.js

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

package/dist/index.es264.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es264.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.es264.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.es265.js

@@ -1,8 +1,16 @@
-import n from "./index.es266.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 b from "./index.es175.js";
+import q from "./index.es351.js";
+import B from "./index.es342.js";
+import r from "./index.es245.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 {
-  f as default
+  w as default
 };
 //# sourceMappingURL=index.es265.js.map

package/dist/index.es265.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es265.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.es265.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.es266.js

@@ -1,8 +1,18 @@
-import { slice as e } from "./index.es34.js";
-function u(r, l, t) {
-  return e.call(r, l == null || t ? 1 : l);
+import u from "./index.es342.js";
+import f from "./index.es245.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.es266.js.map

package/dist/index.es266.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es266.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.es266.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.es267.js

@@ -1,8 +1,12 @@
-import t from "./index.es245.js";
-function e(o) {
-  return t(o, Boolean);
+import f from "./index.es248.js";
+import p from "./index.es342.js";
+import u from "./index.es246.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 {
-  e as default
+  n as default
 };
 //# sourceMappingURL=index.es267.js.map

package/dist/index.es267.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es267.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.es267.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.es268.js

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

package/dist/index.es268.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es268.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.es268.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.es269.js

@@ -1,16 +1,10 @@
-import b from "./index.es179.js";
-import q from "./index.es351.js";
-import B from "./index.es342.js";
-import r from "./index.es249.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;
+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 {
-  w as default
+  u as default
 };
 //# sourceMappingURL=index.es269.js.map

package/dist/index.es269.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es269.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.es269.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.es270.js

@@ -1,18 +1,12 @@
-import u from "./index.es342.js";
-import f from "./index.es249.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);
-    }
-  }
+import { slice as n } from "./index.es34.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 {
-  v as default
+  h as default
 };
 //# sourceMappingURL=index.es270.js.map

package/dist/index.es270.js.map

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