@n-dx/core 0.1.0

package/packages/rex/dist/core/remove-feature.js

@@ -0,0 +1,189 @@
+import { getLevelLabel } from "../schema/index.js";
+import { findItem, walkTree } from "./tree.js";
+import { deleteItem } from "./delete.js";
+import { extractSyncMeta } from "./sync.js";
+// ── Pre-check ────────────────────────────────────────────────────────────────
+/**
+ * Run pre-deletion integrity checks on a feature.
+ *
+ * Inspects the feature's subtree for:
+ * 1. **External dependents** — items outside the subtree that reference
+ *    items inside via `blockedBy`. Deleting would leave dangling references.
+ * 2. **Synced items** — items in the subtree that carry sync metadata
+ *    (`remoteId`). Deleting locally without syncing the deletion to the
+ *    remote system risks data corruption.
+ *
+ * @param items     - The root-level PRD item array (read-only).
+ * @param featureId - The ID of the feature to check.
+ * @returns Pre-check result with safety assessment and warnings.
+ */
+export function preCheckFeatureDeletion(items, featureId) {
+    const entry = findItem(items, featureId);
+    if (!entry) {
+        return {
+            featureId,
+            featureTitle: "",
+            subtreeCount: 0,
+            externalDependents: [],
+            syncedItems: [],
+            safe: false,
+            warnings: [`Feature "${featureId}" not found in the PRD tree.`],
+        };
+    }
+    if (entry.item.level !== "feature") {
+        return {
+            featureId,
+            featureTitle: entry.item.title,
+            subtreeCount: 0,
+            externalDependents: [],
+            syncedItems: [],
+            safe: false,
+            warnings: [`Item "${featureId}" is a ${getLevelLabel(entry.item.level)}, not a ${getLevelLabel("feature")}.`],
+        };
+    }
+    // Collect all IDs in the feature's subtree
+    const subtreeIds = new Set();
+    function collectIds(item) {
+        subtreeIds.add(item.id);
+        if (item.children) {
+            for (const child of item.children) {
+                collectIds(child);
+            }
+        }
+    }
+    collectIds(entry.item);
+    // Find external dependents: items outside the subtree whose blockedBy
+    // references point to items inside the subtree
+    const externalDependents = [];
+    for (const { item } of walkTree(items)) {
+        if (subtreeIds.has(item.id))
+            continue; // skip items inside the subtree
+        if (!item.blockedBy || item.blockedBy.length === 0)
+            continue;
+        for (const ref of item.blockedBy) {
+            if (subtreeIds.has(ref)) {
+                externalDependents.push({
+                    itemId: item.id,
+                    title: item.title,
+                    blockedById: ref,
+                });
+            }
+        }
+    }
+    // Find synced items: items in the subtree with remoteId
+    const syncedItems = [];
+    function checkSync(item) {
+        const meta = extractSyncMeta(item);
+        if (meta.remoteId) {
+            syncedItems.push({
+                itemId: item.id,
+                title: item.title,
+                remoteId: meta.remoteId,
+            });
+        }
+        if (item.children) {
+            for (const child of item.children) {
+                checkSync(child);
+            }
+        }
+    }
+    checkSync(entry.item);
+    // Build warnings
+    const warnings = [];
+    if (externalDependents.length > 0) {
+        const depCount = externalDependents.length;
+        const preview = externalDependents
+            .slice(0, 3)
+            .map((d) => `"${d.title}" [${d.itemId.slice(0, 8)}]`)
+            .join(", ");
+        const more = depCount > 3 ? ` +${depCount - 3} more` : "";
+        warnings.push(`${depCount} external item${depCount === 1 ? "" : "s"} depend${depCount === 1 ? "s" : ""} on items in this feature: ${preview}${more}. ` +
+            `Their blockedBy references will be removed.`);
+    }
+    if (syncedItems.length > 0) {
+        const syncCount = syncedItems.length;
+        const preview = syncedItems
+            .slice(0, 3)
+            .map((s) => `"${s.title}" [${s.itemId.slice(0, 8)}]`)
+            .join(", ");
+        const more = syncCount > 3 ? ` +${syncCount - 3} more` : "";
+        warnings.push(`${syncCount} item${syncCount === 1 ? "" : "s"} in this feature ${syncCount === 1 ? "is" : "are"} synced to an external system: ${preview}${more}. ` +
+            `Deleting locally may cause data inconsistency with the remote.`);
+    }
+    const safe = externalDependents.length === 0 && syncedItems.length === 0;
+    return {
+        featureId,
+        featureTitle: entry.item.title,
+        subtreeCount: subtreeIds.size,
+        externalDependents,
+        syncedItems,
+        safe,
+        warnings,
+    };
+}
+// ── Removal ──────────────────────────────────────────────────────────────────
+/**
+ * Remove a feature and all its descendants from the PRD tree with
+ * full integrity protection.
+ *
+ * This is a safe, atomic operation:
+ * - Validates the target exists and is actually a feature before mutating.
+ * - Removes the feature and every nested task/subtask.
+ * - Cleans up `blockedBy` references in remaining items that pointed
+ *   to any of the deleted items.
+ *
+ * The function mutates `items` in place (consistent with {@link deleteItem}
+ * and {@link removeEpic}).
+ *
+ * @param items     - The root-level PRD item array (mutated on success).
+ * @param featureId - The ID of the feature to remove.
+ * @returns A result object describing success/failure, deleted IDs, and
+ *          the number of cleaned-up blockedBy references.
+ */
+export function removeFeature(items, featureId) {
+    // 1. Validate the item exists
+    const entry = findItem(items, featureId);
+    if (!entry) {
+        return {
+            ok: false,
+            deletedIds: [],
+            detail: `Feature "${featureId}" not found.`,
+            error: `Item "${featureId}" not found in the PRD tree.`,
+            cleanedRefs: 0,
+        };
+    }
+    // 2. Validate it's actually a feature
+    if (entry.item.level !== "feature") {
+        return {
+            ok: false,
+            deletedIds: [],
+            detail: `Item "${featureId}" is a ${getLevelLabel(entry.item.level)}, not a ${getLevelLabel("feature")}.`,
+            error: `Item "${entry.item.title}" (${featureId}) is not a ${getLevelLabel("feature")} — it is a ${getLevelLabel(entry.item.level)}.`,
+            cleanedRefs: 0,
+        };
+    }
+    const featureTitle = entry.item.title;
+    // 3. Delete the feature and all descendants
+    const deletedIds = deleteItem(items, featureId);
+    const deletedSet = new Set(deletedIds);
+    // 4. Clean up blockedBy references pointing to deleted items.
+    //    Count how many individual references are removed.
+    let cleanedRefs = 0;
+    for (const { item } of walkTree(items)) {
+        if (item.blockedBy && item.blockedBy.length > 0) {
+            const before = item.blockedBy.length;
+            item.blockedBy = item.blockedBy.filter((ref) => !deletedSet.has(ref));
+            cleanedRefs += before - item.blockedBy.length;
+            if (item.blockedBy.length === 0) {
+                delete item.blockedBy;
+            }
+        }
+    }
+    return {
+        ok: true,
+        deletedIds,
+        detail: `Removed feature: ${featureTitle} (${deletedIds.length} item(s) deleted, ${cleanedRefs} reference(s) cleaned)`,
+        cleanedRefs,
+    };
+}
+//# sourceMappingURL=remove-feature.js.map

