@n-dx/core 0.1.0

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

@@ -0,0 +1,443 @@
+import { PRIORITY_ORDER } from "../schema/index.js";
+import { walkTree, findItem } from "./tree.js";
+import { extractKeywords, scoreMatch } from "./keywords.js";
+import { collectRequirements } from "./requirements.js";
+/** Safe ancestor priority: returns medium (2) when no parents exist. */
+function bestAncestorPriority(parents) {
+    if (parents.length === 0)
+        return PRIORITY_ORDER.medium;
+    return Math.min(...parents.map((p) => PRIORITY_ORDER[p.priority ?? "medium"]));
+}
+// ---------------------------------------------------------------------------
+// Advanced scoring helpers (exported for testing)
+// ---------------------------------------------------------------------------
+/**
+ * Ratio of completed/deferred siblings to total siblings under the immediate
+ * parent. Tasks in nearly-finished features score higher, encouraging
+ * feature completion before starting new work.
+ *
+ * Returns 0 for root-level items (no parent) or only-children.
+ */
+export function siblingCompletionRatio(entry) {
+    const parent = entry.parents[entry.parents.length - 1];
+    if (!parent?.children || parent.children.length <= 1)
+        return 0;
+    // Exclude deleted siblings from both numerator and denominator
+    const activeSiblings = parent.children.filter((c) => c.status !== "deleted");
+    if (activeSiblings.length <= 1)
+        return 0;
+    const done = activeSiblings.filter((c) => c.status === "completed" || c.status === "deferred").length;
+    return done / activeSiblings.length;
+}
+/**
+ * Count how many items in the tree list `taskId` in their `blockedBy` array.
+ * Tasks that unblock more downstream work are more valuable to complete.
+ */
+export function countDependents(taskId, items) {
+    let count = 0;
+    for (const { item } of walkTree(items)) {
+        if (item.blockedBy && item.blockedBy.includes(taskId)) {
+            count++;
+        }
+    }
+    return count;
+}
+/**
+ * Build a map of taskId → dependent count for all tasks that appear in any
+ * blockedBy list. Pre-computed once to avoid O(n²) per comparison.
+ */
+function buildDependentCounts(items) {
+    const counts = new Map();
+    for (const { item } of walkTree(items)) {
+        if (item.blockedBy) {
+            for (const dep of item.blockedBy) {
+                counts.set(dep, (counts.get(dep) ?? 0) + 1);
+            }
+        }
+    }
+    return counts;
+}
+/**
+ * Multiplier for requirements score based on risk tolerance.
+ * Lower tolerance = stronger boost from requirements.
+ */
+const RISK_TOLERANCE_MULTIPLIER = {
+    low: 3,
+    medium: 2,
+    high: 1,
+};
+/**
+ * Compute a requirements-based priority score for a task.
+ *
+ * Considers:
+ * - Number of requirements (own + inherited from parent chain)
+ * - Highest-priority requirement attached
+ * - Presence of critical-category requirements (security, performance)
+ *
+ * Returns a score where higher = more important. Items with no requirements
+ * score 0, so this acts as a boost rather than a penalty.
+ */
+export function requirementsScore(entry, items, riskTolerance = "medium") {
+    const traced = collectRequirements(items, entry.item.id);
+    if (traced.length === 0)
+        return 0;
+    let score = 0;
+    const multiplier = RISK_TOLERANCE_MULTIPLIER[riskTolerance];
+    for (const tr of traced) {
+        const req = tr.requirement;
+        // Base score: each requirement adds value
+        score += 1;
+        // Critical-priority requirements add more weight
+        const reqPriority = req.priority ?? "medium";
+        if (reqPriority === "critical")
+            score += 3 * multiplier;
+        else if (reqPriority === "high")
+            score += 2 * multiplier;
+        else if (reqPriority === "medium")
+            score += 1;
+        // Security and performance categories are inherently high-value
+        if (req.category === "security")
+            score += 2 * multiplier;
+        if (req.category === "performance")
+            score += 1 * multiplier;
+    }
+    return score;
+}
+/**
+ * Create a comparator for sorting actionable tasks.
+ *
+ * Sort order:
+ *   1. in_progress status (finish what you started)
+ *   2. Own priority (critical > high > medium > low)
+ *   3. Requirements score (tasks with critical/security requirements get boosted)
+ *   4. Ancestor priority (highest-priority parent chain wins)
+ *   5. Sibling completion ratio (nearly-done features first)
+ *   6. Unblock potential (tasks that unblock more downstream work)
+ *   7. Alphabetical title (stable tiebreaker)
+ */
+function makeComparator(items, options) {
+    const depCounts = buildDependentCounts(items);
+    const riskTolerance = options?.riskTolerance ?? "medium";
+    // Pre-compute requirements scores for all items to avoid repeated tree walks
+    const reqScores = new Map();
+    function precomputeReqScores(list, parents) {
+        for (const item of list) {
+            const entry = { item, parents };
+            reqScores.set(item.id, requirementsScore(entry, items, riskTolerance));
+            if (item.children) {
+                precomputeReqScores(item.children, [...parents, item]);
+            }
+        }
+    }
+    precomputeReqScores(items, []);
+    return (a, b) => {
+        // 1. failing/in_progress always win — retry failures and finish what you started
+        const aUrgent = a.item.status === "failing" ? 0 : a.item.status === "in_progress" ? 1 : 2;
+        const bUrgent = b.item.status === "failing" ? 0 : b.item.status === "in_progress" ? 1 : 2;
+        if (aUrgent !== bUrgent)
+            return aUrgent - bUrgent;
+        // 2. Then by own priority
+        const pa = PRIORITY_ORDER[a.item.priority ?? "medium"];
+        const pb = PRIORITY_ORDER[b.item.priority ?? "medium"];
+        if (pa !== pb)
+            return pa - pb;
+        // 3. Requirements score (higher = more important)
+        const reqA = reqScores.get(a.item.id) ?? 0;
+        const reqB = reqScores.get(b.item.id) ?? 0;
+        if (reqA !== reqB)
+            return reqB - reqA; // higher score wins
+        // 4. Tiebreak: highest-priority ancestor
+        const ancestorA = bestAncestorPriority(a.parents);
+        const ancestorB = bestAncestorPriority(b.parents);
+        if (ancestorA !== ancestorB)
+            return ancestorA - ancestorB;
+        // 5. Tiebreak: sibling completion ratio (higher = finish the feature)
+        const sibA = siblingCompletionRatio(a);
+        const sibB = siblingCompletionRatio(b);
+        if (sibA !== sibB)
+            return sibB - sibA; // higher ratio wins
+        // 6. Tiebreak: unblock potential (more dependents = more valuable)
+        const depA = depCounts.get(a.item.id) ?? 0;
+        const depB = depCounts.get(b.item.id) ?? 0;
+        if (depA !== depB)
+            return depB - depA; // more dependents wins
+        // 7. Stable alphabetical tiebreaker
+        return a.item.title.localeCompare(b.item.title);
+    };
+}
+export function collectCompletedIds(items) {
+    const ids = new Set();
+    function walk(list) {
+        for (const item of list) {
+            if (item.status === "completed") {
+                ids.add(item.id);
+            }
+            if (item.children) {
+                walk(item.children);
+            }
+        }
+    }
+    walk(items);
+    return ids;
+}
+/**
+ * Collect actionable candidates from the tree.
+ * Returns every leaf task (or parent with all children done) that is
+ * pending/in_progress with all dependencies resolved.
+ */
+function collectActionable(items, completedIds) {
+    const results = [];
+    function collect(list, parentChain) {
+        for (const item of list) {
+            // Blocked/deleted parents are fully inactive — skip them and children.
+            if (item.status === "blocked" || item.status === "deleted")
+                continue;
+            // Unresolved dependencies — skip item and children.
+            if (item.blockedBy && item.blockedBy.length > 0) {
+                if (!item.blockedBy.every((dep) => completedIds.has(dep)))
+                    continue;
+            }
+            // Always recurse into children — even for completed/deferred parents,
+            // a child may be failing and need to be retried.
+            if (item.children && item.children.length > 0) {
+                collect(item.children, [...parentChain, item]);
+            }
+            // Completed/deferred items themselves aren't actionable.
+            if (item.status === "completed" || item.status === "deferred")
+                continue;
+            if (item.children && item.children.length > 0) {
+                const allChildrenDone = item.children.every((c) => c.status === "completed" || c.status === "deferred");
+                if (allChildrenDone) {
+                    results.push({ item, parents: parentChain });
+                }
+            }
+            else {
+                results.push({ item, parents: parentChain });
+            }
+        }
+    }
+    collect(items, []);
+    return results;
+}
+/**
+ * Collect ALL actionable tasks flattened and sorted globally by priority.
+ * Returns every leaf task that is pending/in_progress with resolved
+ * dependencies, sorted by: in_progress status, priority, requirements score,
+ * ancestor priority, sibling completion ratio, unblock potential, then alphabetically.
+ *
+ * @param options.riskTolerance — Controls how much requirements influence ordering.
+ */
+/**
+ * Resolve the subtree for a featureId filter.
+ * Returns the feature's children wrapped in an array for collectActionable,
+ * or null if the feature is not found or has no children.
+ */
+function resolveFeatureSubtree(items, featureId) {
+    const entry = findItem(items, featureId);
+    if (!entry)
+        return null;
+    return entry.item.children ?? [];
+}
+export function findActionableTasks(items, completedIds, limit = 20, options) {
+    let scope = items;
+    if (options?.featureId) {
+        const subtree = resolveFeatureSubtree(items, options.featureId);
+        if (!subtree || subtree.length === 0)
+            return [];
+        scope = subtree;
+    }
+    const results = collectActionable(scope, completedIds);
+    results.sort(makeComparator(items, options));
+    return results.slice(0, limit);
+}
+export function findNextTask(items, completedIds, options) {
+    let scope = items;
+    if (options?.featureId) {
+        const subtree = resolveFeatureSubtree(items, options.featureId);
+        if (!subtree || subtree.length === 0)
+            return null;
+        scope = subtree;
+    }
+    const results = collectActionable(scope, completedIds);
+    if (results.length === 0)
+        return null;
+    results.sort(makeComparator(items, options));
+    return results[0];
+}
+/** Check if an item is a leaf (no children or empty children array). */
+function isLeaf(item) {
+    return !item.children || item.children.length === 0;
+}
+/**
+ * Explain why a particular task was selected by findNextTask.
+ * Walks the full tree to gather skip counts, dependency info, and priority context.
+ * Only counts leaf-level items (and parents whose children are all done) to avoid
+ * inflating skip counts with intermediate branch nodes.
+ */
+export function explainSelection(items, selected, completedIds) {
+    const skipped = {
+        completed: 0,
+        deferred: 0,
+        blocked: 0,
+        unresolvedDeps: 0,
+        inProgress: 0,
+        actionable: 0,
+        total: 0,
+    };
+    const selectedPriority = PRIORITY_ORDER[selected.item.priority ?? "medium"];
+    let higherPriorityBlocked = 0;
+    // Build the set of actionable candidates for accurate actionable/inProgress counts
+    const actionableSet = new Set(collectActionable(items, completedIds).map((e) => e.item.id));
+    // Walk the tree, but only count leaves and parents-with-all-children-done
+    for (const { item } of walkTree(items)) {
+        if (item.id === selected.item.id)
+            continue;
+        // Skip intermediate branch nodes — only count leaves and finalize-ready parents
+        if (!isLeaf(item)) {
+            const allChildrenDone = item.children.every((c) => c.status === "completed" || c.status === "deferred");
+            if (!allChildrenDone)
+                continue; // branch with active children — don't count
+        }
+        if (item.status === "completed") {
+            skipped.completed++;
+            skipped.total++;
+        }
+        else if (item.status === "deferred") {
+            skipped.deferred++;
+            skipped.total++;
+        }
+        else if (item.status === "blocked") {
+            skipped.blocked++;
+            skipped.total++;
+            if (PRIORITY_ORDER[item.priority ?? "medium"] < selectedPriority) {
+                higherPriorityBlocked++;
+            }
+        }
+        else if (item.blockedBy &&
+            item.blockedBy.length > 0 &&
+            !item.blockedBy.every((dep) => completedIds.has(dep))) {
+            skipped.unresolvedDeps++;
+            skipped.total++;
+            if (PRIORITY_ORDER[item.priority ?? "medium"] < selectedPriority) {
+                higherPriorityBlocked++;
+            }
+        }
+        else if (actionableSet.has(item.id)) {
+            // Item is actionable but wasn't selected
+            if (item.status === "in_progress") {
+                skipped.inProgress++;
+            }
+            else {
+                skipped.actionable++;
+            }
+            skipped.total++;
+        }
+    }
+    // Dependency info for the selected item
+    const resolvedBlockers = (selected.item.blockedBy ?? []).filter((dep) => completedIds.has(dep));
+    const depStatus = selected.item.blockedBy && selected.item.blockedBy.length > 0
+        ? { status: "resolved", resolvedBlockers }
+        : { status: "none", resolvedBlockers: [] };
+    const traversalPath = selected.parents.map((p) => p.title);
+    const itemPriority = selected.item.priority ?? "medium";
+    // Build human-readable summary
+    const summaryParts = [];
+    // Status context
+    if (selected.item.status === "in_progress") {
+        summaryParts.push(`"${selected.item.title}" is already in_progress`);
+    }
+    else {
+        // Check if this is a parent with all children done
+        const allChildrenDone = selected.item.children &&
+            selected.item.children.length > 0 &&
+            selected.item.children.every((c) => c.status === "completed" || c.status === "deferred");
+        if (allChildrenDone) {
+            summaryParts.push(`"${selected.item.title}" — all children completed, ready to finalize`);
+        }
+        else {
+            summaryParts.push(`"${selected.item.title}" selected at ${itemPriority} priority`);
+        }
+    }
+    // Traversal context
+    if (traversalPath.length > 0) {
+        summaryParts.push(`via ${traversalPath.join(" → ")}`);
+    }
+    // Dependency context
+    if (depStatus.status === "resolved") {
+        summaryParts.push(`(${resolvedBlockers.length} blocker${resolvedBlockers.length === 1 ? "" : "s"} resolved)`);
+    }
+    // Higher-priority blocked context
+    if (higherPriorityBlocked > 0) {
+        summaryParts.push(`(${higherPriorityBlocked} higher-priority item${higherPriorityBlocked === 1 ? "" : "s"} blocked)`);
+    }
+    return {
+        summary: summaryParts.join(" "),
+        priority: {
+            itemPriority,
+            higherPriorityBlocked,
+        },
+        dependencies: depStatus,
+        traversalPath,
+        skipped,
+    };
+}
+/**
+ * Extract searchable keywords from a PRD item.
+ *
+ * Combines keywords from:
+ * - Title
+ * - Acceptance criteria
+ * - Tags
+ * - Description
+ *
+ * Returns deduplicated, lowercased tokens with stop words removed.
+ */
+export function extractTaskKeywords(item) {
+    const sources = [item.title];
+    if (item.acceptanceCriteria) {
+        sources.push(...item.acceptanceCriteria);
+    }
+    if (item.description) {
+        sources.push(item.description);
+    }
+    // Tags are kept as-is (already meaningful identifiers), but lowercased
+    const tagKeywords = (item.tags ?? [])
+        .map((t) => t.toLowerCase())
+        .filter((t) => t.length > 2);
+    const textKeywords = extractKeywords(sources.join(" "));
+    // Deduplicate across all sources
+    return [...new Set([...textKeywords, ...tagKeywords])];
+}
+/**
+ * Find tasks matching a set of search keywords.
+ *
+ * Walks the full tree and scores each item against the search keywords.
+ * Returns matching items sorted by score (descending), then by priority
+ * (critical first).
+ *
+ * @param items      - The PRD item tree.
+ * @param keywords   - Search keywords to match against.
+ * @param minScore   - Minimum score to include (default: 1).
+ * @returns Matching tasks sorted by relevance then priority.
+ */
+export function matchTasksByKeywords(items, keywords, minScore = 1) {
+    const matches = [];
+    for (const { item, parents } of walkTree(items)) {
+        const taskKeywords = extractTaskKeywords(item);
+        const keywordsStr = taskKeywords.join(" ");
+        const score = scoreMatch(keywordsStr, keywords);
+        if (score >= minScore) {
+            matches.push({ item, parents, score, keywords: taskKeywords });
+        }
+    }
+    // Sort by score descending, then by priority (critical first)
+    matches.sort((a, b) => {
+        if (a.score !== b.score)
+            return b.score - a.score;
+        const pa = PRIORITY_ORDER[a.item.priority ?? "medium"];
+        const pb = PRIORITY_ORDER[b.item.priority ?? "medium"];
+        return pa - pb;
+    });
+    return matches;
+}
+//# sourceMappingURL=next-task.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"next-task.js","sourceRoot":"","sources":["../../src/core/next-task.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEpD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AAExD,wEAAwE;AACxE,SAAS,oBAAoB,CAAC,OAAkB;IAC9C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,cAAc,CAAC,MAAM,CAAC;IACvD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,8EAA8E;AAC9E,kDAAkD;AAClD,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAgB;IACrD,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvD,IAAI,CAAC,MAAM,EAAE,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/D,+DAA+D;IAC/D,MAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;IAC7E,IAAI,cAAc,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,CAC3D,CAAC,MAAM,CAAC;IACT,OAAO,IAAI,GAAG,cAAc,CAAC,MAAM,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,KAAgB;IAC9D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACtD,KAAK,EAAE,CAAC;QACV,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,KAAgB;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACjC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAgBD;;;GAGG;AACH,MAAM,yBAAyB,GAAkC;IAC/D,GAAG,EAAE,CAAC;IACN,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;CACR,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAgB,EAChB,KAAgB,EAChB,gBAA+B,QAAQ;IAEvC,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,UAAU,GAAG,yBAAyB,CAAC,aAAa,CAAC,CAAC;IAE5D,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC;QAE3B,0CAA0C;QAC1C,KAAK,IAAI,CAAC,CAAC;QAEX,iDAAiD;QACjD,MAAM,WAAW,GAAG,GAAG,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC7C,IAAI,WAAW,KAAK,UAAU;YAAE,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC;aACnD,IAAI,WAAW,KAAK,MAAM;YAAE,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC;aACpD,IAAI,WAAW,KAAK,QAAQ;YAAE,KAAK,IAAI,CAAC,CAAC;QAE9C,gEAAgE;QAChE,IAAI,GAAG,CAAC,QAAQ,KAAK,UAAU;YAAE,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC;QACzD,IAAI,GAAG,CAAC,QAAQ,KAAK,aAAa;YAAE,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC;IAC9D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAkBD;;;;;;;;;;;GAWG;AACH,SAAS,cAAc,CACrB,KAAgB,EAChB,OAA+B;IAE/B,MAAM,SAAS,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC9C,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,QAAQ,CAAC;IAEzD,6EAA6E;IAC7E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,SAAS,mBAAmB,CAAC,IAAe,EAAE,OAAkB;QAC9D,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,KAAK,GAAc,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;YAC3C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;YACvE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,mBAAmB,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IACD,mBAAmB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAE/B,OAAO,CAAC,CAAY,EAAE,CAAY,EAAU,EAAE;QAC5C,iFAAiF;QACjF,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,IAAI,OAAO,KAAK,OAAO;YAAE,OAAO,OAAO,GAAG,OAAO,CAAC;QAElD,0BAA0B;QAC1B,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;QACvD,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAE9B,kDAAkD;QAClD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,oBAAoB;QAE3D,yCAAyC;QACzC,MAAM,SAAS,GAAG,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAClD,MAAM,SAAS,GAAG,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,SAAS,GAAG,SAAS,CAAC;QAE1D,sEAAsE;QACtE,MAAM,IAAI,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,oBAAoB;QAE3D,mEAAmE;QACnE,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,IAAI,CAAC,CAAC,uBAAuB;QAE9D,oCAAoC;QACpC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC;AACJ,CAAC;AAgCD,MAAM,UAAU,mBAAmB,CAAC,KAAgB;IAClD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,SAAS,IAAI,CAAC,IAAe;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBAChC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;YACD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CACxB,KAAgB,EAChB,YAAyB;IAEzB,MAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,SAAS,OAAO,CAAC,IAAe,EAAE,WAAsB;QACtD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,uEAAuE;YACvE,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;gBAAE,SAAS;YAErE,oDAAoD;YACpD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAAE,SAAS;YACtE,CAAC;YAED,sEAAsE;YACtE,iDAAiD;YACjD,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9C,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;YACjD,CAAC;YAED,yDAAyD;YACzD,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU;gBAAE,SAAS;YAExE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9C,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,CAC3D,CAAC;gBACF,IAAI,eAAe,EAAE,CAAC;oBACpB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;gBAC/C,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACnB,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH;;;;GAIG;AACH,SAAS,qBAAqB,CAC5B,KAAgB,EAChB,SAAiB;IAEjB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IACxB,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;AACnC,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,KAAgB,EAChB,YAAyB,EACzB,KAAK,GAAG,EAAE,EACV,OAA+B;IAE/B,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAChD,KAAK,GAAG,OAAO,CAAC;IAClB,CAAC;IACD,MAAM,OAAO,GAAG,iBAAiB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACvD,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;IAC7C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,KAAgB,EAChB,YAAyB,EACzB,OAA+B;IAE/B,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAClD,KAAK,GAAG,OAAO,CAAC;IAClB,CAAC;IACD,MAAM,OAAO,GAAG,iBAAiB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACvD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;IAC7C,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC;AAED,wEAAwE;AACxE,SAAS,MAAM,CAAC,IAAa;IAC3B,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;AACtD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAgB,EAChB,QAAmB,EACnB,YAAyB;IAEzB,MAAM,OAAO,GAAG;QACd,SAAS,EAAE,CAAC;QACZ,QAAQ,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;QACV,cAAc,EAAE,CAAC;QACjB,UAAU,EAAE,CAAC;QACb,UAAU,EAAE,CAAC;QACb,KAAK,EAAE,CAAC;KACT,CAAC;IACF,MAAM,gBAAgB,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;IAC5E,IAAI,qBAAqB,GAAG,CAAC,CAAC;IAE9B,mFAAmF;IACnF,MAAM,aAAa,GAAG,IAAI,GAAG,CAC3B,iBAAiB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAC7D,CAAC;IAEF,0EAA0E;IAC1E,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,CAAC,IAAI,CAAC,EAAE;YAAE,SAAS;QAE3C,gFAAgF;QAChF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAClB,MAAM,eAAe,GAAG,IAAI,CAAC,QAAS,CAAC,KAAK,CAC1C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,CAC3D,CAAC;YACF,IAAI,CAAC,eAAe;gBAAE,SAAS,CAAC,4CAA4C;QAC9E,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAChC,OAAO,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;YACtC,OAAO,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACrC,OAAO,CAAC,OAAO,EAAE,CAAC;YAClB,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,GAAG,gBAAgB,EAAE,CAAC;gBACjE,qBAAqB,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;aAAM,IACL,IAAI,CAAC,SAAS;YACd,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;YACzB,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EACrD,CAAC;YACD,OAAO,CAAC,cAAc,EAAE,CAAC;YACzB,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,GAAG,gBAAgB,EAAE,CAAC;gBACjE,qBAAqB,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;aAAM,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACtC,yCAAyC;YACzC,IAAI,IAAI,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;gBAClC,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB,CAAC;YACD,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,MAAM,gBAAgB,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CACtE,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CACtB,CAAC;IACF,MAAM,SAAS,GACb,QAAQ,CAAC,IAAI,CAAC,SAAS,IAAI,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;QAC3D,CAAC,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,gBAAgB,EAAE;QAC1C,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,EAAE,EAAE,CAAC;IAE/C,MAAM,aAAa,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAa,QAAQ,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAElE,+BAA+B;IAC/B,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,iBAAiB;IACjB,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,KAAK,aAAa,EAAE,CAAC;QAC3C,YAAY,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,0BAA0B,CAAC,CAAC;IACvE,CAAC;SAAM,CAAC;QACN,mDAAmD;QACnD,MAAM,eAAe,GACnB,QAAQ,CAAC,IAAI,CAAC,QAAQ;YACtB,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YACjC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,CAAC,MAAM,KAAK,UAAU,CAC3D,CAAC;QACJ,IAAI,eAAe,EAAE,CAAC;YACpB,YAAY,CAAC,IAAI,CACf,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,+CAA+C,CACvE,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,IAAI,CACf,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,iBAAiB,YAAY,WAAW,CAChE,CAAC;QACJ,CAAC;IACH,CAAC;IAED,oBAAoB;IACpB,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,YAAY,CAAC,IAAI,CAAC,OAAO,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,qBAAqB;IACrB,IAAI,SAAS,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;QACpC,YAAY,CAAC,IAAI,CACf,IAAI,gBAAgB,CAAC,MAAM,WAAW,gBAAgB,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,YAAY,CAC3F,CAAC;IACJ,CAAC;IAED,kCAAkC;IAClC,IAAI,qBAAqB,GAAG,CAAC,EAAE,CAAC;QAC9B,YAAY,CAAC,IAAI,CACf,IAAI,qBAAqB,wBAAwB,qBAAqB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,WAAW,CACnG,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,EAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC;QAC/B,QAAQ,EAAE;YACR,YAAY;YACZ,qBAAqB;SACtB;QACD,YAAY,EAAE,SAAS;QACvB,aAAa;QACb,OAAO;KACR,CAAC;AACJ,CAAC;AAaD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAa;IAC/C,MAAM,OAAO,GAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEvC,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACjC,CAAC;IAED,uEAAuE;IACvE,MAAM,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;SAClC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;SAC3B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/B,MAAM,YAAY,GAAG,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAExD,iCAAiC;IACjC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAgB,EAChB,QAAkB,EAClB,QAAQ,GAAG,CAAC;IAEZ,MAAM,OAAO,GAAgB,EAAE,CAAC;IAEhC,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAChD,MAAM,YAAY,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,WAAW,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAEhD,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;QACvD,OAAO,EAAE,GAAG,EAAE,CAAC;IACjB,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/packages/rex/dist/core/notion-map.d.ts

