scai 0.1.178 → 1.0.0

package/dist/agent/search/semanticIndexSearch.js

@@ -0,0 +1,202 @@
+/**
+ * Owns DB-backed semantic retrieval for the new agent search area.
+ *
+ * Why this file exists:
+ * - the new agent should keep semantic retrieval under one search-owned module
+ * - empty-result recovery should stay in one deterministic search owner
+ * - primary query, recovery queries, weak-result checks, and row merging stay together here
+ */
+import { RELATED_FILES_LIMIT } from "../../constants.js";
+import { getDbForRepo } from "../../db/client.js";
+import * as sqlTemplates from "../../db/sqlTemplates.js";
+import { STOP_WORDS } from "../../fileRules/stopWords.js";
+import { compileSearchQuery } from "../../utils/compileSearchQuery.js";
+const QUERY_OPERATOR_TOKENS = new Set(["or", "and", "not", "near"]);
+const GENERIC_FTS_TERMS = new Set([
+    "file",
+    "files",
+    "code",
+    "source",
+    "repository",
+    "result",
+    "results",
+    "output",
+    "entry",
+    "database",
+    "configuration",
+]);
+const MAX_PRIMARY_TERMS = 12;
+const MAX_FALLBACK_TERMS = 10;
+const MAX_RECOVERY_QUERIES = 2;
+const GENERIC_RECOVERY_TERMS = new Set(["agent", "loop", "turn", "count", "max"]);
+/**
+ * Runs one semantic indexed search with one primary query and optional fallback queries.
+ * Example: "console presentation centralization runtime messages" can miss on the primary query,
+ * then recover on one of the fallback queries without exposing those fallback internals in the human log.
+ */
+export async function runSemanticIndexSearch(originalQuery, topK = 5) {
+    const db = getDbForRepo();
+    const stmt = db.prepare(sqlTemplates.searchFilesTemplate);
+    const primaryTerms = resolvePrimaryTerms(originalQuery);
+    const primaryQuery = buildFtsExpression(primaryTerms);
+    const merged = new Map();
+    const executedQueries = [];
+    const primaryResults = primaryQuery
+        ? stmt.all(primaryQuery, RELATED_FILES_LIMIT)
+        : [];
+    if (primaryQuery) {
+        executedQueries.push(primaryQuery);
+    }
+    addRows(merged, primaryResults);
+    const recoveryPlan = shouldUseRecoveryQueries(primaryResults)
+        ? buildRecoveryQueries(originalQuery, primaryTerms)
+        : { queries: [], reason: undefined };
+    let recoveryUsed = false;
+    for (const query of recoveryPlan.queries) {
+        const rows = stmt.all(query, RELATED_FILES_LIMIT);
+        executedQueries.push(query);
+        addRows(merged, rows);
+        recoveryUsed = true;
+    }
+    return {
+        ...buildSearchResult(Array.from(merged.values()), topK, {
+            queriesRun: executedQueries,
+            recoveryUsed,
+            ...(recoveryPlan.reason ? { recoveryReason: recoveryPlan.reason } : {}),
+        }, executedQueries),
+    };
+}
+function buildSearchResult(rows, topK, debug, queriesUsed) {
+    const hits = rows
+        .sort((left, right) => (left.bm25Score ?? 0) - (right.bm25Score ?? 0))
+        .slice(0, topK)
+        .map((row) => ({
+        path: row.path,
+        filename: row.filename,
+        ...(typeof row.bm25Score === "number" ? { bm25Score: row.bm25Score } : {}),
+    }));
+    const relatedFileScores = Object.fromEntries(hits.flatMap((hit) => typeof hit.bm25Score === "number" && Number.isFinite(hit.bm25Score)
+        ? [[hit.path, hit.bm25Score]]
+        : []));
+    return {
+        hits,
+        relatedFileScores,
+        debug: {
+            queriesRun: debug.queriesRun,
+            recoveryUsed: debug.recoveryUsed,
+            ...(debug.recoveryReason ? { recoveryReason: debug.recoveryReason } : {}),
+        },
+        matchTerms: dedupeTerms(queriesUsed.flatMap((query) => extractFtsTerms(query))),
+    };
+}
+function resolvePrimaryTerms(userQuery) {
+    return sanitizeTerms(compileSearchQuery({
+        query: userQuery,
+        mode: "fts",
+        maxTerms: MAX_PRIMARY_TERMS,
+    }).fts.terms, MAX_PRIMARY_TERMS);
+}
+/**
+ * Keeps empty-result recovery bounded and deterministic.
+ * Example:
+ * - query: "where do I set the max count for how many loops the agent can run?"
+ * - output: one relaxed content query and one path-biased query
+ */
+function buildRecoveryQueries(userQuery, primaryTerms) {
+    const compiled = compileSearchQuery({
+        query: userQuery,
+        mode: "fts",
+        maxTerms: MAX_FALLBACK_TERMS,
+    }).fts.terms;
+    const relaxedTerms = dedupeTerms(compiled.map(normalizeRecoveryTerm))
+        .filter((term) => term.length >= 3)
+        .filter((term) => !primaryTerms.includes(term));
+    const pathBiasedTerms = dedupeTerms([
+        ...extractPathBiasedTerms(userQuery),
+        ...relaxedTerms.filter((term) => GENERIC_RECOVERY_TERMS.has(term)),
+    ]).slice(0, 5);
+    const queries = [
+        buildFtsExpression(relaxedTerms.slice(0, 6), { allowGenericTerms: true }),
+        buildFtsExpression(pathBiasedTerms, { allowGenericTerms: true }),
+    ]
+        .filter(Boolean)
+        .filter((query) => query !== buildFtsExpression(primaryTerms))
+        .slice(0, MAX_RECOVERY_QUERIES);
+    return {
+        queries,
+        ...(queries.length > 0 ? { reason: "primary-empty" } : {}),
+    };
+}
+function sanitizeTerms(terms, maxTerms, options = {}) {
+    return dedupeTerms(terms.filter((term) => {
+        const normalized = normalizeFtsTerm(term);
+        if (!normalized || QUERY_OPERATOR_TOKENS.has(normalized))
+            return false;
+        if (!options.allowGenericTerms && GENERIC_FTS_TERMS.has(normalized))
+            return false;
+        if (STOP_WORDS.has(normalized))
+            return false;
+        return true;
+    })).slice(0, maxTerms);
+}
+function buildFtsExpression(terms, options = {}) {
+    return sanitizeTerms(terms, MAX_PRIMARY_TERMS, options)
+        .map((term) => `${normalizeFtsTerm(term)}*`)
+        .join(" OR ");
+}
+function addRows(target, rows) {
+    for (const row of rows) {
+        target.set(row.id, row);
+    }
+}
+function shouldUseRecoveryQueries(rows) {
+    return rows.length === 0;
+}
+function normalizeRecoveryTerm(term) {
+    const normalized = normalizeFtsTerm(term);
+    if (normalized.endsWith("s") && normalized.length > 4) {
+        return normalized.slice(0, -1);
+    }
+    if (normalized === "maximum")
+        return "max";
+    if (normalized === "limits")
+        return "limit";
+    if (normalized === "counts")
+        return "count";
+    if (normalized === "turns")
+        return "turn";
+    if (normalized === "loops")
+        return "loop";
+    return normalized;
+}
+function extractPathBiasedTerms(query) {
+    const tokens = String(query ?? "")
+        .toLowerCase()
+        .match(/[a-z0-9_]{3,}/g) ?? [];
+    return dedupeTerms(tokens.map(normalizeRecoveryTerm))
+        .filter((term) => !STOP_WORDS.has(term))
+        .filter((term) => term.length >= 3)
+        .slice(0, 6);
+}
+function normalizeFtsTerm(term) {
+    return term.toLowerCase().replace(/[^a-z0-9_]/g, "").trim();
+}
+function dedupeTerms(terms) {
+    const seen = new Set();
+    const out = [];
+    for (const term of terms) {
+        const key = normalizeFtsTerm(term);
+        if (!key || seen.has(key))
+            continue;
+        seen.add(key);
+        out.push(term);
+    }
+    return out;
+}
+function extractFtsTerms(query) {
+    return dedupeTerms(String(query ?? "")
+        .split(/\bOR\b/i)
+        .map((term) => term.replace(/\*/g, "").trim())
+        .filter(Boolean));
+}
+//# sourceMappingURL=semanticIndexSearch.js.map

