@n-dx/core 0.1.0

package/packages/rex/dist/cli/commands/smart-add-duplicates.js

@@ -0,0 +1,252 @@
+import { similarity } from "../../analyze/dedupe.js";
+import { walkTree } from "../../core/tree.js";
+const DUPLICATE_THRESHOLD = 0.7;
+function duplicateReasonTypeForMatch(match) {
+    if (!match.duplicate || !match.matchedItem)
+        return undefined;
+    if (match.matchedItem.status === "completed")
+        return "completed_item_match";
+    if (match.reason === "exact_title")
+        return "exact_title_match";
+    if (match.reason === "semantic_title")
+        return "semantic_match";
+    if (match.reason === "content_overlap")
+        return "content_overlap_match";
+    return undefined;
+}
+function buildDuplicateReasonExplanation(match) {
+    if (!match.matchedItem)
+        return "";
+    const level = match.matchedItem.level;
+    const title = match.matchedItem.title;
+    const status = match.matchedItem.status;
+    if (status === "completed") {
+        return `Matches completed ${level} "${title}".`;
+    }
+    if (match.reason === "exact_title") {
+        return `Exact title match with existing ${level} "${title}".`;
+    }
+    if (match.reason === "content_overlap") {
+        return `Overlapping content with existing ${level} "${title}".`;
+    }
+    return `Semantic title match with existing ${level} "${title}".`;
+}
+/**
+ * Build proposal-facing duplicate metadata. Returns undefined for non-duplicates.
+ */
+export function buildDuplicateReasonMetadata(match) {
+    if (!match.duplicate || !match.matchedItem || match.reason === "none") {
+        return undefined;
+    }
+    const type = duplicateReasonTypeForMatch(match);
+    if (!type)
+        return undefined;
+    return {
+        type,
+        matchedItem: {
+            id: match.matchedItem.id,
+            title: match.matchedItem.title,
+            level: match.matchedItem.level,
+            status: match.matchedItem.status,
+        },
+        explanation: buildDuplicateReasonExplanation(match),
+    };
+}
+/**
+ * Build persisted audit metadata for an explicit duplicate override.
+ * Returns undefined for non-duplicate matches.
+ */
+export function buildDuplicateOverrideMarker(match, createdAt) {
+    if (!match.duplicate || !match.matchedItem || match.reason === "none") {
+        return undefined;
+    }
+    return {
+        type: "duplicate_guard_override",
+        reason: match.reason,
+        reasonRef: `${match.reason}:${match.matchedItem.id}`,
+        matchedItemId: match.matchedItem.id,
+        matchedItemTitle: match.matchedItem.title,
+        matchedItemLevel: match.matchedItem.level,
+        matchedItemStatus: match.matchedItem.status,
+        createdAt,
+    };
+}
+/**
+ * Build marker map keyed by proposal node key for use during item creation.
+ */
+export function buildDuplicateOverrideMarkerIndex(matches, createdAt) {
+    const markers = {};
+    for (const match of matches) {
+        const marker = buildDuplicateOverrideMarker(match, createdAt);
+        if (marker)
+            markers[match.node.key] = marker;
+    }
+    return markers;
+}
+/**
+ * Attach structured duplicate reason metadata to matched proposal nodes.
+ * Non-duplicate nodes are returned without duplicate metadata.
+ */
+export function attachDuplicateReasonsToProposals(proposals, matches) {
+    const reasonByNodeKey = new Map();
+    for (const match of matches) {
+        const reason = buildDuplicateReasonMetadata(match);
+        if (reason)
+            reasonByNodeKey.set(match.node.key, reason);
+    }
+    return proposals.map((proposal, pIdx) => {
+        const epicKey = `p${pIdx}:epic`;
+        const epicReason = reasonByNodeKey.get(epicKey);
+        return {
+            epic: {
+                title: proposal.epic.title,
+                source: proposal.epic.source,
+                description: proposal.epic.description,
+                ...(epicReason ? { duplicateReason: epicReason } : {}),
+            },
+            features: proposal.features.map((feature, fIdx) => {
+                const featureKey = `p${pIdx}:feature:${fIdx}`;
+                const featureReason = reasonByNodeKey.get(featureKey);
+                return {
+                    title: feature.title,
+                    source: feature.source,
+                    description: feature.description,
+                    ...(featureReason ? { duplicateReason: featureReason } : {}),
+                    tasks: feature.tasks.map((task, tIdx) => {
+                        const taskKey = `p${pIdx}:task:${fIdx}:${tIdx}`;
+                        const taskReason = reasonByNodeKey.get(taskKey);
+                        return {
+                            title: task.title,
+                            source: task.source,
+                            sourceFile: task.sourceFile,
+                            description: task.description,
+                            acceptanceCriteria: task.acceptanceCriteria,
+                            priority: task.priority,
+                            tags: task.tags,
+                            ...(taskReason ? { duplicateReason: taskReason } : {}),
+                        };
+                    }),
+                };
+            }),
+        };
+    });
+}
+function normalize(text) {
+    return text.toLowerCase().trim().replace(/\s+/g, " ");
+}
+function titleContains(a, b) {
+    if (a.length < 5 || b.length < 5)
+        return false;
+    return a.includes(b) || b.includes(a);
+}
+function buildNodeContent(node) {
+    const parts = [];
+    if (node.description)
+        parts.push(node.description);
+    if (node.acceptanceCriteria?.length)
+        parts.push(node.acceptanceCriteria.join(" "));
+    return parts.join(" ").trim();
+}
+function buildItemContent(item) {
+    const parts = [];
+    if (item.description)
+        parts.push(item.description);
+    if (item.acceptanceCriteria?.length)
+        parts.push(item.acceptanceCriteria.join(" "));
+    return parts.join(" ").trim();
+}
+function scoreNodeAgainstItem(node, item) {
+    // Only match items at the same level (epic↔epic, feature↔feature, task↔task)
+    if (node.kind !== item.level)
+        return null;
+    const nodeTitle = normalize(node.title);
+    const itemTitle = normalize(item.title);
+    if (nodeTitle === itemTitle) {
+        return { item, score: 1, reason: "exact_title" };
+    }
+    if (titleContains(nodeTitle, itemTitle)) {
+        return { item, score: 0.95, reason: "semantic_title" };
+    }
+    const titleScore = similarity(node.title, item.title);
+    const nodeContent = buildNodeContent(node);
+    const itemContent = buildItemContent(item);
+    const contentScore = nodeContent.length > 0 && itemContent.length > 0
+        ? similarity(nodeContent, itemContent)
+        : 0;
+    const blended = Math.max(titleScore, (titleScore * 0.75) + (contentScore * 0.25), contentScore * 0.7);
+    const isDuplicate = blended >= DUPLICATE_THRESHOLD ||
+        (titleScore >= 0.62 && contentScore >= 0.55);
+    if (!isDuplicate)
+        return null;
+    return {
+        item,
+        score: blended,
+        reason: contentScore > titleScore ? "content_overlap" : "semantic_title",
+    };
+}
+export function flattenProposalNodes(proposals) {
+    const nodes = [];
+    for (let pIdx = 0; pIdx < proposals.length; pIdx++) {
+        const proposal = proposals[pIdx];
+        nodes.push({
+            key: `p${pIdx}:epic`,
+            kind: "epic",
+            title: proposal.epic.title,
+        });
+        for (let fIdx = 0; fIdx < proposal.features.length; fIdx++) {
+            const feature = proposal.features[fIdx];
+            nodes.push({
+                key: `p${pIdx}:feature:${fIdx}`,
+                kind: "feature",
+                title: feature.title,
+                description: feature.description,
+            });
+            for (let tIdx = 0; tIdx < feature.tasks.length; tIdx++) {
+                const task = feature.tasks[tIdx];
+                nodes.push({
+                    key: `p${pIdx}:task:${fIdx}:${tIdx}`,
+                    kind: "task",
+                    title: task.title,
+                    description: task.description,
+                    acceptanceCriteria: task.acceptanceCriteria,
+                });
+            }
+        }
+    }
+    return nodes;
+}
+export function matchProposalNodeToPRD(node, existingItems) {
+    let best = null;
+    for (const { item } of walkTree(existingItems)) {
+        const candidate = scoreNodeAgainstItem(node, item);
+        if (!candidate)
+            continue;
+        if (!best || candidate.score > best.score) {
+            best = candidate;
+        }
+    }
+    if (!best) {
+        return {
+            node,
+            duplicate: false,
+            reason: "none",
+            score: 0,
+        };
+    }
+    return {
+        node,
+        duplicate: true,
+        reason: best.reason,
+        score: best.score,
+        matchedItem: {
+            id: best.item.id,
+            title: best.item.title,
+            level: best.item.level,
+            status: best.item.status,
+        },
+    };
+}
+export function matchProposalNodesToPRD(proposals, existingItems) {
+    return flattenProposalNodes(proposals).map((node) => matchProposalNodeToPRD(node, existingItems));
+}
+//# sourceMappingURL=smart-add-duplicates.js.map

