dbgraph 0.1.0

package/dist/graph/traversal.js

@@ -0,0 +1,531 @@
+"use strict";
+/**
+ * Graph Traversal Algorithms
+ *
+ * BFS and DFS traversal for the database schema knowledge graph.
+ * Operates on nodes/edges stored in SQLite via QueryBuilder.
+ *
+ * All traversal methods use batch node lookups (getNodesByIds) to avoid
+ * N+1 query patterns and maintain performance on large schemas.
+ */
+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 of the database schema graph.
+ *
+ * Provides methods to navigate the graph structure — containment hierarchies,
+ * foreign-key references, and impact analysis — all with batched queries.
+ */
+class GraphTraverser {
+    queries;
+    constructor(queries) {
+        this.queries = queries;
+    }
+    // ===========================================================================
+    // Core Traversal
+    // ===========================================================================
+    /**
+     * Traverse the graph using breadth-first search.
+     *
+     * Structural edges (`contains`) are visited before reference edges so that
+     * BFS discovers internal structure first before fanning out.
+     *
+     * @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();
+        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, edge, depth } = step;
+            if (visited.has(node.id)) {
+                continue;
+            }
+            visited.add(node.id);
+            // Add edge to result
+            if (edge) {
+                edges.push(edge);
+            }
+            // Check depth limit
+            if (depth >= opts.maxDepth) {
+                continue;
+            }
+            // Get adjacent edges, prioritizing containment edges
+            const adjacentEdges = this.getAdjacentEdges(node.id, opts.direction, opts.edgeKinds);
+            adjacentEdges.sort((a, b) => {
+                const priority = (e) => e.kind === 'contains' ? 0 : 1;
+                return priority(a) - priority(b);
+            });
+            // Batch-fetch the unvisited neighbors in one query
+            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 adjEdge of adjacentEdges) {
+                const nextNodeId = adjEdge.source === node.id ? adjEdge.target : adjEdge.source;
+                if (visited.has(nextNodeId))
+                    continue;
+                const nextNode = neighborNodes.get(nextNodeId);
+                if (!nextNode)
+                    continue;
+                if (opts.nodeKinds && opts.nodeKinds.length > 0 && !opts.nodeKinds.includes(nextNode.kind)) {
+                    continue;
+                }
+                nodes.set(nextNode.id, nextNode);
+                queue.push({ node: nextNode, edge: adjEdge, depth: depth + 1 });
+            }
+        }
+        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 with batch neighbor fetching.
+     */
+    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
+        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 adjEdge of adjacentEdges) {
+            const nextNodeId = adjEdge.source === node.id ? adjEdge.target : adjEdge.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;
+            }
+            nodes.set(nextNode.id, nextNode);
+            edges.push(adjEdge);
+            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 {
+            const outgoing = this.queries.getOutgoingEdges(nodeId, kinds);
+            const incoming = this.queries.getIncomingEdges(nodeId, kinds);
+            return [...outgoing, ...incoming];
+        }
+    }
+    // ===========================================================================
+    // Reference Analysis
+    // ===========================================================================
+    /**
+     * Find all nodes that reference a given node (e.g., tables with foreign keys
+     * pointing to this table, or views referencing this table).
+     *
+     * Follows `references` edges incoming to the target.
+     *
+     * @param nodeId - ID of the node being referenced
+     * @param maxDepth - Maximum depth to traverse (default: 1)
+     * @returns Array of { caller node, edge } pairs
+     */
+    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) {
+        if (currentDepth >= maxDepth || visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        const incomingEdges = this.queries.getIncomingEdges(nodeId, ['references', 'foreign_key', 'depends_on', 'imports']);
+        if (incomingEdges.length === 0)
+            return;
+        // Batch-fetch all source nodes in one round-trip
+        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 nodes referenced by a given node (e.g., tables this foreign key
+     * points to, tables this view depends on).
+     *
+     * Follows `references` edges outgoing from the source.
+     *
+     * @param nodeId - ID of the source node
+     * @param maxDepth - Maximum depth to traverse (default: 1)
+     * @returns Array of { callee node, edge } pairs
+     */
+    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) {
+        if (currentDepth >= maxDepth || visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        const outgoingEdges = this.queries.getOutgoingEdges(nodeId, ['references', 'foreign_key', 'depends_on', 'imports']);
+        if (outgoingEdges.length === 0)
+            return;
+        // Batch-fetch all target nodes
+        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);
+            }
+        }
+    }
+    // ===========================================================================
+    // Usage & Impact
+    // ===========================================================================
+    /**
+     * Find all usages of a node — all incoming edges regardless of kind.
+     *
+     * This returns every node that has any edge pointing to the given node,
+     * including foreign key references, dependencies, and structural containment.
+     *
+     * @param nodeId - ID of the node being examined
+     * @returns Array of { using node, edge } pairs
+     */
+    findUsages(nodeId) {
+        const result = [];
+        const incomingEdges = this.queries.getIncomingEdges(nodeId);
+        if (incomingEdges.length === 0)
+            return result;
+        // Batch-fetch all source nodes
+        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;
+    }
+    /**
+     * Compute the impact radius of a node — all nodes that could be affected
+     * if this schema object changes.
+     *
+     * Traverses incoming edges (dependents), including following `contains`
+     * edges into container children (e.g., a column change impacts the table's
+     * foreign-key dependents).
+     *
+     * @param nodeId - ID of the node being changed
+     * @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();
+        nodes.set(focalNode.id, focalNode);
+        this.getImpactRecursive(nodeId, maxDepth, 0, nodes, edges, visited);
+        return {
+            nodes,
+            edges,
+            roots: [nodeId],
+        };
+    }
+    /**
+     * Recursive impact traversal — follows incoming edges and also descends
+     * into container children (e.g., table → columns → FK references).
+     */
+    getImpactRecursive(nodeId, maxDepth, currentDepth, nodes, edges, visited) {
+        if (currentDepth >= maxDepth || visited.has(nodeId)) {
+            return;
+        }
+        visited.add(nodeId);
+        // For container nodes (tables, views, schemas), also traverse into their
+        // children so that dependents of contained members are discovered
+        const focalNode = this.queries.getNodeById(nodeId);
+        if (focalNode) {
+            const containerKinds = new Set(['table', 'view', 'schema', 'database']);
+            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
+                            this.getImpactRecursive(childNode.id, maxDepth, currentDepth, nodes, edges, visited);
+                        }
+                    }
+                }
+            }
+        }
+        // Get all incoming edges (things that depend on this node)
+        const incomingEdges = this.queries.getIncomingEdges(nodeId);
+        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 && !nodes.has(sourceNode.id)) {
+                nodes.set(sourceNode.id, sourceNode);
+                edges.push(edge);
+                this.getImpactRecursive(sourceNode.id, maxDepth, currentDepth + 1, nodes, edges, visited);
+            }
+        }
+    }
+    // ===========================================================================
+    // Path Finding
+    // ===========================================================================
+    /**
+     * Find the shortest path between two nodes using bidirectional BFS.
+     *
+     * Each step follows outgoing edges from the direction being expanded.
+     * Returns the path as an ordered array of { node, edge } steps, where
+     * the first entry's `edge` is null (the start node has no incoming edge).
+     *
+     * @param fromId - Starting node ID
+     * @param toId - Target node ID
+     * @param edgeKinds - Edge types to consider (all if empty array)
+     * @returns Ordered 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;
+        }
+        // Short-circuit: same node
+        if (fromId === toId) {
+            return [{ node: fromNode, edge: null }];
+        }
+        // Bidirectional BFS
+        const kinds = edgeKinds.length > 0 ? edgeKinds : undefined;
+        const forwardVisited = new Map();
+        const backwardVisited = new Map();
+        forwardVisited.set(fromId, [{ node: fromNode, edge: null }]);
+        backwardVisited.set(toId, [{ node: toNode, edge: null }]);
+        const forwardQueue = [fromId];
+        const backwardQueue = [toId];
+        while (forwardQueue.length > 0 && backwardQueue.length > 0) {
+            // Expand forward frontier
+            const meetPoint = this.expandPathFrontier(forwardQueue, forwardVisited, backwardVisited, 'outgoing', kinds);
+            if (meetPoint !== null) {
+                return this.mergePaths(forwardVisited, backwardVisited, meetPoint);
+            }
+            // Expand backward frontier
+            const meetPoint2 = this.expandPathFrontier(backwardQueue, backwardVisited, forwardVisited, 'incoming', kinds);
+            if (meetPoint2 !== null) {
+                return this.mergePaths(backwardVisited, forwardVisited, meetPoint2);
+            }
+        }
+        return null; // No path found
+    }
+    /**
+     * Expand one frontier of the bidirectional BFS by one layer.
+     *
+     * Returns the meeting node ID if frontiers intersect, or null otherwise.
+     */
+    expandPathFrontier(queue, currentVisited, otherVisited, direction, edgeKinds) {
+        const batch = [];
+        // Drain current queue into a batch so new pushes don't re-process
+        while (queue.length > 0) {
+            batch.push(queue.shift());
+        }
+        // Collect all edges and targets for the batch
+        const adjacencyMap = new Map();
+        for (const nodeId of batch) {
+            const edges = direction === 'outgoing'
+                ? this.queries.getOutgoingEdges(nodeId, edgeKinds)
+                : this.queries.getIncomingEdges(nodeId, edgeKinds);
+            for (const edge of edges) {
+                const nextId = direction === 'outgoing' ? edge.target : edge.source;
+                if (!adjacencyMap.has(nodeId))
+                    adjacencyMap.set(nodeId, []);
+                adjacencyMap.get(nodeId).push({ nextId, edge });
+            }
+        }
+        // Collect all candidate next IDs for batch fetch
+        const allCandidateIds = new Set();
+        for (const entries of adjacencyMap.values()) {
+            for (const { nextId } of entries) {
+                allCandidateIds.add(nextId);
+            }
+        }
+        // Filter to unvisited and batch-fetch
+        const wantIds = [...allCandidateIds].filter((id) => !currentVisited.has(id));
+        const fetchedNodes = wantIds.length > 0 ? this.queries.getNodesByIds(wantIds) : new Map();
+        for (const nodeId of batch) {
+            const entries = adjacencyMap.get(nodeId);
+            if (!entries)
+                continue;
+            const currentPath = currentVisited.get(nodeId);
+            for (const { nextId, edge } of entries) {
+                if (currentVisited.has(nextId))
+                    continue;
+                const nextNode = fetchedNodes.get(nextId);
+                if (!nextNode)
+                    continue;
+                const newPath = [...currentPath, { node: nextNode, edge }];
+                currentVisited.set(nextId, newPath);
+                queue.push(nextId);
+                // Check for intersection
+                if (otherVisited.has(nextId)) {
+                    return nextId;
+                }
+            }
+        }
+        return null;
+    }
+    /**
+     * Merge forward and backward path fragments at the meeting node.
+     */
+    mergePaths(forward, backward, meetPoint) {
+        const forwardPath = forward.get(meetPoint);
+        const backwardPath = backward.get(meetPoint);
+        // Backward path is stored from meet → target; reverse and drop the
+        // duplicate meet-point node (keep only the forward copy's edge = null head)
+        const reversedBackward = backwardPath.slice(1).reverse();
+        return [...forwardPath, ...reversedBackward];
+    }
+    // ===========================================================================
+    // Hierarchy
+    // ===========================================================================
+    /**
+     * Walk up the containment hierarchy from a node to its ancestors.
+     *
+     * Follows `contains` edges in reverse (incoming edges of kind `contains`),
+     * which represent "parent → child" — so the incoming edge on this node
+     * points to its parent.
+     *
+     * @param nodeId - ID of the node to start from
+     * @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 (it's a child)
+            const containingEdges = this.queries.getIncomingEdges(currentId, ['contains']);
+            const firstEdge = containingEdges[0];
+            if (!firstEdge) {
+                break;
+            }
+            // A node typically has 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 via `contains` outgoing edges.
+     *
+     * For a table, these would be its columns, indexes, constraints, etc.
+     * For a schema, these would be its tables and views.
+     *
+     * @param nodeId - ID of the parent node
+     * @returns Array of child nodes
+     */
+    getChildren(nodeId) {
+        const containsEdges = this.queries.getOutgoingEdges(nodeId, ['contains']);
+        if (containsEdges.length === 0)
+            return [];
+        // Batch-fetch all children
+        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/dist/graph/traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.js","sourceRoot":"","sources":["../../src/graph/traversal.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;;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;;;;;GAKG;AACH,MAAa,cAAc;IACjB,OAAO,CAAe;IAE9B,YAAY,OAAqB;QAC/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,8EAA8E;IAC9E,iBAAiB;IACjB,8EAA8E;IAE9E;;;;;;;;;OASG;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,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,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;YAEnC,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,qBAAqB;YACrB,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;YAED,oBAAoB;YACpB,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,qDAAqD;YACrD,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;gBAC5D,OAAO,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC;YAEH,mDAAmD;YACnD,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,CAAC,CAAC;YACpC,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,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBAEtC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC/C,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,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAClE,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,kCAAkC;QAClC,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,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;YAChF,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,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEpB,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,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,8EAA8E;IAC9E,qBAAqB;IACrB,8EAA8E;IAE9E;;;;;;;;;OASG;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,IAAI,YAAY,IAAI,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACpD,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;QACpH,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEvC,iDAAiD;QACjD,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;;;;;;;;;OASG;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,IAAI,YAAY,IAAI,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACpD,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;QACpH,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEvC,+BAA+B;QAC/B,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,8EAA8E;IAC9E,iBAAiB;IACjB,8EAA8E;IAE9E;;;;;;;;OAQG;IACH,UAAU,CAAC,MAAc;QACvB,MAAM,MAAM,GAAsC,EAAE,CAAC;QAErD,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC;QAE9C,+BAA+B;QAC/B,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;;;;;;;;;;;OAWG;IACH,eAAe,CAAC,MAAc,EAAE,WAAmB,CAAC;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAEnD,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,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAEnC,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;IAED;;;OAGG;IACK,kBAAkB,CACxB,MAAc,EACd,QAAgB,EAChB,YAAoB,EACpB,KAAwB,EACxB,KAAa,EACb,OAAoB;QAEpB,IAAI,YAAY,IAAI,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACpD,OAAO;QACT,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,yEAAyE;QACzE,kEAAkE;QAClE,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,cAAc,GAAG,IAAI,GAAG,CAAW,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;YAClF,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,0CAA0C;4BAC1C,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,2DAA2D;QAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEvC,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,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,8EAA8E;IAC9E,eAAe;IACf,8EAA8E;IAE9E;;;;;;;;;;;OAWG;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,2BAA2B;QAC3B,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,OAAO,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1C,CAAC;QAED,oBAAoB;QACpB,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QAE3D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoD,CAAC;QACnF,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoD,CAAC;QAEpF,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7D,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAE1D,MAAM,YAAY,GAAa,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,aAAa,GAAa,CAAC,IAAI,CAAC,CAAC;QAEvC,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3D,0BAA0B;YAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CACvC,YAAY,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,EAAE,KAAK,CACjE,CAAC;YACF,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACrE,CAAC;YAED,2BAA2B;YAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CACxC,aAAa,EAAE,eAAe,EAAE,cAAc,EAAE,UAAU,EAAE,KAAK,CAClE,CAAC;YACF,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;gBACxB,OAAO,IAAI,CAAC,UAAU,CAAC,eAAe,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAC/B,CAAC;IAED;;;;OAIG;IACK,kBAAkB,CACxB,KAAe,EACf,cAAqE,EACrE,YAAmE,EACnE,SAAkC,EAClC,SAAsB;QAEtB,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,kEAAkE;QAClE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAG,CAAC,CAAC;QAC7B,CAAC;QAED,8CAA8C;QAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAiD,CAAC;QAE9E,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,SAAS,KAAK,UAAU;gBACpC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,SAAS,CAAC;gBAClD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;YAErD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACpE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBAC5D,YAAY,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,KAAK,MAAM,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACjC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,MAAM,OAAO,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7E,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;QAE1F,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACzC,IAAI,CAAC,OAAO;gBAAE,SAAS;YAEvB,MAAM,WAAW,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAEhD,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;gBACvC,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAEzC,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC1C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,OAAO,GAAG,CAAC,GAAG,WAAW,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC3D,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBACpC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEnB,yBAAyB;gBACzB,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC7B,OAAO,MAAM,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,UAAU,CAChB,OAA8D,EAC9D,QAA+D,EAC/D,SAAiB;QAEjB,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;QAC5C,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;QAE9C,mEAAmE;QACnE,4EAA4E;QAC5E,MAAM,gBAAgB,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAEzD,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,gBAAgB,CAAC,CAAC;IAC/C,CAAC;IAED,8EAA8E;IAC9E,YAAY;IACZ,8EAA8E;IAE9E;;;;;;;;;OASG;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,iEAAiE;YACjE,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,qDAAqD;YACrD,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;;;;;;;;OAQG;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,2BAA2B;QAC3B,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;AAvnBD,wCAunBC"}