@slowcook-ai/cli 0.19.0-alpha.0 → 0.19.0-alpha.11

package/dist/commands/recon/stale-stubs.d.ts

@@ -0,0 +1,62 @@
+/**
+ * 0.19.0-α.11 (#84) — stale-stub detector.
+ *
+ * Empirical finding from rewo reuse-scan 2026-05-07: 6 @slowcook-stub
+ * files survived from incomplete story-016/018 brews. They're not
+ * refactor candidates (reuse-scan misclassified them at 100% similar
+ * because they're literally the same template body); they're
+ * INCOMPLETE WORK markers that should escalate to PM after a grace
+ * period.
+ *
+ * This module: walk src/, find @slowcook-stub markers, age each via
+ * `git log --diff-filter=A` (first-add date), report stale ones
+ * + (optionally) escalate to PM via gh comment on the source issue.
+ *
+ * Pure helpers below; cli wiring in recon's --stub-scan flag.
+ */
+export interface StubFile {
+    /** Repo-relative path. */
+    path: string;
+    /** Story id extracted from the stub marker (e.g., "016", "018"). */
+    storyId: string | null;
+    /** ISO timestamp of the file's first-add commit. Null if git log
+     *  couldn't resolve (file isn't tracked, repo isn't a git repo,
+     *  etc.). */
+    firstAddedAt: string | null;
+    /** Age in days, computed against `now`. Null when firstAddedAt
+     *  is null. */
+    ageDays: number | null;
+    /** Classification: fresh < gracePeriod, stale ≥ gracePeriod. */
+    classification: "fresh" | "stale" | "unknown";
+}
+/**
+ * Detect a `@slowcook-stub` marker in file content + extract the
+ * story id when one is named alongside it. Pure: no IO.
+ *
+ * Patterns recognized:
+ *   `// @slowcook-stub story-016`     — explicit story id
+ *   `// @slowcook-stub`               — bare; storyId = null
+ *   `/* @slowcook-stub story-018 *\/` — block comment form
+ */
+export declare function detectStubMarker(content: string): {
+    isStub: boolean;
+    storyId: string | null;
+};
+/**
+ * Compute days between two ISO timestamps. Pure: no clock IO. Returns
+ * a non-negative number rounded to 1 decimal.
+ */
+export declare function daysBetween(earlierIso: string, laterIso: string): number;
+/**
+ * Classify a stub by age against a grace period. Pure.
+ *   ageDays === null      → "unknown"
+ *   ageDays < graceDays   → "fresh"
+ *   ageDays >= graceDays  → "stale"
+ */
+export declare function classifyStubAge(ageDays: number | null, graceDays: number): "fresh" | "stale" | "unknown";
+/**
+ * Synthesize a PM-actionable comment body for an overdue stub.
+ * Pure: no IO. Caller posts via gh.
+ */
+export declare function buildStaleStubComment(stub: StubFile, graceDays: number): string;
+//# sourceMappingURL=stale-stubs.d.ts.map

package/dist/commands/recon/stale-stubs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stale-stubs.d.ts","sourceRoot":"","sources":["../../../src/commands/recon/stale-stubs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,MAAM,WAAW,QAAQ;IACvB,0BAA0B;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,oEAAoE;IACpE,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB;;iBAEa;IACb,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B;mBACe;IACf,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,gEAAgE;IAChE,cAAc,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;CAC/C;AAED;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG;IAAE,MAAM,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,CAK7F;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAMxE;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,IAAI,EACtB,SAAS,EAAE,MAAM,GAChB,OAAO,GAAG,OAAO,GAAG,SAAS,CAI/B;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAgB/E"}

package/dist/commands/recon/stale-stubs.js

