@winspan/claude-forge 9.2.0 → 9.12.0

package/dist/core/insights/agent-patch-apply.js

@@ -0,0 +1,165 @@
+/**
+ * agent-patch-apply.ts — pure-JS unified-diff applier for agent-template
+ * adoption (decision 568a8c53, user Open-Q1).
+ *
+ * Why NOT `git apply`: the daemon runs under launchd with cwd=`/` (no working
+ * tree), so `git apply` fails there (same landmine documented in
+ * skills-distill.ts:559). The web adopt path needs a working tree-INDEPENDENT
+ * application that resolves the patch against the in-memory template text.
+ *
+ * Scope: this is a deliberately small, strict context-matching applier — NOT a
+ * full GNU patch / git-apply re-implementation. It handles the unified-diff
+ * shape the `agent-retro-distiller` emits:
+ *   - one or more `@@ ... @@` hunks
+ *   - context lines (leading space), additions (`+`), removals (`-`)
+ *   - optional `--- a/...` / `+++ b/...` file headers (ignored)
+ *
+ * It is ATOMIC: if any hunk fails to match its context against the current text
+ * it throws `PatchApplyError` and returns NOTHING (no partial write). Callers
+ * map the throw to HTTP 422. Pure: no IO.
+ */
+export class PatchApplyError extends Error {
+    /** Index (1-based) of the hunk that failed, when known. */
+    hunkIndex;
+    constructor(message, hunkIndex = null) {
+        super(`[agent-patch-apply] ${message}`);
+        this.name = 'PatchApplyError';
+        this.hunkIndex = hunkIndex;
+    }
+}
+/** Split a unified diff into hunks, dropping file headers + `@@` markers. */
+function parseHunks(patch) {
+    const rawLines = patch.split('\n');
+    const hunks = [];
+    let current = null;
+    for (const line of rawLines) {
+        if (line.startsWith('--- ') || line.startsWith('+++ ')) {
+            // file header — ignored
+            continue;
+        }
+        if (line.startsWith('@@')) {
+            current = { lines: [] };
+            hunks.push(current);
+            continue;
+        }
+        if (current === null) {
+            // Lines before the first @@ that are not file headers: tolerate blank /
+            // stray lines (the distiller sometimes prefixes a fenced block).
+            if (line.trim() === '')
+                continue;
+            // A non-empty body line outside any hunk → malformed.
+            // Be lenient about a leading "diff --git" style line.
+            if (line.startsWith('diff ') || line.startsWith('index '))
+                continue;
+            continue;
+        }
+        current.lines.push(line);
+    }
+    return hunks;
+}
+/**
+ * The "old" (context + removed) side and "new" (context + added) side of a hunk,
+ * as arrays of full-line strings (markers stripped).
+ */
+function hunkSides(hunk) {
+    const oldLines = [];
+    const newLines = [];
+    for (const l of hunk.lines) {
+        if (l.startsWith('+')) {
+            newLines.push(l.slice(1));
+        }
+        else if (l.startsWith('-')) {
+            oldLines.push(l.slice(1));
+        }
+        else if (l.startsWith(' ')) {
+            oldLines.push(l.slice(1));
+            newLines.push(l.slice(1));
+        }
+        else if (l === '') {
+            // An empty line in the hunk body == a context blank line.
+            oldLines.push('');
+            newLines.push('');
+        }
+        else if (l === '\') {
+            // ignore the GNU no-newline marker
+        }
+        else {
+            // Unknown marker — treat as context to be conservative.
+            oldLines.push(l);
+            newLines.push(l);
+        }
+    }
+    return { oldLines, newLines };
+}
+/** Find the single index where `needle` matches `hay` exactly. */
+function findMatch(hay, needle, hunkIndex) {
+    if (needle.length === 0) {
+        // Pure-insertion hunk with no context — cannot anchor reliably. Reject.
+        throw new PatchApplyError(`hunk ${hunkIndex} has no context/removed lines to anchor against`, hunkIndex);
+    }
+    let found = -1;
+    for (let i = 0; i + needle.length <= hay.length; i++) {
+        let ok = true;
+        for (let j = 0; j < needle.length; j++) {
+            if (hay[i + j] !== needle[j]) {
+                ok = false;
+                break;
+            }
+        }
+        if (ok) {
+            if (found !== -1) {
+                throw new PatchApplyError(`hunk ${hunkIndex} context is ambiguous (matches at multiple locations)`, hunkIndex);
+            }
+            found = i;
+        }
+    }
+    if (found === -1) {
+        throw new PatchApplyError(`hunk ${hunkIndex} context did not match the current template`, hunkIndex);
+    }
+    return found;
+}
+/**
+ * Apply a unified-diff `patch` to `source` text, returning the new text.
+ *
+ * Atomic + strict: every hunk's context (+removed) side must match exactly once
+ * in the current text, else throw (no partial application). The trailing newline
+ * convention of `source` is preserved.
+ *
+ * Pure: no IO, no template writes.
+ */
+export function applyUnifiedDiff(source, patch) {
+    const hunks = parseHunks(patch);
+    if (hunks.length === 0) {
+        throw new PatchApplyError('patch contains no hunks');
+    }
+    const hadTrailingNewline = source.endsWith('\n');
+    // Work on lines WITHOUT the trailing empty element a trailing \n produces.
+    let lines = source.split('\n');
+    if (hadTrailingNewline)
+        lines = lines.slice(0, -1);
+    hunks.forEach((hunk, idx) => {
+        const hunkIndex = idx + 1;
+        const { oldLines, newLines } = hunkSides(hunk);
+        const at = findMatch(lines, oldLines, hunkIndex);
+        lines = [...lines.slice(0, at), ...newLines, ...lines.slice(at + oldLines.length)];
+    });
+    return hadTrailingNewline ? lines.join('\n') + '\n' : lines.join('\n');
+}
+/**
+ * Mechanically set the `version:` line inside the leading YAML frontmatter to
+ * `targetVersion`. The anchor-guard forbids the distiller from touching the
+ * version line; adoption bumps it here, deterministically. Returns the new text.
+ *
+ * Throws if no frontmatter `version:` line is found (the template invariant
+ * requires one). Pure.
+ */
+export function setFrontmatterVersion(template, targetVersion) {
+    const fenceEnd = template.indexOf('\n---', 4);
+    const head = fenceEnd > 0 ? template.slice(0, fenceEnd) : template;
+    if (!/^version:\s*[0-9]+\s*$/m.test(head)) {
+        throw new PatchApplyError('template has no frontmatter `version:` line to bump');
+    }
+    const headBumped = head.replace(/^version:\s*[0-9]+\s*$/m, `version: ${targetVersion}`);
+    return fenceEnd > 0 ? headBumped + template.slice(fenceEnd) : headBumped;
+}
+//# sourceMappingURL=agent-patch-apply.js.map

