@untemps/react-vocal 2.0.0-beta.3 → 2.0.0-beta.4

package/dist/index.es.js

@@ -427,7 +427,7 @@ function D(e, t) {
 	for (var n = 0, r = Array(t); n < t; n++) r[n] = e[n];
 	return r;
 }
-var ee = function() {
+var O = function() {
 	var e = T(regeneratorRuntime.mark((function e(t) {
 		return regeneratorRuntime.wrap((function(e) {
 			for (;;) switch (e.prev = e.next) {
@@ -439,8 +439,8 @@ var ee = function() {
 								case 0: return S() || r(new DOMException("Navigator API: permissions not supported", "NOT_SUPPORTED_ERR")), e.prev = 1, e.next = 4, navigator.permissions.query({ name: t });
 								case 4:
 									i = e.sent, a = function e(t) {
-										i.removeEventListener("change", e), O(t.target.state, n, r);
-									}, i.addEventListener("change", a), O(i.state, n, r), e.next = 13;
+										i.removeEventListener("change", e), k(t.target.state, n, r);
+									}, i.addEventListener("change", a), k(i.state, n, r), e.next = 13;
 									break;
 								case 10: e.prev = 10, e.t0 = e.catch(1), r(e.t0);
 								case 13:
@@ -460,14 +460,14 @@ var ee = function() {
 	return function(t) {
 		return e.apply(this, arguments);
 	};
-}(), O = function(e, t, n) {
+}(), k = function(e, t, n) {
 	switch (e) {
 		case "denied":
 			n(new DOMException("Permission denied", "NOT_ALLOWED_ERR"));
 			break;
 		default: t(e);
 	}
-}, k = function() {
+}, A = function() {
 	var e = T(regeneratorRuntime.mark((function e(t, n) {
 		return regeneratorRuntime.wrap((function(e) {
 			for (;;) switch (e.prev = e.next) {
@@ -476,7 +476,7 @@ var ee = function() {
 						var a, o, s;
 						return regeneratorRuntime.wrap((function(e) {
 							for (;;) switch (e.prev = e.next) {
-								case 0: return S() && C() || i(new DOMException("Navigator API: permissions or Navigator API: mediaDevices not supported", "NOT_SUPPORTED_ERR")), e.prev = 1, e.t0 = Promise, e.next = 5, ee(t);
+								case 0: return S() && C() || i(new DOMException("Navigator API: permissions or Navigator API: mediaDevices not supported", "NOT_SUPPORTED_ERR")), e.prev = 1, e.t0 = Promise, e.next = 5, O(t);
 								case 5: return e.t1 = e.sent, e.next = 8, navigator.mediaDevices.getUserMedia(n);
 								case 8: return e.t2 = e.sent, e.t3 = [e.t1, e.t2], e.next = 12, e.t0.all.call(e.t0, e.t3);
 								case 12:
@@ -501,7 +501,7 @@ var ee = function() {
 		return e.apply(this, arguments);
 	};
 }();
-function A(e, t) {
+function j(e, t) {
 	var n = Object.keys(e);
 	if (Object.getOwnPropertySymbols) {
 		var r = Object.getOwnPropertySymbols(e);
@@ -511,24 +511,24 @@ function A(e, t) {
 	}
 	return n;
 }
-function j(e) {
+function M(e) {
 	for (var t = 1; t < arguments.length; t++) {
 		var n = arguments[t] == null ? {} : arguments[t];
-		t % 2 ? A(Object(n), !0).forEach((function(t) {
+		t % 2 ? j(Object(n), !0).forEach((function(t) {
 			x(e, t, n[t]);
-		})) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(n)) : A(Object(n)).forEach((function(t) {
+		})) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(n)) : j(Object(n)).forEach((function(t) {
 			Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(n, t));
 		}));
 	}
 	return e;
 }
-var M = function() {
+var N = function() {
 	function e(t) {
 		var n = this;
 		v(this, e), x(this, "_instance", null), x(this, "_listeners", null);
 		var r = e._resolveSpeechRecognition();
 		if (!r) throw new DOMException("SpeechRecognition not supported", "NOT_SUPPORTED_ERR");
-		this._instance = new r(), this._listeners = {}, Object.entries(j(j({}, e.defaultOptions), t || {})).forEach((function(t) {
+		this._instance = new r(), this._listeners = {}, Object.entries(M(M({}, e.defaultOptions), t || {})).forEach((function(t) {
 			var r = _(t, 2), i = r[0], a = r[1];
 			if (i === "grammars" && !a) {
 				var o = e._resolveSpeechGrammarList();
@@ -558,7 +558,7 @@ var M = function() {
 								e.next = 14;
 								break;
 							}
-							return e.prev = 1, e.next = 4, k("microphone", { audio: !0 });
+							return e.prev = 1, e.next = 4, A("microphone", { audio: !0 });
 						case 4:
 							if (e.sent) {
 								e.next = 7;
@@ -650,14 +650,14 @@ var M = function() {
 		}
 	}]), e;
 }();
-x(M, "defaultOptions", {
+x(N, "defaultOptions", {
 	grammars: null,
 	lang: "en-US",
 	continuous: !1,
 	interimResults: !1,
 	maxAlternatives: 1,
 	serviceURI: null
-}), x(M, "eventTypes", {
+}), x(N, "eventTypes", {
 	AUDIO_END: "audioend",
 	AUDIO_START: "audiostart",
 	END: "end",
@@ -672,40 +672,42 @@ x(M, "defaultOptions", {
 });
 //#endregion
 //#region node_modules/@untemps/utils/dist/function/isFunction.js
-var te = (e) => typeof e == "function", N = (e = "en-US", t = null, i = null) => {
-	let o = a(null);
+var ee = (e) => typeof e == "function", P = (e = "en-US", t = null, i = 1, o = null) => {
+	let s = a(null);
 	return r(() => {
-		if (M.isSupported) return o.current = i || new M({
+		if (N.isSupported) return s.current = o || new N({
 			lang: e,
-			grammars: t
+			grammars: t,
+			maxAlternatives: i
 		}), () => {
-			o.current.abort(), o.current.cleanup();
+			s.current.abort(), s.current.cleanup();
 		};
 	}, [
 		e,
 		t,
-		i
-	]), [o, {
+		i,
+		o
+	]), [s, {
 		start: n(() => {
-			o.current && o.current.start();
+			s.current && s.current.start();
 		}, []),
 		stop: n(() => {
-			o.current && o.current.stop();
+			s.current && s.current.stop();
 		}, []),
 		abort: n(() => {
-			o.current && o.current.abort();
+			s.current && s.current.abort();
 		}, []),
 		subscribe: n((e, t) => {
-			o.current && o.current.addEventListener(e, t);
+			s.current && s.current.addEventListener(e, t);
 		}, []),
 		unsubscribe: n((e, t) => {
-			o.current && o.current.removeEventListener(e, t);
+			s.current && s.current.removeEventListener(e, t);
 		}, []),
 		clean: n(() => {
-			o.current && o.current.cleanup();
+			s.current && s.current.cleanup();
 		}, [])
 	}];
-}, ne = (e, t = 0) => {
+}, te = (e, t = 0) => {
 	let i = a(-1), o = n(() => {
 		clearTimeout(i.current), i.current = -1;
 	}, []), s = n(() => {
@@ -719,48 +721,48 @@ var te = (e) => typeof e == "function", N = (e = "en-US", t = null, i = null) =>
 };
 //#endregion
 //#region node_modules/fuse.js/dist/fuse.mjs
-function P(e) {
-	return Array.isArray ? Array.isArray(e) : H(e) === "[object Array]";
-}
 function F(e) {
+	return Array.isArray ? Array.isArray(e) : W(e) === "[object Array]";
+}
+function I(e) {
 	if (typeof e == "string") return e;
 	if (typeof e == "bigint") return e.toString();
 	let t = e + "";
 	return t == "0" && 1 / e == -Infinity ? "-0" : t;
 }
-function I(e) {
-	return e == null ? "" : F(e);
-}
 function L(e) {
-	return typeof e == "string";
+	return e == null ? "" : I(e);
 }
 function R(e) {
+	return typeof e == "string";
+}
+function z(e) {
 	return typeof e == "number";
 }
-function re(e) {
-	return e === !0 || e === !1 || ie(e) && H(e) == "[object Boolean]";
+function B(e) {
+	return e === !0 || e === !1 || ne(e) && W(e) == "[object Boolean]";
 }
-function z(e) {
+function V(e) {
 	return typeof e == "object";
 }
-function ie(e) {
-	return z(e) && e !== null;
+function ne(e) {
+	return V(e) && e !== null;
 }
-function B(e) {
+function H(e) {
 	return e != null;
 }
-function V(e) {
+function U(e) {
 	return !e.trim().length;
 }
-function H(e) {
+function W(e) {
 	return e == null ? e === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(e);
 }
-var U = "Incorrect 'index' type", W = (e) => `Invalid value for key ${e}`, G = (e) => `Pattern length exceeds max of ${e}.`, ae = (e) => `Missing ${e} property in key`, oe = (e) => `Property 'weight' in key '${e}' must be a positive integer`, se = Object.prototype.hasOwnProperty, ce = class {
+var G = "Incorrect 'index' type", re = (e) => `Invalid value for key ${e}`, K = (e) => `Pattern length exceeds max of ${e}.`, q = (e) => `Missing ${e} property in key`, ie = (e) => `Property 'weight' in key '${e}' must be a positive integer`, ae = Object.prototype.hasOwnProperty, oe = class {
 	constructor(e) {
 		this._keys = [], this._keyMap = {};
 		let t = 0;
 		e.forEach((e) => {
-			let n = le(e);
+			let n = se(e);
 			this._keys.push(n), this._keyMap[n.id] = n, t += n.weight;
 		}), this._keys.forEach((e) => {
 			e.weight /= t;
@@ -776,14 +778,14 @@ var U = "Incorrect 'index' type", W = (e) => `Invalid value for key ${e}`, G = (
 		return JSON.stringify(this._keys);
 	}
 };
-function le(e) {
+function se(e) {
 	let t = null, n = null, r = null, i = 1, a = null;
-	if (L(e) || P(e)) r = e, t = ue(e), n = de(e);
+	if (R(e) || F(e)) r = e, t = ce(e), n = le(e);
 	else {
-		if (!se.call(e, "name")) throw Error(ae("name"));
+		if (!ae.call(e, "name")) throw Error(q("name"));
 		let o = e.name;
-		if (r = o, se.call(e, "weight") && (i = e.weight, i <= 0)) throw Error(oe(o));
-		t = ue(o), n = de(o), a = e.getFn;
+		if (r = o, ae.call(e, "weight") && (i = e.weight, i <= 0)) throw Error(ie(o));
+		t = ce(o), n = le(o), a = e.getFn;
 	}
 	return {
 		path: t,
@@ -793,66 +795,66 @@ function le(e) {
 		getFn: a
 	};
 }
-function ue(e) {
-	return P(e) ? e : e.split(".");
+function ce(e) {
+	return F(e) ? e : e.split(".");
 }
-function de(e) {
-	return P(e) ? e.join(".") : e;
+function le(e) {
+	return F(e) ? e.join(".") : e;
 }
-function fe(e, t) {
+function ue(e, t) {
 	let n = [], r = !1, i = (e, t, a, o) => {
-		if (B(e)) if (!t[a]) n.push(o === void 0 ? e : {
+		if (H(e)) if (!t[a]) n.push(o === void 0 ? e : {
 			v: e,
 			i: o
 		});
 		else {
 			let s = e[t[a]];
-			if (!B(s)) return;
-			if (a === t.length - 1 && (L(s) || R(s) || re(s) || typeof s == "bigint")) n.push(o === void 0 ? I(s) : {
-				v: I(s),
+			if (!H(s)) return;
+			if (a === t.length - 1 && (R(s) || z(s) || B(s) || typeof s == "bigint")) n.push(o === void 0 ? L(s) : {
+				v: L(s),
 				i: o
 			});
-			else if (P(s)) {
+			else if (F(s)) {
 				r = !0;
 				for (let e = 0, n = s.length; e < n; e += 1) i(s[e], t, a + 1, e);
 			} else t.length && i(s, t, a + 1, o);
 		}
 	};
-	return i(e, L(t) ? t.split(".") : t, 0), r ? n : n[0];
+	return i(e, R(t) ? t.split(".") : t, 0), r ? n : n[0];
 }
-var pe = {
+var de = {
 	includeMatches: !1,
 	findAllMatches: !1,
 	minMatchCharLength: 1
-}, me = {
+}, fe = {
 	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
-}, he = {
+}, pe = {
 	location: 0,
 	threshold: .6,
 	distance: 100
-}, ge = {
+}, me = {
 	useExtendedSearch: !1,
 	useTokenSearch: !1,
-	getFn: fe,
+	getFn: ue,
 	ignoreLocation: !1,
 	ignoreFieldNorm: !1,
 	fieldNormWeight: 1
-}, K = Object.freeze({
-	...me,
+}, J = Object.freeze({
+	...fe,
+	...de,
 	...pe,
-	...he,
-	...ge
-}), _e = /[^ ]+/g;
-function ve(e = 1, t = 3) {
+	...me
+}), he = /[^ ]+/g;
+function ge(e = 1, t = 3) {
 	let n = /* @__PURE__ */ new Map(), r = 10 ** t;
 	return {
 		get(t) {
-			let i = t.match(_e).length;
+			let i = t.match(he).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;
@@ -862,9 +864,9 @@ function ve(e = 1, t = 3) {
 		}
 	};
 }
-var ye = class {
-	constructor({ getFn: e = K.getFn, fieldNormWeight: t = K.fieldNormWeight } = {}) {
-		this.norm = ve(t, 3), this.getFn = e, this.isCreated = !1, this.docs = [], this.keys = [], this._keysMap = {}, this.setIndexRecords();
+var _e = class {
+	constructor({ getFn: e = J.getFn, fieldNormWeight: t = J.fieldNormWeight } = {}) {
+		this.norm = ge(t, 3), this.getFn = e, this.isCreated = !1, this.docs = [], this.keys = [], this._keysMap = {}, this.setIndexRecords();
 	}
 	setSources(e = []) {
 		this.docs = e;
@@ -878,7 +880,7 @@ var ye = class {
 		});
 	}
 	create() {
-		this.isCreated || !this.docs.length || (this.isCreated = !0, L(this.docs[0]) ? this.docs.forEach((e, t) => {
+		this.isCreated || !this.docs.length || (this.isCreated = !0, R(this.docs[0]) ? this.docs.forEach((e, t) => {
 			this._addString(e, t);
 		}) : this.docs.forEach((e, t) => {
 			this._addObject(e, t);
@@ -886,7 +888,7 @@ var ye = class {
 	}
 	add(e) {
 		let t = this.size();
-		L(e) ? this._addString(e, t) : this._addObject(e, t);
+		R(e) ? this._addString(e, t) : this._addObject(e, t);
 	}
 	removeAt(e) {
 		this.records.splice(e, 1);
@@ -903,7 +905,7 @@ var ye = class {
 		return this.records.length;
 	}
 	_addString(e, t) {
-		if (!B(e) || V(e)) return;
+		if (!H(e) || U(e)) return;
 		let n = {
 			v: e,
 			i: t,
@@ -918,14 +920,14 @@ var ye = class {
 		};
 		this.keys.forEach((t, r) => {
 			let i = t.getFn ? t.getFn(e) : this.getFn(e, t.path);
-			if (B(i)) {
-				if (P(i)) {
+			if (H(i)) {
+				if (F(i)) {
 					let e = [];
 					for (let t = 0, n = i.length; t < n; t += 1) {
 						let n = i[t];
-						if (B(n)) {
-							if (L(n)) {
-								if (!V(n)) {
+						if (H(n)) {
+							if (R(n)) {
+								if (!U(n)) {
 									let r = {
 										v: n,
 										i: t,
@@ -933,9 +935,9 @@ var ye = class {
 									};
 									e.push(r);
 								}
-							} else if (B(n.v)) {
-								let t = L(n.v) ? n.v : I(n.v);
-								if (!V(t)) {
+							} else if (H(n.v)) {
+								let t = R(n.v) ? n.v : L(n.v);
+								if (!U(t)) {
 									let r = {
 										v: t,
 										i: n.i,
@@ -947,7 +949,7 @@ var ye = class {
 						}
 					}
 					n.$[r] = e;
-				} else if (L(i) && !V(i)) {
+				} else if (R(i) && !U(i)) {
 					let e = {
 						v: i,
 						n: this.norm.get(i)
@@ -964,21 +966,21 @@ var ye = class {
 		};
 	}
 };
-function be(e, t, { getFn: n = K.getFn, fieldNormWeight: r = K.fieldNormWeight } = {}) {
-	let i = new ye({
+function ve(e, t, { getFn: n = J.getFn, fieldNormWeight: r = J.fieldNormWeight } = {}) {
+	let i = new _e({
 		getFn: n,
 		fieldNormWeight: r
 	});
-	return i.setKeys(e.map(le)), i.setSources(t), i.create(), i;
+	return i.setKeys(e.map(se)), i.setSources(t), i.create(), i;
 }
-function xe(e, { getFn: t = K.getFn, fieldNormWeight: n = K.fieldNormWeight } = {}) {
-	let { keys: r, records: i } = e, a = new ye({
+function ye(e, { getFn: t = J.getFn, fieldNormWeight: n = J.fieldNormWeight } = {}) {
+	let { keys: r, records: i } = e, a = new _e({
 		getFn: t,
 		fieldNormWeight: n
 	});
 	return a.setKeys(r), a.setIndexRecords(i), a;
 }
-function Se(e = [], t = K.minMatchCharLength) {
+function be(e = [], t = J.minMatchCharLength) {
 	let n = [], r = -1, i = -1, a = 0;
 	for (let o = e.length; a < o; a += 1) {
 		let o = e[a];
@@ -986,9 +988,9 @@ function Se(e = [], t = K.minMatchCharLength) {
 	}
 	return e[a - 1] && a - r >= t && n.push([r, a - 1]), n;
 }
-var q = 32;
-function Ce(e, t, n, { location: r = K.location, distance: i = K.distance, threshold: a = K.threshold, findAllMatches: o = K.findAllMatches, minMatchCharLength: s = K.minMatchCharLength, includeMatches: c = K.includeMatches, ignoreLocation: l = K.ignoreLocation } = {}) {
-	if (t.length > q) throw Error(G(q));
+var Y = 32;
+function xe(e, t, n, { location: r = J.location, distance: i = J.distance, threshold: a = J.threshold, findAllMatches: o = J.findAllMatches, minMatchCharLength: s = J.minMatchCharLength, includeMatches: c = J.includeMatches, ignoreLocation: l = J.ignoreLocation } = {}) {
+	if (t.length > Y) throw Error(K(Y));
 	let u = t.length, d = e.length, f = Math.max(0, Math.min(r, d)), p = a, m = f, h = (e, t) => {
 		let n = e / u;
 		if (l) return n;
@@ -1025,12 +1027,12 @@ function Ce(e, t, n, { location: r = K.location, distance: i = K.distance, thres
 		score: Math.max(.001, b)
 	};
 	if (g) {
-		let e = Se(_, s);
+		let e = be(_, s);
 		e.length ? c && (C.indices = e) : C.isMatch = !1;
 	}
 	return C;
 }
-function we(e) {
+function Se(e) {
 	let t = {};
 	for (let n = 0, r = e.length; n < r; n += 1) {
 		let i = e.charAt(n);
@@ -1038,7 +1040,7 @@ function we(e) {
 	}
 	return t;
 }
-function Te(e) {
+function Ce(e) {
 	if (e.length <= 1) return e;
 	e.sort((e, t) => e[0] - t[0] || e[1] - t[1]);
 	let t = [e[0]];
@@ -1048,7 +1050,7 @@ function Te(e) {
 	}
 	return t;
 }
-var Ee = {
+var we = {
 	ł: "l",
 	Ł: "L",
 	đ: "d",
@@ -1061,8 +1063,8 @@ var Ee = {
 	Ŧ: "T",
 	ı: "i",
 	ß: "ss"
-}, De = RegExp("[" + Object.keys(Ee).join("") + "]", "g"), J = 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, "").replace(De, (e) => Ee[e]) : (e) => e, Oe = class {
-	constructor(e, { location: t = K.location, threshold: n = K.threshold, distance: r = K.distance, includeMatches: i = K.includeMatches, findAllMatches: a = K.findAllMatches, minMatchCharLength: o = K.minMatchCharLength, isCaseSensitive: s = K.isCaseSensitive, ignoreDiacritics: c = K.ignoreDiacritics, ignoreLocation: l = K.ignoreLocation } = {}) {
+}, Te = RegExp("[" + Object.keys(we).join("") + "]", "g"), X = 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, "").replace(Te, (e) => we[e]) : (e) => e, Ee = class {
+	constructor(e, { location: t = J.location, threshold: n = J.threshold, distance: r = J.distance, includeMatches: i = J.includeMatches, findAllMatches: a = J.findAllMatches, minMatchCharLength: o = J.minMatchCharLength, isCaseSensitive: s = J.isCaseSensitive, ignoreDiacritics: c = J.ignoreDiacritics, ignoreLocation: l = J.ignoreLocation } = {}) {
 		if (this.options = {
 			location: t,
 			threshold: n,
@@ -1073,26 +1075,26 @@ var Ee = {
 			isCaseSensitive: s,
 			ignoreDiacritics: c,
 			ignoreLocation: l
-		}, e = s ? e : e.toLowerCase(), e = c ? J(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length) return;
+		}, e = s ? e : e.toLowerCase(), e = c ? X(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length) return;
 		let u = (e, t) => {
 			this.chunks.push({
 				pattern: e,
-				alphabet: we(e),
+				alphabet: Se(e),
 				startIndex: t
 			});
 		}, d = this.pattern.length;
-		if (d > q) {
-			let e = 0, t = d % q, n = d - t;
-			for (; e < n;) u(this.pattern.substr(e, q), e), e += q;
+		if (d > Y) {
+			let e = 0, t = d % Y, n = d - t;
+			for (; e < n;) u(this.pattern.substr(e, Y), e), e += Y;
 			if (t) {
-				let e = d - q;
+				let e = d - Y;
 				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 ? J(e) : e, this.pattern === e) {
+		if (e = t ? e : e.toLowerCase(), e = n ? X(e) : e, this.pattern === e) {
 			let t = {
 				isMatch: !0,
 				score: 0
@@ -1101,7 +1103,7 @@ var Ee = {
 		}
 		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 } = Ce(e, t, n, {
+			let { isMatch: m, score: h, indices: g } = xe(e, t, n, {
 				location: i + p,
 				distance: a,
 				threshold: o,
@@ -1116,17 +1118,17 @@ var Ee = {
 			isMatch: f,
 			score: f ? d / this.chunks.length : 1
 		};
-		return f && r && (p.indices = Te(u)), p;
+		return f && r && (p.indices = Ce(u)), p;
 	}
-}, Y = class {
+}, Z = class {
 	constructor(e) {
 		this.pattern = e;
 	}
 	static isMultiMatch(e) {
-		return ke(e, this.multiRegex);
+		return De(e, this.multiRegex);
 	}
 	static isSingleMatch(e) {
-		return ke(e, this.singleRegex);
+		return De(e, this.singleRegex);
 	}
 	search(e) {
 		return {
@@ -1135,11 +1137,11 @@ var Ee = {
 		};
 	}
 };
-function ke(e, t) {
+function De(e, t) {
 	let n = e.match(t);
 	return n ? n[1] : null;
 }
-var Ae = class extends Y {
+var Oe = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1160,7 +1162,7 @@ var Ae = class extends Y {
 			indices: [0, this.pattern.length - 1]
 		};
 	}
-}, je = class extends Y {
+}, ke = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1181,7 +1183,7 @@ var Ae = class extends Y {
 			indices: [0, e.length - 1]
 		};
 	}
-}, Me = class extends Y {
+}, Ae = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1202,7 +1204,7 @@ var Ae = class extends Y {
 			indices: [0, this.pattern.length - 1]
 		};
 	}
-}, Ne = class extends Y {
+}, je = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1223,7 +1225,7 @@ var Ae = class extends Y {
 			indices: [0, e.length - 1]
 		};
 	}
-}, Pe = class extends Y {
+}, Me = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1244,7 +1246,7 @@ var Ae = class extends Y {
 			indices: [e.length - this.pattern.length, e.length - 1]
 		};
 	}
-}, Fe = class extends Y {
+}, Ne = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1265,9 +1267,9 @@ var Ae = class extends Y {
 			indices: [0, e.length - 1]
 		};
 	}
-}, Ie = class extends Y {
-	constructor(e, { location: t = K.location, threshold: n = K.threshold, distance: r = K.distance, includeMatches: i = K.includeMatches, findAllMatches: a = K.findAllMatches, minMatchCharLength: o = K.minMatchCharLength, isCaseSensitive: s = K.isCaseSensitive, ignoreDiacritics: c = K.ignoreDiacritics, ignoreLocation: l = K.ignoreLocation } = {}) {
-		super(e), this._bitapSearch = new Oe(e, {
+}, Pe = class extends Z {
+	constructor(e, { location: t = J.location, threshold: n = J.threshold, distance: r = J.distance, includeMatches: i = J.includeMatches, findAllMatches: a = J.findAllMatches, minMatchCharLength: o = J.minMatchCharLength, isCaseSensitive: s = J.isCaseSensitive, ignoreDiacritics: c = J.ignoreDiacritics, ignoreLocation: l = J.ignoreLocation } = {}) {
+		super(e), this._bitapSearch = new Ee(e, {
 			location: t,
 			threshold: n,
 			distance: r,
@@ -1291,7 +1293,7 @@ var Ae = class extends Y {
 	search(e) {
 		return this._bitapSearch.searchIn(e);
 	}
-}, Le = class extends Y {
+}, Fe = class extends Z {
 	constructor(e) {
 		super(e);
 	}
@@ -1314,17 +1316,17 @@ var Ae = class extends Y {
 			indices: r
 		};
 	}
-}, Re = [
-	Ae,
-	Le,
-	Me,
-	Ne,
+}, Ie = [
+	Oe,
 	Fe,
-	Pe,
+	Ae,
 	je,
-	Ie
-], ze = Re.length, Be = "\0", Ve = "|";
-function He(e) {
+	Ne,
+	Me,
+	ke,
+	Pe
+], Le = Ie.length, Re = "\0", ze = "|";
+function Be(e) {
 	let t = [], n = e.length, r = 0;
 	for (; r < n;) {
 		for (; r < n && e[r] === " ";) r++;
@@ -1354,17 +1356,17 @@ function He(e) {
 	}
 	return t;
 }
-function Ue(e, t = {}) {
-	return e.replace(/\\\|/g, Be).split(Ve).map((e) => {
-		let n = He(e.replace(/\u0000/g, "|").trim()).filter((e) => e && !!e.trim()), r = [];
+function Ve(e, t = {}) {
+	return e.replace(/\\\|/g, Re).split(ze).map((e) => {
+		let n = Be(e.replace(/\u0000/g, "|").trim()).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 < ze;) {
-				let e = Re[o], n = e.isMultiMatch(i);
+			for (; !a && ++o < Le;) {
+				let e = Ie[o], n = e.isMultiMatch(i);
 				n && (r.push(new e(n, t)), a = !0);
 			}
-			if (!a) for (o = -1; ++o < ze;) {
-				let e = Re[o], n = e.isSingleMatch(i);
+			if (!a) for (o = -1; ++o < Le;) {
+				let e = Ie[o], n = e.isSingleMatch(i);
 				if (n) {
 					r.push(new e(n, t));
 					break;
@@ -1374,8 +1376,8 @@ function Ue(e, t = {}) {
 		return r;
 	});
 }
-var We = new Set([Ie.type, Le.type]), Ge = class {
-	constructor(e, { isCaseSensitive: t = K.isCaseSensitive, ignoreDiacritics: n = K.ignoreDiacritics, includeMatches: r = K.includeMatches, minMatchCharLength: i = K.minMatchCharLength, ignoreLocation: a = K.ignoreLocation, findAllMatches: o = K.findAllMatches, location: s = K.location, threshold: c = K.threshold, distance: l = K.distance } = {}) {
+var He = new Set([Pe.type, Fe.type]), Ue = class {
+	constructor(e, { isCaseSensitive: t = J.isCaseSensitive, ignoreDiacritics: n = J.ignoreDiacritics, includeMatches: r = J.includeMatches, minMatchCharLength: i = J.minMatchCharLength, ignoreLocation: a = J.ignoreLocation, findAllMatches: o = J.findAllMatches, location: s = J.location, threshold: c = J.threshold, distance: l = J.distance } = {}) {
 		this.query = null, this.options = {
 			isCaseSensitive: t,
 			ignoreDiacritics: n,
@@ -1386,7 +1388,7 @@ var We = new Set([Ie.type, Le.type]), Ge = class {
 			location: s,
 			threshold: c,
 			distance: l
-		}, e = t ? e : e.toLowerCase(), e = n ? J(e) : e, this.pattern = e, this.query = Ue(this.pattern, this.options);
+		}, e = t ? e : e.toLowerCase(), e = n ? X(e) : e, this.pattern = e, this.query = Ve(this.pattern, this.options);
 	}
 	static condition(e, t) {
 		return t.useExtendedSearch;
@@ -1398,7 +1400,7 @@ var We = new Set([Ie.type, Le.type]), Ge = class {
 			score: 1
 		};
 		let { includeMatches: n, isCaseSensitive: r, ignoreDiacritics: i } = this.options;
-		e = r ? e : e.toLowerCase(), e = i ? J(e) : e;
+		e = r ? e : e.toLowerCase(), e = i ? X(e) : e;
 		let a = 0, o = [], s = 0, c = !1;
 		for (let r = 0, i = t.length; r < i; r += 1) {
 			let i = t[r];
@@ -1408,7 +1410,7 @@ var We = new Set([Ie.type, Le.type]), Ge = class {
 				if (l) {
 					a += 1, s += d;
 					let e = r.constructor.type;
-					e.startsWith("inverse") && (c = !0), n && (We.has(e) ? o.push(...u) : o.push(u));
+					e.startsWith("inverse") && (c = !0), n && (He.has(e) ? o.push(...u) : o.push(u));
 				} else {
 					s = 0, a = 0, o.length = 0, c = !1;
 					break;
@@ -1419,7 +1421,7 @@ var We = new Set([Ie.type, Le.type]), Ge = class {
 					isMatch: !0,
 					score: s / a
 				};
-				return c && (e.hasInverse = !0), n && (e.indices = Te(o)), e;
+				return c && (e.hasInverse = !0), n && (e.indices = Ce(o)), e;
 			}
 		}
 		return {
@@ -1427,43 +1429,43 @@ var We = new Set([Ie.type, Le.type]), Ge = class {
 			score: 1
 		};
 	}
-}, Ke = [];
-function qe(...e) {
-	Ke.push(...e);
+}, We = [];
+function Ge(...e) {
+	We.push(...e);
 }
-function X(e, t) {
-	for (let n = 0, r = Ke.length; n < r; n += 1) {
-		let r = Ke[n];
+function Ke(e, t) {
+	for (let n = 0, r = We.length; n < r; n += 1) {
+		let r = We[n];
 		if (r.condition(e, t)) return new r(e, t);
 	}
-	return new Oe(e, t);
+	return new Ee(e, t);
 }
-var Z = {
+var qe = {
 	AND: "$and",
 	OR: "$or"
 }, Je = {
 	PATH: "$path",
 	PATTERN: "$val"
-}, Ye = (e) => !!(e[Z.AND] || e[Z.OR]), Xe = (e) => !!e[Je.PATH], Ze = (e) => !P(e) && z(e) && !Ye(e), Qe = (e) => ({ [Z.AND]: Object.keys(e).map((t) => ({ [t]: e[t] })) });
+}, Ye = (e) => !!(e[qe.AND] || e[qe.OR]), Xe = (e) => !!e[Je.PATH], Ze = (e) => !F(e) && V(e) && !Ye(e), Qe = (e) => ({ [qe.AND]: Object.keys(e).map((t) => ({ [t]: e[t] })) });
 function $e(e, t, { auto: n = !0 } = {}) {
 	let r = (e) => {
-		if (L(e)) {
+		if (R(e)) {
 			let r = {
 				keyId: null,
 				pattern: e
 			};
-			return n && (r.searcher = X(e, t)), r;
+			return n && (r.searcher = Ke(e, t)), r;
 		}
 		let i = Object.keys(e), a = Xe(e);
 		if (!a && i.length > 1 && !Ye(e)) return r(Qe(e));
 		if (Ze(e)) {
 			let r = a ? e[Je.PATH] : i[0], o = a ? e[Je.PATTERN] : e[r];
-			if (!L(o)) throw Error(W(r));
+			if (!R(o)) throw Error(re(r));
 			let s = {
-				keyId: de(r),
+				keyId: le(r),
 				pattern: o
 			};
-			return n && (s.searcher = X(o, t)), s;
+			return n && (s.searcher = Ke(o, t)), s;
 		}
 		let o = {
 			children: [],
@@ -1471,21 +1473,21 @@ function $e(e, t, { auto: n = !0 } = {}) {
 		};
 		return i.forEach((t) => {
 			let n = e[t];
-			P(n) && n.forEach((e) => {
+			F(n) && n.forEach((e) => {
 				o.children.push(r(e));
 			});
 		}), o;
 	};
 	return Ye(e) || (e = Qe(e)), r(e);
 }
-function et(e, { ignoreFieldNorm: t = K.ignoreFieldNorm }) {
+function et(e, { ignoreFieldNorm: t = J.ignoreFieldNorm }) {
 	let n = 1;
 	return e.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));
 	}), n;
 }
-function tt(e, { ignoreFieldNorm: t = K.ignoreFieldNorm }) {
+function tt(e, { ignoreFieldNorm: t = J.ignoreFieldNorm }) {
 	e.forEach((e) => {
 		e.score = et(e.matches, { ignoreFieldNorm: t });
 	});
@@ -1529,8 +1531,8 @@ var nt = class {
 };
 function rt(e, t) {
 	let n = e.matches;
-	t.matches = [], B(n) && n.forEach((e) => {
-		if (!B(e.indices) || !e.indices.length) return;
+	t.matches = [], H(n) && n.forEach((e) => {
+		if (!H(e.indices) || !e.indices.length) return;
 		let { indices: n, value: r } = e, i = {
 			indices: n,
 			value: r
@@ -1541,7 +1543,7 @@ function rt(e, t) {
 function it(e, t) {
 	t.score = e.score;
 }
-function at(e, t, { includeMatches: n = K.includeMatches, includeScore: r = K.includeScore } = {}) {
+function at(e, t, { includeMatches: n = J.includeMatches, includeScore: r = J.includeScore } = {}) {
 	let i = [];
 	return n && i.push(rt), r && i.push(it), e.map((e) => {
 		let { idx: n } = e, r = {
@@ -1556,7 +1558,7 @@ function at(e, t, { includeMatches: n = K.includeMatches, includeScore: r = K.in
 var ot = /\b\w+\b/g;
 function st({ isCaseSensitive: e = !1, ignoreDiacritics: t = !1 } = {}) {
 	return { tokenize(n) {
-		return e || (n = n.toLowerCase()), t && (n = J(n)), n.match(ot) || [];
+		return e || (n = n.toLowerCase()), t && (n = X(n)), n.match(ot) || [];
 	} };
 }
 function ct(e, t, n) {
@@ -1632,21 +1634,21 @@ function ut(e, t) {
 var Q = class {
 	constructor(e, t, n) {
 		this.options = {
-			...K,
+			...J,
 			...t
-		}, this.options.useExtendedSearch, this.options.useTokenSearch, this._keyStore = new ce(this.options.keys), this._docs = e, this._myIndex = null, this._invertedIndex = null, this.setCollection(e, n), this._lastQuery = null, this._lastSearcher = null;
+		}, this.options.useExtendedSearch, this.options.useTokenSearch, this._keyStore = new oe(this.options.keys), this._docs = e, this._myIndex = null, this._invertedIndex = null, this.setCollection(e, n), this._lastQuery = null, this._lastSearcher = null;
 	}
 	_getSearcher(e) {
 		if (this._lastQuery === e) return this._lastSearcher;
-		let t = X(e, this._invertedIndex ? {
+		let t = Ke(e, this._invertedIndex ? {
 			...this.options,
 			_invertedIndex: this._invertedIndex
 		} : this.options);
 		return this._lastQuery = e, this._lastSearcher = t, t;
 	}
 	setCollection(e, t) {
-		if (this._docs = e, t && !(t instanceof ye)) throw Error(U);
-		if (this._myIndex = t || be(this.options.keys, this._docs, {
+		if (this._docs = e, t && !(t instanceof _e)) throw Error(G);
+		if (this._myIndex = t || ve(this.options.keys, this._docs, {
 			getFn: this.options.getFn,
 			fieldNormWeight: this.options.fieldNormWeight
 		}), this.options.useTokenSearch) {
@@ -1658,7 +1660,7 @@ var Q = class {
 		}
 	}
 	add(e) {
-		if (B(e) && (this._docs.push(e), this._myIndex.add(e), this._invertedIndex)) {
+		if (H(e) && (this._docs.push(e), this._myIndex.add(e), this._invertedIndex)) {
 			let e = this._myIndex.records[this._myIndex.records.length - 1], t = st({
 				isCaseSensitive: this.options.isCaseSensitive,
 				ignoreDiacritics: this.options.ignoreDiacritics
@@ -1686,24 +1688,24 @@ var Q = class {
 	}
 	search(e, t) {
 		let { limit: n = -1 } = t || {}, { includeMatches: r, includeScore: i, shouldSort: a, sortFn: o, ignoreFieldNorm: s } = this.options;
-		if (L(e) && !e.trim()) {
+		if (R(e) && !e.trim()) {
 			let e = this._docs.map((e, t) => ({
 				item: e,
 				refIndex: t
 			}));
-			return R(n) && n > -1 && (e = e.slice(0, n)), e;
+			return z(n) && n > -1 && (e = e.slice(0, n)), e;
 		}
-		let c = R(n) && n > 0 && L(e), l;
+		let c = z(n) && n > 0 && R(e), l;
 		if (c) {
 			let t = new nt(n);
-			L(this._docs[0]) ? this._searchStringList(e, {
+			R(this._docs[0]) ? this._searchStringList(e, {
 				heap: t,
 				ignoreFieldNorm: s
 			}) : this._searchObjectList(e, {
 				heap: t,
 				ignoreFieldNorm: s
 			}), l = t.extractSorted(o);
-		} else l = L(e) ? L(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e), tt(l, { ignoreFieldNorm: s }), a && l.sort(o), R(n) && n > -1 && (l = l.slice(0, n));
+		} else l = R(e) ? R(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e), tt(l, { ignoreFieldNorm: s }), a && l.sort(o), z(n) && n > -1 && (l = l.slice(0, n));
 		return at(l, this._docs, {
 			includeMatches: r,
 			includeScore: i
@@ -1712,7 +1714,7 @@ var Q = class {
 	_searchStringList(e, { heap: t, ignoreFieldNorm: n } = {}) {
 		let r = this._getSearcher(e), { records: i } = this._myIndex, a = t ? null : [];
 		return i.forEach(({ v: e, i, n: o }) => {
-			if (!B(e)) return;
+			if (!H(e)) return;
 			let { isMatch: s, score: c, indices: l } = r.searchIn(e);
 			if (s) {
 				let r = {
@@ -1753,12 +1755,12 @@ var Q = class {
 			for (let e = 0, s = i.length; e < s; e += 1) {
 				let s = i[e], c = n(s, t, r);
 				if (c.length) o.push(...c);
-				else if (a === Z.AND) return [];
+				else if (a === qe.AND) return [];
 			}
 			return o;
 		}, r = this._myIndex.records, i = /* @__PURE__ */ new Map(), a = [];
 		return r.forEach(({ $: e, i: r }) => {
-			if (B(e)) {
+			if (H(e)) {
 				let o = n(t, e, r);
 				o.length && (i.has(r) || (i.set(r, {
 					idx: r,
@@ -1773,7 +1775,7 @@ var Q = class {
 	_searchObjectList(e, { heap: t, ignoreFieldNorm: n } = {}) {
 		let r = this._getSearcher(e), { keys: i, records: a } = this._myIndex, o = t ? null : [];
 		return a.forEach(({ $: e, i: a }) => {
-			if (!B(e)) return;
+			if (!H(e)) return;
 			let s = [], c = !1, l = !1;
 			if (i.forEach((t, n) => {
 				let i = this._findMatches({
@@ -1793,10 +1795,10 @@ var Q = class {
 		}), o;
 	}
 	_findMatches({ key: e, value: t, searcher: n }) {
-		if (!B(t)) return [];
+		if (!H(t)) return [];
 		let r = [];
-		if (P(t)) t.forEach(({ v: t, i, n: a }) => {
-			if (!B(t)) return;
+		if (F(t)) t.forEach(({ v: t, i, n: a }) => {
+			if (!H(t)) return;
 			let { isMatch: o, score: s, indices: c, hasInverse: l } = n.searchIn(t);
 			o && r.push({
 				score: s,
@@ -1833,7 +1835,7 @@ var Q = class {
 		let n = this.analyzer.tokenize(e), { df: r, fieldCount: i } = t._invertedIndex;
 		this.termSearchers = [], this.idfWeights = [];
 		for (let e of n) {
-			this.termSearchers.push(new Oe(e, {
+			this.termSearchers.push(new Ee(e, {
 				location: t.location,
 				threshold: t.threshold,
 				distance: t.distance,
@@ -1866,30 +1868,41 @@ var Q = class {
 			isMatch: !0,
 			score: Math.max(.001, a)
 		};
-		return this.options.includeMatches && t.length && (o.indices = Te(t)), o;
+		return this.options.includeMatches && t.length && (o.indices = Ce(t)), o;
 	}
 };
-Q.version = "7.3.0", Q.createIndex = be, Q.parseIndex = xe, Q.config = K, Q.match = function(e, t, n) {
-	return X(e, {
-		...K,
+Q.version = "7.3.0", Q.createIndex = ve, Q.parseIndex = ye, Q.config = J, Q.match = function(e, t, n) {
+	return Ke(e, {
+		...J,
 		...n
 	}).searchIn(t);
-}, Q.parseQuery = $e, qe(Ge), qe(dt), Q.use = function(...e) {
-	e.forEach((e) => qe(e));
+}, Q.parseQuery = $e, Ge(Ue), Ge(dt), Q.use = function(...e) {
+	e.forEach((e) => Ge(e));
 };
 //#endregion
 //#region src/hooks/useCommands.js
-var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.toLowerCase()]: n }), {}) : {}, (n) => {
-	let r = new Q(Object.keys(e), {
+var ft = (e, t = .4) => {
+	let n = i(() => e ? Object.entries(e).reduce((e, [t, n]) => ({
+		...e,
+		[t.toLowerCase()]: n
+	}), {}) : {}, [e]), r = i(() => Object.keys(n), [n]), a = i(() => r.some((e) => e.includes(" ")), [r]), o = i(() => a ? new Q(r, {
 		includeScore: !0,
 		ignoreLocation: !0
-	}).search(n).filter((e) => e.score < t);
-	if (r?.length) {
-		let t = r[0].item.toLowerCase();
-		return e[t]?.(n);
-	}
-	return null;
-}), pt = /* @__PURE__ */ s(((e) => {
+	}) : null, [a, r]);
+	return (e) => {
+		if (!r.length) return null;
+		if (!a) {
+			let t = e.trim().split(/\s+/), r = t.length > 1 ? t : [e.trim()];
+			for (let e of r) {
+				let t = e.toLowerCase();
+				if (t in n) return n[t]?.(e);
+			}
+			return null;
+		}
+		let i = o.search(e).filter((e) => e.score < t);
+		return i?.length ? n[i[0].item.toLowerCase()]?.(e) : null;
+	};
+}, pt = /* @__PURE__ */ s(((e) => {
 	var t = Symbol.for("react.transitional.element"), n = Symbol.for("react.fragment");
 	function r(e, n, r) {
 		var i = null;
@@ -1908,7 +1921,7 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 	process.env.NODE_ENV !== "production" && (function() {
 		function t(e) {
 			if (e == null) return null;
-			if (typeof e == "function") return e.$$typeof === O ? null : e.displayName || e.name || null;
+			if (typeof e == "function") return e.$$typeof === k ? null : e.displayName || e.name || null;
 			if (typeof e == "string") return e;
 			switch (e) {
 				case v: return "Fragment";
@@ -1916,7 +1929,7 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 				case y: return "StrictMode";
 				case w: return "Suspense";
 				case T: return "SuspenseList";
-				case ee: return "Activity";
+				case O: return "Activity";
 			}
 			if (typeof e == "object") switch (typeof e.tag == "number" && console.error("Received an unexpected object in getComponentNameFromType(). This is likely a bug in React. Please file an issue."), e.$$typeof) {
 				case _: return "Portal";
@@ -1961,14 +1974,14 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 			}
 		}
 		function a() {
-			var e = k.A;
+			var e = A.A;
 			return e === null ? null : e.getOwner();
 		}
 		function o() {
 			return Error("react-stack-top-frame");
 		}
 		function s(e) {
-			if (A.call(e, "key")) {
+			if (j.call(e, "key")) {
 				var t = Object.getOwnPropertyDescriptor(e, "key").get;
 				if (t && t.isReactWarning) return !1;
 			}
@@ -1976,7 +1989,7 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 		}
 		function l(e, t) {
 			function n() {
-				te || (te = !0, console.error("%s: `key` is not a prop. Trying to access it will result in `undefined` being returned. If you need to access the same value within the child component, you should pass it as a different prop. (https://react.dev/link/special-props)", t));
+				ee || (ee = !0, console.error("%s: `key` is not a prop. Trying to access it will result in `undefined` being returned. If you need to access the same value within the child component, you should pass it as a different prop. (https://react.dev/link/special-props)", t));
 			}
 			n.isReactWarning = !0, Object.defineProperty(e, "key", {
 				get: n,
@@ -1985,7 +1998,7 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 		}
 		function u() {
 			var e = t(this.type);
-			return N[e] || (N[e] = !0, console.error("Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release.")), e = this.props.ref, e === void 0 ? null : e;
+			return P[e] || (P[e] = !0, console.error("Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release.")), e = this.props.ref, e === void 0 ? null : e;
 		}
 		function d(e, t, n, r, i, a) {
 			var o = n.ref;
@@ -2025,17 +2038,17 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 		}
 		function f(e, n, i, o, c, u) {
 			var f = n.children;
-			if (f !== void 0) if (o) if (j(f)) {
+			if (f !== void 0) if (o) if (M(f)) {
 				for (o = 0; o < f.length; o++) p(f[o]);
 				Object.freeze && Object.freeze(f);
 			} else console.error("React.jsx: Static children should always be an array. You are likely explicitly calling React.jsxs or React.jsxDEV. Use the Babel transform instead.");
 			else p(f);
-			if (A.call(n, "key")) {
+			if (j.call(n, "key")) {
 				f = t(e);
 				var m = Object.keys(n).filter(function(e) {
 					return e !== "key";
 				});
-				o = 0 < m.length ? "{key: someKey, " + m.join(": ..., ") + ": ...}" : "{key: someKey}", F[f + o] || (m = 0 < m.length ? "{" + m.join(": ..., ") + ": ...}" : "{}", console.error("A props object containing a \"key\" prop is being spread into JSX:\n  let props = %s;\n  <%s {...props} />\nReact keys must be passed directly to JSX without using spread:\n  let props = %s;\n  <%s key={someKey} {...props} />", o, f, m, f), F[f + o] = !0);
+				o = 0 < m.length ? "{key: someKey, " + m.join(": ..., ") + ": ...}" : "{key: someKey}", I[f + o] || (m = 0 < m.length ? "{" + m.join(": ..., ") + ": ...}" : "{}", console.error("A props object containing a \"key\" prop is being spread into JSX:\n  let props = %s;\n  <%s {...props} />\nReact keys must be passed directly to JSX without using spread:\n  let props = %s;\n  <%s key={someKey} {...props} />", o, f, m, f), I[f + o] = !0);
 			}
 			if (f = null, i !== void 0 && (r(i), f = "" + i), s(n) && (r(n.key), f = "" + n.key), "key" in n) for (var h in i = {}, n) h !== "key" && (i[h] = n[h]);
 			else i = n;
@@ -2047,19 +2060,19 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 		function m(e) {
 			return typeof e == "object" && !!e && e.$$typeof === g;
 		}
-		var h = c("react"), g = Symbol.for("react.transitional.element"), _ = Symbol.for("react.portal"), v = Symbol.for("react.fragment"), y = Symbol.for("react.strict_mode"), b = Symbol.for("react.profiler"), x = Symbol.for("react.consumer"), S = Symbol.for("react.context"), C = Symbol.for("react.forward_ref"), w = Symbol.for("react.suspense"), T = Symbol.for("react.suspense_list"), E = Symbol.for("react.memo"), D = Symbol.for("react.lazy"), ee = Symbol.for("react.activity"), O = Symbol.for("react.client.reference"), k = h.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, A = Object.prototype.hasOwnProperty, j = Array.isArray, M = console.createTask ? console.createTask : function() {
+		var h = c("react"), g = Symbol.for("react.transitional.element"), _ = Symbol.for("react.portal"), v = Symbol.for("react.fragment"), y = Symbol.for("react.strict_mode"), b = Symbol.for("react.profiler"), x = Symbol.for("react.consumer"), S = Symbol.for("react.context"), C = Symbol.for("react.forward_ref"), w = Symbol.for("react.suspense"), T = Symbol.for("react.suspense_list"), E = Symbol.for("react.memo"), D = Symbol.for("react.lazy"), O = Symbol.for("react.activity"), k = Symbol.for("react.client.reference"), A = h.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, j = Object.prototype.hasOwnProperty, M = Array.isArray, N = console.createTask ? console.createTask : function() {
 			return null;
 		};
 		h = { react_stack_bottom_frame: function(e) {
 			return e();
 		} };
-		var te, N = {}, ne = h.react_stack_bottom_frame.bind(h, o)(), P = M(i(o)), F = {};
+		var ee, P = {}, te = h.react_stack_bottom_frame.bind(h, o)(), F = N(i(o)), I = {};
 		e.Fragment = v, e.jsx = function(e, t, n) {
-			var r = 1e4 > k.recentlyCreatedOwnerStacks++;
-			return f(e, t, n, !1, r ? Error("react-stack-top-frame") : ne, r ? M(i(e)) : P);
+			var r = 1e4 > A.recentlyCreatedOwnerStacks++;
+			return f(e, t, n, !1, r ? Error("react-stack-top-frame") : te, r ? N(i(e)) : F);
 		}, e.jsxs = function(e, t, n) {
-			var r = 1e4 > k.recentlyCreatedOwnerStacks++;
-			return f(e, t, n, !0, r ? Error("react-stack-top-frame") : ne, r ? M(i(e)) : P);
+			var r = 1e4 > A.recentlyCreatedOwnerStacks++;
+			return f(e, t, n, !0, r ? Error("react-stack-top-frame") : te, r ? N(i(e)) : F);
 		};
 	})();
 })), $ = (/* @__PURE__ */ s(((e, t) => {
@@ -2081,113 +2094,121 @@ var ft = (e, t = .4) => (e = e ? Object.entries(e)?.reduce((e, [t, n]) => ({ [t.
 		cy: "4",
 		r: "4"
 	})] })
-}), gt = ({ children: r, commands: s = null, lang: c = "en-US", grammars: l = null, timeout: u = 3e3, ariaLabel: d = "start recognition", style: f = null, className: p = null, outlineStyle: m = "2px solid", onStart: h = null, onEnd: g = null, onSpeechStart: _ = null, onSpeechEnd: v = null, onResult: y = null, onError: b = null, onNoMatch: x = null, __rsInstance: S }) => {
-	let C = a(null), [w, T] = o(!1), [, { start: E, stop: D, subscribe: ee, unsubscribe: O }] = N(c, l, S), k = ft(s), A = a({});
-	A.current = {
-		onStart: h,
-		onEnd: g,
-		onSpeechStart: _,
-		onSpeechEnd: v,
-		onResult: y,
-		onError: b,
-		onNoMatch: x
+}), gt = (e, t) => {
+	for (let { alternatives: n } of e) for (let e of n) if (t(e) !== null) return;
+}, _t = ({ children: r, commands: s = null, lang: c = "en-US", grammars: l = null, timeout: u = 3e3, precision: d = .4, maxAlternatives: f = 1, ariaLabel: p = "start recognition", style: m = null, className: h = null, outlineStyle: g = "2px solid", onStart: _ = null, onEnd: v = null, onSpeechStart: y = null, onSpeechEnd: b = null, onResult: x = null, onError: S = null, onNoMatch: C = null, __rsInstance: w }) => {
+	let T = a(null), [E, D] = o(!1), [, { start: O, stop: k, subscribe: A, unsubscribe: j }] = P(c, l, f, w), M = ft(s, d), F = a({});
+	F.current = {
+		onStart: _,
+		onEnd: v,
+		onSpeechStart: y,
+		onSpeechEnd: b,
+		onResult: x,
+		onError: S,
+		onNoMatch: C
 	};
-	let j = a(k);
-	j.current = k;
-	let P = a(null), F = a(null), [I, L] = ne(n(() => F.current?.(), []), u), R = n(() => {
+	let I = a(M);
+	I.current = M;
+	let L = a(null), R = a(null), [z, B] = te(n(() => R.current?.(), []), u), V = n(() => {
 		try {
-			T(!1), D();
+			D(!1), k();
 		} catch (e) {
-			A.current.onError?.(e);
-		} finally {
-			P.current?.();
+			F.current.onError?.(e), L.current?.();
 		}
-	}, [D]), re = n((e) => {
-		I(), A.current.onStart?.(e);
-	}, [I]), z = n((e) => {
-		L(), A.current.onSpeechStart?.(e);
-	}, [L]), ie = n((e) => {
-		I(), A.current.onSpeechEnd?.(e);
-	}, [I]), B = n((e) => {
+	}, [k]), ne = n((e) => {
+		z(), F.current.onStart?.(e);
+	}, [z]), H = n((e) => {
+		B(), F.current.onSpeechStart?.(e);
+	}, [B]), U = n((e) => {
+		z(), F.current.onSpeechEnd?.(e);
+	}, [z]), W = n((e) => {
 		let t = Array.from(e?.results ?? [], (e) => {
 			let t = {
 				confidence: -Infinity,
 				transcript: ""
-			};
-			for (let n = 0; n < e.length; n++) {
-				let r = e[n];
-				(r.confidence === void 0 || r.confidence > t.confidence) && (t = r);
+			}, n = [];
+			for (let r = 0; r < e.length; r++) {
+				let i = e[r];
+				n.push(i.transcript ?? ""), (i.confidence === void 0 || i.confidence > t.confidence) && (t = i);
 			}
-			return t.transcript ?? "";
-		}).join("");
-		L(), R(), j.current(t), A.current.onResult?.(t, e);
-	}, [L, R]), V = n((e) => {
-		R(), A.current.onError?.(e);
-	}, [R]), H = n((e) => {
-		L(), R(), A.current.onNoMatch?.(e);
-	}, [L, R]), U = n((e) => {
-		L(), R(), A.current.onEnd?.(e);
-	}, [L, R]);
-	F.current = U;
-	let W = i(() => ({
-		start: re,
-		end: U,
-		speechstart: z,
-		speechend: ie,
-		result: B,
-		error: V,
-		nomatch: H
+			return {
+				best: t.transcript ?? "",
+				alternatives: n
+			};
+		}), n = t.map((e) => e.best).join("");
+		B(), V(), gt(t, I.current), F.current.onResult?.(n, e);
+	}, [B, V]), G = n((e) => {
+		V(), F.current.onError?.(e);
+	}, [V]), re = n((e) => {
+		B(), V(), F.current.onNoMatch?.(e);
+	}, [B, V]), K = n((e) => {
+		B();
+		try {
+			V(), L.current?.();
+		} finally {
+			F.current.onEnd?.(e);
+		}
+	}, [B, V]);
+	R.current = K;
+	let q = i(() => ({
+		start: ne,
+		end: K,
+		speechstart: H,
+		speechend: U,
+		result: W,
+		error: G,
+		nomatch: re
 	}), [
-		re,
+		ne,
+		K,
+		H,
 		U,
-		z,
-		ie,
-		B,
-		V,
-		H
+		W,
+		G,
+		re
 	]);
-	P.current = () => Object.entries(W).forEach(([e, t]) => O?.(e, t));
-	let G = n(() => {
+	L.current = () => Object.entries(q).forEach(([e, t]) => j?.(e, t));
+	let ie = n(() => {
 		try {
-			T(!0), Object.entries(W).forEach(([e, t]) => ee(e, t)), E();
+			D(!0), Object.entries(q).forEach(([e, t]) => A(e, t)), O();
 		} catch (e) {
-			V(e);
+			G(e);
 		}
 	}, [
-		W,
-		ee,
-		E,
-		V
+		q,
+		A,
+		O,
+		G
 	]), ae = () => {
-		!p && m && (C.current.style.outline = m);
+		!h && g && (T.current.style.outline = g);
 	}, oe = () => {
-		!p && m && (C.current.style.outline = "none");
+		!h && g && (T.current.style.outline = "none");
 	};
-	return M.isSupported ? te(r) ? r(G, R, w) : t(r) ? e(r, { ...!w && { onClick: G } }) : /* @__PURE__ */ (0, $.jsx)("button", {
+	return N.isSupported ? ee(r) ? r(ie, V, E) : t(r) ? e(r, { ...!E && { onClick: ie } }) : /* @__PURE__ */ (0, $.jsx)("button", {
 		"data-testid": "__vocal-root__",
-		ref: C,
+		ref: T,
 		role: "button",
-		"aria-label": d,
-		style: p ? null : {
+		"aria-label": p,
+		style: h ? null : {
 			width: 24,
 			height: 24,
 			backgroundColor: "transparent",
 			border: "none",
 			padding: 0,
-			cursor: w ? "default" : "pointer",
-			...f
+			cursor: E ? "default" : "pointer",
+			...m
 		},
-		className: p,
+		className: h,
 		onFocus: ae,
 		onBlur: oe,
-		onClick: G,
+		onClick: ie,
 		children: /* @__PURE__ */ (0, $.jsx)(ht, {
-			isActive: w,
+			isActive: E,
 			color: "#aaa"
 		})
 	}) : null;
-}, _t = M.isSupported, vt = gt;
+}, vt = N.isSupported, yt = _t;
 //#endregion
-export { vt as default, _t as isSupported, N as useVocal };
+export { yt as default, vt as isSupported, P as useVocal };
 
 //# sourceMappingURL=index.es.js.map