codebase-onboarder 0.6.0 → 0.7.0

package/server/apiSearch.js

@@ -16,238 +16,222 @@
 // palette uses) and enforces anything the person actually decided: filters,
 // phrases, regexes, the case toggle. A half-remembered name should still find
 // the file; `ext:js -vendor` should not be negotiated with.
-
 import { getSession } from './sessions.js';
 import { sendError, sendJSON } from './http.js';
-import {
-  isAdvanced, lineOfIndex, matchesPathFilters, parseQuery, queryIsEmpty,
-  scoreContent, scorePath, snippetAt,
-} from '../shared/search/query.js';
-
+import { isAdvanced, lineOfIndex, matchesPathFilters, parseQuery, queryIsEmpty, scoreContent, scorePath, snippetAt, } from '../shared/search/query.js';
 export function buildTfIdfIndex(documents) {
-  // documents: [{ path, content }]
-  const index = new Map();
-  const docCounts = new Map();
-  let totalDocs = 0;
-
-  for (const doc of documents) {
-    if (!doc.content || typeof doc.content !== 'string') continue;
-    const tokens = doc.content.toLowerCase().split(/\W+/).filter((t) => t.length > 1);
-    if (!tokens.length) continue;
-    totalDocs++;
-
-    const tf = new Map();
-    for (const t of tokens) {
-      tf.set(t, (tf.get(t) || 0) + 1);
-    }
-    for (const t of tf.keys()) {
-      docCounts.set(t, (docCounts.get(t) || 0) + 1);
+    // documents: [{ path, content }]
+    const index = new Map();
+    const docCounts = new Map();
+    let totalDocs = 0;
+    for (const doc of documents) {
+        if (!doc.content || typeof doc.content !== 'string')
+            continue;
+        const tokens = doc.content.toLowerCase().split(/\W+/).filter((t) => t.length > 1);
+        if (!tokens.length)
+            continue;
+        totalDocs++;
+        const tf = new Map();
+        for (const t of tokens) {
+            tf.set(t, (tf.get(t) || 0) + 1);
+        }
+        for (const t of tf.keys()) {
+            docCounts.set(t, (docCounts.get(t) || 0) + 1);
+        }
+        index.set(doc.path, { tf, content: doc.content, tokenCount: tokens.length });
     }
-    index.set(doc.path, { tf, content: doc.content, tokenCount: tokens.length });
-  }
-
-  return { index, docCounts, totalDocs };
+    return { index, docCounts, totalDocs };
 }
-
 export function searchIndex(indexData, queryString, limit = 10) {
-  if (!indexData || !queryString) return [];
-  const terms = queryString.toLowerCase().split(/\s+/).filter((t) => t.length > 0);
-  if (!terms.length) return [];
-
-  const { index, docCounts, totalDocs } = indexData;
-  if (!totalDocs) return [];
-
-  const idf = new Map();
-  for (const t of terms) {
-    const df = docCounts.get(t) || 0;
-    idf.set(t, df === 0 ? 0 : Math.log(1 + totalDocs / df));
-  }
-
-  const results = [];
-  for (const [docPath, data] of index.entries()) {
-    let score = 0;
-    let matchCount = 0;
+    if (!indexData || !queryString)
+        return [];
+    const terms = queryString.toLowerCase().split(/\s+/).filter((t) => t.length > 0);
+    if (!terms.length)
+        return [];
+    const { index, docCounts, totalDocs } = indexData;
+    if (!totalDocs)
+        return [];
+    const idf = new Map();
     for (const t of terms) {
-      const tf = data.tf.get(t) || 0;
-      if (tf > 0) {
-        matchCount++;
-        // Normalized TF * IDF
-        score += (tf / Math.sqrt(data.tokenCount)) * (idf.get(t) || 1);
-      }
+        const df = docCounts.get(t) || 0;
+        idf.set(t, df === 0 ? 0 : Math.log(1 + totalDocs / df));
     }
-
-    if (score > 0) {
-      // Find best snippet
-      const lowerContent = data.content.toLowerCase();
-      let bestIdx = -1;
-      for (const t of terms) {
-        const idx = lowerContent.indexOf(t);
-        if (idx !== -1 && (bestIdx === -1 || idx < bestIdx)) {
-          bestIdx = idx;
+    const results = [];
+    for (const [docPath, data] of index.entries()) {
+        let score = 0;
+        let matchCount = 0;
+        for (const t of terms) {
+            const tf = data.tf.get(t) || 0;
+            if (tf > 0) {
+                matchCount++;
+                // Normalized TF * IDF
+                score += (tf / Math.sqrt(data.tokenCount)) * (idf.get(t) || 1);
+            }
+        }
+        if (score > 0) {
+            // Find best snippet
+            const lowerContent = data.content.toLowerCase();
+            let bestIdx = -1;
+            for (const t of terms) {
+                const idx = lowerContent.indexOf(t);
+                if (idx !== -1 && (bestIdx === -1 || idx < bestIdx)) {
+                    bestIdx = idx;
+                }
+            }
+            let snippet = '';
+            let line = 1;
+            if (bestIdx !== -1) {
+                const linesBefore = data.content.slice(0, bestIdx).split('\n');
+                line = linesBefore.length;
+                const allLines = data.content.split('\n');
+                const targetLine = (allLines[line - 1] || '').trim();
+                snippet = targetLine.length > 120 ? targetLine.slice(0, 117) + '…' : targetLine;
+            }
+            results.push({
+                path: docPath,
+                score: score * (matchCount / terms.length), // Boost docs containing all terms
+                snippet,
+                line,
+            });
         }
-      }
-
-      let snippet = '';
-      let line = 1;
-      if (bestIdx !== -1) {
-        const linesBefore = data.content.slice(0, bestIdx).split('\n');
-        line = linesBefore.length;
-        const allLines = data.content.split('\n');
-        const targetLine = (allLines[line - 1] || '').trim();
-        snippet = targetLine.length > 120 ? targetLine.slice(0, 117) + '…' : targetLine;
-      }
-
-      results.push({
-        path: docPath,
-        score: score * (matchCount / terms.length), // Boost docs containing all terms
-        snippet,
-        line,
-      });
     }
-  }
-
-  results.sort((a, b) => b.score - a.score);
-  return results.slice(0, limit);
+    results.sort((a, b) => b.score - a.score);
+    return results.slice(0, limit);
 }
-
 // The strict pass: filters are gates, not hints, and every term has to land.
 // Ranking is positional — `scorePath` and `scoreContent` reward the file whose
 // name matches and the file where the word appears early — because a query with
 // a regex or a filter in it is a person who knows what they want, and does not
 // need the corpus statistics of `searchIndex` second-guessing them.
 function strictSearch(indexData, parsed) {
-  // `kind:` is a statement about symbols, and content cannot answer it. A query
-  // that is *only* a kind filter is answered by the palette's symbol pass and
-  // by nothing here, which is the honest result rather than "every file".
-  const kindOnly = parsed.kinds.length > 0
-    && !parsed.terms.length && !parsed.phrases.length && !parsed.regex;
-
-  const results = [];
-  for (const [docPath, doc] of indexData.index.entries()) {
-    if (kindOnly) break;
-    if (!matchesPathFilters(parsed, docPath)) continue;
-
-    const pathScore = scorePath(parsed, docPath);
-    const content = scoreContent(parsed, doc.content);
-    if (!pathScore && !content.score) continue;
-
-    const at = content.index;
-    results.push({
-      path: docPath,
-      score: pathScore + content.score,
-      line: at >= 0 ? lineOfIndex(doc.content, at) : 1,
-      snippet: snippetAt(doc.content, at >= 0 ? at : 0),
-    });
-  }
-
-  results.sort((a, b) => b.score - a.score || a.path.localeCompare(b.path));
-  return results;
+    // `kind:` is a statement about symbols, and content cannot answer it. A query
+    // that is *only* a kind filter is answered by the palette's symbol pass and
+    // by nothing here, which is the honest result rather than "every file".
+    const kindOnly = parsed.kinds.length > 0
+        && !parsed.terms.length && !parsed.phrases.length && !parsed.regex;
+    const results = [];
+    for (const [docPath, doc] of indexData.index.entries()) {
+        if (kindOnly)
+            break;
+        if (!matchesPathFilters(parsed, docPath))
+            continue;
+        const pathScore = scorePath(parsed, docPath);
+        const content = scoreContent(parsed, doc.content);
+        if (!pathScore && !content.score)
+            continue;
+        const at = content.index;
+        results.push({
+            path: docPath,
+            score: pathScore + content.score,
+            line: at >= 0 ? lineOfIndex(doc.content, at) : 1,
+            snippet: snippetAt(doc.content, at >= 0 ? at : 0),
+        });
+    }
+    results.sort((a, b) => b.score - a.score || a.path.localeCompare(b.path));
+    return results;
 }
-
 // What the index could not read, in the shape the palette can say out loud —
 // "searched 127 files, 3 skipped" beats a mystery file that never turns up.
 function indexStats(indexData) {
-  const skipped = indexData && indexData.skipped;
-  if (!skipped) return null;
-  return { bytes: indexData.totalBytes ?? 0, skipped: { ...skipped }, cap: indexData.cap ?? null };
+    const skipped = indexData && indexData.skipped;
+    if (!skipped)
+        return null;
+    return { bytes: indexData.totalBytes ?? 0, skipped: { ...skipped }, cap: indexData.cap ?? null };
 }
-
 // The serializable half of a parsed query. `parsed.regex` is a RegExp and would
 // go over the wire as `{}`, so the pattern travels as the text it was typed as.
 function querySummary(parsed) {
-  return {
-    terms: parsed.terms,
-    phrases: parsed.phrases,
-    negatives: parsed.negatives,
-    exts: parsed.exts,
-    paths: parsed.paths,
-    kinds: parsed.kinds,
-    isTest: parsed.isTest,
-    isSource: parsed.isSource,
-    regex: parsed.regexSource ? `/${parsed.regexSource}/${parsed.regexFlags}` : null,
-    caseSensitive: parsed.caseSensitive,
-    advanced: isAdvanced(parsed),
-  };
+    return {
+        terms: parsed.terms,
+        phrases: parsed.phrases,
+        negatives: parsed.negatives,
+        exts: parsed.exts,
+        paths: parsed.paths,
+        kinds: parsed.kinds,
+        isTest: parsed.isTest,
+        isSource: parsed.isSource,
+        regex: parsed.regexSource ? `/${parsed.regexSource}/${parsed.regexFlags}` : null,
+        caseSensitive: parsed.caseSensitive,
+        advanced: isAdvanced(parsed),
+    };
 }
-
 // The one entry point the route uses, kept separate from `searchIndex` so the
 // forgiving ranking that shipped first survives intact: a query of bare words
 // is still answered by that function, partial matches and all. Only a query the
 // person made decisions in — a filter, a phrase, a regex, the case toggle —
 // goes down the strict path, where those decisions are enforced.
 export function searchDocuments(indexData, rawQuery, options = {}) {
-  const limit = Number.isFinite(options.limit) ? Math.max(1, Math.floor(options.limit)) : 15;
-  const parsed = parseQuery(rawQuery, { caseSensitive: !!options.caseSensitive });
-  const advanced = isAdvanced(parsed);
-  const base = {
-    results: [],
-    total: 0,
-    indexed: indexData?.totalDocs ?? 0,
-    capped: false,
-    advanced,
-    query: querySummary(parsed),
-    error: parsed.error,
-    stats: indexStats(indexData),
-  };
-
-  if (!indexData || !indexData.totalDocs) return base;
-  if (queryIsEmpty(parsed)) return base;
-  // A pattern that would not compile is the whole answer. Reporting "no
-  // results" instead would send someone hunting for a file sitting right there.
-  if (parsed.error) return base;
-
-  if (!advanced) {
-    const ranked = searchIndex(indexData, parsed.terms.join(' '), limit);
-    return { ...base, results: ranked, total: ranked.length, capped: ranked.length >= limit };
-  }
-
-  const all = strictSearch(indexData, parsed);
-  return {
-    ...base,
-    results: all.slice(0, limit),
-    total: all.length,
-    capped: all.length > limit,
-  };
+    const limit = Number.isFinite(options.limit) ? Math.max(1, Math.floor(options.limit)) : 15;
+    const parsed = parseQuery(rawQuery, { caseSensitive: !!options.caseSensitive });
+    const advanced = isAdvanced(parsed);
+    const base = {
+        results: [],
+        total: 0,
+        indexed: indexData?.totalDocs ?? 0,
+        capped: false,
+        advanced,
+        query: querySummary(parsed),
+        error: parsed.error,
+        stats: indexStats(indexData),
+    };
+    if (!indexData || !indexData.totalDocs)
+        return base;
+    if (queryIsEmpty(parsed))
+        return base;
+    // A pattern that would not compile is the whole answer. Reporting "no
+    // results" instead would send someone hunting for a file sitting right there.
+    if (parsed.error)
+        return base;
+    if (!advanced) {
+        const ranked = searchIndex(indexData, parsed.terms.join(' '), limit);
+        return { ...base, results: ranked, total: ranked.length, capped: ranked.length >= limit };
+    }
+    const all = strictSearch(indexData, parsed);
+    return {
+        ...base,
+        results: all.slice(0, limit),
+        total: all.length,
+        capped: all.length > limit,
+    };
 }
-
 export async function handleSearch(res, body) {
-  const { scanId, query, limit = 15, caseSensitive = false } = body || {};
-  if (!scanId) return sendError(res, 400, 'Missing scanId.');
-  const session = getSession(scanId);
-  if (!session) return sendError(res, 404, 'Scan not found.');
-
-  const q = (query || '').trim();
-  if (!q) {
-    return sendJSON(res, 200, { results: [], total: 0, indexed: session.searchIndex?.totalDocs ?? 0 });
-  }
-
-  // No index means the scan was opened before this change shipped, or the
-  // caller is using a session that was never given a scan-time index. The
-  // honest answer is "no results" rather than rebuilding the whole thing on
-  // the request thread.
-  if (!session.searchIndex || session.searchIndex.totalDocs === 0) {
-    return sendJSON(res, 200, {
-      results: [],
-      total: 0,
-      indexed: 0,
-      note: 'Nothing was indexed for this scan.',
-    });
-  }
-
-  try {
-    const out = searchDocuments(session.searchIndex, q, { limit, caseSensitive });
-    return sendJSON(res, 200, {
-      results: out.results,
-      total: out.total,
-      indexed: out.indexed,
-      capped: out.capped,
-      advanced: out.advanced,
-      query: out.query,
-      error: out.error || null,
-      stats: out.stats || null,
-    });
-  } catch (err) {
-    return sendError(res, 500, 'Search failed: ' + err.message);
-  }
+    const { scanId, query, limit = 15, caseSensitive = false } = body || {};
+    if (!scanId)
+        return sendError(res, 400, 'Missing scanId.');
+    const session = getSession(scanId);
+    if (!session)
+        return sendError(res, 404, 'Scan not found.');
+    const q = (query || '').trim();
+    if (!q) {
+        return sendJSON(res, 200, { results: [], total: 0, indexed: session.searchIndex?.totalDocs ?? 0 });
+    }
+    // No index means the scan was opened before this change shipped, or the
+    // caller is using a session that was never given a scan-time index. The
+    // honest answer is "no results" rather than rebuilding the whole thing on
+    // the request thread.
+    if (!session.searchIndex || session.searchIndex.totalDocs === 0) {
+        return sendJSON(res, 200, {
+            results: [],
+            total: 0,
+            indexed: 0,
+            note: 'Nothing was indexed for this scan.',
+        });
+    }
+    try {
+        const out = searchDocuments(session.searchIndex, q, { limit, caseSensitive });
+        return sendJSON(res, 200, {
+            results: out.results,
+            total: out.total,
+            indexed: out.indexed,
+            capped: out.capped,
+            advanced: out.advanced,
+            query: out.query,
+            error: out.error || null,
+            stats: out.stats || null,
+        });
+    }
+    catch (err) {
+        return sendError(res, 500, 'Search failed: ' + err.message);
+    }
 }
-
+//# sourceMappingURL=apiSearch.js.map

package/server/apiSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apiSearch.js","sourceRoot":"","sources":["../src/server/apiSearch.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,yEAAyE;AACzE,uEAAuE;AACvE,yEAAyE;AACzE,2EAA2E;AAC3E,EAAE;AACF,sEAAsE;AACtE,2EAA2E;AAC3E,sEAAsE;AACtE,8BAA8B;AAC9B,EAAE;AACF,wEAAwE;AACxE,0EAA0E;AAC1E,2EAA2E;AAC3E,2EAA2E;AAC3E,4EAA4E;AAC5E,8EAA8E;AAC9E,4DAA4D;AAE5D,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAChD,OAAO,EACL,UAAU,EAAE,WAAW,EAAE,kBAAkB,EAAE,UAAU,EAAE,YAAY,EACrE,YAAY,EAAE,SAAS,EAAE,SAAS,GACnC,MAAM,2BAA2B,CAAC;AAEnC,MAAM,UAAU,eAAe,CAAC,SAAS;IACvC,iCAAiC;IACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;IACxB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;IAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ;YAAE,SAAS;QAC9D,MAAM,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,SAAS;QAC7B,SAAS,EAAE,CAAC;QAEZ,MAAM,EAAE,GAAG,IAAI,GAAG,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1B,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;AACzC,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,GAAG,EAAE;IAC5D,IAAI,CAAC,SAAS,IAAI,CAAC,WAAW;QAAE,OAAO,EAAE,CAAC;IAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjF,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAE7B,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,SAAS,CAAC;IAClD,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,CAAC;IAE1B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IACtB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACjC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,EAAE,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;gBACX,UAAU,EAAE,CAAC;gBACb,sBAAsB;gBACtB,KAAK,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QAED,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,oBAAoB;YACpB,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YAChD,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpC,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC;oBACpD,OAAO,GAAG,GAAG,CAAC;gBAChB,CAAC;YACH,CAAC;YAED,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/D,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC;gBAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC1C,MAAM,UAAU,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;gBACrD,OAAO,GAAG,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;YAClF,CAAC;YAED,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,KAAK,GAAG,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,kCAAkC;gBAC9E,OAAO;gBACP,IAAI;aACL,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,6EAA6E;AAC7E,+EAA+E;AAC/E,gFAAgF;AAChF,+EAA+E;AAC/E,oEAAoE;AACpE,SAAS,YAAY,CAAC,SAAS,EAAE,MAAM;IACrC,8EAA8E;IAC9E,4EAA4E;IAC5E,wEAAwE;IACxE,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC;WACnC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;IAErE,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACvD,IAAI,QAAQ;YAAE,MAAM;QACpB,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC;YAAE,SAAS;QAEnD,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,IAAI,CAAC,OAAO,CAAC,KAAK;YAAE,SAAS;QAE3C,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,KAAK;YAChC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SAClD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1E,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,6EAA6E;AAC7E,4EAA4E;AAC5E,SAAS,UAAU,CAAC,SAAS;IAC3B,MAAM,OAAO,GAAG,SAAS,IAAI,SAAS,CAAC,OAAO,CAAC;IAC/C,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAC1B,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,UAAU,IAAI,CAAC,EAAE,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,GAAG,EAAE,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,CAAC;AACnG,CAAC;AAED,gFAAgF;AAChF,gFAAgF;AAChF,SAAS,YAAY,CAAC,MAAM;IAC1B,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,WAAW,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI;QAChF,aAAa,EAAE,MAAM,CAAC,aAAa;QACnC,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC;KAC7B,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,8EAA8E;AAC9E,gFAAgF;AAChF,4EAA4E;AAC5E,iEAAiE;AACjE,MAAM,UAAU,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,GAAwB,EAAE;IACpF,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3F,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,EAAE,EAAE,aAAa,EAAE,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;IAChF,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG;QACX,OAAO,EAAE,EAAE;QACX,KAAK,EAAE,CAAC;QACR,OAAO,EAAE,SAAS,EAAE,SAAS,IAAI,CAAC;QAClC,MAAM,EAAE,KAAK;QACb,QAAQ;QACR,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC;QAC3B,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,UAAU,CAAC,SAAS,CAAC;KAC7B,CAAC;IAEF,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IACpD,IAAI,YAAY,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,sEAAsE;IACtE,8EAA8E;IAC9E,IAAI,MAAM,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAE9B,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,MAAM,GAAG,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QACrE,OAAO,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;IAC5F,CAAC;IAED,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC5C,OAAO;QACL,GAAG,IAAI;QACP,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;QAC5B,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,KAAK;KAC3B,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,GAAG,EAAE,IAAI;IAC1C,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,EAAE,EAAE,aAAa,GAAG,KAAK,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC;IACxE,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,iBAAiB,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,iBAAiB,CAAC,CAAC;IAE5D,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/B,IAAI,CAAC,CAAC,EAAE,CAAC;QACP,OAAO,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,CAAC,EAAE,CAAC,CAAC;IACrG,CAAC;IAED,wEAAwE;IACxE,wEAAwE;IACxE,0EAA0E;IAC1E,sBAAsB;IACtB,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;QAChE,OAAO,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE;YACxB,OAAO,EAAE,EAAE;YACX,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,oCAAoC;SAC3C,CAAC,CAAC;IACL,CAAC;IAED,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,eAAe,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;QAC9E,OAAO,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE;YACxB,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI;YACxB,KAAK,EAAE,GAAG,CAAC,KAAK,IAAI,IAAI;SACzB,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,iBAAiB,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;IAC9D,CAAC;AACH,CAAC","sourcesContent":["// POST /api/search — runs a TF-IDF query against the index built at scan\n// time. The work that used to live here (re-listing the tree, re-reading\n// every file, parsing its tokens) now lives in `searchIndex.js`, which\n// `apiScan.js` invokes once when the scan finishes. What is left in this\n// module is the request shape: validate, look up the session, score, send.\n//\n// The pure scoring functions (`buildTfIdfIndex` for one-off in-memory\n// indexes used by tests, and `searchIndex` for the score-and-snippet pass)\n// are still exported so the front end and tests can construct indexes\n// directly when they need to.\n//\n// There are two ways through, and which one a query takes is the point:\n// `searchIndex` answers a query of bare words the forgiving way it always\n// did — partial matches, ranked by TF-IDF — while `searchDocuments` parses\n// the shared query language (`shared/search/query.js`, the same module the\n// palette uses) and enforces anything the person actually decided: filters,\n// phrases, regexes, the case toggle. A half-remembered name should still find\n// the file; `ext:js -vendor` should not be negotiated with.\n\nimport { getSession } from './sessions.js';\nimport { sendError, sendJSON } from './http.js';\nimport {\n  isAdvanced, lineOfIndex, matchesPathFilters, parseQuery, queryIsEmpty,\n  scoreContent, scorePath, snippetAt,\n} from '../shared/search/query.js';\n\nexport function buildTfIdfIndex(documents) {\n  // documents: [{ path, content }]\n  const index = new Map();\n  const docCounts = new Map();\n  let totalDocs = 0;\n\n  for (const doc of documents) {\n    if (!doc.content || typeof doc.content !== 'string') continue;\n    const tokens = doc.content.toLowerCase().split(/\\W+/).filter((t) => t.length > 1);\n    if (!tokens.length) continue;\n    totalDocs++;\n\n    const tf = new Map();\n    for (const t of tokens) {\n      tf.set(t, (tf.get(t) || 0) + 1);\n    }\n    for (const t of tf.keys()) {\n      docCounts.set(t, (docCounts.get(t) || 0) + 1);\n    }\n    index.set(doc.path, { tf, content: doc.content, tokenCount: tokens.length });\n  }\n\n  return { index, docCounts, totalDocs };\n}\n\nexport function searchIndex(indexData, queryString, limit = 10) {\n  if (!indexData || !queryString) return [];\n  const terms = queryString.toLowerCase().split(/\\s+/).filter((t) => t.length > 0);\n  if (!terms.length) return [];\n\n  const { index, docCounts, totalDocs } = indexData;\n  if (!totalDocs) return [];\n\n  const idf = new Map();\n  for (const t of terms) {\n    const df = docCounts.get(t) || 0;\n    idf.set(t, df === 0 ? 0 : Math.log(1 + totalDocs / df));\n  }\n\n  const results = [];\n  for (const [docPath, data] of index.entries()) {\n    let score = 0;\n    let matchCount = 0;\n    for (const t of terms) {\n      const tf = data.tf.get(t) || 0;\n      if (tf > 0) {\n        matchCount++;\n        // Normalized TF * IDF\n        score += (tf / Math.sqrt(data.tokenCount)) * (idf.get(t) || 1);\n      }\n    }\n\n    if (score > 0) {\n      // Find best snippet\n      const lowerContent = data.content.toLowerCase();\n      let bestIdx = -1;\n      for (const t of terms) {\n        const idx = lowerContent.indexOf(t);\n        if (idx !== -1 && (bestIdx === -1 || idx < bestIdx)) {\n          bestIdx = idx;\n        }\n      }\n\n      let snippet = '';\n      let line = 1;\n      if (bestIdx !== -1) {\n        const linesBefore = data.content.slice(0, bestIdx).split('\\n');\n        line = linesBefore.length;\n        const allLines = data.content.split('\\n');\n        const targetLine = (allLines[line - 1] || '').trim();\n        snippet = targetLine.length > 120 ? targetLine.slice(0, 117) + '…' : targetLine;\n      }\n\n      results.push({\n        path: docPath,\n        score: score * (matchCount / terms.length), // Boost docs containing all terms\n        snippet,\n        line,\n      });\n    }\n  }\n\n  results.sort((a, b) => b.score - a.score);\n  return results.slice(0, limit);\n}\n\n// The strict pass: filters are gates, not hints, and every term has to land.\n// Ranking is positional — `scorePath` and `scoreContent` reward the file whose\n// name matches and the file where the word appears early — because a query with\n// a regex or a filter in it is a person who knows what they want, and does not\n// need the corpus statistics of `searchIndex` second-guessing them.\nfunction strictSearch(indexData, parsed) {\n  // `kind:` is a statement about symbols, and content cannot answer it. A query\n  // that is *only* a kind filter is answered by the palette's symbol pass and\n  // by nothing here, which is the honest result rather than \"every file\".\n  const kindOnly = parsed.kinds.length > 0\n    && !parsed.terms.length && !parsed.phrases.length && !parsed.regex;\n\n  const results = [];\n  for (const [docPath, doc] of indexData.index.entries()) {\n    if (kindOnly) break;\n    if (!matchesPathFilters(parsed, docPath)) continue;\n\n    const pathScore = scorePath(parsed, docPath);\n    const content = scoreContent(parsed, doc.content);\n    if (!pathScore && !content.score) continue;\n\n    const at = content.index;\n    results.push({\n      path: docPath,\n      score: pathScore + content.score,\n      line: at >= 0 ? lineOfIndex(doc.content, at) : 1,\n      snippet: snippetAt(doc.content, at >= 0 ? at : 0),\n    });\n  }\n\n  results.sort((a, b) => b.score - a.score || a.path.localeCompare(b.path));\n  return results;\n}\n\n// What the index could not read, in the shape the palette can say out loud —\n// \"searched 127 files, 3 skipped\" beats a mystery file that never turns up.\nfunction indexStats(indexData) {\n  const skipped = indexData && indexData.skipped;\n  if (!skipped) return null;\n  return { bytes: indexData.totalBytes ?? 0, skipped: { ...skipped }, cap: indexData.cap ?? null };\n}\n\n// The serializable half of a parsed query. `parsed.regex` is a RegExp and would\n// go over the wire as `{}`, so the pattern travels as the text it was typed as.\nfunction querySummary(parsed) {\n  return {\n    terms: parsed.terms,\n    phrases: parsed.phrases,\n    negatives: parsed.negatives,\n    exts: parsed.exts,\n    paths: parsed.paths,\n    kinds: parsed.kinds,\n    isTest: parsed.isTest,\n    isSource: parsed.isSource,\n    regex: parsed.regexSource ? `/${parsed.regexSource}/${parsed.regexFlags}` : null,\n    caseSensitive: parsed.caseSensitive,\n    advanced: isAdvanced(parsed),\n  };\n}\n\n// The one entry point the route uses, kept separate from `searchIndex` so the\n// forgiving ranking that shipped first survives intact: a query of bare words\n// is still answered by that function, partial matches and all. Only a query the\n// person made decisions in — a filter, a phrase, a regex, the case toggle —\n// goes down the strict path, where those decisions are enforced.\nexport function searchDocuments(indexData, rawQuery, options: Record<string, any> = {}) {\n  const limit = Number.isFinite(options.limit) ? Math.max(1, Math.floor(options.limit)) : 15;\n  const parsed = parseQuery(rawQuery, { caseSensitive: !!options.caseSensitive });\n  const advanced = isAdvanced(parsed);\n  const base = {\n    results: [],\n    total: 0,\n    indexed: indexData?.totalDocs ?? 0,\n    capped: false,\n    advanced,\n    query: querySummary(parsed),\n    error: parsed.error,\n    stats: indexStats(indexData),\n  };\n\n  if (!indexData || !indexData.totalDocs) return base;\n  if (queryIsEmpty(parsed)) return base;\n  // A pattern that would not compile is the whole answer. Reporting \"no\n  // results\" instead would send someone hunting for a file sitting right there.\n  if (parsed.error) return base;\n\n  if (!advanced) {\n    const ranked = searchIndex(indexData, parsed.terms.join(' '), limit);\n    return { ...base, results: ranked, total: ranked.length, capped: ranked.length >= limit };\n  }\n\n  const all = strictSearch(indexData, parsed);\n  return {\n    ...base,\n    results: all.slice(0, limit),\n    total: all.length,\n    capped: all.length > limit,\n  };\n}\n\nexport async function handleSearch(res, body) {\n  const { scanId, query, limit = 15, caseSensitive = false } = body || {};\n  if (!scanId) return sendError(res, 400, 'Missing scanId.');\n  const session = getSession(scanId);\n  if (!session) return sendError(res, 404, 'Scan not found.');\n\n  const q = (query || '').trim();\n  if (!q) {\n    return sendJSON(res, 200, { results: [], total: 0, indexed: session.searchIndex?.totalDocs ?? 0 });\n  }\n\n  // No index means the scan was opened before this change shipped, or the\n  // caller is using a session that was never given a scan-time index. The\n  // honest answer is \"no results\" rather than rebuilding the whole thing on\n  // the request thread.\n  if (!session.searchIndex || session.searchIndex.totalDocs === 0) {\n    return sendJSON(res, 200, {\n      results: [],\n      total: 0,\n      indexed: 0,\n      note: 'Nothing was indexed for this scan.',\n    });\n  }\n\n  try {\n    const out = searchDocuments(session.searchIndex, q, { limit, caseSensitive });\n    return sendJSON(res, 200, {\n      results: out.results,\n      total: out.total,\n      indexed: out.indexed,\n      capped: out.capped,\n      advanced: out.advanced,\n      query: out.query,\n      error: out.error || null,\n      stats: out.stats || null,\n    });\n  } catch (err) {\n    return sendError(res, 500, 'Search failed: ' + err.message);\n  }\n}\n\n"]}

package/server/apiSettings.d.ts

@@ -0,0 +1,4 @@
+export declare function handleGetSettings(req: any, res: any, config: any): Promise<void>;
+export declare function handleUpdateSettings(res: any, body: any, config: any): Promise<void>;
+export declare function handleRotateAccessKey(req: any, res: any, config: any): Promise<void>;
+export declare function validatePatch(patch: any): import("../shared/contracts.js").Settings;