scai 0.1.178 → 1.0.0

package/dist/agent/persistence/turns.js

@@ -0,0 +1,92 @@
+/**
+ * Owns per-query turn history for the modular agent runtime.
+ *
+ * Why this file exists:
+ * - tasks should store only the latest working state, not the whole dialog
+ * - each user query and agent outcome needs one durable row for conversation history
+ * - turn indexing and status mapping should stay out of runtime and command files
+ */
+import { getDbForRepo } from "../../db/client.js";
+function parseJson(value) {
+    if (!value) {
+        return undefined;
+    }
+    try {
+        return JSON.parse(value);
+    }
+    catch {
+        return undefined;
+    }
+}
+function nextTurnIndex(taskId, db) {
+    const row = db.prepare(`
+    SELECT COALESCE(MAX(turn_index), 0) AS max_turn_index
+    FROM task_turns
+    WHERE task_id = ?
+  `).get(taskId);
+    return (row?.max_turn_index ?? 0) + 1;
+}
+export function startAgentTurn(memory, userQuery, queryKind, db = getDbForRepo()) {
+    const now = new Date().toISOString();
+    const turnIndex = nextTurnIndex(memory.task.id, db);
+    const inserted = db.prepare(`
+    INSERT INTO task_turns(
+      session_id,
+      task_id,
+      turn_index,
+      user_query,
+      query_kind,
+      status,
+      final_answer,
+      final_answer_packet_json,
+      stop_message,
+      dialog_state_json,
+      created_at,
+      updated_at
+    )
+    VALUES (?, ?, ?, ?, ?, 'active', NULL, NULL, NULL, NULL, ?, ?)
+  `).run(memory.session.id, memory.task.id, turnIndex, userQuery, queryKind, now, now);
+    memory.task.currentTurnId = inserted.lastInsertRowid;
+    memory.task.currentTurnIndex = turnIndex;
+}
+export function finishAgentTurn(memory, db = getDbForRepo()) {
+    if (!memory.task.currentTurnId) {
+        return;
+    }
+    const now = new Date().toISOString();
+    const status = memory.task.status;
+    db.prepare(`
+    UPDATE task_turns
+    SET status = ?,
+        final_answer = ?,
+        final_answer_packet_json = ?,
+        stop_message = ?,
+        dialog_state_json = ?,
+        updated_at = ?
+    WHERE id = ?
+  `).run(status, memory.artifacts.finalAnswer ?? null, memory.artifacts.latestFinalAnswerPacket ? JSON.stringify(memory.artifacts.latestFinalAnswerPacket) : null, memory.artifacts.stopMessage ?? null, memory.task.dialogState ? JSON.stringify(memory.task.dialogState) : null, now, memory.task.currentTurnId);
+}
+export function listAgentTurns(taskId, db = getDbForRepo()) {
+    const rows = db.prepare(`
+    SELECT *
+    FROM task_turns
+    WHERE task_id = ?
+    ORDER BY turn_index ASC
+  `).all(taskId);
+    return rows.map((row) => ({
+        id: row.id,
+        sessionId: row.session_id,
+        taskId: row.task_id,
+        turnIndex: row.turn_index,
+        userQuery: row.user_query,
+        queryKind: row.query_kind,
+        status: row.status,
+        ...(row.final_answer ? { finalAnswer: row.final_answer } : {}),
+        ...(parseJson(row.final_answer_packet_json) ? { finalAnswerPacket: parseJson(row.final_answer_packet_json) } : {}),
+        ...(row.stop_message ? { stopMessage: row.stop_message } : {}),
+        ...(parseJson(row.dialog_state_json) ? { dialogState: parseJson(row.dialog_state_json) } : {}),
+        createdAt: row.created_at,
+        updatedAt: row.updated_at,
+    }));
+}
+//# sourceMappingURL=turns.js.map

