@n-dx/core 0.1.0

package/packages/rex/dist/cli/commands/chunked-review.d.ts

@@ -0,0 +1,21 @@
+import type { Proposal } from "../../analyze/index.js";
+export { type GranularityAdjustmentRecord, type ChunkReviewState, type ChunkAction, type GranularityRequest, type BatchAcceptanceRecord, type GranularityHandler, type AssessmentHandler, type ModificationHandler, type ProposalAssessment, createReviewState, getCurrentChunk, formatPaginationHeader, formatChunk, formatActionMenu, buildPrompt, parseChunkInput, applyAction, replaceProposals, getAcceptedProposals, getRemainingProposals, buildBatchRecord, formatBatchSummary, } from "./chunked-review-state.js";
+import type { GranularityHandler, AssessmentHandler, ModificationHandler, BatchAcceptanceRecord } from "./chunked-review-state.js";
+/**
+ * Run the interactive chunked review loop.
+ * Returns the proposals the user accepted (may be empty) and a batch record.
+ *
+ * When `onGranularityAdjust` is provided, the review loop supports `b#` (break down)
+ * and `c#` (consolidate) commands that invoke the LLM to adjust proposal granularity.
+ *
+ * When `onAssess` is provided, the review loop supports `g` (assess) command
+ * that invokes the LLM to evaluate proposal granularity and display recommendations.
+ *
+ * When `onModify` is provided, the review loop supports natural language modification
+ * requests that invoke the LLM to revise proposals based on the user's free-form input.
+ */
+export declare function runChunkedReview(proposals: Proposal[], chunkSize?: number, onGranularityAdjust?: GranularityHandler, onAssess?: AssessmentHandler, onModify?: ModificationHandler, thresholdWeeks?: number): Promise<{
+    accepted: Proposal[];
+    remaining: Proposal[];
+    batchRecord: BatchAcceptanceRecord;
+}>;

package/packages/rex/dist/cli/commands/chunked-review.js