package/dist/core/insights/agent-patch-apply.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-patch-apply.js","sourceRoot":"","sources":["../../../src/core/insights/agent-patch-apply.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,MAAM,OAAO,eAAgB,SAAQ,KAAK;IACxC,2DAA2D;IAClD,SAAS,CAAgB;IAClC,YAAY,OAAe,EAAE,YAA2B,IAAI;QAC1D,KAAK,CAAC,uBAAuB,OAAO,EAAE,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;CACF;AAOD,6EAA6E;AAC7E,SAAS,UAAU,CAAC,KAAa;IAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,IAAI,OAAO,GAAgB,IAAI,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,wBAAwB;YACxB,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QACD,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YACrB,wEAAwE;YACxE,iEAAiE;YACjE,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;gBAAE,SAAS;YACjC,sDAAsD;YACtD,sDAAsD;YACtD,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;gBAAE,SAAS;YACpE,SAAS;QACX,CAAC;QACD,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,IAAU;IAC3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;aAAM,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YACpB,0DAA0D;YAC1D,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;aAAM,IAAI,CAAC,KAAK,8BAA8B,EAAE,CAAC;YAChD,mCAAmC;QACrC,CAAC;aAAM,CAAC;YACN,wDAAwD;YACxD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED,kEAAkE;AAClE,SAAS,SAAS,CAAC,GAAa,EAAE,MAAgB,EAAE,SAAiB;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,wEAAwE;QACxE,MAAM,IAAI,eAAe,CACvB,QAAQ,SAAS,iDAAiD,EAClE,SAAS,CACV,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7B,EAAE,GAAG,KAAK,CAAC;gBACX,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;gBACjB,MAAM,IAAI,eAAe,CACvB,QAAQ,SAAS,uDAAuD,EACxE,SAAS,CACV,CAAC;YACJ,CAAC;YACD,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;IACH,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACjB,MAAM,IAAI,eAAe,CACvB,QAAQ,SAAS,6CAA6C,EAC9D,SAAS,CACV,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,KAAa;IAC5D,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAChC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,eAAe,CAAC,yBAAyB,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,kBAAkB,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACjD,2EAA2E;IAC3E,IAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,kBAAkB;QAAE,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAEnD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;QAC1B,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC;QAC1B,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,EAAE,GAAG,SAAS,CAAC,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACjD,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,OAAO,kBAAkB,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACzE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,QAAgB,EAAE,aAAqB;IAC3E,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC9C,MAAM,IAAI,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACnE,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,MAAM,IAAI,eAAe,CAAC,qDAAqD,CAAC,CAAC;IACnF,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,yBAAyB,EAAE,YAAY,aAAa,EAAE,CAAC,CAAC;IACxF,OAAO,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;AAC3E,CAAC"}

package/dist/core/insights/agent-suggest.d.ts

