@n-dx/core 0.1.0

package/packages/rex/dist/analyze/modify-reason.js

@@ -0,0 +1,182 @@
+/**
+ * LLM-powered proposal modification pipeline.
+ *
+ * Takes an existing set of proposals and a natural-language modification
+ * request, sends both to the LLM, and returns revised proposals that
+ * incorporate the requested changes while preserving structure and metadata.
+ *
+ * Follows the same patterns as reason.ts (spawnClaude, extractJson,
+ * parseProposalResponse, Zod validation) and reshape-reason.ts
+ * (prompt construction, token accumulation).
+ *
+ * @module analyze/modify-reason
+ */
+import { spawnClaude, parseProposalResponse, emptyAnalyzeTokenUsage, accumulateTokenUsage, readProjectContext, validateProposalQuality, PRD_SCHEMA, FEW_SHOT_EXAMPLE, TASK_QUALITY_RULES, ANTI_PATTERNS, OUTPUT_INSTRUCTION, DEFAULT_MODEL, MAX_RETRIES, } from "./reason.js";
+import { validateModificationRequest } from "./validate-modification.js";
+// ── Prompt building ──
+/**
+ * Build the LLM prompt for modifying existing proposals based on
+ * natural-language feedback. Pure function — no I/O.
+ *
+ * Exported for testability.
+ */
+export function buildModifyPrompt(proposals, modificationRequest, options) {
+    const proposalJson = JSON.stringify(proposals, null, 2);
+    const existingBlock = options?.existingSummary
+        ? `\nExisting PRD (for deduplication — do NOT include these items):\n${options.existingSummary}\n`
+        : "";
+    const contextBlock = options?.projectContext
+        ? `\nProject context (from documentation):\n${options.projectContext}\n`
+        : "";
+    return `You are a product requirements analyst. You have an existing set of PRD proposals and a user's modification request. Revise the proposals to incorporate the requested changes.
+
+## Current Proposals
+${proposalJson}
+
+## Modification Request
+${modificationRequest}
+
+## Output Format
+${PRD_SCHEMA}
+
+${FEW_SHOT_EXAMPLE}
+
+## Rules
+- Apply the user's modification request to the proposals above.
+- Preserve the overall epic/feature/task hierarchy unless the request explicitly asks to restructure.
+- Keep all metadata (descriptions, acceptance criteria, priorities, tags) that the modification does not affect.
+- If the request asks to remove items, omit them from the output.
+- If the request asks to add items, include them in the appropriate position in the hierarchy.
+- If the request asks to change specific items, modify only those items and leave the rest unchanged.
+- If the request is ambiguous, interpret it in the way that makes the most practical sense for a software project.
+- Do NOT invent changes beyond what the request asks for.
+
+${TASK_QUALITY_RULES}
+
+${ANTI_PATTERNS}
+${existingBlock}${contextBlock}
+${OUTPUT_INSTRUCTION}`;
+}
+// ── Summarization ──
+/**
+ * Summarize existing PRD items into a text block for prompt context.
+ * Mirrors the pattern in reason.ts but imported as a standalone helper
+ * to avoid circular dependencies.
+ */
+function summarizeExisting(items) {
+    if (!items || items.length === 0)
+        return "(empty PRD)";
+    const lines = [];
+    function walk(list, depth) {
+        for (const item of list) {
+            const indent = "  ".repeat(depth);
+            lines.push(`${indent}- [${item.level}] ${item.title} (${item.status})`);
+            if (item.children)
+                walk(item.children, depth + 1);
+        }
+    }
+    walk(items, 0);
+    return lines.length > 0 ? lines.join("\n") : "(empty PRD)";
+}
+// ── Core pipeline ──
+/**
+ * Modify existing proposals based on a natural-language modification request.
+ *
+ * Pipeline:
+ * 1. Serialize current proposals as JSON context
+ * 2. Combine with the user's modification request
+ * 3. Send to LLM with structured output instructions
+ * 4. Parse and validate the revised proposal response
+ * 5. Run quality validation on the result
+ *
+ * On parse failure, retries up to `maxRetries` times (default: MAX_RETRIES).
+ * If all retries fail, throws the last error.
+ *
+ * @param proposals - The original proposals to modify
+ * @param modificationRequest - Natural language description of desired changes
+ * @param options - Optional configuration (model, dir, existing items)
+ * @returns Modified proposals with token usage and quality issues
+ */
+export async function modifyProposals(proposals, modificationRequest, options = {}) {
+    if (proposals.length === 0) {
+        return {
+            proposals: [],
+            originalProposals: [],
+            tokenUsage: emptyAnalyzeTokenUsage(),
+            qualityIssues: [],
+        };
+    }
+    if (!modificationRequest.trim()) {
+        // No modification requested — return the originals unchanged
+        return {
+            proposals,
+            originalProposals: proposals,
+            tokenUsage: emptyAnalyzeTokenUsage(),
+            qualityIssues: validateProposalQuality(proposals),
+        };
+    }
+    // Validate the modification request before calling the LLM
+    if (!options.skipValidation) {
+        const validation = validateModificationRequest(modificationRequest, proposals);
+        if (!validation.valid) {
+            return {
+                proposals,
+                originalProposals: proposals,
+                tokenUsage: emptyAnalyzeTokenUsage(),
+                qualityIssues: validateProposalQuality(proposals),
+                validationError: validation.error,
+                validationSuggestion: validation.suggestion,
+            };
+        }
+    }
+    const model = options.model ?? DEFAULT_MODEL;
+    const maxRetries = options.maxRetries ?? MAX_RETRIES;
+    const tokenUsage = emptyAnalyzeTokenUsage();
+    // Build context
+    const existingSummary = options.existingItems
+        ? summarizeExisting(options.existingItems)
+        : undefined;
+    const projectContext = options.dir
+        ? await readProjectContext(options.dir)
+        : undefined;
+    const prompt = buildModifyPrompt(proposals, modificationRequest, {
+        existingSummary,
+        projectContext: projectContext || undefined,
+    });
+    // LLM call with retries on parse failure
+    let lastError;
+    for (let attempt = 0; attempt <= maxRetries; attempt++) {
+        try {
+            const result = await spawnClaude(prompt, model);
+            accumulateTokenUsage(tokenUsage, result.tokenUsage);
+            const modified = parseProposalResponse(result.text);
+            const qualityIssues = validateProposalQuality(modified);
+            return {
+                proposals: modified,
+                originalProposals: proposals,
+                tokenUsage,
+                qualityIssues,
+            };
+        }
+        catch (err) {
+            lastError = err;
+            // Only retry on parse/validation errors, not on network/auth errors
+            if (!isParseError(lastError)) {
+                throw lastError;
+            }
+            // Token usage is accumulated even on failures (LLM was called)
+        }
+    }
+    // All retries exhausted
+    throw lastError;
+}
+/**
+ * Check whether an error is a parse/validation error (retryable)
+ * vs a network/auth error (not retryable).
+ */
+function isParseError(err) {
+    return (err.message.includes("Invalid JSON") ||
+        err.message.includes("failed schema validation") ||
+        err.message.includes("SyntaxError"));
+}
+//# sourceMappingURL=modify-reason.js.map