@@ -0,0 +1,147 @@
+import { createInterface } from "node:readline";
+import { info } from "../output.js";
+// Re-export all pure logic and types from the state module.
+// This preserves the existing public API — all consumers can continue
+// importing from "chunked-review.js" without changes.
+export { 
+// Pure functions
+createReviewState, getCurrentChunk, formatPaginationHeader, formatChunk, formatActionMenu, buildPrompt, parseChunkInput, applyAction, replaceProposals, getAcceptedProposals, getRemainingProposals, buildBatchRecord, formatBatchSummary, } from "./chunked-review-state.js";
+import { createReviewState, formatPaginationHeader, formatChunk, formatActionMenu, buildPrompt, parseChunkInput, applyAction, replaceProposals, getAcceptedProposals, getRemainingProposals, buildBatchRecord, formatBatchSummary, } from "./chunked-review-state.js";
+// ─── Interactive I/O (thin wrapper) ──────────────────────────────────
+function promptLine(question) {
+    const rl = createInterface({ input: process.stdin, output: process.stdout });
+    return new Promise((resolve) => {
+        rl.question(question, (answer) => {
+            rl.close();
+            resolve(answer.trim());
+        });
+    });
+}
+/**
+ * Run the interactive chunked review loop.
+ * Returns the proposals the user accepted (may be empty) and a batch record.
+ *
+ * When `onGranularityAdjust` is provided, the review loop supports `b#` (break down)
+ * and `c#` (consolidate) commands that invoke the LLM to adjust proposal granularity.
+ *
+ * When `onAssess` is provided, the review loop supports `g` (assess) command
+ * that invokes the LLM to evaluate proposal granularity and display recommendations.
+ *
+ * When `onModify` is provided, the review loop supports natural language modification
+ * requests that invoke the LLM to revise proposals based on the user's free-form input.
+ */
+export async function runChunkedReview(proposals, chunkSize = 5, onGranularityAdjust, onAssess, onModify, thresholdWeeks) {
+    // For single proposal or small batches, use simple y/n
+    if (proposals.length <= 1) {
+        const answer = await promptLine("Accept this proposal? (y/n) ");
+        const isYes = ["y", "yes"].includes(answer.toLowerCase());
+        const state = createReviewState(proposals, 1, thresholdWeeks);
+        if (isYes) {
+            state.accepted.add(0);
+        }
+        const record = buildBatchRecord(state);
+        if (isYes) {
+            return { accepted: proposals, remaining: [], batchRecord: record };
+        }
+        return { accepted: [], remaining: proposals, batchRecord: record };
+    }
+    let state = createReviewState(proposals, chunkSize, thresholdWeeks);
+    // Main review loop
+    while (true) {
+        info("");
+        info(formatPaginationHeader(state));
+        info("─".repeat(40));
+        info(formatChunk(state));
+        info("");
+        info(formatActionMenu(state));
+        const input = await promptLine(buildPrompt(state));
+        const action = parseChunkInput(input, state);
+        const { state: newState, done, message, granularityRequest, assessRequested, modificationRequest } = applyAction(state, action);
+        if (message) {
+            info(message);
+        }
+        state = newState;
+        // Handle granularity adjustments
+        if (granularityRequest) {
+            if (!onGranularityAdjust) {
+                info("Granularity adjustment is not available in this context.");
+            }
+            else {
+                const targetProposals = granularityRequest.indices.map((i) => state.proposals[i]);
+                try {
+                    const adjusted = await onGranularityAdjust(targetProposals, granularityRequest.kind);
+                    if (adjusted.length > 0) {
+                        state = replaceProposals(state, granularityRequest.indices, adjusted, granularityRequest.kind);
+                        const label = granularityRequest.kind === "break_down"
+                            ? "broken down"
+                            : "consolidated";
+                        info(`Replaced ${targetProposals.length} proposal(s) with ${adjusted.length} ${label} proposal(s).`);
+                    }
+                    else {
+                        info("LLM returned no proposals. Original proposals unchanged.");
+                    }
+                }
+                catch (err) {
+                    info(`Granularity adjustment failed: ${err.message}`);
+                    info("Original proposals unchanged.");
+                }
+            }
+        }
+        // Handle granularity assessment
+        if (assessRequested) {
+            if (!onAssess) {
+                info("Granularity assessment is not available in this context.");
+            }
+            else {
+                try {
+                    const { assessments, formatted } = await onAssess(state.proposals);
+                    state = { ...state, lastAssessment: assessments };
+                    info("");
+                    info(formatted);
+                    const actionable = assessments.filter((a) => a.recommendation !== "keep");
+                    if (actionable.length > 0) {
+                        info("");
+                        info("Use 'apply' to apply these recommendations automatically.");
+                    }
+                }
+                catch (err) {
+                    info(`Granularity assessment failed: ${err.message}`);
+                }
+            }
+        }
+        // Handle natural language modification
+        if (modificationRequest) {
+            if (!onModify) {
+                info("Natural language modification is not available in this context.");
+            }
+            else {
+                try {
+                    const modified = await onModify(state.proposals, modificationRequest);
+                    if (modified.length > 0) {
+                        // Replace all proposals with the modified set
+                        state = createReviewState(modified, state.chunkSize, state.thresholdWeeks);
+                        info(`Proposals updated (${modified.length} proposal${modified.length === 1 ? "" : "s"}).`);
+                    }
+                    else {
+                        info("Modification returned no proposals. Original proposals unchanged.");
+                    }
+                }
+                catch (err) {
+                    info(`Modification failed: ${err.message}`);
+                    info("Original proposals unchanged.");
+                }
+            }
+        }
+        if (done) {
+            break;
+        }
+    }
+    const accepted = getAcceptedProposals(state);
+    const remaining = getRemainingProposals(state);
+    const batchRecord = buildBatchRecord(state);
+    // Summary
+    info("");
+    info(formatBatchSummary(batchRecord));
+    return { accepted, remaining, batchRecord };
+}
+//# sourceMappingURL=chunked-review.js.map