@@ -0,0 +1,128 @@
+/**
+ * Agent suggestion ranker — the deterministic decision-end mirror of C1's
+ * `rankSkills` (decision c20c2d1f, C2).
+ *
+ * Given a task description's top skill matches plus read-only historical signals
+ * (agent×skill usefulness, agent health) and an optional coverage tier, produce a
+ * ranked, REASONED agent recommendation. Pure + deterministic — NO LLM, NO
+ * embedding, no DB access (the caller wires the storage signals). The LLM
+ * (decision-maker) treats the candidate set as input and makes the final call,
+ * exactly like C1's "ranker ranks, LLM picks 0-1".
+ *
+ * Four layered signals (spec §"skill→agent mapping"):
+ *   Signal 1 (primary)  — historical (agent×skill) actionable_rate via reason-prefix
+ *                         proxy key (agent_id is empirically all-NULL).
+ *   Signal 2 (tie-break) — agent health success_rate / delegations.
+ *   Signal 3 (cold-start)— a small nature→agent prior table when Signal 1 is
+ *                         under-sampled (the relocated governance §5 judgments,
+ *                         keyed on task NATURE not coverage).
+ *   Signal 4 (backstop)  — coverage demotion: coder→safety-net-implementer for a
+ *                         <50% module, applied only when a module tier is given.
+ *
+ * 不变量: READ-ONLY data transformer. Never mutates inputs, never touches the
+ * filesystem or DB, never spawns. The daemon never calls this.
+ */
+import { REASON_PREFIX_TO_AGENT } from './agent-health.js';
+import type { CoverageTier } from './coverage-tiers.js';
+/**
+ * The spawnable IMPLEMENTATION agent pool — the recommendation universe.
+ * Excludes pipeline roles (verify / decision) which are not "the agent to spawn
+ * for the work". Order is stable for deterministic alphabetical tie-breaks.
+ */
+export declare const IMPL_AGENT_POOL: readonly ["coder", "harness-debug-full", "planner", "safety-net-implementer"];
+export type ImplAgent = (typeof IMPL_AGENT_POOL)[number];
+/**
+ * Signal-3 cold-start prior — task NATURE → agent, relocated from the
+ * decision-maker.md Step 3 prose selection guide. Each nature carries the
+ * keywords that signal it (matched against the task tokens) and the agent it
+ * implies. NOT keyed on coverage — coverage enters only via Signal 4.
+ *
+ * Priority: when multiple natures match, the one with the most keyword hits wins;
+ * ties break by the array order below (most specific first). This is the
+ * irreducible floor that makes C2 ≈ the old guide before Signal-1 data accrues.
+ */
+export interface NaturePrior {
+    nature: string;
+    agent: ImplAgent;
+    keywords: string[];
+}
+export declare const NATURE_PRIOR_TABLE: readonly NaturePrior[];
+/** One skill match from rankSkills (C1). */
+export interface SkillMatchInput {
+    id: string;
+    score: number;
+}
+/** One (agent×skill) usefulness row from aggregateSkillUsefulnessByAgent. */
+export interface AgentSkillAffinityInput {
+    /** Reason-prefix proxy agent key (coder / safetynet / verify / ...). */
+    agent: string;
+    skill_id: string;
+    total_rated: number;
+    actionable_rate: number;
+}
+/** One agent-health row (subset of computeAgentHealth's AgentHealth). */
+export interface AgentHealthInput {
+    /** Canonical agent template name (already mapped from reason prefix). */
+    agent: string;
+    success_rate: number | null;
+    delegations: number;
+}
+export interface SuggestAgentsInput {
+    taskDesc: string;
+    /** Top skill matches for the task (from rankSkills). */
+    skillMatches: SkillMatchInput[];
+    /** (agent×skill) usefulness rows (from aggregateSkillUsefulnessByAgent). */
+    skillByAgent: AgentSkillAffinityInput[];
+    /** Per-agent health rows (from computeAgentHealth). */
+    agentHealth: AgentHealthInput[];
+    /** Resolved coverage tier for --module (Signal 4); omit → backstop skipped. */
+    moduleCoverageTier?: CoverageTier;
+    /** Module path (for the coverage_note text only). */
+    modulePath?: string;
+}
+export interface AgentCandidate {
+    agent: string;
+    score: number;
+    reasons: string[];
+    /** Set when Signal-4 demoted this candidate (e.g. "coder"). */
+    demoted_from?: string;
+    /** Confidence label driven by Signal-1 evidence sufficiency. */
+    confidence: 'data-backed' | 'nature-prior';
+}
+export interface AgentSuggestResult {
+    task: string;
+    candidates: AgentCandidate[];
+    coverage_note: string;
+}
+/**
+ * Compute the Signal-3 nature prior for a task: the best-matching nature→agent
+ * and the keyword hit count. Deterministic: most keyword hits wins, ties by
+ * NATURE_PRIOR_TABLE order. Returns the default new-feature agent with 0 hits
+ * when nothing matches.
+ */
+export declare function computeNaturePrior(taskDesc: string): {
+    agent: ImplAgent;
+    nature: string;
+    hits: number;
+};
+/**
+ * Apply the Signal-4 coverage backstop to a single candidate (pure). Demotes a
+ * `coder` recommendation to `safety-net-implementer` when the module tier is
+ * `low` (<50% lines). One-way safety filter — never promotes, never touches
+ * non-coder agents. Returns a (possibly) new candidate; never mutates input.
+ */
+export declare function applyCoverageBackstop(candidate: AgentCandidate, tier: CoverageTier | undefined, modulePath?: string): AgentCandidate;
+/**
+ * Rank implementation agents for a task. Pure + deterministic.
+ *
+ * Scoring口径 (per spec): for each agent in IMPL_AGENT_POOL,
+ *   score = Σ over skillMatches of (skillMatch.score × affinity) where
+ *     affinity = (agent,skill) actionable_rate when total_rated ≥ SUGGESTION_MIN_RATED
+ *                (Signal 1, data-backed),
+ *     else +1 for the agent picked by the nature prior (Signal 3, cold-start).
+ * Tie-break: success_rate desc → delegations desc → agent name asc (Signal 2 +
+ * determinism). Coverage backstop (Signal 4) is post-applied per candidate.
+ */
+export declare function suggestAgents(input: SuggestAgentsInput): AgentSuggestResult;
+export { REASON_PREFIX_TO_AGENT };
+//# sourceMappingURL=agent-suggest.d.ts.map