package/dist/agent/persistence/turns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"turns.js","sourceRoot":"","sources":["../../../src/agent/persistence/turns.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAqBlD,SAAS,SAAS,CAAI,KAAgC;IACpD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAM,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,MAAc,EAAE,EAAO;IAC5C,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC;;;;GAItB,CAAC,CAAC,GAAG,CAAC,MAAM,CAAmD,CAAC;IACjE,OAAO,CAAC,GAAG,EAAE,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,MAAmB,EAAE,SAAiB,EAAE,SAA6B,EAAE,EAAE,GAAG,YAAY,EAAE;IACvH,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;;;;GAgB3B,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACrF,MAAM,CAAC,IAAI,CAAC,aAAa,GAAG,QAAQ,CAAC,eAAyB,CAAC;IAC/D,MAAM,CAAC,IAAI,CAAC,gBAAgB,GAAG,SAAS,CAAC;AAC3C,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,MAAmB,EAAE,EAAE,GAAG,YAAY,EAAE;IACtE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC/B,OAAO;IACT,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;IAClC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;GASV,CAAC,CAAC,GAAG,CACJ,MAAM,EACN,MAAM,CAAC,SAAS,CAAC,WAAW,IAAI,IAAI,EACpC,MAAM,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,IAAI,EAC1G,MAAM,CAAC,SAAS,CAAC,WAAW,IAAI,IAAI,EACpC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EACxE,GAAG,EACH,MAAM,CAAC,IAAI,CAAC,aAAa,CAC1B,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,EAAE,GAAG,YAAY,EAAE;IAChE,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;GAKvB,CAAC,CAAC,GAAG,CAAC,MAAM,CAcX,CAAC;IACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACxB,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,MAAM,EAAE,GAAG,CAAC,OAAO;QACnB,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,GAAG,CAAC,SAAS,CAAoB,GAAG,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC,EAAE,iBAAiB,EAAE,SAAS,CAAoB,GAAG,CAAC,wBAAwB,CAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACzJ,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,GAAG,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,GAAG,CAAC,SAAS,CAAqC,GAAG,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,CAAqC,GAAG,CAAC,iBAAiB,CAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvK,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,SAAS,EAAE,GAAG,CAAC,UAAU;KAC1B,CAAC,CAAC,CAAC;AACN,CAAC","sourcesContent":["/**\n * Owns per-query turn history for the modular agent runtime.\n *\n * Why this file exists:\n * - tasks should store only the latest working state, not the whole dialog\n * - each user query and agent outcome needs one durable row for conversation history\n * - turn indexing and status mapping should stay out of runtime and command files\n */\nimport { getDbForRepo } from \"../../db/client.js\";\nimport type { AgentMemory, FinalAnswerPacket } from \"../types.js\";\n\nexport type AgentTurnQueryKind = \"fresh-ask\" | \"resume-query\" | \"feedback-reply\" | \"plan-only\";\n\nexport type AgentTurnRecord = {\n  id: number;\n  sessionId: number;\n  taskId: number;\n  turnIndex: number;\n  userQuery: string;\n  queryKind: AgentTurnQueryKind;\n  status: string;\n  finalAnswer?: string;\n  finalAnswerPacket?: FinalAnswerPacket;\n  stopMessage?: string;\n  dialogState?: AgentMemory[\"task\"][\"dialogState\"];\n  createdAt: string;\n  updatedAt: string;\n};\n\nfunction parseJson<T>(value: string | null | undefined): T | undefined {\n  if (!value) {\n    return undefined;\n  }\n  try {\n    return JSON.parse(value) as T;\n  } catch {\n    return undefined;\n  }\n}\n\nfunction nextTurnIndex(taskId: number, db: any): number {\n  const row = db.prepare(`\n    SELECT COALESCE(MAX(turn_index), 0) AS max_turn_index\n    FROM task_turns\n    WHERE task_id = ?\n  `).get(taskId) as { max_turn_index?: number | null } | undefined;\n  return (row?.max_turn_index ?? 0) + 1;\n}\n\nexport function startAgentTurn(memory: AgentMemory, userQuery: string, queryKind: AgentTurnQueryKind, db = getDbForRepo()): void {\n  const now = new Date().toISOString();\n  const turnIndex = nextTurnIndex(memory.task.id, db);\n  const inserted = db.prepare(`\n    INSERT INTO task_turns(\n      session_id,\n      task_id,\n      turn_index,\n      user_query,\n      query_kind,\n      status,\n      final_answer,\n      final_answer_packet_json,\n      stop_message,\n      dialog_state_json,\n      created_at,\n      updated_at\n    )\n    VALUES (?, ?, ?, ?, ?, 'active', NULL, NULL, NULL, NULL, ?, ?)\n  `).run(memory.session.id, memory.task.id, turnIndex, userQuery, queryKind, now, now);\n  memory.task.currentTurnId = inserted.lastInsertRowid as number;\n  memory.task.currentTurnIndex = turnIndex;\n}\n\nexport function finishAgentTurn(memory: AgentMemory, db = getDbForRepo()): void {\n  if (!memory.task.currentTurnId) {\n    return;\n  }\n  const now = new Date().toISOString();\n  const status = memory.task.status;\n  db.prepare(`\n    UPDATE task_turns\n    SET status = ?,\n        final_answer = ?,\n        final_answer_packet_json = ?,\n        stop_message = ?,\n        dialog_state_json = ?,\n        updated_at = ?\n    WHERE id = ?\n  `).run(\n    status,\n    memory.artifacts.finalAnswer ?? null,\n    memory.artifacts.latestFinalAnswerPacket ? JSON.stringify(memory.artifacts.latestFinalAnswerPacket) : null,\n    memory.artifacts.stopMessage ?? null,\n    memory.task.dialogState ? JSON.stringify(memory.task.dialogState) : null,\n    now,\n    memory.task.currentTurnId\n  );\n}\n\nexport function listAgentTurns(taskId: number, db = getDbForRepo()): AgentTurnRecord[] {\n  const rows = db.prepare(`\n    SELECT *\n    FROM task_turns\n    WHERE task_id = ?\n    ORDER BY turn_index ASC\n  `).all(taskId) as Array<{\n    id: number;\n    session_id: number;\n    task_id: number;\n    turn_index: number;\n    user_query: string;\n    query_kind: AgentTurnQueryKind;\n    status: string;\n    final_answer?: string | null;\n    final_answer_packet_json?: string | null;\n    stop_message?: string | null;\n    dialog_state_json?: string | null;\n    created_at: string;\n    updated_at: string;\n  }>;\n  return rows.map((row) => ({\n    id: row.id,\n    sessionId: row.session_id,\n    taskId: row.task_id,\n    turnIndex: row.turn_index,\n    userQuery: row.user_query,\n    queryKind: row.query_kind,\n    status: row.status,\n    ...(row.final_answer ? { finalAnswer: row.final_answer } : {}),\n    ...(parseJson<FinalAnswerPacket>(row.final_answer_packet_json) ? { finalAnswerPacket: parseJson<FinalAnswerPacket>(row.final_answer_packet_json)! } : {}),\n    ...(row.stop_message ? { stopMessage: row.stop_message } : {}),\n    ...(parseJson<AgentMemory[\"task\"][\"dialogState\"]>(row.dialog_state_json) ? { dialogState: parseJson<AgentMemory[\"task\"][\"dialogState\"]>(row.dialog_state_json)! } : {}),\n    createdAt: row.created_at,\n    updatedAt: row.updated_at,\n  }));\n}\n"]}