package/packages/rex/dist/core/remove-feature.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-feature.js","sourceRoot":"","sources":["../../src/core/remove-feature.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,UAAU,EAAsB,MAAM,aAAa,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAyE5C,gFAAgF;AAEhF;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAgB,EAChB,SAAiB;IAEjB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO;YACL,SAAS;YACT,YAAY,EAAE,EAAE;YAChB,YAAY,EAAE,CAAC;YACf,kBAAkB,EAAE,EAAE;YACtB,WAAW,EAAE,EAAE;YACf,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,CAAC,YAAY,SAAS,8BAA8B,CAAC;SAChE,CAAC;IACJ,CAAC;IAED,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO;YACL,SAAS;YACT,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK;YAC9B,YAAY,EAAE,CAAC;YACf,kBAAkB,EAAE,EAAE;YACtB,WAAW,EAAE,EAAE;YACf,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,CAAC,SAAS,SAAS,UAAU,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC;SAC9G,CAAC;IACJ,CAAC;IAED,2CAA2C;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,SAAS,UAAU,CAAC,IAAa;QAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,UAAU,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IACD,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEvB,sEAAsE;IACtE,+CAA+C;IAC/C,MAAM,kBAAkB,GAAwB,EAAE,CAAC;IACnD,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,gCAAgC;QACvE,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAE7D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,kBAAkB,CAAC,IAAI,CAAC;oBACtB,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,WAAW,EAAE,GAAG;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,SAAS,SAAS,CAAC,IAAa;QAC9B,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,WAAW,CAAC,IAAI,CAAC;gBACf,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;aACxB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,SAAS,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAEtB,iBAAiB;IACjB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,CAAC;QAC3C,MAAM,OAAO,GAAG,kBAAkB;aAC/B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;aACpD,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,QAAQ,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,QAAQ,CAAC,IAAI,CACX,GAAG,QAAQ,iBAAiB,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,UAAU,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,8BAA8B,OAAO,GAAG,IAAI,IAAI;YACxI,6CAA6C,CAC9C,CAAC;IACJ,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC;QACrC,MAAM,OAAO,GAAG,WAAW;aACxB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;aACpD,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,QAAQ,CAAC,IAAI,CACX,GAAG,SAAS,QAAQ,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,oBAAoB,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,kCAAkC,OAAO,GAAG,IAAI,IAAI;YACpJ,gEAAgE,CACjE,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC;IAEzE,OAAO;QACL,SAAS;QACT,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK;QAC9B,YAAY,EAAE,UAAU,CAAC,IAAI;QAC7B,kBAAkB;QAClB,WAAW;QACX,IAAI;QACJ,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAgB,EAChB,SAAiB;IAEjB,8BAA8B;IAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO;YACL,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,EAAE;YACd,MAAM,EAAE,YAAY,SAAS,cAAc;YAC3C,KAAK,EAAE,SAAS,SAAS,8BAA8B;YACvD,WAAW,EAAE,CAAC;SACf,CAAC;IACJ,CAAC;IAED,sCAAsC;IACtC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QACnC,OAAO;YACL,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,EAAE;YACd,MAAM,EAAE,SAAS,SAAS,UAAU,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,aAAa,CAAC,SAAS,CAAC,GAAG;YACzG,KAAK,EAAE,SAAS,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,SAAS,cAAc,aAAa,CAAC,SAAS,CAAC,cAAc,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;YACrI,WAAW,EAAE,CAAC;SACf,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IAEtC,4CAA4C;IAC5C,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IAEvC,8DAA8D;IAC9D,uDAAuD;IACvD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;YACrC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,WAAW,IAAI,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;YAC9C,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC,SAAS,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,EAAE,EAAE,IAAI;QACR,UAAU;QACV,MAAM,EAAE,oBAAoB,YAAY,KAAK,UAAU,CAAC,MAAM,qBAAqB,WAAW,wBAAwB;QACtH,WAAW;KACZ,CAAC;AACJ,CAAC"}

