@vielzeug/scout 2.1.1 → 2.2.0

package/dist/scout-index.js

@@ -1,166 +1,168 @@
-import { registerIndexRevision as e } from "./_index-state.js";
-import { ScoutConfigurationError as t } from "./errors.js";
-import { defaultStringify as n, tokenize as r } from "./tokenize.js";
-import { findMatchRanges as i } from "./highlight.js";
-import { generateTrigrams as a, overlapSimilarity as o } from "./trigram.js";
+import { ScoutConfigurationError as e } from "./errors.js";
+import { defaultStringify as t, tokenize as n } from "./tokenize.js";
+import { findMatchRanges as r } from "./highlight.js";
+import { generateTrigrams as i, overlapSimilarity as a } from "./trigram.js";
 //#region src/scout-index.ts
-function s(e, n, r) {
-	if (!Number.isFinite(e) || !Number.isInteger(e) || e < r) throw new t(`${n} must be a finite integer greater than or equal to ${r}.`);
-	return e;
+function o(t, n, r) {
+	if (!Number.isFinite(t) || !Number.isInteger(t) || t < r) throw new e(`${n} must be a finite integer greater than or equal to ${r}.`);
+	return t;
 }
-function c(e, n, r, i = Infinity) {
-	if (!Number.isFinite(e) || e < r || e > i) throw new t(`${n} must be a finite number between ${r} and ${i}.`);
-	return e;
+function s(t, n, r, i = Infinity) {
+	if (!Number.isFinite(t) || t < r || t > i) throw new e(`${n} must be a finite number between ${r} and ${i}.`);
+	return t;
 }
-function l(e) {
+function c(e) {
 	return e.map((e) => typeof e == "string" ? {
 		field: e,
-		stringify: n,
+		stringify: t,
 		weight: 1
 	} : {
 		field: e.field,
-		stringify: e.stringify ?? n,
-		weight: c(e.weight ?? 1, `weight for field "${e.field}"`, Number.MIN_VALUE)
+		stringify: e.stringify ?? t,
+		weight: s(e.weight ?? 1, `weight for field "${e.field}"`, Number.MIN_VALUE)
 	});
 }
-function u(n, u) {
-	if (u.fields.length === 0) throw new t("createIndex: at least one field is required.");
-	let d = l(u.fields), f = d.reduce((e, t) => Math.max(e, t.weight), 1), p = c(u.threshold ?? .2, "threshold", 0, 1), m = s(u.limit ?? 50, "limit", 0), h = s(u.minQueryLength ?? 3, "minQueryLength", 1), g = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Set(), y = 0;
-	function b() {
-		y++;
-		for (let e of v) e();
+function l(t, l) {
+	if (l.fields.length === 0) throw new e("createIndex: at least one field is required.");
+	let u = c(l.fields), d = u.reduce((e, t) => Math.max(e, t.weight), 1), f = s(l.threshold ?? .2, "threshold", 0, 1), p = o(l.limit ?? 50, "limit", 0), m = o(l.minQueryLength ?? 3, "minQueryLength", 1), h = /* @__PURE__ */ new Map(), g = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Set(), v = 0;
+	function y() {
+		v++;
+		for (let e of _) e();
 	}
-	let x = null, S = null;
-	function C(e) {
-		return e === x && S !== null ? S : (x = e, S = a(e), S);
+	let b = null, x = null;
+	function S(e) {
+		return e === b && x !== null ? x : (b = e, x = i(e), x);
 	}
-	function w(e, t) {
+	function C(e, t) {
 		for (let n of t) {
-			let t = _.get(n);
-			t || (t = /* @__PURE__ */ new Set(), _.set(n, t)), t.add(e);
+			let t = g.get(n);
+			t || (t = /* @__PURE__ */ new Set(), g.set(n, t)), t.add(e);
 		}
 	}
-	function T(e, t) {
+	function w(e, t) {
 		for (let n of t) {
-			let t = _.get(n);
-			t && (t.delete(e), t.size === 0 && _.delete(n));
+			let t = g.get(n);
+			t && (t.delete(e), t.size === 0 && g.delete(n));
 		}
 	}
-	function E(e) {
-		let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
-		for (let { field: i, stringify: o } of d) {
-			let s = e[i], c = o(s), l = r(c), u = l.length >= 1 ? a(l) : /* @__PURE__ */ new Set();
-			t.set(i, u), n.set(i, c), w(e, u);
+	function T(e) {
+		let t = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
+		for (let { field: a, stringify: o } of u) {
+			let s = e[a], c = o(s), l = n(c), u = l.length >= 1 ? i(l) : /* @__PURE__ */ new Set();
+			t.set(a, u), r.set(a, c), C(e, u);
 		}
-		g.set(e, {
+		h.set(e, {
 			trigrams: t,
-			values: n
+			values: r
 		});
 	}
-	function D(e) {
+	function E(e) {
 		let t = /* @__PURE__ */ new Set();
-		for (let [n, r] of g) for (let i of r.values.values()) if (i.toLowerCase().includes(e)) {
+		for (let [n, r] of h) for (let i of r.values.values()) if (i.toLowerCase().includes(e)) {
 			t.add(n);
 			break;
 		}
 		return t;
 	}
-	function O(e) {
+	function D(e) {
 		let t = /* @__PURE__ */ new Set();
 		for (let n of e) {
-			let e = _.get(n);
+			let e = g.get(n);
 			if (e) for (let n of e) t.add(n);
 		}
 		return t;
 	}
-	function k(e, t, n) {
+	function O(e, t, n) {
 		let r = 0;
-		for (let { field: i, weight: a } of d) {
+		for (let { field: i, weight: o } of u) {
 			let s;
 			if (t === null) s = +!!(n.values.get(i) ?? "").toLowerCase().includes(e);
 			else {
 				let e = n.trigrams.get(i);
 				if (!e || e.size === 0) continue;
-				s = o(t, e);
+				s = a(t, e);
 			}
-			let c = a / f * s;
+			let c = o / d * s;
 			c > r && (r = c);
 		}
 		return r;
 	}
-	function A(e, t) {
+	function k(e, t) {
 		let n = [];
-		for (let { field: r } of d) {
-			let a = t.get(r);
+		for (let { field: i } of u) {
+			let a = t.get(i);
 			if (!a) continue;
-			let o = i(a, e);
+			let o = r(a, e);
 			o.length > 0 && n.push({
-				field: r,
+				field: i,
 				ranges: o
 			});
 		}
 		return n;
 	}
-	function j(e) {
-		let t = g.get(e);
+	function A(e) {
+		let t = h.get(e);
 		if (!t) return !1;
-		let n = !1;
-		for (let { field: i, stringify: o } of d) {
-			let s = o(e[i]);
-			if (s === t.values.get(i)) continue;
-			n = !0;
-			let c = t.trigrams.get(i);
-			c && T(e, c);
-			let l = r(s), u = l.length >= 1 ? a(l) : /* @__PURE__ */ new Set();
-			t.trigrams.set(i, u), t.values.set(i, s), w(e, u);
+		let r = !1;
+		for (let { field: a, stringify: o } of u) {
+			let s = o(e[a]);
+			if (s === t.values.get(a)) continue;
+			r = !0;
+			let c = t.trigrams.get(a);
+			c && w(e, c);
+			let l = n(s), u = l.length >= 1 ? i(l) : /* @__PURE__ */ new Set();
+			t.trigrams.set(a, u), t.values.set(a, s), C(e, u);
 		}
-		return n;
+		return r;
 	}
-	function M(e) {
-		let t = g.get(e);
+	function j(e) {
+		let t = h.get(e);
 		if (!t) return !1;
-		for (let n of t.trigrams.values()) T(e, n);
-		return g.delete(e), !0;
+		for (let n of t.trigrams.values()) w(e, n);
+		return h.delete(e), !0;
 	}
-	for (let e of n) g.has(e) || E(e);
-	let N = {
+	for (let e of t) h.has(e) || T(e);
+	return {
 		add(e) {
-			g.has(e) || (E(e), b());
+			h.has(e) || (T(e), y());
 		},
 		get items() {
-			return [...g.keys()];
+			return [...h.keys()];
 		},
 		onMutate(e) {
-			return v.add(e), () => {
-				v.delete(e);
+			return _.add(e), () => {
+				_.delete(e);
 			};
 		},
 		reindex(e) {
-			j(e) && b();
+			A(e) && y();
 		},
 		remove(e) {
-			M(e) && b();
+			j(e) && y();
+		},
+		get revision() {
+			return v;
 		},
 		search(e, t) {
-			let n = c(t?.threshold ?? p, "threshold", 0, 1), i = s(t?.limit ?? m, "limit", 0), a = s(t?.minQueryLength ?? h, "minQueryLength", 1);
-			if (!e.trim()) return [...g.keys()].slice(0, i).map((e) => ({
+			let r = s(t?.threshold ?? f, "threshold", 0, 1), i = o(t?.limit ?? p, "limit", 0), a = o(t?.minQueryLength ?? m, "minQueryLength", 1);
+			if (!e.trim()) return [...h.keys()].slice(0, i).map((e) => ({
 				item: e,
 				matches: [],
 				score: 1
 			}));
-			let o = r(e);
-			if (!o) return [];
-			let l = o.length < a ? null : C(o), u = l === null ? D(o) : O(l), d = [];
+			let c = n(e);
+			if (!c) return [];
+			let l = c.length < a ? null : S(c), u = l === null ? E(c) : D(l), d = [];
 			for (let e of u) {
-				let t = g.get(e);
+				let t = h.get(e);
 				if (!t) continue;
-				let r = k(o, l, t);
-				if (r >= n) {
-					let n = A(o, t.values);
+				let n = O(c, l, t);
+				if (n >= r) {
+					let r = k(c, t.values);
 					d.push({
 						item: e,
-						matches: n,
-						score: r
+						matches: r,
+						score: n
 					});
 				}
 			}
@@ -168,24 +170,23 @@ function u(n, u) {
 		},
 		setItems(e) {
 			let t = new Set(e), n = [...t], r = !1;
-			for (let e of [...g.keys()]) t.has(e) || (M(e), r = !0);
-			for (let e of n) g.has(e) ? j(e) && (r = !0) : (E(e), r = !0);
-			let i = [...g.keys()];
+			for (let e of [...h.keys()]) t.has(e) || (j(e), r = !0);
+			for (let e of n) h.has(e) ? A(e) && (r = !0) : (T(e), r = !0);
+			let i = [...h.keys()];
 			if (i.length !== n.length || i.some((e, t) => e !== n[t])) {
-				let e = new Map(n.map((e) => [e, g.get(e)]));
-				g.clear();
-				for (let [t, n] of e) g.set(t, n);
+				let e = new Map(n.map((e) => [e, h.get(e)]));
+				h.clear();
+				for (let [t, n] of e) h.set(t, n);
 				r = !0;
 			}
-			r && b();
+			r && y();
 		},
 		get size() {
-			return g.size;
+			return h.size;
 		}
 	};
-	return e(N, () => y), N;
 }
 //#endregion
-export { u as createIndex };
+export { l as createIndex };
 
 //# sourceMappingURL=scout-index.js.map

package/dist/scout-index.js.map

@@ -1 +1 @@
-{"version":3,"file":"scout-index.js","names":[],"sources":["../src/scout-index.ts"],"sourcesContent":["import type { FieldDef, FieldMatch, ScoutIndexOptions, SearchConstraints, SearchResult } from './types';\n\nimport { registerIndexRevision } from './_index-state';\nimport { ScoutConfigurationError } from './errors';\nimport { findMatchRanges } from './highlight';\nimport { defaultStringify, tokenize } from './tokenize';\nimport { generateTrigrams, overlapSimilarity } from './trigram';\n\ntype FieldConfig<T> = {\n  field: keyof T & string;\n  stringify: (v: unknown) => string;\n  weight: number;\n};\n\ntype ItemRecord = {\n  /** Per-field trigrams for scoring. */\n  trigrams: Map<string, Set<string>>;\n  /** Per-field original text for highlighting. */\n  values: Map<string, string>;\n};\n\n/**\n * A stateful, indexed search corpus. Created via `createIndex()`.\n *\n * Supports incremental `add()`, `remove()`, and `reindex()` operations — each patches\n * the trigram index in O(field_length) without a full rebuild.\n */\nexport interface ScoutIndex<T> {\n  /** All items currently in the index, in insertion order. */\n  readonly items: readonly T[];\n  /** Number of items currently in the index. */\n  readonly size: number;\n  /** Adds `item` to the index. No-op if the item is already indexed (by reference). */\n  add(item: T): void;\n  /**\n   * Re-reads the item's current field values and rebuilds its index entry in-place,\n   * only updating fields whose values have changed. Preserves insertion order.\n   * No-op if the item is not in the index.\n   */\n  reindex(item: T): void;\n  /**\n   * Removes `item` from the index by reference equality.\n   * No-op if the item is not in the index.\n   */\n  remove(item: T): void;\n  /**\n   * Reconciles the index to `items` by reference identity. Retained items are reindexed,\n   * new items are added, missing items are removed, and one mutation notification fires\n   * when indexed corpus or field values change. Duplicate references collapse to one item.\n   */\n  setItems(items: readonly T[]): void;\n  /**\n   * Searches the index for `query` and returns results sorted by score descending.\n   *\n   * An empty (or whitespace-only) `query` returns all indexed items with `score = 1`.\n   * A `query` with no indexable content after normalization (e.g. punctuation-only) returns\n   * no results. Results below `threshold` are excluded. At most `limit` results are returned.\n   */\n  search(query: string, options?: SearchConstraints): SearchResult<T>[];\n  /**\n   * Subscribes `listener` to be called after every changed `add()` / `remove()` / `reindex()`\n   * / `setItems()` operation. No-ops — e.g. removing an unindexed item or reconciling an\n   * unchanged corpus — do not fire it. Each changed `setItems()` reconciliation fires once.\n   * Returns an unsubscribe function.\n   *\n   * Framework-agnostic extension point: `createSearch()` uses this internally to keep\n   * reactive `results` in sync with index mutations. Most callers won't need this directly.\n   */\n  onMutate(listener: () => void): () => void;\n}\n\nfunction requireFiniteInteger(value: number, name: string, minimum: number): number {\n  if (!Number.isFinite(value) || !Number.isInteger(value) || value < minimum) {\n    throw new ScoutConfigurationError(`${name} must be a finite integer greater than or equal to ${minimum}.`);\n  }\n\n  return value;\n}\n\nfunction requireFiniteNumber(value: number, name: string, minimum: number, maximum = Number.POSITIVE_INFINITY): number {\n  if (!Number.isFinite(value) || value < minimum || value > maximum) {\n    throw new ScoutConfigurationError(`${name} must be a finite number between ${minimum} and ${maximum}.`);\n  }\n\n  return value;\n}\n\nfunction resolveFields<T>(defs: ReadonlyArray<FieldDef<T>>): FieldConfig<T>[] {\n  return defs.map((def) => {\n    if (typeof def === 'string') {\n      return { field: def, stringify: defaultStringify, weight: 1 };\n    }\n\n    return {\n      field: def.field,\n      stringify: def.stringify ?? defaultStringify,\n      weight: requireFiniteNumber(def.weight ?? 1, `weight for field \"${def.field}\"`, Number.MIN_VALUE),\n    };\n  });\n}\n\n/**\n * Builds a trigram inverted index over `items` for fast fuzzy search.\n *\n * Construction is O(corpus × field_length). Subsequent `search()` calls are\n * O(candidates) — far faster than per-query Levenshtein for large corpora.\n *\n * @example\n * ```ts\n * const index = createIndex(users, {\n *   fields: [{ field: 'name', weight: 2 }, 'email'],\n *   threshold: 0.3,\n *   limit: 20,\n * });\n *\n * const results = index.search('alice');\n * ```\n *\n * @throws {ScoutConfigurationError} If options use an invalid field or numeric configuration.\n */\nexport function createIndex<T>(items: T[], options: ScoutIndexOptions<T>): ScoutIndex<T> {\n  if (options.fields.length === 0) {\n    throw new ScoutConfigurationError('createIndex: at least one field is required.');\n  }\n\n  const fields = resolveFields(options.fields);\n  const maxWeight = fields.reduce((max, f) => Math.max(max, f.weight), 1);\n  const defaultThreshold = requireFiniteNumber(options.threshold ?? 0.2, 'threshold', 0, 1);\n  const defaultLimit = requireFiniteInteger(options.limit ?? 50, 'limit', 0);\n  const defaultMinQueryLength = requireFiniteInteger(options.minQueryLength ?? 3, 'minQueryLength', 1);\n\n  /** item → per-item record, preserves insertion order for `items` getter */\n  const itemData = new Map<T, ItemRecord>();\n  /** trigram → set of items that contain it */\n  const invertedIndex = new Map<string, Set<T>>();\n  const mutationListeners = new Set<() => void>();\n  let revision = 0;\n\n  function notifyMutation(): void {\n    revision++;\n\n    for (const listener of mutationListeners) listener();\n  }\n\n  /** Single-entry cache for the most recent normalized query's trigrams (F2). */\n  let cachedNormalized: string | null = null;\n  let cachedTrigrams: Set<string> | null = null;\n\n  function getQueryTrigrams(normalized: string): Set<string> {\n    if (normalized === cachedNormalized && cachedTrigrams !== null) return cachedTrigrams;\n\n    cachedNormalized = normalized;\n    cachedTrigrams = generateTrigrams(normalized);\n\n    return cachedTrigrams;\n  }\n\n  function addFieldToIndex(item: T, fieldTrigrams: Set<string>): void {\n    for (const trigram of fieldTrigrams) {\n      let bucket = invertedIndex.get(trigram);\n\n      if (!bucket) {\n        bucket = new Set<T>();\n        invertedIndex.set(trigram, bucket);\n      }\n\n      bucket.add(item);\n    }\n  }\n\n  function removeFieldFromIndex(item: T, fieldTrigrams: Set<string>): void {\n    for (const trigram of fieldTrigrams) {\n      const bucket = invertedIndex.get(trigram);\n\n      if (bucket) {\n        bucket.delete(item);\n\n        if (bucket.size === 0) invertedIndex.delete(trigram);\n      }\n    }\n  }\n\n  function addItem(item: T): void {\n    const trigrams = new Map<string, Set<string>>();\n    const values = new Map<string, string>();\n\n    for (const { field, stringify } of fields) {\n      const raw = item[field];\n      const text = stringify(raw);\n      const normalized = tokenize(text);\n      const fieldTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n      trigrams.set(field, fieldTrigrams);\n      values.set(field, text);\n      addFieldToIndex(item, fieldTrigrams);\n    }\n\n    itemData.set(item, { trigrams, values });\n  }\n\n  /**\n   * Performs a full linear scan over all items for short queries.\n   * O(n × field_count) — acceptable for small corpora; consider raising\n   * `minQueryLength` on large datasets to avoid triggering this path.\n   */\n  function containmentScan(query: string): Set<T> {\n    const result = new Set<T>();\n\n    for (const [item, record] of itemData) {\n      for (const value of record.values.values()) {\n        if (value.toLowerCase().includes(query)) {\n          result.add(item);\n          break;\n        }\n      }\n    }\n\n    return result;\n  }\n\n  function trigramCandidates(queryTrigrams: Set<string>): Set<T> {\n    const candidates = new Set<T>();\n\n    for (const trigram of queryTrigrams) {\n      const items = invertedIndex.get(trigram);\n\n      if (items) {\n        for (const item of items) candidates.add(item);\n      }\n    }\n\n    return candidates;\n  }\n\n  function scoreCandidate(normalized: string, queryTrigrams: Set<string> | null, record: ItemRecord): number {\n    let bestScore = 0;\n\n    for (const { field, weight } of fields) {\n      let fieldScore: number;\n\n      if (queryTrigrams === null) {\n        const raw = record.values.get(field) ?? '';\n\n        fieldScore = raw.toLowerCase().includes(normalized) ? 1.0 : 0;\n      } else {\n        const itemTrigrams = record.trigrams.get(field);\n\n        if (!itemTrigrams || itemTrigrams.size === 0) continue;\n\n        fieldScore = overlapSimilarity(queryTrigrams, itemTrigrams);\n      }\n\n      const weighted = fieldScore * (weight / maxWeight);\n\n      if (weighted > bestScore) bestScore = weighted;\n    }\n\n    return bestScore;\n  }\n\n  function computeMatches(query: string, values: Map<string, string>): FieldMatch<keyof T & string>[] {\n    const matches: FieldMatch<keyof T & string>[] = [];\n\n    for (const { field } of fields) {\n      const text = values.get(field);\n\n      if (!text) continue;\n\n      const ranges = findMatchRanges(text, query);\n\n      if (ranges.length > 0) matches.push({ field, ranges });\n    }\n\n    return matches;\n  }\n\n  function reindexItem(item: T): boolean {\n    const record = itemData.get(item);\n\n    if (!record) return false;\n\n    let changed = false;\n\n    for (const { field, stringify } of fields) {\n      const newText = stringify(item[field]);\n      const oldText = record.values.get(field);\n\n      if (newText === oldText) continue;\n\n      changed = true;\n\n      const oldTrigrams = record.trigrams.get(field);\n\n      if (oldTrigrams) removeFieldFromIndex(item, oldTrigrams);\n\n      const normalized = tokenize(newText);\n      const newTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n      record.trigrams.set(field, newTrigrams);\n      record.values.set(field, newText);\n      addFieldToIndex(item, newTrigrams);\n    }\n\n    return changed;\n  }\n\n  function removeItem(item: T): boolean {\n    const record = itemData.get(item);\n\n    if (!record) return false;\n\n    for (const fieldTrigrams of record.trigrams.values()) {\n      removeFieldFromIndex(item, fieldTrigrams);\n    }\n\n    itemData.delete(item);\n\n    return true;\n  }\n\n  for (const item of items) {\n    if (!itemData.has(item)) addItem(item);\n  }\n\n  const index: ScoutIndex<T> = {\n    add(item: T): void {\n      if (itemData.has(item)) return;\n\n      addItem(item);\n      notifyMutation();\n    },\n\n    get items(): readonly T[] {\n      return [...itemData.keys()];\n    },\n\n    onMutate(listener: () => void): () => void {\n      mutationListeners.add(listener);\n\n      return () => {\n        mutationListeners.delete(listener);\n      };\n    },\n\n    reindex(item: T): void {\n      if (reindexItem(item)) notifyMutation();\n    },\n\n    remove(item: T): void {\n      if (removeItem(item)) notifyMutation();\n    },\n\n    search(query: string, options?: SearchConstraints): SearchResult<T>[] {\n      const threshold = requireFiniteNumber(options?.threshold ?? defaultThreshold, 'threshold', 0, 1);\n      const limit = requireFiniteInteger(options?.limit ?? defaultLimit, 'limit', 0);\n      const minQueryLength = requireFiniteInteger(\n        options?.minQueryLength ?? defaultMinQueryLength,\n        'minQueryLength',\n        1,\n      );\n\n      if (!query.trim()) {\n        return [...itemData.keys()].slice(0, limit).map((item) => ({ item, matches: [], score: 1 }));\n      }\n\n      const normalized = tokenize(query);\n\n      // Query had no indexable content (e.g. punctuation-only) — no match, not \"match all\".\n      if (!normalized) return [];\n\n      const isShort = normalized.length < minQueryLength;\n      const queryTrigrams = isShort ? null : getQueryTrigrams(normalized);\n      const candidates = queryTrigrams === null ? containmentScan(normalized) : trigramCandidates(queryTrigrams);\n      const results: SearchResult<T>[] = [];\n\n      for (const item of candidates) {\n        const record = itemData.get(item);\n\n        if (!record) continue;\n\n        const score = scoreCandidate(normalized, queryTrigrams, record);\n\n        if (score >= threshold) {\n          const matches = computeMatches(normalized, record.values);\n\n          results.push({ item, matches, score });\n        }\n      }\n\n      return results.sort((a, b) => b.score - a.score).slice(0, limit);\n    },\n\n    setItems(items: readonly T[]): void {\n      const incoming = new Set(items);\n      const next = [...incoming];\n      let changed = false;\n\n      for (const item of [...itemData.keys()]) {\n        if (incoming.has(item)) continue;\n\n        removeItem(item);\n        changed = true;\n      }\n\n      for (const item of next) {\n        if (!itemData.has(item)) {\n          addItem(item);\n          changed = true;\n        } else if (reindexItem(item)) {\n          changed = true;\n        }\n      }\n\n      const current = [...itemData.keys()];\n      const orderChanged = current.length !== next.length || current.some((item, index) => item !== next[index]);\n\n      if (orderChanged) {\n        const records = new Map(next.map((item) => [item, itemData.get(item)!]));\n\n        itemData.clear();\n\n        for (const [item, record] of records) itemData.set(item, record);\n\n        changed = true;\n      }\n\n      if (changed) notifyMutation();\n    },\n\n    get size(): number {\n      return itemData.size;\n    },\n  };\n\n  registerIndexRevision(index, () => revision);\n\n  return index;\n}\n"],"mappings":";;;;;;AAuEA,SAAS,EAAqB,GAAe,GAAc,GAAyB;CAClF,IAAI,CAAC,OAAO,SAAS,CAAK,KAAK,CAAC,OAAO,UAAU,CAAK,KAAK,IAAQ,GACjE,MAAM,IAAI,EAAwB,GAAG,EAAK,qDAAqD,EAAQ,EAAE;CAG3G,OAAO;AACT;AAEA,SAAS,EAAoB,GAAe,GAAc,GAAiB,IAAU,UAAkC;CACrH,IAAI,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,KAAW,IAAQ,GACxD,MAAM,IAAI,EAAwB,GAAG,EAAK,mCAAmC,EAAQ,OAAO,EAAQ,EAAE;CAGxG,OAAO;AACT;AAEA,SAAS,EAAiB,GAAoD;CAC5E,OAAO,EAAK,KAAK,MACX,OAAO,KAAQ,WACV;EAAE,OAAO;EAAK,WAAW;EAAkB,QAAQ;CAAE,IAGvD;EACL,OAAO,EAAI;EACX,WAAW,EAAI,aAAa;EAC5B,QAAQ,EAAoB,EAAI,UAAU,GAAG,qBAAqB,EAAI,MAAM,IAAI,OAAO,SAAS;CAClG,CACD;AACH;AAqBA,SAAgB,EAAe,GAAY,GAA8C;CACvF,IAAI,EAAQ,OAAO,WAAW,GAC5B,MAAM,IAAI,EAAwB,8CAA8C;CAGlF,IAAM,IAAS,EAAc,EAAQ,MAAM,GACrC,IAAY,EAAO,QAAQ,GAAK,MAAM,KAAK,IAAI,GAAK,EAAE,MAAM,GAAG,CAAC,GAChE,IAAmB,EAAoB,EAAQ,aAAa,IAAK,aAAa,GAAG,CAAC,GAClF,IAAe,EAAqB,EAAQ,SAAS,IAAI,SAAS,CAAC,GACnE,IAAwB,EAAqB,EAAQ,kBAAkB,GAAG,kBAAkB,CAAC,GAG7F,oBAAW,IAAI,IAAmB,GAElC,oBAAgB,IAAI,IAAoB,GACxC,oBAAoB,IAAI,IAAgB,GAC1C,IAAW;CAEf,SAAS,IAAuB;EAC9B;EAEA,KAAK,IAAM,KAAY,GAAmB,EAAS;CACrD;CAGA,IAAI,IAAkC,MAClC,IAAqC;CAEzC,SAAS,EAAiB,GAAiC;EAMzD,OALI,MAAe,KAAoB,MAAmB,OAAa,KAEvE,IAAmB,GACnB,IAAiB,EAAiB,CAAU,GAErC;CACT;CAEA,SAAS,EAAgB,GAAS,GAAkC;EAClE,KAAK,IAAM,KAAW,GAAe;GACnC,IAAI,IAAS,EAAc,IAAI,CAAO;GAOtC,AALK,MACH,oBAAS,IAAI,IAAO,GACpB,EAAc,IAAI,GAAS,CAAM,IAGnC,EAAO,IAAI,CAAI;EACjB;CACF;CAEA,SAAS,EAAqB,GAAS,GAAkC;EACvE,KAAK,IAAM,KAAW,GAAe;GACnC,IAAM,IAAS,EAAc,IAAI,CAAO;GAExC,AAAI,MACF,EAAO,OAAO,CAAI,GAEd,EAAO,SAAS,KAAG,EAAc,OAAO,CAAO;EAEvD;CACF;CAEA,SAAS,EAAQ,GAAe;EAC9B,IAAM,oBAAW,IAAI,IAAyB,GACxC,oBAAS,IAAI,IAAoB;EAEvC,KAAK,IAAM,EAAE,UAAO,kBAAe,GAAQ;GACzC,IAAM,IAAM,EAAK,IACX,IAAO,EAAU,CAAG,GACpB,IAAa,EAAS,CAAI,GAC1B,IAAgB,EAAW,UAAU,IAAI,EAAiB,CAAU,oBAAI,IAAI,IAAY;GAI9F,AAFA,EAAS,IAAI,GAAO,CAAa,GACjC,EAAO,IAAI,GAAO,CAAI,GACtB,EAAgB,GAAM,CAAa;EACrC;EAEA,EAAS,IAAI,GAAM;GAAE;GAAU;EAAO,CAAC;CACzC;CAOA,SAAS,EAAgB,GAAuB;EAC9C,IAAM,oBAAS,IAAI,IAAO;EAE1B,KAAK,IAAM,CAAC,GAAM,MAAW,GAC3B,KAAK,IAAM,KAAS,EAAO,OAAO,OAAO,GACvC,IAAI,EAAM,YAAY,CAAC,CAAC,SAAS,CAAK,GAAG;GACvC,EAAO,IAAI,CAAI;GACf;EACF;EAIJ,OAAO;CACT;CAEA,SAAS,EAAkB,GAAoC;EAC7D,IAAM,oBAAa,IAAI,IAAO;EAE9B,KAAK,IAAM,KAAW,GAAe;GACnC,IAAM,IAAQ,EAAc,IAAI,CAAO;GAEvC,IAAI,GACF,KAAK,IAAM,KAAQ,GAAO,EAAW,IAAI,CAAI;EAEjD;EAEA,OAAO;CACT;CAEA,SAAS,EAAe,GAAoB,GAAmC,GAA4B;EACzG,IAAI,IAAY;EAEhB,KAAK,IAAM,EAAE,UAAO,eAAY,GAAQ;GACtC,IAAI;GAEJ,IAAI,MAAkB,MAGpB,IAAA,IAFY,EAAO,OAAO,IAAI,CAAK,KAAK,GAAA,CAEvB,YAAY,CAAC,CAAC,SAAS,CAAU;QAC7C;IACL,IAAM,IAAe,EAAO,SAAS,IAAI,CAAK;IAE9C,IAAI,CAAC,KAAgB,EAAa,SAAS,GAAG;IAE9C,IAAa,EAAkB,GAAe,CAAY;GAC5D;GAEA,IAAM,IAAyB,IAAS,IAAvB;GAEjB,AAAI,IAAW,MAAW,IAAY;EACxC;EAEA,OAAO;CACT;CAEA,SAAS,EAAe,GAAe,GAA6D;EAClG,IAAM,IAA0C,CAAC;EAEjD,KAAK,IAAM,EAAE,cAAW,GAAQ;GAC9B,IAAM,IAAO,EAAO,IAAI,CAAK;GAE7B,IAAI,CAAC,GAAM;GAEX,IAAM,IAAS,EAAgB,GAAM,CAAK;GAE1C,AAAI,EAAO,SAAS,KAAG,EAAQ,KAAK;IAAE;IAAO;GAAO,CAAC;EACvD;EAEA,OAAO;CACT;CAEA,SAAS,EAAY,GAAkB;EACrC,IAAM,IAAS,EAAS,IAAI,CAAI;EAEhC,IAAI,CAAC,GAAQ,OAAO;EAEpB,IAAI,IAAU;EAEd,KAAK,IAAM,EAAE,UAAO,kBAAe,GAAQ;GACzC,IAAM,IAAU,EAAU,EAAK,EAAM;GAGrC,IAAI,MAFY,EAAO,OAAO,IAAI,CAElB,GAAS;GAEzB,IAAU;GAEV,IAAM,IAAc,EAAO,SAAS,IAAI,CAAK;GAE7C,AAAI,KAAa,EAAqB,GAAM,CAAW;GAEvD,IAAM,IAAa,EAAS,CAAO,GAC7B,IAAc,EAAW,UAAU,IAAI,EAAiB,CAAU,oBAAI,IAAI,IAAY;GAI5F,AAFA,EAAO,SAAS,IAAI,GAAO,CAAW,GACtC,EAAO,OAAO,IAAI,GAAO,CAAO,GAChC,EAAgB,GAAM,CAAW;EACnC;EAEA,OAAO;CACT;CAEA,SAAS,EAAW,GAAkB;EACpC,IAAM,IAAS,EAAS,IAAI,CAAI;EAEhC,IAAI,CAAC,GAAQ,OAAO;EAEpB,KAAK,IAAM,KAAiB,EAAO,SAAS,OAAO,GACjD,EAAqB,GAAM,CAAa;EAK1C,OAFA,EAAS,OAAO,CAAI,GAEb;CACT;CAEA,KAAK,IAAM,KAAQ,GACjB,AAAK,EAAS,IAAI,CAAI,KAAG,EAAQ,CAAI;CAGvC,IAAM,IAAuB;EAC3B,IAAI,GAAe;GACb,EAAS,IAAI,CAAI,MAErB,EAAQ,CAAI,GACZ,EAAe;EACjB;EAEA,IAAI,QAAsB;GACxB,OAAO,CAAC,GAAG,EAAS,KAAK,CAAC;EAC5B;EAEA,SAAS,GAAkC;GAGzC,OAFA,EAAkB,IAAI,CAAQ,SAEjB;IACX,EAAkB,OAAO,CAAQ;GACnC;EACF;EAEA,QAAQ,GAAe;GACrB,AAAI,EAAY,CAAI,KAAG,EAAe;EACxC;EAEA,OAAO,GAAe;GACpB,AAAI,EAAW,CAAI,KAAG,EAAe;EACvC;EAEA,OAAO,GAAe,GAAgD;GACpE,IAAM,IAAY,EAAoB,GAAS,aAAa,GAAkB,aAAa,GAAG,CAAC,GACzF,IAAQ,EAAqB,GAAS,SAAS,GAAc,SAAS,CAAC,GACvE,IAAiB,EACrB,GAAS,kBAAkB,GAC3B,kBACA,CACF;GAEA,IAAI,CAAC,EAAM,KAAK,GACd,OAAO,CAAC,GAAG,EAAS,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAK,CAAC,CAAC,KAAK,OAAU;IAAE;IAAM,SAAS,CAAC;IAAG,OAAO;GAAE,EAAE;GAG7F,IAAM,IAAa,EAAS,CAAK;GAGjC,IAAI,CAAC,GAAY,OAAO,CAAC;GAGzB,IAAM,IADU,EAAW,SAAS,IACJ,OAAO,EAAiB,CAAU,GAC5D,IAAa,MAAkB,OAAO,EAAgB,CAAU,IAAI,EAAkB,CAAa,GACnG,IAA6B,CAAC;GAEpC,KAAK,IAAM,KAAQ,GAAY;IAC7B,IAAM,IAAS,EAAS,IAAI,CAAI;IAEhC,IAAI,CAAC,GAAQ;IAEb,IAAM,IAAQ,EAAe,GAAY,GAAe,CAAM;IAE9D,IAAI,KAAS,GAAW;KACtB,IAAM,IAAU,EAAe,GAAY,EAAO,MAAM;KAExD,EAAQ,KAAK;MAAE;MAAM;MAAS;KAAM,CAAC;IACvC;GACF;GAEA,OAAO,EAAQ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAK;EACjE;EAEA,SAAS,GAA2B;GAClC,IAAM,IAAW,IAAI,IAAI,CAAK,GACxB,IAAO,CAAC,GAAG,CAAQ,GACrB,IAAU;GAEd,KAAK,IAAM,KAAQ,CAAC,GAAG,EAAS,KAAK,CAAC,GAChC,EAAS,IAAI,CAAI,MAErB,EAAW,CAAI,GACf,IAAU;GAGZ,KAAK,IAAM,KAAQ,GACjB,AAAK,EAAS,IAAI,CAAI,IAGX,EAAY,CAAI,MACzB,IAAU,OAHV,EAAQ,CAAI,GACZ,IAAU;GAMd,IAAM,IAAU,CAAC,GAAG,EAAS,KAAK,CAAC;GAGnC,IAFqB,EAAQ,WAAW,EAAK,UAAU,EAAQ,MAAM,GAAM,MAAU,MAAS,EAAK,EAAM,GAEvF;IAChB,IAAM,IAAU,IAAI,IAAI,EAAK,KAAK,MAAS,CAAC,GAAM,EAAS,IAAI,CAAI,CAAE,CAAC,CAAC;IAEvE,EAAS,MAAM;IAEf,KAAK,IAAM,CAAC,GAAM,MAAW,GAAS,EAAS,IAAI,GAAM,CAAM;IAE/D,IAAU;GACZ;GAEA,AAAI,KAAS,EAAe;EAC9B;EAEA,IAAI,OAAe;GACjB,OAAO,EAAS;EAClB;CACF;CAIA,OAFA,EAAsB,SAAa,CAAQ,GAEpC;AACT"}
+{"version":3,"file":"scout-index.js","names":[],"sources":["../src/scout-index.ts"],"sourcesContent":["import { ScoutConfigurationError } from './errors';\nimport { findMatchRanges } from './highlight';\nimport { defaultStringify, tokenize } from './tokenize';\nimport { generateTrigrams, overlapSimilarity } from './trigram';\nimport type { FieldDef, FieldMatch, ScoutIndexOptions, SearchConstraints, SearchResult } from './types';\n\ntype FieldConfig<T> = {\n  field: keyof T & string;\n  stringify: (v: unknown) => string;\n  weight: number;\n};\n\ntype ItemRecord = {\n  /** Per-field trigrams for scoring. */\n  trigrams: Map<string, Set<string>>;\n  /** Per-field original text for highlighting. */\n  values: Map<string, string>;\n};\n\n/**\n * A stateful, indexed search corpus. Created via `createIndex()`.\n *\n * Supports incremental `add()`, `remove()`, and `reindex()` operations — each patches\n * the trigram index in O(field_length) without a full rebuild.\n */\nexport interface ScoutIndex<T> {\n  /** Adds `item` to the index. No-op if the item is already indexed (by reference). */\n  add(item: T): void;\n  /** All items currently in the index, in insertion order. */\n  readonly items: readonly T[];\n  /**\n   * Subscribes `listener` to be called after every changed `add()` / `remove()` / `reindex()`\n   * / `setItems()` operation. No-ops — e.g. removing an unindexed item or reconciling an\n   * unchanged corpus — do not fire it. Each changed `setItems()` reconciliation fires once.\n   * Returns an unsubscribe function.\n   *\n   * Framework-agnostic extension point: `createSearch()` uses this internally to keep\n   * reactive `results` in sync with index mutations. Most callers won't need this directly.\n   */\n  onMutate(listener: () => void): () => void;\n  /**\n   * Re-reads the item's current field values and rebuilds its index entry in-place,\n   * only updating fields whose values have changed. Preserves insertion order.\n   * No-op if the item is not in the index.\n   */\n  reindex(item: T): void;\n  /**\n   * Removes `item` from the index by reference equality.\n   * No-op if the item is not in the index.\n   */\n  remove(item: T): void;\n  /**\n   * Monotonically increasing counter, incremented after every changed `add()` / `remove()` /\n   * `reindex()` / `setItems()` operation. Use as a cache-busting token when caching search\n   * results outside the index — `toSearchMatcher()` uses it for this purpose.\n   */\n  readonly revision: number;\n  /**\n   * Searches the index for `query` and returns results sorted by score descending.\n   *\n   * An empty (or whitespace-only) `query` returns all indexed items with `score = 1`.\n   * A `query` with no indexable content after normalization (e.g. punctuation-only) returns\n   * no results. Results below `threshold` are excluded. At most `limit` results are returned.\n   */\n  search(query: string, options?: SearchConstraints): SearchResult<T>[];\n  /**\n   * Reconciles the index to `items` by reference identity. Retained items are reindexed,\n   * new items are added, missing items are removed, and one mutation notification fires\n   * when indexed corpus or field values change. Duplicate references collapse to one item.\n   */\n  setItems(items: readonly T[]): void;\n  /** Number of items currently in the index. */\n  readonly size: number;\n}\n\nfunction requireFiniteInteger(value: number, name: string, minimum: number): number {\n  if (!Number.isFinite(value) || !Number.isInteger(value) || value < minimum) {\n    throw new ScoutConfigurationError(`${name} must be a finite integer greater than or equal to ${minimum}.`);\n  }\n\n  return value;\n}\n\nfunction requireFiniteNumber(value: number, name: string, minimum: number, maximum = Number.POSITIVE_INFINITY): number {\n  if (!Number.isFinite(value) || value < minimum || value > maximum) {\n    throw new ScoutConfigurationError(`${name} must be a finite number between ${minimum} and ${maximum}.`);\n  }\n\n  return value;\n}\n\nfunction resolveFields<T>(defs: ReadonlyArray<FieldDef<T>>): FieldConfig<T>[] {\n  return defs.map((def) => {\n    if (typeof def === 'string') {\n      return { field: def, stringify: defaultStringify, weight: 1 };\n    }\n\n    return {\n      field: def.field,\n      stringify: def.stringify ?? defaultStringify,\n      weight: requireFiniteNumber(def.weight ?? 1, `weight for field \"${def.field}\"`, Number.MIN_VALUE),\n    };\n  });\n}\n\n/**\n * Builds a trigram inverted index over `items` for fast fuzzy search.\n *\n * Construction is O(corpus × field_length). Subsequent `search()` calls are\n * O(candidates) — far faster than per-query Levenshtein for large corpora.\n *\n * @example\n * ```ts\n * const index = createIndex(users, {\n *   fields: [{ field: 'name', weight: 2 }, 'email'],\n *   threshold: 0.3,\n *   limit: 20,\n * });\n *\n * const results = index.search('alice');\n * ```\n *\n * @throws {ScoutConfigurationError} If options use an invalid field or numeric configuration.\n */\nexport function createIndex<T>(items: T[], options: ScoutIndexOptions<T>): ScoutIndex<T> {\n  if (options.fields.length === 0) {\n    throw new ScoutConfigurationError('createIndex: at least one field is required.');\n  }\n\n  const fields = resolveFields(options.fields);\n  const maxWeight = fields.reduce((max, f) => Math.max(max, f.weight), 1);\n  const defaultThreshold = requireFiniteNumber(options.threshold ?? 0.2, 'threshold', 0, 1);\n  const defaultLimit = requireFiniteInteger(options.limit ?? 50, 'limit', 0);\n  const defaultMinQueryLength = requireFiniteInteger(options.minQueryLength ?? 3, 'minQueryLength', 1);\n\n  /** item → per-item record, preserves insertion order for `items` getter */\n  const itemData = new Map<T, ItemRecord>();\n  /** trigram → set of items that contain it */\n  const invertedIndex = new Map<string, Set<T>>();\n  const mutationListeners = new Set<() => void>();\n  let revision = 0;\n\n  function notifyMutation(): void {\n    revision++;\n\n    for (const listener of mutationListeners) listener();\n  }\n\n  /** Single-entry cache for the most recent normalized query's trigrams (F2). */\n  let cachedNormalized: string | null = null;\n  let cachedTrigrams: Set<string> | null = null;\n\n  function getQueryTrigrams(normalized: string): Set<string> {\n    if (normalized === cachedNormalized && cachedTrigrams !== null) return cachedTrigrams;\n\n    cachedNormalized = normalized;\n    cachedTrigrams = generateTrigrams(normalized);\n\n    return cachedTrigrams;\n  }\n\n  function addFieldToIndex(item: T, fieldTrigrams: Set<string>): void {\n    for (const trigram of fieldTrigrams) {\n      let bucket = invertedIndex.get(trigram);\n\n      if (!bucket) {\n        bucket = new Set<T>();\n        invertedIndex.set(trigram, bucket);\n      }\n\n      bucket.add(item);\n    }\n  }\n\n  function removeFieldFromIndex(item: T, fieldTrigrams: Set<string>): void {\n    for (const trigram of fieldTrigrams) {\n      const bucket = invertedIndex.get(trigram);\n\n      if (bucket) {\n        bucket.delete(item);\n\n        if (bucket.size === 0) invertedIndex.delete(trigram);\n      }\n    }\n  }\n\n  function addItem(item: T): void {\n    const trigrams = new Map<string, Set<string>>();\n    const values = new Map<string, string>();\n\n    for (const { field, stringify } of fields) {\n      const raw = item[field];\n      const text = stringify(raw);\n      const normalized = tokenize(text);\n      const fieldTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n      trigrams.set(field, fieldTrigrams);\n      values.set(field, text);\n      addFieldToIndex(item, fieldTrigrams);\n    }\n\n    itemData.set(item, { trigrams, values });\n  }\n\n  /**\n   * Performs a full linear scan over all items for short queries.\n   * O(n × field_count) — acceptable for small corpora; consider raising\n   * `minQueryLength` on large datasets to avoid triggering this path.\n   */\n  function containmentScan(query: string): Set<T> {\n    const result = new Set<T>();\n\n    for (const [item, record] of itemData) {\n      for (const value of record.values.values()) {\n        if (value.toLowerCase().includes(query)) {\n          result.add(item);\n          break;\n        }\n      }\n    }\n\n    return result;\n  }\n\n  function trigramCandidates(queryTrigrams: Set<string>): Set<T> {\n    const candidates = new Set<T>();\n\n    for (const trigram of queryTrigrams) {\n      const items = invertedIndex.get(trigram);\n\n      if (items) {\n        for (const item of items) candidates.add(item);\n      }\n    }\n\n    return candidates;\n  }\n\n  function scoreCandidate(normalized: string, queryTrigrams: Set<string> | null, record: ItemRecord): number {\n    let bestScore = 0;\n\n    for (const { field, weight } of fields) {\n      let fieldScore: number;\n\n      if (queryTrigrams === null) {\n        const raw = record.values.get(field) ?? '';\n\n        fieldScore = raw.toLowerCase().includes(normalized) ? 1.0 : 0;\n      } else {\n        const itemTrigrams = record.trigrams.get(field);\n\n        if (!itemTrigrams || itemTrigrams.size === 0) continue;\n\n        fieldScore = overlapSimilarity(queryTrigrams, itemTrigrams);\n      }\n\n      const weighted = fieldScore * (weight / maxWeight);\n\n      if (weighted > bestScore) bestScore = weighted;\n    }\n\n    return bestScore;\n  }\n\n  function computeMatches(query: string, values: Map<string, string>): FieldMatch<keyof T & string>[] {\n    const matches: FieldMatch<keyof T & string>[] = [];\n\n    for (const { field } of fields) {\n      const text = values.get(field);\n\n      if (!text) continue;\n\n      const ranges = findMatchRanges(text, query);\n\n      if (ranges.length > 0) matches.push({ field, ranges });\n    }\n\n    return matches;\n  }\n\n  function reindexItem(item: T): boolean {\n    const record = itemData.get(item);\n\n    if (!record) return false;\n\n    let changed = false;\n\n    for (const { field, stringify } of fields) {\n      const newText = stringify(item[field]);\n      const oldText = record.values.get(field);\n\n      if (newText === oldText) continue;\n\n      changed = true;\n\n      const oldTrigrams = record.trigrams.get(field);\n\n      if (oldTrigrams) removeFieldFromIndex(item, oldTrigrams);\n\n      const normalized = tokenize(newText);\n      const newTrigrams = normalized.length >= 1 ? generateTrigrams(normalized) : new Set<string>();\n\n      record.trigrams.set(field, newTrigrams);\n      record.values.set(field, newText);\n      addFieldToIndex(item, newTrigrams);\n    }\n\n    return changed;\n  }\n\n  function removeItem(item: T): boolean {\n    const record = itemData.get(item);\n\n    if (!record) return false;\n\n    for (const fieldTrigrams of record.trigrams.values()) {\n      removeFieldFromIndex(item, fieldTrigrams);\n    }\n\n    itemData.delete(item);\n\n    return true;\n  }\n\n  for (const item of items) {\n    if (!itemData.has(item)) addItem(item);\n  }\n\n  const index: ScoutIndex<T> = {\n    add(item: T): void {\n      if (itemData.has(item)) return;\n\n      addItem(item);\n      notifyMutation();\n    },\n\n    get items(): readonly T[] {\n      return [...itemData.keys()];\n    },\n\n    onMutate(listener: () => void): () => void {\n      mutationListeners.add(listener);\n\n      return () => {\n        mutationListeners.delete(listener);\n      };\n    },\n\n    reindex(item: T): void {\n      if (reindexItem(item)) notifyMutation();\n    },\n\n    remove(item: T): void {\n      if (removeItem(item)) notifyMutation();\n    },\n\n    get revision(): number {\n      return revision;\n    },\n\n    search(query: string, options?: SearchConstraints): SearchResult<T>[] {\n      const threshold = requireFiniteNumber(options?.threshold ?? defaultThreshold, 'threshold', 0, 1);\n      const limit = requireFiniteInteger(options?.limit ?? defaultLimit, 'limit', 0);\n      const minQueryLength = requireFiniteInteger(\n        options?.minQueryLength ?? defaultMinQueryLength,\n        'minQueryLength',\n        1,\n      );\n\n      if (!query.trim()) {\n        return [...itemData.keys()].slice(0, limit).map((item) => ({ item, matches: [], score: 1 }));\n      }\n\n      const normalized = tokenize(query);\n\n      // Query had no indexable content (e.g. punctuation-only) — no match, not \"match all\".\n      if (!normalized) return [];\n\n      const isShort = normalized.length < minQueryLength;\n      const queryTrigrams = isShort ? null : getQueryTrigrams(normalized);\n      const candidates = queryTrigrams === null ? containmentScan(normalized) : trigramCandidates(queryTrigrams);\n      const results: SearchResult<T>[] = [];\n\n      for (const item of candidates) {\n        const record = itemData.get(item);\n\n        if (!record) continue;\n\n        const score = scoreCandidate(normalized, queryTrigrams, record);\n\n        if (score >= threshold) {\n          const matches = computeMatches(normalized, record.values);\n\n          results.push({ item, matches, score });\n        }\n      }\n\n      return results.sort((a, b) => b.score - a.score).slice(0, limit);\n    },\n\n    setItems(items: readonly T[]): void {\n      const incoming = new Set(items);\n      const next = [...incoming];\n      let changed = false;\n\n      for (const item of [...itemData.keys()]) {\n        if (incoming.has(item)) continue;\n\n        removeItem(item);\n        changed = true;\n      }\n\n      for (const item of next) {\n        if (!itemData.has(item)) {\n          addItem(item);\n          changed = true;\n        } else if (reindexItem(item)) {\n          changed = true;\n        }\n      }\n\n      const current = [...itemData.keys()];\n      const orderChanged = current.length !== next.length || current.some((item, index) => item !== next[index]);\n\n      if (orderChanged) {\n        const records = new Map(next.map((item) => [item, itemData.get(item)!]));\n\n        itemData.clear();\n\n        for (const [item, record] of records) itemData.set(item, record);\n\n        changed = true;\n      }\n\n      if (changed) notifyMutation();\n    },\n\n    get size(): number {\n      return itemData.size;\n    },\n  };\n\n  return index;\n}\n"],"mappings":";;;;;AA2EA,SAAS,EAAqB,GAAe,GAAc,GAAyB;CAClF,IAAI,CAAC,OAAO,SAAS,CAAK,KAAK,CAAC,OAAO,UAAU,CAAK,KAAK,IAAQ,GACjE,MAAM,IAAI,EAAwB,GAAG,EAAK,qDAAqD,EAAQ,EAAE;CAG3G,OAAO;AACT;AAEA,SAAS,EAAoB,GAAe,GAAc,GAAiB,IAAU,UAAkC;CACrH,IAAI,CAAC,OAAO,SAAS,CAAK,KAAK,IAAQ,KAAW,IAAQ,GACxD,MAAM,IAAI,EAAwB,GAAG,EAAK,mCAAmC,EAAQ,OAAO,EAAQ,EAAE;CAGxG,OAAO;AACT;AAEA,SAAS,EAAiB,GAAoD;CAC5E,OAAO,EAAK,KAAK,MACX,OAAO,KAAQ,WACV;EAAE,OAAO;EAAK,WAAW;EAAkB,QAAQ;CAAE,IAGvD;EACL,OAAO,EAAI;EACX,WAAW,EAAI,aAAa;EAC5B,QAAQ,EAAoB,EAAI,UAAU,GAAG,qBAAqB,EAAI,MAAM,IAAI,OAAO,SAAS;CAClG,CACD;AACH;AAqBA,SAAgB,EAAe,GAAY,GAA8C;CACvF,IAAI,EAAQ,OAAO,WAAW,GAC5B,MAAM,IAAI,EAAwB,8CAA8C;CAGlF,IAAM,IAAS,EAAc,EAAQ,MAAM,GACrC,IAAY,EAAO,QAAQ,GAAK,MAAM,KAAK,IAAI,GAAK,EAAE,MAAM,GAAG,CAAC,GAChE,IAAmB,EAAoB,EAAQ,aAAa,IAAK,aAAa,GAAG,CAAC,GAClF,IAAe,EAAqB,EAAQ,SAAS,IAAI,SAAS,CAAC,GACnE,IAAwB,EAAqB,EAAQ,kBAAkB,GAAG,kBAAkB,CAAC,GAG7F,oBAAW,IAAI,IAAmB,GAElC,oBAAgB,IAAI,IAAoB,GACxC,oBAAoB,IAAI,IAAgB,GAC1C,IAAW;CAEf,SAAS,IAAuB;EAC9B;EAEA,KAAK,IAAM,KAAY,GAAmB,EAAS;CACrD;CAGA,IAAI,IAAkC,MAClC,IAAqC;CAEzC,SAAS,EAAiB,GAAiC;EAMzD,OALI,MAAe,KAAoB,MAAmB,OAAa,KAEvE,IAAmB,GACnB,IAAiB,EAAiB,CAAU,GAErC;CACT;CAEA,SAAS,EAAgB,GAAS,GAAkC;EAClE,KAAK,IAAM,KAAW,GAAe;GACnC,IAAI,IAAS,EAAc,IAAI,CAAO;GAOtC,AALK,MACH,oBAAS,IAAI,IAAO,GACpB,EAAc,IAAI,GAAS,CAAM,IAGnC,EAAO,IAAI,CAAI;EACjB;CACF;CAEA,SAAS,EAAqB,GAAS,GAAkC;EACvE,KAAK,IAAM,KAAW,GAAe;GACnC,IAAM,IAAS,EAAc,IAAI,CAAO;GAExC,AAAI,MACF,EAAO,OAAO,CAAI,GAEd,EAAO,SAAS,KAAG,EAAc,OAAO,CAAO;EAEvD;CACF;CAEA,SAAS,EAAQ,GAAe;EAC9B,IAAM,oBAAW,IAAI,IAAyB,GACxC,oBAAS,IAAI,IAAoB;EAEvC,KAAK,IAAM,EAAE,UAAO,kBAAe,GAAQ;GACzC,IAAM,IAAM,EAAK,IACX,IAAO,EAAU,CAAG,GACpB,IAAa,EAAS,CAAI,GAC1B,IAAgB,EAAW,UAAU,IAAI,EAAiB,CAAU,oBAAI,IAAI,IAAY;GAI9F,AAFA,EAAS,IAAI,GAAO,CAAa,GACjC,EAAO,IAAI,GAAO,CAAI,GACtB,EAAgB,GAAM,CAAa;EACrC;EAEA,EAAS,IAAI,GAAM;GAAE;GAAU;EAAO,CAAC;CACzC;CAOA,SAAS,EAAgB,GAAuB;EAC9C,IAAM,oBAAS,IAAI,IAAO;EAE1B,KAAK,IAAM,CAAC,GAAM,MAAW,GAC3B,KAAK,IAAM,KAAS,EAAO,OAAO,OAAO,GACvC,IAAI,EAAM,YAAY,CAAC,CAAC,SAAS,CAAK,GAAG;GACvC,EAAO,IAAI,CAAI;GACf;EACF;EAIJ,OAAO;CACT;CAEA,SAAS,EAAkB,GAAoC;EAC7D,IAAM,oBAAa,IAAI,IAAO;EAE9B,KAAK,IAAM,KAAW,GAAe;GACnC,IAAM,IAAQ,EAAc,IAAI,CAAO;GAEvC,IAAI,GACF,KAAK,IAAM,KAAQ,GAAO,EAAW,IAAI,CAAI;EAEjD;EAEA,OAAO;CACT;CAEA,SAAS,EAAe,GAAoB,GAAmC,GAA4B;EACzG,IAAI,IAAY;EAEhB,KAAK,IAAM,EAAE,UAAO,eAAY,GAAQ;GACtC,IAAI;GAEJ,IAAI,MAAkB,MAGpB,IAAA,IAFY,EAAO,OAAO,IAAI,CAAK,KAAK,GAAA,CAEvB,YAAY,CAAC,CAAC,SAAS,CAAU;QAC7C;IACL,IAAM,IAAe,EAAO,SAAS,IAAI,CAAK;IAE9C,IAAI,CAAC,KAAgB,EAAa,SAAS,GAAG;IAE9C,IAAa,EAAkB,GAAe,CAAY;GAC5D;GAEA,IAAM,IAAyB,IAAS,IAAvB;GAEjB,AAAI,IAAW,MAAW,IAAY;EACxC;EAEA,OAAO;CACT;CAEA,SAAS,EAAe,GAAe,GAA6D;EAClG,IAAM,IAA0C,CAAC;EAEjD,KAAK,IAAM,EAAE,cAAW,GAAQ;GAC9B,IAAM,IAAO,EAAO,IAAI,CAAK;GAE7B,IAAI,CAAC,GAAM;GAEX,IAAM,IAAS,EAAgB,GAAM,CAAK;GAE1C,AAAI,EAAO,SAAS,KAAG,EAAQ,KAAK;IAAE;IAAO;GAAO,CAAC;EACvD;EAEA,OAAO;CACT;CAEA,SAAS,EAAY,GAAkB;EACrC,IAAM,IAAS,EAAS,IAAI,CAAI;EAEhC,IAAI,CAAC,GAAQ,OAAO;EAEpB,IAAI,IAAU;EAEd,KAAK,IAAM,EAAE,UAAO,kBAAe,GAAQ;GACzC,IAAM,IAAU,EAAU,EAAK,EAAM;GAGrC,IAAI,MAFY,EAAO,OAAO,IAAI,CAElB,GAAS;GAEzB,IAAU;GAEV,IAAM,IAAc,EAAO,SAAS,IAAI,CAAK;GAE7C,AAAI,KAAa,EAAqB,GAAM,CAAW;GAEvD,IAAM,IAAa,EAAS,CAAO,GAC7B,IAAc,EAAW,UAAU,IAAI,EAAiB,CAAU,oBAAI,IAAI,IAAY;GAI5F,AAFA,EAAO,SAAS,IAAI,GAAO,CAAW,GACtC,EAAO,OAAO,IAAI,GAAO,CAAO,GAChC,EAAgB,GAAM,CAAW;EACnC;EAEA,OAAO;CACT;CAEA,SAAS,EAAW,GAAkB;EACpC,IAAM,IAAS,EAAS,IAAI,CAAI;EAEhC,IAAI,CAAC,GAAQ,OAAO;EAEpB,KAAK,IAAM,KAAiB,EAAO,SAAS,OAAO,GACjD,EAAqB,GAAM,CAAa;EAK1C,OAFA,EAAS,OAAO,CAAI,GAEb;CACT;CAEA,KAAK,IAAM,KAAQ,GACjB,AAAK,EAAS,IAAI,CAAI,KAAG,EAAQ,CAAI;CAqHvC,OAAO;EAjHL,IAAI,GAAe;GACb,EAAS,IAAI,CAAI,MAErB,EAAQ,CAAI,GACZ,EAAe;EACjB;EAEA,IAAI,QAAsB;GACxB,OAAO,CAAC,GAAG,EAAS,KAAK,CAAC;EAC5B;EAEA,SAAS,GAAkC;GAGzC,OAFA,EAAkB,IAAI,CAAQ,SAEjB;IACX,EAAkB,OAAO,CAAQ;GACnC;EACF;EAEA,QAAQ,GAAe;GACrB,AAAI,EAAY,CAAI,KAAG,EAAe;EACxC;EAEA,OAAO,GAAe;GACpB,AAAI,EAAW,CAAI,KAAG,EAAe;EACvC;EAEA,IAAI,WAAmB;GACrB,OAAO;EACT;EAEA,OAAO,GAAe,GAAgD;GACpE,IAAM,IAAY,EAAoB,GAAS,aAAa,GAAkB,aAAa,GAAG,CAAC,GACzF,IAAQ,EAAqB,GAAS,SAAS,GAAc,SAAS,CAAC,GACvE,IAAiB,EACrB,GAAS,kBAAkB,GAC3B,kBACA,CACF;GAEA,IAAI,CAAC,EAAM,KAAK,GACd,OAAO,CAAC,GAAG,EAAS,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,CAAK,CAAC,CAAC,KAAK,OAAU;IAAE;IAAM,SAAS,CAAC;IAAG,OAAO;GAAE,EAAE;GAG7F,IAAM,IAAa,EAAS,CAAK;GAGjC,IAAI,CAAC,GAAY,OAAO,CAAC;GAGzB,IAAM,IADU,EAAW,SAAS,IACJ,OAAO,EAAiB,CAAU,GAC5D,IAAa,MAAkB,OAAO,EAAgB,CAAU,IAAI,EAAkB,CAAa,GACnG,IAA6B,CAAC;GAEpC,KAAK,IAAM,KAAQ,GAAY;IAC7B,IAAM,IAAS,EAAS,IAAI,CAAI;IAEhC,IAAI,CAAC,GAAQ;IAEb,IAAM,IAAQ,EAAe,GAAY,GAAe,CAAM;IAE9D,IAAI,KAAS,GAAW;KACtB,IAAM,IAAU,EAAe,GAAY,EAAO,MAAM;KAExD,EAAQ,KAAK;MAAE;MAAM;MAAS;KAAM,CAAC;IACvC;GACF;GAEA,OAAO,EAAQ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAK;EACjE;EAEA,SAAS,GAA2B;GAClC,IAAM,IAAW,IAAI,IAAI,CAAK,GACxB,IAAO,CAAC,GAAG,CAAQ,GACrB,IAAU;GAEd,KAAK,IAAM,KAAQ,CAAC,GAAG,EAAS,KAAK,CAAC,GAChC,EAAS,IAAI,CAAI,MAErB,EAAW,CAAI,GACf,IAAU;GAGZ,KAAK,IAAM,KAAQ,GACjB,AAAK,EAAS,IAAI,CAAI,IAGX,EAAY,CAAI,MACzB,IAAU,OAHV,EAAQ,CAAI,GACZ,IAAU;GAMd,IAAM,IAAU,CAAC,GAAG,EAAS,KAAK,CAAC;GAGnC,IAFqB,EAAQ,WAAW,EAAK,UAAU,EAAQ,MAAM,GAAM,MAAU,MAAS,EAAK,EAAM,GAEvF;IAChB,IAAM,IAAU,IAAI,IAAI,EAAK,KAAK,MAAS,CAAC,GAAM,EAAS,IAAI,CAAI,CAAE,CAAC,CAAC;IAEvE,EAAS,MAAM;IAEf,KAAK,IAAM,CAAC,GAAM,MAAW,GAAS,EAAS,IAAI,GAAM,CAAM;IAE/D,IAAU;GACZ;GAEA,AAAI,KAAS,EAAe;EAC9B;EAEA,IAAI,OAAe;GACjB,OAAO,EAAS;EAClB;CAGK;AACT"}

package/dist/scout.cjs

@@ -1,2 +1,2 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});var e=new WeakMap;function t(t){return e.get(t)?.()??0}function n(t,n){e.set(t,n)}function r(e,n){let r,i=-1,a=new Set;return(o,s)=>{let c=t(e);return(s!==r||c!==i)&&(r=s,i=c,a=new Set(e.search(s,n).map(e=>e.item))),a.has(o)}}function i(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var a=class e extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}static is(t){return t instanceof e}},o=class extends a{},s=class extends a{};function c(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function l(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 u(e,t){let n=e.toLowerCase(),r=c(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 d(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 f(e,t,n){return d(n,e.matches.find(e=>e.field===t)?.ranges??[])}var p=class e extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}static is(t){return t instanceof e}},m=class extends p{},h=class extends p{},g=class extends p{},_=class extends p{},v=Symbol(`ripple.reactive`),y=Symbol(`ripple.signal`),b=Symbol(`ripple.computed`),x=100,S=Symbol(`ripple.unset`),C=class{[v]=!0;dependents=new Set;name;runtime;constructor(e,t){this.runtime=e,this.name=t}subscribe(e){this.runtime.assertActive(),this.peek();let t={dependencies:new Set,onDependencyChanged:()=>this.runtime.enqueueListener(e)};return this.dependents.add(t),()=>this.dependents.delete(t)}notify(){for(let e of[...this.dependents])e.onDependencyChanged()}},w=class extends C{[y]=!0;current;equals;constructor(e,t,n){super(e,n?.name),this.current=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.current}set value(e){if(this.runtime.assertActive(),this.equals(this.current,e))return;let t=this.current;this.current=e,this.runtime.emit({kind:`write`,name:this.name,next:e,previous:t}),this.runtime.propagate(()=>this.notify())}peek(){return this.current}},T=class extends C{[b]=!0;dependencies=new Set;computing=!1;disposed=!1;dirty=!0;current=S;derive;equals;constructor(e,t,n){super(e,n?.name),this.derive=t,this.equals=n?.equals??Object.is}get value(){return this.refresh(),this.runtime.track(this),this.current}peek(){return this.refresh(),this.current}onDependencyChanged(){this.disposed||(this.dirty||=!0,this.dependents.size>0&&this.refresh()&&this.notify())}dispose(){this.disposed||(this.disposed=!0,this.runtime.clearDependencies(this),this.dependents.clear())}refresh(){if(!this.dirty||this.disposed)return!1;if(this.computing)throw new m(`computed cycle detected${this.name===void 0?``:` "${this.name}"`}`);this.computing=!0,this.runtime.emit({kind:`compute`,name:this.name});try{let e=this.runtime.collect(this,this.derive),t=this.current===S||!this.equals(this.current,e);return this.current=e,this.dirty=!1,t}finally{this.computing=!1}}},E=class{disposalController=new AbortController;owned=new Set;name;isDisposed=!1;runtime;constructor(e,t){this.runtime=e,this.name=t}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}run(e){if(this.isDisposed)throw new g(`Cannot run a disposed scope.`);return this.runtime.withScope(this,e)}dispose(){if(!this.isDisposed){this.isDisposed=!0;for(let e of[...this.owned].reverse())e.dispose();this.owned.clear(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.name,node:`scope`})}}[Symbol.dispose](){this.dispose()}},D=class{dependencies=new Set;disposalController=new AbortController;cleanup;isDisposed=!1;owner;scheduled=!1;callback;options;runtime;constructor(e,t,n){this.runtime=e,this.callback=t,this.options=n}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}onDependencyChanged(){if(!this.isDisposed){if(this.options?.scheduler===`microtask`){if(this.scheduled)return;this.scheduled=!0,queueMicrotask(()=>{this.scheduled=!1,this.isDisposed||this.runtime.enqueue(this)});return}this.runtime.enqueue(this)}}run(){if(this.isDisposed)return;this.owner?.dispose(),this.owner=void 0,this.runCleanup(),this.runtime.emit({kind:`effect`,name:this.options?.name});let e=new E(this.runtime);try{let t=this.runtime.withEffectScope(e,()=>this.runtime.collectEffect(this,this.callback));this.owner=e,this.cleanup=typeof t==`function`?t:void 0}catch(t){e.dispose(),this.runtime.report(t,{kind:`effect`,name:this.options?.name})}}dispose(){this.isDisposed||(this.isDisposed=!0,this.owner?.dispose(),this.owner=void 0,this.runtime.clearDependencies(this),this.runCleanup(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.options?.name,node:`effect`}))}[Symbol.dispose](){this.dispose()}runCleanup(){let e=this.cleanup;if(this.cleanup=void 0,e!==void 0)try{e()}catch(e){this.runtime.report(e,{kind:`cleanup`,name:this.options?.name})}}},O=class{activeEffectScope;activeObserver;activeScope;isDisposed=!1;flushDepth=0;flushing=!1;pending=new Set;listeners=new Set;rootScope;observer;onError;constructor(e){this.observer=e?.observer,this.onError=e?.onError??(e=>{queueMicrotask(()=>{throw e})}),this.rootScope=new E(this,`runtime`),this.activeScope=this.rootScope}get disposed(){return this.isDisposed}signal=(e,t)=>(this.assertActive(),new w(this,e,t));computed=(e,t)=>{this.assertActive();let n=new T(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n};effect=(e,t)=>{this.assertActive();let n=new D(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n.run(),n};createScope=e=>{this.assertActive();let t=new E(this,e);return this.activeScope.owned.add(t),t};batch=e=>(this.assertActive(),this.propagate(e));untrack=e=>(this.assertActive(),this.withObserver(void 0,e));dispose(){this.isDisposed||(this.isDisposed=!0,this.rootScope.dispose())}assertActive(){if(this.isDisposed)throw new h(`Cannot use a disposed Ripple runtime.`)}track(e){let t=this.activeObserver;t?.collecting!==void 0&&t.collecting.add(e)}clearDependencies(e){for(let t of e.dependencies)t.dependents.delete(e);e.dependencies.clear()}collect(e,t){return this.collectWith(e,t,!1)}collectEffect(e,t){return this.collectWith(e,t,!0)}withEffectScope(e,t){let n=this.activeEffectScope;this.activeEffectScope=e;try{return t()}finally{this.activeEffectScope=n}}withObserver(e,t){let n=this.activeObserver;this.activeObserver=e;try{return t()}finally{this.activeObserver=n}}withScope(e,t){let n=this.activeEffectScope,r=this.activeScope;this.activeEffectScope=void 0,this.activeScope=e;try{return t()}finally{this.activeEffectScope=n,this.activeScope=r}}enqueue(e){this.pending.add(e),this.flushDepth===0&&this.flush()}enqueueListener(e){this.listeners.add(e),this.flushDepth===0&&this.flush()}propagate(e){this.flushDepth++;try{return e()}finally{this.flushDepth--,this.flushDepth===0&&this.flush()}}emit(e){try{this.observer?.(e)}catch(t){this.report(t,{kind:`observer`,name:e.name})}}report(e,t){try{this.onError(e,t)}catch(e){queueMicrotask(()=>{throw e})}}collectWith(e,t,n){let r=this.activeObserver,i=new Set;e.collecting=i,this.activeObserver=e;try{let n=t();return this.commitDependencies(e,i),n}catch(t){throw n&&this.commitDependencies(e,i),t}finally{e.collecting=void 0,this.activeObserver=r}}commitDependencies(e,t){for(let n of e.dependencies)t.has(n)||n.dependents.delete(e);for(let n of t)e.dependencies.has(n)||n.dependents.add(e);e.dependencies.clear();for(let n of t)e.dependencies.add(n)}flush(){if(this.flushing)return;this.flushing=!0;let e=0;try{for(;this.pending.size>0||this.listeners.size>0;){if(++e>x)throw new _(`infinite reactive flush (>${x} iterations)`);let t=[...this.pending],n=[...this.listeners];this.pending.clear(),this.listeners.clear();for(let e of t)e.run();for(let e of n)try{e()}catch(e){this.report(e,{kind:`listener`})}}}finally{this.flushing=!1}}},k=e=>(t,n,r)=>{let i=e.signal({status:`pending`},{name:r?.name}),a=e.signal(0),o=new AbortController,s,c=!1,l=()=>{a.value,s?.abort();let e=i.peek(),r=e.status===`success`?e.value:`previous`in e?e.previous:void 0,o;try{o=t()}catch(e){i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`};return}let l=new AbortController;s=l,i.value=r===void 0?{status:`pending`}:{previous:r,status:`pending`};let u;try{u=Promise.resolve(n(o,{signal:l.signal}))}catch(e){u=Promise.reject(e)}u.then(e=>{!c&&!l.signal.aborted&&(i.value={status:`success`,value:e})},e=>{!c&&!l.signal.aborted&&(i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`})})},u=e.effect(()=>(l(),()=>s?.abort()),{name:r?.name});return u.disposalSignal.addEventListener(`abort`,()=>{c=!0,o.abort()},{once:!0}),{get disposalSignal(){return o.signal},dispose:()=>u.dispose(),get disposed(){return c},get name(){return i.name},peek:()=>i.peek(),reload:()=>{c||(a.value=a.peek()+1)},subscribe:e=>i.subscribe(e),[Symbol.dispose](){this.dispose()},get value(){return i.value}}},A=e=>(t,n)=>{let r=e.signal(t,{name:n?.name});return{get name(){return r.name},peek:()=>r.peek(),set:e=>{r.value=e},subscribe:e=>r.subscribe(e),update:e=>{r.value=e(r.peek())},get value(){return r.value}}},j=e=>(t,n,r)=>{let i=typeof t==`function`?t:()=>t.value,a=r?.equals??Object.is,o=!0,s,c=!1,l=e.effect(()=>{let e=i();if(o){o=!1,s=e,r?.immediate&&n(e,void 0),c=r?.once===!0&&r.immediate===!0;return}if(a(s,e))return;let t=s;s=e,n(e,t),r?.once&&l.dispose()},{name:r?.name});return c&&l.dispose(),l},M=(e=>{let t=new O(e),n=k(t),r=A(t);return{batch:t.batch,computed:t.computed,createScope:t.createScope,createStore:r,dispose:()=>t.dispose(),get disposed(){return t.disposed},effect:t.effect,resource:n,signal:t.signal,untrack:t.untrack,watch:j(t)}})(),N=M.signal,P=M.computed;M.effect;var F=M.batch;M.createScope,M.untrack;function I(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 L(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 R(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new s(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function z(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new s(`${t} must be a finite number between ${n} and ${r}.`);return e}function B(e){return e.map(e=>typeof e==`string`?{field:e,stringify:l,weight:1}:{field:e.field,stringify:e.stringify??l,weight:z(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function V(e,t){if(t.fields.length===0)throw new s(`createIndex: at least one field is required.`);let r=B(t.fields),i=r.reduce((e,t)=>Math.max(e,t.weight),1),a=z(t.threshold??.2,`threshold`,0,1),o=R(t.limit??50,`limit`,0),l=R(t.minQueryLength??3,`minQueryLength`,1),d=new Map,f=new Map,p=new Set,m=0;function h(){m++;for(let e of p)e()}let g=null,_=null;function v(e){return e===g&&_!==null?_:(g=e,_=I(e),_)}function y(e,t){for(let n of t){let t=f.get(n);t||(t=new Set,f.set(n,t)),t.add(e)}}function b(e,t){for(let n of t){let t=f.get(n);t&&(t.delete(e),t.size===0&&f.delete(n))}}function x(e){let t=new Map,n=new Map;for(let{field:i,stringify:a}of r){let r=e[i],o=a(r),s=c(o),l=s.length>=1?I(s):new Set;t.set(i,l),n.set(i,o),y(e,l)}d.set(e,{trigrams:t,values:n})}function S(e){let t=new Set;for(let[n,r]of d)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function C(e){let t=new Set;for(let n of e){let e=f.get(n);if(e)for(let n of e)t.add(n)}return t}function w(e,t,n){let a=0;for(let{field:o,weight:s}of r){let r;if(t===null)r=+!!(n.values.get(o)??``).toLowerCase().includes(e);else{let e=n.trigrams.get(o);if(!e||e.size===0)continue;r=L(t,e)}let c=s/i*r;c>a&&(a=c)}return a}function T(e,t){let n=[];for(let{field:i}of r){let r=t.get(i);if(!r)continue;let a=u(r,e);a.length>0&&n.push({field:i,ranges:a})}return n}function E(e){let t=d.get(e);if(!t)return!1;let n=!1;for(let{field:i,stringify:a}of r){let r=a(e[i]);if(r===t.values.get(i))continue;n=!0;let o=t.trigrams.get(i);o&&b(e,o);let s=c(r),l=s.length>=1?I(s):new Set;t.trigrams.set(i,l),t.values.set(i,r),y(e,l)}return n}function D(e){let t=d.get(e);if(!t)return!1;for(let n of t.trigrams.values())b(e,n);return d.delete(e),!0}for(let t of e)d.has(t)||x(t);let O={add(e){d.has(e)||(x(e),h())},get items(){return[...d.keys()]},onMutate(e){return p.add(e),()=>{p.delete(e)}},reindex(e){E(e)&&h()},remove(e){D(e)&&h()},search(e,t){let n=z(t?.threshold??a,`threshold`,0,1),r=R(t?.limit??o,`limit`,0),i=R(t?.minQueryLength??l,`minQueryLength`,1);if(!e.trim())return[...d.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let s=c(e);if(!s)return[];let u=s.length<i?null:v(s),f=u===null?S(s):C(u),p=[];for(let e of f){let t=d.get(e);if(!t)continue;let r=w(s,u,t);if(r>=n){let n=T(s,t.values);p.push({item:e,matches:n,score:r})}}return p.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[...d.keys()])t.has(e)||(D(e),r=!0);for(let e of n)d.has(e)?E(e)&&(r=!0):(x(e),r=!0);let i=[...d.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,d.get(e)]));d.clear();for(let[t,n]of e)d.set(t,n);r=!0}r&&h()},get size(){return d.size}};return n(O,()=>m),O}var H=200;function U(e,t={}){let{debounce:n=H,limit:r,minQueryLength:i,threshold:a}=t;if(!Number.isFinite(n)||!Number.isInteger(n)||n<0)throw new s(`debounce must be a finite non-negative integer.`);let c=N(``,{name:`scout:query`}),l=N(``,{name:`scout:committedQuery`}),u=N(0,{name:`scout:indexVersion`}),d=e.onMutate(()=>{u.value++}),f=P(()=>c.value!==l.value,{name:`scout:isSearching`}),p=P(()=>(u.value,e.search(l.value,{limit:r,minQueryLength:i,threshold:a})),{name:`scout:results`}),m=null;function h(){m!==null&&(clearTimeout(m),m=null)}let g=c.subscribe(()=>{let e=c.peek();if(h(),e!==l.peek()){if(n===0){l.value=e;return}m=setTimeout(()=>{l.value=e,m=null},n)}});function _(){if(v)throw new o(`SearchState.clear() called after dispose()`);h(),F(()=>{c.value=``,l.value=``})}let v=!1,y=new AbortController;function b(){v=!0,y.abort(),h(),g(),d()}return{clear:_,get disposalSignal(){return y.signal},dispose:b,get disposed(){return v},isSearching:f,query:c,results:p,[Symbol.dispose](){b()}}}function W(e,t){let n=V(e,{fields:t.fields,limit:t.limit,minQueryLength:t.minQueryLength,threshold:t.threshold}),r=U(n,{debounce:t.debounce});return Object.assign(Object.create(r),{index:n})}function G(e){let t=q();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var K;function q(){return K===void 0&&(K=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),K}exports.ScoutConfigurationError=s,exports.ScoutDisposedError=o,exports.ScoutError=a,exports.createIndex=V,exports.createReactiveSearch=W,exports.createSearch=U,exports.findMatchRanges=u,exports.highlight=d,exports.highlightField=f,exports.segmentWords=G,exports.toFilterPredicate=i,exports.toSearchMatcher=r;
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});function e(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 t(e,t,n){let r=new Set(e.search(t,n).map(e=>e.item));return e=>r.has(e)}var n=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},r=class extends n{},i=class extends n{};function a(e){return e.toLowerCase().replace(/[^\p{L}\p{N}\s']/gu,` `).trim().replace(/\s+/g,` `)}function o(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 s(e,t){let n=e.toLowerCase(),r=a(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 o=[];for(let e of i){let t=o[o.length-1];t&&e[0]<=t[1]?t[1]=Math.max(t[1],e[1]):o.push([e[0],e[1]])}return o}function c(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 l(e,t,n){return c(n,e.matches.find(e=>e.field===t)?.ranges??[])}var u=class extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}},d=class extends u{},f=class extends u{},p=class extends u{},m=class extends u{},h=Symbol.for(`@vielzeug/ripple/reactive`),g=100,_=Symbol(`ripple.unset`),v=class{[h]=!0;dependents=new Set;name;runtime;constructor(e,t){this.runtime=e,this.name=t}subscribe(e){this.runtime.assertActive(),this.peek();let t={dependencies:new Set,onDependencyChanged:()=>this.runtime.enqueueListener(e)};return this.dependents.add(t),()=>this.dependents.delete(t)}notify(){for(let e of[...this.dependents])e.onDependencyChanged()}},y=class extends v{current;equals;constructor(e,t,n){super(e,n?.name),this.current=t,this.equals=n?.equals??Object.is}get value(){return this.runtime.track(this),this.current}set value(e){if(this.runtime.assertActive(),this.equals(this.current,e))return;let t=this.current;this.current=e,this.runtime.emit({kind:`write`,name:this.name,next:e,previous:t}),this.runtime.propagate(()=>this.notify())}peek(){return this.current}update(e){this.value=e(this.current)}},b=class extends v{dependencies=new Set;computing=!1;disposed=!1;dirty=!0;current=_;derive;equals;constructor(e,t,n){super(e,n?.name),this.derive=t,this.equals=n?.equals??Object.is}get value(){return this.refresh(),this.runtime.track(this),this.current}peek(){return this.refresh(),this.current}onDependencyChanged(){this.disposed||(this.dirty||=!0,this.dependents.size>0&&this.refresh()&&this.notify())}dispose(){this.disposed||(this.disposed=!0,this.runtime.clearDependencies(this),this.dependents.clear())}refresh(){if(!this.dirty||this.disposed)return!1;if(this.computing)throw new d(`computed cycle detected${this.name===void 0?``:` "${this.name}"`}`);this.computing=!0,this.runtime.emit({kind:`compute`,name:this.name});try{let e=this.runtime.collect(this,this.derive),t=this.current===_||!this.equals(this.current,e);return this.current=e,this.dirty=!1,t}finally{this.computing=!1}}},x=class{disposalController=new AbortController;owned=new Set;name;isDisposed=!1;runtime;constructor(e,t){this.runtime=e,this.name=t}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}run(e){if(this.isDisposed)throw new p(`Cannot run a disposed scope.`);return this.runtime.withScope(this,e)}dispose(){if(!this.isDisposed){this.isDisposed=!0;for(let e of[...this.owned].reverse())e.dispose();this.owned.clear(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.name,node:`scope`})}}[Symbol.dispose](){this.dispose()}},S=class{dependencies=new Set;disposalController=new AbortController;cleanup;isDisposed=!1;owner;scheduled=!1;callback;options;runtime;constructor(e,t,n){this.runtime=e,this.callback=t,this.options=n}get disposed(){return this.isDisposed}get disposalSignal(){return this.disposalController.signal}onDependencyChanged(){if(!this.isDisposed){if(this.options?.scheduler===`microtask`){if(this.scheduled)return;this.scheduled=!0,queueMicrotask(()=>{this.scheduled=!1,this.isDisposed||this.runtime.enqueue(this)});return}this.runtime.enqueue(this)}}run(){if(this.isDisposed)return;this.owner?.dispose(),this.owner=void 0,this.runCleanup(),this.runtime.emit({kind:`effect`,name:this.options?.name});let e=new x(this.runtime);try{let t=this.runtime.withEffectScope(e,()=>this.runtime.collectEffect(this,this.callback));this.owner=e,this.cleanup=typeof t==`function`?t:void 0}catch(t){e.dispose(),this.runtime.report(t,{kind:`effect`,name:this.options?.name})}}dispose(){this.isDisposed||(this.isDisposed=!0,this.owner?.dispose(),this.owner=void 0,this.runtime.clearDependencies(this),this.runCleanup(),this.disposalController.abort(),this.runtime.emit({kind:`dispose`,name:this.options?.name,node:`effect`}))}[Symbol.dispose](){this.dispose()}runCleanup(){let e=this.cleanup;if(this.cleanup=void 0,e!==void 0)try{e()}catch(e){this.runtime.report(e,{kind:`cleanup`,name:this.options?.name})}}},C=class{activeEffectScope;activeObserver;activeScope;isDisposed=!1;flushDepth=0;flushing=!1;pending=new Set;listeners=new Set;rootScope;observer;onError;constructor(e){this.observer=e?.observer,this.onError=e?.onError??(e=>{queueMicrotask(()=>{throw e})}),this.rootScope=new x(this,`runtime`),this.activeScope=this.rootScope}get disposed(){return this.isDisposed}signal=(e,t)=>(this.assertActive(),new y(this,e,t));computed=(e,t)=>{this.assertActive();let n=new b(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n};effect=(e,t)=>{this.assertActive();let n=new S(this,e,t);return(this.activeEffectScope??this.activeScope).owned.add(n),n.run(),n};createScope=e=>{this.assertActive();let t=new x(this,e);return this.activeScope.owned.add(t),t};batch=e=>(this.assertActive(),this.propagate(e));untrack=e=>(this.assertActive(),this.withObserver(void 0,e));dispose(){this.isDisposed||(this.isDisposed=!0,this.rootScope.dispose())}assertActive(){if(this.isDisposed)throw new f(`Cannot use a disposed Ripple runtime.`)}track(e){let t=this.activeObserver;t?.collecting!==void 0&&t.collecting.add(e)}clearDependencies(e){for(let t of e.dependencies)t.dependents.delete(e);e.dependencies.clear()}collect(e,t){return this.collectWith(e,t,!1)}collectEffect(e,t){return this.collectWith(e,t,!0)}withEffectScope(e,t){let n=this.activeEffectScope;this.activeEffectScope=e;try{return t()}finally{this.activeEffectScope=n}}withObserver(e,t){let n=this.activeObserver;this.activeObserver=e;try{return t()}finally{this.activeObserver=n}}withScope(e,t){let n=this.activeEffectScope,r=this.activeScope;this.activeEffectScope=void 0,this.activeScope=e;try{return t()}finally{this.activeEffectScope=n,this.activeScope=r}}enqueue(e){this.pending.add(e),this.flushDepth===0&&this.flush()}enqueueListener(e){this.listeners.add(e),this.flushDepth===0&&this.flush()}propagate(e){this.flushDepth++;try{return e()}finally{this.flushDepth--,this.flushDepth===0&&this.flush()}}emit(e){try{this.observer?.(e)}catch(t){this.report(t,{kind:`observer`,name:e.name})}}report(e,t){try{this.onError(e,t)}catch(e){queueMicrotask(()=>{throw e})}}collectWith(e,t,n){let r=this.activeObserver,i=new Set;e.collecting=i,this.activeObserver=e;try{let n=t();return this.commitDependencies(e,i),n}catch(t){throw n&&this.commitDependencies(e,i),t}finally{e.collecting=void 0,this.activeObserver=r}}commitDependencies(e,t){for(let n of e.dependencies)t.has(n)||n.dependents.delete(e);for(let n of t)e.dependencies.has(n)||n.dependents.add(e);e.dependencies.clear();for(let n of t)e.dependencies.add(n)}flush(){if(this.flushing)return;this.flushing=!0;let e=0;try{for(;this.pending.size>0||this.listeners.size>0;){if(++e>g)throw new m(`infinite reactive flush (>${g} iterations)`);let t=[...this.pending],n=[...this.listeners];this.pending.clear(),this.listeners.clear();for(let e of t)e.run();for(let e of n)try{e()}catch(e){this.report(e,{kind:`listener`})}}}finally{this.flushing=!1}}},w=e=>(t,n,r)=>{let i=e.signal({status:`pending`},{name:r?.name}),a=e.signal(0),o,s=!1,c=()=>{a.value,o?.abort();let e=i.peek(),r=e.status===`success`?e.value:`previous`in e?e.previous:void 0,c;try{c=t()}catch(e){i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`};return}let l=new AbortController;o=l,i.value=r===void 0?{status:`pending`}:{previous:r,status:`pending`};let u;try{u=Promise.resolve(n(c,{signal:l.signal}))}catch(e){u=Promise.reject(e)}u.then(e=>{!s&&!l.signal.aborted&&(i.value={status:`success`,value:e})},e=>{!s&&!l.signal.aborted&&(i.value=r===void 0?{error:e,status:`error`}:{error:e,previous:r,status:`error`})})},l=e.effect(()=>(c(),()=>o?.abort()),{name:r?.name});l.disposalSignal.addEventListener(`abort`,()=>{s=!0},{once:!0});let u={get disposalSignal(){return l.disposalSignal},dispose:()=>l.dispose(),get disposed(){return s},get name(){return i.name},peek:()=>i.peek(),reload:()=>{s||(a.value=a.peek()+1)},subscribe:e=>i.subscribe(e),[Symbol.dispose](){this.dispose()},get value(){return i.value}};return Object.defineProperty(u,h,{value:!0}),u},T=e=>(t,n,r)=>{let i=typeof t==`function`?t:()=>t.value,a=r?.equals??Object.is,o=!0,s,c=!1,l=e.effect(()=>{let e=i();if(o){o=!1,s=e,r?.immediate&&(n(e,void 0),r?.once&&(c=!0));return}if(a(s,e))return;let t=s;s=e,n(e,t),r?.once&&l.dispose()},{name:r?.name});return c&&l.dispose(),l},E=(e=>{let t=new C(e),n=w(t);return{batch:t.batch,computed:t.computed,createScope:t.createScope,dispose:()=>t.dispose(),get disposed(){return t.disposed},effect:t.effect,resource:n,signal:t.signal,untrack:t.untrack,watch:T(t)}})(),D=E.signal,O=E.computed;E.effect;var k=E.batch;E.createScope,E.untrack,E.watch,E.resource;function A(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 j(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 M(e,t,n){if(!Number.isFinite(e)||!Number.isInteger(e)||e<n)throw new i(`${t} must be a finite integer greater than or equal to ${n}.`);return e}function N(e,t,n,r=1/0){if(!Number.isFinite(e)||e<n||e>r)throw new i(`${t} must be a finite number between ${n} and ${r}.`);return e}function P(e){return e.map(e=>typeof e==`string`?{field:e,stringify:o,weight:1}:{field:e.field,stringify:e.stringify??o,weight:N(e.weight??1,`weight for field "${e.field}"`,Number.MIN_VALUE)})}function F(e,t){if(t.fields.length===0)throw new i(`createIndex: at least one field is required.`);let n=P(t.fields),r=n.reduce((e,t)=>Math.max(e,t.weight),1),o=N(t.threshold??.2,`threshold`,0,1),c=M(t.limit??50,`limit`,0),l=M(t.minQueryLength??3,`minQueryLength`,1),u=new Map,d=new Map,f=new Set,p=0;function m(){p++;for(let e of f)e()}let h=null,g=null;function _(e){return e===h&&g!==null?g:(h=e,g=A(e),g)}function v(e,t){for(let n of t){let t=d.get(n);t||(t=new Set,d.set(n,t)),t.add(e)}}function y(e,t){for(let n of t){let t=d.get(n);t&&(t.delete(e),t.size===0&&d.delete(n))}}function b(e){let t=new Map,r=new Map;for(let{field:i,stringify:o}of n){let n=e[i],s=o(n),c=a(s),l=c.length>=1?A(c):new Set;t.set(i,l),r.set(i,s),v(e,l)}u.set(e,{trigrams:t,values:r})}function x(e){let t=new Set;for(let[n,r]of u)for(let i of r.values.values())if(i.toLowerCase().includes(e)){t.add(n);break}return t}function S(e){let t=new Set;for(let n of e){let e=d.get(n);if(e)for(let n of e)t.add(n)}return t}function C(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=j(t,e)}let c=s/r*n;c>a&&(a=c)}return a}function w(e,t){let r=[];for(let{field:i}of n){let n=t.get(i);if(!n)continue;let a=s(n,e);a.length>0&&r.push({field:i,ranges:a})}return r}function T(e){let t=u.get(e);if(!t)return!1;let r=!1;for(let{field:i,stringify:o}of n){let n=o(e[i]);if(n===t.values.get(i))continue;r=!0;let s=t.trigrams.get(i);s&&y(e,s);let c=a(n),l=c.length>=1?A(c):new Set;t.trigrams.set(i,l),t.values.set(i,n),v(e,l)}return r}function E(e){let t=u.get(e);if(!t)return!1;for(let n of t.trigrams.values())y(e,n);return u.delete(e),!0}for(let t of e)u.has(t)||b(t);return{add(e){u.has(e)||(b(e),m())},get items(){return[...u.keys()]},onMutate(e){return f.add(e),()=>{f.delete(e)}},reindex(e){T(e)&&m()},remove(e){E(e)&&m()},get revision(){return p},search(e,t){let n=N(t?.threshold??o,`threshold`,0,1),r=M(t?.limit??c,`limit`,0),i=M(t?.minQueryLength??l,`minQueryLength`,1);if(!e.trim())return[...u.keys()].slice(0,r).map(e=>({item:e,matches:[],score:1}));let s=a(e);if(!s)return[];let d=s.length<i?null:_(s),f=d===null?x(s):S(d),p=[];for(let e of f){let t=u.get(e);if(!t)continue;let r=C(s,d,t);if(r>=n){let n=w(s,t.values);p.push({item:e,matches:n,score:r})}}return p.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[...u.keys()])t.has(e)||(E(e),r=!0);for(let e of n)u.has(e)?T(e)&&(r=!0):(b(e),r=!0);let i=[...u.keys()];if(i.length!==n.length||i.some((e,t)=>e!==n[t])){let e=new Map(n.map(e=>[e,u.get(e)]));u.clear();for(let[t,n]of e)u.set(t,n);r=!0}r&&m()},get size(){return u.size}}}var I=200;function L(e,t={}){let{debounce:n=I,limit:a,minQueryLength:o,threshold:s}=t;if(!Number.isFinite(n)||!Number.isInteger(n)||n<0)throw new i(`debounce must be a finite non-negative integer.`);let c=D(``,{name:`scout:query`}),l=D(``,{name:`scout:committedQuery`}),u=D(0,{name:`scout:indexVersion`}),d=e.onMutate(()=>{u.value++}),f=O(()=>c.value!==l.value,{name:`scout:isSearching`}),p=O(()=>(u.value,e.search(l.value,{limit:a,minQueryLength:o,threshold:s})),{name:`scout:results`}),m=null;function h(){m!==null&&(clearTimeout(m),m=null)}let g=c.subscribe(()=>{let e=c.peek();if(h(),e!==l.peek()){if(n===0){l.value=e;return}m=setTimeout(()=>{l.value=e,m=null},n)}});function _(){if(v)throw new r(`SearchState.clear() called after dispose()`);h(),k(()=>{c.value=``,l.value=``})}let v=!1,y=new AbortController;function b(){v=!0,y.abort(),h(),g(),d()}return{clear:_,get disposalSignal(){return y.signal},dispose:b,get disposed(){return v},isSearching:f,query:c,results:p,[Symbol.dispose](){b()}}}function R(e,t){let n=F(e,{fields:t.fields,limit:t.limit,minQueryLength:t.minQueryLength,threshold:t.threshold}),r=L(n,{debounce:t.debounce});return Object.assign(Object.create(r),{index:n})}function z(e){let t=V();return t?[...t.segment(e)].filter(e=>e.isWordLike).map(e=>e.segment).join(` `):e}var B;function V(){return B===void 0&&(B=typeof Intl>`u`||typeof Intl.Segmenter!=`function`?null:new Intl.Segmenter(void 0,{granularity:`word`})),B}exports.ScoutConfigurationError=i,exports.ScoutDisposedError=r,exports.ScoutError=n,exports.createIndex=F,exports.createReactiveSearch=R,exports.createSearch=L,exports.findMatchRanges=s,exports.highlight=c,exports.highlightField=l,exports.segmentWords=z,exports.toFilterPredicate=t,exports.toSearchMatcher=e;
 //# sourceMappingURL=scout.cjs.map