package/dist/core/insights/agent-suggest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-suggest.d.ts","sourceRoot":"","sources":["../../../src/core/insights/agent-suggest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EACL,sBAAsB,EAGvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAGxD;;;;GAIG;AACH,eAAO,MAAM,eAAe,+EAKlB,CAAC;AAEX,MAAM,MAAM,SAAS,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC;AAEzD;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,SAAS,CAAC;IACjB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,eAAO,MAAM,kBAAkB,EAAE,SAAS,WAAW,EA+BnD,CAAC;AAOH,4CAA4C;AAC5C,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;CACf;AAED,6EAA6E;AAC7E,MAAM,WAAW,uBAAuB;IACtC,wEAAwE;IACxE,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;CACzB;AAED,yEAAyE;AACzE,MAAM,WAAW,gBAAgB;IAC/B,yEAAyE;IACzE,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,wDAAwD;IACxD,YAAY,EAAE,eAAe,EAAE,CAAC;IAChC,4EAA4E;IAC5E,YAAY,EAAE,uBAAuB,EAAE,CAAC;IACxC,uDAAuD;IACvD,WAAW,EAAE,gBAAgB,EAAE,CAAC;IAChC,+EAA+E;IAC/E,kBAAkB,CAAC,EAAE,YAAY,CAAC;IAClC,qDAAqD;IACrD,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,+DAA+D;IAC/D,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,gEAAgE;IAChE,UAAU,EAAE,aAAa,GAAG,cAAc,CAAC;CAC5C;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,cAAc,EAAE,CAAC;IAC7B,aAAa,EAAE,MAAM,CAAC;CACvB;AAkBD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG;IAAE,KAAK,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAmBvG;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,SAAS,EAAE,cAAc,EACzB,IAAI,EAAE,YAAY,GAAG,SAAS,EAC9B,UAAU,CAAC,EAAE,MAAM,GAClB,cAAc,CAYhB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,kBAAkB,CAsF3E;AAwED,OAAO,EAAE,sBAAsB,EAAE,CAAC"}

package/dist/core/insights/agent-suggest.js