package/packages/rex/dist/core/remove-task.d.ts

@@ -0,0 +1,66 @@
+import type { PRDItem } from "../schema/index.js";
+/**
+ * Descriptor for a parent item that is eligible for auto-completion
+ * after the task removal.
+ */
+export interface ParentAutoCompletion {
+    /** ID of the parent item. */
+    id: string;
+    /** Title of the parent item. */
+    title: string;
+    /** Level of the parent item (feature, epic). */
+    level: string;
+}
+/**
+ * Result of a {@link removeTask} operation.
+ *
+ * On success, `ok` is `true` and `deletedIds` contains the IDs of every
+ * item removed (the task itself plus any subtasks). On failure, `ok`
+ * is `false`, `error` explains why, and the tree is left unchanged.
+ */
+export interface RemoveTaskResult {
+    /** Whether the removal succeeded. */
+    ok: boolean;
+    /** IDs of all items removed (task + descendants). Empty on failure. */
+    deletedIds: string[];
+    /** Human-readable description of what happened. */
+    detail: string;
+    /** Error message when `ok` is `false`. Undefined on success. */
+    error?: string;
+    /**
+     * Parent items that are now eligible for auto-completion because all
+     * their remaining children are in a terminal state (completed/deferred).
+     *
+     * Ordered bottom-up (immediate parent first, then grandparent, etc.).
+     * The caller is responsible for actually updating these items' status —
+     * this function only identifies candidates, consistent with
+     * {@link findAutoCompletions}.
+     *
+     * Empty when:
+     * - The operation failed.
+     * - The parent still has pending/in_progress children.
+     * - The parent has no remaining children (empty parents don't auto-complete).
+     * - The parent is already completed or in a non-completable state.
+     */
+    parentAutoCompletions: ParentAutoCompletion[];
+}
+/**
+ * Remove a task and all its subtasks from the PRD tree.
+ *
+ * This is a safe, atomic operation:
+ * - Validates the target exists and is actually a task before mutating.
+ * - Removes the task and every nested subtask.
+ * - Cleans up `blockedBy` references in remaining items that pointed
+ *   to any of the deleted items.
+ * - Identifies parent items that are now eligible for auto-completion
+ *   (all remaining children completed or deferred).
+ *
+ * The function mutates `items` in place (consistent with {@link deleteItem}
+ * and {@link pruneItems}).
+ *
+ * @param items  - The root-level PRD item array (mutated on success).
+ * @param taskId - The ID of the task to remove.
+ * @returns A result object describing success/failure, deleted IDs, and
+ *          parent auto-completion candidates.
+ */
+export declare function removeTask(items: PRDItem[], taskId: string): RemoveTaskResult;

