@n-dx/core 0.1.0

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

@@ -0,0 +1,339 @@
+import { PRIORITY_ORDER } from "../schema/index.js";
+/** Default similarity threshold for merging near-duplicates */
+const DEFAULT_THRESHOLD = 0.7;
+// ── Similarity scoring ──
+function normalize(s) {
+    return s.toLowerCase().trim().replace(/\s+/g, " ");
+}
+function bigrams(s) {
+    const set = new Set();
+    for (let i = 0; i < s.length - 1; i++) {
+        set.add(s.slice(i, i + 2));
+    }
+    return set;
+}
+function wordSet(s) {
+    return new Set(s.split(" ").filter(Boolean));
+}
+/**
+ * Action verbs that appear at the start of scan result names as prefixes.
+ * These are semantically "noise" for similarity — "Implement caching" and
+ * "Implement auth" should not score high just because they share "implement".
+ * Grouped by synonym class so e.g. "add" and "implement" are treated as
+ * interchangeable before content comparison.
+ */
+const ACTION_SYNONYM_MAP = {
+    add: "implement",
+    implement: "implement",
+    create: "implement",
+    build: "implement",
+    setup: "implement",
+    set: "implement", // "set up"
+    introduce: "implement",
+    fix: "fix",
+    resolve: "fix",
+    repair: "fix",
+    patch: "fix",
+    refactor: "refactor",
+    restructure: "refactor",
+    reorganize: "refactor",
+    clean: "refactor",
+    update: "update",
+    upgrade: "update",
+    improve: "update",
+    enhance: "update",
+    optimize: "update",
+    remove: "remove",
+    delete: "remove",
+    drop: "remove",
+    investigate: "investigate",
+    analyze: "investigate",
+    review: "investigate",
+    audit: "investigate",
+};
+/**
+ * Words that carry little semantic weight for distinguishing scan results.
+ * These are excluded from word-level matching so they don't inflate scores.
+ */
+const STOPWORDS = new Set([
+    "the", "a", "an", "and", "or", "for", "to", "in", "of", "on", "with",
+    "is", "be", "up", "by", "at", "as", "its", "it", "this", "that",
+]);
+/**
+ * Strip leading action verb from a normalized string and return the
+ * canonical verb + remaining content words.
+ */
+function splitActionContent(s) {
+    const words = s.split(" ").filter(Boolean);
+    if (words.length === 0)
+        return { verb: null, content: "" };
+    // Strip colon suffixes (e.g., "Fix:" → "fix")
+    const first = words[0].replace(/:$/, "");
+    const canonical = ACTION_SYNONYM_MAP[first];
+    if (canonical) {
+        // Also skip "up" after "set" (handles "set up caching")
+        let skip = 1;
+        if (first === "set" && words.length > 1 && words[1] === "up")
+            skip = 2;
+        const contentWords = words.slice(skip).filter((w) => !STOPWORDS.has(w));
+        return { verb: canonical, content: contentWords.join(" ") };
+    }
+    const contentWords = words.filter((w) => !STOPWORDS.has(w));
+    return { verb: null, content: contentWords.join(" ") };
+}
+/**
+ * Compute raw (non-action-aware) similarity between two normalized strings.
+ */
+function rawSimilarity(na, nb) {
+    if (na.length === 0 || nb.length === 0)
+        return 0;
+    if (na === nb)
+        return 1.0;
+    // Substring containment: if one fully contains the other, high similarity
+    if (na.includes(nb) || nb.includes(na)) {
+        const shorter = Math.min(na.length, nb.length);
+        const longer = Math.max(na.length, nb.length);
+        // Scale by length ratio so "a" contained in "abcdefghij" scores lower
+        // than "login flow" contained in "user login flow"
+        return Math.max(0.7, shorter / longer);
+    }
+    // Bigram Dice coefficient
+    const biA = bigrams(na);
+    const biB = bigrams(nb);
+    let bigramScore = 0;
+    if (biA.size > 0 && biB.size > 0) {
+        let intersection = 0;
+        for (const gram of biA) {
+            if (biB.has(gram))
+                intersection++;
+        }
+        bigramScore = (2 * intersection) / (biA.size + biB.size);
+    }
+    // Word-level fuzzy Jaccard: counts a word as matching if it equals or is a
+    // prefix of a word in the other set (e.g. "auth" matches "authentication").
+    // Prefix-matched pairs reduce the effective union size so that
+    // "auth bug" vs "authentication bug" isn't penalized for having 3 unique
+    // strings when "auth" and "authentication" represent the same concept.
+    const wA = wordSet(na);
+    const wB = wordSet(nb);
+    let wordScore = 0;
+    if (wA.size > 0 && wB.size > 0) {
+        let matched = 0;
+        let prefixPairs = 0; // count of prefix-matched pairs (collapse in union)
+        for (const w of wA) {
+            if (wB.has(w)) {
+                matched++;
+            }
+            else {
+                // Check if w is a prefix of any word in wB, or vice versa
+                for (const wb of wB) {
+                    if (wb.startsWith(w) || w.startsWith(wb)) {
+                        matched += 0.8; // Partial credit for prefix match
+                        prefixPairs++;
+                        break;
+                    }
+                }
+            }
+        }
+        // Effective union: total unique strings minus prefix-matched duplicates
+        const rawUnion = new Set([...wA, ...wB]).size;
+        const effectiveUnion = rawUnion - prefixPairs;
+        wordScore = matched / effectiveUnion;
+    }
+    return Math.max(bigramScore, wordScore);
+}
+/**
+ * Compute similarity between two strings using a combination of:
+ * 1. Action-verb normalization (synonyms mapped, then compared on content)
+ * 2. Bigram Dice coefficient (character-level)
+ * 3. Word overlap with fuzzy matching (Jaccard index)
+ * 4. Substring containment bonus
+ *
+ * When both strings start with an action verb (e.g. "Fix", "Implement"),
+ * the verb is factored out and similarity is computed on the remaining
+ * content words. Synonymous verbs ("Add" / "Implement") are treated as
+ * matching, so only the content difference matters.
+ *
+ * Returns the maximum of these scores (0.0–1.0).
+ */
+export function similarity(a, b) {
+    const na = normalize(a);
+    const nb = normalize(b);
+    if (na.length === 0 || nb.length === 0)
+        return 0;
+    if (na === nb)
+        return 1.0;
+    // Compute raw similarity on the full strings
+    const fullScore = rawSimilarity(na, nb);
+    // Action-verb-aware comparison: if both strings have a leading action verb,
+    // compute similarity on content words only and weight verb match separately.
+    // This prevents shared action verbs from inflating scores for unrelated items.
+    const sa = splitActionContent(na);
+    const sb = splitActionContent(nb);
+    if (sa.verb && sb.verb && sa.content.length > 0 && sb.content.length > 0) {
+        const contentScore = rawSimilarity(sa.content, sb.content);
+        if (sa.verb === sb.verb) {
+            // Same or synonymous verb: the verb is shared context that confirms
+            // relatedness when content overlaps. Score is primarily content-driven
+            // but verb agreement provides a boost when content is similar.
+            // This avoids inflating scores when content is unrelated (e.g. both
+            // say "Fix" but describe different bugs).
+            const verbAwareScore = contentScore * 0.85 + 0.15;
+            return Math.min(verbAwareScore, 1.0);
+        }
+        else {
+            // Different verb classes: content similarity alone decides.
+            return contentScore * 0.85;
+        }
+    }
+    return fullScore;
+}
+// ── Merge strategy: pick the "best" representative from a cluster ──
+function priorityRank(p) {
+    const key = p ?? "medium";
+    return key in PRIORITY_ORDER
+        ? PRIORITY_ORDER[key]
+        : 2;
+}
+/**
+ * Score a result for "richness" — higher is better.
+ * Prefers: higher priority > has description > has acceptance criteria > longer title.
+ */
+function richness(r) {
+    let score = 0;
+    // Higher priority = lower rank number = better
+    score += (4 - priorityRank(r.priority)) * 100;
+    if (r.description)
+        score += 50;
+    if (r.acceptanceCriteria && r.acceptanceCriteria.length > 0)
+        score += 30;
+    if (r.tags && r.tags.length > 0)
+        score += 10;
+    score += r.name.length; // prefer longer, more descriptive titles
+    return score;
+}
+/**
+ * Merge a cluster of near-duplicate ScanResults into a single representative.
+ * Picks the "richest" result as the base, then merges metadata from others.
+ */
+function mergeCluster(cluster) {
+    if (cluster.length === 1)
+        return cluster[0];
+    // Sort by richness descending; pick the best as base
+    const sorted = [...cluster].sort((a, b) => richness(b) - richness(a));
+    const best = sorted[0];
+    // Merge acceptance criteria from all members
+    const allCriteria = new Set();
+    for (const r of cluster) {
+        if (r.acceptanceCriteria) {
+            for (const c of r.acceptanceCriteria)
+                allCriteria.add(c);
+        }
+    }
+    // Merge tags from all members
+    const allTags = new Set();
+    for (const r of cluster) {
+        if (r.tags) {
+            for (const t of r.tags)
+                allTags.add(t);
+        }
+    }
+    return {
+        ...best,
+        acceptanceCriteria: allCriteria.size > 0 ? [...allCriteria] : best.acceptanceCriteria,
+        tags: allTags.size > 0 ? [...allTags] : best.tags,
+    };
+}
+// ── Public API ──
+/**
+ * Compute a combined similarity score for two scan results, considering
+ * both name and description similarity. When both results have descriptions,
+ * high description similarity can compensate for lower name similarity,
+ * catching duplicates that describe the same work in different words.
+ */
+function resultSimilarity(a, b) {
+    const nameScore = similarity(a.name, b.name);
+    // If both have descriptions, also consider description similarity
+    if (a.description && b.description) {
+        const descScore = similarity(a.description, b.description);
+        // High description overlap is a strong signal of duplication even when
+        // names differ (e.g. "Auth refactor" vs "JWT migration" with identical
+        // descriptions). Blend: use whichever signal is stronger, with a boost
+        // when both signals agree.
+        if (descScore >= 0.8) {
+            // Very similar descriptions: boost the combined score significantly
+            return Math.max(nameScore, descScore * 0.9 + nameScore * 0.1);
+        }
+        if (descScore >= 0.5) {
+            // Moderately similar descriptions: blend with name score
+            return Math.max(nameScore, nameScore * 0.6 + descScore * 0.4);
+        }
+    }
+    return nameScore;
+}
+/**
+ * Deduplicate scan results by merging near-duplicates within the same kind.
+ *
+ * Uses multi-signal similarity: name comparison (bigram Dice + word overlap
+ * with action-verb normalization) combined with description similarity for
+ * results that describe the same work in different words.
+ *
+ * Results of different kinds (epic vs feature vs task) are never merged.
+ *
+ * @param results - Raw scan results
+ * @param threshold - Similarity threshold (0.0–1.0). Default 0.7.
+ * @returns Deduplicated results with merged metadata
+ */
+export function deduplicateScanResults(results, threshold = DEFAULT_THRESHOLD) {
+    if (results.length === 0)
+        return [];
+    // Group by kind — only merge within same kind
+    const byKind = new Map();
+    for (const r of results) {
+        const group = byKind.get(r.kind) ?? [];
+        group.push(r);
+        byKind.set(r.kind, group);
+    }
+    const output = [];
+    for (const [, kindResults] of byKind) {
+        // Build clusters using union-find approach
+        const n = kindResults.length;
+        const parent = Array.from({ length: n }, (_, i) => i);
+        function find(i) {
+            while (parent[i] !== i) {
+                parent[i] = parent[parent[i]]; // path compression
+                i = parent[i];
+            }
+            return i;
+        }
+        function union(i, j) {
+            const ri = find(i);
+            const rj = find(j);
+            if (ri !== rj)
+                parent[ri] = rj;
+        }
+        // Compare all pairs within this kind using combined similarity
+        for (let i = 0; i < n; i++) {
+            for (let j = i + 1; j < n; j++) {
+                const score = resultSimilarity(kindResults[i], kindResults[j]);
+                if (score >= threshold) {
+                    union(i, j);
+                }
+            }
+        }
+        // Collect clusters
+        const clusters = new Map();
+        for (let i = 0; i < n; i++) {
+            const root = find(i);
+            const cluster = clusters.get(root) ?? [];
+            cluster.push(kindResults[i]);
+            clusters.set(root, cluster);
+        }
+        // Merge each cluster into a single representative
+        for (const [, cluster] of clusters) {
+            output.push(mergeCluster(cluster));
+        }
+    }
+    return output;
+}
+//# sourceMappingURL=dedupe.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dedupe.js","sourceRoot":"","sources":["../../src/analyze/dedupe.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEpD,+DAA+D;AAC/D,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,2BAA2B;AAE3B,SAAS,SAAS,CAAC,CAAS;IAC1B,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,kBAAkB,GAA2B;IACjD,GAAG,EAAE,WAAW;IAChB,SAAS,EAAE,WAAW;IACtB,MAAM,EAAE,WAAW;IACnB,KAAK,EAAE,WAAW;IAClB,KAAK,EAAE,WAAW;IAClB,GAAG,EAAE,WAAW,EAAE,WAAW;IAC7B,SAAS,EAAE,WAAW;IACtB,GAAG,EAAE,KAAK;IACV,OAAO,EAAE,KAAK;IACd,MAAM,EAAE,KAAK;IACb,KAAK,EAAE,KAAK;IACZ,QAAQ,EAAE,UAAU;IACpB,WAAW,EAAE,UAAU;IACvB,UAAU,EAAE,UAAU;IACtB,KAAK,EAAE,UAAU;IACjB,MAAM,EAAE,QAAQ;IAChB,OAAO,EAAE,QAAQ;IACjB,OAAO,EAAE,QAAQ;IACjB,OAAO,EAAE,QAAQ;IACjB,QAAQ,EAAE,QAAQ;IAClB,MAAM,EAAE,QAAQ;IAChB,MAAM,EAAE,QAAQ;IAChB,IAAI,EAAE,QAAQ;IACd,WAAW,EAAE,aAAa;IAC1B,OAAO,EAAE,aAAa;IACtB,MAAM,EAAE,aAAa;IACrB,KAAK,EAAE,aAAa;CACrB,CAAC;AAEF;;;GAGG;AACH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;IACpE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM;CAChE,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,kBAAkB,CAAC,CAAS;IACnC,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC3C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAE3D,8CAA8C;IAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAC5C,IAAI,SAAS,EAAE,CAAC;QACd,wDAAwD;QACxD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,IAAI,GAAG,CAAC,CAAC;QACvE,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACxE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;IAC9D,CAAC;IAED,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACzD,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,EAAU,EAAE,EAAU;IAC3C,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjD,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAE1B,0EAA0E;IAC1E,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;QAC9C,sEAAsE;QACtE,mDAAmD;QACnD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,CAAC,CAAC;IACzC,CAAC;IAED,0BAA0B;IAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IACxB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACjC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,YAAY,EAAE,CAAC;QACpC,CAAC;QACD,WAAW,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IAED,2EAA2E;IAC3E,4EAA4E;IAC5E,+DAA+D;IAC/D,yEAAyE;IACzE,uEAAuE;IACvE,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC,oDAAoD;QAEzE,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACd,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,CAAC;gBACN,0DAA0D;gBAC1D,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;oBACpB,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;wBACzC,OAAO,IAAI,GAAG,CAAC,CAAC,kCAAkC;wBAClD,WAAW,EAAE,CAAC;wBACd,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9C,MAAM,cAAc,GAAG,QAAQ,GAAG,WAAW,CAAC;QAC9C,SAAS,GAAG,OAAO,GAAG,cAAc,CAAC;IACvC,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAExB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjD,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAE1B,6CAA6C;IAC7C,MAAM,SAAS,GAAG,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAExC,4EAA4E;IAC5E,6EAA6E;IAC7E,+EAA+E;IAC/E,MAAM,EAAE,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;IAElC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzE,MAAM,YAAY,GAAG,aAAa,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;QAE3D,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC;YACxB,oEAAoE;YACpE,uEAAuE;YACvE,+DAA+D;YAC/D,oEAAoE;YACpE,0CAA0C;YAC1C,MAAM,cAAc,GAAG,YAAY,GAAG,IAAI,GAAG,IAAI,CAAC;YAClD,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,GAAG,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,4DAA4D;YAC5D,OAAO,YAAY,GAAG,IAAI,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,sEAAsE;AAEtE,SAAS,YAAY,CAAC,CAAU;IAC9B,MAAM,GAAG,GAAG,CAAC,IAAI,QAAQ,CAAC;IAC1B,OAAO,GAAG,IAAI,cAAc;QAC1B,CAAC,CAAC,cAAc,CAAC,GAAkC,CAAC;QACpD,CAAC,CAAC,CAAC,CAAC;AACR,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,CAAa;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,+CAA+C;IAC/C,KAAK,IAAI,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,GAAG,CAAC;IAC9C,IAAI,CAAC,CAAC,WAAW;QAAE,KAAK,IAAI,EAAE,CAAC;IAC/B,IAAI,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,IAAI,EAAE,CAAC;IACzE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,KAAK,IAAI,EAAE,CAAC;IAC7C,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,yCAAyC;IACjE,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CAAC,OAAqB;IACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IAE5C,qDAAqD;IACrD,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEvB,6CAA6C;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,kBAAkB,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,kBAAkB;gBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACX,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG,IAAI;QACP,kBAAkB,EAChB,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB;QACnE,IAAI,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI;KAClD,CAAC;AACJ,CAAC;AAED,mBAAmB;AAEnB;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,CAAa,EAAE,CAAa;IACpD,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAE7C,kEAAkE;IAClE,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;QAE3D,uEAAuE;QACvE,uEAAuE;QACvE,uEAAuE;QACvE,2BAA2B;QAC3B,IAAI,SAAS,IAAI,GAAG,EAAE,CAAC;YACrB,oEAAoE;YACpE,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,GAAG,GAAG,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,SAAS,IAAI,GAAG,EAAE,CAAC;YACrB,yDAAyD;YACzD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,GAAG,GAAG,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,sBAAsB,CACpC,OAAqB,EACrB,YAAoB,iBAAiB;IAErC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,8CAA8C;IAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,MAAM,GAAiB,EAAE,CAAC;IAEhC,KAAK,MAAM,CAAC,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,CAAC;QACrC,2CAA2C;QAC3C,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;QAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAEtD,SAAS,IAAI,CAAC,CAAS;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB;gBAClD,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,EAAE,KAAK,EAAE;gBAAE,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;QACjC,CAAC;QAED,+DAA+D;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;oBACvB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC9B,CAAC;QAED,kDAAkD;QAClD,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

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