package/packages/rex/dist/analyze/modify-reason.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"modify-reason.js","sourceRoot":"","sources":["../../src/analyze/modify-reason.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAKH,OAAO,EACL,WAAW,EACX,qBAAqB,EACrB,sBAAsB,EACtB,oBAAoB,EACpB,kBAAkB,EAClB,uBAAuB,EACvB,UAAU,EACV,gBAAgB,EAChB,kBAAkB,EAClB,aAAa,EACb,kBAAkB,EAClB,aAAa,EACb,WAAW,GACZ,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,2BAA2B,EAAE,MAAM,4BAA4B,CAAC;AA4BzE,wBAAwB;AAExB;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAAqB,EACrB,mBAA2B,EAC3B,OAGC;IAED,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAExD,MAAM,aAAa,GAAG,OAAO,EAAE,eAAe;QAC5C,CAAC,CAAC,qEAAqE,OAAO,CAAC,eAAe,IAAI;QAClG,CAAC,CAAC,EAAE,CAAC;IAEP,MAAM,YAAY,GAAG,OAAO,EAAE,cAAc;QAC1C,CAAC,CAAC,4CAA4C,OAAO,CAAC,cAAc,IAAI;QACxE,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO;;;EAGP,YAAY;;;EAGZ,mBAAmB;;;EAGnB,UAAU;;EAEV,gBAAgB;;;;;;;;;;;;EAYhB,kBAAkB;;EAElB,aAAa;EACb,aAAa,GAAG,YAAY;EAC5B,kBAAkB,EAAE,CAAC;AACvB,CAAC;AAED,sBAAsB;AAEtB;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,KAAgB;IACzC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC;IAEvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,SAAS,IAAI,CAAC,IAAe,EAAE,KAAa;QAC1C,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,MAAM,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACxE,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAEf,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;AAC7D,CAAC;AAED,sBAAsB;AAEtB;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,SAAqB,EACrB,mBAA2B,EAC3B,UAAiC,EAAE;IAEnC,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO;YACL,SAAS,EAAE,EAAE;YACb,iBAAiB,EAAE,EAAE;YACrB,UAAU,EAAE,sBAAsB,EAAE;YACpC,aAAa,EAAE,EAAE;SAClB,CAAC;IACJ,CAAC;IAED,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,6DAA6D;QAC7D,OAAO;YACL,SAAS;YACT,iBAAiB,EAAE,SAAS;YAC5B,UAAU,EAAE,sBAAsB,EAAE;YACpC,aAAa,EAAE,uBAAuB,CAAC,SAAS,CAAC;SAClD,CAAC;IACJ,CAAC;IAED,2DAA2D;IAC3D,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,2BAA2B,CAAC,mBAAmB,EAAE,SAAS,CAAC,CAAC;QAC/E,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;YACtB,OAAO;gBACL,SAAS;gBACT,iBAAiB,EAAE,SAAS;gBAC5B,UAAU,EAAE,sBAAsB,EAAE;gBACpC,aAAa,EAAE,uBAAuB,CAAC,SAAS,CAAC;gBACjD,eAAe,EAAE,UAAU,CAAC,KAAK;gBACjC,oBAAoB,EAAE,UAAU,CAAC,UAAU;aAC5C,CAAC;QACJ,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,aAAa,CAAC;IAC7C,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,WAAW,CAAC;IACrD,MAAM,UAAU,GAAG,sBAAsB,EAAE,CAAC;IAE5C,gBAAgB;IAChB,MAAM,eAAe,GAAG,OAAO,CAAC,aAAa;QAC3C,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,aAAa,CAAC;QAC1C,CAAC,CAAC,SAAS,CAAC;IAEd,MAAM,cAAc,GAAG,OAAO,CAAC,GAAG;QAChC,CAAC,CAAC,MAAM,kBAAkB,CAAC,OAAO,CAAC,GAAG,CAAC;QACvC,CAAC,CAAC,SAAS,CAAC;IAEd,MAAM,MAAM,GAAG,iBAAiB,CAAC,SAAS,EAAE,mBAAmB,EAAE;QAC/D,eAAe;QACf,cAAc,EAAE,cAAc,IAAI,SAAS;KAC5C,CAAC,CAAC;IAEH,yCAAyC;IACzC,IAAI,SAA4B,CAAC;IAEjC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;QACvD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAChD,oBAAoB,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAEpD,MAAM,QAAQ,GAAG,qBAAqB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACpD,MAAM,aAAa,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;YAExD,OAAO;gBACL,SAAS,EAAE,QAAQ;gBACnB,iBAAiB,EAAE,SAAS;gBAC5B,UAAU;gBACV,aAAa;aACd,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,SAAS,GAAG,GAAY,CAAC;YACzB,oEAAoE;YACpE,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,MAAM,SAAS,CAAC;YAClB,CAAC;YACD,+DAA+D;QACjE,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,SAAU,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,GAAU;IAC9B,OAAO,CACL,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC;QACpC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,0BAA0B,CAAC;QAChD,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CACpC,CAAC;AACJ,CAAC"}