package/dist/agent/policy/ambiguityResolution.js

@@ -0,0 +1,226 @@
+/**
+ * Resolves ambiguous explicit file targets from the current candidate frontier.
+ *
+ * Why this file exists:
+ * - duplicate basenames should be decided in one policy-owned place
+ * - numeric scoring should stay private to the resolver
+ * - path existence checks should stay in the read area, not here
+ * - target classification and feedback should share one small decision result
+ */
+import path from "path";
+import { resolveExplicitFileTarget } from "../read/index.js";
+const MIN_CONFIDENT_SCORE = 12;
+const MIN_CONFIDENT_GAP = 6;
+function normalizePath(value) {
+    return value.replace(/\\/g, "/");
+}
+function looksPathLike(target) {
+    return path.isAbsolute(target) ||
+        target.startsWith("./") ||
+        target.startsWith("../") ||
+        target.includes("/");
+}
+function hasFileExtension(target) {
+    return /\.[A-Za-z0-9_]{1,10}$/.test(target);
+}
+function tryResolveExplicitFileTarget(memory, rawTarget) {
+    try {
+        return resolveExplicitFileTarget(memory, rawTarget);
+    }
+    catch {
+        return undefined;
+    }
+}
+function matchTargetCandidates(memory, rawTarget) {
+    const normalizedTarget = normalizePath(rawTarget).toLowerCase();
+    const basenameTarget = path.basename(rawTarget).toLowerCase();
+    return Array.from(new Set(memory.evidence.candidateFiles)).filter((candidate) => {
+        const normalizedCandidate = normalizePath(candidate).toLowerCase();
+        const basename = path.basename(candidate).toLowerCase();
+        const stem = basename.replace(/\.[^.]+$/, "");
+        return normalizedCandidate.endsWith(`/${normalizedTarget}`) ||
+            basename === basenameTarget ||
+            stem === basenameTarget;
+    });
+}
+function computeSharedDirectoryPrefixScore(candidatePath, anchorPaths) {
+    const candidateParts = path.dirname(candidatePath).split(path.sep).filter(Boolean);
+    let bestScore = 0;
+    for (const anchorPath of anchorPaths) {
+        const anchorParts = path.dirname(anchorPath).split(path.sep).filter(Boolean);
+        let score = 0;
+        while (score < candidateParts.length &&
+            score < anchorParts.length &&
+            candidateParts[score] === anchorParts[score]) {
+            score += 1;
+        }
+        bestScore = Math.max(bestScore, score);
+    }
+    return bestScore;
+}
+function computeCommonAnchorPrefix(anchorPaths) {
+    if (anchorPaths.length === 0) {
+        return [];
+    }
+    const parts = anchorPaths.map((anchorPath) => path.dirname(anchorPath).split(path.sep).filter(Boolean));
+    const prefix = [];
+    let index = 0;
+    while (parts.every((segments) => index < segments.length && segments[index] === parts[0][index])) {
+        prefix.push(parts[0][index]);
+        index += 1;
+    }
+    return prefix;
+}
+function computeAnchorDepthPenalty(candidatePath, anchorPaths) {
+    const prefix = computeCommonAnchorPrefix(anchorPaths);
+    if (prefix.length === 0) {
+        return 0;
+    }
+    const candidateParts = path.dirname(candidatePath).split(path.sep).filter(Boolean);
+    const prefixMatches = prefix.every((segment, index) => candidateParts[index] === segment);
+    if (!prefixMatches) {
+        return 0;
+    }
+    const extraDepth = Math.max(0, candidateParts.length - prefix.length);
+    if (extraDepth === 0) {
+        return 8;
+    }
+    return Math.max(0, 6 - extraDepth * 2);
+}
+/**
+ * Rewards one basename match that sits exactly at the shared anchor root.
+ * Example: with anchors under `cli/src/commands` and `cli/src/utils`,
+ * `cli/src/index.ts` should beat `cli/src/agent/index.ts`.
+ */
+function computeCommonAnchorRootBonus(candidatePath, anchorPaths) {
+    const prefix = computeCommonAnchorPrefix(anchorPaths);
+    if (prefix.length === 0) {
+        return 0;
+    }
+    const candidateDirParts = path.dirname(candidatePath).split(path.sep).filter(Boolean);
+    return candidateDirParts.length === prefix.length &&
+        prefix.every((segment, index) => candidateDirParts[index] === segment)
+        ? 6
+        : 0;
+}
+function resolveAnchorPaths(memory, rawTarget) {
+    const anchors = new Set();
+    for (const target of memory.task.explicitTargets) {
+        const trimmed = String(target ?? "").trim();
+        if (!trimmed || trimmed === rawTarget) {
+            continue;
+        }
+        const override = memory.task.explicitTargetOverrides[trimmed];
+        const concretePath = override
+            ? tryResolveExplicitFileTarget(memory, override)
+            : tryResolveExplicitFileTarget(memory, trimmed);
+        if (concretePath) {
+            anchors.add(concretePath);
+            continue;
+        }
+        const candidateMatches = matchTargetCandidates(memory, trimmed);
+        if (candidateMatches.length === 1) {
+            anchors.add(candidateMatches[0]);
+        }
+    }
+    for (const filePath of memory.task.hardFileTargets) {
+        anchors.add(filePath);
+    }
+    return Array.from(anchors);
+}
+function scoreCandidate(memory, rawTarget, candidatePath, anchorPaths) {
+    const metadata = memory.evidence.candidateMetadata?.[candidatePath];
+    const searchReasons = metadata?.searchReasons ?? [];
+    let score = 0;
+    if (looksPathLike(rawTarget) && normalizePath(candidatePath).toLowerCase().endsWith(`/${normalizePath(rawTarget).toLowerCase()}`)) {
+        score += 12;
+    }
+    if (hasFileExtension(rawTarget) && path.basename(candidatePath).toLowerCase() === path.basename(rawTarget).toLowerCase()) {
+        score += 4;
+    }
+    if (searchReasons.includes("path-anchor")) {
+        score += 4;
+    }
+    if (searchReasons.some((reason) => reason.startsWith("exact-basename:"))) {
+        score += 2;
+    }
+    score += computeSharedDirectoryPrefixScore(candidatePath, anchorPaths) * 4;
+    score += computeAnchorDepthPenalty(candidatePath, anchorPaths);
+    score += computeCommonAnchorRootBonus(candidatePath, anchorPaths);
+    return score;
+}
+/**
+ * Resolves one explicit target against the current candidate frontier.
+ * Example: `index.ts` with CLI anchors may resolve to `cli/src/index.ts`.
+ */
+export function resolveExplicitTarget(memory, rawTarget) {
+    const target = String(rawTarget ?? "").trim();
+    if (!target) {
+        return null;
+    }
+    const override = memory.task.explicitTargetOverrides[target];
+    if (override) {
+        return {
+            target,
+            candidates: [override],
+            winner: override,
+            confidence: "high",
+            reason: "Used the user-selected in-repo file path.",
+        };
+    }
+    const concretePath = tryResolveExplicitFileTarget(memory, target);
+    if (concretePath) {
+        return {
+            target,
+            candidates: [concretePath],
+            winner: concretePath,
+            confidence: "high",
+            reason: "Resolved the explicit path directly inside the active repo/worktree.",
+        };
+    }
+    const candidates = matchTargetCandidates(memory, target);
+    if (candidates.length === 0) {
+        return {
+            target,
+            candidates: [],
+            confidence: "low",
+            reason: "No in-repo candidate matched the explicit target yet.",
+        };
+    }
+    if (candidates.length === 1) {
+        return {
+            target,
+            candidates,
+            winner: candidates[0],
+            confidence: "high",
+            reason: "Only one in-repo candidate matched the explicit target.",
+        };
+    }
+    const anchorPaths = resolveAnchorPaths(memory, target);
+    const ranked = candidates
+        .map((candidatePath) => ({
+        candidatePath,
+        score: scoreCandidate(memory, target, candidatePath, anchorPaths),
+    }))
+        .sort((left, right) => right.score - left.score || left.candidatePath.localeCompare(right.candidatePath));
+    const best = ranked[0];
+    const runnerUp = ranked[1];
+    if (best &&
+        best.score >= MIN_CONFIDENT_SCORE &&
+        (!runnerUp || best.score - runnerUp.score >= MIN_CONFIDENT_GAP)) {
+        return {
+            target,
+            candidates,
+            winner: best.candidatePath,
+            confidence: "high",
+            reason: "One candidate clearly matched the surrounding path scope better than the others.",
+        };
+    }
+    return {
+        target,
+        candidates,
+        confidence: "low",
+        reason: "Several in-repo candidates matched and deterministic path scope was not strong enough to pick one safely.",
+    };
+}
+//# sourceMappingURL=ambiguityResolution.js.map