package/packages/rex/dist/core/remove-task.js

@@ -0,0 +1,93 @@
+import { getLevelLabel } from "../schema/index.js";
+import { findItem } from "./tree.js";
+import { deleteItem, cleanBlockedByRefs } from "./delete.js";
+/**
+ * Statuses that count as terminal for auto-completion checks.
+ * A parent is auto-completable only when every remaining child has one of these.
+ */
+const TERMINAL_STATUSES = new Set(["completed", "deferred"]);
+/**
+ * Statuses where a parent is eligible for auto-completion.
+ * Already-completed, deferred, or blocked parents are left alone.
+ */
+const AUTO_COMPLETABLE_STATUSES = new Set(["pending", "in_progress"]);
+/**
+ * Remove a task and all its subtasks from the PRD tree.
+ *
+ * This is a safe, atomic operation:
+ * - Validates the target exists and is actually a task before mutating.
+ * - Removes the task and every nested subtask.
+ * - Cleans up `blockedBy` references in remaining items that pointed
+ *   to any of the deleted items.
+ * - Identifies parent items that are now eligible for auto-completion
+ *   (all remaining children completed or deferred).
+ *
+ * The function mutates `items` in place (consistent with {@link deleteItem}
+ * and {@link pruneItems}).
+ *
+ * @param items  - The root-level PRD item array (mutated on success).
+ * @param taskId - The ID of the task to remove.
+ * @returns A result object describing success/failure, deleted IDs, and
+ *          parent auto-completion candidates.
+ */
+export function removeTask(items, taskId) {
+    // 1. Validate the item exists
+    const entry = findItem(items, taskId);
+    if (!entry) {
+        return {
+            ok: false,
+            deletedIds: [],
+            detail: `Task "${taskId}" not found.`,
+            error: `Item "${taskId}" not found in the PRD tree.`,
+            parentAutoCompletions: [],
+        };
+    }
+    // 2. Validate it's actually a task
+    if (entry.item.level !== "task") {
+        return {
+            ok: false,
+            deletedIds: [],
+            detail: `Item "${taskId}" is a ${getLevelLabel(entry.item.level)}, not a ${getLevelLabel("task")}.`,
+            error: `Item "${entry.item.title}" (${taskId}) is not a ${getLevelLabel("task")} — it is a ${getLevelLabel(entry.item.level)}.`,
+            parentAutoCompletions: [],
+        };
+    }
+    const taskTitle = entry.item.title;
+    const parents = entry.parents;
+    // 3. Delete the task and all descendants (subtasks)
+    const deletedIds = deleteItem(items, taskId);
+    // 4. Clean up blockedBy references pointing to deleted items
+    cleanBlockedByRefs(items, new Set(deletedIds));
+    // 5. Check for parent auto-completion candidates
+    //    Walk up the ancestor chain: if a parent's remaining children are all
+    //    terminal, it becomes a candidate. Keep going as long as each ancestor
+    //    would also become terminal (simulating the cascade).
+    const parentAutoCompletions = [];
+    const virtuallyCompleted = new Set();
+    for (let i = parents.length - 1; i >= 0; i--) {
+        const parent = parents[i];
+        // Only auto-complete parents that are pending or in_progress
+        if (!AUTO_COMPLETABLE_STATUSES.has(parent.status))
+            break;
+        // Check if all remaining children are terminal
+        // (including parents we've already decided to auto-complete)
+        const childrenTerminal = parent.children && parent.children.length > 0 &&
+            parent.children.every((c) => TERMINAL_STATUSES.has(c.status) || virtuallyCompleted.has(c.id));
+        if (!childrenTerminal)
+            break;
+        parentAutoCompletions.push({
+            id: parent.id,
+            title: parent.title,
+            level: parent.level,
+        });
+        // This parent is now virtually completed for the next ancestor check
+        virtuallyCompleted.add(parent.id);
+    }
+    return {
+        ok: true,
+        deletedIds,
+        detail: `Removed task: ${taskTitle} (${deletedIds.length} item(s) deleted)`,
+        parentAutoCompletions,
+    };
+}
+//# sourceMappingURL=remove-task.js.map