@@ -0,0 +1,13 @@
+import type { PRDItem } from "../schema/index.js";
+import type { Proposal } from "./propose.js";
+/**
+ * Format a diff view comparing proposals against the existing PRD.
+ *
+ * Markers:
+ *   + = will be added (new item)
+ *   ~ = exists, will receive new children underneath
+ *   = = unchanged (already exists in PRD)
+ *
+ * Returns a formatted string showing the diff tree and a summary line.
+ */
+export declare function formatDiff(proposals: Proposal[], existing: PRDItem[]): string;

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

@@ -0,0 +1,146 @@
+import { walkTree } from "../core/tree.js";
+function normalize(s) {
+    return s.toLowerCase().trim();
+}
+/**
+ * Build a set of normalized titles at each level from the existing PRD tree.
+ * Returns a map of parent-normalized-title → set of child-normalized-titles,
+ * plus a flat set of all existing titles for quick lookup.
+ */
+function buildExistingIndex(existing) {
+    const allTitles = new Set();
+    const childrenOf = new Map();
+    for (const { item, parents } of walkTree(existing)) {
+        allTitles.add(normalize(item.title));
+        if (parents.length > 0) {
+            const parentKey = normalize(parents[parents.length - 1].title);
+            if (!childrenOf.has(parentKey)) {
+                childrenOf.set(parentKey, new Set());
+            }
+            childrenOf.get(parentKey).add(normalize(item.title));
+        }
+    }
+    return { allTitles, childrenOf };
+}
+/**
+ * Format a diff view comparing proposals against the existing PRD.
+ *
+ * Markers:
+ *   + = will be added (new item)
+ *   ~ = exists, will receive new children underneath
+ *   = = unchanged (already exists in PRD)
+ *
+ * Returns a formatted string showing the diff tree and a summary line.
+ */
+export function formatDiff(proposals, existing) {
+    if (proposals.length === 0) {
+        return "No changes to apply.";
+    }
+    const { allTitles, childrenOf } = buildExistingIndex(existing);
+    const lines = [];
+    let addCount = 0;
+    let unchangedCount = 0;
+    for (const p of proposals) {
+        const epicKey = normalize(p.epic.title);
+        const epicExists = allTitles.has(epicKey);
+        const epicChildren = childrenOf.get(epicKey) ?? new Set();
+        // Determine if epic has any new descendants
+        let epicHasNewContent = false;
+        for (const f of p.features) {
+            const featureKey = normalize(f.title);
+            if (!epicChildren.has(featureKey)) {
+                epicHasNewContent = true;
+                break;
+            }
+            const featureChildren = childrenOf.get(featureKey) ?? new Set();
+            for (const t of f.tasks) {
+                if (!featureChildren.has(normalize(t.title))) {
+                    epicHasNewContent = true;
+                    break;
+                }
+            }
+            if (epicHasNewContent)
+                break;
+        }
+        if (epicExists) {
+            if (epicHasNewContent) {
+                lines.push({ marker: "~", level: "epic", title: p.epic.title, suffix: "", indent: 0 });
+            }
+            else {
+                lines.push({ marker: "=", level: "epic", title: p.epic.title, suffix: "", indent: 0 });
+                unchangedCount++;
+            }
+        }
+        else {
+            lines.push({ marker: "+", level: "epic", title: p.epic.title, suffix: "", indent: 0 });
+            addCount++;
+        }
+        for (const f of p.features) {
+            const featureKey = normalize(f.title);
+            const featureExists = epicChildren.has(featureKey);
+            const featureChildren = childrenOf.get(featureKey) ?? new Set();
+            // Check if feature has new tasks
+            let featureHasNewTasks = false;
+            for (const t of f.tasks) {
+                if (!featureChildren.has(normalize(t.title))) {
+                    featureHasNewTasks = true;
+                    break;
+                }
+            }
+            if (featureExists) {
+                if (featureHasNewTasks) {
+                    lines.push({ marker: "~", level: "feature", title: f.title, suffix: "", indent: 1 });
+                }
+                else {
+                    lines.push({ marker: "=", level: "feature", title: f.title, suffix: "", indent: 1 });
+                    unchangedCount++;
+                }
+            }
+            else {
+                lines.push({ marker: "+", level: "feature", title: f.title, suffix: "", indent: 1 });
+                addCount++;
+            }
+            for (const t of f.tasks) {
+                const taskKey = normalize(t.title);
+                const taskExists = featureChildren.has(taskKey);
+                const pri = t.priority ? ` [${t.priority}]` : "";
+                if (t.decomposition) {
+                    // Show decomposed task with children indented beneath
+                    const loeLabel = t.loe !== undefined ? `${t.loe}w` : "?";
+                    const thresholdLabel = `${t.decomposition.thresholdWeeks}w`;
+                    const decompSuffix = `${pri} ⚡ decomposed (LoE: ${loeLabel} > ${thresholdLabel} threshold)`;
+                    lines.push({ marker: "+", level: "task", title: t.title, suffix: decompSuffix, indent: 2 });
+                    addCount++;
+                    for (const child of t.decomposition.children) {
+                        const childPri = child.priority ? ` [${child.priority}]` : "";
+                        const childLoe = child.loe !== undefined ? ` (LoE: ${child.loe}w)` : "";
+                        lines.push({ marker: "+", level: "child", title: `↳ ${child.title}`, suffix: `${childPri}${childLoe}`, indent: 3 });
+                        addCount++;
+                    }
+                }
+                else if (taskExists) {
+                    lines.push({ marker: "=", level: "task", title: t.title, suffix: pri, indent: 2 });
+                    unchangedCount++;
+                }
+                else {
+                    lines.push({ marker: "+", level: "task", title: t.title, suffix: pri, indent: 2 });
+                    addCount++;
+                }
+            }
+        }
+    }
+    const output = [];
+    for (const line of lines) {
+        const indent = "  ".repeat(line.indent);
+        output.push(`${line.marker} ${indent}[${line.level}] ${line.title}${line.suffix}`);
+    }
+    output.push("");
+    const parts = [];
+    if (addCount > 0)
+        parts.push(`${addCount} to add`);
+    if (unchangedCount > 0)
+        parts.push(`${unchangedCount} unchanged`);
+    output.push(`Summary: ${parts.join(", ")}`);
+    return output.join("\n");
+}
+//# sourceMappingURL=diff.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/analyze/diff.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAE3C,SAAS,SAAS,CAAC,CAAS;IAC1B,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;AAChC,CAAC;AAUD;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,QAAmB;IAI7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAElD,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACnD,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAErC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC/D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC/B,UAAU,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACvC,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;AACnC,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CACxB,SAAqB,EACrB,QAAmB;IAEnB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,sBAAsB,CAAC;IAChC,CAAC;IAED,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAElE,4CAA4C;QAC5C,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClC,iBAAiB,GAAG,IAAI,CAAC;gBACzB,MAAM;YACR,CAAC;YACD,MAAM,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YACxE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC7C,iBAAiB,GAAG,IAAI,CAAC;oBACzB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,iBAAiB;gBAAE,MAAM;QAC/B,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,iBAAiB,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YACzF,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;gBACvF,cAAc,EAAE,CAAC;YACnB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YACvF,QAAQ,EAAE,CAAC;QACb,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACtC,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACnD,MAAM,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YAExE,iCAAiC;YACjC,IAAI,kBAAkB,GAAG,KAAK,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC7C,kBAAkB,GAAG,IAAI,CAAC;oBAC1B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,aAAa,EAAE,CAAC;gBAClB,IAAI,kBAAkB,EAAE,CAAC;oBACvB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;gBACvF,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;oBACrF,cAAc,EAAE,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;gBACrF,QAAQ,EAAE,CAAC;YACb,CAAC;YAED,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACnC,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAChD,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAEjD,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;oBACpB,sDAAsD;oBACtD,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;oBACzD,MAAM,cAAc,GAAG,GAAG,CAAC,CAAC,aAAa,CAAC,cAAc,GAAG,CAAC;oBAC5D,MAAM,YAAY,GAAG,GAAG,GAAG,uBAAuB,QAAQ,MAAM,cAAc,aAAa,CAAC;oBAC5F,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC5F,QAAQ,EAAE,CAAC;oBACX,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC;wBAC7C,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;wBACxE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,KAAK,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,GAAG,QAAQ,GAAG,QAAQ,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;wBACpH,QAAQ,EAAE,CAAC;oBACb,CAAC;gBACH,CAAC;qBAAM,IAAI,UAAU,EAAE,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;oBACnF,cAAc,EAAE,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;oBACnF,QAAQ,EAAE,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACrF,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEhB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,QAAQ,SAAS,CAAC,CAAC;IACnD,IAAI,cAAc,GAAG,CAAC;QAAE,KAAK,CAAC,IAAI,CAAC,GAAG,cAAc,YAAY,CAAC,CAAC;IAClE,MAAM,CAAC,IAAI,CAAC,YAAY,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE5C,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC"}