package/dist/agent/policy/ambiguityResolution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ambiguityResolution.js","sourceRoot":"","sources":["../../../src/agent/policy/ambiguityResolution.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,OAAO,IAAI,MAAM,MAAM,CAAC;AAExB,OAAO,EAAE,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AAE7D,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAC/B,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,SAAS,aAAa,CAAC,KAAa;IAClC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,aAAa,CAAC,MAAc;IACnC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC;QACvB,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC;QACxB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAc;IACtC,OAAO,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,4BAA4B,CAAC,MAAmB,EAAE,SAAiB;IAC1E,IAAI,CAAC;QACH,OAAO,yBAAyB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACtD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAAC,MAAmB,EAAE,SAAiB;IACnE,MAAM,gBAAgB,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;IAChE,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;IAE9D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE;QAC9E,MAAM,mBAAmB,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;QACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;QACxD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QAC9C,OAAO,mBAAmB,CAAC,QAAQ,CAAC,IAAI,gBAAgB,EAAE,CAAC;YACzD,QAAQ,KAAK,cAAc;YAC3B,IAAI,KAAK,cAAc,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,iCAAiC,CAAC,aAAqB,EAAE,WAAqB;IACrF,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACnF,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;QACrC,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OACE,KAAK,GAAG,cAAc,CAAC,MAAM;YAC7B,KAAK,GAAG,WAAW,CAAC,MAAM;YAC1B,cAAc,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,KAAK,CAAC,EAC5C,CAAC;YACD,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;QACD,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,yBAAyB,CAAC,WAAqB;IACtD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACxG,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QACjG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,yBAAyB,CAAC,aAAqB,EAAE,WAAqB;IAC7E,MAAM,MAAM,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC;IACtD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACnF,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC;IAC1F,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IACtE,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,SAAS,4BAA4B,CAAC,aAAqB,EAAE,WAAqB;IAChF,MAAM,MAAM,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC;IACtD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,MAAM,iBAAiB,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACtF,OAAO,iBAAiB,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;QAC7C,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,KAAK,OAAO,CAAC;QACxE,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,CAAC,CAAC;AACR,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAmB,EAAE,SAAiB;IAChE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QACjD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,OAAO,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YACtC,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC;QAC9D,MAAM,YAAY,GAAG,QAAQ;YAC3B,CAAC,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC;YAChD,CAAC,CAAC,4BAA4B,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAClD,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QACD,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAChE,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QACnD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,cAAc,CAAC,MAAmB,EAAE,SAAiB,EAAE,aAAqB,EAAE,WAAqB;IAC1G,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,aAAa,CAAC,CAAC;IACpE,MAAM,aAAa,GAAG,QAAQ,EAAE,aAAa,IAAI,EAAE,CAAC;IACpD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,IAAI,aAAa,CAAC,SAAS,CAAC,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;QAClI,KAAK,IAAI,EAAE,CAAC;IACd,CAAC;IAED,IAAI,gBAAgB,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;QACzH,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IAED,IAAI,aAAa,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QAC1C,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC;QACzE,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IAED,KAAK,IAAI,iCAAiC,CAAC,aAAa,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC;IAC3E,KAAK,IAAI,yBAAyB,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;IAC/D,KAAK,IAAI,4BAA4B,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;IAClE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAmB,EAAE,SAAiB;IAC1E,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;IAC7D,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO;YACL,MAAM;YACN,UAAU,EAAE,CAAC,QAAQ,CAAC;YACtB,MAAM,EAAE,QAAQ;YAChB,UAAU,EAAE,MAAM;YAClB,MAAM,EAAE,2CAA2C;SACpD,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,4BAA4B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClE,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO;YACL,MAAM;YACN,UAAU,EAAE,CAAC,YAAY,CAAC;YAC1B,MAAM,EAAE,YAAY;YACpB,UAAU,EAAE,MAAM;YAClB,MAAM,EAAE,sEAAsE;SAC/E,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO;YACL,MAAM;YACN,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,KAAK;YACjB,MAAM,EAAE,uDAAuD;SAChE,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO;YACL,MAAM;YACN,UAAU;YACV,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;YACrB,UAAU,EAAE,MAAM;YAClB,MAAM,EAAE,yDAAyD;SAClE,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,UAAU;SACtB,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QACvB,aAAa;QACb,KAAK,EAAE,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,CAAC;KAClE,CAAC,CAAC;SACF,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAC5G,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAE3B,IACE,IAAI;QACJ,IAAI,CAAC,KAAK,IAAI,mBAAmB;QACjC,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,IAAI,iBAAiB,CAAC,EAC/D,CAAC;QACD,OAAO;YACL,MAAM;YACN,UAAU;YACV,MAAM,EAAE,IAAI,CAAC,aAAa;YAC1B,UAAU,EAAE,MAAM;YAClB,MAAM,EAAE,kFAAkF;SAC3F,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM;QACN,UAAU;QACV,UAAU,EAAE,KAAK;QACjB,MAAM,EAAE,2GAA2G;KACpH,CAAC;AACJ,CAAC","sourcesContent":["/**\n * Resolves ambiguous explicit file targets from the current candidate frontier.\n *\n * Why this file exists:\n * - duplicate basenames should be decided in one policy-owned place\n * - numeric scoring should stay private to the resolver\n * - path existence checks should stay in the read area, not here\n * - target classification and feedback should share one small decision result\n */\nimport path from \"path\";\nimport type { AgentMemory, AgentTargetResolution } from \"../types.js\";\nimport { resolveExplicitFileTarget } from \"../read/index.js\";\n\nconst MIN_CONFIDENT_SCORE = 12;\nconst MIN_CONFIDENT_GAP = 6;\n\nfunction normalizePath(value: string): string {\n  return value.replace(/\\\\/g, \"/\");\n}\n\nfunction looksPathLike(target: string): boolean {\n  return path.isAbsolute(target) ||\n    target.startsWith(\"./\") ||\n    target.startsWith(\"../\") ||\n    target.includes(\"/\");\n}\n\nfunction hasFileExtension(target: string): boolean {\n  return /\\.[A-Za-z0-9_]{1,10}$/.test(target);\n}\n\nfunction tryResolveExplicitFileTarget(memory: AgentMemory, rawTarget: string): string | undefined {\n  try {\n    return resolveExplicitFileTarget(memory, rawTarget);\n  } catch {\n    return undefined;\n  }\n}\n\nfunction matchTargetCandidates(memory: AgentMemory, rawTarget: string): string[] {\n  const normalizedTarget = normalizePath(rawTarget).toLowerCase();\n  const basenameTarget = path.basename(rawTarget).toLowerCase();\n\n  return Array.from(new Set(memory.evidence.candidateFiles)).filter((candidate) => {\n    const normalizedCandidate = normalizePath(candidate).toLowerCase();\n    const basename = path.basename(candidate).toLowerCase();\n    const stem = basename.replace(/\\.[^.]+$/, \"\");\n    return normalizedCandidate.endsWith(`/${normalizedTarget}`) ||\n      basename === basenameTarget ||\n      stem === basenameTarget;\n  });\n}\n\nfunction computeSharedDirectoryPrefixScore(candidatePath: string, anchorPaths: string[]): number {\n  const candidateParts = path.dirname(candidatePath).split(path.sep).filter(Boolean);\n  let bestScore = 0;\n\n  for (const anchorPath of anchorPaths) {\n    const anchorParts = path.dirname(anchorPath).split(path.sep).filter(Boolean);\n    let score = 0;\n    while (\n      score < candidateParts.length &&\n      score < anchorParts.length &&\n      candidateParts[score] === anchorParts[score]\n    ) {\n      score += 1;\n    }\n    bestScore = Math.max(bestScore, score);\n  }\n\n  return bestScore;\n}\n\nfunction computeCommonAnchorPrefix(anchorPaths: string[]): string[] {\n  if (anchorPaths.length === 0) {\n    return [];\n  }\n  const parts = anchorPaths.map((anchorPath) => path.dirname(anchorPath).split(path.sep).filter(Boolean));\n  const prefix: string[] = [];\n  let index = 0;\n  while (parts.every((segments) => index < segments.length && segments[index] === parts[0][index])) {\n    prefix.push(parts[0][index]);\n    index += 1;\n  }\n  return prefix;\n}\n\nfunction computeAnchorDepthPenalty(candidatePath: string, anchorPaths: string[]): number {\n  const prefix = computeCommonAnchorPrefix(anchorPaths);\n  if (prefix.length === 0) {\n    return 0;\n  }\n  const candidateParts = path.dirname(candidatePath).split(path.sep).filter(Boolean);\n  const prefixMatches = prefix.every((segment, index) => candidateParts[index] === segment);\n  if (!prefixMatches) {\n    return 0;\n  }\n  const extraDepth = Math.max(0, candidateParts.length - prefix.length);\n  if (extraDepth === 0) {\n    return 8;\n  }\n  return Math.max(0, 6 - extraDepth * 2);\n}\n\n/**\n * Rewards one basename match that sits exactly at the shared anchor root.\n * Example: with anchors under `cli/src/commands` and `cli/src/utils`,\n * `cli/src/index.ts` should beat `cli/src/agent/index.ts`.\n */\nfunction computeCommonAnchorRootBonus(candidatePath: string, anchorPaths: string[]): number {\n  const prefix = computeCommonAnchorPrefix(anchorPaths);\n  if (prefix.length === 0) {\n    return 0;\n  }\n  const candidateDirParts = path.dirname(candidatePath).split(path.sep).filter(Boolean);\n  return candidateDirParts.length === prefix.length &&\n      prefix.every((segment, index) => candidateDirParts[index] === segment)\n    ? 6\n    : 0;\n}\n\nfunction resolveAnchorPaths(memory: AgentMemory, rawTarget: string): string[] {\n  const anchors = new Set<string>();\n  for (const target of memory.task.explicitTargets) {\n    const trimmed = String(target ?? \"\").trim();\n    if (!trimmed || trimmed === rawTarget) {\n      continue;\n    }\n    const override = memory.task.explicitTargetOverrides[trimmed];\n    const concretePath = override\n      ? tryResolveExplicitFileTarget(memory, override)\n      : tryResolveExplicitFileTarget(memory, trimmed);\n    if (concretePath) {\n      anchors.add(concretePath);\n      continue;\n    }\n    const candidateMatches = matchTargetCandidates(memory, trimmed);\n    if (candidateMatches.length === 1) {\n      anchors.add(candidateMatches[0]);\n    }\n  }\n  for (const filePath of memory.task.hardFileTargets) {\n    anchors.add(filePath);\n  }\n  return Array.from(anchors);\n}\n\nfunction scoreCandidate(memory: AgentMemory, rawTarget: string, candidatePath: string, anchorPaths: string[]): number {\n  const metadata = memory.evidence.candidateMetadata?.[candidatePath];\n  const searchReasons = metadata?.searchReasons ?? [];\n  let score = 0;\n\n  if (looksPathLike(rawTarget) && normalizePath(candidatePath).toLowerCase().endsWith(`/${normalizePath(rawTarget).toLowerCase()}`)) {\n    score += 12;\n  }\n\n  if (hasFileExtension(rawTarget) && path.basename(candidatePath).toLowerCase() === path.basename(rawTarget).toLowerCase()) {\n    score += 4;\n  }\n\n  if (searchReasons.includes(\"path-anchor\")) {\n    score += 4;\n  }\n  if (searchReasons.some((reason) => reason.startsWith(\"exact-basename:\"))) {\n    score += 2;\n  }\n\n  score += computeSharedDirectoryPrefixScore(candidatePath, anchorPaths) * 4;\n  score += computeAnchorDepthPenalty(candidatePath, anchorPaths);\n  score += computeCommonAnchorRootBonus(candidatePath, anchorPaths);\n  return score;\n}\n\n/**\n * Resolves one explicit target against the current candidate frontier.\n * Example: `index.ts` with CLI anchors may resolve to `cli/src/index.ts`.\n */\nexport function resolveExplicitTarget(memory: AgentMemory, rawTarget: string): AgentTargetResolution | null {\n  const target = String(rawTarget ?? \"\").trim();\n  if (!target) {\n    return null;\n  }\n\n  const override = memory.task.explicitTargetOverrides[target];\n  if (override) {\n    return {\n      target,\n      candidates: [override],\n      winner: override,\n      confidence: \"high\",\n      reason: \"Used the user-selected in-repo file path.\",\n    };\n  }\n\n  const concretePath = tryResolveExplicitFileTarget(memory, target);\n  if (concretePath) {\n    return {\n      target,\n      candidates: [concretePath],\n      winner: concretePath,\n      confidence: \"high\",\n      reason: \"Resolved the explicit path directly inside the active repo/worktree.\",\n    };\n  }\n\n  const candidates = matchTargetCandidates(memory, target);\n  if (candidates.length === 0) {\n    return {\n      target,\n      candidates: [],\n      confidence: \"low\",\n      reason: \"No in-repo candidate matched the explicit target yet.\",\n    };\n  }\n\n  if (candidates.length === 1) {\n    return {\n      target,\n      candidates,\n      winner: candidates[0],\n      confidence: \"high\",\n      reason: \"Only one in-repo candidate matched the explicit target.\",\n    };\n  }\n\n  const anchorPaths = resolveAnchorPaths(memory, target);\n  const ranked = candidates\n    .map((candidatePath) => ({\n      candidatePath,\n      score: scoreCandidate(memory, target, candidatePath, anchorPaths),\n    }))\n    .sort((left, right) => right.score - left.score || left.candidatePath.localeCompare(right.candidatePath));\n  const best = ranked[0];\n  const runnerUp = ranked[1];\n\n  if (\n    best &&\n    best.score >= MIN_CONFIDENT_SCORE &&\n    (!runnerUp || best.score - runnerUp.score >= MIN_CONFIDENT_GAP)\n  ) {\n    return {\n      target,\n      candidates,\n      winner: best.candidatePath,\n      confidence: \"high\",\n      reason: \"One candidate clearly matched the surrounding path scope better than the others.\",\n    };\n  }\n\n  return {\n    target,\n    candidates,\n    confidence: \"low\",\n    reason: \"Several in-repo candidates matched and deterministic path scope was not strong enough to pick one safely.\",\n  };\n}\n"]}

