scai 0.1.178 → 1.0.1

package/dist/agents/fileCheckStep.js

@@ -1,9 +1,22 @@
-// File: src/modules/preFileSearchCheckStep.ts
+/**
+ * Seeds and refines focus files before deeper verification work begins.
+ *
+ * Why this file exists:
+ * - verify-heavy queries still need one narrow focus pass before semantic work
+ * - compatibility fields like `candidateFiles` still exist, but they must stay canonical
+ * - unresolved raw query strings should stay in search/routing facts, not come back as fake file paths here
+ */
+import fs from "fs";
 import { generate } from "../lib/generate.js";
 import { logInputOutput } from "../utils/promptLogHelper.js";
 import { cleanupModule } from "../pipeline/modules/cleanupModule.js";
 import path from "path";
 import { isPathIgnoredByFolderGlobs } from "../fileRules/ignoredPaths.js";
+import { getVerifyFocusFilePreference, isVerifyFocusQueryText, } from "../utils/verifyFocusPreference.js";
+import { getContextExecutionPath } from "../utils/repoIdentity.js";
+const METHOD_SELECTION_QUERY_TERMS = ["method", "function", "decides", "controls", "sets", "chooses"];
+const DECISION_INTENT_TERMS = ["budget", "limit", "threshold", "policy", "decision", "control", "wave"];
+const BROAD_WORKFLOW_TERMS = ["validate", "analysis", "change", "plan", "planning", "workflow"];
 export async function fileCheckStep(context) {
     var _a;
     context.analysis ?? (context.analysis = {});
@@ -12,6 +25,7 @@ export async function fileCheckStep(context) {
     const planSuggestion = context.analysis.planSuggestion?.text ?? "";
     // Step 1: gather known files from initContext only
     const knownFiles = new Set((context.initContext?.relatedFiles ?? []).filter(filePath => !isPathIgnoredByFolderGlobs(filePath)));
+    supplementKnownFilesForVerifyFocus(context, knownFiles);
     // Step 2: extract file names from normalizedQuery or planSuggestion
     const extractedFiles = extractFilesFromAnalysis(context.analysis);
     // Step 3: populate focus with safe defaults
@@ -23,10 +37,6 @@ export async function fileCheckStep(context) {
         if (matchedPath) {
             selectedFiles.push(matchedPath);
         }
-        else {
-            // Store unresolved reference as candidate
-            candidateFiles.push(file);
-        }
     }
     const mergedSelected = Array.from(new Set([
         ...(context.analysis.focus.selectedFiles ?? []),
@@ -64,6 +74,9 @@ export async function fileCheckStep(context) {
         };
         return acc;
     }, {});
+    promoteStrongVerifyFocusMatches(context, knownFiles, evidenceByFile);
+    applyDeterministicVerifyWaveTraceSelection(context, knownFiles);
+    const deterministicVerifyBudget = applyDeterministicVerifyBudgetSelection(context, knownFiles, evidenceByFile);
     // ----------------- Prompt -----------------
     const prompt = `
 You are an AI meta-agent assisting with context verification.
@@ -110,6 +123,20 @@ Task:
         const ai = await generate({
             query: context.initContext?.userQuery ?? '',
             content: prompt
+        }, {
+            caller: "fileCheckStep",
+            inputContext: {
+                userQuery: context.initContext?.userQuery ?? '',
+                intent,
+                planSuggestion,
+                knownFiles: [...knownFiles],
+                evidenceByFile,
+                deterministicVerifyBudget: {
+                    winners: [...deterministicVerifyBudget.winners],
+                    mergeThreshold: deterministicVerifyBudget.mergeThreshold,
+                    scores: Object.fromEntries(deterministicVerifyBudget.scores),
+                },
+            },
         });
         let cleaned;
         try {
@@ -139,20 +166,34 @@ Task:
             const existing = new Set(context.analysis.focus.selectedFiles);
             const safeSelected = parsed.selectedFiles
                 .filter((f) => typeof f === "string" && knownFiles.has(f) && !isPathIgnoredByFolderGlobs(f));
+            const gatedSelected = deterministicVerifyBudget.winners.size > 0
+                ? safeSelected.filter((filePath) => {
+                    if (deterministicVerifyBudget.winners.has(filePath))
+                        return true;
+                    const score = deterministicVerifyBudget.scores.get(filePath);
+                    return typeof score === "number" && score >= deterministicVerifyBudget.mergeThreshold;
+                })
+                : safeSelected;
             context.analysis.focus.selectedFiles = [
                 ...context.analysis.focus.selectedFiles,
-                ...safeSelected.filter((f) => !existing.has(f))
+                ...gatedSelected.filter((f) => !existing.has(f))
             ];
+            if (deterministicVerifyBudget.winners.size > 0) {
+                const selectedSet = new Set(context.analysis.focus.selectedFiles);
+                const candidateSet = new Set(context.analysis.focus.candidateFiles ?? []);
+                for (const filePath of safeSelected) {
+                    if (selectedSet.has(filePath) || candidateSet.has(filePath))
+                        continue;
+                    context.analysis.focus.candidateFiles.push(filePath);
+                    candidateSet.add(filePath);
+                }
+            }
         }
         if (Array.isArray(parsed.candidateFiles)) {
             const existing = new Set(context.analysis.focus.candidateFiles);
             const safeCandidates = parsed.candidateFiles
                 .filter((f) => typeof f === "string")
-                .filter((f) => {
-                if (knownFiles.has(f))
-                    return !isPathIgnoredByFolderGlobs(f);
-                return /^[\w\-./]+\.(js|ts|jsx|tsx|py|java|go|rs|cpp|c|cs|md)$/i.test(f);
-            });
+                .filter((f) => knownFiles.has(f) && !isPathIgnoredByFolderGlobs(f));
             context.analysis.focus.candidateFiles = [
                 ...context.analysis.focus.candidateFiles,
                 ...safeCandidates.filter((f) => !existing.has(f))
@@ -169,7 +210,15 @@ Task:
                 ...parsed.understanding,
             };
         }
-        logInputOutput("preFileSearchCheckStep", "output", parsed);
+        logInputOutput("preFileSearchCheckStep", "output", {
+            callId: ai.trace?.callId,
+            rawModelOutput: parsed,
+            effectiveFocus: {
+                selectedFiles: context.analysis.focus.selectedFiles,
+                candidateFiles: context.analysis.focus.candidateFiles,
+                rationale: context.analysis.focus.rationale,
+            },
+        });
     }
     catch (err) {
         console.warn("[preFileSearchCheckStep] AI pre-check failed, using defaults", err);
@@ -185,3 +234,323 @@ Task:
         return matches ? Array.from(new Set(matches.map(m => m.trim()))) : [];
     }
 }
+/**
+ * Promotes high-signal verify files before the model post-check runs.
+ * Example: verify-focus queries should lift `mainAgentVerify.ts` and
+ * `fileCheckStep.ts` above `README.md` and `structuralPreloadStep.ts`.
+ */
+function promoteStrongVerifyFocusMatches(context, knownFiles, evidenceByFile) {
+    const query = context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? "";
+    const scored = Array.from(knownFiles)
+        .map(filePath => {
+        const evidence = evidenceByFile[filePath];
+        const evidenceText = (evidence?.evidence ?? [])
+            .map(item => `${item.claim} ${item.excerpt ?? ""}`)
+            .join(" ");
+        const verifyFocus = getVerifyFocusFilePreference({
+            query,
+            filePath,
+            evidenceText,
+        });
+        let score = evidence?.fileConfidence ?? 0;
+        if (verifyFocus.applies) {
+            score += verifyFocus.score;
+        }
+        return { filePath, score };
+    })
+        .filter(entry => entry.score >= 0.75)
+        .sort((a, b) => b.score - a.score);
+    if (scored.length === 0)
+        return;
+    const analysis = context.analysis ?? (context.analysis = {});
+    analysis.focus ?? (analysis.focus = { selectedFiles: [], candidateFiles: [], rationale: "" });
+    const focus = analysis.focus;
+    focus.selectedFiles ?? (focus.selectedFiles = []);
+    focus.candidateFiles ?? (focus.candidateFiles = []);
+    const existingSelected = new Set(focus.selectedFiles);
+    const existingCandidate = new Set(focus.candidateFiles);
+    for (const entry of scored.slice(0, 3)) {
+        if (!existingSelected.has(entry.filePath)) {
+            focus.selectedFiles.push(entry.filePath);
+            existingSelected.add(entry.filePath);
+        }
+    }
+    for (const entry of scored.slice(3, 6)) {
+        if (!existingSelected.has(entry.filePath) && !existingCandidate.has(entry.filePath)) {
+            focus.candidateFiles.push(entry.filePath);
+            existingCandidate.add(entry.filePath);
+        }
+    }
+}
+/**
+ * Adds a few strong verify implementation files when bootstrap search only seeded broad docs.
+ * Example: a verify-wave trace can start with `README.md`, but still needs
+ * `mainAgentVerify.ts` and `fileCheckStep.ts` in play before the model post-check.
+ */
+function supplementKnownFilesForVerifyFocus(context, knownFiles) {
+    const query = context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? "";
+    if (!isVerifyFocusQueryText(query)) {
+        return;
+    }
+    const repoRoot = getContextExecutionPath(context);
+    if (!repoRoot || !fs.existsSync(repoRoot)) {
+        return;
+    }
+    const ranked = collectVerifyFocusRepoCandidates(repoRoot, query)
+        .filter(entry => !knownFiles.has(entry.filePath))
+        .slice(0, 4);
+    for (const entry of ranked) {
+        knownFiles.add(entry.filePath);
+    }
+}
+function collectVerifyFocusRepoCandidates(repoRoot, query) {
+    return collectVerifyFocusSearchablePaths(repoRoot)
+        .map(filePath => ({
+        filePath,
+        score: getVerifyFocusFilePreference({
+            query,
+            filePath,
+        }).score,
+    }))
+        .filter(entry => entry.score >= 0.9)
+        .sort((left, right) => right.score - left.score);
+}
+function collectVerifyFocusSearchablePaths(rootDir) {
+    const files = [];
+    const stack = [rootDir];
+    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 (shouldSkipVerifyFocusPath(entry.name))
+                continue;
+            const fullPath = path.join(currentDir, entry.name);
+            if (isPathIgnoredByFolderGlobs(fullPath))
+                continue;
+            if (entry.isDirectory()) {
+                stack.push(fullPath);
+                continue;
+            }
+            if (!/\.(ts|tsx|js|jsx|mjs|cjs)$/.test(entry.name))
+                continue;
+            files.push(fullPath);
+        }
+    }
+    return files;
+}
+function shouldSkipVerifyFocusPath(name) {
+    return [".git", "node_modules", "dist", "artifacts", ".scai-worktrees"].includes(name);
+}
+/**
+ * Locks trace-style verify-wave questions onto the two core focus-transition files.
+ * Example: a query about `selectedFiles` and `candidateFiles` across verify waves
+ * should keep `mainAgentVerify.ts` and `fileCheckStep.ts` selected even if the
+ * model drifts toward adjacent helper files.
+ */
+function applyDeterministicVerifyWaveTraceSelection(context, knownFiles) {
+    const query = (context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? "").toLowerCase();
+    if (!query.includes("selectedfiles") || !query.includes("candidatefiles") || !query.includes("verify")) {
+        return;
+    }
+    const ranked = Array.from(knownFiles)
+        .map(filePath => ({
+        filePath,
+        score: getVerifyFocusFilePreference({
+            query,
+            filePath,
+        }).score,
+    }))
+        .filter(entry => entry.score >= 1.1)
+        .sort((left, right) => right.score - left.score);
+    if (ranked.length === 0) {
+        return;
+    }
+    const preferredBasenames = ["mainagentverify.ts", "filecheckstep.ts"];
+    const lockedWinners = preferredBasenames
+        .map(name => ranked.find(entry => path.basename(entry.filePath).toLowerCase() === name))
+        .filter((entry) => Boolean(entry));
+    const analysis = context.analysis ?? (context.analysis = {});
+    analysis.focus ?? (analysis.focus = { selectedFiles: [], candidateFiles: [], rationale: "" });
+    const focus = analysis.focus;
+    focus.selectedFiles ?? (focus.selectedFiles = []);
+    focus.candidateFiles ?? (focus.candidateFiles = []);
+    const selectedSet = new Set(focus.selectedFiles);
+    const candidateSet = new Set(focus.candidateFiles);
+    const winners = (lockedWinners.length > 0 ? lockedWinners : ranked.slice(0, 2)).map(entry => entry.filePath);
+    for (const filePath of winners) {
+        if (!selectedSet.has(filePath)) {
+            focus.selectedFiles.push(filePath);
+            selectedSet.add(filePath);
+        }
+    }
+    for (const entry of ranked.filter(entry => !winners.includes(entry.filePath)).slice(0, 2)) {
+        if (!selectedSet.has(entry.filePath) && !candidateSet.has(entry.filePath)) {
+            focus.candidateFiles.push(entry.filePath);
+            candidateSet.add(entry.filePath);
+        }
+    }
+    const docLikeSelected = focus.selectedFiles.filter(filePath => !winners.includes(filePath) && isBroadVerifyDocFile(filePath));
+    focus.selectedFiles = [
+        ...winners,
+        ...focus.selectedFiles.filter(filePath => !winners.includes(filePath) && !docLikeSelected.includes(filePath)),
+    ];
+    for (const filePath of docLikeSelected) {
+        if (!candidateSet.has(filePath)) {
+            focus.candidateFiles.push(filePath);
+            candidateSet.add(filePath);
+        }
+    }
+}
+function isBroadVerifyDocFile(filePath) {
+    const basename = path.basename(filePath).toLowerCase();
+    return basename === "readme.md" || basename === "agents.md" || basename === "changelog.md";
+}
+/**
+ * Locks method-selection queries onto files with strong structural evidence.
+ * Example: a query asking which method controls a wave budget should favor a
+ * file whose symbol evidence overlaps on informative identifier parts.
+ */
+function applyDeterministicVerifyBudgetSelection(context, knownFiles, evidenceByFile) {
+    const query = context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? "";
+    if (!isMethodSelectionQuery(query)) {
+        return { winners: new Set(), scores: new Map(), mergeThreshold: Number.POSITIVE_INFINITY };
+    }
+    const querySignals = extractMethodSelectionSignals(query);
+    const ranked = Array.from(knownFiles)
+        .map(filePath => {
+        const evidence = evidenceByFile[filePath];
+        const evidenceItems = evidence?.evidence ?? [];
+        const evidenceText = evidenceItems
+            .map(item => `${item.claim} ${item.excerpt ?? ""}`)
+            .join(" ")
+            .toLowerCase();
+        const verifyFocus = getVerifyFocusFilePreference({
+            query,
+            filePath,
+            evidenceText,
+        });
+        const structuralSymbols = evidenceItems
+            .filter(item => item.type === "structural" || item.type === "symbol")
+            .flatMap(item => collectIdentifierCandidates(`${item.claim} ${item.excerpt ?? ""}`));
+        const symbolOverlap = computeIdentifierOverlap(structuralSymbols, querySignals.informativeTokens);
+        const textOverlap = computeIdentifierOverlap(collectIdentifierCandidates(evidenceText), querySignals.informativeTokens);
+        const workflowOverlap = countTermOverlap(evidenceText, BROAD_WORKFLOW_TERMS);
+        const methodBearing = structuralSymbols.length > 0;
+        const evidenceQuality = (evidence?.evidence ?? []).reduce((sum, item) => sum + (typeof item.confidence === "number" ? item.confidence : 0.5), 0) / Math.max(evidenceItems.length, 1);
+        let score = evidence?.fileConfidence ?? 0;
+        score += evidenceQuality * 0.35;
+        score += Math.min(evidenceItems.length, 6) * 0.04;
+        if (verifyFocus.applies)
+            score += verifyFocus.score;
+        score += symbolOverlap.weighted * 0.55;
+        score += textOverlap.weighted * 0.18;
+        if (methodBearing && symbolOverlap.count >= 2)
+            score += 1.1;
+        if (methodBearing && querySignals.decisionSignals > 0 && symbolOverlap.count >= 1)
+            score += 0.35;
+        if (!methodBearing && workflowOverlap > 0 && symbolOverlap.count < 2) {
+            score -= Math.min(0.7, workflowOverlap * 0.22);
+        }
+        return {
+            filePath,
+            score,
+            dominant: methodBearing &&
+                querySignals.methodSelection &&
+                querySignals.decisionSignals > 0 &&
+                symbolOverlap.count >= 2,
+        };
+    })
+        .sort((a, b) => b.score - a.score);
+    if (ranked.length === 0) {
+        return { winners: new Set(), scores: new Map(), mergeThreshold: Number.POSITIVE_INFINITY };
+    }
+    const topScore = ranked[0].score;
+    const winners = ranked
+        .filter(entry => entry.dominant && entry.score >= topScore - 0.35)
+        .map(entry => entry.filePath);
+    if (winners.length === 0) {
+        return {
+            winners: new Set(),
+            scores: new Map(ranked.map(entry => [entry.filePath, entry.score])),
+            mergeThreshold: Number.POSITIVE_INFINITY,
+        };
+    }
+    const analysis = context.analysis ?? (context.analysis = {});
+    analysis.focus ?? (analysis.focus = { selectedFiles: [], candidateFiles: [], rationale: "" });
+    const focus = analysis.focus;
+    focus.selectedFiles ?? (focus.selectedFiles = []);
+    focus.candidateFiles ?? (focus.candidateFiles = []);
+    const selectedSet = new Set(focus.selectedFiles);
+    const candidateSet = new Set(focus.candidateFiles);
+    for (const filePath of winners) {
+        if (!selectedSet.has(filePath)) {
+            focus.selectedFiles.push(filePath);
+            selectedSet.add(filePath);
+        }
+    }
+    for (const entry of ranked) {
+        if (winners.includes(entry.filePath))
+            continue;
+        if (entry.score < 0.75)
+            continue;
+        if (!candidateSet.has(entry.filePath) && !selectedSet.has(entry.filePath)) {
+            focus.candidateFiles.push(entry.filePath);
+            candidateSet.add(entry.filePath);
+        }
+    }
+    focus.rationale =
+        `${focus.rationale ?? ""}\n[Deterministic verify-budget] Locked selection to ${winners.join(", ")}.`
+            .trim();
+    return {
+        winners: new Set(winners),
+        scores: new Map(ranked.map(entry => [entry.filePath, entry.score])),
+        mergeThreshold: topScore - 0.25,
+    };
+}
+function isMethodSelectionQuery(query) {
+    const queryLower = query.toLowerCase();
+    return (METHOD_SELECTION_QUERY_TERMS.some(term => queryLower.includes(term)) &&
+        DECISION_INTENT_TERMS.some(term => queryLower.includes(term)));
+}
+function extractMethodSelectionSignals(query) {
+    const normalizedTokens = collectIdentifierCandidates(query.toLowerCase()).filter(token => token.length >= 3);
+    const informativeTokens = new Set(normalizedTokens.filter(token => !METHOD_SELECTION_QUERY_TERMS.includes(token) && !BROAD_WORKFLOW_TERMS.includes(token)));
+    return {
+        informativeTokens,
+        methodSelection: METHOD_SELECTION_QUERY_TERMS.some(term => normalizedTokens.includes(term)),
+        decisionSignals: countTermOverlap(query.toLowerCase(), DECISION_INTENT_TERMS),
+    };
+}
+/**
+ * Splits identifiers and phrases into informative lowercase word parts.
+ * Example: "computeWaveBudgetLimit" -> ["compute", "wave", "budget", "limit"].
+ */
+function collectIdentifierCandidates(text) {
+    const rawTokens = text.match(/[A-Za-z_][A-Za-z0-9_]*/g) ?? [];
+    const parts = rawTokens.flatMap(token => token
+        .replace(/([a-z0-9])([A-Z])/g, "$1 $2")
+        .replace(/[_-]+/g, " ")
+        .toLowerCase()
+        .split(/\s+/)
+        .filter(part => part.length >= 3));
+    return Array.from(new Set(parts));
+}
+function computeIdentifierOverlap(candidates, queryTokens) {
+    const overlap = candidates.filter(token => queryTokens.has(token));
+    return {
+        count: overlap.length,
+        weighted: overlap.length / Math.max(queryTokens.size, 1),
+    };
+}
+function countTermOverlap(text, terms) {
+    return terms.reduce((count, term) => count + (text.includes(term) ? 1 : 0), 0);
+}
+//# sourceMappingURL=fileCheckStep.js.map

package/dist/agents/fileCheckStep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fileCheckStep.js","sourceRoot":"","sources":["../../src/agents/fileCheckStep.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAE7D,OAAO,EAAE,aAAa,EAAE,MAAM,sCAAsC,CAAC;AACrE,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EACH,4BAA4B,EAC5B,sBAAsB,GACzB,MAAM,mCAAmC,CAAC;AAC3C,OAAO,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAC;AAEnE,MAAM,4BAA4B,GAAG,CAAC,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;AACtG,MAAM,qBAAqB,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;AACxG,MAAM,oBAAoB,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAEhG,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,OAA0B;;IAC1D,OAAO,CAAC,QAAQ,KAAhB,OAAO,CAAC,QAAQ,GAAK,EAAE,EAAC;IACxB,MAAA,OAAO,CAAC,QAAQ,EAAC,KAAK,QAAL,KAAK,GAAK,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAC;IAEpF,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC;IACvC,MAAM,cAAc,GAAG,OAAO,CAAC,QAAQ,CAAC,cAAc,EAAE,IAAI,IAAI,EAAE,CAAC;IAEnE,mDAAmD;IACnD,MAAM,UAAU,GAAG,IAAI,GAAG,CACtB,CAAC,OAAO,CAAC,WAAW,EAAE,YAAY,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC,CACtG,CAAC;IACF,kCAAkC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAExD,oEAAoE;IACpE,MAAM,cAAc,GAAG,wBAAwB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAElE,4CAA4C;IAC5C,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,cAAc,GAAa,EAAE,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAChC,2DAA2D;QAC3D,MAAM,WAAW,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACzE,IAAI,WAAW,EAAE,CAAC;YACd,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,CAAC;IACL,CAAC;IAED,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAC7B,IAAI,GAAG,CAAC;QACJ,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,IAAI,EAAE,CAAC;QAC/C,GAAG,aAAa;KACnB,CAAC,CACL,CAAC;IAEF,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAC9B,IAAI,GAAG,CAAC;QACJ,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,CAAC;QAChD,GAAG,cAAc;KACpB,CAAC,CACL,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAEjD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,GAAG,cAAc,CAAC;IACtD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,GAAG,eAAe,CAAC;IACxD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS;QAC5B,eAAe,aAAa,CAAC,MAAM,gBAAgB,cAAc,CAAC,MAAM,yBAAyB,cAAc,CAAC,MAAM,cAAc,eAAe,CAAC,MAAM,gBAAgB,CAAC;IAE/K,wEAAwE;IAExE,MAAM,YAAY,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,EAAE,CAAC;IAC3D,MAAM,cAAc,GAAG,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,MAAM,CACtD,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE;QACxB,MAAM,gBAAgB,GAAG,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,gBAAgB,CAAC,MAAM;YAAE,OAAO,GAAG,CAAC;QAEzC,MAAM,aAAa,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9C,IAAI,EAAE,EAAE,CAAC,IAAI;YACb,KAAK,EAAE,EAAE,CAAC,KAAK;YACf,OAAO,EAAE,EAAE,CAAC,OAAO;YACnB,IAAI,EAAE,EAAE,CAAC,IAAI;YACb,UAAU,EAAE,EAAE,CAAC,UAAU;SAC5B,CAAC,CAAC,CAAC;QAEJ,kDAAkD;QAClD,MAAM,cAAc,GAAG,OAAO,MAAM,CAAC,cAAc,KAAK,QAAQ;YAC5D,CAAC,CAAC,MAAM,CAAC,cAAc;YACvB,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;QAE5F,GAAG,CAAC,QAAQ,CAAC,GAAG;YACZ,cAAc,EAAE,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACjD,aAAa,EAAE,aAAa,CAAC,MAAM;YACnC,QAAQ,EAAE,aAAa;SAC1B,CAAC;QAEF,OAAO,GAAG,CAAC;IACf,CAAC,EACD,EAaC,CACJ,CAAC;IAEF,+BAA+B,CAAC,OAAO,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;IACrE,0CAA0C,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAChE,MAAM,yBAAyB,GAAG,uCAAuC,CACrE,OAAO,EACP,UAAU,EACV,cAAc,CACjB,CAAC;IAEF,6CAA6C;IAE7C,MAAM,MAAM,GAAG;;;;EAIjB,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;;;EAGrC,cAAc;;;EAGd,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,UAAU,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;;;EAGxC,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,EAAE,CAAC,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;CA2BxC,CAAC,IAAI,EAAE,CAAC;IAEL,IAAI,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,QAAQ,CAAC;YACtB,KAAK,EAAE,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE;YAC3C,OAAO,EAAE,MAAM;SAClB,EAAE;YACC,MAAM,EAAE,eAAe;YACvB,YAAY,EAAE;gBACV,SAAS,EAAE,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE;gBAC/C,MAAM;gBACN,cAAc;gBACd,UAAU,EAAE,CAAC,GAAG,UAAU,CAAC;gBAC3B,cAAc;gBACd,yBAAyB,EAAE;oBACvB,OAAO,EAAE,CAAC,GAAG,yBAAyB,CAAC,OAAO,CAAC;oBAC/C,cAAc,EAAE,yBAAyB,CAAC,cAAc;oBACxD,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,yBAAyB,CAAC,MAAM,CAAC;iBAC/D;aACJ;SACJ,CAAC,CAAC;QAEH,IAAI,OAAY,CAAC;QACjB,IAAI,CAAC;YACD,OAAO,GAAG,MAAM,aAAa,CAAC,GAAG,CAAC;gBAC9B,KAAK,EAAE,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE;gBAC3C,OAAO,EAAE,EAAE,CAAC,IAAI;aACnB,CAAC,CAAC;QACP,CAAC;QAAC,OAAO,UAAU,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,oEAAoE,EAAE,UAAU,CAAC,CAAC;YAC/F,OAAO,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;QAClD,CAAC;QAED,IAAI,MAAM,GAAQ,EAAE,CAAC;QACrB,IAAI,CAAC;YACD,IAAI,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBAC5D,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;YAC1B,CAAC;iBAAM,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;gBAC7C,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;QACL,CAAC;QAAC,OAAO,QAAQ,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,yEAAyE,EAAE,QAAQ,CAAC,CAAC;QACtG,CAAC;QAED,6BAA6B;QAC7B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC/D,MAAM,YAAY,GAAG,MAAM,CAAC,aAAa;iBACpC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC,CAAC;YACzG,MAAM,aAAa,GAAG,yBAAyB,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;gBAC5D,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,QAAgB,EAAE,EAAE;oBACvC,IAAI,yBAAyB,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;wBAAE,OAAO,IAAI,CAAC;oBACjE,MAAM,KAAK,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBAC7D,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,IAAI,yBAAyB,CAAC,cAAc,CAAC;gBAC1F,CAAC,CAAC;gBACF,CAAC,CAAC,YAAY,CAAC;YACnB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,GAAG;gBACnC,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa;gBACvC,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC3D,CAAC;YAEF,IAAI,yBAAyB,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;gBAClE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC;gBAC1E,KAAK,MAAM,QAAQ,IAAI,YAAY,EAAE,CAAC;oBAClC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC;wBAAE,SAAS;oBACtE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrD,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC/B,CAAC;YACL,CAAC;QACL,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;YACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAChE,MAAM,cAAc,GAAG,MAAM,CAAC,cAAc;iBACvC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,GAAG;gBACpC,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc;gBACxC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC5D,CAAC;QACN,CAAC;QAED,IAAI,OAAO,MAAM,CAAC,SAAS,KAAK,QAAQ,EAAE,CAAC;YACvC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS;gBAC5B,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,IAAI,EAAE,CAAC;oBACxC,iBAAiB,GAAG,MAAM,CAAC,SAAS,CAAC;QAC7C,CAAC;QAED,IAAI,MAAM,CAAC,aAAa,IAAI,OAAO,MAAM,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;YACnE,OAAO,CAAC,QAAQ,CAAC,aAAa,GAAG;gBAC7B,GAAG,OAAO,CAAC,QAAQ,CAAC,aAAa;gBACjC,GAAG,MAAM,CAAC,aAAa;aAC1B,CAAC;QACN,CAAC;QAED,cAAc,CAAC,wBAAwB,EAAE,QAAQ,EAAE;YAC/C,MAAM,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM;YACxB,cAAc,EAAE,MAAM;YACtB,cAAc,EAAE;gBACZ,aAAa,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa;gBACnD,cAAc,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc;gBACrD,SAAS,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS;aAC9C;SACJ,CAAC,CAAC;IACP,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACX,OAAO,CAAC,IAAI,CAAC,8DAA8D,EAAE,GAAG,CAAC,CAAC;IACtF,CAAC;IAED,sDAAsD;IACtD,SAAS,wBAAwB,CAC7B,QAAwC;QAExC,MAAM,OAAO,GAAG;YACZ,QAAQ,EAAE,MAAM,EAAE,eAAe,IAAI,EAAE;YACvC,QAAQ,EAAE,cAAc,EAAE,IAAI,IAAI,EAAE;SACvC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,MAAM,KAAK,GAAG,sCAAsC,CAAC;QACrD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1E,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,+BAA+B,CACpC,OAA0B,EAC1B,UAAuB,EACvB,cAA0K;IAE1K,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE,CAAC;IAEhG,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;SAChC,GAAG,CAAC,QAAQ,CAAC,EAAE;QACZ,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,QAAQ,IAAI,EAAE,CAAC;aAC1C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;aAClD,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,WAAW,GAAG,4BAA4B,CAAC;YAC7C,KAAK;YACL,QAAQ;YACR,YAAY;SACf,CAAC,CAAC;QACH,IAAI,KAAK,GAAG,QAAQ,EAAE,cAAc,IAAI,CAAC,CAAC;QAC1C,IAAI,WAAW,CAAC,OAAO,EAAE,CAAC;YACtB,KAAK,IAAI,WAAW,CAAC,KAAK,CAAC;QAC/B,CAAC;QAED,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC/B,CAAC,CAAC;SACD,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC;SACpC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEhC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;IAC7D,QAAQ,CAAC,KAAK,KAAd,QAAQ,CAAC,KAAK,GAAK,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAC;IAC5E,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC7B,KAAK,CAAC,aAAa,KAAnB,KAAK,CAAC,aAAa,GAAK,EAAE,EAAC;IAC3B,KAAK,CAAC,cAAc,KAApB,KAAK,CAAC,cAAc,GAAK,EAAE,EAAC;IAC5B,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACtD,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAExD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACrC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACzC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;IACL,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACrC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClF,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC1C,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC1C,CAAC;IACL,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,kCAAkC,CACvC,OAA0B,EAC1B,UAAuB;IAEvB,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE,CAAC;IAChG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO;IACX,CAAC;IAED,MAAM,QAAQ,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAClD,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxC,OAAO;IACX,CAAC;IAED,MAAM,MAAM,GAAG,gCAAgC,CAAC,QAAQ,EAAE,KAAK,CAAC;SAC3D,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;SAChD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;AACL,CAAC;AAED,SAAS,gCAAgC,CACrC,QAAgB,EAChB,KAAa;IAEb,OAAO,iCAAiC,CAAC,QAAQ,CAAC;SAC7C,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACd,QAAQ;QACR,KAAK,EAAE,4BAA4B,CAAC;YAChC,KAAK;YACL,QAAQ;SACX,CAAC,CAAC,KAAK;KACX,CAAC,CAAC;SACF,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,GAAG,CAAC;SACnC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,iCAAiC,CAAC,OAAe;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;IAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,UAAU;YAAE,SAAS;QAE1B,IAAI,OAAO,GAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC;YACD,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,UAAU,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC;YACL,SAAS;QACb,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,yBAAyB,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,0BAA0B,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACnD,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACrB,SAAS;YACb,CAAC;YACD,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC7D,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,SAAS,yBAAyB,CAAC,IAAY;IAC3C,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,MAAM,EAAE,WAAW,EAAE,iBAAiB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC3F,CAAC;AAED;;;;;GAKG;AACH,SAAS,0CAA0C,CAC/C,OAA0B,EAC1B,UAAuB;IAEvB,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAChH,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrG,OAAO;IACX,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;SAChC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACd,QAAQ;QACR,KAAK,EAAE,4BAA4B,CAAC;YAChC,KAAK;YACL,QAAQ;SACX,CAAC,CAAC,KAAK;KACX,CAAC,CAAC;SACF,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,IAAI,GAAG,CAAC;SACnC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACrD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO;IACX,CAAC;IAED,MAAM,kBAAkB,GAAG,CAAC,oBAAoB,EAAE,kBAAkB,CAAC,CAAC;IACtE,MAAM,aAAa,GAAG,kBAAkB;SACnC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,CAAC;SACvF,MAAM,CAAC,CAAC,KAAK,EAAgD,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAErF,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;IAC7D,QAAQ,CAAC,KAAK,KAAd,QAAQ,CAAC,KAAK,GAAK,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAC;IAC5E,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC7B,KAAK,CAAC,aAAa,KAAnB,KAAK,CAAC,aAAa,GAAK,EAAE,EAAC;IAC3B,KAAK,CAAC,cAAc,KAApB,KAAK,CAAC,cAAc,GAAK,EAAE,EAAC;IAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACjD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAE7G,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACxF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxE,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC1C,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IAED,MAAM,eAAe,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAC1D,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,oBAAoB,CAAC,QAAQ,CAAC,CAChE,CAAC;IACF,KAAK,CAAC,aAAa,GAAG;QAClB,GAAG,OAAO;QACV,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;KAChH,CAAC;IACF,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;QACrC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,oBAAoB,CAAC,QAAgB;IAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;IACvD,OAAO,QAAQ,KAAK,WAAW,IAAI,QAAQ,KAAK,WAAW,IAAI,QAAQ,KAAK,cAAc,CAAC;AAC/F,CAAC;AAQD;;;;GAIG;AACH,SAAS,uCAAuC,CAC5C,OAA0B,EAC1B,UAAuB,EACvB,cAA0K;IAE1K,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,eAAe,IAAI,OAAO,CAAC,WAAW,EAAE,SAAS,IAAI,EAAE,CAAC;IAChG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,cAAc,EAAE,MAAM,CAAC,iBAAiB,EAAE,CAAC;IAC/F,CAAC;IAED,MAAM,YAAY,GAAG,6BAA6B,CAAC,KAAK,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;SAChC,GAAG,CAAC,QAAQ,CAAC,EAAE;QACZ,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,QAAQ,EAAE,QAAQ,IAAI,EAAE,CAAC;QAC/C,MAAM,YAAY,GAAG,aAAa;aAC7B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;aAClD,IAAI,CAAC,GAAG,CAAC;aACT,WAAW,EAAE,CAAC;QACnB,MAAM,WAAW,GAAG,4BAA4B,CAAC;YAC7C,KAAK;YACL,QAAQ;YACR,YAAY;SACf,CAAC,CAAC;QACH,MAAM,iBAAiB,GAAG,aAAa;aAClC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC;aACpE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,2BAA2B,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACzF,MAAM,aAAa,GAAG,wBAAwB,CAAC,iBAAiB,EAAE,YAAY,CAAC,iBAAiB,CAAC,CAAC;QAClG,MAAM,WAAW,GAAG,wBAAwB,CACxC,2BAA2B,CAAC,YAAY,CAAC,EACzC,YAAY,CAAC,iBAAiB,CACjC,CAAC;QACF,MAAM,eAAe,GAAG,gBAAgB,CAAC,YAAY,EAAE,oBAAoB,CAAC,CAAC;QAC7E,MAAM,aAAa,GAAG,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QACnD,MAAM,eAAe,GAAG,CAAC,QAAQ,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CACrD,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAClF,CAAC,CACJ,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAEtC,IAAI,KAAK,GAAG,QAAQ,EAAE,cAAc,IAAI,CAAC,CAAC;QAC1C,KAAK,IAAI,eAAe,GAAG,IAAI,CAAC;QAChC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QAClD,IAAI,WAAW,CAAC,OAAO;YAAE,KAAK,IAAI,WAAW,CAAC,KAAK,CAAC;QACpD,KAAK,IAAI,aAAa,CAAC,QAAQ,GAAG,IAAI,CAAC;QACvC,KAAK,IAAI,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrC,IAAI,aAAa,IAAI,aAAa,CAAC,KAAK,IAAI,CAAC;YAAE,KAAK,IAAI,GAAG,CAAC;QAC5D,IAAI,aAAa,IAAI,YAAY,CAAC,eAAe,GAAG,CAAC,IAAI,aAAa,CAAC,KAAK,IAAI,CAAC;YAAE,KAAK,IAAI,IAAI,CAAC;QACjG,IAAI,CAAC,aAAa,IAAI,eAAe,GAAG,CAAC,IAAI,aAAa,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACnE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,eAAe,GAAG,IAAI,CAAC,CAAC;QACnD,CAAC;QAED,OAAO;YACH,QAAQ;YACR,KAAK;YACL,QAAQ,EACJ,aAAa;gBACb,YAAY,CAAC,eAAe;gBAC5B,YAAY,CAAC,eAAe,GAAG,CAAC;gBAChC,aAAa,CAAC,KAAK,IAAI,CAAC;SAC/B,CAAC;IACN,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,cAAc,EAAE,MAAM,CAAC,iBAAiB,EAAE,CAAC;IAC/F,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACjC,MAAM,OAAO,GAAG,MAAM;SACjB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,KAAK,IAAI,QAAQ,GAAG,IAAI,CAAC;SACjE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAElC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACH,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,MAAM,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YACnE,cAAc,EAAE,MAAM,CAAC,iBAAiB;SAC3C,CAAC;IACN,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,EAAE,CAAC,CAAC;IAC7D,QAAQ,CAAC,KAAK,KAAd,QAAQ,CAAC,KAAK,GAAK,EAAE,aAAa,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAC;IAC5E,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;IAC7B,KAAK,CAAC,aAAa,KAAnB,KAAK,CAAC,aAAa,GAAK,EAAE,EAAC;IAC3B,KAAK,CAAC,cAAc,KAApB,KAAK,CAAC,cAAc,GAAK,EAAE,EAAC;IAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;IACjD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;IAEnD,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC;YAAE,SAAS;QAC/C,IAAI,KAAK,CAAC,KAAK,GAAG,IAAI;YAAE,SAAS;QACjC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxE,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC1C,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,SAAS;QACX,GAAG,KAAK,CAAC,SAAS,IAAI,EAAE,uDAAuD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;aAC/F,IAAI,EAAE,CAAC;IAEhB,OAAO;QACH,OAAO,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC;QACzB,MAAM,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACnE,cAAc,EAAE,QAAQ,GAAG,IAAI;KAClC,CAAC;AACN,CAAC;AAED,SAAS,sBAAsB,CAAC,KAAa;IACzC,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,OAAO,CACH,4BAA4B,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpE,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAChE,CAAC;AACN,CAAC;AAED,SAAS,6BAA6B,CAAC,KAAa;IAKhD,MAAM,gBAAgB,GAAG,2BAA2B,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC7G,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAC7B,gBAAgB,CAAC,MAAM,CACnB,KAAK,CAAC,EAAE,CAAC,CAAC,4BAA4B,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAClG,CACJ,CAAC;IAEF,OAAO;QACH,iBAAiB;QACjB,eAAe,EAAE,4BAA4B,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3F,eAAe,EAAE,gBAAgB,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,qBAAqB,CAAC;KAChF,CAAC;AACN,CAAC;AAED;;;GAGG;AACH,SAAS,2BAA2B,CAAC,IAAY;IAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC;IAC9D,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CACpC,KAAK;SACA,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;SACtC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC;SACtB,WAAW,EAAE;SACb,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CACxC,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,wBAAwB,CAC7B,UAAoB,EACpB,WAAwB;IAExB,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACnE,OAAO;QACH,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,QAAQ,EAAE,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;KAC3D,CAAC;AACN,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY,EAAE,KAAe;IACnD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnF,CAAC","sourcesContent":["/**\n * Seeds and refines focus files before deeper verification work begins.\n *\n * Why this file exists:\n * - verify-heavy queries still need one narrow focus pass before semantic work\n * - compatibility fields like `candidateFiles` still exist, but they must stay canonical\n * - unresolved raw query strings should stay in search/routing facts, not come back as fake file paths here\n */\nimport fs from \"fs\";\nimport { generate } from \"../lib/generate.js\";\nimport { logInputOutput } from \"../utils/promptLogHelper.js\";\nimport type { StructuredContext } from \"../types.js\";\nimport { cleanupModule } from \"../pipeline/modules/cleanupModule.js\";\nimport path from \"path\";\nimport { isPathIgnoredByFolderGlobs } from \"../fileRules/ignoredPaths.js\";\nimport {\n    getVerifyFocusFilePreference,\n    isVerifyFocusQueryText,\n} from \"../utils/verifyFocusPreference.js\";\nimport { getContextExecutionPath } from \"../utils/repoIdentity.js\";\n\nconst METHOD_SELECTION_QUERY_TERMS = [\"method\", \"function\", \"decides\", \"controls\", \"sets\", \"chooses\"];\nconst DECISION_INTENT_TERMS = [\"budget\", \"limit\", \"threshold\", \"policy\", \"decision\", \"control\", \"wave\"];\nconst BROAD_WORKFLOW_TERMS = [\"validate\", \"analysis\", \"change\", \"plan\", \"planning\", \"workflow\"];\n\nexport async function fileCheckStep(context: StructuredContext) {\n    context.analysis ??= {};\n    context.analysis.focus ??= { selectedFiles: [], candidateFiles: [], rationale: \"\" };\n\n    const intent = context.analysis.intent;\n    const planSuggestion = context.analysis.planSuggestion?.text ?? \"\";\n\n    // Step 1: gather known files from initContext only\n    const knownFiles = new Set(\n        (context.initContext?.relatedFiles ?? []).filter(filePath => !isPathIgnoredByFolderGlobs(filePath))\n    );\n    supplementKnownFilesForVerifyFocus(context, knownFiles);\n\n    // Step 2: extract file names from normalizedQuery or planSuggestion\n    const extractedFiles = extractFilesFromAnalysis(context.analysis);\n\n    // Step 3: populate focus with safe defaults\n    const selectedFiles: string[] = [];\n    const candidateFiles: string[] = [];\n\n    for (const file of extractedFiles) {\n        // Try to find full path in knownFiles by matching basename\n        const matchedPath = [...knownFiles].find(f => path.basename(f) === file);\n        if (matchedPath) {\n            selectedFiles.push(matchedPath);\n        }\n    }\n\n    const mergedSelected = Array.from(\n        new Set([\n            ...(context.analysis.focus.selectedFiles ?? []),\n            ...selectedFiles,\n        ])\n    );\n\n    const mergedCandidate = Array.from(\n        new Set([\n            ...(context.analysis.focus.candidateFiles ?? []),\n            ...candidateFiles,\n        ])\n    ).filter(file => !mergedSelected.includes(file));\n\n    context.analysis.focus.selectedFiles = mergedSelected;\n    context.analysis.focus.candidateFiles = mergedCandidate;\n    context.analysis.focus.rationale =\n        `Pre-check: +${selectedFiles.length} selected / +${candidateFiles.length} candidate(s); totals ${mergedSelected.length} selected, ${mergedCandidate.length} candidate(s).`;\n\n    // ----------------- Deterministic Evidence Extraction -----------------\n\n    const verifyByFile = context.analysis.verify?.byFile ?? {};\n    const evidenceByFile = Object.entries(verifyByFile).reduce(\n        (acc, [filePath, verify]) => {\n            const evidenceItemsRaw = verify?.evidence ?? [];\n            if (!evidenceItemsRaw.length) return acc;\n\n            const evidenceItems = evidenceItemsRaw.map(ev => ({\n                type: ev.type,\n                claim: ev.claim,\n                excerpt: ev.excerpt,\n                span: ev.span,\n                confidence: ev.confidence\n            }));\n\n            // Deterministic file-level confidence aggregation\n            const fileConfidence = typeof verify.fileConfidence === \"number\"\n                ? verify.fileConfidence\n                : evidenceItems.reduce((sum, e) => sum + (e.confidence ?? 0), 0) / evidenceItems.length;\n\n            acc[filePath] = {\n                fileConfidence: Number(fileConfidence.toFixed(3)),\n                evidenceCount: evidenceItems.length,\n                evidence: evidenceItems\n            };\n\n            return acc;\n        },\n        {} as Record<\n            string,\n            {\n                fileConfidence: number;\n                evidenceCount: number;\n                evidence: Array<{\n                    type: string;\n                    claim: string;\n                    excerpt?: string;\n                    span?: any;\n                    confidence: number;\n                }>;\n            }\n        >\n    );\n\n    promoteStrongVerifyFocusMatches(context, knownFiles, evidenceByFile);\n    applyDeterministicVerifyWaveTraceSelection(context, knownFiles);\n    const deterministicVerifyBudget = applyDeterministicVerifyBudgetSelection(\n        context,\n        knownFiles,\n        evidenceByFile\n    );\n\n    // ----------------- Prompt -----------------\n\n    const prompt = `\nYou are an AI meta-agent assisting with context verification.\n\nUser intent:\n${JSON.stringify(intent ?? {}, null, 2)}\n\nPlan suggestion:\n${planSuggestion}\n\nKnown files in context:\n${JSON.stringify([...knownFiles], null, 2)}\n\nDeterministic evidence per file:\n${JSON.stringify(evidenceByFile, null, 2)}\n\nEvidence rules:\n- Evidence includes a type (\"filename\", \"symbol\", \"sentence\", \"keyword-cluster\").\n- Each evidence item includes a confidence score between 0 and 1.\n- Each file includes an aggregated fileConfidence (average of its evidence confidence).\n- Higher confidence and stronger evidence types (e.g. filename, symbol definition) indicate stronger relevance.\n- Evidence alone is NOT sufficient — it must align with user intent.\n\nTask:\n1. Evaluate file relevance using BOTH fileConfidence and semantic alignment with intent.\n2. Prefer files with higher fileConfidence when multiple candidates exist.\n3. Only promote files to selectedFiles if they clearly satisfy the user intent.\n4. List unresolved candidate files if any.\n5. Suggest assumptions, constraints, or risks that may affect execution.\n6. Return STRICT JSON with shape:\n\n{\n  \"selectedFiles\": string[],\n  \"candidateFiles\": string[],\n  \"rationale\": string,\n  \"understanding\": {\n    \"assumptions\"?: string[],\n    \"constraints\"?: string[],\n    \"risks\"?: string[]\n  }\n}\n`.trim();\n\n    try {\n        const ai = await generate({\n            query: context.initContext?.userQuery ?? '',\n            content: prompt\n        }, {\n            caller: \"fileCheckStep\",\n            inputContext: {\n                userQuery: context.initContext?.userQuery ?? '',\n                intent,\n                planSuggestion,\n                knownFiles: [...knownFiles],\n                evidenceByFile,\n                deterministicVerifyBudget: {\n                    winners: [...deterministicVerifyBudget.winners],\n                    mergeThreshold: deterministicVerifyBudget.mergeThreshold,\n                    scores: Object.fromEntries(deterministicVerifyBudget.scores),\n                },\n            },\n        });\n\n        let cleaned: any;\n        try {\n            cleaned = await cleanupModule.run({\n                query: context.initContext?.userQuery ?? '',\n                content: ai.data,\n            });\n        } catch (cleanupErr) {\n            console.warn(\"[preFileSearchCheckStep] cleanupModule failed, using raw AI output\", cleanupErr);\n            cleaned = { data: ai.data, content: ai.data };\n        }\n\n        let parsed: any = {};\n        try {\n            if (typeof cleaned.data === \"object\" && cleaned.data !== null) {\n                parsed = cleaned.data;\n            } else if (typeof cleaned.content === \"string\") {\n                parsed = JSON.parse(cleaned.content);\n            }\n        } catch (parseErr) {\n            console.warn(\"[preFileSearchCheckStep] Failed to parse cleanup output, using defaults\", parseErr);\n        }\n\n        // Merge parsed output safely\n        if (Array.isArray(parsed.selectedFiles)) {\n            const existing = new Set(context.analysis.focus.selectedFiles);\n            const safeSelected = parsed.selectedFiles\n                .filter((f: string) => typeof f === \"string\" && knownFiles.has(f) && !isPathIgnoredByFolderGlobs(f));\n            const gatedSelected = deterministicVerifyBudget.winners.size > 0\n                ? safeSelected.filter((filePath: string) => {\n                    if (deterministicVerifyBudget.winners.has(filePath)) return true;\n                    const score = deterministicVerifyBudget.scores.get(filePath);\n                    return typeof score === \"number\" && score >= deterministicVerifyBudget.mergeThreshold;\n                })\n                : safeSelected;\n            context.analysis.focus.selectedFiles = [\n                ...context.analysis.focus.selectedFiles,\n                ...gatedSelected.filter((f: string) => !existing.has(f))\n            ];\n\n            if (deterministicVerifyBudget.winners.size > 0) {\n                const selectedSet = new Set(context.analysis.focus.selectedFiles);\n                const candidateSet = new Set(context.analysis.focus.candidateFiles ?? []);\n                for (const filePath of safeSelected) {\n                    if (selectedSet.has(filePath) || candidateSet.has(filePath)) continue;\n                    context.analysis.focus.candidateFiles.push(filePath);\n                    candidateSet.add(filePath);\n                }\n            }\n        }\n\n        if (Array.isArray(parsed.candidateFiles)) {\n            const existing = new Set(context.analysis.focus.candidateFiles);\n            const safeCandidates = parsed.candidateFiles\n                .filter((f: string) => typeof f === \"string\")\n                .filter((f: string) => knownFiles.has(f) && !isPathIgnoredByFolderGlobs(f));\n            context.analysis.focus.candidateFiles = [\n                ...context.analysis.focus.candidateFiles,\n                ...safeCandidates.filter((f: string) => !existing.has(f))\n            ];\n        }\n\n        if (typeof parsed.rationale === \"string\") {\n            context.analysis.focus.rationale =\n                (context.analysis.focus.rationale ?? \"\") +\n                \"\\n[Post-check] \" + parsed.rationale;\n        }\n\n        if (parsed.understanding && typeof parsed.understanding === \"object\") {\n            context.analysis.understanding = {\n                ...context.analysis.understanding,\n                ...parsed.understanding,\n            };\n        }\n\n        logInputOutput(\"preFileSearchCheckStep\", \"output\", {\n            callId: ai.trace?.callId,\n            rawModelOutput: parsed,\n            effectiveFocus: {\n                selectedFiles: context.analysis.focus.selectedFiles,\n                candidateFiles: context.analysis.focus.candidateFiles,\n                rationale: context.analysis.focus.rationale,\n            },\n        });\n    } catch (err) {\n        console.warn(\"[preFileSearchCheckStep] AI pre-check failed, using defaults\", err);\n    }\n\n    // Simple regex-based extractor (always returns array)\n    function extractFilesFromAnalysis(\n        analysis?: StructuredContext['analysis']\n    ): string[] {\n        const sources = [\n            analysis?.intent?.normalizedQuery ?? \"\",\n            analysis?.planSuggestion?.text ?? \"\"\n        ].join(\"\\n\");\n\n        const regex = /\\b([\\w\\-\\./]+\\.js|[\\w\\-\\./]+\\.ts)\\b/g;\n        const matches = sources.match(regex);\n        return matches ? Array.from(new Set(matches.map(m => m.trim()))) : [];\n    }\n}\n\n/**\n * Promotes high-signal verify files before the model post-check runs.\n * Example: verify-focus queries should lift `mainAgentVerify.ts` and\n * `fileCheckStep.ts` above `README.md` and `structuralPreloadStep.ts`.\n */\nfunction promoteStrongVerifyFocusMatches(\n    context: StructuredContext,\n    knownFiles: Set<string>,\n    evidenceByFile: Record<string, { fileConfidence: number; evidenceCount: number; evidence: Array<{ type: string; claim: string; excerpt?: string; confidence?: number }> }>\n): void {\n    const query = context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? \"\";\n\n    const scored = Array.from(knownFiles)\n        .map(filePath => {\n            const evidence = evidenceByFile[filePath];\n            const evidenceText = (evidence?.evidence ?? [])\n                .map(item => `${item.claim} ${item.excerpt ?? \"\"}`)\n                .join(\" \");\n            const verifyFocus = getVerifyFocusFilePreference({\n                query,\n                filePath,\n                evidenceText,\n            });\n            let score = evidence?.fileConfidence ?? 0;\n            if (verifyFocus.applies) {\n                score += verifyFocus.score;\n            }\n\n            return { filePath, score };\n        })\n        .filter(entry => entry.score >= 0.75)\n        .sort((a, b) => b.score - a.score);\n\n    if (scored.length === 0) return;\n\n    const analysis = context.analysis ?? (context.analysis = {});\n    analysis.focus ??= { selectedFiles: [], candidateFiles: [], rationale: \"\" };\n    const focus = analysis.focus;\n    focus.selectedFiles ??= [];\n    focus.candidateFiles ??= [];\n    const existingSelected = new Set(focus.selectedFiles);\n    const existingCandidate = new Set(focus.candidateFiles);\n\n    for (const entry of scored.slice(0, 3)) {\n        if (!existingSelected.has(entry.filePath)) {\n            focus.selectedFiles.push(entry.filePath);\n            existingSelected.add(entry.filePath);\n        }\n    }\n\n    for (const entry of scored.slice(3, 6)) {\n        if (!existingSelected.has(entry.filePath) && !existingCandidate.has(entry.filePath)) {\n            focus.candidateFiles.push(entry.filePath);\n            existingCandidate.add(entry.filePath);\n        }\n    }\n}\n\n/**\n * Adds a few strong verify implementation files when bootstrap search only seeded broad docs.\n * Example: a verify-wave trace can start with `README.md`, but still needs\n * `mainAgentVerify.ts` and `fileCheckStep.ts` in play before the model post-check.\n */\nfunction supplementKnownFilesForVerifyFocus(\n    context: StructuredContext,\n    knownFiles: Set<string>\n): void {\n    const query = context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? \"\";\n    if (!isVerifyFocusQueryText(query)) {\n        return;\n    }\n\n    const repoRoot = getContextExecutionPath(context);\n    if (!repoRoot || !fs.existsSync(repoRoot)) {\n        return;\n    }\n\n    const ranked = collectVerifyFocusRepoCandidates(repoRoot, query)\n        .filter(entry => !knownFiles.has(entry.filePath))\n        .slice(0, 4);\n    for (const entry of ranked) {\n        knownFiles.add(entry.filePath);\n    }\n}\n\nfunction collectVerifyFocusRepoCandidates(\n    repoRoot: string,\n    query: string\n): Array<{ filePath: string; score: number }> {\n    return collectVerifyFocusSearchablePaths(repoRoot)\n        .map(filePath => ({\n            filePath,\n            score: getVerifyFocusFilePreference({\n                query,\n                filePath,\n            }).score,\n        }))\n        .filter(entry => entry.score >= 0.9)\n        .sort((left, right) => right.score - left.score);\n}\n\nfunction collectVerifyFocusSearchablePaths(rootDir: string): string[] {\n    const files: string[] = [];\n    const stack = [rootDir];\n\n    while (stack.length > 0) {\n        const currentDir = stack.pop();\n        if (!currentDir) continue;\n\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 (shouldSkipVerifyFocusPath(entry.name)) continue;\n            const fullPath = path.join(currentDir, entry.name);\n            if (isPathIgnoredByFolderGlobs(fullPath)) continue;\n            if (entry.isDirectory()) {\n                stack.push(fullPath);\n                continue;\n            }\n            if (!/\\.(ts|tsx|js|jsx|mjs|cjs)$/.test(entry.name)) continue;\n            files.push(fullPath);\n        }\n    }\n\n    return files;\n}\n\nfunction shouldSkipVerifyFocusPath(name: string): boolean {\n    return [\".git\", \"node_modules\", \"dist\", \"artifacts\", \".scai-worktrees\"].includes(name);\n}\n\n/**\n * Locks trace-style verify-wave questions onto the two core focus-transition files.\n * Example: a query about `selectedFiles` and `candidateFiles` across verify waves\n * should keep `mainAgentVerify.ts` and `fileCheckStep.ts` selected even if the\n * model drifts toward adjacent helper files.\n */\nfunction applyDeterministicVerifyWaveTraceSelection(\n    context: StructuredContext,\n    knownFiles: Set<string>\n): void {\n    const query = (context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? \"\").toLowerCase();\n    if (!query.includes(\"selectedfiles\") || !query.includes(\"candidatefiles\") || !query.includes(\"verify\")) {\n        return;\n    }\n\n    const ranked = Array.from(knownFiles)\n        .map(filePath => ({\n            filePath,\n            score: getVerifyFocusFilePreference({\n                query,\n                filePath,\n            }).score,\n        }))\n        .filter(entry => entry.score >= 1.1)\n        .sort((left, right) => right.score - left.score);\n    if (ranked.length === 0) {\n        return;\n    }\n\n    const preferredBasenames = [\"mainagentverify.ts\", \"filecheckstep.ts\"];\n    const lockedWinners = preferredBasenames\n        .map(name => ranked.find(entry => path.basename(entry.filePath).toLowerCase() === name))\n        .filter((entry): entry is { filePath: string; score: number } => Boolean(entry));\n\n    const analysis = context.analysis ?? (context.analysis = {});\n    analysis.focus ??= { selectedFiles: [], candidateFiles: [], rationale: \"\" };\n    const focus = analysis.focus;\n    focus.selectedFiles ??= [];\n    focus.candidateFiles ??= [];\n    const selectedSet = new Set(focus.selectedFiles);\n    const candidateSet = new Set(focus.candidateFiles);\n    const winners = (lockedWinners.length > 0 ? lockedWinners : ranked.slice(0, 2)).map(entry => entry.filePath);\n\n    for (const filePath of winners) {\n        if (!selectedSet.has(filePath)) {\n            focus.selectedFiles.push(filePath);\n            selectedSet.add(filePath);\n        }\n    }\n\n    for (const entry of ranked.filter(entry => !winners.includes(entry.filePath)).slice(0, 2)) {\n        if (!selectedSet.has(entry.filePath) && !candidateSet.has(entry.filePath)) {\n            focus.candidateFiles.push(entry.filePath);\n            candidateSet.add(entry.filePath);\n        }\n    }\n\n    const docLikeSelected = focus.selectedFiles.filter(filePath =>\n        !winners.includes(filePath) && isBroadVerifyDocFile(filePath)\n    );\n    focus.selectedFiles = [\n        ...winners,\n        ...focus.selectedFiles.filter(filePath => !winners.includes(filePath) && !docLikeSelected.includes(filePath)),\n    ];\n    for (const filePath of docLikeSelected) {\n        if (!candidateSet.has(filePath)) {\n            focus.candidateFiles.push(filePath);\n            candidateSet.add(filePath);\n        }\n    }\n}\n\nfunction isBroadVerifyDocFile(filePath: string): boolean {\n    const basename = path.basename(filePath).toLowerCase();\n    return basename === \"readme.md\" || basename === \"agents.md\" || basename === \"changelog.md\";\n}\n\ntype VerifyBudgetSelection = {\n    winners: Set<string>;\n    scores: Map<string, number>;\n    mergeThreshold: number;\n};\n\n/**\n * Locks method-selection queries onto files with strong structural evidence.\n * Example: a query asking which method controls a wave budget should favor a\n * file whose symbol evidence overlaps on informative identifier parts.\n */\nfunction applyDeterministicVerifyBudgetSelection(\n    context: StructuredContext,\n    knownFiles: Set<string>,\n    evidenceByFile: Record<string, { fileConfidence: number; evidenceCount: number; evidence: Array<{ type: string; claim: string; excerpt?: string; confidence?: number }> }>\n): VerifyBudgetSelection {\n    const query = context.analysis?.intent?.normalizedQuery ?? context.initContext?.userQuery ?? \"\";\n    if (!isMethodSelectionQuery(query)) {\n        return { winners: new Set(), scores: new Map(), mergeThreshold: Number.POSITIVE_INFINITY };\n    }\n\n    const querySignals = extractMethodSelectionSignals(query);\n    const ranked = Array.from(knownFiles)\n        .map(filePath => {\n            const evidence = evidenceByFile[filePath];\n            const evidenceItems = evidence?.evidence ?? [];\n            const evidenceText = evidenceItems\n                .map(item => `${item.claim} ${item.excerpt ?? \"\"}`)\n                .join(\" \")\n                .toLowerCase();\n            const verifyFocus = getVerifyFocusFilePreference({\n                query,\n                filePath,\n                evidenceText,\n            });\n            const structuralSymbols = evidenceItems\n                .filter(item => item.type === \"structural\" || item.type === \"symbol\")\n                .flatMap(item => collectIdentifierCandidates(`${item.claim} ${item.excerpt ?? \"\"}`));\n            const symbolOverlap = computeIdentifierOverlap(structuralSymbols, querySignals.informativeTokens);\n            const textOverlap = computeIdentifierOverlap(\n                collectIdentifierCandidates(evidenceText),\n                querySignals.informativeTokens\n            );\n            const workflowOverlap = countTermOverlap(evidenceText, BROAD_WORKFLOW_TERMS);\n            const methodBearing = structuralSymbols.length > 0;\n            const evidenceQuality = (evidence?.evidence ?? []).reduce(\n                (sum, item) => sum + (typeof item.confidence === \"number\" ? item.confidence : 0.5),\n                0\n            ) / Math.max(evidenceItems.length, 1);\n\n            let score = evidence?.fileConfidence ?? 0;\n            score += evidenceQuality * 0.35;\n            score += Math.min(evidenceItems.length, 6) * 0.04;\n            if (verifyFocus.applies) score += verifyFocus.score;\n            score += symbolOverlap.weighted * 0.55;\n            score += textOverlap.weighted * 0.18;\n            if (methodBearing && symbolOverlap.count >= 2) score += 1.1;\n            if (methodBearing && querySignals.decisionSignals > 0 && symbolOverlap.count >= 1) score += 0.35;\n            if (!methodBearing && workflowOverlap > 0 && symbolOverlap.count < 2) {\n                score -= Math.min(0.7, workflowOverlap * 0.22);\n            }\n\n            return {\n                filePath,\n                score,\n                dominant:\n                    methodBearing &&\n                    querySignals.methodSelection &&\n                    querySignals.decisionSignals > 0 &&\n                    symbolOverlap.count >= 2,\n            };\n        })\n        .sort((a, b) => b.score - a.score);\n\n    if (ranked.length === 0) {\n        return { winners: new Set(), scores: new Map(), mergeThreshold: Number.POSITIVE_INFINITY };\n    }\n\n    const topScore = ranked[0].score;\n    const winners = ranked\n        .filter(entry => entry.dominant && entry.score >= topScore - 0.35)\n        .map(entry => entry.filePath);\n\n    if (winners.length === 0) {\n        return {\n            winners: new Set(),\n            scores: new Map(ranked.map(entry => [entry.filePath, entry.score])),\n            mergeThreshold: Number.POSITIVE_INFINITY,\n        };\n    }\n\n    const analysis = context.analysis ?? (context.analysis = {});\n    analysis.focus ??= { selectedFiles: [], candidateFiles: [], rationale: \"\" };\n    const focus = analysis.focus;\n    focus.selectedFiles ??= [];\n    focus.candidateFiles ??= [];\n    const selectedSet = new Set(focus.selectedFiles);\n    const candidateSet = new Set(focus.candidateFiles);\n\n    for (const filePath of winners) {\n        if (!selectedSet.has(filePath)) {\n            focus.selectedFiles.push(filePath);\n            selectedSet.add(filePath);\n        }\n    }\n\n    for (const entry of ranked) {\n        if (winners.includes(entry.filePath)) continue;\n        if (entry.score < 0.75) continue;\n        if (!candidateSet.has(entry.filePath) && !selectedSet.has(entry.filePath)) {\n            focus.candidateFiles.push(entry.filePath);\n            candidateSet.add(entry.filePath);\n        }\n    }\n\n    focus.rationale =\n        `${focus.rationale ?? \"\"}\\n[Deterministic verify-budget] Locked selection to ${winners.join(\", \")}.`\n            .trim();\n\n    return {\n        winners: new Set(winners),\n        scores: new Map(ranked.map(entry => [entry.filePath, entry.score])),\n        mergeThreshold: topScore - 0.25,\n    };\n}\n\nfunction isMethodSelectionQuery(query: string): boolean {\n    const queryLower = query.toLowerCase();\n    return (\n        METHOD_SELECTION_QUERY_TERMS.some(term => queryLower.includes(term)) &&\n        DECISION_INTENT_TERMS.some(term => queryLower.includes(term))\n    );\n}\n\nfunction extractMethodSelectionSignals(query: string): {\n    informativeTokens: Set<string>;\n    methodSelection: boolean;\n    decisionSignals: number;\n} {\n    const normalizedTokens = collectIdentifierCandidates(query.toLowerCase()).filter(token => token.length >= 3);\n    const informativeTokens = new Set(\n        normalizedTokens.filter(\n            token => !METHOD_SELECTION_QUERY_TERMS.includes(token) && !BROAD_WORKFLOW_TERMS.includes(token)\n        )\n    );\n\n    return {\n        informativeTokens,\n        methodSelection: METHOD_SELECTION_QUERY_TERMS.some(term => normalizedTokens.includes(term)),\n        decisionSignals: countTermOverlap(query.toLowerCase(), DECISION_INTENT_TERMS),\n    };\n}\n\n/**\n * Splits identifiers and phrases into informative lowercase word parts.\n * Example: \"computeWaveBudgetLimit\" -> [\"compute\", \"wave\", \"budget\", \"limit\"].\n */\nfunction collectIdentifierCandidates(text: string): string[] {\n    const rawTokens = text.match(/[A-Za-z_][A-Za-z0-9_]*/g) ?? [];\n    const parts = rawTokens.flatMap(token =>\n        token\n            .replace(/([a-z0-9])([A-Z])/g, \"$1 $2\")\n            .replace(/[_-]+/g, \" \")\n            .toLowerCase()\n            .split(/\\s+/)\n            .filter(part => part.length >= 3)\n    );\n    return Array.from(new Set(parts));\n}\n\nfunction computeIdentifierOverlap(\n    candidates: string[],\n    queryTokens: Set<string>\n): { count: number; weighted: number } {\n    const overlap = candidates.filter(token => queryTokens.has(token));\n    return {\n        count: overlap.length,\n        weighted: overlap.length / Math.max(queryTokens.size, 1),\n    };\n}\n\nfunction countTermOverlap(text: string, terms: string[]): number {\n    return terms.reduce((count, term) => count + (text.includes(term) ? 1 : 0), 0);\n}\n"]}

package/dist/agents/giveUpEvaluatorStep.js

@@ -0,0 +1,63 @@
+import { resolveProgressState } from "./guards/resolveProgressState.js";
+/**
+ * Refactor note:
+ * - Bounded give-up evaluator for no-growth/retry exhaustion policies.
+ * - Why it exists: stop honestly when additional loops are no longer useful.
+ */
+const DEFAULT_POLICY = {
+    maxVerifyWaves: 3,
+    maxNoGrowthWaves: 2,
+    maxRetriesPerTarget: 2,
+    maxExpansionPromotionsPerWave: 8,
+};
+function mergePolicy(policy) {
+    // Example: policy={maxVerifyWaves:5} keeps other defaults unchanged.
+    return {
+        maxVerifyWaves: policy?.maxVerifyWaves ?? DEFAULT_POLICY.maxVerifyWaves,
+        maxNoGrowthWaves: policy?.maxNoGrowthWaves ?? DEFAULT_POLICY.maxNoGrowthWaves,
+        maxRetriesPerTarget: policy?.maxRetriesPerTarget ?? DEFAULT_POLICY.maxRetriesPerTarget,
+        maxExpansionPromotionsPerWave: policy?.maxExpansionPromotionsPerWave ?? DEFAULT_POLICY.maxExpansionPromotionsPerWave,
+    };
+}
+export function runGiveUpEvaluator(context, policy) {
+    const activePolicy = mergePolicy(policy);
+    const progressState = context.analysis?.progressState ?? resolveProgressState(context);
+    const counters = context.analysis?.attemptCounters ?? {};
+    const verifyWaves = counters.verifyWaves ?? 0;
+    const noGrowthWaves = counters.noGrowthWaves ?? 0;
+    const retriesByTarget = counters.retriesByTarget ?? {};
+    const maxRetries = Object.values(retriesByTarget).reduce((acc, count) => Math.max(acc, count), 0);
+    const plannerRetry = progressState.research.plannerRetry;
+    if (verifyWaves >= activePolicy.maxVerifyWaves && noGrowthWaves >= activePolicy.maxNoGrowthWaves) {
+        // Example: 3 verify waves + 2 no-growth waves => stop with no-growth.
+        return {
+            triggered: true,
+            reason: "no-growth",
+            rationale: `No evidence growth after ${verifyWaves} verify wave(s)`,
+            counters,
+        };
+    }
+    if (maxRetries >= activePolicy.maxRetriesPerTarget) {
+        // Example: retriesByTarget["cli/package.json"]=2 hits retry budget.
+        return {
+            triggered: true,
+            reason: "retry-exhausted",
+            rationale: `Target retry budget exhausted (${maxRetries})`,
+            counters,
+        };
+    }
+    if (plannerRetry?.stalled && plannerRetry.count >= activePolicy.maxRetriesPerTarget) {
+        return {
+            triggered: true,
+            reason: "retry-exhausted",
+            rationale: `Planner retry budget exhausted for ${plannerRetry.targetFile} (${plannerRetry.count})`,
+            counters,
+        };
+    }
+    return {
+        triggered: false,
+        rationale: "Give-up policy has not been triggered",
+        counters,
+    };
+}
+//# sourceMappingURL=giveUpEvaluatorStep.js.map

package/dist/agents/giveUpEvaluatorStep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"giveUpEvaluatorStep.js","sourceRoot":"","sources":["../../src/agents/giveUpEvaluatorStep.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,oBAAoB,EAAE,MAAM,kCAAkC,CAAC;AAExE;;;;GAIG;AACH,MAAM,cAAc,GAA2B;IAC7C,cAAc,EAAE,CAAC;IACjB,gBAAgB,EAAE,CAAC;IACnB,mBAAmB,EAAE,CAAC;IACtB,6BAA6B,EAAE,CAAC;CACjC,CAAC;AAEF,SAAS,WAAW,CAAC,MAAqB;IACxC,qEAAqE;IACrE,OAAO;QACL,cAAc,EAAE,MAAM,EAAE,cAAc,IAAI,cAAc,CAAC,cAAc;QACvE,gBAAgB,EAAE,MAAM,EAAE,gBAAgB,IAAI,cAAc,CAAC,gBAAgB;QAC7E,mBAAmB,EAAE,MAAM,EAAE,mBAAmB,IAAI,cAAc,CAAC,mBAAmB;QACtF,6BAA6B,EAC3B,MAAM,EAAE,6BAA6B,IAAI,cAAc,CAAC,6BAA6B;KACxF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,OAA0B,EAC1B,MAAqB;IAErB,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,aAAa,GAAG,OAAO,CAAC,QAAQ,EAAE,aAAa,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC;IACvF,MAAM,QAAQ,GAAoB,OAAO,CAAC,QAAQ,EAAE,eAAe,IAAI,EAAE,CAAC;IAC1E,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,IAAI,CAAC,CAAC;IAC9C,MAAM,aAAa,GAAG,QAAQ,CAAC,aAAa,IAAI,CAAC,CAAC;IAClD,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe,IAAI,EAAE,CAAC;IACvD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,YAAY,GAAG,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC;IAEzD,IAAI,WAAW,IAAI,YAAY,CAAC,cAAc,IAAI,aAAa,IAAI,YAAY,CAAC,gBAAgB,EAAE,CAAC;QACjG,sEAAsE;QACtE,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,WAAW;YACnB,SAAS,EAAE,4BAA4B,WAAW,iBAAiB;YACnE,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,IAAI,YAAY,CAAC,mBAAmB,EAAE,CAAC;QACnD,oEAAoE;QACpE,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,iBAAiB;YACzB,SAAS,EAAE,kCAAkC,UAAU,GAAG;YAC1D,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,IAAI,YAAY,EAAE,OAAO,IAAI,YAAY,CAAC,KAAK,IAAI,YAAY,CAAC,mBAAmB,EAAE,CAAC;QACpF,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,iBAAiB;YACzB,SAAS,EAAE,sCAAsC,YAAY,CAAC,UAAU,KAAK,YAAY,CAAC,KAAK,GAAG;YAClG,QAAQ;SACT,CAAC;IACJ,CAAC;IAED,OAAO;QACL,SAAS,EAAE,KAAK;QAChB,SAAS,EAAE,uCAAuC;QAClD,QAAQ;KACT,CAAC;AACJ,CAAC","sourcesContent":["import type {\n  AttemptCounters,\n  GiveUpEvaluationResult,\n  GiveUpPolicy,\n  StructuredContext,\n} from \"../types.js\";\nimport { resolveProgressState } from \"./guards/resolveProgressState.js\";\n\n/**\n * Refactor note:\n * - Bounded give-up evaluator for no-growth/retry exhaustion policies.\n * - Why it exists: stop honestly when additional loops are no longer useful.\n */\nconst DEFAULT_POLICY: Required<GiveUpPolicy> = {\n  maxVerifyWaves: 3,\n  maxNoGrowthWaves: 2,\n  maxRetriesPerTarget: 2,\n  maxExpansionPromotionsPerWave: 8,\n};\n\nfunction mergePolicy(policy?: GiveUpPolicy): Required<GiveUpPolicy> {\n  // Example: policy={maxVerifyWaves:5} keeps other defaults unchanged.\n  return {\n    maxVerifyWaves: policy?.maxVerifyWaves ?? DEFAULT_POLICY.maxVerifyWaves,\n    maxNoGrowthWaves: policy?.maxNoGrowthWaves ?? DEFAULT_POLICY.maxNoGrowthWaves,\n    maxRetriesPerTarget: policy?.maxRetriesPerTarget ?? DEFAULT_POLICY.maxRetriesPerTarget,\n    maxExpansionPromotionsPerWave:\n      policy?.maxExpansionPromotionsPerWave ?? DEFAULT_POLICY.maxExpansionPromotionsPerWave,\n  };\n}\n\nexport function runGiveUpEvaluator(\n  context: StructuredContext,\n  policy?: GiveUpPolicy\n): GiveUpEvaluationResult {\n  const activePolicy = mergePolicy(policy);\n  const progressState = context.analysis?.progressState ?? resolveProgressState(context);\n  const counters: AttemptCounters = context.analysis?.attemptCounters ?? {};\n  const verifyWaves = counters.verifyWaves ?? 0;\n  const noGrowthWaves = counters.noGrowthWaves ?? 0;\n  const retriesByTarget = counters.retriesByTarget ?? {};\n  const maxRetries = Object.values(retriesByTarget).reduce((acc, count) => Math.max(acc, count), 0);\n  const plannerRetry = progressState.research.plannerRetry;\n\n  if (verifyWaves >= activePolicy.maxVerifyWaves && noGrowthWaves >= activePolicy.maxNoGrowthWaves) {\n    // Example: 3 verify waves + 2 no-growth waves => stop with no-growth.\n    return {\n      triggered: true,\n      reason: \"no-growth\",\n      rationale: `No evidence growth after ${verifyWaves} verify wave(s)`,\n      counters,\n    };\n  }\n\n  if (maxRetries >= activePolicy.maxRetriesPerTarget) {\n    // Example: retriesByTarget[\"cli/package.json\"]=2 hits retry budget.\n    return {\n      triggered: true,\n      reason: \"retry-exhausted\",\n      rationale: `Target retry budget exhausted (${maxRetries})`,\n      counters,\n    };\n  }\n\n  if (plannerRetry?.stalled && plannerRetry.count >= activePolicy.maxRetriesPerTarget) {\n    return {\n      triggered: true,\n      reason: \"retry-exhausted\",\n      rationale: `Planner retry budget exhausted for ${plannerRetry.targetFile} (${plannerRetry.count})`,\n      counters,\n    };\n  }\n\n  return {\n    triggered: false,\n    rationale: \"Give-up policy has not been triggered\",\n    counters,\n  };\n}\n"]}