@@ -0,0 +1,207 @@
+/**
+ * Maps PRD hierarchy to Notion database structure.
+ *
+ * Notion model:
+ * - Epics are top-level pages in the database
+ * - Features, tasks, and subtasks are sub-pages nested under their parents
+ * - Status uses Notion's **native status property type** (not a select)
+ *   with three built-in groups: To-do, In progress, Complete
+ * - Priority uses a **select** property (Notion has no native priority type)
+ * - Other fields use title, rich_text, multi_select as appropriate
+ *
+ * This module handles bidirectional conversion between PRDItem trees
+ * and Notion's flat page + parent reference model.
+ */
+import type { ItemLevel, ItemStatus, PRDItem, PRDDocument, Priority } from "../schema/index.js";
+export interface NotionRichText {
+    text: {
+        content: string;
+    };
+}
+export interface NotionPageProperties {
+    Name: {
+        title: NotionRichText[];
+    };
+    /** Notion native status property (not a select). */
+    Status: {
+        status: {
+            name: string;
+        };
+    };
+    Level: {
+        select: {
+            name: string;
+        };
+    };
+    "PRD ID": {
+        rich_text: NotionRichText[];
+    };
+    Description?: {
+        rich_text: NotionRichText[];
+    };
+    /** Select property — Notion has no native priority type. */
+    Priority?: {
+        select: {
+            name: string;
+        };
+    };
+    Tags?: {
+        multi_select: Array<{
+            name: string;
+        }>;
+    };
+    Source?: {
+        rich_text: NotionRichText[];
+    };
+    "Blocked By"?: {
+        rich_text: NotionRichText[];
+    };
+    /** ISO 8601 timestamp of when work started. Stored as rich_text. */
+    "Started At"?: {
+        rich_text: NotionRichText[];
+    };
+    /** ISO 8601 timestamp of when item was completed. Stored as rich_text. */
+    "Completed At"?: {
+        rich_text: NotionRichText[];
+    };
+}
+/**
+ * Notion's three built-in status groups. Every Status property has exactly
+ * these three groups; options are assigned to one of them.
+ */
+export type NotionStatusGroup = "To-do" | "In progress" | "Complete";
+export interface NotionStatusOption {
+    name: string;
+    color: string;
+    group: NotionStatusGroup;
+}
+/**
+ * Map from each PRD ItemStatus to its Notion status option name and group.
+ * The group assignment tells Notion which column/category the status belongs to,
+ * which is the key differentiator of the native status type vs a plain select.
+ */
+export declare const STATUS_OPTIONS: Record<ItemStatus, NotionStatusOption>;
+/**
+ * Priority options for the select property. Title-cased for Notion display.
+ */
+export interface NotionSelectOption {
+    name: string;
+    color: string;
+}
+export declare const PRIORITY_OPTIONS: Record<Priority, NotionSelectOption>;
+export interface NotionPropertySchema {
+    type: "title" | "status" | "select" | "multi_select" | "rich_text";
+    /** For status/select types: the expected options. */
+    options?: Array<{
+        name: string;
+        color: string;
+    }>;
+    /** For status type: which group each option belongs to. */
+    groups?: Array<{
+        name: NotionStatusGroup;
+        color: string;
+        option_names: string[];
+    }>;
+}
+/**
+ * Expected database property schema for a rex-managed Notion database.
+ * Use this to validate that a database is correctly configured or to
+ * document what manual setup is required (since the Status property type
+ * cannot be created via the Notion API).
+ */
+export declare const DATABASE_SCHEMA: Record<string, NotionPropertySchema>;
+export interface NotionBlock {
+    object: "block";
+    type: string;
+    [key: string]: unknown;
+}
+export interface NotionParent {
+    database_id?: string;
+    page_id?: string;
+}
+export interface NotionPageDescriptor {
+    item: PRDItem;
+    parent: NotionParent;
+    parentItemId?: string;
+    properties: NotionPageProperties;
+    children?: NotionBlock[];
+}
+export interface LevelConfig {
+    parentLevel: ItemLevel | null;
+    statusMap: Record<ItemStatus, string>;
+}
+export declare const NOTION_LEVEL_CONFIG: Record<ItemLevel, LevelConfig>;
+/**
+ * Convert a single PRDItem into Notion page properties + body blocks.
+ * Does not set the `parent` field — use `resolveParentPage` for that.
+ */
+export declare function mapItemToNotion(item: PRDItem): {
+    properties: NotionPageProperties;
+    children?: NotionBlock[];
+};
+/**
+ * Convert a Notion page object into a PRDItem.
+ * Expects the page to have the properties defined by `NotionPageProperties`.
+ *
+ * For the native Status property, reads `status.name` (and optionally the
+ * status group from the database schema) to resolve to a PRD ItemStatus.
+ * Custom status options (e.g. "Blocked") are resolved via their group
+ * when `statusGroupMap` is provided.
+ *
+ * @param notionPage      Notion page object with properties and optional children.
+ * @param statusGroupMap  Optional map of status option name → group name, from
+ *                        the database schema. Enables group-based fallback for
+ *                        custom status options.
+ */
+export declare function mapNotionToItem(notionPage: any, statusGroupMap?: Map<string, NotionStatusGroup>): PRDItem;
+export declare function resolveStatusFromNotion(statusName: string, group?: NotionStatusGroup): ItemStatus;
+export interface SchemaValidationResult {
+    valid: boolean;
+    errors: string[];
+}
+/**
+ * Validate that a Notion database has the expected property configuration
+ * for rex sync. Checks property names and types; does not validate individual
+ * option values (those can be added via the Notion UI).
+ */
+export declare function validateDatabaseSchema(databaseProperties: Record<string, any>): SchemaValidationResult;
+/**
+ * Determine the Notion parent reference for an item.
+ *
+ * @param item       The PRDItem being placed.
+ * @param databaseId The root Notion database ID (used for top-level items).
+ * @param idMap      Map of PRD item ID → Notion page ID (for already-synced items).
+ * @param parentId   The PRD ID of this item's parent (from the tree walk).
+ */
+export declare function resolveParentPage(item: PRDItem, databaseId: string, idMap: Map<string, string>, parentId?: string): NotionParent;
+/**
+ * Flatten an entire PRD document into an ordered list of Notion page descriptors.
+ * Items are yielded in DFS order so parents are created before children.
+ *
+ * Each descriptor includes the PRDItem, its mapped Notion properties, body blocks,
+ * the resolved Notion parent reference, and the PRD parent ID (for post-creation
+ * ID mapping).
+ */
+export declare function mapDocumentToNotion(doc: PRDDocument, databaseId: string): NotionPageDescriptor[];
+/**
+ * Reconstruct a PRDDocument tree from a flat list of Notion pages.
+ * Uses each page's `parent.page_id` or `parent.database_id` to determine nesting.
+ *
+ * Pages whose parent.database_id is set are treated as roots.
+ * Pages whose parent.page_id matches another page's Notion ID become children.
+ * Orphaned pages (parent not found) are placed at root level.
+ *
+ * @param statusGroupMap  Optional map of status option name → group name, for
+ *                        group-based status resolution of custom options.
+ */
+export declare function mapNotionToDocument(notionPages: any[], projectTitle: string, statusGroupMap?: Map<string, NotionStatusGroup>): PRDDocument;
+/**
+ * Build a status group map from a Notion database schema response.
+ * Extracts the Status property's groups and maps each option name to its group.
+ *
+ * @example
+ *   const db = await notion.databases.retrieve({ database_id: "..." });
+ *   const groupMap = buildStatusGroupMap(db.properties);
+ *   const doc = mapNotionToDocument(pages, "Project", groupMap);
+ */
+export declare function buildStatusGroupMap(databaseProperties: Record<string, any>): Map<string, NotionStatusGroup>;