package/dist/agent/search/semanticIndexSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semanticIndexSearch.js","sourceRoot":"","sources":["../../../src/agent/search/semanticIndexSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,KAAK,YAAY,MAAM,0BAA0B,CAAC;AAEzD,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1D,OAAO,EAAE,kBAAkB,EAAE,MAAM,mCAAmC,CAAC;AAEvE,MAAM,qBAAqB,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AACpE,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC;IAChC,MAAM;IACN,OAAO;IACP,MAAM;IACN,QAAQ;IACR,YAAY;IACZ,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,OAAO;IACP,UAAU;IACV,eAAe;CAChB,CAAC,CAAC;AACH,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,oBAAoB,GAAG,CAAC,CAAC;AAC/B,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAqBlF;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,aAAqB,EACrB,IAAI,GAAG,CAAC;IAER,MAAM,EAAE,GAAG,YAAY,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,mBAAmB,CAAC,CAAC;IAC1D,MAAM,YAAY,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;IACxD,MAAM,YAAY,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC5C,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,cAAc,GAAG,YAAY;QACjC,CAAC,CAAE,IAAI,CAAC,GAAG,CAAC,YAAY,EAAE,mBAAmB,CAAiB;QAC9D,CAAC,CAAC,EAAE,CAAC;IAEP,IAAI,YAAY,EAAE,CAAC;QACjB,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAEhC,MAAM,YAAY,GAAG,wBAAwB,CAAC,cAAc,CAAC;QAC3D,CAAC,CAAC,oBAAoB,CAAC,aAAa,EAAE,YAAY,CAAC;QACnD,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAEvC,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,YAAY,CAAC,OAAO,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,mBAAmB,CAAgB,CAAC;QACjE,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACtB,YAAY,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,OAAO;QACL,GAAG,iBAAiB,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE;YACtD,UAAU,EAAE,eAAe;YAC3B,YAAY;YACZ,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACxE,EAAE,eAAe,CAAC;KACpB,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CACxB,IAAiB,EACjB,IAAY,EACZ,KAAyB,EACzB,WAAqB;IAErB,MAAM,IAAI,GAAG,IAAI;SACd,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC;SACrE,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;SACd,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,GAAG,CAAC,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3E,CAAC,CAAC,CAAC;IAEN,MAAM,iBAAiB,GAAG,MAAM,CAAC,WAAW,CAC1C,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CACnB,OAAO,GAAG,CAAC,SAAS,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;QACjE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7B,CAAC,CAAC,EAAE,CACP,CACF,CAAC;IAEF,OAAO;QACL,IAAI;QACJ,iBAAiB;QACjB,KAAK,EAAE;YACL,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC1E;QACD,UAAU,EAAE,WAAW,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;KAChF,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAAC,SAAiB;IAC5C,OAAO,aAAa,CAClB,kBAAkB,CAAC;QACjB,KAAK,EAAE,SAAS;QAChB,IAAI,EAAE,KAAK;QACX,QAAQ,EAAE,iBAAiB;KAC5B,CAAC,CAAC,GAAG,CAAC,KAAK,EACZ,iBAAiB,CAClB,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,SAAiB,EACjB,YAAsB;IAEtB,MAAM,QAAQ,GAAG,kBAAkB,CAAC;QAClC,KAAK,EAAE,SAAS;QAChB,IAAI,EAAE,KAAK;QACX,QAAQ,EAAE,kBAAkB;KAC7B,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IACb,MAAM,YAAY,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;SAClE,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;SAClC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,MAAM,eAAe,GAAG,WAAW,CAAC;QAClC,GAAG,sBAAsB,CAAC,SAAS,CAAC;QACpC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;KACnE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEf,MAAM,OAAO,GAAG;QACd,kBAAkB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;QACzE,kBAAkB,CAAC,eAAe,EAAE,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;KACjE;SACE,MAAM,CAAC,OAAO,CAAC;SACf,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,kBAAkB,CAAC,YAAY,CAAC,CAAC;SAC7D,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAElC,OAAO;QACL,OAAO;QACP,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3D,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,KAAe,EAAE,QAAgB,EAAE,UAA2C,EAAE;IACrG,OAAO,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACvC,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,IAAI,qBAAqB,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QACvE,IAAI,CAAC,OAAO,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QAClF,IAAI,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAe,EAAE,UAA2C,EAAE;IACxF,OAAO,aAAa,CAAC,KAAK,EAAE,iBAAiB,EAAE,OAAO,CAAC;SACpD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC;SAC3C,IAAI,CAAC,MAAM,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,OAAO,CAAC,MAA8B,EAAE,IAAiB;IAChE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAiB;IACjD,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAY;IACzC,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAC1C,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC3C,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC;IAC5C,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC;IAC5C,IAAI,UAAU,KAAK,OAAO;QAAE,OAAO,MAAM,CAAC;IAC1C,IAAI,UAAU,KAAK,OAAO;QAAE,OAAO,MAAM,CAAC;IAC1C,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAa;IAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;SAC/B,WAAW,EAAE;SACb,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;IAEjC,OAAO,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;SAClD,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SACvC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;SAClC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY;IACpC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AAC9D,CAAC;AAED,SAAS,WAAW,CAAC,KAAe;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,KAAa;IACpC,OAAO,WAAW,CAChB,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;SAChB,KAAK,CAAC,SAAS,CAAC;SAChB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;SAC7C,MAAM,CAAC,OAAO,CAAC,CACnB,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Owns DB-backed semantic retrieval for the new agent search area.\n *\n * Why this file exists:\n * - the new agent should keep semantic retrieval under one search-owned module\n * - empty-result recovery should stay in one deterministic search owner\n * - primary query, recovery queries, weak-result checks, and row merging stay together here\n */\nimport { RELATED_FILES_LIMIT } from \"../../constants.js\";\nimport { getDbForRepo } from \"../../db/client.js\";\nimport * as sqlTemplates from \"../../db/sqlTemplates.js\";\nimport type { FtsResult } from \"../../types.js\";\nimport { STOP_WORDS } from \"../../fileRules/stopWords.js\";\nimport { compileSearchQuery } from \"../../utils/compileSearchQuery.js\";\n\nconst QUERY_OPERATOR_TOKENS = new Set([\"or\", \"and\", \"not\", \"near\"]);\nconst GENERIC_FTS_TERMS = new Set([\n  \"file\",\n  \"files\",\n  \"code\",\n  \"source\",\n  \"repository\",\n  \"result\",\n  \"results\",\n  \"output\",\n  \"entry\",\n  \"database\",\n  \"configuration\",\n]);\nconst MAX_PRIMARY_TERMS = 12;\nconst MAX_FALLBACK_TERMS = 10;\nconst MAX_RECOVERY_QUERIES = 2;\nconst GENERIC_RECOVERY_TERMS = new Set([\"agent\", \"loop\", \"turn\", \"count\", \"max\"]);\n\nexport interface SemanticIndexHit {\n  path: string;\n  filename: string;\n  bm25Score?: number;\n}\n\nexport interface SemanticIndexDebug {\n  queriesRun: string[];\n  recoveryUsed: boolean;\n  recoveryReason?: string;\n}\n\nexport interface SemanticIndexSearchResult {\n  hits: SemanticIndexHit[];\n  relatedFileScores: Record<string, number>;\n  debug: SemanticIndexDebug;\n  matchTerms: string[];\n}\n\n/**\n * Runs one semantic indexed search with one primary query and optional fallback queries.\n * Example: \"console presentation centralization runtime messages\" can miss on the primary query,\n * then recover on one of the fallback queries without exposing those fallback internals in the human log.\n */\nexport async function runSemanticIndexSearch(\n  originalQuery: string,\n  topK = 5\n): Promise<SemanticIndexSearchResult> {\n  const db = getDbForRepo();\n  const stmt = db.prepare(sqlTemplates.searchFilesTemplate);\n  const primaryTerms = resolvePrimaryTerms(originalQuery);\n  const primaryQuery = buildFtsExpression(primaryTerms);\n  const merged = new Map<number, FtsResult>();\n  const executedQueries: string[] = [];\n  const primaryResults = primaryQuery\n    ? (stmt.all(primaryQuery, RELATED_FILES_LIMIT) as FtsResult[])\n    : [];\n\n  if (primaryQuery) {\n    executedQueries.push(primaryQuery);\n  }\n  addRows(merged, primaryResults);\n\n  const recoveryPlan = shouldUseRecoveryQueries(primaryResults)\n    ? buildRecoveryQueries(originalQuery, primaryTerms)\n    : { queries: [], reason: undefined };\n\n  let recoveryUsed = false;\n  for (const query of recoveryPlan.queries) {\n    const rows = stmt.all(query, RELATED_FILES_LIMIT) as FtsResult[];\n    executedQueries.push(query);\n    addRows(merged, rows);\n    recoveryUsed = true;\n  }\n\n  return {\n    ...buildSearchResult(Array.from(merged.values()), topK, {\n      queriesRun: executedQueries,\n      recoveryUsed,\n      ...(recoveryPlan.reason ? { recoveryReason: recoveryPlan.reason } : {}),\n    }, executedQueries),\n  };\n}\n\nfunction buildSearchResult(\n  rows: FtsResult[],\n  topK: number,\n  debug: SemanticIndexDebug,\n  queriesUsed: string[]\n): SemanticIndexSearchResult {\n  const hits = rows\n    .sort((left, right) => (left.bm25Score ?? 0) - (right.bm25Score ?? 0))\n    .slice(0, topK)\n    .map((row) => ({\n      path: row.path,\n      filename: row.filename,\n      ...(typeof row.bm25Score === \"number\" ? { bm25Score: row.bm25Score } : {}),\n    }));\n\n  const relatedFileScores = Object.fromEntries(\n    hits.flatMap((hit) =>\n      typeof hit.bm25Score === \"number\" && Number.isFinite(hit.bm25Score)\n        ? [[hit.path, hit.bm25Score]]\n        : []\n    )\n  );\n\n  return {\n    hits,\n    relatedFileScores,\n    debug: {\n      queriesRun: debug.queriesRun,\n      recoveryUsed: debug.recoveryUsed,\n      ...(debug.recoveryReason ? { recoveryReason: debug.recoveryReason } : {}),\n    },\n    matchTerms: dedupeTerms(queriesUsed.flatMap((query) => extractFtsTerms(query))),\n  };\n}\n\nfunction resolvePrimaryTerms(userQuery: string): string[] {\n  return sanitizeTerms(\n    compileSearchQuery({\n      query: userQuery,\n      mode: \"fts\",\n      maxTerms: MAX_PRIMARY_TERMS,\n    }).fts.terms,\n    MAX_PRIMARY_TERMS\n  );\n}\n\n/**\n * Keeps empty-result recovery bounded and deterministic.\n * Example:\n * - query: \"where do I set the max count for how many loops the agent can run?\"\n * - output: one relaxed content query and one path-biased query\n */\nfunction buildRecoveryQueries(\n  userQuery: string,\n  primaryTerms: string[]\n): { queries: string[]; reason?: string } {\n  const compiled = compileSearchQuery({\n    query: userQuery,\n    mode: \"fts\",\n    maxTerms: MAX_FALLBACK_TERMS,\n  }).fts.terms;\n  const relaxedTerms = dedupeTerms(compiled.map(normalizeRecoveryTerm))\n    .filter((term) => term.length >= 3)\n    .filter((term) => !primaryTerms.includes(term));\n  const pathBiasedTerms = dedupeTerms([\n    ...extractPathBiasedTerms(userQuery),\n    ...relaxedTerms.filter((term) => GENERIC_RECOVERY_TERMS.has(term)),\n  ]).slice(0, 5);\n\n  const queries = [\n    buildFtsExpression(relaxedTerms.slice(0, 6), { allowGenericTerms: true }),\n    buildFtsExpression(pathBiasedTerms, { allowGenericTerms: true }),\n  ]\n    .filter(Boolean)\n    .filter((query) => query !== buildFtsExpression(primaryTerms))\n    .slice(0, MAX_RECOVERY_QUERIES);\n\n  return {\n    queries,\n    ...(queries.length > 0 ? { reason: \"primary-empty\" } : {}),\n  };\n}\n\nfunction sanitizeTerms(terms: string[], maxTerms: number, options: { allowGenericTerms?: boolean } = {}): string[] {\n  return dedupeTerms(terms.filter((term) => {\n    const normalized = normalizeFtsTerm(term);\n    if (!normalized || QUERY_OPERATOR_TOKENS.has(normalized)) return false;\n    if (!options.allowGenericTerms && GENERIC_FTS_TERMS.has(normalized)) return false;\n    if (STOP_WORDS.has(normalized)) return false;\n    return true;\n  })).slice(0, maxTerms);\n}\n\nfunction buildFtsExpression(terms: string[], options: { allowGenericTerms?: boolean } = {}): string {\n  return sanitizeTerms(terms, MAX_PRIMARY_TERMS, options)\n    .map((term) => `${normalizeFtsTerm(term)}*`)\n    .join(\" OR \");\n}\n\nfunction addRows(target: Map<number, FtsResult>, rows: FtsResult[]): void {\n  for (const row of rows) {\n    target.set(row.id, row);\n  }\n}\n\nfunction shouldUseRecoveryQueries(rows: FtsResult[]): boolean {\n  return rows.length === 0;\n}\n\nfunction normalizeRecoveryTerm(term: string): string {\n  const normalized = normalizeFtsTerm(term);\n  if (normalized.endsWith(\"s\") && normalized.length > 4) {\n    return normalized.slice(0, -1);\n  }\n  if (normalized === \"maximum\") return \"max\";\n  if (normalized === \"limits\") return \"limit\";\n  if (normalized === \"counts\") return \"count\";\n  if (normalized === \"turns\") return \"turn\";\n  if (normalized === \"loops\") return \"loop\";\n  return normalized;\n}\n\nfunction extractPathBiasedTerms(query: string): string[] {\n  const tokens = String(query ?? \"\")\n    .toLowerCase()\n    .match(/[a-z0-9_]{3,}/g) ?? [];\n\n  return dedupeTerms(tokens.map(normalizeRecoveryTerm))\n    .filter((term) => !STOP_WORDS.has(term))\n    .filter((term) => term.length >= 3)\n    .slice(0, 6);\n}\n\nfunction normalizeFtsTerm(term: string): string {\n  return term.toLowerCase().replace(/[^a-z0-9_]/g, \"\").trim();\n}\n\nfunction dedupeTerms(terms: string[]): string[] {\n  const seen = new Set<string>();\n  const out: string[] = [];\n  for (const term of terms) {\n    const key = normalizeFtsTerm(term);\n    if (!key || seen.has(key)) continue;\n    seen.add(key);\n    out.push(term);\n  }\n  return out;\n}\n\nfunction extractFtsTerms(query: string): string[] {\n  return dedupeTerms(\n    String(query ?? \"\")\n      .split(/\\bOR\\b/i)\n      .map((term) => term.replace(/\\*/g, \"\").trim())\n      .filter(Boolean)\n  );\n}\n"]}