package/packages/rex/dist/cli/commands/chunked-review.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunked-review.js","sourceRoot":"","sources":["../../../src/cli/commands/chunked-review.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAEhD,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAEpC,4DAA4D;AAC5D,sEAAsE;AACtE,sDAAsD;AACtD,OAAO;AAWL,iBAAiB;AACjB,iBAAiB,EACjB,eAAe,EACf,sBAAsB,EACtB,WAAW,EACX,gBAAgB,EAChB,WAAW,EACX,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,oBAAoB,EACpB,qBAAqB,EACrB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACL,iBAAiB,EACjB,sBAAsB,EACtB,WAAW,EACX,gBAAgB,EAChB,WAAW,EACX,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,oBAAoB,EACpB,qBAAqB,EACrB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AAQnC,wEAAwE;AAExE,SAAS,UAAU,CAAC,QAAgB;IAClC,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7E,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YAC/B,EAAE,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,SAAqB,EACrB,YAAoB,CAAC,EACrB,mBAAwC,EACxC,QAA4B,EAC5B,QAA8B,EAC9B,cAAuB;IAEvB,uDAAuD;IACvD,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,8BAA8B,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC1D,MAAM,KAAK,GAAG,iBAAiB,CAAC,SAAS,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;QAC9D,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;QACrE,CAAC;QACD,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;IACrE,CAAC;IAED,IAAI,KAAK,GAAG,iBAAiB,CAAC,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAEpE,mBAAmB;IACnB,OAAO,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,EAAE,CAAC,CAAC;QACT,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,EAAE,CAAC,CAAC;QACT,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;QAE9B,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC7C,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,mBAAmB,EAAE,GAAG,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEhI,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,OAAO,CAAC,CAAC;QAChB,CAAC;QAED,KAAK,GAAG,QAAQ,CAAC;QAEjB,iCAAiC;QACjC,IAAI,kBAAkB,EAAE,CAAC;YACvB,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBACzB,IAAI,CAAC,0DAA0D,CAAC,CAAC;YACnE,CAAC;iBAAM,CAAC;gBACN,MAAM,eAAe,GAAG,kBAAkB,CAAC,OAAO,CAAC,GAAG,CACpD,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAC1B,CAAC;gBACF,IAAI,CAAC;oBACH,MAAM,QAAQ,GAAG,MAAM,mBAAmB,CACxC,eAAe,EACf,kBAAkB,CAAC,IAAI,CACxB,CAAC;oBACF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACxB,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC;wBAC/F,MAAM,KAAK,GAAG,kBAAkB,CAAC,IAAI,KAAK,YAAY;4BACpD,CAAC,CAAC,aAAa;4BACf,CAAC,CAAC,cAAc,CAAC;wBACnB,IAAI,CACF,YAAY,eAAe,CAAC,MAAM,qBAAqB,QAAQ,CAAC,MAAM,IAAI,KAAK,eAAe,CAC/F,CAAC;oBACJ,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,0DAA0D,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,CAAC,kCAAmC,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;oBACjE,IAAI,CAAC,+BAA+B,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,IAAI,eAAe,EAAE,CAAC;YACpB,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,0DAA0D,CAAC,CAAC;YACnE,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC;oBACH,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;oBACnE,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,CAAC;oBAClD,IAAI,CAAC,EAAE,CAAC,CAAC;oBACT,IAAI,CAAC,SAAS,CAAC,CAAC;oBAChB,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,MAAM,CAAC,CAAC;oBAC1E,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC1B,IAAI,CAAC,EAAE,CAAC,CAAC;wBACT,IAAI,CAAC,2DAA2D,CAAC,CAAC;oBACpE,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,CAAC,kCAAmC,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,IAAI,mBAAmB,EAAE,CAAC;YACxB,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,IAAI,CAAC,iEAAiE,CAAC,CAAC;YAC1E,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC;oBACH,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;oBACtE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACxB,8CAA8C;wBAC9C,KAAK,GAAG,iBAAiB,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;wBAC3E,IAAI,CAAC,sBAAsB,QAAQ,CAAC,MAAM,YAAY,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;oBAC9F,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,mEAAmE,CAAC,CAAC;oBAC5E,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,IAAI,CAAC,wBAAyB,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;oBACvD,IAAI,CAAC,+BAA+B,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,IAAI,EAAE,CAAC;YACT,MAAM;QACR,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC/C,MAAM,WAAW,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAE5C,UAAU;IACV,IAAI,CAAC,EAAE,CAAC,CAAC;IACT,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC;IAEtC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;AAC9C,CAAC"}

package/packages/rex/dist/cli/commands/constants.d.ts

@@ -0,0 +1,3 @@
+export declare const REX_DIR: ".rex";
+export declare const TOOL_VERSION = "0.1.0";
+export declare function usage(): void;

package/packages/rex/dist/cli/commands/constants.js

@@ -0,0 +1,50 @@
+import { PROJECT_DIRS, formatUsage } from "@n-dx/llm-client";
+export const REX_DIR = PROJECT_DIRS.REX;
+export const TOOL_VERSION = "0.1.0";
+export function usage() {
+    console.log(formatUsage({
+        title: `rex v${TOOL_VERSION} — PRD management & implementation workflow`,
+        usage: "rex <command> [options] [dir]",
+        sections: [
+            {
+                title: "Commands",
+                items: [
+                    { name: "init [dir]", description: "Initialize .rex/ in directory (default: .)" },
+                    { name: "status [dir]", description: "Show PRD tree (hides completed items by default)" },
+                    { name: "next [dir]", description: "Print next actionable task" },
+                    { name: "add <level> [dir]", description: "Add item manually (epic|feature|task|subtask)" },
+                    { name: "add \"<desc>\" [\"<d2>\"]", description: "Smart add: LLM creates PRD from descriptions" },
+                    { name: "add --file=<path>", description: "Import ideas from a freeform text file (repeatable)" },
+                    { name: "echo \"desc\" | add", description: "Pipe text as description (combinable with other sources)" },
+                    { name: "update <id> [dir]", description: "Update item status/priority" },
+                    { name: "remove <epic|task> <id>", description: "Remove an epic or task and all descendants" },
+                    { name: "move <id> [dir]", description: "Move item to new parent (reparent)" },
+                    { name: "reshape [dir]", description: "LLM-powered PRD restructuring (merge, update, reparent, split)" },
+                    { name: "prune [dir]", description: "Remove completed subtrees and consolidate remaining items" },
+                    { name: "usage [dir]", description: "Detailed token usage analytics and cost estimation" },
+                    { name: "validate [dir]", description: "Check PRD integrity (DAG, schema)" },
+                    { name: "fix [dir]", description: "Auto-fix common validation issues (timestamps, refs, status)" },
+                    { name: "report [dir]", description: "Generate JSON health report for CI dashboards" },
+                    { name: "verify [dir]", description: "Run tests for acceptance criteria" },
+                    { name: "recommend [dir]", description: "Get SourceVision recommendations" },
+                    { name: "analyze [dir]", description: "Build PRD from project analysis" },
+                    { name: "import [dir]", description: "Alias for analyze (file import shorthand)" },
+                    { name: "reorganize [dir]", description: "Detect and fix structural issues in the PRD" },
+                    { name: "health [dir]", description: "Show structure health score (depth, balance, completeness)" },
+                    { name: "sync [dir]", description: "Sync local PRD with remote adapter" },
+                    { name: "adapter <sub> [name]", description: "Manage store adapters (list|add|remove|show)" },
+                    { name: "mcp [dir]", description: "Start MCP server" },
+                ],
+            },
+        ],
+        options: [
+            { flag: "--help, -h", description: "Show this help" },
+            { flag: "--quiet, -q", description: "Suppress informational output (for scripting)" },
+            { flag: "--format=tree|json", description: "Output format (default: tree)" },
+        ],
+        footer: [
+            "Run 'rex <command> --help' for detailed help on any command.",
+        ],
+    }));
+}
+//# sourceMappingURL=constants.js.map