package/packages/rex/dist/analyze/propose.d.ts

@@ -0,0 +1,72 @@
+import type { ItemLevel, ItemStatus } from "../schema/index.js";
+import type { ScanResult } from "./scanners.js";
+export type DuplicateReasonType = "exact_title_match" | "semantic_match" | "content_overlap_match" | "completed_item_match";
+export interface DuplicateReasonReference {
+    id: string;
+    title: string;
+    level: ItemLevel;
+    status: ItemStatus;
+}
+export interface DuplicateReasonMetadata {
+    type: DuplicateReasonType;
+    matchedItem: DuplicateReasonReference;
+    explanation: string;
+}
+export interface ProposalTask {
+    title: string;
+    source: string;
+    sourceFile: string;
+    description?: string;
+    acceptanceCriteria?: string[];
+    priority?: string;
+    tags?: string[];
+    /** Status override — used in baseline mode to mark existing work as completed. */
+    status?: ItemStatus;
+    /** Level of effort estimate in engineer-weeks. */
+    loe?: number;
+    /** Rationale behind the LoE estimate. */
+    loeRationale?: string;
+    /** Confidence in the LoE estimate. */
+    loeConfidence?: "low" | "medium" | "high";
+    /**
+     * When present, this task was auto-decomposed because its LoE exceeded
+     * the configured threshold. Contains the child tasks and the threshold
+     * that triggered decomposition. The review step lets users choose between
+     * accepting children, keeping the original, or skipping entirely.
+     */
+    decomposition?: TaskDecomposition;
+    duplicateReason?: DuplicateReasonMetadata;
+}
+/** Decomposition metadata attached to a task that exceeded the LoE threshold. */
+export interface TaskDecomposition {
+    /** Child tasks produced by decomposition. */
+    children: ProposalTask[];
+    /** The LoE threshold (in engineer-weeks) that was exceeded. */
+    thresholdWeeks: number;
+}
+export interface ProposalFeature {
+    title: string;
+    source: string;
+    description?: string;
+    /** Status override — used in baseline mode to mark existing work as completed. */
+    status?: ItemStatus;
+    tasks: ProposalTask[];
+    duplicateReason?: DuplicateReasonMetadata;
+    /** When set, references an existing PRD item to place children under instead of creating a new feature. */
+    existingId?: string;
+}
+export interface ProposalEpic {
+    title: string;
+    source: string;
+    description?: string;
+    /** Status override — used in baseline mode to mark existing work as completed. */
+    status?: ItemStatus;
+    duplicateReason?: DuplicateReasonMetadata;
+    /** When set, references an existing PRD item to place children under instead of creating a new epic. */
+    existingId?: string;
+}
+export interface Proposal {
+    epic: ProposalEpic;
+    features: ProposalFeature[];
+}
+export declare function buildProposals(results: ScanResult[]): Proposal[];