package/packages/rex/dist/core/remove-task.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-task.js","sourceRoot":"","sources":["../../src/core/remove-task.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC;AAE7D;;;GAGG;AACH,MAAM,iBAAiB,GAAoB,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC;AAE9E;;;GAGG;AACH,MAAM,yBAAyB,GAAoB,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC;AAiDvF;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,UAAU,CAAC,KAAgB,EAAE,MAAc;IACzD,8BAA8B;IAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACtC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO;YACL,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,EAAE;YACd,MAAM,EAAE,SAAS,MAAM,cAAc;YACrC,KAAK,EAAE,SAAS,MAAM,8BAA8B;YACpD,qBAAqB,EAAE,EAAE;SAC1B,CAAC;IACJ,CAAC;IAED,mCAAmC;IACnC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC;QAChC,OAAO;YACL,EAAE,EAAE,KAAK;YACT,UAAU,EAAE,EAAE;YACd,MAAM,EAAE,SAAS,MAAM,UAAU,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,aAAa,CAAC,MAAM,CAAC,GAAG;YACnG,KAAK,EAAE,SAAS,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,MAAM,cAAc,aAAa,CAAC,MAAM,CAAC,cAAc,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG;YAC/H,qBAAqB,EAAE,EAAE;SAC1B,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;IAE9B,oDAAoD;IACpD,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAE7C,6DAA6D;IAC7D,kBAAkB,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;IAE/C,iDAAiD;IACjD,0EAA0E;IAC1E,2EAA2E;IAC3E,0DAA0D;IAC1D,MAAM,qBAAqB,GAA2B,EAAE,CAAC;IACzD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAU,CAAC;IAE7C,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAE1B,6DAA6D;QAC7D,IAAI,CAAC,yBAAyB,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,MAAM;QAEzD,+CAA+C;QAC/C,6DAA6D;QAC7D,MAAM,gBAAgB,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACpE,MAAM,CAAC,QAAQ,CAAC,KAAK,CACnB,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CACvE,CAAC;QAEJ,IAAI,CAAC,gBAAgB;YAAE,MAAM;QAE7B,qBAAqB,CAAC,IAAI,CAAC;YACzB,EAAE,EAAE,MAAM,CAAC,EAAE;YACb,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,KAAK,EAAE,MAAM,CAAC,KAAK;SACpB,CAAC,CAAC;QAEH,qEAAqE;QACrE,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,OAAO;QACL,EAAE,EAAE,IAAI;QACR,UAAU;QACV,MAAM,EAAE,iBAAiB,SAAS,KAAK,UAAU,CAAC,MAAM,mBAAmB;QAC3E,qBAAqB;KACtB,CAAC;AACJ,CAAC"}

