gitx.do 0.0.1

package/dist/ops/merge-base.js

@@ -0,0 +1,581 @@
+/**
+ * Merge Base Finding Operations
+ *
+ * Provides functionality for finding merge bases between commits,
+ * which is essential for merge operations, rebasing, and understanding
+ * branch relationships in the commit graph.
+ *
+ * A merge base is the best common ancestor(s) of two or more commits.
+ * The "best" common ancestor is one that is not an ancestor of any
+ * other common ancestor (i.e., a maximal common ancestor).
+ */
+// ============================================================================
+// Helper Functions
+// ============================================================================
+/**
+ * Get all ancestors of a commit (including itself)
+ * Uses iterative BFS to avoid stack overflow with deep histories
+ */
+async function getAncestors(provider, sha) {
+    const visited = new Set();
+    const queue = [sha];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (visited.has(current)) {
+            continue;
+        }
+        const commit = await provider.getCommit(current);
+        if (!commit) {
+            continue;
+        }
+        visited.add(current);
+        for (const parent of commit.parents) {
+            if (!visited.has(parent)) {
+                queue.push(parent);
+            }
+        }
+    }
+    return visited;
+}
+/**
+ * Find all common ancestors of two commits
+ */
+async function findCommonAncestors(provider, sha1, sha2) {
+    const ancestors1 = await getAncestors(provider, sha1);
+    const ancestors2 = await getAncestors(provider, sha2);
+    const common = new Set();
+    for (const sha of ancestors1) {
+        if (ancestors2.has(sha)) {
+            common.add(sha);
+        }
+    }
+    return common;
+}
+/**
+ * Filter common ancestors to only keep maximal ones
+ * (those that are not ancestors of any other common ancestor)
+ */
+async function filterToMaximalAncestors(provider, commonAncestors) {
+    const ancestorsList = Array.from(commonAncestors);
+    if (ancestorsList.length === 0) {
+        return [];
+    }
+    if (ancestorsList.length === 1) {
+        return ancestorsList;
+    }
+    // For each ancestor, check if it's an ancestor of any other ancestor
+    const isAncestorOfAnother = new Map();
+    for (const sha of ancestorsList) {
+        isAncestorOfAnother.set(sha, false);
+    }
+    // Build ancestor sets for each common ancestor
+    const ancestorSets = new Map();
+    for (const sha of ancestorsList) {
+        const ancestors = await getAncestors(provider, sha);
+        // Remove the sha itself from its ancestors for comparison
+        ancestors.delete(sha);
+        ancestorSets.set(sha, ancestors);
+    }
+    // Check which ones are ancestors of others
+    for (const sha of ancestorsList) {
+        for (const otherSha of ancestorsList) {
+            if (sha !== otherSha) {
+                const otherAncestors = ancestorSets.get(otherSha);
+                if (otherAncestors.has(sha)) {
+                    isAncestorOfAnother.set(sha, true);
+                    break;
+                }
+            }
+        }
+    }
+    // Return only maximal ancestors
+    return ancestorsList.filter(sha => !isAncestorOfAnother.get(sha));
+}
+// ============================================================================
+// Core Functions
+// ============================================================================
+/**
+ * Find the merge base of two or more commits
+ *
+ * Given two commits, finds the best common ancestor (merge base).
+ * Given multiple commits, finds the merge base of all of them.
+ *
+ * This is equivalent to `git merge-base`.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param commits - Two or more commit SHAs
+ * @param options - Options for the merge base search
+ * @returns The merge base result
+ *
+ * @example
+ * ```ts
+ * const result = await findMergeBase(provider, ['abc123', 'def456'])
+ * if (result.hasCommonHistory) {
+ *   console.log('Merge base:', result.bases[0])
+ * }
+ * ```
+ */
+export async function findMergeBase(provider, commits, options = {}) {
+    // Handle edge cases
+    if (commits.length === 0) {
+        return {
+            bases: [],
+            isUnique: false,
+            hasCommonHistory: false,
+            count: 0
+        };
+    }
+    if (commits.length === 1) {
+        const commit = await provider.getCommit(commits[0]);
+        if (!commit) {
+            return {
+                bases: [],
+                isUnique: false,
+                hasCommonHistory: false,
+                count: 0
+            };
+        }
+        return {
+            bases: [commits[0]],
+            isUnique: true,
+            hasCommonHistory: true,
+            count: 1
+        };
+    }
+    // Handle independent option
+    if (options.independent) {
+        const independent = await findIndependentCommits(provider, commits);
+        return {
+            bases: independent,
+            isUnique: independent.length === 1,
+            hasCommonHistory: independent.length > 0,
+            count: independent.length
+        };
+    }
+    // Handle octopus option
+    if (options.octopus || commits.length > 2) {
+        const bases = await findOctopusMergeBase(provider, commits);
+        return {
+            bases,
+            isUnique: bases.length === 1,
+            hasCommonHistory: bases.length > 0,
+            count: bases.length
+        };
+    }
+    // Handle fork point option
+    if (options.forkPoint && commits.length === 2) {
+        const result = await findForkPoint(provider, commits[0], commits[1]);
+        if (result.found && result.forkPoint) {
+            return {
+                bases: [result.forkPoint],
+                isUnique: true,
+                hasCommonHistory: true,
+                count: 1
+            };
+        }
+    }
+    // Standard two-commit merge base
+    const [sha1, sha2] = commits;
+    // Check if either commit doesn't exist
+    const commit1 = await provider.getCommit(sha1);
+    const commit2 = await provider.getCommit(sha2);
+    if (!commit1 || !commit2) {
+        return {
+            bases: [],
+            isUnique: false,
+            hasCommonHistory: false,
+            count: 0
+        };
+    }
+    // Find all common ancestors
+    const commonAncestors = await findCommonAncestors(provider, sha1, sha2);
+    if (commonAncestors.size === 0) {
+        return {
+            bases: [],
+            isUnique: false,
+            hasCommonHistory: false,
+            count: 0
+        };
+    }
+    // Filter to maximal ancestors
+    const maximalBases = await filterToMaximalAncestors(provider, commonAncestors);
+    if (options.all) {
+        return {
+            bases: maximalBases,
+            isUnique: maximalBases.length === 1,
+            hasCommonHistory: true,
+            count: maximalBases.length
+        };
+    }
+    // Default: return just one merge base
+    return {
+        bases: maximalBases.length > 0 ? [maximalBases[0]] : [],
+        isUnique: maximalBases.length === 1,
+        hasCommonHistory: maximalBases.length > 0,
+        count: 1
+    };
+}
+/**
+ * Find all merge bases between two commits
+ *
+ * Unlike findMergeBase with all=true, this specifically finds
+ * all maximal common ancestors, which is useful for criss-cross
+ * merge situations.
+ *
+ * This is equivalent to `git merge-base --all`.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param commit1 - First commit SHA
+ * @param commit2 - Second commit SHA
+ * @returns Array of all merge base SHAs
+ *
+ * @example
+ * ```ts
+ * const bases = await findAllMergeBases(provider, 'abc123', 'def456')
+ * if (bases.length > 1) {
+ *   console.log('Multiple merge bases (criss-cross merge):', bases)
+ * }
+ * ```
+ */
+export async function findAllMergeBases(provider, commit1, commit2) {
+    const result = await findMergeBase(provider, [commit1, commit2], { all: true });
+    return result.bases;
+}
+/**
+ * Find the fork point of a branch relative to another ref
+ *
+ * Calculates where a branch forked off from another branch,
+ * taking into account any rebases that may have occurred.
+ * This uses reflog information when available.
+ *
+ * This is equivalent to `git merge-base --fork-point`.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param ref - The branch ref to analyze
+ * @param baseRef - The base ref to compare against
+ * @param reflog - Optional reflog entries for more accurate detection
+ * @returns The fork point result
+ *
+ * @example
+ * ```ts
+ * const result = await findForkPoint(provider, 'feature-branch', 'main')
+ * if (result.found) {
+ *   console.log('Forked from:', result.forkPoint)
+ * }
+ * ```
+ */
+export async function findForkPoint(provider, ref, baseRef, reflog) {
+    // If reflog is provided, use it for better detection
+    if (reflog && reflog.length > 0) {
+        // Get ancestors of ref
+        const refAncestors = await getAncestors(provider, ref);
+        // Check each reflog entry to find the fork point
+        for (const entry of reflog) {
+            if (refAncestors.has(entry)) {
+                // Found a common point in the reflog
+                // Calculate commits since fork
+                let commitsSinceFork = 0;
+                let current = ref;
+                while (current !== entry) {
+                    const commit = await provider.getCommit(current);
+                    if (!commit || commit.parents.length === 0)
+                        break;
+                    commitsSinceFork++;
+                    current = commit.parents[0];
+                }
+                return {
+                    forkPoint: entry,
+                    ref,
+                    found: true,
+                    commitsSinceFork
+                };
+            }
+        }
+    }
+    // Standard fork point detection: find merge base
+    const result = await findMergeBase(provider, [ref, baseRef]);
+    if (!result.hasCommonHistory || result.bases.length === 0) {
+        return {
+            forkPoint: null,
+            ref,
+            found: false,
+            commitsSinceFork: 0
+        };
+    }
+    const forkPoint = result.bases[0];
+    // Calculate commits since fork
+    let commitsSinceFork = 0;
+    let current = ref;
+    const visited = new Set();
+    while (current !== forkPoint && !visited.has(current)) {
+        visited.add(current);
+        const commit = await provider.getCommit(current);
+        if (!commit)
+            break;
+        if (current === forkPoint)
+            break;
+        commitsSinceFork++;
+        if (commit.parents.length === 0)
+            break;
+        current = commit.parents[0];
+    }
+    return {
+        forkPoint,
+        ref,
+        found: true,
+        commitsSinceFork
+    };
+}
+/**
+ * Check if one commit is an ancestor of another
+ *
+ * Returns true if the first commit is reachable from the second
+ * commit by following parent links.
+ *
+ * This is equivalent to `git merge-base --is-ancestor`.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param potentialAncestor - The commit to check as potential ancestor
+ * @param commit - The commit to start walking from
+ * @returns True if potentialAncestor is an ancestor of commit
+ *
+ * @example
+ * ```ts
+ * if (await isAncestor(provider, 'oldcommit', 'newcommit')) {
+ *   console.log('oldcommit is an ancestor of newcommit')
+ * }
+ * ```
+ */
+export async function isAncestor(provider, potentialAncestor, commit) {
+    // Same commit is considered its own ancestor
+    if (potentialAncestor === commit) {
+        return true;
+    }
+    const ancestors = await getAncestors(provider, commit);
+    return ancestors.has(potentialAncestor);
+}
+/**
+ * Check ancestor relationship and return additional information
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param potentialAncestor - The commit to check as potential ancestor
+ * @param commit - The commit to start walking from
+ * @returns Detailed ancestor check result
+ */
+export async function checkAncestor(provider, potentialAncestor, commit) {
+    // Same commit
+    if (potentialAncestor === commit) {
+        return {
+            isAncestor: true,
+            distance: 0
+        };
+    }
+    // BFS to find the shortest path
+    const queue = [{ sha: commit, distance: 0 }];
+    const visited = new Set();
+    while (queue.length > 0) {
+        const { sha, distance } = queue.shift();
+        if (visited.has(sha))
+            continue;
+        visited.add(sha);
+        if (sha === potentialAncestor) {
+            return {
+                isAncestor: true,
+                distance
+            };
+        }
+        const commitObj = await provider.getCommit(sha);
+        if (!commitObj)
+            continue;
+        for (const parent of commitObj.parents) {
+            if (!visited.has(parent)) {
+                queue.push({ sha: parent, distance: distance + 1 });
+            }
+        }
+    }
+    return {
+        isAncestor: false,
+        distance: -1
+    };
+}
+// ============================================================================
+// Advanced Functions
+// ============================================================================
+/**
+ * Find independent commits from a list
+ *
+ * Returns the subset of commits that are not reachable from
+ * any other commit in the list.
+ *
+ * This is equivalent to `git merge-base --independent`.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param commits - List of commit SHAs to analyze
+ * @returns Array of independent commit SHAs
+ *
+ * @example
+ * ```ts
+ * const independent = await findIndependentCommits(provider, [a, b, c])
+ * // Returns commits that are not ancestors of others
+ * ```
+ */
+export async function findIndependentCommits(provider, commits) {
+    if (commits.length <= 1) {
+        return [...commits];
+    }
+    // Build ancestor sets for each commit
+    const ancestorSets = new Map();
+    for (const sha of commits) {
+        const ancestors = await getAncestors(provider, sha);
+        // Remove the commit itself from its ancestor set
+        ancestors.delete(sha);
+        ancestorSets.set(sha, ancestors);
+    }
+    // A commit is independent if it's not an ancestor of any other commit in the list
+    const independent = [];
+    for (const sha of commits) {
+        let isAncestorOfAnother = false;
+        for (const otherSha of commits) {
+            if (sha !== otherSha) {
+                const otherAncestors = ancestorSets.get(otherSha);
+                if (otherAncestors.has(sha)) {
+                    isAncestorOfAnother = true;
+                    break;
+                }
+            }
+        }
+        if (!isAncestorOfAnother) {
+            independent.push(sha);
+        }
+    }
+    return independent;
+}
+/**
+ * Find the octopus merge base
+ *
+ * For merging more than two branches, finds a suitable merge base
+ * that works for all branches.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param commits - List of commit SHAs (3 or more)
+ * @returns The octopus merge base SHA(s)
+ */
+export async function findOctopusMergeBase(provider, commits) {
+    if (commits.length === 0) {
+        return [];
+    }
+    if (commits.length === 1) {
+        const commit = await provider.getCommit(commits[0]);
+        return commit ? [commits[0]] : [];
+    }
+    if (commits.length === 2) {
+        return findAllMergeBases(provider, commits[0], commits[1]);
+    }
+    // For 3+ commits, iteratively find the merge base
+    // Start with the first two commits
+    let currentBases = await findAllMergeBases(provider, commits[0], commits[1]);
+    if (currentBases.length === 0) {
+        return [];
+    }
+    // For each additional commit, find the merge base with current bases
+    for (let i = 2; i < commits.length; i++) {
+        const nextCommit = commits[i];
+        const newBases = [];
+        for (const base of currentBases) {
+            const bases = await findAllMergeBases(provider, base, nextCommit);
+            for (const b of bases) {
+                if (!newBases.includes(b)) {
+                    newBases.push(b);
+                }
+            }
+        }
+        if (newBases.length === 0) {
+            return [];
+        }
+        currentBases = newBases;
+    }
+    return currentBases;
+}
+/**
+ * Compute the three-way merge base for a merge operation
+ *
+ * Given the current HEAD, merge target, and optionally a common ancestor,
+ * returns the appropriate base for a three-way merge.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param ours - Our commit (HEAD)
+ * @param theirs - Their commit (merge target)
+ * @returns The merge base for three-way merge
+ */
+export async function computeThreeWayMergeBase(provider, ours, theirs) {
+    return findMergeBase(provider, [ours, theirs]);
+}
+/**
+ * Check if commits have any common history
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param commits - List of commit SHAs to check
+ * @returns True if all commits share common history
+ */
+export async function hasCommonHistory(provider, commits) {
+    if (commits.length <= 1) {
+        return true;
+    }
+    // Check pairwise - for common history, all pairs must have a common ancestor
+    for (let i = 0; i < commits.length; i++) {
+        for (let j = i + 1; j < commits.length; j++) {
+            const common = await findCommonAncestors(provider, commits[i], commits[j]);
+            if (common.size === 0) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+/**
+ * Calculate merge base for a recursive merge
+ *
+ * When there are multiple merge bases (criss-cross merge situation),
+ * this creates a virtual merge base by merging the merge bases.
+ *
+ * @param provider - The commit provider for fetching commits
+ * @param commit1 - First commit SHA
+ * @param commit2 - Second commit SHA
+ * @returns The recursive merge base
+ */
+export async function computeRecursiveMergeBase(provider, commit1, commit2) {
+    const allBases = await findAllMergeBases(provider, commit1, commit2);
+    if (allBases.length === 0) {
+        return {
+            bases: [],
+            isUnique: false,
+            hasCommonHistory: false,
+            count: 0
+        };
+    }
+    if (allBases.length === 1) {
+        return {
+            bases: allBases,
+            isUnique: true,
+            hasCommonHistory: true,
+            count: 1
+        };
+    }
+    // Multiple merge bases - recursively merge them
+    // In a real implementation, this would create virtual merge commits
+    // For now, we return the result of recursively finding merge bases of the bases
+    let currentBase = allBases[0];
+    for (let i = 1; i < allBases.length; i++) {
+        const result = await findMergeBase(provider, [currentBase, allBases[i]]);
+        if (result.bases.length > 0) {
+            currentBase = result.bases[0];
+        }
+    }
+    return {
+        bases: [currentBase],
+        isUnique: true,
+        hasCommonHistory: true,
+        count: 1
+    };
+}
+//# sourceMappingURL=merge-base.js.map

package/dist/ops/merge-base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-base.js","sourceRoot":"","sources":["../../src/ops/merge-base.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAgEH,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;GAGG;AACH,KAAK,UAAU,YAAY,CACzB,QAAwB,EACxB,GAAW;IAEX,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,CAAA;IAE7B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACzB,SAAQ;QACV,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;QAChD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,SAAQ;QACV,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEpB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,mBAAmB,CAChC,QAAwB,EACxB,IAAY,EACZ,IAAY;IAEZ,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACrD,MAAM,UAAU,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IAErD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACjB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,wBAAwB,CACrC,QAAwB,EACxB,eAA4B;IAE5B,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAA;IAEjD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,CAAA;IACX,CAAC;IAED,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,aAAa,CAAA;IACtB,CAAC;IAED,qEAAqE;IACrE,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAmB,CAAA;IAEtD,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,mBAAmB,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IACrC,CAAC;IAED,+CAA+C;IAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAA;IACnD,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;QACnD,0DAA0D;QAC1D,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACrB,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;IAClC,CAAC;IAED,2CAA2C;IAC3C,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;YACrC,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;gBACrB,MAAM,cAAc,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAA;gBAClD,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC5B,mBAAmB,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;oBAClC,MAAK;gBACP,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,OAAO,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AACnE,CAAC;AAED,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,QAAwB,EACxB,OAAiB,EACjB,UAA4B,EAAE;IAE9B,oBAAoB;IACpB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,KAAK;YACf,gBAAgB,EAAE,KAAK;YACvB,KAAK,EAAE,CAAC;SACT,CAAA;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QACnD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,QAAQ,EAAE,KAAK;gBACf,gBAAgB,EAAE,KAAK;gBACvB,KAAK,EAAE,CAAC;aACT,CAAA;QACH,CAAC;QACD,OAAO;YACL,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACnB,QAAQ,EAAE,IAAI;YACd,gBAAgB,EAAE,IAAI;YACtB,KAAK,EAAE,CAAC;SACT,CAAA;IACH,CAAC;IAED,4BAA4B;IAC5B,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QACxB,MAAM,WAAW,GAAG,MAAM,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;QACnE,OAAO;YACL,KAAK,EAAE,WAAW;YAClB,QAAQ,EAAE,WAAW,CAAC,MAAM,KAAK,CAAC;YAClC,gBAAgB,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;YACxC,KAAK,EAAE,WAAW,CAAC,MAAM;SAC1B,CAAA;IACH,CAAC;IAED,wBAAwB;IACxB,IAAI,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;QAC3D,OAAO;YACL,KAAK;YACL,QAAQ,EAAE,KAAK,CAAC,MAAM,KAAK,CAAC;YAC5B,gBAAgB,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;YAClC,KAAK,EAAE,KAAK,CAAC,MAAM;SACpB,CAAA;IACH,CAAC;IAED,2BAA2B;IAC3B,IAAI,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QACpE,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACrC,OAAO;gBACL,KAAK,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC;gBACzB,QAAQ,EAAE,IAAI;gBACd,gBAAgB,EAAE,IAAI;gBACtB,KAAK,EAAE,CAAC;aACT,CAAA;QACH,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,OAAO,CAAA;IAE5B,uCAAuC;IACvC,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IAC9C,MAAM,OAAO,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IAE9C,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QACzB,OAAO;YACL,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,KAAK;YACf,gBAAgB,EAAE,KAAK;YACvB,KAAK,EAAE,CAAC;SACT,CAAA;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,eAAe,GAAG,MAAM,mBAAmB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;IAEvE,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO;YACL,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,KAAK;YACf,gBAAgB,EAAE,KAAK;YACvB,KAAK,EAAE,CAAC;SACT,CAAA;IACH,CAAC;IAED,8BAA8B;IAC9B,MAAM,YAAY,GAAG,MAAM,wBAAwB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAA;IAE9E,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC;QAChB,OAAO;YACL,KAAK,EAAE,YAAY;YACnB,QAAQ,EAAE,YAAY,CAAC,MAAM,KAAK,CAAC;YACnC,gBAAgB,EAAE,IAAI;YACtB,KAAK,EAAE,YAAY,CAAC,MAAM;SAC3B,CAAA;IACH,CAAC;IAED,sCAAsC;IACtC,OAAO;QACL,KAAK,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;QACvD,QAAQ,EAAE,YAAY,CAAC,MAAM,KAAK,CAAC;QACnC,gBAAgB,EAAE,YAAY,CAAC,MAAM,GAAG,CAAC;QACzC,KAAK,EAAE,CAAC;KACT,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,QAAwB,EACxB,OAAe,EACf,OAAe;IAEf,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAA;IAC/E,OAAO,MAAM,CAAC,KAAK,CAAA;AACrB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,QAAwB,EACxB,GAAW,EACX,OAAe,EACf,MAAiB;IAEjB,qDAAqD;IACrD,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,uBAAuB;QACvB,MAAM,YAAY,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;QAEtD,iDAAiD;QACjD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,qCAAqC;gBACrC,+BAA+B;gBAC/B,IAAI,gBAAgB,GAAG,CAAC,CAAA;gBACxB,IAAI,OAAO,GAAG,GAAG,CAAA;gBACjB,OAAO,OAAO,KAAK,KAAK,EAAE,CAAC;oBACzB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;oBAChD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;wBAAE,MAAK;oBACjD,gBAAgB,EAAE,CAAA;oBAClB,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBAC7B,CAAC;gBAED,OAAO;oBACL,SAAS,EAAE,KAAK;oBAChB,GAAG;oBACH,KAAK,EAAE,IAAI;oBACX,gBAAgB;iBACjB,CAAA;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAA;IAE5D,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1D,OAAO;YACL,SAAS,EAAE,IAAI;YACf,GAAG;YACH,KAAK,EAAE,KAAK;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAA;IACH,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;IAEjC,+BAA+B;IAC/B,IAAI,gBAAgB,GAAG,CAAC,CAAA;IACxB,IAAI,OAAO,GAAG,GAAG,CAAA;IACjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,OAAO,OAAO,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QACtD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACpB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;QAChD,IAAI,CAAC,MAAM;YAAE,MAAK;QAElB,IAAI,OAAO,KAAK,SAAS;YAAE,MAAK;QAEhC,gBAAgB,EAAE,CAAA;QAElB,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,MAAK;QACtC,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;IAC7B,CAAC;IAED,OAAO;QACL,SAAS;QACT,GAAG;QACH,KAAK,EAAE,IAAI;QACX,gBAAgB;KACjB,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,QAAwB,EACxB,iBAAyB,EACzB,MAAc;IAEd,6CAA6C;IAC7C,IAAI,iBAAiB,KAAK,MAAM,EAAE,CAAC;QACjC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;IACtD,OAAO,SAAS,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAA;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,QAAwB,EACxB,iBAAyB,EACzB,MAAc;IAEd,cAAc;IACd,IAAI,iBAAiB,KAAK,MAAM,EAAE,CAAC;QACjC,OAAO;YACL,UAAU,EAAE,IAAI;YAChB,QAAQ,EAAE,CAAC;SACZ,CAAA;IACH,CAAC;IAED,gCAAgC;IAChC,MAAM,KAAK,GAA6C,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAA;IACtF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAExC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAQ;QAC9B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAEhB,IAAI,GAAG,KAAK,iBAAiB,EAAE,CAAC;YAC9B,OAAO;gBACL,UAAU,EAAE,IAAI;gBAChB,QAAQ;aACT,CAAA;QACH,CAAC;QAED,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAA;QAC/C,IAAI,CAAC,SAAS;YAAE,SAAQ;QAExB,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,CAAC,EAAE,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,UAAU,EAAE,KAAK;QACjB,QAAQ,EAAE,CAAC,CAAC;KACb,CAAA;AACH,CAAC;AAED,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,QAAwB,EACxB,OAAiB;IAEjB,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,GAAG,OAAO,CAAC,CAAA;IACrB,CAAC;IAED,sCAAsC;IACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAA;IACnD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;QACnD,iDAAiD;QACjD,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACrB,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,CAAA;IAClC,CAAC;IAED,kFAAkF;IAClF,MAAM,WAAW,GAAa,EAAE,CAAA;IAEhC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,mBAAmB,GAAG,KAAK,CAAA;QAE/B,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;YAC/B,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;gBACrB,MAAM,cAAc,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAA;gBAClD,IAAI,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC5B,mBAAmB,GAAG,IAAI,CAAA;oBAC1B,MAAK;gBACP,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACzB,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QACvB,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAA;AACpB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,QAAwB,EACxB,OAAiB;IAEjB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAA;IACX,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QACnD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IACnC,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5D,CAAC;IAED,kDAAkD;IAClD,mCAAmC;IACnC,IAAI,YAAY,GAAG,MAAM,iBAAiB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;IAE5E,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO,EAAE,CAAA;IACX,CAAC;IAED,qEAAqE;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QAC7B,MAAM,QAAQ,GAAa,EAAE,CAAA;QAE7B,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,MAAM,iBAAiB,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;YACjE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,CAAA;QACX,CAAC;QAED,YAAY,GAAG,QAAQ,CAAA;IACzB,CAAC;IAED,OAAO,YAAY,CAAA;AACrB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,QAAwB,EACxB,IAAY,EACZ,MAAc;IAEd,OAAO,aAAa,CAAC,QAAQ,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAA;AAChD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAwB,EACxB,OAAiB;IAEjB,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,6EAA6E;IAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,MAAM,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1E,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,QAAwB,EACxB,OAAe,EACf,OAAe;IAEf,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAEpE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,KAAK;YACf,gBAAgB,EAAE,KAAK;YACvB,KAAK,EAAE,CAAC;SACT,CAAA;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,KAAK,EAAE,QAAQ;YACf,QAAQ,EAAE,IAAI;YACd,gBAAgB,EAAE,IAAI;YACtB,KAAK,EAAE,CAAC;SACT,CAAA;IACH,CAAC;IAED,gDAAgD;IAChD,oEAAoE;IACpE,gFAAgF;IAChF,IAAI,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACxE,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC/B,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,CAAC,WAAW,CAAC;QACpB,QAAQ,EAAE,IAAI;QACd,gBAAgB,EAAE,IAAI;QACtB,KAAK,EAAE,CAAC;KACT,CAAA;AACH,CAAC"}