package/packages/rex/dist/cli/commands/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["../../../src/cli/commands/constants.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAE7D,MAAM,CAAC,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC;AACxC,MAAM,CAAC,MAAM,YAAY,GAAG,OAAO,CAAC;AAEpC,MAAM,UAAU,KAAK;IACnB,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC;QACtB,KAAK,EAAE,QAAQ,YAAY,6CAA6C;QACxE,KAAK,EAAE,+BAA+B;QACtC,QAAQ,EAAE;YACR;gBACE,KAAK,EAAE,UAAU;gBACjB,KAAK,EAAE;oBACL,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,4CAA4C,EAAE;oBACjF,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,kDAAkD,EAAE;oBACzF,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,4BAA4B,EAAE;oBACjE,EAAE,IAAI,EAAE,mBAAmB,EAAE,WAAW,EAAE,+CAA+C,EAAE;oBAC3F,EAAE,IAAI,EAAE,2BAA2B,EAAE,WAAW,EAAE,8CAA8C,EAAE;oBAClG,EAAE,IAAI,EAAE,mBAAmB,EAAE,WAAW,EAAE,qDAAqD,EAAE;oBACjG,EAAE,IAAI,EAAE,qBAAqB,EAAE,WAAW,EAAE,0DAA0D,EAAE;oBACxG,EAAE,IAAI,EAAE,mBAAmB,EAAE,WAAW,EAAE,6BAA6B,EAAE;oBACzE,EAAE,IAAI,EAAE,yBAAyB,EAAE,WAAW,EAAE,4CAA4C,EAAE;oBAC9F,EAAE,IAAI,EAAE,iBAAiB,EAAE,WAAW,EAAE,oCAAoC,EAAE;oBAC9E,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,gEAAgE,EAAE;oBACxG,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,2DAA2D,EAAE;oBACjG,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,oDAAoD,EAAE;oBAC1F,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,EAAE,mCAAmC,EAAE;oBAC5E,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,8DAA8D,EAAE;oBAClG,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,+CAA+C,EAAE;oBACtF,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,mCAAmC,EAAE;oBAC1E,EAAE,IAAI,EAAE,iBAAiB,EAAE,WAAW,EAAE,kCAAkC,EAAE;oBAC5E,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,iCAAiC,EAAE;oBACzE,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,2CAA2C,EAAE;oBAClF,EAAE,IAAI,EAAE,kBAAkB,EAAE,WAAW,EAAE,6CAA6C,EAAE;oBACxF,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,4DAA4D,EAAE;oBACnG,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,oCAAoC,EAAE;oBACzE,EAAE,IAAI,EAAE,sBAAsB,EAAE,WAAW,EAAE,8CAA8C,EAAE;oBAC7F,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,kBAAkB,EAAE;iBACvD;aACF;SACF;QACD,OAAO,EAAE;YACP,EAAE,IAAI,EAAE,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAE;YACrD,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,+CAA+C,EAAE;YACrF,EAAE,IAAI,EAAE,oBAAoB,EAAE,WAAW,EAAE,+BAA+B,EAAE;SAC7E;QACD,MAAM,EAAE;YACN,8DAA8D;SAC/D;KACF,CAAC,CAAC,CAAC;AACN,CAAC"}

package/packages/rex/dist/cli/commands/decomposition-review.d.ts