package/packages/rex/dist/core/reorganize-executor.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Reorganization executor: applies reorganization proposals to the PRD tree.
+ *
+ * Each proposal type maps to existing tree primitives:
+ * - merge  → mergeItems()
+ * - move   → moveItem()
+ * - delete → removeFromTree()
+ * - prune  → pruneItems()
+ * - collapse → moveItem() + removeFromTree()
+ * - split  → (deferred: requires LLM or user input for grouping)
+ *
+ * Proposals are applied atomically — the caller saves the document once
+ * after all proposals are applied.
+ *
+ * @module core/reorganize-executor
+ */
+import type { PRDItem } from "../schema/index.js";
+import type { ReorganizationProposal } from "./reorganize.js";
+export interface ApplyResult {
+    /** Number of proposals successfully applied. */
+    applied: number;
+    /** Number of proposals that could not be applied. */
+    failed: number;
+    /** Detail per proposal. */
+    results: ProposalResult[];
+}
+export interface ProposalResult {
+    proposalId: number;
+    success: boolean;
+    error?: string;
+}
+/**
+ * Apply a set of reorganization proposals to the PRD tree.
+ * Mutates `items` in place. Returns a summary of applied/failed proposals.
+ *
+ * Proposals are applied in order. Later proposals may fail if earlier ones
+ * changed the tree in unexpected ways.
+ */
+export declare function applyProposals(items: PRDItem[], proposals: ReorganizationProposal[]): ApplyResult;
+/**
+ * Format an apply result for human-readable display.
+ */
+export declare function formatApplyResult(result: ApplyResult): string;

package/packages/rex/dist/core/reorganize-executor.js