@@ -0,0 +1,79 @@
+/**
+ * 0.19.0-α.11 (#84) — stale-stub detector.
+ *
+ * Empirical finding from rewo reuse-scan 2026-05-07: 6 @slowcook-stub
+ * files survived from incomplete story-016/018 brews. They're not
+ * refactor candidates (reuse-scan misclassified them at 100% similar
+ * because they're literally the same template body); they're
+ * INCOMPLETE WORK markers that should escalate to PM after a grace
+ * period.
+ *
+ * This module: walk src/, find @slowcook-stub markers, age each via
+ * `git log --diff-filter=A` (first-add date), report stale ones
+ * + (optionally) escalate to PM via gh comment on the source issue.
+ *
+ * Pure helpers below; cli wiring in recon's --stub-scan flag.
+ */
+/**
+ * Detect a `@slowcook-stub` marker in file content + extract the
+ * story id when one is named alongside it. Pure: no IO.
+ *
+ * Patterns recognized:
+ *   `// @slowcook-stub story-016`     — explicit story id
+ *   `// @slowcook-stub`               — bare; storyId = null
+ *   `/* @slowcook-stub story-018 *\/` — block comment form
+ */
+export function detectStubMarker(content) {
+    const head = content.slice(0, 500);
+    if (!head.includes("@slowcook-stub"))
+        return { isStub: false, storyId: null };
+    const m = head.match(/@slowcook-stub\s+story-(\d+)/);
+    return { isStub: true, storyId: m ? m[1] : null };
+}
+/**
+ * Compute days between two ISO timestamps. Pure: no clock IO. Returns
+ * a non-negative number rounded to 1 decimal.
+ */
+export function daysBetween(earlierIso, laterIso) {
+    const a = new Date(earlierIso).getTime();
+    const b = new Date(laterIso).getTime();
+    if (Number.isNaN(a) || Number.isNaN(b))
+        return 0;
+    const ms = Math.max(0, b - a);
+    return Math.round((ms / (1000 * 60 * 60 * 24)) * 10) / 10;
+}
+/**
+ * Classify a stub by age against a grace period. Pure.
+ *   ageDays === null      → "unknown"
+ *   ageDays < graceDays   → "fresh"
+ *   ageDays >= graceDays  → "stale"
+ */
+export function classifyStubAge(ageDays, graceDays) {
+    if (ageDays === null)
+        return "unknown";
+    if (ageDays < graceDays)
+        return "fresh";
+    return "stale";
+}
+/**
+ * Synthesize a PM-actionable comment body for an overdue stub.
+ * Pure: no IO. Caller posts via gh.
+ */
+export function buildStaleStubComment(stub, graceDays) {
+    const lines = [];
+    lines.push(`### slowcook · stub still incomplete after ${graceDays} days`);
+    lines.push("");
+    lines.push(`A \`@slowcook-stub\` marker still exists at \`${stub.path}\`${stub.firstAddedAt ? ` (added ${stub.ageDays} day(s) ago — ${stub.firstAddedAt.slice(0, 10)})` : ""}.`);
+    lines.push("");
+    lines.push("This means a brew never converged on this file — it's a placeholder that throws at runtime / returns a 501 stub response. The story it belongs to is incomplete.");
+    lines.push("");
+    lines.push("**PM action**: choose one:");
+    lines.push("");
+    lines.push("1. **Re-dispatch brew** for the story. The stub will be replaced.");
+    lines.push("2. **Hand-write the implementation** if brew can't converge after multiple attempts.");
+    lines.push("3. **Withdraw the story** if the feature is no longer wanted — close the issue + delete the stub file.");
+    lines.push("");
+    lines.push(`<sub>Posted by \`slowcook recon --stub-scan\`. Re-running this scan will re-post if the stub is still here in another ${graceDays} days.</sub>`);
+    return lines.join("\n");
+}
+//# sourceMappingURL=stale-stubs.js.map

