@bharanidev/bhgraph-darwin-x64 1.0.0

package/lib/dist/graph/traversal.js

@@ -0,0 +1,599 @@
+"use strict";
+/**
+ * Graph Traversal Algorithms
+ *
+ * BFS and DFS traversal for the code knowledge graph.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphTraverser = void 0;
+/**
+ * Default traversal options
+ */
+const DEFAULT_OPTIONS = {
+    maxDepth: Infinity,
+    edgeKinds: [],
+    nodeKinds: [],
+    direction: 'outgoing',
+    limit: 1000,
+    includeStart: true,
+};
+/**
+ * Graph traverser for BFS and DFS traversal
+ */
+class GraphTraverser {
+    queries;
+    constructor(queries) {
+        this.queries = queries;
+    }
+    /**
+     * Traverse the graph using breadth-first search
+     *
+     * @param startId - Starting node ID
+     * @param options - Traversal options
+     * @returns Subgraph containing traversed nodes and edges
+     */
+    traverseBFS(startId, options = {}) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const startNode = this.queries.getNodeById(startId);
+        if (!startNode) {
+            return { nodes: new Map(), edges: [], roots: [] };
+        }
+        const nodes = new Map();
+        const edges = [];
+        const visited = new Set();
+        // Enqueue-once guard, tracked separately from `visited` (which is only set
+        // on dequeue). Guarding the enqueue on `visited` alone let a target
+        // reachable via two edges get queued twice; the second dequeue then hit
+        // `visited.has → continue` and its edge was never recorded, so parallel
+        // edges (A calls AND references B, or two `calls` on different lines — edges
+        // are unique on source+target+kind+line+col) went missing from the result
+        // (#1090). `enqueued` makes each node queued exactly once.
+        const enqueued = new Set([startNode.id]);
+        // Edge-identity dedup so a `direction:'both'` scan — which encounters A→B
+        // from both endpoints — records each edge once.
+        const seenEdges = new Set();
+        const edgeKey = (e) => `${e.source}|${e.target}|${e.kind}|${e.line ?? -1}|${e.column ?? -1}`;
+        const queue = [{ node: startNode, edge: null, depth: 0 }];
+        if (opts.includeStart) {
+            nodes.set(startNode.id, startNode);
+        }
+        while (queue.length > 0 && nodes.size < opts.limit) {
+            const step = queue.shift();
+            const { node, depth } = step;
+            if (visited.has(node.id)) {
+                continue;
+            }
+            visited.add(node.id);
+            // Check depth limit
+            if (depth >= opts.maxDepth) {
+                continue;
+            }
+            // Get adjacent edges, prioritizing structural edges (contains, calls)
+            // over reference edges so BFS discovers internal structure before
+            // fanning out to external references (e.g., component usages in templates).
+            const adjacentEdges = this.getAdjacentEdges(node.id, opts.direction, opts.edgeKinds);
+            adjacentEdges.sort((a, b) => {
+                const priority = (e) => e.kind === 'contains' ? 0 : e.kind === 'calls' ? 1 : 2;
+                return priority(a) - priority(b);
+            });
+            // Batch-fetch neighbors we might newly enqueue in one query (was N+1 per
+            // BFS step). Already-queued/visited neighbors are already in `nodes`, so
+            // they don't need re-fetching to record an edge back to them.
+            const wantIds = adjacentEdges
+                .map((e) => (e.source === node.id ? e.target : e.source))
+                .filter((id) => !visited.has(id) && !enqueued.has(id));
+            const neighborNodes = wantIds.length > 0 ? this.queries.getNodesByIds(wantIds) : new Map();
+            for (const adjEdge of adjacentEdges) {
+                const nextNodeId = adjEdge.source === node.id ? adjEdge.target : adjEdge.source;
+                const nextNode = neighborNodes.get(nextNodeId) ?? nodes.get(nextNodeId);
+                if (!nextNode)
+                    continue;
+                if (opts.nodeKinds && opts.nodeKinds.length > 0 && !opts.nodeKinds.includes(nextNode.kind)) {
+                    continue;
+                }
+                // Enqueue each neighbor exactly once, and only while under the node
+                // budget — the cap is checked per-add here, not just on the outer
+                // `while`, so one high-degree node can't overshoot `opts.limit` (#1087).
+                if (!visited.has(nextNodeId) && !enqueued.has(nextNodeId)) {
+                    if (nodes.size >= opts.limit)
+                        continue;
+                    enqueued.add(nextNodeId);
+                    nodes.set(nextNode.id, nextNode);
+                    queue.push({ node: nextNode, edge: adjEdge, depth: depth + 1 });
+                }
+                // Record every distinct edge among kept nodes. Collecting on the
+                // adjacency scan (rather than once per dequeue) is what preserves
+                // parallel edges to the same target (#1090); `nextNode` is guaranteed
+                // to be in `nodes` at this point (just added, or already in-set).
+                const ek = edgeKey(adjEdge);
+                if (!seenEdges.has(ek)) {
+                    seenEdges.add(ek);
+                    edges.push(adjEdge);
+                }
+            }
+        }
+        return {
+            nodes,
+            edges,
+            roots: [startId],
+        };
+    }
+    /**
+     * Traverse the graph using depth-first search
+     *
+     * @param startId - Starting node ID
+     * @param options - Traversal options
+     * @returns Subgraph containing traversed nodes and edges
+     */
+    traverseDFS(startId, options = {}) {
+        const opts = { ...DEFAULT_OPTIONS, ...options };
+        const startNode = this.queries.getNodeById(startId);
+        if (!startNode) {
+            return { nodes: new Map(), edges: [], roots: [] };
+        }
+        const nodes = new Map();
+        const edges = [];
+        const visited = new Set();
+        if (opts.includeStart) {
+            nodes.set(startNode.id, startNode);
+        }
+        this.dfsRecursive(startNode, 0, opts, nodes, edges, visited);
+        return {
+            nodes,
+            edges,
+            roots: [startId],
+        };
+    }
+    /**
+     * Recursive DFS helper
+     */
+    dfsRecursive(node, depth, opts, nodes, edges, visited) {
+        if (visited.has(node.id) || nodes.size >= opts.limit || depth >= opts.maxDepth) {
+            return;
+        }
+        visited.add(node.id);
+        // Get adjacent edges
+        const adjacentEdges = this.getAdjacentEdges(node.id, opts.direction, opts.edgeKinds);
+        // Batch-fetch unvisited neighbors (was N+1 per DFS step).
+        const wantIds = adjacentEdges
+            .map((e) => (e.source === node.id ? e.target : e.source))
+            .filter((id) => !visited.has(id));
+        const neighborNodes = wantIds.length > 0 ? this.queries.getNodesByIds(wantIds) : new Map();
+        for (const edge of adjacentEdges) {
+            // Cap per-add, not just at the top of each frame: the top-of-function
+            // guard only stops the next recursion, so without this every sibling of
+            // the first over-budget child still got inserted, overshooting
+            // `opts.limit` by a node's full fan-out (#1088).
+            if (nodes.size >= opts.limit)
+                break;
+            const nextNodeId = edge.source === node.id ? edge.target : edge.source;
+            if (visited.has(nextNodeId))
+                continue;
+            const nextNode = neighborNodes.get(nextNodeId);
+            if (!nextNode)
+                continue;
+            // Apply node kind filter
+            if (opts.nodeKinds && opts.nodeKinds.length > 0 && !opts.nodeKinds.includes(nextNode.kind)) {
+                continue;
+            }
+            // Add node and edge to result
+            nodes.set(nextNode.id, nextNode);
+            edges.push(edge);
+            // Recurse
+            this.dfsRecursive(nextNode, depth + 1, opts, nodes, edges, visited);
+        }
+    }
+    /**
+     * Get adjacent edges based on direction
+     */
+    getAdjacentEdges(nodeId, direction, edgeKinds) {
+        const kinds = edgeKinds && edgeKinds.length > 0 ? edgeKinds : undefined;
+        if (direction === 'outgoing') {
+            return this.queries.getOutgoingEdges(nodeId, kinds);
+        }
+        else if (direction === 'incoming') {
+            return this.queries.getIncomingEdges(nodeId, kinds);
+        }
+        else {
+            // Both directions
+            const outgoing = this.queries.getOutgoingEdges(nodeId, kinds);
+            const incoming = this.queries.getIncomingEdges(nodeId, kinds);
+            return [...outgoing, ...incoming];
+        }
+    }
+    /**
+     * Find all callers of a function/method
+     *
+     * @param nodeId - ID of the function/method node
+     * @param maxDepth - Maximum depth to traverse (default: 1)
+     * @returns Array of nodes that call this function
+     */
+    getCallers(nodeId, maxDepth = 1) {
+        const result = [];
+        const visited = new Set();
+        this.getCallersRecursive(nodeId, maxDepth, 0, result, visited);
+        return result;
+    }
+    getCallersRecursive(nodeId, maxDepth, currentDepth, result, visited) {
+        // Mark visited BEFORE the depth check, not after. Folding both into one
+        // guard meant that when `currentDepth >= maxDepth` fired we returned without
+        // marking the node — so a caller reachable from the same parent via two
+        // edges (two call sites, or calls + references) was pushed once per edge,
+        // duplicating it in `result` at the default `maxDepth=1` (#1086).
+        if (visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        if (currentDepth >= maxDepth) {
+            return;
+        }
+        // `instantiates` counts as a caller: constructing a class (`Foo(...)` /
+        // `new Foo()`) is calling its constructor, so the instantiation site is a
+        // caller of the class. Without it, `callers <Class>` surfaced only the
+        // importing file (via `imports`) and missed every construction site —
+        // the opposite of "what breaks if I change this class?" (#774).
+        const incomingEdges = this.queries.getIncomingEdges(nodeId, ['calls', 'references', 'imports', 'instantiates']);
+        if (incomingEdges.length === 0)
+            return;
+        // Batch-fetch all caller nodes in one round-trip instead of one
+        // getNodeById per edge (was N+1 — meaningful on functions with many callers).
+        const sourceIds = incomingEdges.map((e) => e.source);
+        const callerNodes = this.queries.getNodesByIds(sourceIds);
+        for (const edge of incomingEdges) {
+            const callerNode = callerNodes.get(edge.source);
+            if (callerNode && !visited.has(callerNode.id)) {
+                result.push({ node: callerNode, edge });
+                this.getCallersRecursive(callerNode.id, maxDepth, currentDepth + 1, result, visited);
+            }
+        }
+    }
+    /**
+     * Find all functions/methods called by a function
+     *
+     * @param nodeId - ID of the function/method node
+     * @param maxDepth - Maximum depth to traverse (default: 1)
+     * @returns Array of nodes called by this function
+     */
+    getCallees(nodeId, maxDepth = 1) {
+        const result = [];
+        const visited = new Set();
+        this.getCalleesRecursive(nodeId, maxDepth, 0, result, visited);
+        return result;
+    }
+    getCalleesRecursive(nodeId, maxDepth, currentDepth, result, visited) {
+        // Mark visited before the depth check — see getCallersRecursive: the merged
+        // guard dropped the `visited.add` at the depth boundary, duplicating a
+        // callee reached from the same node via two edges at `maxDepth=1` (#1086).
+        if (visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        if (currentDepth >= maxDepth) {
+            return;
+        }
+        // Symmetric with getCallers: a function that constructs a class
+        // (`Foo(...)` / `new Foo()`) has that class as a callee, so callers and
+        // callees stay inverses of each other and `trace` can cross the
+        // instantiation boundary (function → class → its methods) (#774).
+        const outgoingEdges = this.queries.getOutgoingEdges(nodeId, ['calls', 'references', 'imports', 'instantiates']);
+        if (outgoingEdges.length === 0)
+            return;
+        // Batch-fetch callee nodes (was N+1 — see getCallersRecursive note).
+        const targetIds = outgoingEdges.map((e) => e.target);
+        const calleeNodes = this.queries.getNodesByIds(targetIds);
+        for (const edge of outgoingEdges) {
+            const calleeNode = calleeNodes.get(edge.target);
+            if (calleeNode && !visited.has(calleeNode.id)) {
+                result.push({ node: calleeNode, edge });
+                this.getCalleesRecursive(calleeNode.id, maxDepth, currentDepth + 1, result, visited);
+            }
+        }
+    }
+    /**
+     * Get the call graph for a function (both callers and callees)
+     *
+     * @param nodeId - ID of the function/method node
+     * @param depth - Maximum depth in each direction (default: 2)
+     * @returns Subgraph containing the call graph
+     */
+    getCallGraph(nodeId, depth = 2) {
+        const focalNode = this.queries.getNodeById(nodeId);
+        if (!focalNode) {
+            return { nodes: new Map(), edges: [], roots: [] };
+        }
+        const nodes = new Map();
+        const edges = [];
+        // Add focal node
+        nodes.set(focalNode.id, focalNode);
+        // Get callers
+        const callers = this.getCallers(nodeId, depth);
+        for (const { node, edge } of callers) {
+            nodes.set(node.id, node);
+            edges.push(edge);
+        }
+        // Get callees
+        const callees = this.getCallees(nodeId, depth);
+        for (const { node, edge } of callees) {
+            nodes.set(node.id, node);
+            edges.push(edge);
+        }
+        return {
+            nodes,
+            edges,
+            roots: [nodeId],
+        };
+    }
+    /**
+     * Get the type hierarchy for a class/interface
+     *
+     * @param nodeId - ID of the class/interface node
+     * @returns Subgraph containing the type hierarchy
+     */
+    getTypeHierarchy(nodeId) {
+        const focalNode = this.queries.getNodeById(nodeId);
+        if (!focalNode) {
+            return { nodes: new Map(), edges: [], roots: [] };
+        }
+        const nodes = new Map();
+        const edges = [];
+        const visited = new Set();
+        // Add focal node
+        nodes.set(focalNode.id, focalNode);
+        // Get ancestors (what this extends/implements)
+        this.getTypeAncestors(nodeId, nodes, edges, visited);
+        // Get descendants (what extends/implements this)
+        this.getTypeDescendants(nodeId, nodes, edges, visited);
+        return {
+            nodes,
+            edges,
+            roots: [nodeId],
+        };
+    }
+    getTypeAncestors(nodeId, nodes, edges, visited) {
+        if (visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        const outgoingEdges = this.queries.getOutgoingEdges(nodeId, ['extends', 'implements']);
+        if (outgoingEdges.length === 0)
+            return;
+        const parents = this.queries.getNodesByIds(outgoingEdges.map((e) => e.target));
+        for (const edge of outgoingEdges) {
+            const parentNode = parents.get(edge.target);
+            if (parentNode && !nodes.has(parentNode.id)) {
+                nodes.set(parentNode.id, parentNode);
+                edges.push(edge);
+                this.getTypeAncestors(parentNode.id, nodes, edges, visited);
+            }
+        }
+    }
+    getTypeDescendants(nodeId, nodes, edges, visited) {
+        if (visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        const incomingEdges = this.queries.getIncomingEdges(nodeId, ['extends', 'implements']);
+        if (incomingEdges.length === 0)
+            return;
+        const children = this.queries.getNodesByIds(incomingEdges.map((e) => e.source));
+        for (const edge of incomingEdges) {
+            const childNode = children.get(edge.source);
+            if (childNode && !nodes.has(childNode.id)) {
+                nodes.set(childNode.id, childNode);
+                edges.push(edge);
+                this.getTypeDescendants(childNode.id, nodes, edges, visited);
+            }
+        }
+    }
+    /**
+     * Find all usages of a symbol
+     *
+     * @param nodeId - ID of the symbol node
+     * @returns Array of nodes and edges that reference this symbol
+     */
+    findUsages(nodeId) {
+        const result = [];
+        // Get all incoming edges (references, calls, type_of, etc.)
+        const incomingEdges = this.queries.getIncomingEdges(nodeId);
+        if (incomingEdges.length === 0)
+            return result;
+        // Batch-fetch source nodes (was N+1).
+        const sources = this.queries.getNodesByIds(incomingEdges.map((e) => e.source));
+        for (const edge of incomingEdges) {
+            const sourceNode = sources.get(edge.source);
+            if (sourceNode)
+                result.push({ node: sourceNode, edge });
+        }
+        return result;
+    }
+    /**
+     * Calculate the impact radius of a node
+     *
+     * Returns all nodes that could be affected by changes to this node.
+     *
+     * @param nodeId - ID of the node
+     * @param maxDepth - Maximum depth to traverse (default: 3)
+     * @returns Subgraph containing potentially impacted nodes
+     */
+    getImpactRadius(nodeId, maxDepth = 3) {
+        const focalNode = this.queries.getNodeById(nodeId);
+        if (!focalNode) {
+            return { nodes: new Map(), edges: [], roots: [] };
+        }
+        const nodes = new Map();
+        const edges = [];
+        const visited = new Set();
+        // Add focal node
+        nodes.set(focalNode.id, focalNode);
+        // Traverse incoming edges to find all dependents
+        this.getImpactRecursive(nodeId, maxDepth, 0, nodes, edges, visited);
+        return {
+            nodes,
+            edges,
+            roots: [nodeId],
+        };
+    }
+    getImpactRecursive(nodeId, maxDepth, currentDepth, nodes, edges, visited) {
+        // Mark visited before the depth check so a node collected at the depth
+        // boundary still lands in `visited`. Otherwise it could sit in `nodes` but
+        // not `visited`, and the two loops below — which used different sets to
+        // gate re-processing — would disagree about it (#1089).
+        if (visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        if (currentDepth >= maxDepth) {
+            return;
+        }
+        // For container nodes (classes, interfaces, structs, etc.), also traverse
+        // into their children so that callers of contained methods appear in impact
+        const focalNode = this.queries.getNodeById(nodeId);
+        if (focalNode) {
+            const containerKinds = new Set(['class', 'interface', 'struct', 'trait', 'protocol', 'module', 'enum']);
+            if (containerKinds.has(focalNode.kind)) {
+                const containsEdges = this.queries.getOutgoingEdges(nodeId, ['contains']);
+                if (containsEdges.length > 0) {
+                    const children = this.queries.getNodesByIds(containsEdges.map((e) => e.target));
+                    for (const edge of containsEdges) {
+                        const childNode = children.get(edge.target);
+                        if (childNode && !visited.has(childNode.id)) {
+                            nodes.set(childNode.id, childNode);
+                            edges.push(edge);
+                            // Recurse into children at the same depth (they're part of the same symbol)
+                            this.getImpactRecursive(childNode.id, maxDepth, currentDepth, nodes, edges, visited);
+                        }
+                    }
+                }
+            }
+        }
+        // Get all incoming edges (things that depend on this node). Exclude
+        // `contains`: a container "contains" its members but does not *depend* on
+        // them, so following it upward would climb to the parent class and then
+        // re-expand every sibling member — exploding impact for a leaf symbol. (#536)
+        const incomingEdges = this.queries.getIncomingEdges(nodeId).filter((e) => e.kind !== 'contains');
+        if (incomingEdges.length === 0)
+            return;
+        const sources = this.queries.getNodesByIds(incomingEdges.map((e) => e.source));
+        for (const edge of incomingEdges) {
+            const sourceNode = sources.get(edge.source);
+            if (!sourceNode)
+                continue;
+            // Record the dependency edge unconditionally. The gate used to also gate
+            // edge collection (`!nodes.has(...)`), so a second incoming edge into a
+            // node already collected via another path was silently dropped from
+            // `edges` even though it's a real dependency (#1089). Each node's incoming
+            // edges are fetched once (nodes are expanded once), so no edge repeats.
+            edges.push(edge);
+            if (!visited.has(sourceNode.id)) {
+                nodes.set(sourceNode.id, sourceNode);
+                this.getImpactRecursive(sourceNode.id, maxDepth, currentDepth + 1, nodes, edges, visited);
+            }
+        }
+    }
+    /**
+     * Find the shortest path between two nodes
+     *
+     * @param fromId - Starting node ID
+     * @param toId - Target node ID
+     * @param edgeKinds - Edge types to consider (all if empty)
+     * @returns Array of nodes and edges forming the path, or null if no path exists
+     */
+    findPath(fromId, toId, edgeKinds = []) {
+        const fromNode = this.queries.getNodeById(fromId);
+        const toNode = this.queries.getNodeById(toId);
+        if (!fromNode || !toNode) {
+            return null;
+        }
+        // BFS to find shortest path
+        const visited = new Set();
+        const queue = [
+            { nodeId: fromId, path: [{ node: fromNode, edge: null }] },
+        ];
+        while (queue.length > 0) {
+            const { nodeId, path } = queue.shift();
+            if (nodeId === toId) {
+                return path;
+            }
+            if (visited.has(nodeId)) {
+                continue;
+            }
+            visited.add(nodeId);
+            // Get outgoing edges
+            const outgoingEdges = this.queries.getOutgoingEdges(nodeId, edgeKinds.length > 0 ? edgeKinds : undefined);
+            if (outgoingEdges.length === 0)
+                continue;
+            // Batch-fetch only the unvisited targets (was N+1 per BFS frontier).
+            const wantIds = outgoingEdges
+                .map((e) => e.target)
+                .filter((id) => !visited.has(id));
+            const nextNodes = wantIds.length > 0 ? this.queries.getNodesByIds(wantIds) : new Map();
+            for (const edge of outgoingEdges) {
+                if (!visited.has(edge.target)) {
+                    const nextNode = nextNodes.get(edge.target);
+                    if (nextNode) {
+                        queue.push({
+                            nodeId: edge.target,
+                            path: [...path, { node: nextNode, edge }],
+                        });
+                    }
+                }
+            }
+        }
+        return null; // No path found
+    }
+    /**
+     * Get the containment hierarchy for a node (ancestors)
+     *
+     * @param nodeId - ID of the node
+     * @returns Array of ancestor nodes from immediate parent to root
+     */
+    getAncestors(nodeId) {
+        const ancestors = [];
+        const visited = new Set();
+        let currentId = nodeId;
+        while (true) {
+            if (visited.has(currentId)) {
+                break;
+            }
+            visited.add(currentId);
+            // Look for 'contains' edges pointing to this node
+            const containingEdges = this.queries.getIncomingEdges(currentId, ['contains']);
+            const firstEdge = containingEdges[0];
+            if (!firstEdge) {
+                break;
+            }
+            // Typically there should be at most one containing parent
+            const parentNode = this.queries.getNodeById(firstEdge.source);
+            if (parentNode) {
+                ancestors.push(parentNode);
+                currentId = parentNode.id;
+            }
+            else {
+                break;
+            }
+        }
+        return ancestors;
+    }
+    /**
+     * Get immediate children of a node
+     *
+     * @param nodeId - ID of the node
+     * @returns Array of child nodes
+     */
+    getChildren(nodeId) {
+        const containsEdges = this.queries.getOutgoingEdges(nodeId, ['contains']);
+        if (containsEdges.length === 0)
+            return [];
+        // Batch-fetch (was N+1).
+        const childNodes = this.queries.getNodesByIds(containsEdges.map((e) => e.target));
+        const children = [];
+        for (const edge of containsEdges) {
+            const childNode = childNodes.get(edge.target);
+            if (childNode)
+                children.push(childNode);
+        }
+        return children;
+    }
+}
+exports.GraphTraverser = GraphTraverser;
+//# sourceMappingURL=traversal.js.map

package/lib/dist/graph/traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.js","sourceRoot":"","sources":["../../src/graph/traversal.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAKH;;GAEG;AACH,MAAM,eAAe,GAA+B;IAClD,QAAQ,EAAE,QAAQ;IAClB,SAAS,EAAE,EAAE;IACb,SAAS,EAAE,EAAE;IACb,SAAS,EAAE,UAAU;IACrB,KAAK,EAAE,IAAI;IACX,YAAY,EAAE,IAAI;CACnB,CAAC;AAWF;;GAEG;AACH,MAAa,cAAc;IACjB,OAAO,CAAe;IAE9B,YAAY,OAAqB;QAC/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,OAAe,EAAE,UAA4B,EAAE;QACzD,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QACtC,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,2EAA2E;QAC3E,oEAAoE;QACpE,wEAAwE;QACxE,wEAAwE;QACxE,6EAA6E;QAC7E,0EAA0E;QAC1E,2DAA2D;QAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,0EAA0E;QAC1E,gDAAgD;QAChD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,MAAM,OAAO,GAAG,CAAC,CAAO,EAAE,EAAE,CAC1B,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC;QACxE,MAAM,KAAK,GAAoB,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAE3E,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;YAE7B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACzB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAErB,oBAAoB;YACpB,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,sEAAsE;YACtE,kEAAkE;YAClE,4EAA4E;YAC5E,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACrF,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,QAAQ,GAAG,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrF,OAAO,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC;YAEH,yEAAyE;YACzE,yEAAyE;YACzE,8DAA8D;YAC9D,MAAM,OAAO,GAAG,aAAa;iBAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;iBACxD,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;YAE3F,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;gBACpC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;gBAChF,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBACxE,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC3F,SAAS;gBACX,CAAC;gBAED,oEAAoE;gBACpE,kEAAkE;gBAClE,yEAAyE;gBACzE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC1D,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;wBAAE,SAAS;oBACvC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACzB,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;oBACjC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClE,CAAC;gBAED,iEAAiE;gBACjE,kEAAkE;gBAClE,sEAAsE;gBACtE,kEAAkE;gBAClE,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC5B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvB,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAClB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK;YACL,KAAK;YACL,KAAK,EAAE,CAAC,OAAO,CAAC;SACjB,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,OAAe,EAAE,UAA4B,EAAE;QACzD,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAEpD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QACtC,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAE7D,OAAO;YACL,KAAK;YACL,KAAK;YACL,KAAK,EAAE,CAAC,OAAO,CAAC;SACjB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,IAAU,EACV,KAAa,EACb,IAAgC,EAChC,KAAwB,EACxB,KAAa,EACb,OAAoB;QAEpB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC/E,OAAO;QACT,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErB,qBAAqB;QACrB,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAErF,0DAA0D;QAC1D,MAAM,OAAO,GAAG,aAAa;aAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;aACxD,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QAE3F,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,sEAAsE;YACtE,wEAAwE;YACxE,+DAA+D;YAC/D,iDAAiD;YACjD,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK;gBAAE,MAAM;YAEpC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACvE,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;gBAAE,SAAS;YAEtC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC/C,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,yBAAyB;YACzB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3F,SAAS;YACX,CAAC;YAED,8BAA8B;YAC9B,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEjB,UAAU;YACV,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,MAAc,EACd,SAA2C,EAC3C,SAAsB;QAEtB,MAAM,KAAK,GAAG,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QAExE,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACtD,CAAC;aAAM,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,kBAAkB;YAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9D,OAAO,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,MAAc,EAAE,WAAmB,CAAC;QAC7C,MAAM,MAAM,GAAsC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAE/D,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,mBAAmB,CACzB,MAAc,EACd,QAAgB,EAChB,YAAoB,EACpB,MAAyC,EACzC,OAAoB;QAEpB,wEAAwE;QACxE,6EAA6E;QAC7E,wEAAwE;QACxE,0EAA0E;QAC1E,kEAAkE;QAClE,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,YAAY,IAAI,QAAQ,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,wEAAwE;QACxE,0EAA0E;QAC1E,uEAAuE;QACvE,sEAAsE;QACtE,gEAAgE;QAChE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC;QAChH,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEvC,gEAAgE;QAChE,8EAA8E;QAC9E,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QAE1D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9C,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,YAAY,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,MAAc,EAAE,WAAmB,CAAC;QAC7C,MAAM,MAAM,GAAsC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAE/D,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,mBAAmB,CACzB,MAAc,EACd,QAAgB,EAChB,YAAoB,EACpB,MAAyC,EACzC,OAAoB;QAEpB,4EAA4E;QAC5E,uEAAuE;QACvE,2EAA2E;QAC3E,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,YAAY,IAAI,QAAQ,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,gEAAgE;QAChE,wEAAwE;QACxE,gEAAgE;QAChE,kEAAkE;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC;QAChH,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEvC,qEAAqE;QACrE,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QAE1D,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,IAAI,UAAU,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9C,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,mBAAmB,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,YAAY,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,MAAc,EAAE,QAAgB,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QACtC,MAAM,KAAK,GAAW,EAAE,CAAC;QAEzB,iBAAiB;QACjB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAEnC,cAAc;QACd,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC/C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,cAAc;QACd,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC/C,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;YACrC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,OAAO;YACL,KAAK;YACL,KAAK;YACL,KAAK,EAAE,CAAC,MAAM,CAAC;SAChB,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,MAAc;QAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QACtC,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,iBAAiB;QACjB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAEnC,+CAA+C;QAC/C,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAErD,iDAAiD;QACjD,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAEvD,OAAO;YACL,KAAK;YACL,KAAK;YACL,KAAK,EAAE,CAAC,MAAM,CAAC;SAChB,CAAC;IACJ,CAAC;IAEO,gBAAgB,CACtB,MAAc,EACd,KAAwB,EACxB,KAAa,EACb,OAAoB;QAEpB,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;QACvF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAE/E,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,UAAU,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5C,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBACrC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAEO,kBAAkB,CACxB,MAAc,EACd,KAAwB,EACxB,KAAa,EACb,OAAoB;QAEpB,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;QACvF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAEhF,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1C,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBACnC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,MAAc;QACvB,MAAM,MAAM,GAAsC,EAAE,CAAC;QAErD,4DAA4D;QAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAE9C,sCAAsC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/E,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,UAAU;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,MAAc,EAAE,WAAmB,CAAC;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QACtC,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,iBAAiB;QACjB,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAEnC,iDAAiD;QACjD,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAEpE,OAAO;YACL,KAAK;YACL,KAAK;YACL,KAAK,EAAE,CAAC,MAAM,CAAC;SAChB,CAAC;IACJ,CAAC;IAEO,kBAAkB,CACxB,MAAc,EACd,QAAgB,EAChB,YAAoB,EACpB,KAAwB,EACxB,KAAa,EACb,OAAoB;QAEpB,uEAAuE;QACvE,2EAA2E;QAC3E,wEAAwE;QACxE,wDAAwD;QACxD,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,IAAI,YAAY,IAAI,QAAQ,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;YACxG,IAAI,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC1E,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;oBAChF,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;wBACjC,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBAC5C,IAAI,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;4BAC5C,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;4BACnC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACjB,4EAA4E;4BAC5E,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,EAAE,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;wBACvF,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,0EAA0E;QAC1E,wEAAwE;QACxE,8EAA8E;QAC9E,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;QACjG,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAE/E,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,CAAC,UAAU;gBAAE,SAAS;YAC1B,yEAAyE;YACzE,wEAAwE;YACxE,oEAAoE;YACpE,2EAA2E;YAC3E,wEAAwE;YACxE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBACrC,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,YAAY,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC5F,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CACN,MAAc,EACd,IAAY,EACZ,YAAwB,EAAE;QAE1B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAE9C,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,4BAA4B;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA8E;YACvF,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;SAC3D,CAAC;QAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAExC,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,OAAO,IAAI,CAAC;YACd,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,qBAAqB;YACrB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CACjD,MAAM,EACN,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAC7C,CAAC;YACF,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEzC,qEAAqE;YACrE,MAAM,OAAO,GAAG,aAAa;iBAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;iBACpB,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;YAEvF,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC5C,IAAI,QAAQ,EAAE,CAAC;wBACb,KAAK,CAAC,IAAI,CAAC;4BACT,MAAM,EAAE,IAAI,CAAC,MAAM;4BACnB,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;yBAC1C,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAC/B,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,MAAc;QACzB,MAAM,SAAS,GAAW,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,SAAS,GAAG,MAAM,CAAC;QAEvB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC3B,MAAM;YACR,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEvB,kDAAkD;YAClD,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,SAAS,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;YAE/E,MAAM,SAAS,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YACrC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,MAAM;YACR,CAAC;YAED,0DAA0D;YAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC9D,IAAI,UAAU,EAAE,CAAC;gBACf,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC3B,SAAS,GAAG,UAAU,CAAC,EAAE,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,MAAc;QACxB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;QAC1E,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE1C,yBAAyB;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAClF,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC9C,IAAI,SAAS;gBAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AA3rBD,wCA2rBC"}