crbro-memory 1.4.0 → 1.5.0

package/dist/search/index.js

@@ -1,102 +1,148 @@
 "use strict";
 // ─── CRBRO Search Engine ─────────────────────────────────────────
-// Hybrid search powered by Orama (text + BM25 + fuzzy)
+// Chunk-level retrieval powered by Orama (BM25) with late interaction.
+//
+// WHY CHUNKS AND NOT WHOLE NEURONS
+// Until v1.4 the whole neuron was indexed as a single document, with every
+// fact concatenated into one field. BM25 normalises term frequency by
+// document length, so on a real brain (median neuron 90 chars, largest
+// 342,302 chars) the most valuable neuron scored near zero for any single
+// term while a 90-char scrap outranked it. The system punished its own best
+// memories: the more you saved about a project, the less findable it became.
+//
+// Now every fact / decision / pattern / preference is its own document, plus
+// one header document per neuron carrying name and tags (which is what keeps
+// search-by-name working). Scoring runs per term and recombines, so a neuron
+// wins by having ONE chunk that covers the query, not by being short.
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.SearchEngine = void 0;
+exports.SearchEngine = exports.INDEX_VERSION = void 0;
 const orama_1 = require("@orama/orama");
 const fs_js_1 = require("../utils/fs.js");
-// Orama schema for indexing neurons
+const hash_js_1 = require("../utils/hash.js");
+const tokenize_js_1 = require("./tokenize.js");
+/** Bump when the schema changes so old on-disk indexes are rebuilt, not loaded. */
+exports.INDEX_VERSION = 2;
+/** Weight given to a neuron for each *additional* chunk that matches. */
+const BREADTH_BONUS = 0.05;
+/** Cap on the breadth bonus — breadth is a tiebreaker, never the main signal. */
+const BREADTH_CAP = 0.25;
+/** Exponent on term coverage. >1 punishes chunks that only match one term. */
+const COVERAGE_EXPONENT = 1.5;
+/** Debounce before writing the index to disk after a learn. */
+const PERSIST_DEBOUNCE_MS = 5000;
 const SCHEMA = {
-    id: 'string',
+    id: 'string', // "<neuron_id>#<hash>"  — must be `id` for Orama
+    neuron: 'string',
     name: 'string',
-    summary: 'string',
-    facts: 'string',
+    text: 'string',
+    kind: 'string', // header | fact | decision | pattern | preference
     domain: 'string',
     tags: 'string',
+    added: 'string',
     heat: 'number',
 };
 class SearchEngine {
     brain;
     db = null;
+    docCount = 0;
+    dirty = false;
+    persistTimer = null;
     constructor(brain) {
         this.brain = brain;
     }
+    // ─── Lifecycle ─────────────────────────────────────────────────
     /**
-     * Initialize or restore the search index.
+     * Load the index from disk, or rebuild it if missing / stale / corrupt.
+     *
+     * Version check matters: Orama's `load()` does NOT throw when the stored
+     * schema differs — it silently overwrites the live schema with the old one,
+     * so the try/catch never fires and every later search fails with
+     * `Invalid property name`, permanently, on every boot. Reading the version
+     * ourselves is the only reliable guard.
      */
     async init() {
-        const indexPath = this.brain.paths.searchIndex();
-        const indexExists = await (0, fs_js_1.fileExists)(indexPath);
-        if (indexExists) {
+        const indexPath = this.brain.paths.chunksIndex();
+        if (await (0, fs_js_1.fileExists)(indexPath)) {
             try {
-                const savedData = await (0, fs_js_1.readJSON)(indexPath);
-                if (savedData) {
-                    // Create a fresh db then load data into it
+                const stored = await (0, fs_js_1.readJSON)(indexPath);
+                if (stored && stored.v === exports.INDEX_VERSION && stored.data) {
                     this.db = (0, orama_1.create)({ schema: SCHEMA });
-                    (0, orama_1.load)(this.db, savedData);
+                    (0, orama_1.load)(this.db, stored.data);
+                    this.docCount = this.countDocs(stored.data);
                     return;
                 }
             }
             catch {
-                // Index corrupted — rebuild
+                // Corrupted — fall through to rebuild.
             }
         }
-        // Create fresh index
         await this.rebuild();
     }
     /**
-     * Rebuild the entire search index from cortex files.
+     * Rebuild the whole index from the cortex.
+     * One bad neuron must not take the server down with it, so every neuron
+     * is isolated: CRBRO is published and other people's brains are not ours
+     * to assume well-formed.
      */
     async rebuild() {
         this.db = (0, orama_1.create)({ schema: SCHEMA });
+        this.docCount = 0;
         const ids = await (0, fs_js_1.listJSONFiles)(this.brain.paths.cortex);
-        let indexed = 0;
         for (const id of ids) {
-            const neuron = await (0, fs_js_1.readJSON)(this.brain.paths.neuron(id));
-            if (!neuron)
-                continue;
-            await (0, orama_1.insert)(this.db, {
-                id: neuron.id,
-                name: neuron.name,
-                summary: neuron.summary,
-                facts: neuron.facts.map(f => f.text).join(' | '),
-                domain: neuron.domain,
-                tags: neuron.tags.join(' '),
-                heat: neuron.heat,
-            });
-            indexed++;
+            try {
+                const neuron = await (0, fs_js_1.readJSON)(this.brain.paths.neuron(id));
+                if (!neuron)
+                    continue;
+                await this.insertNeuronChunks(neuron);
+            }
+            catch {
+                // Skip unreadable neuron, keep going.
+            }
         }
-        // Save index to disk
         await this.persist();
-        return indexed;
+        await this.dropLegacyIndex();
+        return this.docCount;
     }
     /**
-     * Index a single neuron (for real-time updates).
+     * Re-index a single neuron: drop its old chunks, insert the current ones.
      */
     async indexNeuron(neuron) {
         if (!this.db)
             await this.init();
         if (!this.db)
             return;
-        // Remove existing entry if present (ignore errors)
-        try {
-            await (0, orama_1.remove)(this.db, neuron.id);
+        await this.removeNeuronChunks(neuron.id);
+        await this.insertNeuronChunks(neuron);
+        this.markDirty();
+    }
+    /** Write the index to disk now. */
+    async persist() {
+        if (!this.db)
+            return;
+        if (this.persistTimer) {
+            clearTimeout(this.persistTimer);
+            this.persistTimer = null;
         }
-        catch {
-            // Not found — fine
-        }
-        await (0, orama_1.insert)(this.db, {
-            id: neuron.id,
-            name: neuron.name,
-            summary: neuron.summary,
-            facts: neuron.facts.map(f => f.text).join(' | '),
-            domain: neuron.domain,
-            tags: neuron.tags.join(' '),
-            heat: neuron.heat,
-        });
+        const payload = { v: exports.INDEX_VERSION, data: (0, orama_1.save)(this.db) };
+        // Not pretty-printed: this file reaches tens of MB and indentation costs
+        // ~25% of both size and write time for something no human reads.
+        await (0, fs_js_1.writeJSON)(this.brain.paths.chunksIndex(), payload, { pretty: false });
+        this.dirty = false;
     }
+    /** Flush if there are unsaved changes. Called on consolidate/shutdown. */
+    async flush() {
+        if (this.dirty)
+            await this.persist();
+    }
+    // ─── Search ────────────────────────────────────────────────────
     /**
-     * Search for neurons matching a query.
+     * Find neurons matching a query.
+     *
+     * Late interaction: each query term is searched separately and its scores
+     * normalised against the best score for that term, then a chunk's score is
+     * the sum of its normalised hits weighted by how much of the query it
+     * covers. This is what stops one very common term from deciding the ranking
+     * and what makes a chunk matching five of six terms beat a scrap matching one.
      */
     async search(query, options) {
         if (!this.db)
@@ -104,36 +150,251 @@ class SearchEngine {
         if (!this.db)
             return [];
         const limit = options?.limit || 10;
-        const searchParams = {
-            term: query,
-            properties: ['name', 'summary', 'facts', 'tags'],
-            boost: { name: 3, summary: 2, facts: 1, tags: 1 },
-            limit,
-            tolerance: 2,
-        };
-        // Domain filter
-        if (options?.domain) {
-            searchParams.where = { domain: { eq: options.domain } };
-        }
-        const results = await (0, orama_1.search)(this.db, searchParams);
-        return results.hits.map((hit) => ({
-            neuron_id: hit.document.id,
-            name: hit.document.name,
-            domain: hit.document.domain,
-            relevance_score: Math.round(hit.score * 1000) / 1000,
-            matching_content: hit.document.summary || hit.document.facts?.substring(0, 200) || '',
-            heat: hit.document.heat || 0,
-        }));
+        const terms = (0, tokenize_js_1.queryTerms)(query);
+        if (terms.length === 0)
+            return [];
+        const perChunk = new Map();
+        for (const term of terms) {
+            const hits = await this.searchTerm(term, options?.domain);
+            if (hits.length === 0)
+                continue;
+            const best = hits[0].score || 1;
+            for (const hit of hits) {
+                const doc = hit.document;
+                const key = doc.id;
+                const normalised = best > 0 ? hit.score / best : 0;
+                const existing = perChunk.get(key);
+                if (existing) {
+                    existing.score += normalised;
+                    existing.matched += 1;
+                }
+                else {
+                    perChunk.set(key, {
+                        neuron: doc.neuron,
+                        name: doc.name,
+                        domain: doc.domain,
+                        text: doc.text,
+                        kind: doc.kind,
+                        added: doc.added,
+                        heat: doc.heat || 0,
+                        score: normalised,
+                        matched: 1,
+                    });
+                }
+            }
+        }
+        if (perChunk.size === 0)
+            return [];
+        // Coverage weighting, then collapse chunks into their neurons.
+        const byNeuron = new Map();
+        for (const chunk of perChunk.values()) {
+            const coverage = chunk.matched / terms.length;
+            chunk.score = chunk.score * Math.pow(coverage, COVERAGE_EXPONENT);
+            const current = byNeuron.get(chunk.neuron);
+            if (!current) {
+                byNeuron.set(chunk.neuron, { best: chunk, extra: 0 });
+            }
+            else if (chunk.score > current.best.score) {
+                byNeuron.set(chunk.neuron, { best: chunk, extra: current.extra + 1 });
+            }
+            else {
+                current.extra += 1;
+            }
+        }
+        const results = [];
+        for (const { best, extra } of byNeuron.values()) {
+            const breadth = Math.min(extra * BREADTH_BONUS, BREADTH_CAP);
+            results.push({
+                neuron_id: best.neuron,
+                name: best.name,
+                domain: best.domain,
+                relevance_score: Math.round((best.score + breadth) * 1000) / 1000,
+                matching_content: best.text,
+                matched_kind: best.kind,
+                matched_added: best.added || '',
+                heat: best.heat,
+            });
+        }
+        results.sort((a, b) => b.relevance_score - a.relevance_score);
+        return results.slice(0, limit);
     }
+    // ─── Internals ─────────────────────────────────────────────────
     /**
-     * Persist the search index to disk.
+     * Search one term. Exact first; only if a reasonably long term finds
+     * nothing do we allow a single edit of slack, which covers typos without
+     * the indiscriminate noise of the old `tolerance: 2` (measured: it matched
+     * 1,166 of 1,183 documents, i.e. the ranking was noise).
      */
-    async persist() {
+    async searchTerm(term, domain) {
+        const run = async (tolerance) => {
+            const params = {
+                term,
+                properties: ['text', 'name', 'tags'],
+                boost: { name: 2, text: 1, tags: 1 },
+                limit: Math.max(this.docCount, 10),
+                tolerance,
+            };
+            if (domain)
+                params.where = { domain: { eq: domain } };
+            const res = await (0, orama_1.search)(this.db, params);
+            return res.hits;
+        };
+        let hits = await run(0);
+        if (hits.length === 0 && term.length >= 5) {
+            hits = await run(1);
+        }
+        return hits;
+    }
+    /** Build and insert every chunk of a neuron. */
+    async insertNeuronChunks(neuron) {
         if (!this.db)
             return;
-        const data = (0, orama_1.save)(this.db);
-        await (0, fs_js_1.writeJSON)(this.brain.paths.searchIndex(), data);
+        const tags = Array.isArray(neuron.tags) ? neuron.tags.join(' ') : '';
+        const base = {
+            neuron: neuron.id,
+            name: neuron.name || neuron.id,
+            domain: neuron.domain || 'general',
+            tags,
+            heat: typeof neuron.heat === 'number' ? neuron.heat : 0,
+        };
+        // Header chunk — carries name, summary and tags. This is what preserves
+        // search-by-name, which is the one thing that worked before.
+        const headerText = [neuron.name, neuron.summary, tags]
+            .filter(Boolean)
+            .join(' — ');
+        await this.put({
+            ...base,
+            id: (0, hash_js_1.chunkId)(neuron.id, `header:${headerText}`),
+            text: headerText,
+            kind: 'header',
+            added: neuron.created || '',
+        });
+        for (const fact of neuron.facts || []) {
+            if (!fact || !fact.text)
+                continue;
+            if (isRetired(fact))
+                continue;
+            await this.put({
+                ...base,
+                id: (0, hash_js_1.chunkId)(neuron.id, fact.text),
+                text: fact.text,
+                kind: 'fact',
+                added: fact.added || '',
+            });
+        }
+        for (const decision of neuron.decisions || []) {
+            if (!decision || !decision.text)
+                continue;
+            const text = decision.rationale
+                ? `${decision.text} — ${decision.rationale}`
+                : decision.text;
+            await this.put({
+                ...base,
+                id: (0, hash_js_1.chunkId)(neuron.id, text),
+                text,
+                kind: 'decision',
+                added: decision.date || '',
+            });
+        }
+        for (const pattern of neuron.patterns || []) {
+            if (!pattern)
+                continue;
+            await this.put({
+                ...base,
+                id: (0, hash_js_1.chunkId)(neuron.id, pattern),
+                text: pattern,
+                kind: 'pattern',
+                added: '',
+            });
+        }
+        for (const pref of neuron.preferences || []) {
+            if (!pref)
+                continue;
+            await this.put({
+                ...base,
+                id: (0, hash_js_1.chunkId)(neuron.id, pref),
+                text: pref,
+                kind: 'preference',
+                added: '',
+            });
+        }
+    }
+    async put(doc) {
+        try {
+            await (0, orama_1.insert)(this.db, doc);
+            this.docCount++;
+        }
+        catch {
+            // Duplicate id (identical text twice in one neuron) — nothing to add.
+        }
+    }
+    /** Drop every chunk belonging to a neuron. */
+    async removeNeuronChunks(neuronId) {
+        if (!this.db)
+            return;
+        try {
+            const res = await (0, orama_1.search)(this.db, {
+                term: '',
+                where: { neuron: { eq: neuronId } },
+                limit: 10000,
+            });
+            for (const hit of res.hits) {
+                try {
+                    await (0, orama_1.remove)(this.db, hit.document.id);
+                    this.docCount = Math.max(0, this.docCount - 1);
+                }
+                catch {
+                    // Already gone.
+                }
+            }
+        }
+        catch {
+            // `where` on a non-filterable field, or empty index — ignore.
+        }
+    }
+    markDirty() {
+        this.dirty = true;
+        if (this.persistTimer)
+            clearTimeout(this.persistTimer);
+        this.persistTimer = setTimeout(() => {
+            this.persistTimer = null;
+            void this.persist().catch(() => { });
+        }, PERSIST_DEBOUNCE_MS);
+        // Never hold the process open just to flush the index.
+        if (typeof this.persistTimer.unref === 'function')
+            this.persistTimer.unref();
+    }
+    countDocs(data) {
+        try {
+            const store = data?.internalDocumentIDStore?.internalIdToId;
+            if (Array.isArray(store))
+                return store.length;
+            const docs = data?.docs?.docs;
+            if (docs)
+                return Object.keys(docs).length;
+        }
+        catch {
+            // Unknown shape — a floor of 0 only affects the per-term limit.
+        }
+        return 0;
+    }
+    /**
+     * Remove the pre-v2 index once a rebuild has succeeded. It is dead weight
+     * (25 MB on the reference brain) and nothing reads it any more. Downgrading
+     * to an older CRBRO simply finds no index and rebuilds its own.
+     */
+    async dropLegacyIndex() {
+        try {
+            await (0, fs_js_1.deleteJSON)(this.brain.paths.searchIndex());
+        }
+        catch {
+            // Best effort.
+        }
     }
 }
 exports.SearchEngine = SearchEngine;
+/** A fact that has been superseded or retracted must not surface in recall. */
+function isRetired(fact) {
+    return fact.status === 'superseded' || fact.status === 'retracted';
+}
 //# sourceMappingURL=index.js.map

package/dist/search/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":";AAAA,oEAAoE;AACpE,uDAAuD;;;AAEvD,wCAA0E;AAE1E,0CAAgF;AAIhF,oCAAoC;AACpC,MAAM,MAAM,GAAG;IACb,EAAE,EAAE,QAAiB;IACrB,IAAI,EAAE,QAAiB;IACvB,OAAO,EAAE,QAAiB;IAC1B,KAAK,EAAE,QAAiB;IACxB,MAAM,EAAE,QAAiB;IACzB,IAAI,EAAE,QAAiB;IACvB,IAAI,EAAE,QAAiB;CACxB,CAAC;AAEF,MAAa,YAAY;IAGH;IAFZ,EAAE,GAAoB,IAAI,CAAC;IAEnC,YAAoB,KAAY;QAAZ,UAAK,GAAL,KAAK,CAAO;IAAG,CAAC;IAEpC;;OAEG;IACH,KAAK,CAAC,IAAI;QACR,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QACjD,MAAM,WAAW,GAAG,MAAM,IAAA,kBAAU,EAAC,SAAS,CAAC,CAAC;QAEhD,IAAI,WAAW,EAAE,CAAC;YAChB,IAAI,CAAC;gBACH,MAAM,SAAS,GAAG,MAAM,IAAA,gBAAQ,EAAU,SAAS,CAAC,CAAC;gBACrD,IAAI,SAAS,EAAE,CAAC;oBACd,2CAA2C;oBAC3C,IAAI,CAAC,EAAE,GAAG,IAAA,cAAM,EAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;oBACrC,IAAA,YAAI,EAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;oBACzB,OAAO;gBACT,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,4BAA4B;YAC9B,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,EAAE,GAAG,IAAA,cAAM,EAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAErC,MAAM,GAAG,GAAG,MAAM,IAAA,qBAAa,EAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACzD,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,MAAM,IAAA,gBAAQ,EAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAE,EAAE;gBACpB,EAAE,EAAE,MAAM,CAAC,EAAE;gBACb,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;gBAChD,MAAM,EAAE,MAAM,CAAC,MAAM;gBACrB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;gBAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;aAClB,CAAC,CAAC;YACH,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,qBAAqB;QACrB,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACrB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QAErB,mDAAmD;QACnD,IAAI,CAAC;YACH,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;QAAC,MAAM,CAAC;YACP,mBAAmB;QACrB,CAAC;QAED,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAE,EAAE;YACpB,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAChD,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;SAClB,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,OAA6C;QAE7C,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;QAEnC,MAAM,YAAY,GAAQ;YACxB,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,CAAC;YAChD,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;YACjD,KAAK;YACL,SAAS,EAAE,CAAC;SACb,CAAC;QAEF,gBAAgB;QAChB,IAAI,OAAO,EAAE,MAAM,EAAE,CAAC;YACpB,YAAY,CAAC,KAAK,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1D,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;QAEpD,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAQ,EAAE,EAAE,CAAC,CAAC;YACrC,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAY;YACpC,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAc;YACjC,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAgB;YACrC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI;YACpD,gBAAgB,EAAG,GAAG,CAAC,QAAQ,CAAC,OAAkB,IAAK,GAAG,CAAC,QAAQ,CAAC,KAAgB,EAAE,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE;YAC7G,IAAI,EAAG,GAAG,CAAC,QAAQ,CAAC,IAAe,IAAI,CAAC;SACzC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QACrB,MAAM,IAAI,GAAG,IAAA,YAAI,EAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,IAAA,iBAAS,EAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,CAAC;IACxD,CAAC;CACF;AAlID,oCAkIC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":";AAAA,oEAAoE;AACpE,uEAAuE;AACvE,EAAE;AACF,mCAAmC;AACnC,2EAA2E;AAC3E,sEAAsE;AACtE,uEAAuE;AACvE,0EAA0E;AAC1E,4EAA4E;AAC5E,6EAA6E;AAC7E,EAAE;AACF,6EAA6E;AAC7E,6EAA6E;AAC7E,6EAA6E;AAC7E,sEAAsE;;;AAEtE,wCAA0E;AAE1E,0CAA4F;AAC5F,8CAA2C;AAC3C,+CAA2C;AAI3C,mFAAmF;AACtE,QAAA,aAAa,GAAG,CAAC,CAAC;AAE/B,yEAAyE;AACzE,MAAM,aAAa,GAAG,IAAI,CAAC;AAC3B,iFAAiF;AACjF,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB,8EAA8E;AAC9E,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,+DAA+D;AAC/D,MAAM,mBAAmB,GAAG,IAAI,CAAC;AAEjC,MAAM,MAAM,GAAG;IACb,EAAE,EAAE,QAAiB,EAAQ,iDAAiD;IAC9E,MAAM,EAAE,QAAiB;IACzB,IAAI,EAAE,QAAiB;IACvB,IAAI,EAAE,QAAiB;IACvB,IAAI,EAAE,QAAiB,EAAM,kDAAkD;IAC/E,MAAM,EAAE,QAAiB;IACzB,IAAI,EAAE,QAAiB;IACvB,KAAK,EAAE,QAAiB;IACxB,IAAI,EAAE,QAAiB;CACxB,CAAC;AAmBF,MAAa,YAAY;IAMH;IALZ,EAAE,GAAoB,IAAI,CAAC;IAC3B,QAAQ,GAAG,CAAC,CAAC;IACb,KAAK,GAAG,KAAK,CAAC;IACd,YAAY,GAA0B,IAAI,CAAC;IAEnD,YAAoB,KAAY;QAAZ,UAAK,GAAL,KAAK,CAAO;IAAG,CAAC;IAEpC,kEAAkE;IAElE;;;;;;;;OAQG;IACH,KAAK,CAAC,IAAI;QACR,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAEjD,IAAI,MAAM,IAAA,kBAAU,EAAC,SAAS,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAA,gBAAQ,EAAc,SAAS,CAAC,CAAC;gBACtD,IAAI,MAAM,IAAI,MAAM,CAAC,CAAC,KAAK,qBAAa,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;oBACxD,IAAI,CAAC,EAAE,GAAG,IAAA,cAAM,EAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;oBACrC,IAAA,YAAI,EAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC5C,OAAO;gBACT,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,uCAAuC;YACzC,CAAC;QACH,CAAC;QAED,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,EAAE,GAAG,IAAA,cAAM,EAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAElB,MAAM,GAAG,GAAG,MAAM,IAAA,qBAAa,EAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAEzD,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,IAAA,gBAAQ,EAAS,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnE,IAAI,CAAC,MAAM;oBAAE,SAAS;gBACtB,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YACxC,CAAC;YAAC,MAAM,CAAC;gBACP,sCAAsC;YACxC,CAAC;QACH,CAAC;QAED,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACrB,MAAM,IAAI,CAAC,eAAe,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QAErB,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED,mCAAmC;IACnC,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QACrB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;QACD,MAAM,OAAO,GAAgB,EAAE,CAAC,EAAE,qBAAa,EAAE,IAAI,EAAE,IAAA,YAAI,EAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QACvE,yEAAyE;QACzE,iEAAiE;QACjE,MAAM,IAAA,iBAAS,EAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,0EAA0E;IAC1E,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;IACvC,CAAC;IAED,kEAAkE;IAElE;;;;;;;;OAQG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,OAA6C;QAE7C,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,IAAA,wBAAU,EAAC,KAAK,CAAC,CAAC;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAC1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEhC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAEhC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,GAAG,CAAC,QAAe,CAAC;gBAChC,MAAM,GAAG,GAAG,GAAG,CAAC,EAAY,CAAC;gBAC7B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEnD,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACnC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,KAAK,IAAI,UAAU,CAAC;oBAC7B,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC;gBACxB,CAAC;qBAAM,CAAC;oBACN,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE;wBAChB,MAAM,EAAE,GAAG,CAAC,MAAM;wBAClB,IAAI,EAAE,GAAG,CAAC,IAAI;wBACd,MAAM,EAAE,GAAG,CAAC,MAAM;wBAClB,IAAI,EAAE,GAAG,CAAC,IAAI;wBACd,IAAI,EAAE,GAAG,CAAC,IAAI;wBACd,KAAK,EAAE,GAAG,CAAC,KAAK;wBAChB,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC;wBACnB,KAAK,EAAE,UAAU;wBACjB,OAAO,EAAE,CAAC;qBACX,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEnC,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA6C,CAAC;QAEtE,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC;YAC9C,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YAElE,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACxD,CAAC;iBAAM,IAAI,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC5C,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YACxE,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,MAAM,OAAO,GAAmB,EAAE,CAAC;QACnC,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,aAAa,EAAE,WAAW,CAAC,CAAC;YAC7D,OAAO,CAAC,IAAI,CAAC;gBACX,SAAS,EAAE,IAAI,CAAC,MAAM;gBACtB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI;gBACjE,gBAAgB,EAAE,IAAI,CAAC,IAAI;gBAC3B,YAAY,EAAE,IAAI,CAAC,IAAI;gBACvB,aAAa,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE;gBAC/B,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC;QAC9D,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,kEAAkE;IAElE;;;;;OAKG;IACK,KAAK,CAAC,UAAU,CAAC,IAAY,EAAE,MAAe;QACpD,MAAM,GAAG,GAAG,KAAK,EAAE,SAAiB,EAAE,EAAE;YACtC,MAAM,MAAM,GAAQ;gBAClB,IAAI;gBACJ,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC;gBACpC,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE;gBACpC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAClC,SAAS;aACV,CAAC;YACF,IAAI,MAAM;gBAAE,MAAM,CAAC,KAAK,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;YACtD,MAAM,GAAG,GAAG,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAc,EAAE,MAAM,CAAC,CAAC;YACtD,OAAO,GAAG,CAAC,IAAa,CAAC;QAC3B,CAAC,CAAC;QAEF,IAAI,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1C,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gDAAgD;IACxC,KAAK,CAAC,kBAAkB,CAAC,MAAc;QAC7C,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QAErB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACrE,MAAM,IAAI,GAAG;YACX,MAAM,EAAE,MAAM,CAAC,EAAE;YACjB,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE;YAC9B,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,SAAS;YAClC,IAAI;YACJ,IAAI,EAAE,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACxD,CAAC;QAEF,wEAAwE;QACxE,6DAA6D;QAC7D,MAAM,UAAU,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC;aACnD,MAAM,CAAC,OAAO,CAAC;aACf,IAAI,CAAC,KAAK,CAAC,CAAC;QACf,MAAM,IAAI,CAAC,GAAG,CAAC;YACb,GAAG,IAAI;YACP,EAAE,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,UAAU,UAAU,EAAE,CAAC;YAC9C,IAAI,EAAE,UAAU;YAChB,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,MAAM,CAAC,OAAO,IAAI,EAAE;SAC5B,CAAC,CAAC;QAEH,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAClC,IAAI,SAAS,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC9B,MAAM,IAAI,CAAC,GAAG,CAAC;gBACb,GAAG,IAAI;gBACP,EAAE,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC;gBACjC,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,MAAM;gBACZ,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,EAAE;aACxB,CAAC,CAAC;QACL,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI;gBAAE,SAAS;YAC1C,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS;gBAC7B,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,MAAM,QAAQ,CAAC,SAAS,EAAE;gBAC5C,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;YAClB,MAAM,IAAI,CAAC,GAAG,CAAC;gBACb,GAAG,IAAI;gBACP,EAAE,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC5B,IAAI;gBACJ,IAAI,EAAE,UAAU;gBAChB,KAAK,EAAE,QAAQ,CAAC,IAAI,IAAI,EAAE;aAC3B,CAAC,CAAC;QACL,CAAC;QAED,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,MAAM,IAAI,CAAC,GAAG,CAAC;gBACb,GAAG,IAAI;gBACP,EAAE,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC;gBAC/B,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,EAAE;aACV,CAAC,CAAC;QACL,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,IAAI,CAAC,GAAG,CAAC;gBACb,GAAG,IAAI;gBACP,EAAE,EAAE,IAAA,iBAAO,EAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC5B,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,YAAY;gBAClB,KAAK,EAAE,EAAE;aACV,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,GAAG,CAAC,GAA4B;QAC5C,IAAI,CAAC;YACH,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAc,EAAE,GAAU,CAAC,CAAC;YAC9C,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAAC,MAAM,CAAC;YACP,sEAAsE;QACxE,CAAC;IACH,CAAC;IAED,8CAA8C;IACtC,KAAK,CAAC,kBAAkB,CAAC,QAAgB;QAC/C,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QACrB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAE,EAAE;gBAChC,IAAI,EAAE,EAAE;gBACR,KAAK,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAS;gBAC1C,KAAK,EAAE,KAAK;aACN,CAAC,CAAC;YACV,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAa,EAAE,CAAC;gBACpC,IAAI,CAAC;oBACH,MAAM,IAAA,cAAM,EAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACvC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;gBACjD,CAAC;gBAAC,MAAM,CAAC;oBACP,gBAAgB;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,8DAA8D;QAChE,CAAC;IACH,CAAC;IAEO,SAAS;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,IAAI,CAAC,YAAY;YAAE,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC,GAAG,EAAE;YAClC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAmC,CAAC,CAAC,CAAC;QACvE,CAAC,EAAE,mBAAmB,CAAC,CAAC;QACxB,uDAAuD;QACvD,IAAI,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,KAAK,UAAU;YAAE,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;IAC/E,CAAC;IAEO,SAAS,CAAC,IAAa;QAC7B,IAAI,CAAC;YACH,MAAM,KAAK,GAAI,IAAY,EAAE,uBAAuB,EAAE,cAAc,CAAC;YACrE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC,MAAM,CAAC;YAC9C,MAAM,IAAI,GAAI,IAAY,EAAE,IAAI,EAAE,IAAI,CAAC;YACvC,IAAI,IAAI;gBAAE,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC5C,CAAC;QAAC,MAAM,CAAC;YACP,gEAAgE;QAClE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,eAAe;QAC3B,IAAI,CAAC;YACH,MAAM,IAAA,kBAAU,EAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,eAAe;QACjB,CAAC;IACH,CAAC;CACF;AAxWD,oCAwWC;AAED,+EAA+E;AAC/E,SAAS,SAAS,CAAC,IAAU;IAC3B,OAAO,IAAI,CAAC,MAAM,KAAK,YAAY,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC;AACrE,CAAC"}

package/dist/search/tokenize.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Words that carry no retrieval signal. Kept short on purpose: an
+ * over-eager stoplist silently deletes terms the user meant.
+ */
+declare const STOPWORDS: Set<string>;
+/**
+ * Fold accents so "participación" and "participacion" are the same term.
+ * Keeps ñ as n — Spanish users type it both ways.
+ */
+export declare function fold(text: string): string;
+/**
+ * Split text into terms. Keeps underscores and digits together so
+ * identifiers survive intact ("ocultar_de_lista", "wp_wppc_entries", "6698").
+ */
+export declare function tokenize(text: string): string[];
+/**
+ * Tokenize a search query: drop stopwords and 1-char noise, dedupe,
+ * and keep the original order. If everything was a stopword, fall back
+ * to the raw tokens — an empty term list would return nothing at all.
+ */
+export declare function queryTerms(query: string): string[];
+export { STOPWORDS };
+//# sourceMappingURL=tokenize.d.ts.map

package/dist/search/tokenize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.d.ts","sourceRoot":"","sources":["../../src/search/tokenize.ts"],"names":[],"mappings":"AASA;;;GAGG;AACH,QAAA,MAAM,SAAS,aAcb,CAAC;AAEH;;;GAGG;AACH,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAKzC;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAI/C;AAED;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAqBlD;AAED,OAAO,EAAE,SAAS,EAAE,CAAC"}

package/dist/search/tokenize.js

@@ -0,0 +1,83 @@
+"use strict";
+// ─── CRBRO Query Tokenizer ───────────────────────────────────────
+// Splits a query into meaningful terms. Spanish-first, English-aware.
+//
+// Deliberately NO stemming. Orama applies its stemmer *before* stripping
+// diacritics, so a Spanish stemmer mangles the very common "-ción" family
+// (información, configuración, aplicación, integración). Measured on the
+// reference brain: 24% of facts contain a "-ción" word and they retrieve
+// correctly today. Ablation also showed removing the stemmer *raises* MRR.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.STOPWORDS = void 0;
+exports.fold = fold;
+exports.tokenize = tokenize;
+exports.queryTerms = queryTerms;
+/**
+ * Words that carry no retrieval signal. Kept short on purpose: an
+ * over-eager stoplist silently deletes terms the user meant.
+ */
+const STOPWORDS = new Set([
+    // Spanish
+    'a', 'al', 'algo', 'ante', 'aqui', 'asi', 'con', 'como', 'cual', 'cuando',
+    'de', 'del', 'desde', 'donde', 'dos', 'el', 'ella', 'ellos', 'en', 'entre',
+    'era', 'es', 'esa', 'ese', 'eso', 'esta', 'este', 'esto', 'estos', 'fue',
+    'ha', 'hay', 'la', 'las', 'le', 'les', 'lo', 'los', 'mas', 'me', 'mi', 'muy',
+    'ni', 'no', 'nos', 'o', 'para', 'pero', 'por', 'que', 'se', 'ser', 'si',
+    'sin', 'sobre', 'su', 'sus', 'tan', 'te', 'tiene', 'todo', 'tu', 'un', 'una',
+    'uno', 'unos', 'unas', 'y', 'ya',
+    // English
+    'a', 'an', 'and', 'are', 'as', 'at', 'be', 'but', 'by', 'for', 'from', 'has',
+    'have', 'how', 'in', 'is', 'it', 'its', 'of', 'on', 'or', 'that', 'the',
+    'their', 'then', 'there', 'these', 'this', 'to', 'was', 'were', 'what',
+    'when', 'where', 'which', 'who', 'why', 'with',
+]);
+exports.STOPWORDS = STOPWORDS;
+/**
+ * Fold accents so "participación" and "participacion" are the same term.
+ * Keeps ñ as n — Spanish users type it both ways.
+ */
+function fold(text) {
+    return text
+        .normalize('NFD')
+        .replace(/[̀-ͯ]/g, '')
+        .toLowerCase();
+}
+/**
+ * Split text into terms. Keeps underscores and digits together so
+ * identifiers survive intact ("ocultar_de_lista", "wp_wppc_entries", "6698").
+ */
+function tokenize(text) {
+    return fold(text)
+        .split(/[^a-z0-9_]+/)
+        .filter(Boolean);
+}
+/**
+ * Tokenize a search query: drop stopwords and 1-char noise, dedupe,
+ * and keep the original order. If everything was a stopword, fall back
+ * to the raw tokens — an empty term list would return nothing at all.
+ */
+function queryTerms(query) {
+    const raw = tokenize(query);
+    const kept = [];
+    const seen = new Set();
+    for (const t of raw) {
+        if (t.length < 2)
+            continue;
+        if (STOPWORDS.has(t))
+            continue;
+        if (seen.has(t))
+            continue;
+        seen.add(t);
+        kept.push(t);
+    }
+    if (kept.length > 0)
+        return kept;
+    // Everything filtered out — use whatever we had, deduped.
+    const fallback = [];
+    for (const t of raw) {
+        if (!fallback.includes(t))
+            fallback.push(t);
+    }
+    return fallback;
+}
+//# sourceMappingURL=tokenize.js.map

package/dist/search/tokenize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.js","sourceRoot":"","sources":["../../src/search/tokenize.ts"],"names":[],"mappings":";AAAA,oEAAoE;AACpE,sEAAsE;AACtE,EAAE;AACF,yEAAyE;AACzE,0EAA0E;AAC1E,yEAAyE;AACzE,yEAAyE;AACzE,2EAA2E;;;AA0B3E,oBAKC;AAMD,4BAIC;AAOD,gCAqBC;AAnED;;;GAGG;AACH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,UAAU;IACV,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ;IACzE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO;IAC1E,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;IACxE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IAC5E,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IACvE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IAC5E,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI;IAChC,UAAU;IACV,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;IAC5E,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK;IACvE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IACtE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;CAC/C,CAAC,CAAC;AAmDM,8BAAS;AAjDlB;;;GAGG;AACH,SAAgB,IAAI,CAAC,IAAY;IAC/B,OAAO,IAAI;SACR,SAAS,CAAC,KAAK,CAAC;SAChB,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;SACrB,WAAW,EAAE,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAgB,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,IAAI,CAAC;SACd,KAAK,CAAC,aAAa,CAAC;SACpB,MAAM,CAAC,OAAO,CAAC,CAAC;AACrB,CAAC;AAED;;;;GAIG;AACH,SAAgB,UAAU,CAAC,KAAa;IACtC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC3B,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEjC,0DAA0D;IAC1D,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/server.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAYpE,wBAAgB,YAAY,IAAI,SAAS,CA4lBxC"}
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AAYpE,wBAAgB,YAAY,IAAI,SAAS,CA2tBxC"}