package/packages/rex/dist/cli/commands/smart-add-duplicates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"smart-add-duplicates.js","sourceRoot":"","sources":["../../../src/cli/commands/smart-add-duplicates.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAS9C,MAAM,mBAAmB,GAAG,GAAG,CAAC;AA4BhC,SAAS,2BAA2B,CAAC,KAA6B;IAChE,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,WAAW;QAAE,OAAO,SAAS,CAAC;IAC7D,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,KAAK,WAAW;QAAE,OAAO,sBAAsB,CAAC;IAC5E,IAAI,KAAK,CAAC,MAAM,KAAK,aAAa;QAAE,OAAO,mBAAmB,CAAC;IAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,gBAAgB;QAAE,OAAO,gBAAgB,CAAC;IAC/D,IAAI,KAAK,CAAC,MAAM,KAAK,iBAAiB;QAAE,OAAO,uBAAuB,CAAC;IACvE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,+BAA+B,CAAC,KAA6B;IACpE,IAAI,CAAC,KAAK,CAAC,WAAW;QAAE,OAAO,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC;IACtC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC;IACtC,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC;IAExC,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;QAC3B,OAAO,qBAAqB,KAAK,KAAK,KAAK,IAAI,CAAC;IAClD,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;QACnC,OAAO,mCAAmC,KAAK,KAAK,KAAK,IAAI,CAAC;IAChE,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,iBAAiB,EAAE,CAAC;QACvC,OAAO,qCAAqC,KAAK,KAAK,KAAK,IAAI,CAAC;IAClE,CAAC;IACD,OAAO,sCAAsC,KAAK,KAAK,KAAK,IAAI,CAAC;AACnE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,4BAA4B,CAC1C,KAA6B;IAE7B,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QACtE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,IAAI,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;IAChD,IAAI,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC;IAE5B,OAAO;QACL,IAAI;QACJ,WAAW,EAAE;YACX,EAAE,EAAE,KAAK,CAAC,WAAW,CAAC,EAAE;YACxB,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,KAAK;YAC9B,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,KAAK;YAC9B,MAAM,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM;SACjC;QACD,WAAW,EAAE,+BAA+B,CAAC,KAAK,CAAC;KACpD,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,4BAA4B,CAC1C,KAA6B,EAC7B,SAAiB;IAEjB,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QACtE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,OAAO;QACL,IAAI,EAAE,0BAA0B;QAChC,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,SAAS,EAAE,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE;QACpD,aAAa,EAAE,KAAK,CAAC,WAAW,CAAC,EAAE;QACnC,gBAAgB,EAAE,KAAK,CAAC,WAAW,CAAC,KAAK;QACzC,gBAAgB,EAAE,KAAK,CAAC,WAAW,CAAC,KAAK;QACzC,iBAAiB,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM;QAC3C,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iCAAiC,CAC/C,OAAiC,EACjC,SAAiB;IAEjB,MAAM,OAAO,GAA4C,EAAE,CAAC;IAC5D,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,4BAA4B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,MAAM;YAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IAC/C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iCAAiC,CAC/C,SAAqB,EACrB,OAAiC;IAEjC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAmC,CAAC;IACnE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,4BAA4B,CAAC,KAAK,CAAC,CAAC;QACnD,IAAI,MAAM;YAAE,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE;QACtC,MAAM,OAAO,GAAG,IAAI,IAAI,OAAO,CAAC;QAChC,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAEhD,OAAO;YACL,IAAI,EAAE;gBACJ,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK;gBAC1B,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM;gBAC5B,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,WAAW;gBACtC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACvD;YACD,QAAQ,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE;gBAChD,MAAM,UAAU,GAAG,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;gBAC9C,MAAM,aAAa,GAAG,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAEtD,OAAO;oBACL,KAAK,EAAE,OAAO,CAAC,KAAK;oBACpB,MAAM,EAAE,OAAO,CAAC,MAAM;oBACtB,WAAW,EAAE,OAAO,CAAC,WAAW;oBAChC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5D,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;wBACtC,MAAM,OAAO,GAAG,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC;wBAChD,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;wBAChD,OAAO;4BACL,KAAK,EAAE,IAAI,CAAC,KAAK;4BACjB,MAAM,EAAE,IAAI,CAAC,MAAM;4BACnB,UAAU,EAAE,IAAI,CAAC,UAAU;4BAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;4BAC7B,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;4BAC3C,QAAQ,EAAE,IAAI,CAAC,QAAQ;4BACvB,IAAI,EAAE,IAAI,CAAC,IAAI;4BACf,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;yBACvD,CAAC;oBACJ,CAAC,CAAC;iBACH,CAAC;YACJ,CAAC,CAAC;SACH,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAQD,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,aAAa,CAAC,CAAS,EAAE,CAAS;IACzC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/C,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAkB;IAC1C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,IAAI,CAAC,WAAW;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnD,IAAI,IAAI,CAAC,kBAAkB,EAAE,MAAM;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACnF,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAa;IACrC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,IAAI,CAAC,WAAW;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnD,IAAI,IAAI,CAAC,kBAAkB,EAAE,MAAM;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACnF,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAkB,EAAE,IAAa;IAC7D,6EAA6E;IAC7E,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAE1C,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAExC,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;IACnD,CAAC;IAED,IAAI,aAAa,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,CAAC;QACxC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC;IACzD,CAAC;IAED,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACtD,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,YAAY,GAChB,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;QAC9C,CAAC,CAAC,UAAU,CAAC,WAAW,EAAE,WAAW,CAAC;QACtC,CAAC,CAAC,CAAC,CAAC;IAER,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CACtB,UAAU,EACV,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,IAAI,CAAC,EAC3C,YAAY,GAAG,GAAG,CACnB,CAAC;IAEF,MAAM,WAAW,GACf,OAAO,IAAI,mBAAmB;QAC9B,CAAC,UAAU,IAAI,IAAI,IAAI,YAAY,IAAI,IAAI,CAAC,CAAC;IAE/C,IAAI,CAAC,WAAW;QAAE,OAAO,IAAI,CAAC;IAE9B,OAAO;QACL,IAAI;QACJ,KAAK,EAAE,OAAO;QACd,MAAM,EAAE,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,gBAAgB;KACzE,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,SAAqB;IACxD,MAAM,KAAK,GAAmB,EAAE,CAAC;IAEjC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;QACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC;YACT,GAAG,EAAE,IAAI,IAAI,OAAO;YACpB,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK;SAC3B,CAAC,CAAC;QAEH,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAC3D,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC;gBACT,GAAG,EAAE,IAAI,IAAI,YAAY,IAAI,EAAE;gBAC/B,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,WAAW,EAAE,OAAO,CAAC,WAAW;aACjC,CAAC,CAAC;YAEH,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;gBACvD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC;oBACT,GAAG,EAAE,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,EAAE;oBACpC,IAAI,EAAE,MAAM;oBACZ,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;iBAC5C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,sBAAsB,CACpC,IAAkB,EAClB,aAAwB;IAExB,IAAI,IAAI,GAA0B,IAAI,CAAC;IAEvC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;QAC/C,MAAM,SAAS,GAAG,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS;YAAE,SAAS;QACzB,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1C,IAAI,GAAG,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO;YACL,IAAI;YACJ,SAAS,EAAE,KAAK;YAChB,MAAM,EAAE,MAAM;YACd,KAAK,EAAE,CAAC;SACT,CAAC;IACJ,CAAC;IAED,OAAO;QACL,IAAI;QACJ,SAAS,EAAE,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,WAAW,EAAE;YACX,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YAChB,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK;YACtB,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK;YACtB,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;SACzB;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,SAAqB,EACrB,aAAwB;IAExB,OAAO,oBAAoB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAClD,sBAAsB,CAAC,IAAI,EAAE,aAAa,CAAC,CAC5C,CAAC;AACJ,CAAC"}