@@ -0,0 +1,92 @@
+/**
+ * Decomposition confirmation UI for the proposal review workflow.
+ *
+ * After the LoE decomposition pass annotates oversized tasks with their
+ * decomposed children, this module presents each decomposed task to the
+ * user with three choices:
+ *
+ * - **Accept decomposed** — add child tasks, discard the parent
+ * - **Keep original** — add the parent task unmodified
+ * - **Skip** — omit the task entirely
+ *
+ * Non-interactive mode (--accept / --yes) defaults to accepting the
+ * decomposed version.
+ *
+ * @module rex/cli/commands/decomposition-review
+ */
+import type { Proposal, ProposalTask } from "../../analyze/index.js";
+export type DecompositionChoice = "accept_decomposed" | "keep_original" | "skip";
+export interface DecompositionReviewResult {
+    /** Proposals with decomposition choices applied. */
+    proposals: Proposal[];
+    /** Summary of decisions made. */
+    summary: DecompositionReviewSummary;
+}
+export interface DecompositionReviewSummary {
+    /** Total number of decomposed tasks reviewed. */
+    total: number;
+    /** Count of tasks where decomposed children were accepted. */
+    acceptedDecomposed: number;
+    /** Count of tasks where the original was kept. */
+    keptOriginal: number;
+    /** Count of tasks that were skipped entirely. */
+    skipped: number;
+}
+/**
+ * Format a single decomposed task with its children for display.
+ * Shows the parent task with LoE annotation and children indented beneath.
+ *
+ * Pure function — no I/O.
+ */
+export declare function formatDecomposedTask(task: ProposalTask, featureTitle: string): string;
+/**
+ * Format decomposed tasks inline within proposal display output.
+ * This extends the standard proposal format to show decomposition annotations.
+ *
+ * Pure function — no I/O.
+ */
+export declare function formatProposalsWithDecomposition(proposals: Proposal[]): string;
+/** Count total decomposed tasks across all proposals. */
+export declare function countDecomposedTasks(proposals: Proposal[]): number;
+/**
+ * Apply a decomposition choice to a single task.
+ * Returns the task(s) that should replace it in the feature's task list.
+ *
+ * - `accept_decomposed`: returns the decomposed children
+ * - `keep_original`: returns the original task with decomposition stripped
+ * - `skip`: returns empty array (task omitted)
+ *
+ * Pure function — no I/O.
+ */
+export declare function applyDecompositionChoice(task: ProposalTask, choice: DecompositionChoice): ProposalTask[];
+/**
+ * Resolve all decomposition annotations in proposals using the provided
+ * choice function. For each decomposed task, the chooser is called to
+ * determine what to do.
+ *
+ * Pure function — the chooser may be async for interactive I/O.
+ */
+export declare function resolveDecompositions(proposals: Proposal[], chooser: (task: ProposalTask, featureTitle: string, epicTitle: string) => Promise<DecompositionChoice> | DecompositionChoice): Promise<DecompositionReviewResult>;
+/**
+ * Resolve all decompositions by accepting the decomposed versions.
+ * Used in non-interactive mode (--accept / --yes).
+ *
+ * Pure function — no I/O.
+ */
+export declare function autoResolveDecompositions(proposals: Proposal[]): Promise<DecompositionReviewResult>;
+/**
+ * Parse user input for the decomposition choice prompt.
+ * Returns the choice or null for invalid input.
+ */
+export declare function parseDecompositionInput(input: string): DecompositionChoice | null;
+/**
+ * Run the interactive decomposition review.
+ * For each decomposed task, displays the parent and children, then
+ * prompts the user for their choice.
+ */
+export declare function runDecompositionReview(proposals: Proposal[]): Promise<DecompositionReviewResult>;
+/**
+ * Format a summary of the decomposition review results.
+ * Pure function — returns a multi-line string.
+ */
+export declare function formatDecompositionSummary(summary: DecompositionReviewSummary): string;

package/packages/rex/dist/cli/commands/decomposition-review.js