package/packages/rex/dist/analyze/propose.js

@@ -0,0 +1,246 @@
+import { PRIORITY_ORDER } from "../schema/index.js";
+import { deduplicateScanResults } from "./dedupe.js";
+/** Look up priority rank from an untyped string, defaulting to medium (2). */
+function priorityRank(p) {
+    return PRIORITY_ORDER[(p ?? "medium")] ?? 2;
+}
+function normalize(s) {
+    return s.toLowerCase().trim().replace(/\s+/g, " ");
+}
+function inferEpic(result) {
+    // Explicit epic field takes precedence (set by scanners or LLM)
+    if (result.epic) {
+        return result.epic;
+    }
+    // Use first tag as epic grouping (scanners set this to directory-inferred epic)
+    if (result.tags && result.tags.length > 0) {
+        return result.tags[0];
+    }
+    // Fall back to source type
+    return result.source === "sourcevision"
+        ? "SourceVision"
+        : result.source === "test"
+            ? "Tests"
+            : result.source === "package"
+                ? "Package"
+                : "Documentation";
+}
+/**
+ * Derive a descriptive title from a file path by taking the basename,
+ * stripping extensions, and converting to title case.
+ */
+function titleFromPath(filePath) {
+    // Extract the file name: strip directories
+    const parts = filePath.split("/");
+    const base = parts[parts.length - 1] || filePath;
+    // Strip extensions (including .test.ts, .spec.tsx, etc.)
+    const name = base
+        .replace(/\.(test|spec)\.(ts|tsx|js|jsx)$/, "")
+        .replace(/\.(ts|tsx|js|jsx|json|md|txt|yaml|yml)$/, "");
+    // Convert kebab-case, snake_case, dots to spaces and title-case
+    return name
+        .replace(/[-_.]/g, " ")
+        .replace(/\b\w/g, (c) => c.toUpperCase())
+        .trim();
+}
+/**
+ * Compute tag overlap between two tag arrays. Returns the number of shared
+ * tags (case-insensitive), excluding the first tag of each (which is used
+ * for epic grouping) to avoid false matches on the epic tag alone.
+ */
+function tagOverlap(tagsA, tagsB) {
+    if (!tagsA || !tagsB || tagsA.length < 2 || tagsB.length < 2)
+        return 0;
+    // Skip the first tag (epic tag) from both sets to avoid inflated matches
+    const setB = new Set(tagsB.slice(1).map(normalize));
+    let count = 0;
+    for (const tag of tagsA.slice(1)) {
+        if (setB.has(normalize(tag)))
+            count++;
+    }
+    return count;
+}
+/**
+ * Compute effective priority for a feature by considering both its tasks'
+ * priorities and the feature's own priority from the scan result.
+ * Returns the numeric priority rank (lower = higher priority).
+ */
+function featurePriority(feat, scanPriority) {
+    const taskPris = feat.tasks.map((t) => priorityRank(t.priority));
+    // Include the feature-level priority from the scan result if available
+    if (scanPriority) {
+        taskPris.push(priorityRank(scanPriority));
+    }
+    return Math.min(...taskPris, 2);
+}
+export function buildProposals(results) {
+    // Deduplicate within proposal set: merge near-duplicates by kind
+    const deduped = deduplicateScanResults(results);
+    // Separate by kind
+    const epics = deduped.filter((r) => r.kind === "epic");
+    const features = deduped.filter((r) => r.kind === "feature");
+    const tasks = deduped.filter((r) => r.kind === "task");
+    // Group features and tasks by epic
+    const epicMap = new Map();
+    // Seed from explicit epics (preserve description)
+    for (const e of epics) {
+        const key = normalize(e.name);
+        if (!epicMap.has(key)) {
+            epicMap.set(key, {
+                source: e.source,
+                description: e.description,
+                features: new Map(),
+            });
+        }
+    }
+    // Build a map of feature-level priorities from scan results so we can
+    // use them during sorting (features may have their own priority distinct
+    // from their child tasks).
+    const featPriorities = new Map();
+    // Place features under epics
+    for (const f of features) {
+        const epicName = normalize(inferEpic(f));
+        if (!epicMap.has(epicName)) {
+            epicMap.set(epicName, { source: f.source, features: new Map() });
+        }
+        const epic = epicMap.get(epicName);
+        const fKey = normalize(f.name);
+        if (!epic.features.has(fKey)) {
+            epic.features.set(fKey, { result: f, tasks: [] });
+        }
+        if (f.priority) {
+            featPriorities.set(fKey, f.priority);
+        }
+    }
+    // Place tasks under features using multi-strategy matching:
+    // 1. Exact sourceFile match within same epic (strongest signal)
+    // 2. Tag overlap match within same epic (semantic grouping)
+    // 3. Cross-epic sourceFile match (file cohesion across epics)
+    // 4. Create implicit feature (fallback)
+    for (const t of tasks) {
+        const epicName = normalize(inferEpic(t));
+        if (!epicMap.has(epicName)) {
+            epicMap.set(epicName, { source: t.source, features: new Map() });
+        }
+        const epic = epicMap.get(epicName);
+        // Strategy 1: exact sourceFile match within same epic
+        let placed = false;
+        for (const [, feat] of epic.features) {
+            if (feat.result.sourceFile === t.sourceFile) {
+                feat.tasks.push(t);
+                placed = true;
+                break;
+            }
+        }
+        // Strategy 2: tag overlap — find the feature with the most shared tags
+        if (!placed && t.tags && t.tags.length > 0) {
+            let bestFeat = null;
+            let bestOverlap = 0;
+            for (const [, feat] of epic.features) {
+                const overlap = tagOverlap(t.tags, feat.result.tags);
+                if (overlap > bestOverlap) {
+                    bestOverlap = overlap;
+                    bestFeat = feat;
+                }
+            }
+            if (bestFeat && bestOverlap >= 1) {
+                bestFeat.tasks.push(t);
+                placed = true;
+            }
+        }
+        // Strategy 3: cross-epic sourceFile match — if a feature in another epic
+        // shares the same sourceFile, place the task there for file cohesion
+        if (!placed && t.sourceFile) {
+            for (const [, otherEpic] of epicMap) {
+                if (otherEpic === epic)
+                    continue;
+                for (const [, feat] of otherEpic.features) {
+                    if (feat.result.sourceFile === t.sourceFile) {
+                        feat.tasks.push(t);
+                        placed = true;
+                        break;
+                    }
+                }
+                if (placed)
+                    break;
+            }
+        }
+        if (!placed) {
+            // Create an implicit feature with a descriptive title from the file path
+            const implicitKey = normalize(t.sourceFile || t.name);
+            if (!epic.features.has(implicitKey)) {
+                const implicitTitle = t.sourceFile
+                    ? titleFromPath(t.sourceFile)
+                    : t.name;
+                epic.features.set(implicitKey, {
+                    result: {
+                        name: implicitTitle,
+                        source: t.source,
+                        sourceFile: t.sourceFile,
+                        kind: "feature",
+                    },
+                    tasks: [],
+                });
+            }
+            epic.features.get(implicitKey).tasks.push(t);
+        }
+    }
+    // Build final proposals
+    const proposals = [];
+    for (const [epicKey, epicData] of epicMap) {
+        // Skip empty epics that have no features
+        if (epicData.features.size === 0)
+            continue;
+        const featureList = [];
+        for (const [, feat] of epicData.features) {
+            // Sort tasks by priority
+            const sortedTasks = feat.tasks.sort((a, b) => priorityRank(a.priority) - priorityRank(b.priority));
+            featureList.push({
+                title: feat.result.name,
+                source: feat.result.source,
+                description: feat.result.description,
+                tasks: sortedTasks.map((t) => ({
+                    title: t.name,
+                    source: t.source,
+                    sourceFile: t.sourceFile,
+                    description: t.description,
+                    acceptanceCriteria: t.acceptanceCriteria,
+                    priority: t.priority,
+                    tags: t.tags,
+                })),
+            });
+        }
+        // Sort features: those with higher-priority content first.
+        // Consider both task priorities and feature-level priority from the
+        // scan result (features with no tasks use the feature's own priority).
+        featureList.sort((a, b) => {
+            const aPri = featurePriority(a, featPriorities.get(normalize(a.title)));
+            const bPri = featurePriority(b, featPriorities.get(normalize(b.title)));
+            return aPri - bPri;
+        });
+        // Use original casing for epic title from the first entry.
+        // Check explicit epic fields, then explicit epic results, then tag inference.
+        const epicTitle = epics.find((e) => normalize(e.name) === epicKey)?.name ??
+            features.find((f) => f.epic && normalize(f.epic) === epicKey)?.epic ??
+            tasks.find((t) => t.epic && normalize(t.epic) === epicKey)?.epic ??
+            features.find((f) => normalize(inferEpic(f)) === epicKey)?.tags?.[0] ??
+            tasks.find((t) => normalize(inferEpic(t)) === epicKey)?.tags?.[0] ??
+            epicKey;
+        proposals.push({
+            epic: {
+                title: epicTitle,
+                source: epicData.source,
+                description: epicData.description,
+            },
+            features: featureList,
+        });
+    }
+    // Sort proposals: those with higher-priority content first
+    proposals.sort((a, b) => {
+        const aPri = Math.min(...a.features.map((f) => featurePriority(f, featPriorities.get(normalize(f.title)))));
+        const bPri = Math.min(...b.features.map((f) => featurePriority(f, featPriorities.get(normalize(f.title)))));
+        return aPri - bPri;
+    });
+    return proposals;
+}
+//# sourceMappingURL=propose.js.map