package/packages/rex/dist/cli/commands/smart-add.d.ts

@@ -0,0 +1,80 @@
+import type { Proposal, QualityIssue } from "../../analyze/index.js";
+import type { ItemLevel } from "../../schema/index.js";
+import type { ProposalDuplicateMatch } from "./smart-add-duplicates.js";
+import type { LLMVendor } from "@n-dx/llm-client";
+/**
+ * Count total items that will be added across proposals.
+ *
+ * When `parentLevel` is provided, the count reflects which items actually get
+ * created (e.g. when scoped to an epic, the epic itself is not counted; when
+ * scoped to a feature, only tasks are counted).
+ */
+export declare function countProposalItems(proposals: Proposal[], parentLevel?: ItemLevel): number;
+/**
+ * Format proposals as a readable tree with indentation and item metadata.
+ * Shows numbered headers when there are multiple proposals.
+ *
+ * When `parentLevel` is provided, the display adapts to show items at the
+ * correct hierarchy level relative to the parent (e.g. when the parent is
+ * a feature, proposal features' tasks are shown as tasks under that feature).
+ */
+export declare function formatProposalTree(proposals: Proposal[], parentLevel?: ItemLevel, thresholdWeeks?: number): string;
+/**
+ * Build a summary line showing the breakdown of items by level.
+ * Example: "1 epic, 2 features, 5 tasks"
+ */
+export declare function formatProposalSummary(proposals: Proposal[], parentLevel?: ItemLevel): string;
+/** Filter proposals by their 0-based indices. Out-of-range indices are ignored. */
+export declare function filterProposalsByIndex(proposals: Proposal[], indices: number[]): Proposal[];
+/**
+ * Parse approval input. Accepts:
+ *   "y", "yes", "a", "all" → approve all
+ *   "n", "no", "none"       → reject all
+ *   "1,3", "1 3", "1, 3"    → approve specific proposals by number (1-based)
+ */
+export declare function parseApprovalInput(input: string, totalProposals: number): {
+    approved: number[];
+} | "all" | "none";
+export type DuplicatePromptDecision = "cancel" | "merge" | "proceed";
+/**
+ * Parse duplicate confirmation input from the explicit override prompt.
+ * Empty/invalid input defaults to "cancel" for safety.
+ */
+export declare function parseDuplicatePromptInput(input: string): DuplicatePromptDecision;
+export declare function applyDuplicateProposalMerges(dir: string, proposals: Proposal[], duplicateMatches: ProposalDuplicateMatch[]): Promise<{
+    mergedCount: number;
+    mergeTargetsByNodeKey: Record<string, string>;
+    reopenedItemIds: string[];
+}>;
+/**
+ * Keep only matches for selected proposal indices and remap node keys so the
+ * selected subset can be accepted with 0-based contiguous proposal indices.
+ */
+export declare function remapDuplicateMatchesForSelectedProposals(matches: ProposalDuplicateMatch[], selectedProposalIndices: number[]): ProposalDuplicateMatch[];
+/**
+ * Parse granularity adjustment input from the approval prompt.
+ * Accepts:
+ *   "b1,3" or "b 1 3" or "break down 1,3"  → break down proposals 1 and 3
+ *   "c1,3" or "c 1 3" or "consolidate 1,3"  → consolidate proposals 1 and 3
+ *
+ * Returns null if the input is not a granularity command.
+ */
+export declare function parseGranularityInput(input: string, totalProposals: number): {
+    direction: "break_down" | "consolidate";
+    indices: number[];
+} | null;
+/**
+ * Classify an LLM error and return a user-friendly message + suggestion.
+ * Covers auth failures, network issues, rate limits, response parsing, and
+ * model/API availability problems.
+ */
+export declare function classifySmartAddError(err: Error, mode: "description" | "file", vendor?: LLMVendor): {
+    message: string;
+    suggestion: string;
+};
+/**
+ * Format quality issues as a human-readable warning block.
+ * Returns empty string when there are no issues.
+ */
+export declare function formatQualityWarnings(issues: QualityIssue[]): string;
+export declare function cmdSmartAdd(dir: string, descriptions: string | string[], flags: Record<string, string>, multiFlags?: Record<string, string[]>): Promise<void>;