@@ -0,0 +1,284 @@
+/**
+ * Agent suggestion ranker — the deterministic decision-end mirror of C1's
+ * `rankSkills` (decision c20c2d1f, C2).
+ *
+ * Given a task description's top skill matches plus read-only historical signals
+ * (agent×skill usefulness, agent health) and an optional coverage tier, produce a
+ * ranked, REASONED agent recommendation. Pure + deterministic — NO LLM, NO
+ * embedding, no DB access (the caller wires the storage signals). The LLM
+ * (decision-maker) treats the candidate set as input and makes the final call,
+ * exactly like C1's "ranker ranks, LLM picks 0-1".
+ *
+ * Four layered signals (spec §"skill→agent mapping"):
+ *   Signal 1 (primary)  — historical (agent×skill) actionable_rate via reason-prefix
+ *                         proxy key (agent_id is empirically all-NULL).
+ *   Signal 2 (tie-break) — agent health success_rate / delegations.
+ *   Signal 3 (cold-start)— a small nature→agent prior table when Signal 1 is
+ *                         under-sampled (the relocated governance §5 judgments,
+ *                         keyed on task NATURE not coverage).
+ *   Signal 4 (backstop)  — coverage demotion: coder→safety-net-implementer for a
+ *                         <50% module, applied only when a module tier is given.
+ *
+ * 不变量: READ-ONLY data transformer. Never mutates inputs, never touches the
+ * filesystem or DB, never spawns. The daemon never calls this.
+ */
+import { REASON_PREFIX_TO_AGENT, agentForReasonPrefix, SUGGESTION_MIN_RATED, } from './agent-health.js';
+import { isLowCoverageTier } from './coverage-tiers.js';
+/**
+ * The spawnable IMPLEMENTATION agent pool — the recommendation universe.
+ * Excludes pipeline roles (verify / decision) which are not "the agent to spawn
+ * for the work". Order is stable for deterministic alphabetical tie-breaks.
+ */
+export const IMPL_AGENT_POOL = [
+    'coder',
+    'harness-debug-full',
+    'planner',
+    'safety-net-implementer',
+];
+export const NATURE_PRIOR_TABLE = Object.freeze([
+    // unknown / intermittent bug → harness-debug-full (check BEFORE plain "bug")
+    {
+        nature: 'unknown-bug',
+        agent: 'harness-debug-full',
+        keywords: ['intermittent', 'flaky', 'unknown', 'sometimes', 'heisenbug', 'race', '时好时坏', '偶发', '间歇'],
+    },
+    // known bug fix → safety-net-implementer (hotfix)
+    {
+        nature: 'bug',
+        agent: 'safety-net-implementer',
+        keywords: ['bug', 'fix', 'hotfix', 'broken', 'regression', 'null-deref', 'crash', 'defect', '修复', '报错'],
+    },
+    // refactor / restructure → safety-net-implementer (refactor)
+    {
+        nature: 'refactor',
+        agent: 'safety-net-implementer',
+        keywords: ['refactor', 'restructure', 'extract', 'rename', 'cleanup', 'reorganize', 'split', '重构', '拆分'],
+    },
+    // architecture planning → planner
+    {
+        nature: 'planning',
+        agent: 'planner',
+        keywords: ['plan', 'planning', 'architecture', 'design', 'roadmap', 'spec', 'scope', '规划', '设计'],
+    },
+    // new feature → coder (the default for additive work)
+    {
+        nature: 'new-feature',
+        agent: 'coder',
+        keywords: ['add', 'feature', 'new', 'implement', 'build', 'create', 'support', '新增', '功能', '实现'],
+    },
+]);
+/** Default new-feature fallback when no nature keyword matches at all. */
+const DEFAULT_NATURE_AGENT = 'coder';
+// ── Core口径 ────────────────────────────────────────────────────────────────
+/** Tokenize free text into lowercase alphanumeric (+CJK) tokens. Mirror C1. */
+function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[^a-z0-9一-鿿]+/u)
+        .filter((t) => t.length > 0);
+}
+/** Map a reason-prefix proxy key to a canonical template name, pool-filtered. */
+function canonicalImplAgent(reasonPrefix) {
+    const name = agentForReasonPrefix(reasonPrefix);
+    return IMPL_AGENT_POOL.includes(name) ? name : undefined;
+}
+/**
+ * Compute the Signal-3 nature prior for a task: the best-matching nature→agent
+ * and the keyword hit count. Deterministic: most keyword hits wins, ties by
+ * NATURE_PRIOR_TABLE order. Returns the default new-feature agent with 0 hits
+ * when nothing matches.
+ */
+export function computeNaturePrior(taskDesc) {
+    const tokens = new Set(tokenize(taskDesc));
+    let best;
+    for (const entry of NATURE_PRIOR_TABLE) {
+        let hits = 0;
+        for (const kw of entry.keywords) {
+            // keyword may itself be multi-token (rare) — count if any token overlaps.
+            for (const t of tokenize(kw)) {
+                if (tokens.has(t)) {
+                    hits += 1;
+                    break;
+                }
+            }
+        }
+        if (hits > 0 && (!best || hits > best.hits)) {
+            best = { agent: entry.agent, nature: entry.nature, hits };
+        }
+    }
+    return best ?? { agent: DEFAULT_NATURE_AGENT, nature: 'new-feature', hits: 0 };
+}
+/**
+ * Apply the Signal-4 coverage backstop to a single candidate (pure). Demotes a
+ * `coder` recommendation to `safety-net-implementer` when the module tier is
+ * `low` (<50% lines). One-way safety filter — never promotes, never touches
+ * non-coder agents. Returns a (possibly) new candidate; never mutates input.
+ */
+export function applyCoverageBackstop(candidate, tier, modulePath) {
+    if (candidate.agent !== 'coder' || !isLowCoverageTier(tier))
+        return candidate;
+    const where = modulePath ? ` (${modulePath} is <50% lines)` : ' (module is <50% lines)';
+    return {
+        ...candidate,
+        agent: 'safety-net-implementer',
+        demoted_from: 'coder',
+        reasons: [
+            ...candidate.reasons,
+            `coverage backstop: demoted coder → safety-net-implementer${where}`,
+        ],
+    };
+}
+/**
+ * Rank implementation agents for a task. Pure + deterministic.
+ *
+ * Scoring口径 (per spec): for each agent in IMPL_AGENT_POOL,
+ *   score = Σ over skillMatches of (skillMatch.score × affinity) where
+ *     affinity = (agent,skill) actionable_rate when total_rated ≥ SUGGESTION_MIN_RATED
+ *                (Signal 1, data-backed),
+ *     else +1 for the agent picked by the nature prior (Signal 3, cold-start).
+ * Tie-break: success_rate desc → delegations desc → agent name asc (Signal 2 +
+ * determinism). Coverage backstop (Signal 4) is post-applied per candidate.
+ */
+export function suggestAgents(input) {
+    const task = (input.taskDesc ?? '').trim();
+    // Index (agent×skill) affinity by `${agent}::${skill_id}` for fast lookup,
+    // keyed on the canonical impl-agent name (drops verify/decision/unknown).
+    const affinity = new Map();
+    for (const row of input.skillByAgent) {
+        const canon = canonicalImplAgent(row.agent);
+        if (!canon)
+            continue;
+        affinity.set(`${canon}::${row.skill_id}`, row);
+    }
+    const healthByAgent = new Map();
+    for (const h of input.agentHealth)
+        healthByAgent.set(h.agent, h);
+    const naturePrior = computeNaturePrior(task);
+    const candidates = [];
+    for (const agent of IMPL_AGENT_POOL) {
+        let score = 0;
+        const reasons = [];
+        let dataBacked = false;
+        for (const m of input.skillMatches) {
+            const aff = affinity.get(`${agent}::${m.id}`);
+            if (aff && aff.total_rated >= SUGGESTION_MIN_RATED) {
+                const contribution = m.score * aff.actionable_rate;
+                score += contribution;
+                dataBacked = true;
+                reasons.push(`Signal1: pulled ${m.id} with actionable_rate ${(aff.actionable_rate * 100).toFixed(0)}% ` +
+                    `(n=${aff.total_rated}) → +${contribution.toFixed(2)}`);
+            }
+        }
+        // Signal 3 — cold-start nature prior. Adds a small flat boost to the agent
+        // the task nature implies, so under-sampled tasks still rank sensibly.
+        if (agent === naturePrior.agent) {
+            score += 1;
+            reasons.push(naturePrior.hits > 0
+                ? `Signal3 (nature prior): task looks like "${naturePrior.nature}" → ${agent} → +1`
+                : `Signal3 (nature prior): no nature keyword matched → default new-feature → ${agent} → +1`);
+        }
+        const health = healthByAgent.get(agent);
+        if (health && health.success_rate !== null) {
+            reasons.push(`Signal2 (health): success_rate ${(health.success_rate * 100).toFixed(0)}% over ${health.delegations} delegations (tie-break)`);
+        }
+        candidates.push({
+            agent,
+            score: Math.round(score * 1000) / 1000,
+            reasons,
+            confidence: dataBacked ? 'data-backed' : 'nature-prior',
+        });
+    }
+    // Sort: score desc → success_rate desc → delegations desc → name asc.
+    candidates.sort((a, b) => {
+        if (b.score !== a.score)
+            return b.score - a.score;
+        const ha = healthByAgent.get(a.agent);
+        const hb = healthByAgent.get(b.agent);
+        const sra = ha?.success_rate ?? -1;
+        const srb = hb?.success_rate ?? -1;
+        if (srb !== sra)
+            return srb - sra;
+        const da = ha?.delegations ?? 0;
+        const db = hb?.delegations ?? 0;
+        if (db !== da)
+            return db - da;
+        return a.agent.localeCompare(b.agent);
+    });
+    // Signal 4 — coverage backstop, applied per candidate after ranking, then
+    // de-duplicated: a demoted coder collapses into the existing same-named entry
+    // (e.g. the pool's native safety-net-implementer) so no agent appears twice.
+    const tier = input.moduleCoverageTier;
+    const demoted = candidates.map((c) => applyCoverageBackstop(c, tier, input.modulePath));
+    const finalCandidates = dedupCandidates(demoted);
+    const coverage_note = buildCoverageNote(tier, input.modulePath);
+    return { task, candidates: finalCandidates, coverage_note };
+}
+/**
+ * Collapse candidates that share an agent name after the coverage backstop
+ * (a demoted coder lands on safety-net-implementer, which is already in the
+ * pool). Keeps the first-seen position (preserving the post-sort rank), merges
+ * into the higher-scored entry, and propagates `demoted_from` so the merged row
+ * still records the provenance. Display/dedup only — never changes ranking
+ * logic or demotion judgment. Pure: returns a new array.
+ */
+function dedupCandidates(candidates) {
+    const byAgent = new Map();
+    const order = [];
+    for (const c of candidates) {
+        const existing = byAgent.get(c.agent);
+        if (!existing) {
+            byAgent.set(c.agent, c);
+            order.push(c.agent);
+            continue;
+        }
+        // Merge: keep the higher score; preserve demotion provenance + its reasons
+        // from whichever entry actually carries the backstop, and keep a stable,
+        // de-duplicated union of reasons.
+        const winner = c.score > existing.score ? c : existing;
+        const loser = winner === c ? existing : c;
+        const merged = {
+            ...winner,
+            demoted_from: winner.demoted_from ?? loser.demoted_from,
+            reasons: dedupStrings([...winner.reasons, ...loser.reasons]),
+        };
+        byAgent.set(c.agent, merged);
+    }
+    return order.map((name) => byAgent.get(name));
+}
+/** Stable de-duplication of a string list (first occurrence wins). */
+function dedupStrings(items) {
+    const seen = new Set();
+    const out = [];
+    for (const s of items) {
+        if (!seen.has(s)) {
+            seen.add(s);
+            out.push(s);
+        }
+    }
+    return out;
+}
+/**
+ * Build the three-state coverage backstop note for display + --json:
+ *   ① no --module given       — backstop skipped entirely;
+ *   ② --module given, tier unknown — no matching coverage tier, no demotion;
+ *   ③ --module given, tier known   — inactive (≥50%) or ACTIVE (<50%) demotion.
+ * Text-only; mirrors the actual (unchanged) demotion behavior.
+ */
+function buildCoverageNote(tier, modulePath) {
+    const hasModule = !!(modulePath && modulePath.trim());
+    if (tier === undefined) {
+        // ② --module given but it resolved to no known coverage tier (no demotion).
+        if (hasModule) {
+            return `coverage backstop not applied: ${modulePath} given but no known coverage tier matched (no demotion)`;
+        }
+        // ① no --module given at all.
+        return 'coverage backstop not applied (no --module given)';
+    }
+    const where = modulePath ?? '<module>';
+    if (isLowCoverageTier(tier)) {
+        return `coverage backstop ACTIVE: ${where} is low (<50% lines) → coder demoted to safety-net-implementer`;
+    }
+    return `coverage backstop inactive: ${where} is ${tier} (≥50% lines) → coder allowed`;
+}
+export { REASON_PREFIX_TO_AGENT };
+//# sourceMappingURL=agent-suggest.js.map