@@ -0,0 +1,258 @@
+/**
+ * Decomposition confirmation UI for the proposal review workflow.
+ *
+ * After the LoE decomposition pass annotates oversized tasks with their
+ * decomposed children, this module presents each decomposed task to the
+ * user with three choices:
+ *
+ * - **Accept decomposed** — add child tasks, discard the parent
+ * - **Keep original** — add the parent task unmodified
+ * - **Skip** — omit the task entirely
+ *
+ * Non-interactive mode (--accept / --yes) defaults to accepting the
+ * decomposed version.
+ *
+ * @module rex/cli/commands/decomposition-review
+ */
+import { createInterface } from "node:readline";
+import { info } from "../output.js";
+// ── Display formatting ──
+/**
+ * Format a single decomposed task with its children for display.
+ * Shows the parent task with LoE annotation and children indented beneath.
+ *
+ * Pure function — no I/O.
+ */
+export function formatDecomposedTask(task, featureTitle) {
+    const decomp = task.decomposition;
+    if (!decomp)
+        return "";
+    const loeLabel = task.loe !== undefined ? `${task.loe}w` : "?";
+    const thresholdLabel = `${decomp.thresholdWeeks}w`;
+    const pri = task.priority ? ` [${task.priority}]` : "";
+    const lines = [];
+    lines.push(`  ⚡ Auto-decomposed (LoE: ${loeLabel} > ${thresholdLabel} threshold)`);
+    lines.push(`  [task] ${task.title}${pri}`);
+    if (task.description) {
+        lines.push(`    ${task.description}`);
+    }
+    lines.push(`  Decomposed into ${decomp.children.length} child task${decomp.children.length === 1 ? "" : "s"}:`);
+    for (const child of decomp.children) {
+        const childPri = child.priority ? ` [${child.priority}]` : "";
+        const childLoe = child.loe !== undefined ? ` (LoE: ${child.loe}w)` : "";
+        lines.push(`    ↳ ${child.title}${childPri}${childLoe}`);
+    }
+    return lines.join("\n");
+}
+/**
+ * Format decomposed tasks inline within proposal display output.
+ * This extends the standard proposal format to show decomposition annotations.
+ *
+ * Pure function — no I/O.
+ */
+export function formatProposalsWithDecomposition(proposals) {
+    const lines = [];
+    for (const p of proposals) {
+        lines.push(`[epic] ${p.epic.title} (from: ${p.epic.source})`);
+        for (const f of p.features) {
+            lines.push(`  [feature] ${f.title} (from: ${f.source})`);
+            for (const t of f.tasks) {
+                const pri = t.priority ? ` [${t.priority}]` : "";
+                if (t.decomposition) {
+                    const loeLabel = t.loe !== undefined ? `${t.loe}w` : "?";
+                    const thresholdLabel = `${t.decomposition.thresholdWeeks}w`;
+                    lines.push(`    [task] ${t.title}${pri} ⚡ decomposed (LoE: ${loeLabel} > ${thresholdLabel} threshold)`);
+                    for (const child of t.decomposition.children) {
+                        const childPri = child.priority ? ` [${child.priority}]` : "";
+                        const childLoe = child.loe !== undefined ? ` (LoE: ${child.loe}w)` : "";
+                        lines.push(`      ↳ ${child.title}${childPri}${childLoe}`);
+                    }
+                }
+                else {
+                    lines.push(`    [task] ${t.title}${pri} (from: ${t.sourceFile})`);
+                }
+            }
+        }
+    }
+    return lines.join("\n");
+}
+// ── Decomposition counting ──
+/** Count total decomposed tasks across all proposals. */
+export function countDecomposedTasks(proposals) {
+    let count = 0;
+    for (const p of proposals) {
+        for (const f of p.features) {
+            for (const t of f.tasks) {
+                if (t.decomposition)
+                    count++;
+            }
+        }
+    }
+    return count;
+}
+// ── Choice application (pure) ──
+/**
+ * Apply a decomposition choice to a single task.
+ * Returns the task(s) that should replace it in the feature's task list.
+ *
+ * - `accept_decomposed`: returns the decomposed children
+ * - `keep_original`: returns the original task with decomposition stripped
+ * - `skip`: returns empty array (task omitted)
+ *
+ * Pure function — no I/O.
+ */
+export function applyDecompositionChoice(task, choice) {
+    if (!task.decomposition)
+        return [task];
+    switch (choice) {
+        case "accept_decomposed":
+            return task.decomposition.children;
+        case "keep_original": {
+            const { decomposition: _, ...original } = task;
+            return [original];
+        }
+        case "skip":
+            return [];
+    }
+}
+/**
+ * Resolve all decomposition annotations in proposals using the provided
+ * choice function. For each decomposed task, the chooser is called to
+ * determine what to do.
+ *
+ * Pure function — the chooser may be async for interactive I/O.
+ */
+export async function resolveDecompositions(proposals, chooser) {
+    const summary = {
+        total: 0,
+        acceptedDecomposed: 0,
+        keptOriginal: 0,
+        skipped: 0,
+    };
+    const resultProposals = [];
+    for (const proposal of proposals) {
+        const resultFeatures = [];
+        for (const feature of proposal.features) {
+            const resultTasks = [];
+            for (const task of feature.tasks) {
+                if (!task.decomposition) {
+                    resultTasks.push(task);
+                    continue;
+                }
+                summary.total++;
+                const choice = await chooser(task, feature.title, proposal.epic.title);
+                switch (choice) {
+                    case "accept_decomposed":
+                        summary.acceptedDecomposed++;
+                        break;
+                    case "keep_original":
+                        summary.keptOriginal++;
+                        break;
+                    case "skip":
+                        summary.skipped++;
+                        break;
+                }
+                resultTasks.push(...applyDecompositionChoice(task, choice));
+            }
+            resultFeatures.push({ ...feature, tasks: resultTasks });
+        }
+        resultProposals.push({ ...proposal, features: resultFeatures });
+    }
+    return { proposals: resultProposals, summary };
+}
+// ── Auto-resolve (non-interactive) ──
+/**
+ * Resolve all decompositions by accepting the decomposed versions.
+ * Used in non-interactive mode (--accept / --yes).
+ *
+ * Pure function — no I/O.
+ */
+export async function autoResolveDecompositions(proposals) {
+    return resolveDecompositions(proposals, () => "accept_decomposed");
+}
+// ── Interactive I/O ──
+function promptLine(question) {
+    const rl = createInterface({ input: process.stdin, output: process.stdout });
+    return new Promise((resolve) => {
+        rl.question(question, (answer) => {
+            rl.close();
+            resolve(answer.trim());
+        });
+    });
+}
+/**
+ * Parse user input for the decomposition choice prompt.
+ * Returns the choice or null for invalid input.
+ */
+export function parseDecompositionInput(input) {
+    const trimmed = input.trim().toLowerCase();
+    if (["d", "decomposed", "accept", "y", "yes"].includes(trimmed)) {
+        return "accept_decomposed";
+    }
+    if (["k", "keep", "original"].includes(trimmed)) {
+        return "keep_original";
+    }
+    if (["s", "skip", "n", "no"].includes(trimmed)) {
+        return "skip";
+    }
+    return null;
+}
+/**
+ * Run the interactive decomposition review.
+ * For each decomposed task, displays the parent and children, then
+ * prompts the user for their choice.
+ */
+export async function runDecompositionReview(proposals) {
+    const totalDecomposed = countDecomposedTasks(proposals);
+    if (totalDecomposed === 0) {
+        return { proposals, summary: { total: 0, acceptedDecomposed: 0, keptOriginal: 0, skipped: 0 } };
+    }
+    info("");
+    info(`${totalDecomposed} task${totalDecomposed === 1 ? "" : "s"} auto-decomposed due to LoE threshold.`);
+    info("Review each decomposed task:");
+    info("");
+    let taskNum = 0;
+    return resolveDecompositions(proposals, async (task, featureTitle, epicTitle) => {
+        taskNum++;
+        info(`─── Decomposition ${taskNum}/${totalDecomposed} ───`);
+        info(`  Epic: ${epicTitle} → Feature: ${featureTitle}`);
+        info(formatDecomposedTask(task, featureTitle));
+        info("");
+        info("  [d] Accept decomposed  [k] Keep original  [s] Skip");
+        while (true) {
+            const input = await promptLine(`  (${taskNum}/${totalDecomposed}) > `);
+            const choice = parseDecompositionInput(input);
+            if (choice) {
+                const label = choice === "accept_decomposed"
+                    ? "Accepted decomposed version"
+                    : choice === "keep_original"
+                        ? "Keeping original task"
+                        : "Skipped";
+                info(`  → ${label}`);
+                info("");
+                return choice;
+            }
+            info("  Invalid input. Use: d=accept decomposed, k=keep original, s=skip");
+        }
+    });
+}
+/**
+ * Format a summary of the decomposition review results.
+ * Pure function — returns a multi-line string.
+ */
+export function formatDecompositionSummary(summary) {
+    if (summary.total === 0)
+        return "";
+    const parts = [];
+    if (summary.acceptedDecomposed > 0) {
+        parts.push(`${summary.acceptedDecomposed} decomposed`);
+    }
+    if (summary.keptOriginal > 0) {
+        parts.push(`${summary.keptOriginal} kept original`);
+    }
+    if (summary.skipped > 0) {
+        parts.push(`${summary.skipped} skipped`);
+    }
+    return `Decomposition review: ${parts.join(", ")} (${summary.total} total)`;
+}
+//# sourceMappingURL=decomposition-review.js.map

