@vielzeug/scout 26.10.14 → 26.10.16

package/dist/scout.js

@@ -1,2 +1,412 @@
-import{tapper as e}from"@vielzeug/arsenal";function toSearchMatcher(e,t){let n,r=-1,i=new Set;return(a,o)=>((o!==n||e.revision!==r)&&(n=o,r=e.revision,i=new Set(e.search(o,t).map(e=>e.item))),i.has(a))}function toFilterPredicate(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var t={Exact:0,FuzzyOnly:5,LabelContains:2,LabelStart:1,MetaContains:3,TextContains:4};function rankEntries(e,n,r={}){let i=n.trim().toLowerCase();if(!i)return[...e];let a=r.fuzzyIds??new Set,o=[];for(let n of e){let e=n.label.toLowerCase(),r=e===i?t.Exact:e.startsWith(i)?t.LabelStart:e.includes(i)?t.LabelContains:n.meta.toLowerCase().includes(i)?t.MetaContains:n.text.toLowerCase().includes(i)?t.TextContains:a.has(n.id)?t.FuzzyOnly:null;r!==null&&o.push([r,n])}return o.sort((e,t)=>e[0]-t[0]||e[1].label.localeCompare(t[1].label)||e[1].text.localeCompare(t[1].text)).map(([,e])=>e)}function dedupeEntries(e){let t=new Set;return e.filter(e=>{let n=`${e.label}\u0000${e.text}`.toLowerCase();return!t.has(n)&&(t.add(n),!0)})}function splitPattern(e,t){if(!t)return[{text:e}];let n=[],r=0;for(let i of e.matchAll(t)){if(i[0].length===0)continue;let t=i.index??0;t>r&&n.push({text:e.slice(r,t)}),n.push({matched:!0,text:i[0]}),r=t+i[0].length}return r<e.length&&n.push({text:e.slice(r)}),n.length?n:[{text:e}]}var n=/[.*+?^${}()|[\]\\]/g,escapeRegExp=e=>e.replace(n,`\\$&`),ScoutError=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},ScoutDisposedError=class extends ScoutError{},ScoutConfigError=class extends ScoutError{};function tokenize(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function defaultStringify(e){return e==null?``:typeof e==`string`?e:typeof e==`number`||typeof e==`boolean`?String(e):Array.isArray(e)?e.filter(e=>typeof e==`string`||typeof e==`number`||typeof e==`boolean`).join(` `):``}function findMatchRanges(e,t){let n=e.toLowerCase(),r=tokenize(t).split(` `).filter(Boolean),i=[];for(let e of r){let t=0;for(;t<n.length;){let r=n.indexOf(e,t);if(r===-1)break;i.push([r,r+e.length]),t=r+1}}i.sort((e,t)=>e[0]-t[0]);let a=[];for(let e of i){let t=a[a.length-1];t&&e[0]<=t[1]?t[1]=Math.max(t[1],e[1]):a.push([e[0],e[1]])}return a}function highlight(e,t){if(!e)return[];if(!t.length)return[{highlighted:!1,text:e}];let n=[],r=0;for(let[i,a]of t)i>r&&n.push({highlighted:!1,text:e.slice(r,i)}),a>i&&n.push({highlighted:!0,text:e.slice(i,a)}),r=a;return r<e.length&&n.push({highlighted:!1,text:e.slice(r)}),n}function highlightField(e,t,n){return highlight(n,e.matches.find(e=>e.field===t)?.ranges??[])}function generateTrigrams(e){let t=new Set,n=` ${e} `;for(let e=0;e<n.length-2;e++)t.add(n.slice(e,e+3));return t}function overlapSimilarity(e,t){if(e.size===0||t.size===0)return 0;let n=0;for(let r of e)t.has(r)&&n++;return n<2&&n<e.size?0:n/Math.min(e.size,t.size)}function requireFiniteInteger(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new ScoutConfigError(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function requireFiniteNumber(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new ScoutConfigError(`${t} must be a finite number between ${n} and ${r}.`);return e}function resolveFields(e){return e.map(e=>typeof e==`string`?{field:e,stringify:defaultStringify,weight:1}:{field:e.field,stringify:e.stringify??defaultStringify,weight:requireFiniteNumber(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function createIndex(e,t){if(t.fields.length===0)throw new ScoutConfigError(`createIndex: at least one field is required.`);let n=resolveFields(t.fields),r=n.reduce((e,t)=>Math.max(e,t.weight),1),i=requireFiniteNumber(t.threshold??.2,`threshold`,0,1),a=requireFiniteInteger(t.limit??50,`limit`,0),o=requireFiniteInteger(t.minQueryLength??3,`minQueryLength`,1),s=new Map,c=new Map,l=new Set,u=0;function notifyMutation(){u++;for(let e of l)e()}let d=null,f=null;function getQueryTrigrams(e){return e===d&&f!==null?f:(d=e,f=generateTrigrams(e),f)}function addFieldToIndex(e,t){for(let n of t){let t=c.get(n);t||(t=new Set,c.set(n,t)),t.add(e)}}function removeFieldFromIndex(e,t){for(let n of t){let t=c.get(n);t&&(t.delete(e),t.size===0&&c.delete(n))}}function addItem(e){let t=new Map,r=new Map;for(let{field:i,stringify:a}of n){let n=e[i],o=a(n),s=tokenize(o),c=s.length>=1?generateTrigrams(s):new Set;t.set(i,c),r.set(i,o),addFieldToIndex(e,c)}s.set(e,{trigrams:t,values:r})}function containmentScan(e){let t=new Set;for(let[n,r]of s)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function trigramCandidates(e){let t=new Set;for(let n of e){let e=c.get(n);if(e)for(let n of e)t.add(n)}return t}function scoreCandidate(e,t,i){let a=0;for(let{field:o,weight:s}of n){let n;if(t===null)n=+!!(i.values.get(o)??``).toLowerCase().includes(e);else{let e=i.trigrams.get(o);if(!e||e.size===0)continue;n=overlapSimilarity(t,e)}let c=s/r*n;c>a&&(a=c)}return a}function computeMatches(e,t){let r=[];for(let{field:i}of n){let n=t.get(i);if(!n)continue;let a=findMatchRanges(n,e);a.length>0&&r.push({field:i,ranges:a})}return r}function reindexItem(e){let t=s.get(e);if(!t)return!1;let r=!1;for(let{field:i,stringify:a}of n){let n=a(e[i]);if(n===t.values.get(i))continue;r=!0;let o=t.trigrams.get(i);o&&removeFieldFromIndex(e,o);let s=tokenize(n),c=s.length>=1?generateTrigrams(s):new Set;t.trigrams.set(i,c),t.values.set(i,n),addFieldToIndex(e,c)}return r}function removeItem(e){let t=s.get(e);if(!t)return!1;for(let n of t.trigrams.values())removeFieldFromIndex(e,n);return s.delete(e),!0}for(let t of e)s.has(t)||addItem(t);return{add(e){s.has(e)||(addItem(e),notifyMutation())},get items(){return[...s.keys()]},onMutate(e){return l.add(e),()=>{l.delete(e)}},reindex(e){reindexItem(e)&&notifyMutation()},remove(e){removeItem(e)&&notifyMutation()},get revision(){return u},search(e,t){let n=requireFiniteNumber(t?.threshold??i,`threshold`,0,1),r=requireFiniteInteger(t?.limit??a,`limit`,0),c=requireFiniteInteger(t?.minQueryLength??o,`minQueryLength`,1);if(!e.trim())return[...s.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let l=tokenize(e);if(!l)return[];let u=l.length<c?null:getQueryTrigrams(l),d=u===null?containmentScan(l):trigramCandidates(u),f=[];for(let e of d){let t=s.get(e);if(!t)continue;let r=scoreCandidate(l,u,t);if(r>=n){let n=computeMatches(l,t.values);f.push({item:e,matches:n,score:r})}}return f.sort((e,t)=>t.score-e.score).slice(0,r)},setItems(e){let t=new Set(e),n=[...t],r=!1;for(let e of[...s.keys()])t.has(e)||(removeItem(e),r=!0);for(let e of n)s.has(e)?reindexItem(e)&&(r=!0):(addItem(e),r=!0);let i=[...s.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,s.get(e)]));s.clear();for(let[t,n]of e)s.set(t,n);r=!0}r&&notifyMutation()},get size(){return s.size}}}var r=200;function notify(e){for(let t of[...e])try{t()}catch(e){queueMicrotask(()=>{throw e})}}function subscribe(e,t,n,r,i){if(r||n?.signal?.aborted)return()=>{};e.add(t);let unsubscribe=()=>{e.delete(t),n?.signal?.removeEventListener(`abort`,unsubscribe)};return n?.signal?.addEventListener(`abort`,unsubscribe,{once:!0,signal:i}),unsubscribe}function createSearch(t,n={}){let{debounce:i=r,limit:a,minQueryLength:o,threshold:s}=n;if(!Number.isSafeInteger(i)||i<0)throw new ScoutConfigError(`debounce must be a finite non-negative integer.`);let search=e=>t.search(e,{limit:a,minQueryLength:o,threshold:s}),createSnapshot=(e,t,n)=>Object.freeze({isSearching:t,query:e,results:Object.freeze(n)}),c=new Set,l=e(),u=new AbortController,d=createSnapshot(``,!1,search(``)),f=``,p=!1,m,publish=e=>{d=e,notify(c),l.emit({snapshot:e,type:`state-change`})},commit=e=>{f=e,publish(createSnapshot(e,!1,search(e)))},h=t.onMutate(()=>{publish(createSnapshot(d.query,d.isSearching,search(f)))}),assertActive=e=>{if(p)throw new ScoutDisposedError(`SearchState.${e}() called after dispose()`)},dispose=()=>{p||(p=!0,m!==void 0&&clearTimeout(m),m=void 0,h(),c.clear(),l.clear(),u.abort())};return{clear(){assertActive(`clear`),(d.query!==``||d.isSearching)&&(m!==void 0&&clearTimeout(m),m=void 0,commit(``))},get disposalSignal(){return u.signal},dispose,get disposed(){return p},getSnapshot(){return d},setQuery(e){if(assertActive(`setQuery`),e!==d.query){if(m!==void 0&&clearTimeout(m),m=void 0,e===f){publish(createSnapshot(e,!1,d.results));return}if(i===0){commit(e);return}publish(createSnapshot(e,!0,d.results)),m=setTimeout(()=>{m=void 0,commit(e)},i)}},subscribe(e,t){return subscribe(c,e,t,p,u.signal)},tap(e,t){return p?()=>{}:l.tap(e,t)},[Symbol.dispose]:dispose}}function createReactiveSearch(e,t){let n=createIndex(e,t),r=createSearch(n,t);return{clear:r.clear,get disposalSignal(){return r.disposalSignal},dispose:r.dispose,get disposed(){return r.disposed},getSnapshot:r.getSnapshot,index:n,setQuery:r.setQuery,subscribe:r.subscribe,tap:r.tap,[Symbol.dispose]:r[Symbol.dispose]}}function segmentWords(e){let t=getSegmenter();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var i;function getSegmenter(){return i===void 0&&(i=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),i}export{ScoutConfigError,ScoutDisposedError,ScoutError,createIndex,createReactiveSearch,createSearch,dedupeEntries,escapeRegExp,findMatchRanges,highlight,highlightField,rankEntries,segmentWords,splitPattern,toFilterPredicate,toSearchMatcher};
+import { tapper as e } from "@vielzeug/arsenal";
+//#region src/adapters.ts
+function toSearchMatcher(e, t) {
+	let n, r = -1, i = /* @__PURE__ */ new Set();
+	return (a, o) => ((o !== n || e.revision !== r) && (n = o, r = e.revision, i = new Set(e.search(o, t).map((e) => e.item))), i.has(a));
+}
+function toFilterPredicate(e, t, n) {
+	let r = new Set(e.search(t, n).map((e) => e.item));
+	return (e) => r.has(e);
+}
+//#endregion
+//#region src/entries.ts
+var t = {
+	Exact: 0,
+	FuzzyOnly: 5,
+	LabelContains: 2,
+	LabelStart: 1,
+	MetaContains: 3,
+	TextContains: 4
+};
+function rankEntries(e, n, r = {}) {
+	let i = n.trim().toLowerCase();
+	if (!i) return [...e];
+	let a = r.fuzzyIds ?? /* @__PURE__ */ new Set(), o = [];
+	for (let n of e) {
+		let e = n.label.toLowerCase(), r = e === i ? t.Exact : e.startsWith(i) ? t.LabelStart : e.includes(i) ? t.LabelContains : n.meta.toLowerCase().includes(i) ? t.MetaContains : n.text.toLowerCase().includes(i) ? t.TextContains : a.has(n.id) ? t.FuzzyOnly : null;
+		r !== null && o.push([r, n]);
+	}
+	return o.sort((e, t) => e[0] - t[0] || e[1].label.localeCompare(t[1].label) || e[1].text.localeCompare(t[1].text)).map(([, e]) => e);
+}
+function dedupeEntries(e) {
+	let t = /* @__PURE__ */ new Set();
+	return e.filter((e) => {
+		let n = `${e.label}\u0000${e.text}`.toLowerCase();
+		return !t.has(n) && (t.add(n), !0);
+	});
+}
+function splitPattern(e, t) {
+	if (!t) return [{ text: e }];
+	let n = [], r = 0;
+	for (let i of e.matchAll(t)) {
+		if (i[0].length === 0) continue;
+		let t = i.index ?? 0;
+		t > r && n.push({ text: e.slice(r, t) }), n.push({
+			matched: !0,
+			text: i[0]
+		}), r = t + i[0].length;
+	}
+	return r < e.length && n.push({ text: e.slice(r) }), n.length ? n : [{ text: e }];
+}
+var n = /[.*+?^${}()|[\]\\]/g, escapeRegExp = (e) => e.replace(n, "\\$&"), ScoutError = class extends Error {
+	constructor(e, t) {
+		super(e, t), this.name = new.target.name, Object.setPrototypeOf(this, new.target.prototype);
+	}
+}, ScoutDisposedError = class extends ScoutError {}, ScoutConfigError = class extends ScoutError {};
+//#endregion
+//#region src/tokenize.ts
+function tokenize(e) {
+	return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu, " ").trim().replace(/\s+/g, " ");
+}
+function defaultStringify(e) {
+	return e == null ? "" : typeof e == "string" ? e : typeof e == "number" || typeof e == "boolean" ? String(e) : Array.isArray(e) ? e.filter((e) => typeof e == "string" || typeof e == "number" || typeof e == "boolean").join(" ") : "";
+}
+//#endregion
+//#region src/highlight.ts
+function findMatchRanges(e, t) {
+	let n = e.toLowerCase(), r = tokenize(t).split(" ").filter(Boolean), i = [];
+	for (let e of r) {
+		let t = 0;
+		for (; t < n.length;) {
+			let r = n.indexOf(e, t);
+			if (r === -1) break;
+			i.push([r, r + e.length]), t = r + 1;
+		}
+	}
+	i.sort((e, t) => e[0] - t[0]);
+	let a = [];
+	for (let e of i) {
+		let t = a[a.length - 1];
+		t && e[0] <= t[1] ? t[1] = Math.max(t[1], e[1]) : a.push([e[0], e[1]]);
+	}
+	return a;
+}
+function highlight(e, t) {
+	if (!e) return [];
+	if (!t.length) return [{
+		highlighted: !1,
+		text: e
+	}];
+	let n = [], r = 0;
+	for (let [i, a] of t) i > r && n.push({
+		highlighted: !1,
+		text: e.slice(r, i)
+	}), a > i && n.push({
+		highlighted: !0,
+		text: e.slice(i, a)
+	}), r = a;
+	return r < e.length && n.push({
+		highlighted: !1,
+		text: e.slice(r)
+	}), n;
+}
+function highlightField(e, t, n) {
+	return highlight(n, e.matches.find((e) => e.field === t)?.ranges ?? []);
+}
+//#endregion
+//#region src/trigram.ts
+function generateTrigrams(e) {
+	let t = /* @__PURE__ */ new Set(), n = ` ${e} `;
+	for (let e = 0; e < n.length - 2; e++) t.add(n.slice(e, e + 3));
+	return t;
+}
+function overlapSimilarity(e, t) {
+	if (e.size === 0 || t.size === 0) return 0;
+	let n = 0;
+	for (let r of e) t.has(r) && n++;
+	return n < 2 && n < e.size ? 0 : n / Math.min(e.size, t.size);
+}
+//#endregion
+//#region src/scout-index.ts
+function requireFiniteInteger(e, t, n) {
+	if (!Number.isFinite(e) || !Number.isInteger(e) || e < n) throw new ScoutConfigError(`${t} must be a finite integer greater than or equal to ${n}.`);
+	return e;
+}
+function requireFiniteNumber(e, t, n, r = Infinity) {
+	if (!Number.isFinite(e) || e < n || e > r) throw new ScoutConfigError(`${t} must be a finite number between ${n} and ${r}.`);
+	return e;
+}
+function resolveFields(e) {
+	return e.map((e) => typeof e == "string" ? {
+		field: e,
+		stringify: defaultStringify,
+		weight: 1
+	} : {
+		field: e.field,
+		stringify: e.stringify ?? defaultStringify,
+		weight: requireFiniteNumber(e.weight ?? 1, `weight for field "${e.field}"`, Number.MIN_VALUE)
+	});
+}
+function createIndex(e, t) {
+	if (t.fields.length === 0) throw new ScoutConfigError("createIndex: at least one field is required.");
+	let n = resolveFields(t.fields), r = n.reduce((e, t) => Math.max(e, t.weight), 1), i = requireFiniteNumber(t.threshold ?? .2, "threshold", 0, 1), a = requireFiniteInteger(t.limit ?? 50, "limit", 0), o = requireFiniteInteger(t.minQueryLength ?? 3, "minQueryLength", 1), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), l = /* @__PURE__ */ new Set(), u = 0;
+	function notifyMutation() {
+		u++;
+		for (let e of l) e();
+	}
+	let d = null, f = null;
+	function getQueryTrigrams(e) {
+		return e === d && f !== null || (d = e, f = generateTrigrams(e)), f;
+	}
+	function addFieldToIndex(e, t) {
+		for (let n of t) {
+			let t = c.get(n);
+			t || (t = /* @__PURE__ */ new Set(), c.set(n, t)), t.add(e);
+		}
+	}
+	function removeFieldFromIndex(e, t) {
+		for (let n of t) {
+			let t = c.get(n);
+			t && (t.delete(e), t.size === 0 && c.delete(n));
+		}
+	}
+	function addItem(e) {
+		let t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
+		for (let { field: i, stringify: a } of n) {
+			let n = e[i], o = a(n), s = tokenize(o), c = s.length >= 1 ? generateTrigrams(s) : /* @__PURE__ */ new Set();
+			t.set(i, c), r.set(i, o), addFieldToIndex(e, c);
+		}
+		s.set(e, {
+			trigrams: t,
+			values: r
+		});
+	}
+	function containmentScan(e) {
+		let t = /* @__PURE__ */ new Set();
+		for (let [n, r] of s) for (let i of r.values.values()) if (i.toLowerCase().includes(e)) {
+			t.add(n);
+			break;
+		}
+		return t;
+	}
+	function trigramCandidates(e) {
+		let t = /* @__PURE__ */ new Set();
+		for (let n of e) {
+			let e = c.get(n);
+			if (e) for (let n of e) t.add(n);
+		}
+		return t;
+	}
+	function scoreCandidate(e, t, i) {
+		let a = 0;
+		for (let { field: o, weight: s } of n) {
+			let n;
+			if (t === null) n = +!!(i.values.get(o) ?? "").toLowerCase().includes(e);
+			else {
+				let e = i.trigrams.get(o);
+				if (!e || e.size === 0) continue;
+				n = overlapSimilarity(t, e);
+			}
+			let c = s / r * n;
+			c > a && (a = c);
+		}
+		return a;
+	}
+	function computeMatches(e, t) {
+		let r = [];
+		for (let { field: i } of n) {
+			let n = t.get(i);
+			if (!n) continue;
+			let a = findMatchRanges(n, e);
+			a.length > 0 && r.push({
+				field: i,
+				ranges: a
+			});
+		}
+		return r;
+	}
+	function reindexItem(e) {
+		let t = s.get(e);
+		if (!t) return !1;
+		let r = !1;
+		for (let { field: i, stringify: a } of n) {
+			let n = a(e[i]);
+			if (n === t.values.get(i)) continue;
+			r = !0;
+			let o = t.trigrams.get(i);
+			o && removeFieldFromIndex(e, o);
+			let s = tokenize(n), c = s.length >= 1 ? generateTrigrams(s) : /* @__PURE__ */ new Set();
+			t.trigrams.set(i, c), t.values.set(i, n), addFieldToIndex(e, c);
+		}
+		return r;
+	}
+	function removeItem(e) {
+		let t = s.get(e);
+		if (!t) return !1;
+		for (let n of t.trigrams.values()) removeFieldFromIndex(e, n);
+		return s.delete(e), !0;
+	}
+	for (let t of e) s.has(t) || addItem(t);
+	return {
+		add(e) {
+			s.has(e) || (addItem(e), notifyMutation());
+		},
+		get items() {
+			return [...s.keys()];
+		},
+		onMutate(e) {
+			return l.add(e), () => {
+				l.delete(e);
+			};
+		},
+		reindex(e) {
+			reindexItem(e) && notifyMutation();
+		},
+		remove(e) {
+			removeItem(e) && notifyMutation();
+		},
+		get revision() {
+			return u;
+		},
+		search(e, t) {
+			let n = requireFiniteNumber(t?.threshold ?? i, "threshold", 0, 1), r = requireFiniteInteger(t?.limit ?? a, "limit", 0), c = requireFiniteInteger(t?.minQueryLength ?? o, "minQueryLength", 1);
+			if (!e.trim()) return [...s.keys()].slice(0, r).map((e) => ({
+				item: e,
+				matches: [],
+				score: 1
+			}));
+			let l = tokenize(e);
+			if (!l) return [];
+			let u = l.length < c ? null : getQueryTrigrams(l), d = u === null ? containmentScan(l) : trigramCandidates(u), f = [];
+			for (let e of d) {
+				let t = s.get(e);
+				if (!t) continue;
+				let r = scoreCandidate(l, u, t);
+				if (r >= n) {
+					let n = computeMatches(l, t.values);
+					f.push({
+						item: e,
+						matches: n,
+						score: r
+					});
+				}
+			}
+			return f.sort((e, t) => t.score - e.score).slice(0, r);
+		},
+		setItems(e) {
+			let t = new Set(e), n = [...t], r = !1;
+			for (let e of [...s.keys()]) t.has(e) || (removeItem(e), r = !0);
+			for (let e of n) s.has(e) ? reindexItem(e) && (r = !0) : (addItem(e), r = !0);
+			let i = [...s.keys()];
+			if (i.length !== n.length || i.some((e, t) => e !== n[t])) {
+				let e = new Map(n.map((e) => [e, s.get(e)]));
+				s.clear();
+				for (let [t, n] of e) s.set(t, n);
+				r = !0;
+			}
+			r && notifyMutation();
+		},
+		get size() {
+			return s.size;
+		}
+	};
+}
+//#endregion
+//#region src/reactive.ts
+var r = 200;
+function notify(e) {
+	for (let t of [...e]) try {
+		t();
+	} catch (e) {
+		queueMicrotask(() => {
+			throw e;
+		});
+	}
+}
+function subscribe(e, t, n, r, i) {
+	if (r || n?.signal?.aborted) return () => {};
+	e.add(t);
+	let unsubscribe = () => {
+		e.delete(t), n?.signal?.removeEventListener("abort", unsubscribe);
+	};
+	return n?.signal?.addEventListener("abort", unsubscribe, {
+		once: !0,
+		signal: i
+	}), unsubscribe;
+}
+function createSearch(t, n = {}) {
+	let { debounce: i = r, limit: a, minQueryLength: o, threshold: s } = n;
+	if (!Number.isSafeInteger(i) || i < 0) throw new ScoutConfigError("debounce must be a finite non-negative integer.");
+	let search = (e) => t.search(e, {
+		limit: a,
+		minQueryLength: o,
+		threshold: s
+	}), createSnapshot = (e, t, n) => Object.freeze({
+		isSearching: t,
+		query: e,
+		results: Object.freeze(n)
+	}), c = /* @__PURE__ */ new Set(), l = e(), u = new AbortController(), d = createSnapshot("", !1, search("")), f = "", p = !1, m, publish = (e) => {
+		d = e, notify(c), l.emit({
+			snapshot: e,
+			type: "state-change"
+		});
+	}, commit = (e) => {
+		f = e, publish(createSnapshot(e, !1, search(e)));
+	}, h = t.onMutate(() => {
+		publish(createSnapshot(d.query, d.isSearching, search(f)));
+	}), assertActive = (e) => {
+		if (p) throw new ScoutDisposedError(`SearchState.${e}() called after dispose()`);
+	}, dispose = () => {
+		p || (p = !0, m !== void 0 && clearTimeout(m), m = void 0, h(), c.clear(), l.clear(), u.abort());
+	};
+	return {
+		clear() {
+			assertActive("clear"), (d.query !== "" || d.isSearching) && (m !== void 0 && clearTimeout(m), m = void 0, commit(""));
+		},
+		get disposalSignal() {
+			return u.signal;
+		},
+		dispose,
+		get disposed() {
+			return p;
+		},
+		getSnapshot() {
+			return d;
+		},
+		setQuery(e) {
+			assertActive("setQuery"), e !== d.query && (m !== void 0 && clearTimeout(m), m = void 0, e === f ? publish(createSnapshot(e, !1, d.results)) : i === 0 ? commit(e) : (publish(createSnapshot(e, !0, d.results)), m = setTimeout(() => {
+				m = void 0, commit(e);
+			}, i)));
+		},
+		subscribe(e, t) {
+			return subscribe(c, e, t, p, u.signal);
+		},
+		tap(e, t) {
+			return p ? () => {} : l.tap(e, t);
+		},
+		[Symbol.dispose]: dispose
+	};
+}
+function createReactiveSearch(e, t) {
+	let n = createIndex(e, t), r = createSearch(n, t);
+	return {
+		clear: r.clear,
+		get disposalSignal() {
+			return r.disposalSignal;
+		},
+		dispose: r.dispose,
+		get disposed() {
+			return r.disposed;
+		},
+		getSnapshot: r.getSnapshot,
+		index: n,
+		setQuery: r.setQuery,
+		subscribe: r.subscribe,
+		tap: r.tap,
+		[Symbol.dispose]: r[Symbol.dispose]
+	};
+}
+//#endregion
+//#region src/segment.ts
+function segmentWords(e) {
+	let t = getSegmenter();
+	return t ? [...t.segment(e)].filter((e) => e.isWordLike).map((e) => e.segment).join(" ") : e;
+}
+var i;
+function getSegmenter() {
+	return i === void 0 && (i = typeof Intl > "u" || typeof Intl.Segmenter != "function" ? null : new Intl.Segmenter(void 0, { granularity: "word" })), i;
+}
+//#endregion
+export { ScoutConfigError, ScoutDisposedError, ScoutError, createIndex, createReactiveSearch, createSearch, dedupeEntries, escapeRegExp, findMatchRanges, highlight, highlightField, rankEntries, segmentWords, splitPattern, toFilterPredicate, toSearchMatcher };
+
 //# sourceMappingURL=scout.js.map