package/dist/agent/search/shared.js

@@ -0,0 +1,283 @@
+/**
+ * Shared filesystem helpers for modular-agent search lanes.
+ *
+ * Why this file exists:
+ * - lane helpers need one place for repo-safe path collection
+ * - file and folder scans should stay out of route and retention policy
+ * - bounded content-match extraction should stay separate from lane routing
+ * - generic search-term cleanup should stay in one shared owner for all lanes
+ */
+import fs from "fs";
+import path from "path";
+import { isPathIgnoredByFolderGlobs } from "../../fileRules/ignoredPaths.js";
+import { STOP_WORDS } from "../../fileRules/stopWords.js";
+import { classifySnippetEvidence, shouldKeepSnippetInMatches, } from "./snippetEvidence.js";
+export function dedupeStrings(values) {
+    const seen = new Set();
+    const out = [];
+    for (const value of values) {
+        if (!value || seen.has(value))
+            continue;
+        seen.add(value);
+        out.push(value);
+    }
+    return out;
+}
+export function collectSearchablePaths(rootDir, options = {}) {
+    const files = [];
+    const directories = collectSearchableDirectories(rootDir, options);
+    const stack = [...directories];
+    while (stack.length > 0) {
+        const currentDir = stack.pop();
+        if (!currentDir)
+            continue;
+        let entries = [];
+        try {
+            entries = fs.readdirSync(currentDir, { withFileTypes: true });
+        }
+        catch {
+            continue;
+        }
+        for (const entry of entries) {
+            if (entry.name === ".git" || entry.name === "node_modules")
+                continue;
+            const fullPath = path.join(currentDir, entry.name);
+            const relativePath = path.relative(rootDir, fullPath).replace(/\\/g, "/");
+            if (entry.isDirectory()) {
+                continue;
+            }
+            if (!options.allowIgnoredPaths && isPathIgnoredByFolderGlobs(relativePath)) {
+                continue;
+            }
+            files.push(fullPath);
+        }
+    }
+    return files;
+}
+export function collectSearchableDirectories(rootDir, options = {}) {
+    const directories = [];
+    const stack = [rootDir];
+    while (stack.length > 0) {
+        const currentDir = stack.pop();
+        if (!currentDir)
+            continue;
+        directories.push(currentDir);
+        let entries = [];
+        try {
+            entries = fs.readdirSync(currentDir, { withFileTypes: true });
+        }
+        catch {
+            continue;
+        }
+        for (const entry of entries) {
+            if (entry.name === ".git" || entry.name === "node_modules")
+                continue;
+            const fullPath = path.join(currentDir, entry.name);
+            const relativePath = path.relative(rootDir, fullPath).replace(/\\/g, "/");
+            if (entry.isDirectory()) {
+                if (options.allowIgnoredPaths || !isPathIgnoredByFolderGlobs(relativePath)) {
+                    stack.push(fullPath);
+                }
+                continue;
+            }
+        }
+    }
+    return directories;
+}
+export function collectDirectDirectoryEntries(folderPath) {
+    try {
+        return fs.readdirSync(folderPath, { withFileTypes: true })
+            .filter((entry) => !entry.name.startsWith("."))
+            .map((entry) => ({
+            name: entry.name,
+            kind: entry.isDirectory() ? "folder" : "file",
+        }))
+            .sort((left, right) => left.name.localeCompare(right.name));
+    }
+    catch {
+        return [];
+    }
+}
+function safeReadFile(filePath) {
+    try {
+        return fs.readFileSync(filePath, "utf8");
+    }
+    catch {
+        return "";
+    }
+}
+function clampSnippet(snippet) {
+    return snippet.trim().slice(0, 220);
+}
+function dedupeMatches(matches) {
+    const seen = new Set();
+    const out = [];
+    for (const match of matches) {
+        const key = [
+            match.filePath,
+            match.line ?? "",
+            match.column ?? "",
+            match.matchKind,
+            match.snippet,
+        ].join("|");
+        if (seen.has(key)) {
+            continue;
+        }
+        seen.add(key);
+        out.push(match);
+    }
+    return out;
+}
+export function tokenizeSearchTerms(query) {
+    return dedupeStrings(String(query ?? "")
+        .split(/[^A-Za-z0-9_./-]+/)
+        .map((part) => part.trim().toLowerCase())
+        .filter((part) => part.length >= 3)
+        .filter((part) => !STOP_WORDS.has(part))).slice(0, 8);
+}
+export function collectFixedStringMatches(filePaths, fragments, matchKind, options = {}) {
+    const maxPerFile = options.maxPerFile ?? 2;
+    const maxTotal = options.maxTotal ?? 8;
+    const needles = dedupeStrings(fragments.map((fragment) => String(fragment ?? "").trim()).filter(Boolean));
+    if (needles.length === 0) {
+        return [];
+    }
+    const matches = [];
+    for (const filePath of filePaths) {
+        const code = safeReadFile(filePath);
+        if (!code) {
+            continue;
+        }
+        const lines = code.split(/\r?\n/);
+        const fileMatches = [];
+        for (let index = 0; index < lines.length && matches.length < maxTotal; index += 1) {
+            const line = lines[index];
+            const haystack = options.caseSensitive ? line : line.toLowerCase();
+            for (const needle of needles) {
+                const normalizedNeedle = options.caseSensitive ? needle : needle.toLowerCase();
+                const column = haystack.indexOf(normalizedNeedle);
+                if (column < 0) {
+                    continue;
+                }
+                const snippet = clampSnippet(line);
+                fileMatches.push({
+                    filePath,
+                    line: index + 1,
+                    column: column + 1,
+                    snippet,
+                    matchKind,
+                    score: normalizedNeedle.length,
+                    reasons: [`term:${needle}`],
+                    evidenceKind: classifySnippetEvidence(snippet, matchKind),
+                });
+                break;
+            }
+        }
+        const hasAnswerEvidence = fileMatches.some((match) => match.evidenceKind === "answer-evidence");
+        let keptAnswerCount = 0;
+        let keptReferenceCount = 0;
+        for (const match of fileMatches) {
+            if (matches.length >= maxTotal) {
+                break;
+            }
+            const keep = shouldKeepSnippetInMatches(match.evidenceKind, {
+                maxPerFile,
+                hasAnswerEvidence,
+                keptAnswerCount,
+                keptReferenceCount,
+            });
+            if (!keep) {
+                continue;
+            }
+            matches.push({
+                filePath: match.filePath,
+                line: match.line,
+                column: match.column,
+                snippet: match.snippet,
+                matchKind: match.matchKind,
+                score: match.score,
+                reasons: match.reasons,
+            });
+            if (match.evidenceKind === "answer-evidence") {
+                keptAnswerCount += 1;
+            }
+            else {
+                keptReferenceCount += 1;
+            }
+        }
+    }
+    return dedupeMatches(matches);
+}
+export function collectRegexMatches(filePaths, pattern, flags = "i", options = {}) {
+    const maxPerFile = options.maxPerFile ?? 2;
+    const maxTotal = options.maxTotal ?? 8;
+    let regex = null;
+    try {
+        regex = new RegExp(pattern, flags);
+    }
+    catch {
+        return [];
+    }
+    const matches = [];
+    for (const filePath of filePaths) {
+        const code = safeReadFile(filePath);
+        if (!code) {
+            continue;
+        }
+        const lines = code.split(/\r?\n/);
+        const fileMatches = [];
+        for (let index = 0; index < lines.length && matches.length < maxTotal; index += 1) {
+            const line = lines[index];
+            regex.lastIndex = 0;
+            const match = regex.exec(line);
+            if (!match) {
+                continue;
+            }
+            const snippet = clampSnippet(line);
+            fileMatches.push({
+                filePath,
+                line: index + 1,
+                column: (match.index ?? 0) + 1,
+                snippet,
+                matchKind: "regex-content",
+                score: String(match[0] ?? "").length,
+                reasons: [`pattern:${pattern}`],
+                evidenceKind: classifySnippetEvidence(snippet, "regex-content"),
+            });
+        }
+        const hasAnswerEvidence = fileMatches.some((match) => match.evidenceKind === "answer-evidence");
+        let keptAnswerCount = 0;
+        let keptReferenceCount = 0;
+        for (const match of fileMatches) {
+            if (matches.length >= maxTotal) {
+                break;
+            }
+            const keep = shouldKeepSnippetInMatches(match.evidenceKind, {
+                maxPerFile,
+                hasAnswerEvidence,
+                keptAnswerCount,
+                keptReferenceCount,
+            });
+            if (!keep) {
+                continue;
+            }
+            matches.push({
+                filePath: match.filePath,
+                line: match.line,
+                column: match.column,
+                snippet: match.snippet,
+                matchKind: match.matchKind,
+                score: match.score,
+                reasons: match.reasons,
+            });
+            if (match.evidenceKind === "answer-evidence") {
+                keptAnswerCount += 1;
+            }
+            else {
+                keptReferenceCount += 1;
+            }
+        }
+    }
+    return dedupeMatches(matches);
+}
+//# sourceMappingURL=shared.js.map