package/dist/core/insights/agent-suggest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-suggest.js","sourceRoot":"","sources":["../../../src/core/insights/agent-suggest.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EACL,sBAAsB,EACtB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD;;;;GAIG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG;IAC7B,OAAO;IACP,oBAAoB;IACpB,SAAS;IACT,wBAAwB;CAChB,CAAC;AAoBX,MAAM,CAAC,MAAM,kBAAkB,GAA2B,MAAM,CAAC,MAAM,CAAC;IACtE,6EAA6E;IAC7E;QACE,MAAM,EAAE,aAAa;QACrB,KAAK,EAAE,oBAAoB;QAC3B,QAAQ,EAAE,CAAC,cAAc,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;KACrG;IACD,kDAAkD;IAClD;QACE,MAAM,EAAE,KAAK;QACb,KAAK,EAAE,wBAAwB;QAC/B,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC;KACxG;IACD,6DAA6D;IAC7D;QACE,MAAM,EAAE,UAAU;QAClB,KAAK,EAAE,wBAAwB;QAC/B,QAAQ,EAAE,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC;KACzG;IACD,kCAAkC;IAClC;QACE,MAAM,EAAE,UAAU;QAClB,KAAK,EAAE,SAAS;QAChB,QAAQ,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,cAAc,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC;KACjG;IACD,sDAAsD;IACtD;QACE,MAAM,EAAE,aAAa;QACrB,KAAK,EAAE,OAAO;QACd,QAAQ,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;KACjG;CACF,CAAC,CAAC;AAEH,0EAA0E;AAC1E,MAAM,oBAAoB,GAAc,OAAO,CAAC;AAyDhD,6EAA6E;AAE7E,+EAA+E;AAC/E,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,gBAAgB,CAAC;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,iFAAiF;AACjF,SAAS,kBAAkB,CAAC,YAAoB;IAC9C,MAAM,IAAI,GAAG,oBAAoB,CAAC,YAAY,CAAC,CAAC;IAChD,OAAQ,eAAqC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,IAAkB,CAAC,CAAC,CAAC,SAAS,CAAC;AACjG,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3C,IAAI,IAAoE,CAAC;IACzE,KAAK,MAAM,KAAK,IAAI,kBAAkB,EAAE,CAAC;QACvC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,0EAA0E;YAC1E,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,IAAI,IAAI,CAAC,CAAC;oBACV,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,IAAI,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,OAAO,IAAI,IAAI,EAAE,KAAK,EAAE,oBAAoB,EAAE,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;AACjF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACnC,SAAyB,EACzB,IAA8B,EAC9B,UAAmB;IAEnB,IAAI,SAAS,CAAC,KAAK,KAAK,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9E,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,iBAAiB,CAAC,CAAC,CAAC,yBAAyB,CAAC;IACxF,OAAO;QACL,GAAG,SAAS;QACZ,KAAK,EAAE,wBAAwB;QAC/B,YAAY,EAAE,OAAO;QACrB,OAAO,EAAE;YACP,GAAG,SAAS,CAAC,OAAO;YACpB,4DAA4D,KAAK,EAAE;SACpE;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAAC,KAAyB;IACrD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAE3C,2EAA2E;IAC3E,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmC,CAAC;IAC5D,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,KAAK,GAAG,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;IAED,MAAM,aAAa,GAAG,IAAI,GAAG,EAA4B,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,WAAW;QAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAEjE,MAAM,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAE7C,MAAM,UAAU,GAAqB,EAAE,CAAC;IACxC,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,UAAU,GAAG,KAAK,CAAC;QAEvB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9C,IAAI,GAAG,IAAI,GAAG,CAAC,WAAW,IAAI,oBAAoB,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,eAAe,CAAC;gBACnD,KAAK,IAAI,YAAY,CAAC;gBACtB,UAAU,GAAG,IAAI,CAAC;gBAClB,OAAO,CAAC,IAAI,CACV,mBAAmB,CAAC,CAAC,EAAE,yBAAyB,CAAC,GAAG,CAAC,eAAe,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;oBACxF,MAAM,GAAG,CAAC,WAAW,QAAQ,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CACzD,CAAC;YACJ,CAAC;QACH,CAAC;QAED,2EAA2E;QAC3E,uEAAuE;QACvE,IAAI,KAAK,KAAK,WAAW,CAAC,KAAK,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,CAAC;YACX,OAAO,CAAC,IAAI,CACV,WAAW,CAAC,IAAI,GAAG,CAAC;gBAClB,CAAC,CAAC,4CAA4C,WAAW,CAAC,MAAM,OAAO,KAAK,OAAO;gBACnF,CAAC,CAAC,6EAA6E,KAAK,OAAO,CAC9F,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,MAAM,IAAI,MAAM,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC;YAC3C,OAAO,CAAC,IAAI,CACV,kCAAkC,CAAC,MAAM,CAAC,YAAY,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,MAAM,CAAC,WAAW,0BAA0B,CAC/H,CAAC;QACJ,CAAC;QAED,UAAU,CAAC,IAAI,CAAC;YACd,KAAK;YACL,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI;YACtC,OAAO;YACP,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc;SACxD,CAAC,CAAC;IACL,CAAC;IAED,sEAAsE;IACtE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,EAAE,EAAE,YAAY,IAAI,CAAC,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,EAAE,EAAE,YAAY,IAAI,CAAC,CAAC,CAAC;QACnC,IAAI,GAAG,KAAK,GAAG;YAAE,OAAO,GAAG,GAAG,GAAG,CAAC;QAClC,MAAM,EAAE,GAAG,EAAE,EAAE,WAAW,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,EAAE,EAAE,WAAW,IAAI,CAAC,CAAC;QAChC,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC9B,OAAO,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,0EAA0E;IAC1E,8EAA8E;IAC9E,6EAA6E;IAC7E,MAAM,IAAI,GAAG,KAAK,CAAC,kBAAkB,CAAC;IACtC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,qBAAqB,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IACxF,MAAM,eAAe,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;IAEjD,MAAM,aAAa,GAAG,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAEhE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,eAAe,EAAE,aAAa,EAAE,CAAC;AAC9D,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,UAA4B;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0B,CAAC;IAClD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QACD,2EAA2E;QAC3E,yEAAyE;QACzE,kCAAkC;QAClC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QACvD,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAmB;YAC7B,GAAG,MAAM;YACT,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,KAAK,CAAC,YAAY;YACvD,OAAO,EAAE,YAAY,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;SAC7D,CAAC;QACF,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC;AACjD,CAAC;AAED,sEAAsE;AACtE,SAAS,YAAY,CAAC,KAAe;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAS,iBAAiB,CAAC,IAA8B,EAAE,UAAmB;IAC5E,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,UAAU,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACtD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,4EAA4E;QAC5E,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,kCAAkC,UAAU,yDAAyD,CAAC;QAC/G,CAAC;QACD,8BAA8B;QAC9B,OAAO,mDAAmD,CAAC;IAC7D,CAAC;IACD,MAAM,KAAK,GAAG,UAAU,IAAI,UAAU,CAAC;IACvC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5B,OAAO,6BAA6B,KAAK,gEAAgE,CAAC;IAC5G,CAAC;IACD,OAAO,+BAA+B,KAAK,OAAO,IAAI,+BAA+B,CAAC;AACxF,CAAC;AAED,OAAO,EAAE,sBAAsB,EAAE,CAAC"}

