@baishuyun/ui-base 2.3.1 → 2.3.2

package/dist/vendors/fuse.js-BKtvbTjL.js

@@ -0,0 +1,877 @@
+//#region ../../node_modules/.pnpm/fuse.js@7.1.0/node_modules/fuse.js/dist/fuse.mjs
+function e(e) {
+	return Array.isArray ? Array.isArray(e) : d(e) === "[object Array]";
+}
+var t = Infinity;
+function n(e) {
+	if (typeof e == "string") return e;
+	let n = e + "";
+	return n == "0" && 1 / e == -t ? "-0" : n;
+}
+function r(e) {
+	return e == null ? "" : n(e);
+}
+function i(e) {
+	return typeof e == "string";
+}
+function a(e) {
+	return typeof e == "number";
+}
+function o(e) {
+	return e === !0 || e === !1 || c(e) && d(e) == "[object Boolean]";
+}
+function s(e) {
+	return typeof e == "object";
+}
+function c(e) {
+	return s(e) && e !== null;
+}
+function l(e) {
+	return e != null;
+}
+function u(e) {
+	return !e.trim().length;
+}
+function d(e) {
+	return e == null ? e === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(e);
+}
+var f = "Incorrect 'index' type", p = (e) => `Invalid value for key ${e}`, m = (e) => `Pattern length exceeds max of ${e}.`, h = (e) => `Missing ${e} property in key`, g = (e) => `Property 'weight' in key '${e}' must be a positive integer`, _ = Object.prototype.hasOwnProperty, v = class {
+	constructor(e) {
+		this._keys = [], this._keyMap = {};
+		let t = 0;
+		e.forEach((e) => {
+			let n = y(e);
+			this._keys.push(n), this._keyMap[n.id] = n, t += n.weight;
+		}), this._keys.forEach((e) => {
+			e.weight /= t;
+		});
+	}
+	get(e) {
+		return this._keyMap[e];
+	}
+	keys() {
+		return this._keys;
+	}
+	toJSON() {
+		return JSON.stringify(this._keys);
+	}
+};
+function y(t) {
+	let n = null, r = null, a = null, o = 1, s = null;
+	if (i(t) || e(t)) a = t, n = b(t), r = x(t);
+	else {
+		if (!_.call(t, "name")) throw Error(h("name"));
+		let e = t.name;
+		if (a = e, _.call(t, "weight") && (o = t.weight, o <= 0)) throw Error(g(e));
+		n = b(e), r = x(e), s = t.getFn;
+	}
+	return {
+		path: n,
+		id: r,
+		weight: o,
+		src: a,
+		getFn: s
+	};
+}
+function b(t) {
+	return e(t) ? t : t.split(".");
+}
+function x(t) {
+	return e(t) ? t.join(".") : t;
+}
+function S(t, n) {
+	let s = [], c = !1, u = (t, n, d) => {
+		if (l(t)) if (!n[d]) s.push(t);
+		else {
+			let f = t[n[d]];
+			if (!l(f)) return;
+			if (d === n.length - 1 && (i(f) || a(f) || o(f))) s.push(r(f));
+			else if (e(f)) {
+				c = !0;
+				for (let e = 0, t = f.length; e < t; e += 1) u(f[e], n, d + 1);
+			} else n.length && u(f, n, d + 1);
+		}
+	};
+	return u(t, i(n) ? n.split(".") : n, 0), c ? s : s[0];
+}
+var C = {
+	includeMatches: !1,
+	findAllMatches: !1,
+	minMatchCharLength: 1
+}, w = {
+	isCaseSensitive: !1,
+	ignoreDiacritics: !1,
+	includeScore: !1,
+	keys: [],
+	shouldSort: !0,
+	sortFn: (e, t) => e.score === t.score ? e.idx < t.idx ? -1 : 1 : e.score < t.score ? -1 : 1
+}, ee = {
+	location: 0,
+	threshold: .6,
+	distance: 100
+}, te = {
+	useExtendedSearch: !1,
+	getFn: S,
+	ignoreLocation: !1,
+	ignoreFieldNorm: !1,
+	fieldNormWeight: 1
+}, T = {
+	...w,
+	...C,
+	...ee,
+	...te
+}, E = /[^ ]+/g;
+function ne(e = 1, t = 3) {
+	let n = /* @__PURE__ */ new Map(), r = 10 ** t;
+	return {
+		get(t) {
+			let i = t.match(E).length;
+			if (n.has(i)) return n.get(i);
+			let a = 1 / i ** (.5 * e), o = parseFloat(Math.round(a * r) / r);
+			return n.set(i, o), o;
+		},
+		clear() {
+			n.clear();
+		}
+	};
+}
+var D = class {
+	constructor({ getFn: e = T.getFn, fieldNormWeight: t = T.fieldNormWeight } = {}) {
+		this.norm = ne(t, 3), this.getFn = e, this.isCreated = !1, this.setIndexRecords();
+	}
+	setSources(e = []) {
+		this.docs = e;
+	}
+	setIndexRecords(e = []) {
+		this.records = e;
+	}
+	setKeys(e = []) {
+		this.keys = e, this._keysMap = {}, e.forEach((e, t) => {
+			this._keysMap[e.id] = t;
+		});
+	}
+	create() {
+		this.isCreated || !this.docs.length || (this.isCreated = !0, i(this.docs[0]) ? this.docs.forEach((e, t) => {
+			this._addString(e, t);
+		}) : this.docs.forEach((e, t) => {
+			this._addObject(e, t);
+		}), this.norm.clear());
+	}
+	add(e) {
+		let t = this.size();
+		i(e) ? this._addString(e, t) : this._addObject(e, t);
+	}
+	removeAt(e) {
+		this.records.splice(e, 1);
+		for (let t = e, n = this.size(); t < n; t += 1) --this.records[t].i;
+	}
+	getValueForItemAtKeyId(e, t) {
+		return e[this._keysMap[t]];
+	}
+	size() {
+		return this.records.length;
+	}
+	_addString(e, t) {
+		if (!l(e) || u(e)) return;
+		let n = {
+			v: e,
+			i: t,
+			n: this.norm.get(e)
+		};
+		this.records.push(n);
+	}
+	_addObject(t, n) {
+		let r = {
+			i: n,
+			$: {}
+		};
+		this.keys.forEach((n, a) => {
+			let o = n.getFn ? n.getFn(t) : this.getFn(t, n.path);
+			if (l(o)) {
+				if (e(o)) {
+					let t = [], n = [{
+						nestedArrIndex: -1,
+						value: o
+					}];
+					for (; n.length;) {
+						let { nestedArrIndex: r, value: a } = n.pop();
+						if (l(a)) if (i(a) && !u(a)) {
+							let e = {
+								v: a,
+								i: r,
+								n: this.norm.get(a)
+							};
+							t.push(e);
+						} else e(a) && a.forEach((e, t) => {
+							n.push({
+								nestedArrIndex: t,
+								value: e
+							});
+						});
+					}
+					r.$[a] = t;
+				} else if (i(o) && !u(o)) {
+					let e = {
+						v: o,
+						n: this.norm.get(o)
+					};
+					r.$[a] = e;
+				}
+			}
+		}), this.records.push(r);
+	}
+	toJSON() {
+		return {
+			keys: this.keys,
+			records: this.records
+		};
+	}
+};
+function O(e, t, { getFn: n = T.getFn, fieldNormWeight: r = T.fieldNormWeight } = {}) {
+	let i = new D({
+		getFn: n,
+		fieldNormWeight: r
+	});
+	return i.setKeys(e.map(y)), i.setSources(t), i.create(), i;
+}
+function re(e, { getFn: t = T.getFn, fieldNormWeight: n = T.fieldNormWeight } = {}) {
+	let { keys: r, records: i } = e, a = new D({
+		getFn: t,
+		fieldNormWeight: n
+	});
+	return a.setKeys(r), a.setIndexRecords(i), a;
+}
+function k(e, { errors: t = 0, currentLocation: n = 0, expectedLocation: r = 0, distance: i = T.distance, ignoreLocation: a = T.ignoreLocation } = {}) {
+	let o = t / e.length;
+	if (a) return o;
+	let s = Math.abs(r - n);
+	return i ? o + s / i : s ? 1 : o;
+}
+function A(e = [], t = T.minMatchCharLength) {
+	let n = [], r = -1, i = -1, a = 0;
+	for (let o = e.length; a < o; a += 1) {
+		let o = e[a];
+		o && r === -1 ? r = a : !o && r !== -1 && (i = a - 1, i - r + 1 >= t && n.push([r, i]), r = -1);
+	}
+	return e[a - 1] && a - r >= t && n.push([r, a - 1]), n;
+}
+var j = 32;
+function M(e, t, n, { location: r = T.location, distance: i = T.distance, threshold: a = T.threshold, findAllMatches: o = T.findAllMatches, minMatchCharLength: s = T.minMatchCharLength, includeMatches: c = T.includeMatches, ignoreLocation: l = T.ignoreLocation } = {}) {
+	if (t.length > j) throw Error(m(j));
+	let u = t.length, d = e.length, f = Math.max(0, Math.min(r, d)), p = a, h = f, g = s > 1 || c, _ = g ? Array(d) : [], v;
+	for (; (v = e.indexOf(t, h)) > -1;) {
+		let e = k(t, {
+			currentLocation: v,
+			expectedLocation: f,
+			distance: i,
+			ignoreLocation: l
+		});
+		if (p = Math.min(e, p), h = v + u, g) {
+			let e = 0;
+			for (; e < u;) _[v + e] = 1, e += 1;
+		}
+	}
+	h = -1;
+	let y = [], b = 1, x = u + d, S = 1 << u - 1;
+	for (let r = 0; r < u; r += 1) {
+		let a = 0, s = x;
+		for (; a < s;) k(t, {
+			errors: r,
+			currentLocation: f + s,
+			expectedLocation: f,
+			distance: i,
+			ignoreLocation: l
+		}) <= p ? a = s : x = s, s = Math.floor((x - a) / 2 + a);
+		x = s;
+		let c = Math.max(1, f - s + 1), m = o ? d : Math.min(f + s, d) + u, v = Array(m + 2);
+		v[m + 1] = (1 << r) - 1;
+		for (let a = m; a >= c; --a) {
+			let o = a - 1, s = n[e.charAt(o)];
+			if (g && (_[o] = +!!s), v[a] = (v[a + 1] << 1 | 1) & s, r && (v[a] |= (y[a + 1] | y[a]) << 1 | 1 | y[a + 1]), v[a] & S && (b = k(t, {
+				errors: r,
+				currentLocation: o,
+				expectedLocation: f,
+				distance: i,
+				ignoreLocation: l
+			}), b <= p)) {
+				if (p = b, h = o, h <= f) break;
+				c = Math.max(1, 2 * f - h);
+			}
+		}
+		if (k(t, {
+			errors: r + 1,
+			currentLocation: f,
+			expectedLocation: f,
+			distance: i,
+			ignoreLocation: l
+		}) > p) break;
+		y = v;
+	}
+	let C = {
+		isMatch: h >= 0,
+		score: Math.max(.001, b)
+	};
+	if (g) {
+		let e = A(_, s);
+		e.length ? c && (C.indices = e) : C.isMatch = !1;
+	}
+	return C;
+}
+function ie(e) {
+	let t = {};
+	for (let n = 0, r = e.length; n < r; n += 1) {
+		let i = e.charAt(n);
+		t[i] = (t[i] || 0) | 1 << r - n - 1;
+	}
+	return t;
+}
+var N = String.prototype.normalize ? ((e) => e.normalize("NFD").replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g, "")) : ((e) => e), P = class {
+	constructor(e, { location: t = T.location, threshold: n = T.threshold, distance: r = T.distance, includeMatches: i = T.includeMatches, findAllMatches: a = T.findAllMatches, minMatchCharLength: o = T.minMatchCharLength, isCaseSensitive: s = T.isCaseSensitive, ignoreDiacritics: c = T.ignoreDiacritics, ignoreLocation: l = T.ignoreLocation } = {}) {
+		if (this.options = {
+			location: t,
+			threshold: n,
+			distance: r,
+			includeMatches: i,
+			findAllMatches: a,
+			minMatchCharLength: o,
+			isCaseSensitive: s,
+			ignoreDiacritics: c,
+			ignoreLocation: l
+		}, e = s ? e : e.toLowerCase(), e = c ? N(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length) return;
+		let u = (e, t) => {
+			this.chunks.push({
+				pattern: e,
+				alphabet: ie(e),
+				startIndex: t
+			});
+		}, d = this.pattern.length;
+		if (d > j) {
+			let e = 0, t = d % j, n = d - t;
+			for (; e < n;) u(this.pattern.substr(e, j), e), e += j;
+			if (t) {
+				let e = d - j;
+				u(this.pattern.substr(e), e);
+			}
+		} else u(this.pattern, 0);
+	}
+	searchIn(e) {
+		let { isCaseSensitive: t, ignoreDiacritics: n, includeMatches: r } = this.options;
+		if (e = t ? e : e.toLowerCase(), e = n ? N(e) : e, this.pattern === e) {
+			let t = {
+				isMatch: !0,
+				score: 0
+			};
+			return r && (t.indices = [[0, e.length - 1]]), t;
+		}
+		let { location: i, distance: a, threshold: o, findAllMatches: s, minMatchCharLength: c, ignoreLocation: l } = this.options, u = [], d = 0, f = !1;
+		this.chunks.forEach(({ pattern: t, alphabet: n, startIndex: p }) => {
+			let { isMatch: m, score: h, indices: g } = M(e, t, n, {
+				location: i + p,
+				distance: a,
+				threshold: o,
+				findAllMatches: s,
+				minMatchCharLength: c,
+				includeMatches: r,
+				ignoreLocation: l
+			});
+			m && (f = !0), d += h, m && g && (u = [...u, ...g]);
+		});
+		let p = {
+			isMatch: f,
+			score: f ? d / this.chunks.length : 1
+		};
+		return f && r && (p.indices = u), p;
+	}
+}, F = class {
+	constructor(e) {
+		this.pattern = e;
+	}
+	static isMultiMatch(e) {
+		return I(e, this.multiRegex);
+	}
+	static isSingleMatch(e) {
+		return I(e, this.singleRegex);
+	}
+	search() {}
+};
+function I(e, t) {
+	let n = e.match(t);
+	return n ? n[1] : null;
+}
+var ae = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "exact";
+	}
+	static get multiRegex() {
+		return /^="(.*)"$/;
+	}
+	static get singleRegex() {
+		return /^=(.*)$/;
+	}
+	search(e) {
+		let t = e === this.pattern;
+		return {
+			isMatch: t,
+			score: t ? 0 : 1,
+			indices: [0, this.pattern.length - 1]
+		};
+	}
+}, oe = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "inverse-exact";
+	}
+	static get multiRegex() {
+		return /^!"(.*)"$/;
+	}
+	static get singleRegex() {
+		return /^!(.*)$/;
+	}
+	search(e) {
+		let t = e.indexOf(this.pattern) === -1;
+		return {
+			isMatch: t,
+			score: t ? 0 : 1,
+			indices: [0, e.length - 1]
+		};
+	}
+}, se = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "prefix-exact";
+	}
+	static get multiRegex() {
+		return /^\^"(.*)"$/;
+	}
+	static get singleRegex() {
+		return /^\^(.*)$/;
+	}
+	search(e) {
+		let t = e.startsWith(this.pattern);
+		return {
+			isMatch: t,
+			score: t ? 0 : 1,
+			indices: [0, this.pattern.length - 1]
+		};
+	}
+}, ce = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "inverse-prefix-exact";
+	}
+	static get multiRegex() {
+		return /^!\^"(.*)"$/;
+	}
+	static get singleRegex() {
+		return /^!\^(.*)$/;
+	}
+	search(e) {
+		let t = !e.startsWith(this.pattern);
+		return {
+			isMatch: t,
+			score: t ? 0 : 1,
+			indices: [0, e.length - 1]
+		};
+	}
+}, L = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "suffix-exact";
+	}
+	static get multiRegex() {
+		return /^"(.*)"\$$/;
+	}
+	static get singleRegex() {
+		return /^(.*)\$$/;
+	}
+	search(e) {
+		let t = e.endsWith(this.pattern);
+		return {
+			isMatch: t,
+			score: t ? 0 : 1,
+			indices: [e.length - this.pattern.length, e.length - 1]
+		};
+	}
+}, R = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "inverse-suffix-exact";
+	}
+	static get multiRegex() {
+		return /^!"(.*)"\$$/;
+	}
+	static get singleRegex() {
+		return /^!(.*)\$$/;
+	}
+	search(e) {
+		let t = !e.endsWith(this.pattern);
+		return {
+			isMatch: t,
+			score: t ? 0 : 1,
+			indices: [0, e.length - 1]
+		};
+	}
+}, z = class extends F {
+	constructor(e, { location: t = T.location, threshold: n = T.threshold, distance: r = T.distance, includeMatches: i = T.includeMatches, findAllMatches: a = T.findAllMatches, minMatchCharLength: o = T.minMatchCharLength, isCaseSensitive: s = T.isCaseSensitive, ignoreDiacritics: c = T.ignoreDiacritics, ignoreLocation: l = T.ignoreLocation } = {}) {
+		super(e), this._bitapSearch = new P(e, {
+			location: t,
+			threshold: n,
+			distance: r,
+			includeMatches: i,
+			findAllMatches: a,
+			minMatchCharLength: o,
+			isCaseSensitive: s,
+			ignoreDiacritics: c,
+			ignoreLocation: l
+		});
+	}
+	static get type() {
+		return "fuzzy";
+	}
+	static get multiRegex() {
+		return /^"(.*)"$/;
+	}
+	static get singleRegex() {
+		return /^(.*)$/;
+	}
+	search(e) {
+		return this._bitapSearch.searchIn(e);
+	}
+}, B = class extends F {
+	constructor(e) {
+		super(e);
+	}
+	static get type() {
+		return "include";
+	}
+	static get multiRegex() {
+		return /^'"(.*)"$/;
+	}
+	static get singleRegex() {
+		return /^'(.*)$/;
+	}
+	search(e) {
+		let t = 0, n, r = [], i = this.pattern.length;
+		for (; (n = e.indexOf(this.pattern, t)) > -1;) t = n + i, r.push([n, t - 1]);
+		let a = !!r.length;
+		return {
+			isMatch: a,
+			score: a ? 0 : 1,
+			indices: r
+		};
+	}
+}, V = [
+	ae,
+	B,
+	se,
+	ce,
+	R,
+	L,
+	oe,
+	z
+], H = V.length, U = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, W = "|";
+function le(e, t = {}) {
+	return e.split(W).map((e) => {
+		let n = e.trim().split(U).filter((e) => e && !!e.trim()), r = [];
+		for (let e = 0, i = n.length; e < i; e += 1) {
+			let i = n[e], a = !1, o = -1;
+			for (; !a && ++o < H;) {
+				let e = V[o], n = e.isMultiMatch(i);
+				n && (r.push(new e(n, t)), a = !0);
+			}
+			if (!a) for (o = -1; ++o < H;) {
+				let e = V[o], n = e.isSingleMatch(i);
+				if (n) {
+					r.push(new e(n, t));
+					break;
+				}
+			}
+		}
+		return r;
+	});
+}
+var ue = new Set([z.type, B.type]), de = class {
+	constructor(e, { isCaseSensitive: t = T.isCaseSensitive, ignoreDiacritics: n = T.ignoreDiacritics, includeMatches: r = T.includeMatches, minMatchCharLength: i = T.minMatchCharLength, ignoreLocation: a = T.ignoreLocation, findAllMatches: o = T.findAllMatches, location: s = T.location, threshold: c = T.threshold, distance: l = T.distance } = {}) {
+		this.query = null, this.options = {
+			isCaseSensitive: t,
+			ignoreDiacritics: n,
+			includeMatches: r,
+			minMatchCharLength: i,
+			findAllMatches: o,
+			ignoreLocation: a,
+			location: s,
+			threshold: c,
+			distance: l
+		}, e = t ? e : e.toLowerCase(), e = n ? N(e) : e, this.pattern = e, this.query = le(this.pattern, this.options);
+	}
+	static condition(e, t) {
+		return t.useExtendedSearch;
+	}
+	searchIn(e) {
+		let t = this.query;
+		if (!t) return {
+			isMatch: !1,
+			score: 1
+		};
+		let { includeMatches: n, isCaseSensitive: r, ignoreDiacritics: i } = this.options;
+		e = r ? e : e.toLowerCase(), e = i ? N(e) : e;
+		let a = 0, o = [], s = 0;
+		for (let r = 0, i = t.length; r < i; r += 1) {
+			let i = t[r];
+			o.length = 0, a = 0;
+			for (let t = 0, r = i.length; t < r; t += 1) {
+				let r = i[t], { isMatch: c, indices: l, score: u } = r.search(e);
+				if (c) {
+					if (a += 1, s += u, n) {
+						let e = r.constructor.type;
+						ue.has(e) ? o = [...o, ...l] : o.push(l);
+					}
+				} else {
+					s = 0, a = 0, o.length = 0;
+					break;
+				}
+			}
+			if (a) {
+				let e = {
+					isMatch: !0,
+					score: s / a
+				};
+				return n && (e.indices = o), e;
+			}
+		}
+		return {
+			isMatch: !1,
+			score: 1
+		};
+	}
+}, G = [];
+function fe(...e) {
+	G.push(...e);
+}
+function K(e, t) {
+	for (let n = 0, r = G.length; n < r; n += 1) {
+		let r = G[n];
+		if (r.condition(e, t)) return new r(e, t);
+	}
+	return new P(e, t);
+}
+var q = {
+	AND: "$and",
+	OR: "$or"
+}, J = {
+	PATH: "$path",
+	PATTERN: "$val"
+}, Y = (e) => !!(e[q.AND] || e[q.OR]), pe = (e) => !!e[J.PATH], me = (t) => !e(t) && s(t) && !Y(t), X = (e) => ({ [q.AND]: Object.keys(e).map((t) => ({ [t]: e[t] })) });
+function Z(t, n, { auto: r = !0 } = {}) {
+	let a = (t) => {
+		let o = Object.keys(t), s = pe(t);
+		if (!s && o.length > 1 && !Y(t)) return a(X(t));
+		if (me(t)) {
+			let e = s ? t[J.PATH] : o[0], a = s ? t[J.PATTERN] : t[e];
+			if (!i(a)) throw Error(p(e));
+			let c = {
+				keyId: x(e),
+				pattern: a
+			};
+			return r && (c.searcher = K(a, n)), c;
+		}
+		let c = {
+			children: [],
+			operator: o[0]
+		};
+		return o.forEach((n) => {
+			let r = t[n];
+			e(r) && r.forEach((e) => {
+				c.children.push(a(e));
+			});
+		}), c;
+	};
+	return Y(t) || (t = X(t)), a(t);
+}
+function Q(e, { ignoreFieldNorm: t = T.ignoreFieldNorm }) {
+	e.forEach((e) => {
+		let n = 1;
+		e.matches.forEach(({ key: e, norm: r, score: i }) => {
+			let a = e ? e.weight : null;
+			n *= (i === 0 && a ? 2 ** -52 : i) ** +((a || 1) * (t ? 1 : r));
+		}), e.score = n;
+	});
+}
+function he(e, t) {
+	let n = e.matches;
+	t.matches = [], l(n) && n.forEach((e) => {
+		if (!l(e.indices) || !e.indices.length) return;
+		let { indices: n, value: r } = e, i = {
+			indices: n,
+			value: r
+		};
+		e.key && (i.key = e.key.src), e.idx > -1 && (i.refIndex = e.idx), t.matches.push(i);
+	});
+}
+function ge(e, t) {
+	t.score = e.score;
+}
+function _e(e, t, { includeMatches: n = T.includeMatches, includeScore: r = T.includeScore } = {}) {
+	let i = [];
+	return n && i.push(he), r && i.push(ge), e.map((e) => {
+		let { idx: n } = e, r = {
+			item: t[n],
+			refIndex: n
+		};
+		return i.length && i.forEach((t) => {
+			t(e, r);
+		}), r;
+	});
+}
+var $ = class {
+	constructor(e, t = {}, n) {
+		this.options = {
+			...T,
+			...t
+		}, this.options.useExtendedSearch, this._keyStore = new v(this.options.keys), this.setCollection(e, n);
+	}
+	setCollection(e, t) {
+		if (this._docs = e, t && !(t instanceof D)) throw Error(f);
+		this._myIndex = t || O(this.options.keys, this._docs, {
+			getFn: this.options.getFn,
+			fieldNormWeight: this.options.fieldNormWeight
+		});
+	}
+	add(e) {
+		l(e) && (this._docs.push(e), this._myIndex.add(e));
+	}
+	remove(e = () => !1) {
+		let t = [];
+		for (let n = 0, r = this._docs.length; n < r; n += 1) {
+			let i = this._docs[n];
+			e(i, n) && (this.removeAt(n), --n, --r, t.push(i));
+		}
+		return t;
+	}
+	removeAt(e) {
+		this._docs.splice(e, 1), this._myIndex.removeAt(e);
+	}
+	getIndex() {
+		return this._myIndex;
+	}
+	search(e, { limit: t = -1 } = {}) {
+		let { includeMatches: n, includeScore: r, shouldSort: o, sortFn: s, ignoreFieldNorm: c } = this.options, l = i(e) ? i(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
+		return Q(l, { ignoreFieldNorm: c }), o && l.sort(s), a(t) && t > -1 && (l = l.slice(0, t)), _e(l, this._docs, {
+			includeMatches: n,
+			includeScore: r
+		});
+	}
+	_searchStringList(e) {
+		let t = K(e, this.options), { records: n } = this._myIndex, r = [];
+		return n.forEach(({ v: e, i: n, n: i }) => {
+			if (!l(e)) return;
+			let { isMatch: a, score: o, indices: s } = t.searchIn(e);
+			a && r.push({
+				item: e,
+				idx: n,
+				matches: [{
+					score: o,
+					value: e,
+					norm: i,
+					indices: s
+				}]
+			});
+		}), r;
+	}
+	_searchLogical(e) {
+		let t = Z(e, this.options), n = (e, t, r) => {
+			if (!e.children) {
+				let { keyId: n, searcher: i } = e, a = this._findMatches({
+					key: this._keyStore.get(n),
+					value: this._myIndex.getValueForItemAtKeyId(t, n),
+					searcher: i
+				});
+				return a && a.length ? [{
+					idx: r,
+					item: t,
+					matches: a
+				}] : [];
+			}
+			let i = [];
+			for (let a = 0, o = e.children.length; a < o; a += 1) {
+				let o = e.children[a], s = n(o, t, r);
+				if (s.length) i.push(...s);
+				else if (e.operator === q.AND) return [];
+			}
+			return i;
+		}, r = this._myIndex.records, i = {}, a = [];
+		return r.forEach(({ $: e, i: r }) => {
+			if (l(e)) {
+				let o = n(t, e, r);
+				o.length && (i[r] || (i[r] = {
+					idx: r,
+					item: e,
+					matches: []
+				}, a.push(i[r])), o.forEach(({ matches: e }) => {
+					i[r].matches.push(...e);
+				}));
+			}
+		}), a;
+	}
+	_searchObjectList(e) {
+		let t = K(e, this.options), { keys: n, records: r } = this._myIndex, i = [];
+		return r.forEach(({ $: e, i: r }) => {
+			if (!l(e)) return;
+			let a = [];
+			n.forEach((n, r) => {
+				a.push(...this._findMatches({
+					key: n,
+					value: e[r],
+					searcher: t
+				}));
+			}), a.length && i.push({
+				idx: r,
+				item: e,
+				matches: a
+			});
+		}), i;
+	}
+	_findMatches({ key: t, value: n, searcher: r }) {
+		if (!l(n)) return [];
+		let i = [];
+		if (e(n)) n.forEach(({ v: e, i: n, n: a }) => {
+			if (!l(e)) return;
+			let { isMatch: o, score: s, indices: c } = r.searchIn(e);
+			o && i.push({
+				score: s,
+				key: t,
+				value: e,
+				idx: n,
+				norm: a,
+				indices: c
+			});
+		});
+		else {
+			let { v: e, n: a } = n, { isMatch: o, score: s, indices: c } = r.searchIn(e);
+			o && i.push({
+				score: s,
+				key: t,
+				value: e,
+				norm: a,
+				indices: c
+			});
+		}
+		return i;
+	}
+};
+$.version = "7.1.0", $.createIndex = O, $.parseIndex = re, $.config = T, $.parseQuery = Z, fe(de);
+//#endregion
+export { $ as t };