package/dist/commands/recon/stale-stubs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stale-stubs.js","sourceRoot":"","sources":["../../../src/commands/recon/stale-stubs.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAkBH;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAe;IAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACnC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACrD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,UAAkB,EAAE,QAAgB;IAC9D,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;IACzC,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;IACvC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;AAC5D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAC7B,OAAsB,EACtB,SAAiB;IAEjB,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACvC,IAAI,OAAO,GAAG,SAAS;QAAE,OAAO,OAAO,CAAC;IACxC,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAc,EAAE,SAAiB;IACrE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,8CAA8C,SAAS,OAAO,CAAC,CAAC;IAC3E,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,iDAAiD,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,OAAO,iBAAiB,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACjL,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,kKAAkK,CAAC,CAAC;IAC/K,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IACzC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;IAChF,KAAK,CAAC,IAAI,CAAC,sFAAsF,CAAC,CAAC;IACnG,KAAK,CAAC,IAAI,CAAC,wGAAwG,CAAC,CAAC;IACrH,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,yHAAyH,SAAS,cAAc,CAAC,CAAC;IAC7J,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/commands/refactor/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * `slowcook refactor` — α.7 (#64).
+ *
+ * Reads candidate refactor proposals from
+ *   .brewing/refactor/proposals.json
+ * Filters by --scope patterns, ranks by benefit/cost, prints a table.
+ *
+ * α.7 ships ranking + reporting only. LLM-backed proposal generation
+ * + auto-application land in later alphas. This command's job today
+ * is to give the architecture room: any proposer (hand-authored
+ * JSON, recon emissions, future LLM agent) drops files into the
+ * standard input path + this command consumes them.
+ */
+export declare function refactor(argv: string[], _cliVersion: string): Promise<void>;
+//# sourceMappingURL=index.d.ts.map

package/dist/commands/refactor/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/commands/refactor/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAoEH,wBAAsB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CA2CjF"}

package/dist/commands/refactor/index.js

@@ -0,0 +1,126 @@
+/**
+ * `slowcook refactor` — α.7 (#64).
+ *
+ * Reads candidate refactor proposals from
+ *   .brewing/refactor/proposals.json
+ * Filters by --scope patterns, ranks by benefit/cost, prints a table.
+ *
+ * α.7 ships ranking + reporting only. LLM-backed proposal generation
+ * + auto-application land in later alphas. This command's job today
+ * is to give the architecture room: any proposer (hand-authored
+ * JSON, recon emissions, future LLM agent) drops files into the
+ * standard input path + this command consumes them.
+ */
+import { existsSync, readFileSync } from "node:fs";
+import { join } from "node:path";
+import { filterProposalsByScope, rankProposals } from "./score.js";
+function parseArgs(argv) {
+    const args = {
+        repoRoot: process.cwd(),
+        proposalsPath: ".brewing/refactor/proposals.json",
+        scope: [],
+        json: false,
+        limit: 0,
+    };
+    for (let i = 0; i < argv.length; i++) {
+        const a = argv[i];
+        const next = argv[i + 1];
+        if (a === "--cwd" && next) {
+            args.repoRoot = next;
+            i++;
+        }
+        else if (a === "--proposals" && next) {
+            args.proposalsPath = next;
+            i++;
+        }
+        else if (a === "--scope" && next) {
+            args.scope.push(next);
+            i++;
+        }
+        else if (a === "--json") {
+            args.json = true;
+        }
+        else if (a === "--limit" && next) {
+            args.limit = parseInt(next, 10);
+            i++;
+        }
+        else if (a === "--help" || a === "-h") {
+            printHelp();
+            process.exit(0);
+        }
+    }
+    return args;
+}
+function printHelp() {
+    console.log(`
+slowcook refactor — rank refactor proposals by benefit/cost (cli α.7)
+
+Reads .brewing/refactor/proposals.json (an array of RefactorProposal),
+filters by --scope, ranks by benefit-per-cost (descending), prints
+a table or JSON.
+
+Usage:
+  slowcook refactor [options]
+
+Options:
+  --cwd <path>          Repo root (default: cwd).
+  --proposals <path>    Proposals JSON path (default: .brewing/refactor/proposals.json).
+  --scope <pattern>     Repeatable. Glob-ish patterns; proposal must
+                        have ALL filesAffected match at least one. Examples:
+                          --scope src/**
+                          --scope src/components/*
+                          --scope src/lib/
+  --limit <n>           Show top N. Default 0 = all.
+  --json                Emit JSON (default: human-readable table).
+
+Proposal shape (RefactorProposal):
+  { id, title, rationale, filesAffected[], estimatedLocDelta,
+    estimatedValueScore, evidence? }
+
+Cost = |estimatedLocDelta| × filesAffected.length, clamped ≥1.
+Benefit = estimatedValueScore (caller-supplied 0-10).
+Ranking key = benefit / cost.
+`);
+}
+export async function refactor(argv, _cliVersion) {
+    const args = parseArgs(argv);
+    const abs = join(args.repoRoot, args.proposalsPath);
+    if (!existsSync(abs)) {
+        console.error(`No proposals file at ${args.proposalsPath} (cwd=${args.repoRoot}).`);
+        console.error(`Drop a JSON array of RefactorProposal there. See \`slowcook refactor --help\`.`);
+        process.exit(2);
+    }
+    let proposals;
+    try {
+        const raw = readFileSync(abs, "utf8");
+        proposals = JSON.parse(raw);
+        if (!Array.isArray(proposals))
+            throw new Error("proposals JSON must be an array");
+    }
+    catch (e) {
+        console.error(`Could not parse ${args.proposalsPath}: ${e.message}`);
+        process.exit(2);
+    }
+    const filtered = filterProposalsByScope(proposals, args.scope);
+    const ranked = rankProposals(filtered);
+    const out = args.limit > 0 ? ranked.slice(0, args.limit) : ranked;
+    if (args.json) {
+        console.log(JSON.stringify(out, null, 2));
+        return;
+    }
+    console.log(`slowcook refactor · ${proposals.length} proposal(s) · ${filtered.length} after scope filter`);
+    if (args.scope.length > 0) {
+        console.log(`  scope: ${args.scope.join(", ")}`);
+    }
+    console.log();
+    if (out.length === 0) {
+        console.log("(no proposals to rank)");
+        return;
+    }
+    for (const r of out) {
+        const a = r.assessment;
+        console.log(`  ${r.proposal.id}  benefit/cost=${a.benefitPerCost.toFixed(3)}  benefit=${a.benefitScore}  cost=${a.costScore}  files=${r.proposal.filesAffected.length}`);
+        console.log(`    ${r.proposal.title}`);
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/commands/refactor/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/commands/refactor/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,sBAAsB,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAWnE,SAAS,SAAS,CAAC,IAAc;IAC/B,MAAM,IAAI,GAAS;QACjB,QAAQ,EAAE,OAAO,CAAC,GAAG,EAAE;QACvB,aAAa,EAAE,kCAAkC;QACjD,KAAK,EAAE,EAAE;QACT,IAAI,EAAE,KAAK;QACX,KAAK,EAAE,CAAC;KACT,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,OAAO,IAAI,IAAI,EAAE,CAAC;YAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YAAC,CAAC,EAAE,CAAC;QAAC,CAAC;aACpD,IAAI,CAAC,KAAK,aAAa,IAAI,IAAI,EAAE,CAAC;YAAC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;YAAC,CAAC,EAAE,CAAC;QAAC,CAAC;aACpE,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAAC,CAAC,EAAE,CAAC;QAAC,CAAC;aAC5D,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;YAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAAC,CAAC;aACzC,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAAC,CAAC,EAAE,CAAC;QAAC,CAAC;aACtE,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YAAC,SAAS,EAAE,CAAC;YAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IAC1E,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS;IAChB,OAAO,CAAC,GAAG,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA4Bb,CAAC,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAc,EAAE,WAAmB;IAChE,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IACpD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,KAAK,CAAC,wBAAwB,IAAI,CAAC,aAAa,SAAS,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACpF,OAAO,CAAC,KAAK,CAAC,gFAAgF,CAAC,CAAC;QAChG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,SAA6B,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACtC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAuB,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACpF,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,KAAK,CAAC,mBAAmB,IAAI,CAAC,aAAa,KAAM,CAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QAChF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,QAAQ,GAAG,sBAAsB,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAElE,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,OAAO;IACT,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,uBAAuB,SAAS,CAAC,MAAM,kBAAkB,QAAQ,CAAC,MAAM,qBAAqB,CAAC,CAAC;IAC3G,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,YAAY,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,CAAC,GAAG,EAAE,CAAC;IACd,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;QACtC,OAAO;IACT,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC;QACvB,OAAO,CAAC,GAAG,CACT,KAAK,CAAC,CAAC,QAAQ,CAAC,EAAE,kBAAkB,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC,SAAS,WAAW,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,EAAE,CAC5J,CAAC;QACF,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IACzC,CAAC;AACH,CAAC"}

package/dist/commands/refactor/score.d.ts

@@ -0,0 +1,38 @@
+/**
+ * 0.19.0-alpha.7 (#64) — pure scoring + filtering helpers for the
+ * refactor command. No IO; testable in isolation.
+ */
+import type { ProposalAssessment, RefactorProposal } from "./types.js";
+/**
+ * Compute the cost / benefit / benefit-per-cost numbers for one
+ * proposal. Cost is `abs(estimatedLocDelta) * filesAffected.length`
+ * (clamped to ≥1 so the ratio is finite for zero-cost edge cases).
+ */
+export declare function assessProposal(p: RefactorProposal): ProposalAssessment;
+/**
+ * Match a single file path against a glob-ish scope pattern. Supports:
+ *   - exact match: "src/foo.ts"
+ *   - directory prefix: "src/" (matches anything under src/)
+ *   - star at the end: "src/components/*" (one segment after)
+ *   - double-star: "src/**" (any depth)
+ *
+ * Pure regex translation; no fs lookup.
+ */
+export declare function matchesScope(filePath: string, pattern: string): boolean;
+/**
+ * Filter proposals to those whose `filesAffected` ALL match at least
+ * one scope pattern. A proposal that touches even one out-of-scope
+ * file is excluded entirely (boundedness rule — refactors stay
+ * surgical).
+ */
+export declare function filterProposalsByScope(proposals: RefactorProposal[], scope: string[]): RefactorProposal[];
+/**
+ * Rank a list of proposals by benefit-per-cost (descending). Returns
+ * a NEW array of [proposal, assessment] pairs; doesn't mutate input.
+ * Stable for ties (preserves original order).
+ */
+export declare function rankProposals(proposals: RefactorProposal[]): Array<{
+    proposal: RefactorProposal;
+    assessment: ProposalAssessment;
+}>;
+//# sourceMappingURL=score.d.ts.map

package/dist/commands/refactor/score.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"score.d.ts","sourceRoot":"","sources":["../../../src/commands/refactor/score.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAEvE;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,gBAAgB,GAAG,kBAAkB,CAWtE;AAED;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAevE;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,SAAS,EAAE,gBAAgB,EAAE,EAC7B,KAAK,EAAE,MAAM,EAAE,GACd,gBAAgB,EAAE,CAKpB;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,SAAS,EAAE,gBAAgB,EAAE,GAC5B,KAAK,CAAC;IAAE,QAAQ,EAAE,gBAAgB,CAAC;IAAC,UAAU,EAAE,kBAAkB,CAAA;CAAE,CAAC,CAYvE"}

package/dist/commands/refactor/score.js

@@ -0,0 +1,79 @@
+/**
+ * 0.19.0-alpha.7 (#64) — pure scoring + filtering helpers for the
+ * refactor command. No IO; testable in isolation.
+ */
+/**
+ * Compute the cost / benefit / benefit-per-cost numbers for one
+ * proposal. Cost is `abs(estimatedLocDelta) * filesAffected.length`
+ * (clamped to ≥1 so the ratio is finite for zero-cost edge cases).
+ */
+export function assessProposal(p) {
+    const fileCount = p.filesAffected.length || 0;
+    const rawCost = Math.abs(p.estimatedLocDelta) * Math.max(1, fileCount);
+    const cost = Math.max(1, rawCost);
+    const benefit = p.estimatedValueScore;
+    return {
+        proposalId: p.id,
+        costScore: cost,
+        benefitScore: benefit,
+        benefitPerCost: benefit / cost,
+    };
+}
+/**
+ * Match a single file path against a glob-ish scope pattern. Supports:
+ *   - exact match: "src/foo.ts"
+ *   - directory prefix: "src/" (matches anything under src/)
+ *   - star at the end: "src/components/*" (one segment after)
+ *   - double-star: "src/**" (any depth)
+ *
+ * Pure regex translation; no fs lookup.
+ */
+export function matchesScope(filePath, pattern) {
+    if (pattern === filePath)
+        return true;
+    if (pattern.endsWith("/")) {
+        return filePath.startsWith(pattern);
+    }
+    if (pattern.endsWith("/**")) {
+        return filePath.startsWith(pattern.slice(0, -3) + "/") || filePath === pattern.slice(0, -3);
+    }
+    if (pattern.endsWith("/*")) {
+        const dir = pattern.slice(0, -2);
+        if (!filePath.startsWith(dir + "/"))
+            return false;
+        const rest = filePath.slice(dir.length + 1);
+        return !rest.includes("/");
+    }
+    return false;
+}
+/**
+ * Filter proposals to those whose `filesAffected` ALL match at least
+ * one scope pattern. A proposal that touches even one out-of-scope
+ * file is excluded entirely (boundedness rule — refactors stay
+ * surgical).
+ */
+export function filterProposalsByScope(proposals, scope) {
+    if (scope.length === 0)
+        return proposals.slice();
+    return proposals.filter((p) => p.filesAffected.every((f) => scope.some((pat) => matchesScope(f, pat))));
+}
+/**
+ * Rank a list of proposals by benefit-per-cost (descending). Returns
+ * a NEW array of [proposal, assessment] pairs; doesn't mutate input.
+ * Stable for ties (preserves original order).
+ */
+export function rankProposals(proposals) {
+    const indexed = proposals.map((p, i) => ({
+        proposal: p,
+        assessment: assessProposal(p),
+        origIndex: i,
+    }));
+    indexed.sort((a, b) => {
+        const diff = b.assessment.benefitPerCost - a.assessment.benefitPerCost;
+        if (diff !== 0)
+            return diff;
+        return a.origIndex - b.origIndex; // stable
+    });
+    return indexed.map(({ proposal, assessment }) => ({ proposal, assessment }));
+}
+//# sourceMappingURL=score.js.map

package/dist/commands/refactor/score.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"score.js","sourceRoot":"","sources":["../../../src/commands/refactor/score.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,CAAmB;IAChD,MAAM,SAAS,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACvE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,CAAC,CAAC,mBAAmB,CAAC;IACtC,OAAO;QACL,UAAU,EAAE,CAAC,CAAC,EAAE;QAChB,SAAS,EAAE,IAAI;QACf,YAAY,EAAE,OAAO;QACrB,cAAc,EAAE,OAAO,GAAG,IAAI;KAC/B,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,QAAgB,EAAE,OAAe;IAC5D,IAAI,OAAO,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACtC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,QAAQ,KAAK,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,GAAG,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,SAA6B,EAC7B,KAAe;IAEf,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IACjD,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC5B,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CACxE,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,SAA6B;IAE7B,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvC,QAAQ,EAAE,CAAC;QACX,UAAU,EAAE,cAAc,CAAC,CAAC,CAAC;QAC7B,SAAS,EAAE,CAAC;KACb,CAAC,CAAC,CAAC;IACJ,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,cAAc,GAAG,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC;QACvE,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5B,OAAO,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS;IAC7C,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;AAC/E,CAAC"}

package/dist/commands/refactor/types.d.ts

@@ -0,0 +1,64 @@
+/**
+ * 0.19.0-alpha.7 (#64) — refactor command data shapes.
+ *
+ * The refactor command takes a list of candidate refactors (proposals)
+ * + computes per-proposal cost/benefit, filters by codebase scope,
+ * and ranks them. Proposals come from a source the cli treats as
+ * opaque today — could be hand-authored JSON, recon emissions, or a
+ * future LLM proposer agent. The scoring + filtering logic stays
+ * separate so any source feeds into the same ranking.
+ *
+ * Goals:
+ *   - Boundedness: caller specifies scope (e.g. `src/components/**`)
+ *     so refactors don't sprawl across the repo.
+ *   - Cheapness-first: prefer high-value low-cost proposals; defer
+ *     expensive ones until they pay back.
+ *   - Auditability: each proposal carries a rationale + estimated
+ *     deltas so the cli can show its work + a PM can sanity-check.
+ *
+ * Out of scope for α.7 (deferred):
+ *   - LLM-backed proposer that READS the codebase + suggests
+ *     refactors. The pure ranking layer ships first; proposer comes
+ *     when the data shape has settled empirically.
+ *   - Auto-application. α.7 ranks + reports; a future α may apply.
+ */
+/**
+ * A single candidate refactor. The cli treats `id` as opaque (caller
+ * picks; e.g., a slug or hash). `filesAffected` is canonical (no
+ * globs in the proposal itself — globs live in scope filters).
+ */
+export interface RefactorProposal {
+    /** Stable identifier, caller-chosen. */
+    id: string;
+    /** One-line summary (≤120 chars). Shown in ranked output. */
+    title: string;
+    /** What the refactor changes + WHY it's worth doing. */
+    rationale: string;
+    /** Concrete file paths the refactor would touch. Repo-relative. */
+    filesAffected: string[];
+    /** Net lines changed estimate (added - removed). Negative is fine
+     *  (refactors that reduce LOC are usually high-value). */
+    estimatedLocDelta: number;
+    /** Subjective value score, 0-10. Caller's job to populate. */
+    estimatedValueScore: number;
+    /** Optional: external value signals (e.g., dup-count eliminated,
+     *  cyclomatic-complexity drop). Surface-only; no scoring weight
+     *  applied unless the caller folds them into estimatedValueScore. */
+    evidence?: Record<string, number | string>;
+}
+/**
+ * The cost/benefit assessment of a single proposal. Pure: derived
+ * from the proposal alone (no IO).
+ */
+export interface ProposalAssessment {
+    proposalId: string;
+    /** Cost: |estimatedLocDelta| × number of files (handwave, but
+     *  monotonic with reviewer effort). Higher = more expensive. */
+    costScore: number;
+    /** Benefit: estimatedValueScore as-is. */
+    benefitScore: number;
+    /** Ratio: benefit / max(cost, 1). Higher = better return per unit
+     *  effort. Used as the default ranking key. */
+    benefitPerCost: number;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/commands/refactor/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/commands/refactor/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH;;;;GAIG;AACH,MAAM,WAAW,gBAAgB;IAC/B,wCAAwC;IACxC,EAAE,EAAE,MAAM,CAAC;IACX,6DAA6D;IAC7D,KAAK,EAAE,MAAM,CAAC;IACd,wDAAwD;IACxD,SAAS,EAAE,MAAM,CAAC;IAClB,mEAAmE;IACnE,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB;8DAC0D;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IAC1B,8DAA8D;IAC9D,mBAAmB,EAAE,MAAM,CAAC;IAC5B;;yEAEqE;IACrE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;CAC5C;AAED;;;GAGG;AACH,MAAM,WAAW,kBAAkB;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB;oEACgE;IAChE,SAAS,EAAE,MAAM,CAAC;IAClB,0CAA0C;IAC1C,YAAY,EAAE,MAAM,CAAC;IACrB;mDAC+C;IAC/C,cAAc,EAAE,MAAM,CAAC;CACxB"}

package/dist/commands/refactor/types.js

@@ -0,0 +1,26 @@
+/**
+ * 0.19.0-alpha.7 (#64) — refactor command data shapes.
+ *
+ * The refactor command takes a list of candidate refactors (proposals)
+ * + computes per-proposal cost/benefit, filters by codebase scope,
+ * and ranks them. Proposals come from a source the cli treats as
+ * opaque today — could be hand-authored JSON, recon emissions, or a
+ * future LLM proposer agent. The scoring + filtering logic stays
+ * separate so any source feeds into the same ranking.
+ *
+ * Goals:
+ *   - Boundedness: caller specifies scope (e.g. `src/components/**`)
+ *     so refactors don't sprawl across the repo.
+ *   - Cheapness-first: prefer high-value low-cost proposals; defer
+ *     expensive ones until they pay back.
+ *   - Auditability: each proposal carries a rationale + estimated
+ *     deltas so the cli can show its work + a PM can sanity-check.
+ *
+ * Out of scope for α.7 (deferred):
+ *   - LLM-backed proposer that READS the codebase + suggests
+ *     refactors. The pure ranking layer ships first; proposer comes
+ *     when the data shape has settled empirically.
+ *   - Auto-application. α.7 ranks + reports; a future α may apply.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/commands/refactor/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/commands/refactor/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@slowcook-ai/cli",
-  "version": "0.19.0-alpha.0",
+  "version": "0.19.0-alpha.11",
   "description": "CLI for the slowcook brewing harness",
   "license": "MIT",
   "author": "aminazar",
@@ -40,9 +40,9 @@
     "zod": "^3.23.8",
     "@slowcook-ai/core": "^0.13.0",
     "@slowcook-ai/stack-ts": "^0.9.9-alpha.0",
-    "@slowcook-ai/llm-anthropic": "^0.16.0-alpha.0",
-    "@slowcook-ai/recorder": "^0.9.1",
     "@slowcook-ai/review-overlay": "^0.5.5",
+    "@slowcook-ai/llm-anthropic": "^0.16.0-alpha.1",
+    "@slowcook-ai/recorder": "^0.9.1",
     "@slowcook-ai/forge-github": "^0.12.0"
   },
   "publishConfig": {