package/packages/rex/dist/analyze/propose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"propose.js","sourceRoot":"","sources":["../../src/analyze/propose.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEpD,OAAO,EAAE,sBAAsB,EAAE,MAAM,aAAa,CAAC;AAmFrD,8EAA8E;AAC9E,SAAS,YAAY,CAAC,CAAqB;IACzC,OAAO,cAAc,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAa,CAAC,IAAI,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,SAAS,CAAC,CAAS;IAC1B,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,SAAS,CAAC,MAAkB;IACnC,gEAAgE;IAChE,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;QAChB,OAAO,MAAM,CAAC,IAAI,CAAC;IACrB,CAAC;IACD,gFAAgF;IAChF,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1C,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,2BAA2B;IAC3B,OAAO,MAAM,CAAC,MAAM,KAAK,cAAc;QACrC,CAAC,CAAC,cAAc;QAChB,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,MAAM;YACxB,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,SAAS;gBAC3B,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,eAAe,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,QAAgB;IACrC,2CAA2C;IAC3C,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC;IACjD,yDAAyD;IACzD,MAAM,IAAI,GAAG,IAAI;SACd,OAAO,CAAC,iCAAiC,EAAE,EAAE,CAAC;SAC9C,OAAO,CAAC,yCAAyC,EAAE,EAAE,CAAC,CAAC;IAC1D,gEAAgE;IAChE,OAAO,IAAI;SACR,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC;SACtB,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SACxC,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,KAAgB,EAAE,KAAgB;IACpD,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IACvE,yEAAyE;IACzE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;IACpD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACjC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAAE,KAAK,EAAE,CAAC;IACxC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD;;;;GAIG;AACH,SAAS,eAAe,CACtB,IAAqB,EACrB,YAAqB;IAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjE,uEAAuE;IACvE,IAAI,YAAY,EAAE,CAAC;QACjB,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,OAAqB;IAClD,iEAAiE;IACjE,MAAM,OAAO,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;IAEhD,mBAAmB;IACnB,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IAEvD,mCAAmC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;IAE7C,kDAAkD;IAClD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE;gBACf,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,WAAW,EAAE,CAAC,CAAC,WAAW;gBAC1B,QAAQ,EAAE,IAAI,GAAG,EAAE;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,yEAAyE;IACzE,2BAA2B;IAC3B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,6BAA6B;IAC7B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACpC,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YACf,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,gEAAgE;IAChE,4DAA4D;IAC5D,8DAA8D;IAC9D,wCAAwC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QAEpC,sDAAsD;QACtD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,EAAE,CAAC;gBAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM,GAAG,IAAI,CAAC;gBACd,MAAM;YACR,CAAC;QACH,CAAC;QAED,uEAAuE;QACvE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3C,IAAI,QAAQ,GAAuD,IAAI,CAAC;YACxE,IAAI,WAAW,GAAG,CAAC,CAAC;YAEpB,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACrD,IAAI,OAAO,GAAG,WAAW,EAAE,CAAC;oBAC1B,WAAW,GAAG,OAAO,CAAC;oBACtB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;gBACjC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvB,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QAED,yEAAyE;QACzE,qEAAqE;QACrE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;YAC5B,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;gBACpC,IAAI,SAAS,KAAK,IAAI;oBAAE,SAAS;gBACjC,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;oBAC1C,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,EAAE,CAAC;wBAC5C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACnB,MAAM,GAAG,IAAI,CAAC;wBACd,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,MAAM;oBAAE,MAAM;YACpB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,yEAAyE;YACzE,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACtD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACpC,MAAM,aAAa,GAAG,CAAC,CAAC,UAAU;oBAChC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC;oBAC7B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACX,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE;oBAC7B,MAAM,EAAE;wBACN,IAAI,EAAE,aAAa;wBACnB,MAAM,EAAE,CAAC,CAAC,MAAM;wBAChB,UAAU,EAAE,CAAC,CAAC,UAAU;wBACxB,IAAI,EAAE,SAAS;qBAChB;oBACD,KAAK,EAAE,EAAE;iBACV,CAAC,CAAC;YACL,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,wBAAwB;IACxB,MAAM,SAAS,GAAe,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,OAAO,EAAE,CAAC;QAC1C,yCAAyC;QACzC,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAE3C,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACzC,yBAAyB;YACzB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAC9D,CAAC;YAEF,WAAW,CAAC,IAAI,CAAC;gBACf,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;gBAC1B,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,WAAW;gBACpC,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC7B,KAAK,EAAE,CAAC,CAAC,IAAI;oBACb,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,UAAU,EAAE,CAAC,CAAC,UAAU;oBACxB,WAAW,EAAE,CAAC,CAAC,WAAW;oBAC1B,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;oBACxC,QAAQ,EAAE,CAAC,CAAC,QAAQ;oBACpB,IAAI,EAAE,CAAC,CAAC,IAAI;iBACb,CAAC,CAAC;aACJ,CAAC,CAAC;QACL,CAAC;QAED,2DAA2D;QAC3D,oEAAoE;QACpE,uEAAuE;QACvE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACxE,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACxE,OAAO,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,2DAA2D;QAC3D,8EAA8E;QAC9E,MAAM,SAAS,GACb,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,EAAE,IAAI;YACtD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,EAAE,IAAI;YACnE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,EAAE,IAAI;YAChE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YACpE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;YACjE,OAAO,CAAC;QAEV,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE;gBACJ,KAAK,EAAE,SAAS;gBAChB,MAAM,EAAE,QAAQ,CAAC,MAAM;gBACvB,WAAW,EAAE,QAAQ,CAAC,WAAW;aAClC;YACD,QAAQ,EAAE,WAAW;SACtB,CAAC,CAAC;IACL,CAAC;IAED,2DAA2D;IAC3D,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CACnB,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CACrF,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CACnB,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CACrF,CAAC;QACF,OAAO,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC;AACnB,CAAC"}