@@ -0,0 +1,153 @@
+/**
+ * Reorganization executor: applies reorganization proposals to the PRD tree.
+ *
+ * Each proposal type maps to existing tree primitives:
+ * - merge  → mergeItems()
+ * - move   → moveItem()
+ * - delete → removeFromTree()
+ * - prune  → pruneItems()
+ * - collapse → moveItem() + removeFromTree()
+ * - split  → (deferred: requires LLM or user input for grouping)
+ *
+ * Proposals are applied atomically — the caller saves the document once
+ * after all proposals are applied.
+ *
+ * @module core/reorganize-executor
+ */
+import { removeFromTree, findItem } from "./tree.js";
+import { mergeItems } from "./merge.js";
+import { moveItem } from "./move.js";
+import { pruneItems } from "./prune.js";
+// ── Main entry point ─────────────────────────────────────────────────────────
+/**
+ * Apply a set of reorganization proposals to the PRD tree.
+ * Mutates `items` in place. Returns a summary of applied/failed proposals.
+ *
+ * Proposals are applied in order. Later proposals may fail if earlier ones
+ * changed the tree in unexpected ways.
+ */
+export function applyProposals(items, proposals) {
+    const results = [];
+    let applied = 0;
+    let failed = 0;
+    for (const proposal of proposals) {
+        try {
+            applyOne(items, proposal);
+            results.push({ proposalId: proposal.id, success: true });
+            applied++;
+        }
+        catch (err) {
+            const message = err instanceof Error ? err.message : String(err);
+            results.push({ proposalId: proposal.id, success: false, error: message });
+            failed++;
+        }
+    }
+    return { applied, failed, results };
+}
+/**
+ * Apply a single proposal to the tree. Throws on failure.
+ */
+function applyOne(items, proposal) {
+    switch (proposal.detail.kind) {
+        case "merge":
+            applyMerge(items, proposal.detail);
+            break;
+        case "move":
+            applyMove(items, proposal.detail);
+            break;
+        case "delete":
+            applyDelete(items, proposal.detail);
+            break;
+        case "prune":
+            applyPrune(items);
+            break;
+        case "collapse":
+            applyCollapse(items, proposal.detail);
+            break;
+        case "split":
+            applySplit(items, proposal.detail);
+            break;
+    }
+}
+// ── Executors ────────────────────────────────────────────────────────────────
+function applyMerge(items, detail) {
+    const result = mergeItems(items, detail.sourceIds, detail.targetId);
+    // mergeItems mutates in place; throws internally on validation failure
+    if (!result) {
+        throw new Error(`Merge failed for target=${detail.targetId}`);
+    }
+}
+function applyMove(items, detail) {
+    if (detail.toParentId === null && detail.fromParentId === null) {
+        throw new Error(`Item "${detail.itemId}" is already at root`);
+    }
+    // Verify item still exists
+    const entry = findItem(items, detail.itemId);
+    if (!entry) {
+        throw new Error(`Item "${detail.itemId}" not found in tree`);
+    }
+    moveItem(items, detail.itemId, detail.toParentId ?? undefined);
+}
+function applyDelete(items, detail) {
+    const removed = removeFromTree(items, detail.itemId);
+    if (!removed) {
+        throw new Error(`Item "${detail.itemId}" not found for deletion`);
+    }
+}
+function applyPrune(items) {
+    const result = pruneItems(items);
+    if (result.prunedCount === 0) {
+        throw new Error("No prunable items found");
+    }
+}
+function applyCollapse(items, detail) {
+    // Collapse = move all grandchildren up to parent level, then remove the child
+    const parentEntry = findItem(items, detail.parentId);
+    if (!parentEntry) {
+        throw new Error(`Parent "${detail.parentId}" not found`);
+    }
+    const childEntry = findItem(items, detail.childId);
+    if (!childEntry) {
+        throw new Error(`Child "${detail.childId}" not found`);
+    }
+    // Move grandchildren (child's children) up to the parent
+    const grandchildren = [...(childEntry.item.children ?? [])];
+    const parentItem = parentEntry.item;
+    // Replace the child with its children in the parent's children array
+    const parentChildren = parentItem.children ?? [];
+    const childIndex = parentChildren.findIndex((c) => c.id === detail.childId);
+    if (childIndex === -1) {
+        throw new Error(`Child "${detail.childId}" not found under parent "${detail.parentId}"`);
+    }
+    // Splice out the child and insert its children in its place
+    parentChildren.splice(childIndex, 1, ...grandchildren);
+}
+function applySplit(_items, _detail) {
+    // Split requires user/LLM input to decide groupings.
+    // For now, throw an informative error.
+    throw new Error("Split proposals require manual grouping. Use 'rex reorganize --accept' " +
+        "to apply other proposals, then manually reorganize the oversized container.");
+}
+// ── Formatting ───────────────────────────────────────────────────────────────
+/**
+ * Format an apply result for human-readable display.
+ */
+export function formatApplyResult(result) {
+    const lines = [];
+    if (result.applied > 0) {
+        lines.push(`Applied ${result.applied} proposal${result.applied === 1 ? "" : "s"} successfully.`);
+    }
+    if (result.failed > 0) {
+        lines.push(`${result.failed} proposal${result.failed === 1 ? "" : "s"} failed:`);
+        for (const r of result.results) {
+            if (!r.success) {
+                lines.push(`  #${r.proposalId}: ${r.error}`);
+            }
+        }
+    }
+    if (result.applied === 0 && result.failed === 0) {
+        lines.push("No proposals to apply.");
+    }
+    return lines.join("\n");
+}
+//# sourceMappingURL=reorganize-executor.js.map

