text: /**
   * Minified by jsDelivr using Terser v3.14.1.
   * Original file: /npm/minisearch@2.1.1/dist/minisearch.js
   * 
   * https://cdn.jsdelivr.net/npm/minisearch@2.1.1/dist/minisearch.min.js
   * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files
   */
  !function (e, t) { "object" == typeof exports && "object" == typeof module ? module.exports = t() : "function" == typeof define && define.amd ? define("minisearch", [], t) : "object" == typeof exports ? exports.minisearch = t() : e.MiniSearch = t() }("undefined" != typeof self ? self : this, function () { return function (e) { var t = {}; function n(r) { if (t[r]) return t[r].exports; var i = t[r] = { i: r, l: !1, exports: {} }; return e[r].call(i.exports, i, i.exports, n), i.l = !0, i.exports } return n.m = e, n.c = t, n.d = function (e, t, r) { n.o(e, t) || Object.defineProperty(e, t, { enumerable: !0, get: r }) }, n.r = function (e) { "undefined" != typeof Symbol && Symbol.toStringTag && Object.defineProperty(e, Symbol.toStringTag, { value: "Module" }), Object.defineProperty(e, "__esModule", { value: !0 }) }, n.t = function (e, t) { if (1 & t && (e = n(e)), 8 & t) return e; if (4 & t && "object" == typeof e && e && e.__esModule) return e; var r = Object.create(null); if (n.r(r), Object.defineProperty(r, "default", { enumerable: !0, value: e }), 2 & t && "string" != typeof e) for (var i in e) n.d(r, i, function (t) { return e[t] }.bind(null, i)); return r }, n.n = function (e) { var t = e && e.__esModule ? function () { return e.default } : function () { return e }; return n.d(t, "a", t), t }, n.o = function (e, t) { return Object.prototype.hasOwnProperty.call(e, t) }, n.p = "", n(n.s = 0) }([function (e, t, n) { "use strict"; function r(e, t) { for (var n = 0; n < t.length; n++) { var r = t[n]; r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(e, r.key, r) } } n.r(t); var i = function () { function e(t, n) { !function (e, t) { if (!(e instanceof t)) throw new TypeError("Cannot call a class as a function") }(this, e); var r = t._tree, i = Object.keys(r); this.set = t, this.type = n, this.path = i.length > 0 ? [{ node: r, keys: i }] : [] } var t, n, i; return t = e, (n = [{ key: "next", value: function () { var e = this.dive(); return this.backtrack(), e } }, { key: "dive", value: function () { if (0 === this.path.length) return { done: !0 }; var e = s(this.path), t = e.node, n = e.keys; return s(n) === c ? { done: !1, value: this.result() } : (this.path.push({ node: t[s(n)], keys: Object.keys(t[s(n)]) }), this.dive()) } }, { key: "backtrack", value: function () { 0 !== this.path.length && (s(this.path).keys.pop(), s(this.path).keys.length > 0 || (this.path.pop(), this.backtrack())) } }, { key: "key", value: function () { return this.set._prefix + this.path.map(function (e) { var t = e.keys; return s(t) }).filter(function (e) { return e !== c }).join("") } }, { key: "value", value: function () { return s(this.path).node[c] } }, { key: "result", value: function () { return this.type === o ? this.value() : this.type === u ? this.key() : [this.key(), this.value()] } }, { key: Symbol.iterator, value: function () { return this } }]) && r(t.prototype, n), i && r(t, i), e }(), u = "KEYS", o = "VALUES", c = "", s = function (e) { return e[e.length - 1] }; function a(e, t) { return function (e) { if (Array.isArray(e)) return e }(e) || function (e, t) { if (!(Symbol.iterator in Object(e) || "[object Arguments]" === Object.prototype.toString.call(e))) return; var n = [], r = !0, i = !1, u = void 0; try { for (var o, c = e[Symbol.iterator](); !(r = (o = c.next()).done) && (n.push(o.value), !t || n.length !== t); r = !0); } catch (e) { i = !0, u = e } finally { try { r || null == c.return || c.return() } finally { if (i) throw u } } return n }(e, t) || function () { throw new TypeError("Invalid attempt to destructure non-iterable instance") }() } var l = function (e, t, n, r, i, u) { u.push({ distance: 0, ia: r, ib: 0, edit: i }); for (var o = []; u.length > 0;) { var c = u.pop(), s = c.distance, a = c.ia, l = c.ib, y = c.edit; if (l !== t.length) if (e[a] === t[l]) u.push({ distance: s, ia: a + 1, ib: l + 1, edit: f }); else { if (s >= n) continue; y !== h && u.push({ distance: s + 1, ia: a, ib: l + 1, edit: v }), a < e.length && (y !== v && u.push({ distance: s + 1, ia: a + 1, ib: l, edit: h }), y !== v && y !== h && u.push({ distance: s + 1, ia: a + 1, ib: l + 1, edit: d })) } else o.push({ distance: s, i: a, edit: y }) } return o }, f = 0, d = 1, h = 2, v = 3, y = function (e, t, n) { for (var r = [{ distance: 0, i: 0, key: "", node: e }], i = {}, u = [], o = function () { var e = r.pop(), o = e.node, s = e.distance, f = e.key, d = e.i, h = e.edit; Object.keys(o).forEach(function (e) { if (e === c) { var v = s + (t.length - d), y = a(i[f] || [null, 1 / 0], 2)[1]; v <= n && v < y && (i[f] = [o[e], v]) } else l(t, e, n - s, d, h, u).forEach(function (t) { var n = t.distance, i = t.i, u = t.edit; r.push({ node: o[e], distance: s + n, key: f + e, i: i, edit: u }) }) }) }; r.length > 0;)o(); return i }; function p(e) { return function (e) { if (Array.isArray(e)) { for (var t = 0, n = new Array(e.length); t < e.length; t++)n[t] = e[t]; return n } }(e) || function (e) { if (Symbol.iterator in Object(e) || "[object Arguments]" === Object.prototype.toString.call(e)) return Array.from(e) }(e) || function () { throw new TypeError("Invalid attempt to spread non-iterable instance") }() } function g(e, t, n) { return t in e ? Object.defineProperty(e, t, { value: n, enumerable: !0, configurable: !0, writable: !0 }) : e[t] = n, e } function m(e, t) { return function (e) { if (Array.isArray(e)) return e }(e) || function (e, t) { if (!(Symbol.iterator in Object(e) || "[object Arguments]" === Object.prototype.toString.call(e))) return; var n = [], r = !0, i = !1, u = void 0; try { for (var o, c = e[Symbol.iterator](); !(r = (o = c.next()).done) && (n.push(o.value), !t || n.length !== t); r = !0); } catch (e) { i = !0, u = e } finally { try { r || null == c.return || c.return() } finally { if (i) throw u } } return n }(e, t) || function () { throw new TypeError("Invalid attempt to destructure non-iterable instance") }() } function F(e, t) { for (var n = 0; n < t.length; n++) { var r = t[n]; r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(e, r.key, r) } } var b = function () { function e() { var t = arguments.length > 0 && void 0 !== arguments[0] ? arguments[0] : {}, n = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : ""; !function (e, t) { if (!(e instanceof t)) throw new TypeError("Cannot call a class as a function") }(this, e), this._tree = t, this._prefix = n } var t, n, r; return t = e, (n = [{ key: "atPrefix", value: function (t) { if (!t.startsWith(this._prefix)) throw new Error("Mismatched prefix"); var n = m(A(this._tree, t.slice(this._prefix.length)), 2), r = n[0], i = n[1]; if (void 0 === r) { var u = m(C(i), 2), o = u[0], s = u[1], a = Object.keys(o).find(function (e) { return e !== c && e.startsWith(s) }); if (void 0 !== a) return new e(g({}, a.slice(s.length), o[a]), t) } return new e(r || {}, t) } }, { key: "clear", value: function () { delete this._size, this._tree = {} } }, { key: "delete", value: function (e) { return delete this._size, O(this._tree, e) } }, { key: "entries", value: function () { return new i(this, "ENTRIES") } }, { key: "forEach", value: function (e) { var t = !0, n = !1, r = void 0; try { for (var i, u = this[Symbol.iterator](); !(t = (i = u.next()).done); t = !0) { var o = m(i.value, 2); e(o[0], o[1], this) } } catch (e) { n = !0, r = e } finally { try { t || null == u.return || u.return() } finally { if (n) throw r } } } }, { key: "fuzzyGet", value: function (e, t) { return y(this._tree, e, t) } }, { key: "get", value: function (e) { var t = k(this._tree, e); return void 0 !== t ? t[c] : void 0 } }, { key: "has", value: function (e) { var t = k(this._tree, e); return void 0 !== t && t.hasOwnProperty(c) } }, { key: "keys", value: function () { return new i(this, u) } }, { key: "set", value: function (e, t) { if ("string" != typeof e) throw new Error("key must be a string"); return delete this._size, E(this._tree, e)[c] = t, this } }, { key: "update", value: function (e, t) { if ("string" != typeof e) throw new Error("key must be a string"); delete this._size; var n = E(this._tree, e); return n[c] = t(n[c]), this } }, { key: "values", value: function () { return new i(this, o) } }, { key: Symbol.iterator, value: function () { return this.entries() } }, { key: "size", get: function () { var e = this; return this._size ? this._size : (this._size = 0, this.forEach(function () { e._size += 1 }), this._size) } }]) && F(t.prototype, n), r && F(t, r), e }(); b.from = function (e) { var t = new b, n = !0, r = !1, i = void 0; try { for (var u, o = e[Symbol.iterator](); !(n = (u = o.next()).done); n = !0) { var c = m(u.value, 2), s = c[0], a = c[1]; t.set(s, a) } } catch (e) { r = !0, i = e } finally { try { n || null == o.return || o.return() } finally { if (r) throw i } } return t }, b.fromObject = function (e) { return b.from(Object.entries(e)) }; var _, A = function e(t, n) { var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : []; if (0 === n.length) return [t, r]; var i = Object.keys(t).find(function (e) { return e !== c && n.startsWith(e) }); return void 0 === i ? e(void 0, "", [].concat(p(r), [[t, n]])) : e(t[i], n.slice(i.length), [].concat(p(r), [[t, i]])) }, k = function e(t, n) { if (0 === n.length) return t; var r = Object.keys(t).find(function (e) { return e !== c && n.startsWith(e) }); return void 0 !== r ? e(t[r], n.slice(r.length)) : void 0 }, E = function e(t, n) { if (0 === n.length) return t; var r = Object.keys(t).find(function (e) { return e !== c && n.startsWith(e) }); if (void 0 === r) { var i = Object.keys(t).find(function (e) { return e !== c && e.startsWith(n[0]) }); if (void 0 !== i) { var u = w(n, i); return t[u] = g({}, i.slice(u.length), t[i]), delete t[i], e(t[u], n.slice(u.length)) } return t[n] = {}, t[n] } return e(t[r], n.slice(r.length)) }, w = function e(t, n) { var r = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : 0, i = arguments.length > 3 && void 0 !== arguments[3] ? arguments[3] : Math.min(t.length, n.length), u = arguments.length > 4 && void 0 !== arguments[4] ? arguments[4] : ""; return r >= i ? u : t[r] !== n[r] ? u : e(t, n, r + 1, i, u + t[r]) }, O = function (e, t) { var n = m(A(e, t), 2), r = n[0], i = n[1]; if (void 0 !== r) { delete r[c]; var u = Object.keys(r); 0 === u.length && x(i), 1 === u.length && j(i, u[0], r[u[0]]) } }, x = function e(t) { if (0 !== t.length) { var n = m(C(t), 2), r = n[0]; delete r[n[1]], 0 === Object.keys(r).length && e(t.slice(0, -1)) } }, j = function (e, t, n) { if (0 !== e.length) { var r = m(C(e), 2), i = r[0], u = r[1]; i[u + t] = n, delete i[u] } }, C = function (e) { return e[e.length - 1] }, D = b; function S(e) { return function (e) { if (Array.isArray(e)) { for (var t = 0, n = new Array(e.length); t < e.length; t++)n[t] = e[t]; return n } }(e) || function (e) { if (Symbol.iterator in Object(e) || "[object Arguments]" === Object.prototype.toString.call(e)) return Array.from(e) }(e) || function () { throw new TypeError("Invalid attempt to spread non-iterable instance") }() } function z(e, t) { return function (e) { if (Array.isArray(e)) return e }(e) || function (e, t) { if (!(Symbol.iterator in Object(e) || "[object Arguments]" === Object.prototype.toString.call(e))) return; var n = [], r = !0, i = !1, u = void 0; try { for (var o, c = e[Symbol.iterator](); !(r = (o = c.next()).done) && (n.push(o.value), !t || n.length !== t); r = !0); } catch (e) { i = !0, u = e } finally { try { r || null == c.return || c.return() } finally { if (i) throw u } } return n }(e, t) || function () { throw new TypeError("Invalid attempt to destructure non-iterable instance") }() } function I(e, t) { var n = Object.keys(e); if (Object.getOwnPropertySymbols) { var r = Object.getOwnPropertySymbols(e); t && (r = r.filter(function (t) { return Object.getOwnPropertyDescriptor(e, t).enumerable })), n.push.apply(n, r) } return n } function B(e) { for (var t = 1; t < arguments.length; t++) { var n = null != arguments[t] ? arguments[t] : {}; t % 2 ? I(n, !0).forEach(function (t) { L(e, t, n[t]) }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(n)) : I(n).forEach(function (t) { Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(n, t)) }) } return e } function L(e, t, n) { return t in e ? Object.defineProperty(e, t, { value: n, enumerable: !0, configurable: !0, writable: !0 }) : e[t] = n, e } function P(e, t) { for (var n = 0; n < t.length; n++) { var r = t[n]; r.enumerable = r.enumerable || !1, r.configurable = !0, "value" in r && (r.writable = !0), Object.defineProperty(e, r.key, r) } } var M = function () { function e() { var t = arguments.length > 0 && void 0 !== arguments[0] ? arguments[0] : {}; !function (e, t) { if (!(e instanceof t)) throw new TypeError("Cannot call a class as a function") }(this, e), this._options = B({}, X, {}, t), this._options.searchOptions = B({}, Z, {}, this._options.searchOptions || {}); var n = this._options.fields; if (null == n) throw new Error('MiniSearch: option "fields" must be provided'); this._index = new D, this._documentCount = 0, this._documentIds = {}, this._fieldIds = {}, this._fieldLength = {}, this._averageFieldLength = {}, this._nextId = 0, this._storedFields = {}, R(this, n) } var t, n, r; return t = e, r = [{ key: "loadJSON", value: function (t, n) { if (null == n) throw new Error("MiniSearch: loadJSON should be given the same options used when serializing the index"); return e.loadJS(JSON.parse(t), n) } }, { key: "getDefault", value: function (e) { if (Object.keys(X).includes(e)) return X[e]; throw new Error('MiniSearch: unknown option "'.concat(e, '"')) } }, { key: "loadJS", value: function (t) { var n = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, r = t.index, i = r._tree, u = r._prefix, o = t.documentCount, c = t.nextId, s = t.documentIds, a = t.fieldIds, l = t.fieldLength, f = t.averageFieldLength, d = t.storedFields, h = new e(n); return h._index = new D(i, u), h._documentCount = o, h._nextId = c, h._documentIds = s, h._fieldIds = a, h._fieldLength = l, h._averageFieldLength = f, h._fieldIds = a, h._storedFields = d || {}, h } }], (n = [{ key: "add", value: function (e) { var t = this, n = this._options, r = n.extractField, i = n.tokenize, u = n.processTerm, o = n.fields, c = n.idField; if (null == e[c]) throw new Error('MiniSearch: document does not have ID field "'.concat(c, '"')); var s = N(this, e[c]); K(this, s, e), o.forEach(function (n) { var o = i(r(e, n) || "", n); Q(t, s, t._fieldIds[n], t.documentCount - 1, o.length), o.forEach(function (e) { var r = u(e, n); H(r) && T(t, t._fieldIds[n], s, r) }) }) } }, { key: "addAll", value: function (e) { var t = this; e.forEach(function (e) { return t.add(e) }) } }, { key: "addAllAsync", value: function (e) { var t = this, n = (arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}).chunkSize, r = void 0 === n ? 10 : n, i = { chunk: [], promise: Promise.resolve(null) }, u = e.reduce(function (e, n, i) { var u = e.chunk, o = e.promise; return u.push(n), (i + 1) % r == 0 ? { chunk: [], promise: o.then(function () { return t.addAll(u) }) } : { chunk: u, promise: o } }, i), o = u.chunk; return u.promise.then(function () { return t.addAll(o) }) } }, { key: "remove", value: function (e) { var t = this, n = this._options, r = n.tokenize, i = n.processTerm, u = n.fields, o = n.idField; if (null == e[o]) throw new Error('MiniSearch: document does not have ID field "'.concat(o, '"')); var c = Object.entries(this._documentIds).find(function (t) { var n = z(t, 2), r = (n[0], n[1]); return e[o] === r }) || [], s = z(c, 1)[0]; if (null == s) throw new Error("MiniSearch: cannot remove document with ID ".concat(e[o], ": it is not in the index")); u.filter(function (t) { return null != e[t] }).forEach(function (n) { r(e[n]).forEach(function (e) { var r = i(e); H(r) && W(t, t._fieldIds[n], s, i(e)) }) }), delete this._storedFields[s], delete this._documentIds[s], this._documentCount -= 1 } }, { key: "search", value: function (e) { var t = this, n = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, r = this._options, i = r.tokenize, u = r.processTerm, o = r.searchOptions, c = n = B({ tokenize: i, processTerm: u }, o, {}, n), s = c.tokenize, a = c.processTerm, l = s(e).map(function (e) { return a(e) }).filter(H).map(Y(n)).map(function (e) { return t.executeQuery(e, n) }), f = this.combineResults(l, n.combineWith); return Object.entries(f).reduce(function (e, r) { var i = z(r, 2), u = i[0], o = i[1], c = o.score, s = o.match, a = o.terms, l = { id: t._documentIds[u], terms: q(a), score: c, match: s }; return Object.assign(l, t._storedFields[u]), (null == n.filter || n.filter(l)) && e.push(l), e }, []).sort(function (e, t) { return e.score < t.score ? 1 : -1 }) } }, { key: "autoSuggest", value: function (e) { var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}; t = B({}, $, {}, t); var n = this.search(e, t).reduce(function (e, t) { var n = t.score, r = t.terms, i = r.join(" "); return null == e[i] ? e[i] = { score: n, terms: r, count: 1 } : (e[i].score += n, e[i].count += 1), e }, {}); return Object.entries(n).map(function (e) { var t = z(e, 2), n = t[0], r = t[1], i = r.score; return { suggestion: n, terms: r.terms, score: i / r.count } }).sort(function (e, t) { return e.score < t.score ? 1 : -1 }) } }, { key: "executeQuery", value: function (e) { var t = this, n = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, r = ((n = B({}, this._options.searchOptions, {}, n)).fields || this._options.fields).reduce(function (e, t) { return B({}, e, L({}, t, e[t] || 1)) }, n.boost || {}), i = n, u = i.boostDocument, o = i.weights, c = o.fuzzy, s = void 0 === c ? .9 : c, a = o.prefix, l = void 0 === a ? .75 : a, f = G(this, e.term, r, u, this._index.get(e.term)); if (!e.fuzzy && !e.prefix) return f; var d = [f]; if (e.prefix && this._index.atPrefix(e.term).forEach(function (n, i) { var o = .3 * (n.length - e.term.length) / n.length; d.push(G(t, n, r, u, i, l, o)) }), e.fuzzy) { var h = e.fuzzy < 1 ? Math.round(e.term.length * e.fuzzy) : e.fuzzy; Object.entries(this._index.fuzzyGet(e.term, h)).forEach(function (e) { var n = z(e, 2), i = n[0], o = z(n[1], 2), c = o[0], a = o[1] / i.length; d.push(G(t, i, r, u, c, s, a)) }) } return d.reduce(U.or, {}) } }, { key: "combineResults", value: function (e) { var t = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : "or"; if (0 === e.length) return {}; var n = t.toLowerCase(); return e.reduce(U[n], null) } }, { key: "toJSON", value: function () { return { index: this._index, documentCount: this._documentCount, nextId: this._nextId, documentIds: this._documentIds, fieldIds: this._fieldIds, fieldLength: this._fieldLength, averageFieldLength: this._averageFieldLength, storedFields: this._storedFields } } }, { key: "documentCount", get: function () { return this._documentCount } }]) && P(t.prototype, n), r && P(t, r), e }(); M.SearchableMap = D; var T = function (e, t, n, r) { e._index.update(r, function (e) { var r = (e = e || {})[t] || { df: 0, ds: {} }; return null == r.ds[n] && (r.df += 1), r.ds[n] = (r.ds[n] || 0) + 1, B({}, e, L({}, t, r)) }) }, W = function (e, t, n, r) { e._index.has(r) ? (e._index.update(r, function (i) { var u = i[t]; if (null == u || null == u.ds[n]) return J(e, n, t, r), i; if (u.ds[n] <= 1) { if (u.df <= 1) return delete i[t], i; u.df -= 1 } return u.ds[n] <= 1 ? (delete u.ds[n], i) : (u.ds[n] -= 1, B({}, i, L({}, t, u))) }), 0 === Object.keys(e._index.get(r)).length && e._index.delete(r)) : J(e, n, t, r) }, J = function (e, t, n, r) { if (null != console && null != console.warn) { var i = Object.entries(e._fieldIds).find(function (e) { var t = z(e, 2); t[0]; return t[1] === n })[0]; console.warn("MiniSearch: document with ID ".concat(e._documentIds[t], ' has changed before removal: term "').concat(r, '" was not present in field "').concat(i, '". Removing a document after it has changed can corrupt the index!')) } }, N = function (e, t) { var n = e._nextId.toString(36); return e._documentIds[n] = t, e._documentCount += 1, e._nextId += 1, n }, R = function (e, t) { t.forEach(function (t, n) { e._fieldIds[t] = n }) }, G = function (e, t, n, r, i) { arguments.length > 5 && void 0 !== arguments[5] && arguments[5]; var u = arguments.length > 6 && void 0 !== arguments[6] ? arguments[6] : 0; return null == i ? {} : Object.entries(n).reduce(function (n, o) { var c = z(o, 2), s = c[0], a = c[1], l = e._fieldIds[s], f = i[l] || { ds: {} }, d = f.df, h = f.ds; return Object.entries(h).forEach(function (i) { var o = z(i, 2), c = o[0], f = o[1], h = r ? r(e._documentIds[c], t) : 1; if (h) { var v = e._fieldLength[c][l] / e._averageFieldLength[l]; n[c] = n[c] || { score: 0, match: {}, terms: [] }, n[c].terms.push(t), n[c].match[t] = n[c].match[t] || [], n[c].score += h * V(f, d, e._documentCount, v, a, u), n[c].match[t].push(s) } }), n }, {}) }, Q = function (e, t, n, r, i) { e._averageFieldLength[n] = e._averageFieldLength[n] || 0; var u = e._averageFieldLength[n] * r + i; e._fieldLength[t] = e._fieldLength[t] || {}, e._fieldLength[t][n] = i, e._averageFieldLength[n] = u / (r + 1) }, K = function (e, t, n) { var r = e._options, i = r.storeFields, u = r.extractField; null != i && 0 !== i.length && (e._storedFields[t] = e._storedFields[t] || {}, i.forEach(function (r) { var i = u(n, r); void 0 !== i && (e._storedFields[t][r] = i) })) }, U = (L(_ = {}, "or", function (e, t) { return Object.entries(t).reduce(function (e, t) { var n = z(t, 2), r = n[0], i = n[1], u = i.score, o = i.match, c = i.terms; return null == e[r] ? e[r] = { score: u, match: o, terms: c } : (e[r].score += u, e[r].score *= 1.5, e[r].terms = [].concat(S(e[r].terms), S(c)), Object.assign(e[r].match, o)), e }, e || {}) }), L(_, "and", function (e, t) { return null == e ? t : Object.entries(t).reduce(function (t, n) { var r = z(n, 2), i = r[0], u = r[1], o = u.score, c = u.match, s = u.terms; return void 0 === e[i] ? t : (t[i] = t[i] || {}, t[i].score = e[i].score + o, t[i].match = B({}, e[i].match, {}, c), t[i].terms = [].concat(S(e[i].terms), S(s)), t) }, {}) }), _), V = function (e, t, n, r, i, u) { var o, c; return i / (1 + .333 * i * u) * (o = t, c = n, e * Math.log(c / o)) / r }, Y = function (e) { return function (t, n, r) { return { term: t, fuzzy: "function" == typeof e.fuzzy ? e.fuzzy(t, n, r) : e.fuzzy, prefix: "function" == typeof e.prefix ? e.prefix(t, n, r) : e.prefix } } }, q = function (e) { return e.filter(function (e, t, n) { return n.indexOf(e) === t }) }, H = function (e) { return !!e }, X = { idField: "id", extractField: function (e, t) { return e[t] }, tokenize: function (e, t) { return e.split(ee) }, processTerm: function (e, t) { return e.toLowerCase() }, fields: void 0, searchOptions: void 0, storeFields: [] }, Z = { combineWith: "or", prefix: !1, fuzzy: !1, weights: {} }, $ = { prefix: function (e, t, n) { return t === n.length - 1 } }, ee = /[\n\r -#%-\*,-\/:;\?@\[-\]_\{\}\xA0\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061E\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u09FD\u0A76\u0AF0\u0C77\u0C84\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166E\u1680\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2000-\u200A\u2010-\u2029\u202F-\u2043\u2045-\u2051\u2053-\u205F\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E4F\u3000-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]+/, te = M; t.default = te }]).default });
  //# sourceMappingURL=/sm/234b4d50f5bde59a3a129c54144bb5d8f40ed933af599db828fd8791f66d3553.map