@monoes/monograph 1.6.11 → 1.6.12

package/dist/src/storage/fts-store-search.js

@@ -0,0 +1,177 @@
+// File-size sweep: split out of fts-store.ts.
+import { extractSearchTerms } from './fts-store-terms.js';
+/**
+ * THE single conversion from FTS5's `rank` to monograph's score convention.
+ *
+ * SCORE CONVENTION: every score that leaves the search layer is
+ * **higher-is-better and non-negative**. SQLite FTS5's `rank` is the opposite
+ * (negative, and *more* negative means a *better* match), so a raw rank must
+ * never escape this module — forwarding one into a ranker that takes maxima
+ * lets an unrelated node sitting at 0 outrank a genuine match at -0.656.
+ *
+ * Maps |rank| through x/(1+x) into (0, 1): monotonically increasing, so
+ * relative BM25 order is preserved, and bounded, so it composes with the
+ * additive fuzzy/node-type bonuses without one term swamping the others.
+ */
+export function relevanceFromFtsRank(rank) {
+    const magnitude = Math.abs(rank);
+    return magnitude / (1 + magnitude);
+}
+/**
+ * Quote a single FTS5 search term as a string literal when it contains characters
+ * that would otherwise be parsed as FTS5 syntax (quotes, parens, boolean keywords
+ * like AND/OR/NOT, colons, hyphens, etc). Wrapping in double-quotes forces FTS5 to
+ * treat the term as a literal string; any literal `"` inside the term is escaped by
+ * doubling it, per FTS5's own string-literal quoting rules.
+ */
+function quoteFtsTerm(term) {
+    // Bare alphanumeric/underscore terms need no quoting and are the common case.
+    if (/^[A-Za-z0-9_]+$/.test(term))
+        return term;
+    const escaped = term.replace(/"/g, '""');
+    return `"${escaped}"`;
+}
+export function ftsSearch(db, query, limit, label) {
+    // Sanitize: strip only characters that break FTS5 MATCH syntax (* still stripped,
+    // trigram handles substring natively; " is now preserved since trigram doesn't need it removed)
+    const safeQuery = query.replace(/[*]/g, ' ').trim();
+    if (!safeQuery)
+        return [];
+    // Trigram handles substring matching natively — no need to append * to each term.
+    // Quote each term individually so characters like `"`, `(`, `)`, or bare boolean
+    // keywords (AND/OR/NOT) don't get parsed as FTS5 query syntax.
+    const ftsQuery = safeQuery.split(/\s+/).map(quoteFtsTerm).join(' ');
+    let matchSql = `
+    SELECT n.id, n.name, n.norm_label, n.file_path, n.label,
+           n.start_line, n.end_line, nodes_fts.rank
+    FROM nodes_fts
+    JOIN nodes n ON n.rowid = nodes_fts.rowid
+    WHERE nodes_fts MATCH ?
+  `;
+    const matchParams = [ftsQuery];
+    if (label) {
+        matchSql += ' AND n.label = ?';
+        matchParams.push(label);
+    }
+    matchSql += ' ORDER BY nodes_fts.rank LIMIT ?';
+    matchParams.push(limit);
+    let matchRows = [];
+    try {
+        matchRows = db.prepare(matchSql).all(...matchParams);
+    }
+    catch {
+        // FTS MATCH can throw on malformed queries; fall through to LIKE path
+    }
+    // ── Intent-extraction fallback: when the raw query looks like natural language
+    // and FTS returned nothing, extract code-relevant tokens and retry FTS. ──────
+    if (matchRows.length === 0) {
+        const extracted = extractSearchTerms(safeQuery);
+        if (extracted.length > 0) {
+            // Try each extracted term individually via FTS, then merge by best rank
+            const termFtsQuery = extracted.map(quoteFtsTerm).join(' OR ');
+            let termSql = `
+        SELECT n.id, n.name, n.norm_label, n.file_path, n.label,
+               n.start_line, n.end_line, nodes_fts.rank
+        FROM nodes_fts
+        JOIN nodes n ON n.rowid = nodes_fts.rowid
+        WHERE nodes_fts MATCH ?
+      `;
+            const termParams = [termFtsQuery];
+            if (label) {
+                termSql += ' AND n.label = ?';
+                termParams.push(label);
+            }
+            termSql += ' ORDER BY nodes_fts.rank LIMIT ?';
+            termParams.push(limit * 2);
+            try {
+                matchRows = db.prepare(termSql).all(...termParams);
+            }
+            catch {
+                /* FTS MATCH can throw on malformed queries */
+            }
+            // Also try individual LIKE for each extracted term to catch camelCase substrings
+            if (matchRows.length < limit) {
+                const seenIds = new Set(matchRows.map((r) => r.id));
+                for (const term of extracted) {
+                    if (matchRows.length >= limit)
+                        break;
+                    const escapedTerm = term.replace(/\\/g, '\\\\').replace(/%/g, '\\%').replace(/_/g, '\\_');
+                    const pat = `%${escapedTerm}%`;
+                    let termLikeSql = `
+            SELECT n.id, n.name, n.norm_label, n.file_path, n.label,
+                   n.start_line, n.end_line, 0 AS rank
+            FROM nodes n
+            WHERE (n.name LIKE ? ESCAPE '\\' OR n.norm_label LIKE ? ESCAPE '\\')
+          `;
+                    const termLikeParams = [pat, pat];
+                    if (label) {
+                        termLikeSql += ' AND n.label = ?';
+                        termLikeParams.push(label);
+                    }
+                    termLikeSql += ' LIMIT ?';
+                    termLikeParams.push(limit);
+                    const likeRows = db
+                        .prepare(termLikeSql)
+                        .all(...termLikeParams);
+                    for (const r of likeRows) {
+                        if (!seenIds.has(r.id)) {
+                            matchRows.push(r);
+                            seenIds.add(r.id);
+                        }
+                    }
+                }
+            }
+        }
+    }
+    // Run the LIKE fallback whenever MATCH threw (malformed/boolean-keyword query) or
+    // returned zero rows — not just for short (≤2 char) queries. Short queries need it
+    // because trigram requires ≥3 characters to fire; longer queries need it whenever
+    // MATCH couldn't handle the syntax, so a query-syntax failure doesn't silently read
+    // as "no results".
+    if (safeQuery.length <= 2 || matchRows.length === 0) {
+        const escapedQuery = safeQuery.replace(/\\/g, '\\\\').replace(/%/g, '\\%').replace(/_/g, '\\_');
+        const likePattern = `%${escapedQuery}%`;
+        // Also try without file extension: "CLAUDE.md" → "CLAUDE"
+        const dotIdx = safeQuery.lastIndexOf('.');
+        const strippedLikePattern = dotIdx > 0 && dotIdx < safeQuery.length - 1
+            ? `%${safeQuery.slice(0, dotIdx).replace(/\\/g, '\\\\').replace(/%/g, '\\%').replace(/_/g, '\\_')}%`
+            : null;
+        let likeSql = `
+      SELECT n.id, n.name, n.norm_label, n.file_path, n.label,
+             n.start_line, n.end_line, 0 AS rank
+      FROM nodes n
+      WHERE (n.name LIKE ? ESCAPE '\\' OR n.norm_label LIKE ? ESCAPE '\\' OR n.file_path LIKE ? ESCAPE '\\'`;
+        const likeParams = [likePattern, likePattern, likePattern];
+        if (strippedLikePattern) {
+            likeSql += ` OR n.name LIKE ? ESCAPE '\\'`;
+            likeParams.push(strippedLikePattern);
+        }
+        likeSql += ')';
+        if (label) {
+            likeSql += ' AND n.label = ?';
+            likeParams.push(label);
+        }
+        likeSql += ' LIMIT ?';
+        likeParams.push(limit);
+        const likeRows = db.prepare(likeSql).all(...likeParams);
+        // Merge: MATCH results first, append LIKE results not already present
+        const seenIds = new Set(matchRows.map((r) => r.id));
+        for (const r of likeRows) {
+            if (!seenIds.has(r.id)) {
+                matchRows.push(r);
+                seenIds.add(r.id);
+            }
+        }
+    }
+    return matchRows.slice(0, limit).map((r) => ({
+        id: r.id,
+        name: r.name,
+        normLabel: r.norm_label,
+        filePath: r.file_path ?? null,
+        label: r.label,
+        rank: r.rank,
+        startLine: r.start_line ?? null,
+        endLine: r.end_line ?? null,
+    }));
+}
+//# sourceMappingURL=fts-store-search.js.map

package/dist/src/storage/fts-store-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fts-store-search.js","sourceRoot":"","sources":["../../../src/storage/fts-store-search.ts"],"names":[],"mappings":"AAAA,8CAA8C;AAG9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAe1D;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY;IAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,OAAO,SAAS,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;AACrC,CAAC;AAED;;;;;;GAMG;AACH,SAAS,YAAY,CAAC,IAAY;IAChC,8EAA8E;IAC9E,IAAI,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzC,OAAO,IAAI,OAAO,GAAG,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,EAAqB,EACrB,KAAa,EACb,KAAa,EACb,KAAc;IAEd,kFAAkF;IAClF,gGAAgG;IAChG,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IACpD,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,CAAC;IAE1B,kFAAkF;IAClF,iFAAiF;IACjF,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEpE,IAAI,QAAQ,GAAG;;;;;;GAMd,CAAC;IACF,MAAM,WAAW,GAAc,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAI,KAAK,EAAE,CAAC;QACV,QAAQ,IAAI,kBAAkB,CAAC;QAC/B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IACD,QAAQ,IAAI,kCAAkC,CAAC;IAC/C,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAExB,IAAI,SAAS,GAA8B,EAAE,CAAC;IAC9C,IAAI,CAAC;QACH,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,GAAI,WAAsC,CAG5E,CAAC;IACN,CAAC;IAAC,MAAM,CAAC;QACP,sEAAsE;IACxE,CAAC;IAED,gFAAgF;IAChF,+EAA+E;IAC/E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAChD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,wEAAwE;YACxE,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9D,IAAI,OAAO,GAAG;;;;;;OAMb,CAAC;YACF,MAAM,UAAU,GAAc,CAAC,YAAY,CAAC,CAAC;YAC7C,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,IAAI,kBAAkB,CAAC;gBAC9B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;YACD,OAAO,IAAI,kCAAkC,CAAC;YAC9C,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC;gBACH,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAI,UAAqC,CAG1E,CAAC;YACN,CAAC;YAAC,MAAM,CAAC;gBACP,8CAA8C;YAChD,CAAC;YAED,iFAAiF;YACjF,IAAI,SAAS,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAY,CAAC,CAAC,CAAC;gBAC9D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;oBAC7B,IAAI,SAAS,CAAC,MAAM,IAAI,KAAK;wBAAE,MAAM;oBACrC,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;oBAC1F,MAAM,GAAG,GAAG,IAAI,WAAW,GAAG,CAAC;oBAC/B,IAAI,WAAW,GAAG;;;;;WAKjB,CAAC;oBACF,MAAM,cAAc,GAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBAC7C,IAAI,KAAK,EAAE,CAAC;wBACV,WAAW,IAAI,kBAAkB,CAAC;wBAClC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC7B,CAAC;oBACD,WAAW,IAAI,UAAU,CAAC;oBAC1B,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC3B,MAAM,QAAQ,GAAG,EAAE;yBAChB,OAAO,CAAC,WAAW,CAAC;yBACpB,GAAG,CAAC,GAAI,cAAyC,CAA8B,CAAC;oBACnF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;wBACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAY,CAAC,EAAE,CAAC;4BACjC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BAClB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAY,CAAC,CAAC;wBAC9B,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,kFAAkF;IAClF,mFAAmF;IACnF,kFAAkF;IAClF,oFAAoF;IACpF,mBAAmB;IACnB,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAChG,MAAM,WAAW,GAAG,IAAI,YAAY,GAAG,CAAC;QAExC,0DAA0D;QAC1D,MAAM,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,mBAAmB,GACvB,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;YACzC,CAAC,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG;YACpG,CAAC,CAAC,IAAI,CAAC;QAEX,IAAI,OAAO,GAAG;;;;4GAI0F,CAAC;QACzG,MAAM,UAAU,GAAc,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QACtE,IAAI,mBAAmB,EAAE,CAAC;YACxB,OAAO,IAAI,+BAA+B,CAAC;YAC3C,UAAU,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,GAAG,CAAC;QACf,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,IAAI,kBAAkB,CAAC;YAC9B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,IAAI,UAAU,CAAC;QACtB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEvB,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAI,UAAqC,CAG/E,CAAC;QAEJ,sEAAsE;QACtE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAY,CAAC,CAAC,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAY,CAAC,EAAE,CAAC;gBACjC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAY,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3C,EAAE,EAAE,CAAC,CAAC,EAAY;QAClB,IAAI,EAAE,CAAC,CAAC,IAAc;QACtB,SAAS,EAAE,CAAC,CAAC,UAAoB;QACjC,QAAQ,EAAG,CAAC,CAAC,SAA2B,IAAI,IAAI;QAChD,KAAK,EAAE,CAAC,CAAC,KAAe;QACxB,IAAI,EAAE,CAAC,CAAC,IAAc;QACtB,SAAS,EAAG,CAAC,CAAC,UAA4B,IAAI,IAAI;QAClD,OAAO,EAAG,CAAC,CAAC,QAA0B,IAAI,IAAI;KAC/C,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/src/storage/fts-store-terms.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Extract code-relevant search terms from a natural-language query.
+ * Strips stopwords, splits camelCase/PascalCase/snake_case, and strips
+ * file extensions (so "CLAUDE.md" also tries "CLAUDE").
+ * Returns an empty array when the query is already a bare identifier.
+ */
+export declare function extractSearchTerms(query: string): string[];
+//# sourceMappingURL=fts-store-terms.d.ts.map

package/dist/src/storage/fts-store-terms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fts-store-terms.d.ts","sourceRoot":"","sources":["../../../src/storage/fts-store-terms.ts"],"names":[],"mappings":"AAkIA;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAuC1D"}

package/dist/src/storage/fts-store-terms.js

@@ -0,0 +1,174 @@
+// ── Intent-to-identifier extraction ──────────────────────────────────────────
+// File-size sweep: split out of fts-store.ts.
+const STOPWORDS = new Set([
+    'a',
+    'an',
+    'the',
+    'is',
+    'are',
+    'was',
+    'were',
+    'be',
+    'been',
+    'being',
+    'have',
+    'has',
+    'had',
+    'do',
+    'does',
+    'did',
+    'will',
+    'would',
+    'shall',
+    'should',
+    'may',
+    'might',
+    'must',
+    'can',
+    'could',
+    'am',
+    'it',
+    'its',
+    'i',
+    'me',
+    'my',
+    'we',
+    'our',
+    'you',
+    'your',
+    'he',
+    'she',
+    'they',
+    'them',
+    'their',
+    'this',
+    'that',
+    'these',
+    'those',
+    'of',
+    'in',
+    'to',
+    'for',
+    'with',
+    'on',
+    'at',
+    'from',
+    'by',
+    'about',
+    'as',
+    'into',
+    'through',
+    'during',
+    'before',
+    'after',
+    'above',
+    'below',
+    'between',
+    'out',
+    'off',
+    'over',
+    'under',
+    'again',
+    'then',
+    'once',
+    'here',
+    'there',
+    'when',
+    'where',
+    'why',
+    'how',
+    'all',
+    'both',
+    'each',
+    'every',
+    'few',
+    'more',
+    'most',
+    'other',
+    'some',
+    'such',
+    'no',
+    'nor',
+    'not',
+    'only',
+    'own',
+    'same',
+    'so',
+    'than',
+    'too',
+    'very',
+    'just',
+    'because',
+    'but',
+    'and',
+    'or',
+    'if',
+    'while',
+    'what',
+    'which',
+    'who',
+    'whom',
+    'up',
+    'down',
+    'get',
+    'set',
+    'add',
+    'use',
+    'find',
+    'show',
+    'make',
+    'let',
+    'want',
+    'need',
+    'like',
+    'look',
+    'also',
+    'new',
+    'old',
+]);
+/**
+ * Extract code-relevant search terms from a natural-language query.
+ * Strips stopwords, splits camelCase/PascalCase/snake_case, and strips
+ * file extensions (so "CLAUDE.md" also tries "CLAUDE").
+ * Returns an empty array when the query is already a bare identifier.
+ */
+export function extractSearchTerms(query) {
+    const words = query.split(/[\s,;:!?()[\]{}'"]+/).filter(Boolean);
+    // If query is a single token, it's already a bare identifier query — nothing to extract.
+    // (We used to also bail out for short, stopword-free multi-token queries under the
+    // assumption they were "already an identifier query", but that misfires for queries
+    // like "ExtensionBridge keepalive reconnect" — three distinct identifier-ish tokens
+    // that FTS5 MATCH ANDs together and fails to find as a single row. Since this function
+    // only runs as a fallback after the raw MATCH already returned zero rows, there's no
+    // extra cost to always extracting terms for multi-token queries.)
+    if (words.length <= 1)
+        return [];
+    const terms = new Set();
+    for (const word of words) {
+        const lower = word.toLowerCase();
+        if (STOPWORDS.has(lower))
+            continue;
+        if (word.length < 3)
+            continue;
+        // Strip file extensions: "CLAUDE.md" → also add "CLAUDE"
+        const dotIdx = word.lastIndexOf('.');
+        if (dotIdx > 0 && dotIdx < word.length - 1) {
+            terms.add(word.slice(0, dotIdx));
+            terms.add(word);
+        }
+        // Split camelCase/PascalCase: "ExtensionBridge" → "Extension", "Bridge"
+        const camelParts = word
+            .replace(/([a-z])([A-Z])/g, '$1 $2')
+            .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2')
+            .split(/[\s_-]+/)
+            .filter((p) => p.length >= 3 && !STOPWORDS.has(p.toLowerCase()));
+        if (camelParts.length > 1) {
+            for (const part of camelParts)
+                terms.add(part);
+        }
+        // Keep the original word
+        terms.add(word);
+    }
+    return Array.from(terms);
+}
+//# sourceMappingURL=fts-store-terms.js.map

package/dist/src/storage/fts-store-terms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fts-store-terms.js","sourceRoot":"","sources":["../../../src/storage/fts-store-terms.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,8CAA8C;AAE9C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,GAAG;IACH,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,KAAK;IACL,OAAO;IACP,MAAM;IACN,KAAK;IACL,OAAO;IACP,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,OAAO;IACP,OAAO;IACP,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,OAAO;IACP,IAAI;IACJ,MAAM;IACN,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,KAAK;IACL,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,MAAM;IACN,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,OAAO;IACP,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;IACT,KAAK;IACL,KAAK;IACL,IAAI;IACJ,IAAI;IACJ,OAAO;IACP,MAAM;IACN,OAAO;IACP,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,MAAM;IACN,KAAK;IACL,KAAK;CACN,CAAC,CAAC;AAEH;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAa;IAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACjE,yFAAyF;IACzF,mFAAmF;IACnF,oFAAoF;IACpF,oFAAoF;IACpF,uFAAuF;IACvF,qFAAqF;IACrF,kEAAkE;IAClE,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAEjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACnC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAE9B,yDAAyD;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,CAAC;QAED,wEAAwE;QACxE,MAAM,UAAU,GAAG,IAAI;aACpB,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;aACnC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC;aACzC,KAAK,CAAC,SAAS,CAAC;aAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACnE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,UAAU;gBAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;QAED,yBAAyB;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC"}

package/dist/src/storage/fts-store.d.ts

@@ -1,50 +1,16 @@
-import type Database from 'better-sqlite3';
 /**
- * Extract code-relevant search terms from a natural-language query.
- * Strips stopwords, splits camelCase/PascalCase/snake_case, and strips
- * file extensions (so "CLAUDE.md" also tries "CLAUDE").
- * Returns an empty array when the query is already a bare identifier.
- */
-export declare function extractSearchTerms(query: string): string[];
-export interface FtsResult {
-    id: string;
-    name: string;
-    normLabel: string;
-    filePath: string | null;
-    label: string;
-    rank: number;
-    /** First line of the symbol in its source file (1-based, null if unknown). */
-    startLine: number | null;
-    /** Last line of the symbol in its source file (1-based, null if unknown). */
-    endLine: number | null;
-}
-/**
- * THE single conversion from FTS5's `rank` to monograph's score convention.
- *
- * SCORE CONVENTION: every score that leaves the search layer is
- * **higher-is-better and non-negative**. SQLite FTS5's `rank` is the opposite
- * (negative, and *more* negative means a *better* match), so a raw rank must
- * never escape this module — forwarding one into a ranker that takes maxima
- * lets an unrelated node sitting at 0 outrank a genuine match at -0.656.
- *
- * Maps |rank| through x/(1+x) into (0, 1): monotonically increasing, so
- * relative BM25 order is preserved, and bounded, so it composes with the
- * additive fuzzy/node-type bonuses without one term swamping the others.
- */
-export declare function relevanceFromFtsRank(rank: number): number;
-export declare function ftsSearch(db: Database.Database, query: string, limit: number, label?: string): FtsResult[];
-export interface HybridSearchResult extends FtsResult {
-    combinedScore: number;
-    matchStrategy: 'fts' | 'like' | 'fuzzy';
-}
-/**
- * Hybrid search combining three strategies:
- *  1. FTS5 (trigram) BM25 match via `ftsSearch`
- *  2. LIKE fallback for short queries (≤3 chars) or when FTS returns 0 results
- *  3. In-memory fuzzy character-sequence scoring applied to all candidates
+ * FTS5 search, intent-extraction, and hybrid search over the monograph nodes
+ * table.
  *
- * Results are deduped by id (highest combinedScore wins), re-ranked, and
- * trimmed to `limit`. The existing `ftsSearch` is left unchanged.
+ * File-size sweep: split into sibling modules — stopwords + intent-to-
+ * identifier extraction in fts-store-terms.ts, the FTS5/LIKE search path in
+ * fts-store-search.ts, and hybrid (FTS + LIKE + fuzzy) search in
+ * fts-store-hybrid.ts. Re-exported here so every existing import path
+ * (`./fts-store.js`) keeps working unchanged.
  */
-export declare function hybridSearch(db: Database.Database, query: string, limit: number, label?: string): HybridSearchResult[];
+export type { HybridSearchResult } from './fts-store-hybrid.js';
+export { hybridSearch } from './fts-store-hybrid.js';
+export type { FtsResult } from './fts-store-search.js';
+export { ftsSearch, relevanceFromFtsRank } from './fts-store-search.js';
+export { extractSearchTerms } from './fts-store-terms.js';
 //# sourceMappingURL=fts-store.d.ts.map

package/dist/src/storage/fts-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fts-store.d.ts","sourceRoot":"","sources":["../../../src/storage/fts-store.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAmI3C;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAuC1D;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,8EAA8E;IAC9E,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,6EAA6E;IAC7E,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CACxB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAGzD;AAgBD,wBAAgB,SAAS,CACvB,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,CAAC,EAAE,MAAM,GACb,SAAS,EAAE,CA+Jb;AAID,MAAM,WAAW,kBAAmB,SAAQ,SAAS;IACnD,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,KAAK,GAAG,MAAM,GAAG,OAAO,CAAC;CACzC;AAyCD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAC1B,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,KAAK,CAAC,EAAE,MAAM,GACb,kBAAkB,EAAE,CA0EtB"}
+{"version":3,"file":"fts-store.d.ts","sourceRoot":"","sources":["../../../src/storage/fts-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,YAAY,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,YAAY,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC"}