package/dist/core/insights/coverage-tiers.d.ts

@@ -0,0 +1,46 @@
+/**
+ * Module coverage tiers — the Signal-4 backstop source for `cf agent suggest`
+ * (decision c20c2d1f, C2).
+ *
+ * The CLAUDE.md「项目模块覆盖现状」table is human-readable prose, not machine
+ * parseable. This module relocates its *coverage tier* judgments into a small,
+ * coarse constant map keyed by top-level module directory, so the deterministic
+ * coverage demotion (荐 coder 但模块 <50% lines → 降级 safety-net-implementer)
+ * can run without parsing Markdown.
+ *
+ * ⚠️ MANUAL-SYNC CONVENTION (R2): this map is hand-maintained against the
+ * CLAUDE.md「项目模块覆盖现状」table (source of truth). When that table's真实
+ * line-coverage numbers move a module across the 50% line, update this map too.
+ * The same manual-sync convention the table itself already uses applies here
+ * until a `cf coverage` lint can auto-derive it (Open Q3). Keep the map COARSE
+ * (one tier per top-level module dir, not per file).
+ *
+ * Tier口径 (matches CLAUDE.md judgment threshold, 真实 line coverage):
+ *   - `low`  : < 50% lines  → coder recommendations get demoted (Signal 4)
+ *   - `mid`  : 50%–~75%     → no demotion (≥50% line clears the red line)
+ *   - `high` : > ~75% lines → no demotion
+ *
+ * Only `low` triggers the backstop. `mid`/`high` are distinguished for
+ * informativeness (the coverage_note) but behave identically for demotion.
+ */
+export type CoverageTier = 'high' | 'mid' | 'low';
+/**
+ * Module-path-prefix → coverage tier. Seeded 2026-06-15 from the CLAUDE.md
+ * 「项目模块覆盖现状」table (basis 2026-06-10 R8 + 2026-06-11 174f649a新模块行).
+ * Longest-prefix wins (see resolveCoverageTier), so a more specific subdir can
+ * override its parent (e.g. `src/daemon/handlers/` high vs `src/daemon/` low).
+ */
+export declare const MODULE_COVERAGE_TIERS: Readonly<Record<string, CoverageTier>>;
+/**
+ * Resolve a module path to its coverage tier by LONGEST-prefix match against
+ * MODULE_COVERAGE_TIERS. Returns `undefined` when no prefix matches (caller
+ * treats unknown as "no backstop applied" — never demotes on unknown).
+ *
+ * Pure + deterministic. Normalizes leading `./` and trims; matching is on the
+ * normalized path so both `src/cli/commands` and `src/cli/commands/agent.ts`
+ * resolve via the `src/cli/commands/` key.
+ */
+export declare function resolveCoverageTier(modulePath: string): CoverageTier | undefined;
+/** Whether a tier triggers the coder→safety-net coverage demotion (Signal 4). */
+export declare function isLowCoverageTier(tier: CoverageTier | undefined): boolean;
+//# sourceMappingURL=coverage-tiers.d.ts.map

package/dist/core/insights/coverage-tiers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage-tiers.d.ts","sourceRoot":"","sources":["../../../src/core/insights/coverage-tiers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,MAAM,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;AAElD;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CA4BvE,CAAC;AAEH;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS,CAahF;AAYD,iFAAiF;AACjF,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,OAAO,CAEzE"}