package/dist/agent/search/shared.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.js","sourceRoot":"","sources":["../../../src/agent/search/shared.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,EAAE,0BAA0B,EAAE,MAAM,iCAAiC,CAAC;AAC7E,OAAO,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAE1D,OAAO,EACL,uBAAuB,EACvB,0BAA0B,GAE3B,MAAM,sBAAsB,CAAC;AAM9B,MAAM,UAAU,aAAa,CAAC,MAAgB;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QACxC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChB,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,OAAe,EAAE,UAAiC,EAAE;IACzF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,WAAW,GAAG,4BAA4B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACnE,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,UAAU;YAAE,SAAS;QAC1B,IAAI,OAAO,GAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc;gBAAE,SAAS;YACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1E,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,IAAI,0BAA0B,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC3E,SAAS;YACX,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,4BAA4B,CAAC,OAAe,EAAE,UAAiC,EAAE;IAC/F,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;IACxB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,UAAU;YAAE,SAAS;QAC1B,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7B,IAAI,OAAO,GAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC;YACH,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc;gBAAE,SAAS;YACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC1E,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACxB,IAAI,OAAO,CAAC,iBAAiB,IAAI,CAAC,0BAA0B,CAAC,YAAY,CAAC,EAAE,CAAC;oBAC3E,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvB,CAAC;gBACD,SAAS;YACX,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,6BAA6B,CAAC,UAAkB;IAC9D,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;aACvD,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;aAC9C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACf,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,QAAiB,CAAC,CAAC,CAAC,MAAe;SAChE,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAChE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,QAAgB;IACpC,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,OAAe;IACnC,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACtC,CAAC;AAMD,SAAS,aAAa,CAAC,OAA2B;IAChD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAuB,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG;YACV,KAAK,CAAC,QAAQ;YACd,KAAK,CAAC,IAAI,IAAI,EAAE;YAChB,KAAK,CAAC,MAAM,IAAI,EAAE;YAClB,KAAK,CAAC,SAAS;YACf,KAAK,CAAC,OAAO;SACd,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,KAAa;IAC/C,OAAO,aAAa,CAClB,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;SAChB,KAAK,CAAC,mBAAmB,CAAC;SAC1B,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;SACxC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;SAClC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAC3C,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,yBAAyB,CACvC,SAAmB,EACnB,SAAmB,EACnB,SAAwE,EACxE,UAII,EAAE;IAEN,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;IACvC,MAAM,OAAO,GAAG,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1G,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,WAAW,GAAiC,EAAE,CAAC;QACrD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAClF,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,MAAM,QAAQ,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACnE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,gBAAgB,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;gBAC/E,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;gBAClD,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;gBACnC,WAAW,CAAC,IAAI,CAAC;oBACf,QAAQ;oBACR,IAAI,EAAE,KAAK,GAAG,CAAC;oBACf,MAAM,EAAE,MAAM,GAAG,CAAC;oBAClB,OAAO;oBACP,SAAS;oBACT,KAAK,EAAE,gBAAgB,CAAC,MAAM;oBAC9B,OAAO,EAAE,CAAC,QAAQ,MAAM,EAAE,CAAC;oBAC3B,YAAY,EAAE,uBAAuB,CAAC,OAAO,EAAE,SAAS,CAAC;iBAC1D,CAAC,CAAC;gBACH,MAAM;YACR,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,KAAK,iBAAiB,CAAC,CAAC;QAChG,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM;YACR,CAAC;YACD,MAAM,IAAI,GAAG,0BAA0B,CAAC,KAAK,CAAC,YAAY,EAAE;gBAC1D,UAAU;gBACV,iBAAiB;gBACjB,eAAe;gBACf,kBAAkB;aACnB,CAAC,CAAC;YACH,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB,CAAC,CAAC;YACH,IAAI,KAAK,CAAC,YAAY,KAAK,iBAAiB,EAAE,CAAC;gBAC7C,eAAe,IAAI,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,kBAAkB,IAAI,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,SAAmB,EACnB,OAAe,EACf,KAAK,GAAG,GAAG,EACX,UAGI,EAAE;IAEN,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC;IAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,CAAC;IACvC,IAAI,KAAK,GAAkB,IAAI,CAAC;IAChC,IAAI,CAAC;QACH,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,WAAW,GAAiC,EAAE,CAAC;QACrD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAClF,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YACnC,WAAW,CAAC,IAAI,CAAC;gBACf,QAAQ;gBACR,IAAI,EAAE,KAAK,GAAG,CAAC;gBACf,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC;gBAC9B,OAAO;gBACP,SAAS,EAAE,eAAe;gBAC1B,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM;gBACpC,OAAO,EAAE,CAAC,WAAW,OAAO,EAAE,CAAC;gBAC/B,YAAY,EAAE,uBAAuB,CAAC,OAAO,EAAE,eAAe,CAAC;aAChE,CAAC,CAAC;QACL,CAAC;QAED,MAAM,iBAAiB,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,KAAK,iBAAiB,CAAC,CAAC;QAChG,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAE3B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM;YACR,CAAC;YACD,MAAM,IAAI,GAAG,0BAA0B,CAAC,KAAK,CAAC,YAAY,EAAE;gBAC1D,UAAU;gBACV,iBAAiB;gBACjB,eAAe;gBACf,kBAAkB;aACnB,CAAC,CAAC;YACH,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,OAAO,CAAC,IAAI,CAAC;gBACX,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,OAAO,EAAE,KAAK,CAAC,OAAO;aACvB,CAAC,CAAC;YACH,IAAI,KAAK,CAAC,YAAY,KAAK,iBAAiB,EAAE,CAAC;gBAC7C,eAAe,IAAI,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,kBAAkB,IAAI,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC;AAChC,CAAC","sourcesContent":["/**\n * Shared filesystem helpers for modular-agent search lanes.\n *\n * Why this file exists:\n * - lane helpers need one place for repo-safe path collection\n * - file and folder scans should stay out of route and retention policy\n * - bounded content-match extraction should stay separate from lane routing\n * - generic search-term cleanup should stay in one shared owner for all lanes\n */\nimport fs from \"fs\";\nimport path from \"path\";\nimport { isPathIgnoredByFolderGlobs } from \"../../fileRules/ignoredPaths.js\";\nimport { STOP_WORDS } from \"../../fileRules/stopWords.js\";\nimport type { AgentSearchMatch, AgentSearchMatchKind } from \"../types.js\";\nimport {\n  classifySnippetEvidence,\n  shouldKeepSnippetInMatches,\n  type AgentSnippetEvidenceKind,\n} from \"./snippetEvidence.js\";\n\ntype SearchablePathOptions = {\n  allowIgnoredPaths?: boolean;\n};\n\nexport function dedupeStrings(values: string[]): string[] {\n  const seen = new Set<string>();\n  const out: string[] = [];\n  for (const value of values) {\n    if (!value || seen.has(value)) continue;\n    seen.add(value);\n    out.push(value);\n  }\n  return out;\n}\n\nexport function collectSearchablePaths(rootDir: string, options: SearchablePathOptions = {}): string[] {\n  const files: string[] = [];\n  const directories = collectSearchableDirectories(rootDir, options);\n  const stack = [...directories];\n  while (stack.length > 0) {\n    const currentDir = stack.pop();\n    if (!currentDir) continue;\n    let entries: fs.Dirent[] = [];\n    try {\n      entries = fs.readdirSync(currentDir, { withFileTypes: true });\n    } catch {\n      continue;\n    }\n\n    for (const entry of entries) {\n      if (entry.name === \".git\" || entry.name === \"node_modules\") continue;\n      const fullPath = path.join(currentDir, entry.name);\n      const relativePath = path.relative(rootDir, fullPath).replace(/\\\\/g, \"/\");\n      if (entry.isDirectory()) {\n        continue;\n      }\n      if (!options.allowIgnoredPaths && isPathIgnoredByFolderGlobs(relativePath)) {\n        continue;\n      }\n      files.push(fullPath);\n    }\n  }\n  return files;\n}\n\nexport function collectSearchableDirectories(rootDir: string, options: SearchablePathOptions = {}): string[] {\n  const directories: string[] = [];\n  const stack = [rootDir];\n  while (stack.length > 0) {\n    const currentDir = stack.pop();\n    if (!currentDir) continue;\n    directories.push(currentDir);\n    let entries: fs.Dirent[] = [];\n    try {\n      entries = fs.readdirSync(currentDir, { withFileTypes: true });\n    } catch {\n      continue;\n    }\n\n    for (const entry of entries) {\n      if (entry.name === \".git\" || entry.name === \"node_modules\") continue;\n      const fullPath = path.join(currentDir, entry.name);\n      const relativePath = path.relative(rootDir, fullPath).replace(/\\\\/g, \"/\");\n      if (entry.isDirectory()) {\n        if (options.allowIgnoredPaths || !isPathIgnoredByFolderGlobs(relativePath)) {\n          stack.push(fullPath);\n        }\n        continue;\n      }\n    }\n  }\n  return directories;\n}\n\nexport function collectDirectDirectoryEntries(folderPath: string): Array<{ name: string; kind: \"file\" | \"folder\" }> {\n  try {\n    return fs.readdirSync(folderPath, { withFileTypes: true })\n      .filter((entry) => !entry.name.startsWith(\".\"))\n      .map((entry) => ({\n        name: entry.name,\n        kind: entry.isDirectory() ? \"folder\" as const : \"file\" as const,\n      }))\n      .sort((left, right) => left.name.localeCompare(right.name));\n  } catch {\n    return [];\n  }\n}\n\nfunction safeReadFile(filePath: string): string {\n  try {\n    return fs.readFileSync(filePath, \"utf8\");\n  } catch {\n    return \"\";\n  }\n}\n\nfunction clampSnippet(snippet: string): string {\n  return snippet.trim().slice(0, 220);\n}\n\ntype ClassifiedAgentSearchMatch = AgentSearchMatch & {\n  evidenceKind: AgentSnippetEvidenceKind;\n};\n\nfunction dedupeMatches(matches: AgentSearchMatch[]): AgentSearchMatch[] {\n  const seen = new Set<string>();\n  const out: AgentSearchMatch[] = [];\n  for (const match of matches) {\n    const key = [\n      match.filePath,\n      match.line ?? \"\",\n      match.column ?? \"\",\n      match.matchKind,\n      match.snippet,\n    ].join(\"|\");\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    out.push(match);\n  }\n  return out;\n}\n\nexport function tokenizeSearchTerms(query: string): string[] {\n  return dedupeStrings(\n    String(query ?? \"\")\n      .split(/[^A-Za-z0-9_./-]+/)\n      .map((part) => part.trim().toLowerCase())\n      .filter((part) => part.length >= 3)\n      .filter((part) => !STOP_WORDS.has(part))\n  ).slice(0, 8);\n}\n\nexport function collectFixedStringMatches(\n  filePaths: string[],\n  fragments: string[],\n  matchKind: Exclude<AgentSearchMatchKind, \"regex-content\" | \"path-match\">,\n  options: {\n    caseSensitive?: boolean;\n    maxPerFile?: number;\n    maxTotal?: number;\n  } = {}\n): AgentSearchMatch[] {\n  const maxPerFile = options.maxPerFile ?? 2;\n  const maxTotal = options.maxTotal ?? 8;\n  const needles = dedupeStrings(fragments.map((fragment) => String(fragment ?? \"\").trim()).filter(Boolean));\n  if (needles.length === 0) {\n    return [];\n  }\n\n  const matches: AgentSearchMatch[] = [];\n  for (const filePath of filePaths) {\n    const code = safeReadFile(filePath);\n    if (!code) {\n      continue;\n    }\n    const lines = code.split(/\\r?\\n/);\n    const fileMatches: ClassifiedAgentSearchMatch[] = [];\n    for (let index = 0; index < lines.length && matches.length < maxTotal; index += 1) {\n      const line = lines[index];\n      const haystack = options.caseSensitive ? line : line.toLowerCase();\n      for (const needle of needles) {\n        const normalizedNeedle = options.caseSensitive ? needle : needle.toLowerCase();\n        const column = haystack.indexOf(normalizedNeedle);\n        if (column < 0) {\n          continue;\n        }\n        const snippet = clampSnippet(line);\n        fileMatches.push({\n          filePath,\n          line: index + 1,\n          column: column + 1,\n          snippet,\n          matchKind,\n          score: normalizedNeedle.length,\n          reasons: [`term:${needle}`],\n          evidenceKind: classifySnippetEvidence(snippet, matchKind),\n        });\n        break;\n      }\n    }\n\n    const hasAnswerEvidence = fileMatches.some((match) => match.evidenceKind === \"answer-evidence\");\n    let keptAnswerCount = 0;\n    let keptReferenceCount = 0;\n\n    for (const match of fileMatches) {\n      if (matches.length >= maxTotal) {\n        break;\n      }\n      const keep = shouldKeepSnippetInMatches(match.evidenceKind, {\n        maxPerFile,\n        hasAnswerEvidence,\n        keptAnswerCount,\n        keptReferenceCount,\n      });\n      if (!keep) {\n        continue;\n      }\n      matches.push({\n        filePath: match.filePath,\n        line: match.line,\n        column: match.column,\n        snippet: match.snippet,\n        matchKind: match.matchKind,\n        score: match.score,\n        reasons: match.reasons,\n      });\n      if (match.evidenceKind === \"answer-evidence\") {\n        keptAnswerCount += 1;\n      } else {\n        keptReferenceCount += 1;\n      }\n    }\n  }\n\n  return dedupeMatches(matches);\n}\n\nexport function collectRegexMatches(\n  filePaths: string[],\n  pattern: string,\n  flags = \"i\",\n  options: {\n    maxPerFile?: number;\n    maxTotal?: number;\n  } = {}\n): AgentSearchMatch[] {\n  const maxPerFile = options.maxPerFile ?? 2;\n  const maxTotal = options.maxTotal ?? 8;\n  let regex: RegExp | null = null;\n  try {\n    regex = new RegExp(pattern, flags);\n  } catch {\n    return [];\n  }\n\n  const matches: AgentSearchMatch[] = [];\n  for (const filePath of filePaths) {\n    const code = safeReadFile(filePath);\n    if (!code) {\n      continue;\n    }\n    const lines = code.split(/\\r?\\n/);\n    const fileMatches: ClassifiedAgentSearchMatch[] = [];\n    for (let index = 0; index < lines.length && matches.length < maxTotal; index += 1) {\n      const line = lines[index];\n      regex.lastIndex = 0;\n      const match = regex.exec(line);\n      if (!match) {\n        continue;\n      }\n      const snippet = clampSnippet(line);\n      fileMatches.push({\n        filePath,\n        line: index + 1,\n        column: (match.index ?? 0) + 1,\n        snippet,\n        matchKind: \"regex-content\",\n        score: String(match[0] ?? \"\").length,\n        reasons: [`pattern:${pattern}`],\n        evidenceKind: classifySnippetEvidence(snippet, \"regex-content\"),\n      });\n    }\n\n    const hasAnswerEvidence = fileMatches.some((match) => match.evidenceKind === \"answer-evidence\");\n    let keptAnswerCount = 0;\n    let keptReferenceCount = 0;\n\n    for (const match of fileMatches) {\n      if (matches.length >= maxTotal) {\n        break;\n      }\n      const keep = shouldKeepSnippetInMatches(match.evidenceKind, {\n        maxPerFile,\n        hasAnswerEvidence,\n        keptAnswerCount,\n        keptReferenceCount,\n      });\n      if (!keep) {\n        continue;\n      }\n      matches.push({\n        filePath: match.filePath,\n        line: match.line,\n        column: match.column,\n        snippet: match.snippet,\n        matchKind: match.matchKind,\n        score: match.score,\n        reasons: match.reasons,\n      });\n      if (match.evidenceKind === \"answer-evidence\") {\n        keptAnswerCount += 1;\n      } else {\n        keptReferenceCount += 1;\n      }\n    }\n  }\n\n  return dedupeMatches(matches);\n}\n"]}