package/dist/agent/policy/contracts.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=contracts.js.map

package/dist/agent/policy/contracts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contracts.js","sourceRoot":"","sources":["../../../src/agent/policy/contracts.ts"],"names":[],"mappings":"","sourcesContent":["/**\n * Defines the shared decision-pipeline contracts for the modular agent runtime.\n *\n * Why this file exists:\n * - resolution, coverage, policy, feedback, and runtime should share one small contract layer\n * - target meaning and answer readiness should not be re-inferred in multiple modules\n * - the loop should consume stable facts instead of mixed booleans from unrelated owners\n */\nimport type { AgentActionName } from \"../types.js\";\n\nexport type PolicyActionArgs = Record<string, unknown>;\n\nexport type TargetResolution =\n  | {\n      kind: \"resolved-file\";\n      target: string;\n      filePath: string;\n      reason: string;\n    }\n  | {\n      kind: \"resolved-folder\";\n      target: string;\n      folderPath: string;\n      candidates: string[];\n      reason: string;\n    }\n  | {\n      kind: \"ambiguous\";\n      target: string;\n      candidates: string[];\n      reason: string;\n    }\n  | {\n      kind: \"unresolved\";\n      target: string;\n      reason: string;\n    };\n\nexport type EvidenceCoverage =\n  | {\n      kind: \"enough\";\n      groundedFiles: string[];\n      reason: string;\n    }\n  | {\n      kind: \"needs-read\";\n      nextTargets: string[];\n      reason: string;\n    }\n  | {\n      kind: \"needs-search\";\n      reason: string;\n    };\n\nexport type PolicyDecision = {\n  allowedActions: AgentActionName[];\n  nextAction?: AgentActionName;\n  args?: PolicyActionArgs;\n  stop?: \"final-answer\" | \"request-user-input\" | \"cannot-answer\";\n  reason: string;\n};\n"]}