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

package/dist/index.es.js

@@ -672,7 +672,7 @@ x(N, "defaultOptions", {
 });
 //#endregion
 //#region node_modules/@untemps/utils/dist/function/isFunction.js
-var ee = (e) => typeof e == "function", P = (e = "en-US", t = null, i = 1, o = null) => {
+var P = (e) => typeof e == "function", F = (e = "en-US", t = null, i = 1, o = null) => {
 	let s = a(null);
 	return r(() => {
 		if (N.isSupported) return s.current = o || new N({
@@ -707,7 +707,7 @@ var ee = (e) => typeof e == "function", P = (e = "en-US", t = null, i = 1, o = n
 			s.current && s.current.cleanup();
 		}, [])
 	}];
-}, te = (e, t = 0) => {
+}, I = (e, t = 0) => {
 	let i = a(-1), o = n(() => {
 		clearTimeout(i.current), i.current = -1;
 	}, []), s = n(() => {
@@ -718,1180 +718,27 @@ var ee = (e) => typeof e == "function", P = (e = "en-US", t = null, i = 1, o = n
 		o
 	]);
 	return r(() => o, [o]), [s, o];
-};
-//#endregion
-//#region node_modules/fuse.js/dist/fuse.mjs
-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 L(e) {
-	return e == null ? "" : I(e);
-}
-function R(e) {
-	return typeof e == "string";
-}
-function z(e) {
-	return typeof e == "number";
-}
-function B(e) {
-	return e === !0 || e === !1 || ne(e) && W(e) == "[object Boolean]";
-}
-function V(e) {
-	return typeof e == "object";
-}
-function ne(e) {
-	return V(e) && e !== null;
-}
-function H(e) {
-	return e != null;
-}
-function U(e) {
-	return !e.trim().length;
-}
-function W(e) {
-	return e == null ? e === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(e);
-}
-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 = se(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 se(e) {
-	let t = null, n = null, r = null, i = 1, a = null;
-	if (R(e) || F(e)) r = e, t = ce(e), n = le(e);
-	else {
-		if (!ae.call(e, "name")) throw Error(q("name"));
-		let o = e.name;
-		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,
-		id: n,
-		weight: i,
-		src: r,
-		getFn: a
-	};
-}
-function ce(e) {
-	return F(e) ? e : e.split(".");
-}
-function le(e) {
-	return F(e) ? e.join(".") : e;
-}
-function ue(e, t) {
-	let n = [], r = !1, i = (e, t, a, o) => {
-		if (H(e)) if (!t[a]) n.push(o === void 0 ? e : {
-			v: e,
-			i: o
-		});
-		else {
-			let s = e[t[a]];
-			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 (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, R(t) ? t.split(".") : t, 0), r ? n : n[0];
-}
-var de = {
-	includeMatches: !1,
-	findAllMatches: !1,
-	minMatchCharLength: 1
-}, 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
-}, pe = {
-	location: 0,
-	threshold: .6,
-	distance: 100
-}, me = {
-	useExtendedSearch: !1,
-	useTokenSearch: !1,
-	getFn: ue,
-	ignoreLocation: !1,
-	ignoreFieldNorm: !1,
-	fieldNormWeight: 1
-}, J = Object.freeze({
-	...fe,
-	...de,
-	...pe,
-	...me
-}), he = /[^ ]+/g;
-function ge(e = 1, t = 3) {
-	let n = /* @__PURE__ */ new Map(), r = 10 ** t;
-	return {
-		get(t) {
-			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;
-		},
-		clear() {
-			n.clear();
-		}
-	};
-}
-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;
-	}
-	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, R(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();
-		R(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;
-	}
-	removeAll(e) {
-		for (let t = e.length - 1; t >= 0; --t) this.records.splice(e[t], 1);
-		for (let e = 0, t = this.records.length; e < t; e += 1) this.records[e].i = e;
-	}
-	getValueForItemAtKeyId(e, t) {
-		return e[this._keysMap[t]];
-	}
-	size() {
-		return this.records.length;
-	}
-	_addString(e, t) {
-		if (!H(e) || U(e)) return;
-		let n = {
-			v: e,
-			i: t,
-			n: this.norm.get(e)
-		};
-		this.records.push(n);
-	}
-	_addObject(e, t) {
-		let n = {
-			i: t,
-			$: {}
-		};
-		this.keys.forEach((t, r) => {
-			let i = t.getFn ? t.getFn(e) : this.getFn(e, t.path);
-			if (H(i)) {
-				if (F(i)) {
-					let e = [];
-					for (let t = 0, n = i.length; t < n; t += 1) {
-						let n = i[t];
-						if (H(n)) {
-							if (R(n)) {
-								if (!U(n)) {
-									let r = {
-										v: n,
-										i: t,
-										n: this.norm.get(n)
-									};
-									e.push(r);
-								}
-							} 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,
-										n: this.norm.get(t)
-									};
-									e.push(r);
-								}
-							}
-						}
-					}
-					n.$[r] = e;
-				} else if (R(i) && !U(i)) {
-					let e = {
-						v: i,
-						n: this.norm.get(i)
-					};
-					n.$[r] = e;
-				}
-			}
-		}), this.records.push(n);
-	}
-	toJSON() {
-		return {
-			keys: this.keys.map(({ getFn: e, ...t }) => t),
-			records: this.records
-		};
-	}
-};
-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(se)), i.setSources(t), i.create(), i;
-}
-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 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];
-		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 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;
-		let r = Math.abs(f - t);
-		return i ? n + r / i : r ? 1 : n;
-	}, g = s > 1 || c, _ = g ? Array(d) : [], v;
-	for (; (v = e.indexOf(t, m)) > -1;) {
-		let e = h(0, v);
-		if (p = Math.min(e, p), m = v + u, g) {
-			let e = 0;
-			for (; e < u;) _[v + e] = 1, e += 1;
-		}
-	}
-	m = -1;
-	let y = [], b = 1, x = u + d, S = 1 << u - 1;
-	for (let t = 0; t < u; t += 1) {
-		let r = 0, i = x;
-		for (; r < i;) h(t, f + i) <= p ? r = i : x = i, i = Math.floor((x - r) / 2 + r);
-		x = i;
-		let a = Math.max(1, f - i + 1), s = o ? d : Math.min(f + i, d) + u, c = Array(s + 2);
-		c[s + 1] = (1 << t) - 1;
-		for (let r = s; r >= a; --r) {
-			let i = r - 1, o = n[e[i]];
-			if (g && (_[i] = +!!o), c[r] = (c[r + 1] << 1 | 1) & o, t && (c[r] |= (y[r + 1] | y[r]) << 1 | 1 | y[r + 1]), c[r] & S && (b = h(t, i), b <= p)) {
-				if (p = b, m = i, m <= f) break;
-				a = Math.max(1, 2 * f - m);
-			}
-		}
-		if (h(t + 1, f) > p) break;
-		y = c;
-	}
-	let C = {
-		isMatch: m >= 0,
-		score: Math.max(.001, b)
-	};
-	if (g) {
-		let e = be(_, s);
-		e.length ? c && (C.indices = e) : C.isMatch = !1;
-	}
-	return C;
-}
-function Se(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;
-}
-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]];
-	for (let n = 1, r = e.length; n < r; n += 1) {
-		let r = t[t.length - 1], i = e[n];
-		i[0] <= r[1] + 1 ? r[1] = Math.max(r[1], i[1]) : t.push(i);
-	}
-	return t;
-}
-var we = {
-	ł: "l",
-	Ł: "L",
-	đ: "d",
-	Đ: "D",
-	ø: "o",
-	Ø: "O",
-	ħ: "h",
-	Ħ: "H",
-	ŧ: "t",
-	Ŧ: "T",
-	ı: "i",
-	ß: "ss"
-}, 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,
-			distance: r,
-			includeMatches: i,
-			findAllMatches: a,
-			minMatchCharLength: o,
-			isCaseSensitive: s,
-			ignoreDiacritics: c,
-			ignoreLocation: l
-		}, 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: Se(e),
-				startIndex: t
-			});
-		}, d = this.pattern.length;
-		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 - 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 ? X(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 } = xe(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.push(...g);
-		});
-		let p = {
-			isMatch: f,
-			score: f ? d / this.chunks.length : 1
-		};
-		return f && r && (p.indices = Ce(u)), p;
-	}
-}, Z = class {
-	constructor(e) {
-		this.pattern = e;
-	}
-	static isMultiMatch(e) {
-		return De(e, this.multiRegex);
-	}
-	static isSingleMatch(e) {
-		return De(e, this.singleRegex);
-	}
-	search(e) {
-		return {
-			isMatch: !1,
-			score: 1
-		};
-	}
-};
-function De(e, t) {
-	let n = e.match(t);
-	return n ? n[1] : null;
-}
-var Oe = class extends Z {
-	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,
-			indices: [0, this.pattern.length - 1]
-		};
-	}
-}, ke = class extends Z {
-	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,
-			indices: [0, e.length - 1]
-		};
-	}
-}, Ae = class extends Z {
-	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,
-			indices: [0, this.pattern.length - 1]
-		};
-	}
-}, je = class extends Z {
-	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,
-			indices: [0, e.length - 1]
-		};
-	}
-}, Me = class extends Z {
-	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,
-			indices: [e.length - this.pattern.length, e.length - 1]
-		};
-	}
-}, Ne = class extends Z {
-	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,
-			indices: [0, e.length - 1]
-		};
-	}
-}, 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,
-			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);
-	}
-}, Fe = class extends Z {
-	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,
-			indices: r
-		};
-	}
-}, Ie = [
-	Oe,
-	Fe,
-	Ae,
-	je,
-	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++;
-		if (r >= n) break;
-		let i = r;
-		for (; i < n && e[i] !== " " && e[i] !== "\"";) i++;
-		if (i < n && e[i] === "\"") {
-			for (i++; i < n;) {
-				if (e[i] === "\"") {
-					let t = i + 1;
-					if (t >= n || e[t] === " ") {
-						i++;
-						break;
-					}
-					if (e[t] === "$" && (t + 1 >= n || e[t + 1] === " ")) {
-						i += 2;
-						break;
-					}
-				}
-				i++;
-			}
-			t.push(e.substring(r, i)), r = i;
-		} else {
-			for (; i < n && e[i] !== " ";) i++;
-			t.push(e.substring(r, i)), r = i;
-		}
-	}
-	return t;
-}
-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 < Le;) {
-				let e = Ie[o], n = e.isMultiMatch(i);
-				n && (r.push(new e(n, t)), a = !0);
-			}
-			if (!a) for (o = -1; ++o < Le;) {
-				let e = Ie[o], n = e.isSingleMatch(i);
-				if (n) {
-					r.push(new e(n, t));
-					break;
-				}
-			}
-		}
-		return r;
-	});
-}
-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,
-			includeMatches: r,
-			minMatchCharLength: i,
-			findAllMatches: o,
-			ignoreLocation: a,
-			location: s,
-			threshold: c,
-			distance: l
-		}, 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;
-	}
-	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 ? 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];
-			o.length = 0, a = 0, c = !1;
-			for (let t = 0, r = i.length; t < r; t += 1) {
-				let r = i[t], { isMatch: l, indices: u, score: d } = r.search(e);
-				if (l) {
-					a += 1, s += d;
-					let e = r.constructor.type;
-					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;
-				}
-			}
-			if (a) {
-				let e = {
-					isMatch: !0,
-					score: s / a
-				};
-				return c && (e.hasInverse = !0), n && (e.indices = Ce(o)), e;
-			}
-		}
-		return {
-			isMatch: !1,
-			score: 1
-		};
-	}
-}, We = [];
-function Ge(...e) {
-	We.push(...e);
-}
-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 Ee(e, t);
-}
-var qe = {
-	AND: "$and",
-	OR: "$or"
-}, Je = {
-	PATH: "$path",
-	PATTERN: "$val"
-}, 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 (R(e)) {
-			let r = {
-				keyId: null,
-				pattern: e
-			};
-			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 (!R(o)) throw Error(re(r));
-			let s = {
-				keyId: le(r),
-				pattern: o
-			};
-			return n && (s.searcher = Ke(o, t)), s;
-		}
-		let o = {
-			children: [],
-			operator: i[0]
-		};
-		return i.forEach((t) => {
-			let n = e[t];
-			F(n) && n.forEach((e) => {
-				o.children.push(r(e));
-			});
-		}), o;
-	};
-	return Ye(e) || (e = Qe(e)), r(e);
-}
-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 = J.ignoreFieldNorm }) {
-	e.forEach((e) => {
-		e.score = et(e.matches, { ignoreFieldNorm: t });
-	});
-}
-var nt = class {
-	constructor(e) {
-		this.limit = e, this.heap = [];
-	}
-	get size() {
-		return this.heap.length;
-	}
-	shouldInsert(e) {
-		return this.size < this.limit || e < this.heap[0].score;
-	}
-	insert(e) {
-		this.size < this.limit ? (this.heap.push(e), this._bubbleUp(this.size - 1)) : e.score < this.heap[0].score && (this.heap[0] = e, this._sinkDown(0));
-	}
-	extractSorted(e) {
-		return this.heap.sort(e);
-	}
-	_bubbleUp(e) {
-		let t = this.heap;
-		for (; e > 0;) {
-			let n = e - 1 >> 1;
-			if (t[e].score <= t[n].score) break;
-			let r = t[e];
-			t[e] = t[n], t[n] = r, e = n;
-		}
-	}
-	_sinkDown(e) {
-		let t = this.heap, n = t.length, r = e;
-		do {
-			e = r;
-			let i = 2 * e + 1, a = 2 * e + 2;
-			if (i < n && t[i].score > t[r].score && (r = i), a < n && t[a].score > t[r].score && (r = a), r !== e) {
-				let n = t[e];
-				t[e] = t[r], t[r] = n;
-			}
-		} while (r !== e);
-	}
-};
-function rt(e, t) {
-	let n = e.matches;
-	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
-		};
-		e.key && (i.key = e.key.src), e.idx > -1 && (i.refIndex = e.idx), t.matches.push(i);
-	});
-}
-function it(e, t) {
-	t.score = e.score;
-}
-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 = {
-			item: t[n],
-			refIndex: n
-		};
-		return i.length && i.forEach((t) => {
-			t(e, r);
-		}), r;
-	});
-}
-var ot = /\b\w+\b/g;
-function st({ isCaseSensitive: e = !1, ignoreDiacritics: t = !1 } = {}) {
-	return { tokenize(n) {
-		return e || (n = n.toLowerCase()), t && (n = X(n)), n.match(ot) || [];
-	} };
-}
-function ct(e, t, n) {
-	let r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = 0;
-	function o(e, t, o, s) {
-		let c = n.tokenize(e);
-		if (!c.length) return;
-		a++;
-		let l = /* @__PURE__ */ new Map();
-		for (let e of c) l.set(e, (l.get(e) || 0) + 1);
-		for (let [e, n] of l) {
-			let a = {
-				docIdx: t,
-				keyIdx: o,
-				subIdx: s,
-				tf: n
-			}, c = r.get(e);
-			c || (c = [], r.set(e, c)), c.push(a), i.set(e, (i.get(e) || 0) + 1);
-		}
-	}
-	for (let n of e) {
-		let { i: e, v: r, $: i } = n;
-		if (r !== void 0) {
-			o(r, e, -1, -1);
-			continue;
-		}
-		if (i) for (let n = 0; n < t; n++) {
-			let t = i[n];
-			if (t) if (Array.isArray(t)) for (let r of t) o(r.v, e, n, r.i ?? -1);
-			else o(t.v, e, n, -1);
-		}
-	}
-	return {
-		terms: r,
-		fieldCount: a,
-		df: i
-	};
-}
-function lt(e, t, n, r) {
-	let { i, v: a, $: o } = t;
-	function s(t, n, a) {
-		let o = r.tokenize(t);
-		if (!o.length) return;
-		e.fieldCount++;
-		let s = /* @__PURE__ */ new Map();
-		for (let e of o) s.set(e, (s.get(e) || 0) + 1);
-		for (let [t, r] of s) {
-			let o = {
-				docIdx: i,
-				keyIdx: n,
-				subIdx: a,
-				tf: r
-			}, s = e.terms.get(t);
-			s || (s = [], e.terms.set(t, s)), s.push(o), e.df.set(t, (e.df.get(t) || 0) + 1);
-		}
-	}
-	if (a !== void 0) {
-		s(a, -1, -1);
-		return;
-	}
-	if (o) for (let e = 0; e < n; e++) {
-		let t = o[e];
-		if (t) if (Array.isArray(t)) for (let n of t) s(n.v, e, n.i ?? -1);
-		else s(t.v, e, -1);
-	}
-}
-function ut(e, t) {
-	for (let [n, r] of e.terms) {
-		let i = r.filter((e) => e.docIdx !== t), a = r.length - i.length;
-		a > 0 && (e.fieldCount -= a, e.df.set(n, (e.df.get(n) || 0) - a), i.length === 0 ? (e.terms.delete(n), e.df.delete(n)) : e.terms.set(n, i));
-	}
-}
-var Q = class {
-	constructor(e, t, n) {
-		this.options = {
-			...J,
-			...t
-		}, 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 = 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 _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) {
-			let e = st({
-				isCaseSensitive: this.options.isCaseSensitive,
-				ignoreDiacritics: this.options.ignoreDiacritics
-			});
-			this._invertedIndex = ct(this._myIndex.records, this._myIndex.keys.length, e);
-		}
-	}
-	add(e) {
-		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
-			});
-			lt(this._invertedIndex, e, this._myIndex.keys.length, t);
-		}
-	}
-	remove(e = () => !1) {
-		let t = [], n = [];
-		for (let r = 0, i = this._docs.length; r < i; r += 1) e(this._docs[r], r) && (t.push(this._docs[r]), n.push(r));
-		if (n.length) {
-			if (this._invertedIndex) for (let e of n) ut(this._invertedIndex, e);
-			for (let e = n.length - 1; e >= 0; --e) this._docs.splice(n[e], 1);
-			this._myIndex.removeAll(n);
-		}
-		return t;
-	}
-	removeAt(e) {
-		this._invertedIndex && ut(this._invertedIndex, e);
-		let t = this._docs.splice(e, 1)[0];
-		return this._myIndex.removeAt(e), t;
-	}
-	getIndex() {
-		return this._myIndex;
-	}
-	search(e, t) {
-		let { limit: n = -1 } = t || {}, { includeMatches: r, includeScore: i, shouldSort: a, sortFn: o, ignoreFieldNorm: s } = this.options;
-		if (R(e) && !e.trim()) {
-			let e = this._docs.map((e, t) => ({
-				item: e,
-				refIndex: t
-			}));
-			return z(n) && n > -1 && (e = e.slice(0, n)), e;
-		}
-		let c = z(n) && n > 0 && R(e), l;
-		if (c) {
-			let t = new nt(n);
-			R(this._docs[0]) ? this._searchStringList(e, {
-				heap: t,
-				ignoreFieldNorm: s
-			}) : this._searchObjectList(e, {
-				heap: t,
-				ignoreFieldNorm: s
-			}), l = t.extractSorted(o);
-		} 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
-		});
-	}
-	_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 (!H(e)) return;
-			let { isMatch: s, score: c, indices: l } = r.searchIn(e);
-			if (s) {
-				let r = {
-					item: e,
-					idx: i,
-					matches: [{
-						score: c,
-						value: e,
-						norm: o,
-						indices: l
-					}]
-				};
-				t ? (r.score = et(r.matches, { ignoreFieldNorm: n }), t.shouldInsert(r.score) && t.insert(r)) : a.push(r);
-			}
-		}), a;
-	}
-	_searchLogical(e) {
-		let t = $e(e, this.options), n = (e, t, r) => {
-			if (!("children" in e)) {
-				let { keyId: n, searcher: i } = e, a;
-				return n === null ? (a = [], this._myIndex.keys.forEach((e, n) => {
-					a.push(...this._findMatches({
-						key: e,
-						value: t[n],
-						searcher: i
-					}));
-				})) : a = this._findMatches({
-					key: this._keyStore.get(n),
-					value: this._myIndex.getValueForItemAtKeyId(t, n),
-					searcher: i
-				}), a && a.length ? [{
-					idx: r,
-					item: t,
-					matches: a
-				}] : [];
-			}
-			let { children: i, operator: a } = e, o = [];
-			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 === qe.AND) return [];
-			}
-			return o;
-		}, r = this._myIndex.records, i = /* @__PURE__ */ new Map(), a = [];
-		return r.forEach(({ $: e, i: r }) => {
-			if (H(e)) {
-				let o = n(t, e, r);
-				o.length && (i.has(r) || (i.set(r, {
-					idx: r,
-					item: e,
-					matches: []
-				}), a.push(i.get(r))), o.forEach(({ matches: e }) => {
-					i.get(r).matches.push(...e);
-				}));
-			}
-		}), a;
-	}
-	_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 (!H(e)) return;
-			let s = [], c = !1, l = !1;
-			if (i.forEach((t, n) => {
-				let i = this._findMatches({
-					key: t,
-					value: e[n],
-					searcher: r
-				});
-				i.length ? (s.push(...i), i[0].hasInverse && (l = !0)) : c = !0;
-			}), !(l && c) && s.length) {
-				let r = {
-					idx: a,
-					item: e,
-					matches: s
-				};
-				t ? (r.score = et(r.matches, { ignoreFieldNorm: n }), t.shouldInsert(r.score) && t.insert(r)) : o.push(r);
-			}
-		}), o;
-	}
-	_findMatches({ key: e, value: t, searcher: n }) {
-		if (!H(t)) return [];
-		let r = [];
-		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,
-				key: e,
-				value: t,
-				idx: i,
-				norm: a,
-				indices: c,
-				hasInverse: l
-			});
-		});
-		else {
-			let { v: i, n: a } = t, { isMatch: o, score: s, indices: c, hasInverse: l } = n.searchIn(i);
-			o && r.push({
-				score: s,
-				key: e,
-				value: i,
-				norm: a,
-				indices: c,
-				hasInverse: l
-			});
-		}
-		return r;
-	}
-}, dt = class {
-	static condition(e, t) {
-		return t.useTokenSearch;
-	}
-	constructor(e, t) {
-		this.options = t, this.analyzer = st({
-			isCaseSensitive: t.isCaseSensitive,
-			ignoreDiacritics: t.ignoreDiacritics
-		});
-		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 Ee(e, {
-				location: t.location,
-				threshold: t.threshold,
-				distance: t.distance,
-				includeMatches: t.includeMatches,
-				findAllMatches: t.findAllMatches,
-				minMatchCharLength: t.minMatchCharLength,
-				isCaseSensitive: t.isCaseSensitive,
-				ignoreDiacritics: t.ignoreDiacritics,
-				ignoreLocation: !0
-			}));
-			let n = r.get(e) || 0, a = Math.log(1 + (i - n + .5) / (n + .5));
-			this.idfWeights.push(a);
-		}
-	}
-	searchIn(e) {
-		if (!this.termSearchers.length) return {
-			isMatch: !1,
-			score: 1
-		};
-		let t = [], n = 0, r = 0, i = 0;
-		for (let a = 0; a < this.termSearchers.length; a++) {
-			let o = this.termSearchers[a].searchIn(e), s = this.idfWeights[a];
-			r += s, o.isMatch && (i++, n += s * (1 - o.score), o.indices && t.push(...o.indices));
-		}
-		if (i === 0) return {
-			isMatch: !1,
-			score: 1
-		};
-		let a = r > 0 ? 1 - n / r : 0, o = {
-			isMatch: !0,
-			score: Math.max(.001, a)
-		};
-		return this.options.includeMatches && t.length && (o.indices = Ce(t)), o;
-	}
-};
-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, Ge(Ue), Ge(dt), Q.use = function(...e) {
-	e.forEach((e) => Ge(e));
-};
-//#endregion
-//#region src/hooks/useCommands.js
-var ft = (e, t = .4) => {
+}, L = (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
-	}) : null, [a, r]);
-	return (e) => {
-		if (!r.length) return null;
-		if (!a) {
+	}), {}) : {}, [e]), o = i(() => Object.keys(n), [n]), s = i(() => o.some((e) => e.includes(" ")), [o]), c = a(null);
+	return r(() => {
+		if (!s) {
+			c.current = null;
+			return;
+		}
+		import("fuse.js").then((e) => {
+			c.current = new (e.default ?? e)(o, {
+				includeScore: !0,
+				ignoreLocation: !0
+			});
+		}).catch(() => {
+			process.env.NODE_ENV !== "production" && console.warn("[react-vocal] fuse.js is not installed. Phrase command keys will fall back to exact matching. Install fuse.js to enable fuzzy matching: npm install fuse.js");
+		});
+	}, [s, o]), (e) => {
+		if (!o.length) return null;
+		if (!s) {
 			let t = e.trim().split(/\s+/), r = t.length > 1 ? t : [e.trim()];
 			for (let e of r) {
 				let t = e.toLowerCase();
@@ -1899,10 +746,17 @@ var ft = (e, t = .4) => {
 			}
 			return null;
 		}
-		let i = o.search(e).filter((e) => e.score < t);
-		return i?.length ? n[i[0].item.toLowerCase()]?.(e) : null;
+		let r = c.current;
+		if (r) {
+			let i = r.search(e).filter((e) => e.score < t);
+			if (i?.length) return n[i[0].item.toLowerCase()]?.(e);
+		} else {
+			let t = e.toLowerCase(), r = o.find((e) => t.includes(e) || e.includes(t));
+			if (r) return n[r]?.(e);
+		}
+		return null;
 	};
-}, pt = /* @__PURE__ */ s(((e) => {
+}, R = /* @__PURE__ */ s(((e) => {
 	var t = Symbol.for("react.transitional.element"), n = Symbol.for("react.fragment");
 	function r(e, n, r) {
 		var i = null;
@@ -1917,7 +771,7 @@ var ft = (e, t = .4) => {
 		};
 	}
 	e.Fragment = n, e.jsx = r, e.jsxs = r;
-})), mt = /* @__PURE__ */ s(((e) => {
+})), z = /* @__PURE__ */ s(((e) => {
 	process.env.NODE_ENV !== "production" && (function() {
 		function t(e) {
 			if (e == null) return null;
@@ -1989,7 +843,7 @@ var ft = (e, t = .4) => {
 		}
 		function l(e, t) {
 			function n() {
-				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));
+				P || (P = !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,
@@ -1998,7 +852,7 @@ var ft = (e, t = .4) => {
 		}
 		function u() {
 			var e = t(this.type);
-			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;
+			return F[e] || (F[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;
@@ -2048,7 +902,7 @@ var ft = (e, t = .4) => {
 				var m = Object.keys(n).filter(function(e) {
 					return e !== "key";
 				});
-				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);
+				o = 0 < m.length ? "{key: someKey, " + m.join(": ..., ") + ": ...}" : "{key: someKey}", R[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), R[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;
@@ -2066,39 +920,39 @@ var ft = (e, t = .4) => {
 		h = { react_stack_bottom_frame: function(e) {
 			return e();
 		} };
-		var ee, P = {}, te = h.react_stack_bottom_frame.bind(h, o)(), F = N(i(o)), I = {};
+		var P, F = {}, I = h.react_stack_bottom_frame.bind(h, o)(), L = N(i(o)), R = {};
 		e.Fragment = v, e.jsx = function(e, t, n) {
 			var r = 1e4 > A.recentlyCreatedOwnerStacks++;
-			return f(e, t, n, !1, r ? Error("react-stack-top-frame") : te, r ? N(i(e)) : F);
+			return f(e, t, n, !1, r ? Error("react-stack-top-frame") : I, r ? N(i(e)) : L);
 		}, e.jsxs = function(e, t, n) {
 			var r = 1e4 > A.recentlyCreatedOwnerStacks++;
-			return f(e, t, n, !0, r ? Error("react-stack-top-frame") : te, r ? N(i(e)) : F);
+			return f(e, t, n, !0, r ? Error("react-stack-top-frame") : I, r ? N(i(e)) : L);
 		};
 	})();
-})), $ = (/* @__PURE__ */ s(((e, t) => {
-	process.env.NODE_ENV === "production" ? t.exports = pt() : t.exports = mt();
-})))(), ht = ({ color: e = "black", activeColor: t = "red", isActive: n = !1 }) => /* @__PURE__ */ (0, $.jsx)("svg", {
+})), B = (/* @__PURE__ */ s(((e, t) => {
+	process.env.NODE_ENV === "production" ? t.exports = R() : t.exports = z();
+})))(), ee = ({ color: e = "black", activeColor: t = "red", isActive: n = !1 }) => /* @__PURE__ */ (0, B.jsx)("svg", {
 	"data-testid": "__icon-root__",
 	xmlns: "http://www.w3.org/2000/svg",
 	width: "100%",
 	height: "100%",
 	viewBox: "0 0 24 24",
-	children: /* @__PURE__ */ (0, $.jsxs)("g", { children: [/* @__PURE__ */ (0, $.jsx)("path", {
+	children: /* @__PURE__ */ (0, B.jsxs)("g", { children: [/* @__PURE__ */ (0, B.jsx)("path", {
 		"data-testid": "__icon-path__",
 		fill: e,
 		d: "M12 14c1.66 0 2.99-1.34 2.99-3L15 5c0-1.66-1.34-3-3-3S9 3.34 9 5v6c0 1.66 1.34 3 3 3zm5.3-3c0 3-2.54 5.1-5.3 5.1S6.7 14 6.7 11H5c0 3.41 2.72 6.23 6 6.72V21h2v-3.28c3.28-.48 6-3.3 6-6.72h-1.7z"
-	}), n && /* @__PURE__ */ (0, $.jsx)("circle", {
+	}), n && /* @__PURE__ */ (0, B.jsx)("circle", {
 		"data-testid": "__icon-active__",
 		fill: t,
 		cx: "16",
 		cy: "4",
 		r: "4"
 	})] })
-}), gt = (e, t) => {
+}), te = (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 = {
+}, V = ({ 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 }] = F(c, l, f, w), M = L(s, d), R = a({});
+	R.current = {
 		onStart: _,
 		onEnd: v,
 		onSpeechStart: y,
@@ -2107,21 +961,21 @@ var ft = (e, t = .4) => {
 		onError: S,
 		onNoMatch: C
 	};
-	let I = a(M);
-	I.current = M;
-	let L = a(null), R = a(null), [z, B] = te(n(() => R.current?.(), []), u), V = n(() => {
+	let z = a(M);
+	z.current = M;
+	let V = a(null), H = a(null), [U, W] = I(n(() => H.current?.(), []), u), G = n(() => {
 		try {
 			D(!1), k();
 		} catch (e) {
-			F.current.onError?.(e), L.current?.();
+			R.current.onError?.(e), V.current?.();
 		}
-	}, [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) => {
+	}, [k]), K = n((e) => {
+		U(), R.current.onStart?.(e);
+	}, [U]), q = n((e) => {
+		W(), R.current.onSpeechStart?.(e);
+	}, [W]), J = n((e) => {
+		U(), R.current.onSpeechEnd?.(e);
+	}, [U]), Y = n((e) => {
 		let t = Array.from(e?.results ?? [], (e) => {
 			let t = {
 				confidence: -Infinity,
@@ -2136,55 +990,55 @@ var ft = (e, t = .4) => {
 				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();
+		W(), G(), te(t, z.current), R.current.onResult?.(n, e);
+	}, [W, G]), X = n((e) => {
+		G(), R.current.onError?.(e);
+	}, [G]), ne = n((e) => {
+		W(), G(), R.current.onNoMatch?.(e);
+	}, [W, G]), Z = n((e) => {
+		W();
 		try {
-			V(), L.current?.();
+			G(), V.current?.();
 		} finally {
-			F.current.onEnd?.(e);
+			R.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
+	}, [W, G]);
+	H.current = Z;
+	let Q = i(() => ({
+		start: K,
+		end: Z,
+		speechstart: q,
+		speechend: J,
+		result: Y,
+		error: X,
+		nomatch: ne
 	}), [
-		ne,
 		K,
-		H,
-		U,
-		W,
-		G,
-		re
+		Z,
+		q,
+		J,
+		Y,
+		X,
+		ne
 	]);
-	L.current = () => Object.entries(q).forEach(([e, t]) => j?.(e, t));
-	let ie = n(() => {
+	V.current = () => Object.entries(Q).forEach(([e, t]) => j?.(e, t));
+	let $ = n(() => {
 		try {
-			D(!0), Object.entries(q).forEach(([e, t]) => A(e, t)), O();
+			D(!0), Object.entries(Q).forEach(([e, t]) => A(e, t)), O();
 		} catch (e) {
-			G(e);
+			X(e);
 		}
 	}, [
-		q,
+		Q,
 		A,
 		O,
-		G
-	]), ae = () => {
+		X
+	]), re = () => {
 		!h && g && (T.current.style.outline = g);
-	}, oe = () => {
+	}, ie = () => {
 		!h && g && (T.current.style.outline = "none");
 	};
-	return N.isSupported ? ee(r) ? r(ie, V, E) : t(r) ? e(r, { ...!E && { onClick: ie } }) : /* @__PURE__ */ (0, $.jsx)("button", {
+	return N.isSupported ? P(r) ? r($, G, E) : t(r) ? e(r, { ...!E && { onClick: $ } }) : /* @__PURE__ */ (0, B.jsx)("button", {
 		"data-testid": "__vocal-root__",
 		ref: T,
 		role: "button",
@@ -2199,16 +1053,16 @@ var ft = (e, t = .4) => {
 			...m
 		},
 		className: h,
-		onFocus: ae,
-		onBlur: oe,
-		onClick: ie,
-		children: /* @__PURE__ */ (0, $.jsx)(ht, {
+		onFocus: re,
+		onBlur: ie,
+		onClick: $,
+		children: /* @__PURE__ */ (0, B.jsx)(ee, {
 			isActive: E,
 			color: "#aaa"
 		})
 	}) : null;
-}, vt = N.isSupported, yt = _t;
+}, H = N.isSupported, U = V;
 //#endregion
-export { yt as default, vt as isSupported, P as useVocal };
+export { U as default, H as isSupported, F as useVocal };
 
 //# sourceMappingURL=index.es.js.map