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

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.1",
+  "version": "0.19.0-alpha.11",
   "description": "CLI for the slowcook brewing harness",
   "license": "MIT",
   "author": "aminazar",
@@ -40,10 +40,10 @@
     "zod": "^3.23.8",
     "@slowcook-ai/core": "^0.13.0",
     "@slowcook-ai/stack-ts": "^0.9.9-alpha.0",
-    "@slowcook-ai/forge-github": "^0.12.0",
-    "@slowcook-ai/llm-anthropic": "^0.16.0-alpha.0",
     "@slowcook-ai/review-overlay": "^0.5.5",
-    "@slowcook-ai/recorder": "^0.9.1"
+    "@slowcook-ai/llm-anthropic": "^0.16.0-alpha.1",
+    "@slowcook-ai/recorder": "^0.9.1",
+    "@slowcook-ai/forge-github": "^0.12.0"
   },
   "publishConfig": {
     "access": "public"