package/packages/rex/dist/core/reorganize-executor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reorganize-executor.js","sourceRoot":"","sources":["../../src/core/reorganize-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAYH,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAmBxC,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAgB,EAChB,SAAmC;IAEnC,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC;YACH,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YACzD,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,OAAO,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YAC1E,MAAM,EAAE,CAAC;QACX,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,SAAS,QAAQ,CAAC,KAAgB,EAAE,QAAgC;IAClE,QAAQ,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC7B,KAAK,OAAO;YACV,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,MAAM;QACR,KAAK,MAAM;YACT,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM;QACR,KAAK,QAAQ;YACX,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM;QACR,KAAK,OAAO;YACV,UAAU,CAAC,KAAK,CAAC,CAAC;YAClB,MAAM;QACR,KAAK,UAAU;YACb,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACtC,MAAM;QACR,KAAK,OAAO;YACV,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,MAAM;IACV,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,SAAS,UAAU,CAAC,KAAgB,EAAE,MAAmB;IACvD,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACpE,uEAAuE;IACvE,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,2BAA2B,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;IAChE,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,KAAgB,EAAE,MAAkB;IACrD,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI,IAAI,MAAM,CAAC,YAAY,KAAK,IAAI,EAAE,CAAC;QAC/D,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,CAAC,MAAM,sBAAsB,CAAC,CAAC;IAChE,CAAC;IAED,2BAA2B;IAC3B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,CAAC,MAAM,qBAAqB,CAAC,CAAC;IAC/D,CAAC;IAED,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,IAAI,SAAS,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,WAAW,CAAC,KAAgB,EAAE,MAAoB;IACzD,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACrD,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,SAAS,MAAM,CAAC,MAAM,0BAA0B,CAAC,CAAC;IACpE,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAAC,KAAgB;IAClC,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IACjC,IAAI,MAAM,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC7C,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,KAAgB,EAAE,MAAsB;IAC7D,8EAA8E;IAC9E,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACrD,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,WAAW,MAAM,CAAC,QAAQ,aAAa,CAAC,CAAC;IAC3D,CAAC;IAED,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;IACnD,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,CAAC,OAAO,aAAa,CAAC,CAAC;IACzD,CAAC;IAED,yDAAyD;IACzD,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC;IAEpC,qEAAqE;IACrE,MAAM,cAAc,GAAG,UAAU,CAAC,QAAQ,IAAI,EAAE,CAAC;IACjD,MAAM,UAAU,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,OAAO,CAAC,CAAC;IAC5E,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,UAAU,MAAM,CAAC,OAAO,6BAA6B,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC;IAC3F,CAAC;IAED,4DAA4D;IAC5D,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,UAAU,CAAC,MAAiB,EAAE,OAAoB;IACzD,qDAAqD;IACrD,uCAAuC;IACvC,MAAM,IAAI,KAAK,CACb,yEAAyE;QACzE,6EAA6E,CAC9E,CAAC;AACJ,CAAC;AAED,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAmB;IACnD,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,WAAW,MAAM,CAAC,OAAO,YAAY,MAAM,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,CAAC;IACnG,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,YAAY,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACjF,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,OAAO,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}