package/packages/rex/dist/cli/commands/decomposition-review.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decomposition-review.js","sourceRoot":"","sources":["../../../src/cli/commands/decomposition-review.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAEhD,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAwBpC,2BAA2B;AAE3B;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAkB,EAAE,YAAoB;IAC3E,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC;IAClC,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/D,MAAM,cAAc,GAAG,GAAG,MAAM,CAAC,cAAc,GAAG,CAAC;IACnD,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,6BAA6B,QAAQ,MAAM,cAAc,aAAa,CAAC,CAAC;IACnF,KAAK,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,KAAK,GAAG,GAAG,EAAE,CAAC,CAAC;IAC3C,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACxC,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,qBAAqB,MAAM,CAAC,QAAQ,CAAC,MAAM,cAAc,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAChH,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACxE,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,KAAK,GAAG,QAAQ,GAAG,QAAQ,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gCAAgC,CAAC,SAAqB;IACpE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACzD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;oBACpB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;oBACzD,MAAM,cAAc,GAAG,GAAG,CAAC,CAAC,aAAa,CAAC,cAAc,GAAG,CAAC;oBAC5D,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,KAAK,GAAG,GAAG,uBAAuB,QAAQ,MAAM,cAAc,aAAa,CAAC,CAAC;oBACxG,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC;wBAC7C,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBACxE,KAAK,CAAC,IAAI,CAAC,WAAW,KAAK,CAAC,KAAK,GAAG,QAAQ,GAAG,QAAQ,EAAE,CAAC,CAAC;oBAC7D,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,KAAK,GAAG,GAAG,WAAW,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,+BAA+B;AAE/B,yDAAyD;AACzD,MAAM,UAAU,oBAAoB,CAAC,SAAqB;IACxD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,IAAI,CAAC,CAAC,aAAa;oBAAE,KAAK,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kCAAkC;AAElC;;;;;;;;;GASG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAkB,EAClB,MAA2B;IAE3B,IAAI,CAAC,IAAI,CAAC,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAEvC,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,mBAAmB;YACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC;QACrC,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,EAAE,aAAa,EAAE,CAAC,EAAE,GAAG,QAAQ,EAAE,GAAG,IAAI,CAAC;YAC/C,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QACD,KAAK,MAAM;YACT,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,SAAqB,EACrB,OAA4H;IAE5H,MAAM,OAAO,GAA+B;QAC1C,KAAK,EAAE,CAAC;QACR,kBAAkB,EAAE,CAAC;QACrB,YAAY,EAAE,CAAC;QACf,OAAO,EAAE,CAAC;KACX,CAAC;IAEF,MAAM,eAAe,GAAe,EAAE,CAAC;IAEvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,cAAc,GAAsB,EAAE,CAAC;QAE7C,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACxC,MAAM,WAAW,GAAmB,EAAE,CAAC;YAEvC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;oBACxB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvB,SAAS;gBACX,CAAC;gBAED,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChB,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAEvE,QAAQ,MAAM,EAAE,CAAC;oBACf,KAAK,mBAAmB;wBACtB,OAAO,CAAC,kBAAkB,EAAE,CAAC;wBAC7B,MAAM;oBACR,KAAK,eAAe;wBAClB,OAAO,CAAC,YAAY,EAAE,CAAC;wBACvB,MAAM;oBACR,KAAK,MAAM;wBACT,OAAO,CAAC,OAAO,EAAE,CAAC;wBAClB,MAAM;gBACV,CAAC;gBAED,WAAW,CAAC,IAAI,CAAC,GAAG,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;YAC9D,CAAC;YAED,cAAc,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;QAC1D,CAAC;QAED,eAAe,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,OAAO,EAAE,CAAC;AACjD,CAAC;AAED,uCAAuC;AAEvC;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,SAAqB;IAErB,OAAO,qBAAqB,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,mBAAmB,CAAC,CAAC;AACrE,CAAC;AAED,wBAAwB;AAExB,SAAS,UAAU,CAAC,QAAgB;IAClC,MAAM,EAAE,GAAG,eAAe,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7E,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE;YAC/B,EAAE,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAa;IACnD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IAE3C,IAAI,CAAC,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAChE,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAChD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,SAAqB;IAErB,MAAM,eAAe,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;IACxD,IAAI,eAAe,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;IAClG,CAAC;IAED,IAAI,CAAC,EAAE,CAAC,CAAC;IACT,IAAI,CAAC,GAAG,eAAe,QAAQ,eAAe,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,wCAAwC,CAAC,CAAC;IACzG,IAAI,CAAC,8BAA8B,CAAC,CAAC;IACrC,IAAI,CAAC,EAAE,CAAC,CAAC;IAET,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,OAAO,qBAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,EAAE;QAC9E,OAAO,EAAE,CAAC;QACV,IAAI,CAAC,qBAAqB,OAAO,IAAI,eAAe,MAAM,CAAC,CAAC;QAC5D,IAAI,CAAC,WAAW,SAAS,eAAe,YAAY,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,EAAE,CAAC,CAAC;QACT,IAAI,CAAC,sDAAsD,CAAC,CAAC;QAE7D,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,MAAM,OAAO,IAAI,eAAe,MAAM,CAAC,CAAC;YACvE,MAAM,MAAM,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,KAAK,GAAG,MAAM,KAAK,mBAAmB;oBAC1C,CAAC,CAAC,6BAA6B;oBAC/B,CAAC,CAAC,MAAM,KAAK,eAAe;wBAC1B,CAAC,CAAC,uBAAuB;wBACzB,CAAC,CAAC,SAAS,CAAC;gBAChB,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC,CAAC;gBACrB,IAAI,CAAC,EAAE,CAAC,CAAC;gBACT,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,IAAI,CAAC,oEAAoE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,0BAA0B,CAAC,OAAmC;IAC5E,IAAI,OAAO,CAAC,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,OAAO,CAAC,kBAAkB,GAAG,CAAC,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,kBAAkB,aAAa,CAAC,CAAC;IACzD,CAAC;IACD,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,YAAY,gBAAgB,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,OAAO,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,UAAU,CAAC,CAAC;IAC3C,CAAC;IAED,OAAO,yBAAyB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,KAAK,SAAS,CAAC;AAC9E,CAAC"}

package/packages/rex/dist/cli/commands/fix.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Auto-fix common PRD validation issues.
+ *
+ * Supports:
+ * - `--dry-run` — preview fixes without applying them
+ * - `--format=json` — structured JSON output
+ */
+export declare function cmdFix(dir: string, flags: Record<string, string>): Promise<void>;