@danielsimonjr/memoryjs 1.0.0 → 1.2.0

package/dist/core/GraphTraversal.js

@@ -1,574 +0,0 @@
-/**
- * Graph Traversal
- *
- * Phase 4 Sprints 6-8: Graph traversal algorithms for knowledge graph analysis.
- * Includes BFS, DFS, shortest path, all paths, connected components, and centrality.
- *
- * @module core/GraphTraversal
- */
-import { checkCancellation } from '../utils/index.js';
-/**
- * Phase 4 Sprint 6: Default traversal options.
- */
-const DEFAULT_OPTIONS = {
-    direction: 'both',
-    maxDepth: Infinity,
-    relationTypes: [],
-    entityTypes: [],
-};
-/**
- * Graph traversal algorithms for knowledge graph analysis.
- *
- * Provides BFS, DFS, shortest path finding, connected component detection,
- * and centrality metrics for analyzing graph structure.
- */
-export class GraphTraversal {
-    storage;
-    constructor(storage) {
-        this.storage = storage;
-    }
-    // ==================== Sprint 6: BFS and DFS Traversal ====================
-    /**
-     * Get neighbors of a node based on traversal direction and filters.
-     *
-     * @param entityName - Entity to get neighbors for
-     * @param options - Traversal options
-     * @returns Array of neighbor entity names with their relations
-     */
-    getNeighborsWithRelations(entityName, options = {}) {
-        // Filter out undefined values before merging with defaults
-        const definedOptions = Object.fromEntries(Object.entries(options).filter(([, v]) => v !== undefined));
-        const opts = { ...DEFAULT_OPTIONS, ...definedOptions };
-        const neighbors = [];
-        // Get relations based on direction
-        let relations = [];
-        if (opts.direction === 'outgoing' || opts.direction === 'both') {
-            relations = relations.concat(this.storage.getRelationsFrom(entityName));
-        }
-        if (opts.direction === 'incoming' || opts.direction === 'both') {
-            relations = relations.concat(this.storage.getRelationsTo(entityName));
-        }
-        // Filter by relation types if specified
-        if (opts.relationTypes && opts.relationTypes.length > 0) {
-            const typeSet = new Set(opts.relationTypes.map(t => t.toLowerCase()));
-            relations = relations.filter(r => typeSet.has(r.relationType.toLowerCase()));
-        }
-        // Process relations to get neighbors
-        for (const relation of relations) {
-            const neighbor = relation.from === entityName ? relation.to : relation.from;
-            // Skip self-loops
-            if (neighbor === entityName)
-                continue;
-            // Filter by entity types if specified
-            if (opts.entityTypes && opts.entityTypes.length > 0) {
-                const entity = this.storage.getEntityByName(neighbor);
-                if (!entity)
-                    continue;
-                const typeSet = new Set(opts.entityTypes.map(t => t.toLowerCase()));
-                if (!typeSet.has(entity.entityType.toLowerCase()))
-                    continue;
-            }
-            neighbors.push({ neighbor, relation });
-        }
-        return neighbors;
-    }
-    /**
-     * Breadth-First Search traversal starting from a given entity.
-     *
-     * @param startEntity - Entity name to start traversal from
-     * @param options - Traversal options
-     * @returns Traversal result with visited nodes, depths, and parent pointers
-     */
-    bfs(startEntity, options = {}) {
-        const opts = { ...DEFAULT_OPTIONS, ...options };
-        // Validate start entity exists
-        if (!this.storage.hasEntity(startEntity)) {
-            return { nodes: [], depths: new Map(), parents: new Map() };
-        }
-        const visited = new Set();
-        const queue = [{ node: startEntity, depth: 0 }];
-        const nodes = [];
-        const depths = new Map();
-        const parents = new Map();
-        visited.add(startEntity);
-        parents.set(startEntity, null);
-        while (queue.length > 0) {
-            const { node, depth } = queue.shift();
-            // Respect maxDepth limit
-            if (depth > opts.maxDepth)
-                continue;
-            nodes.push(node);
-            depths.set(node, depth);
-            // Get neighbors and add unvisited ones to queue
-            const neighbors = this.getNeighborsWithRelations(node, opts);
-            for (const { neighbor } of neighbors) {
-                if (!visited.has(neighbor)) {
-                    visited.add(neighbor);
-                    queue.push({ node: neighbor, depth: depth + 1 });
-                    parents.set(neighbor, node);
-                }
-            }
-        }
-        return { nodes, depths, parents };
-    }
-    /**
-     * Depth-First Search traversal starting from a given entity.
-     *
-     * @param startEntity - Entity name to start traversal from
-     * @param options - Traversal options
-     * @returns Traversal result with visited nodes, depths, and parent pointers
-     */
-    dfs(startEntity, options = {}) {
-        const opts = { ...DEFAULT_OPTIONS, ...options };
-        // Validate start entity exists
-        if (!this.storage.hasEntity(startEntity)) {
-            return { nodes: [], depths: new Map(), parents: new Map() };
-        }
-        const visited = new Set();
-        const stack = [{ node: startEntity, depth: 0 }];
-        const nodes = [];
-        const depths = new Map();
-        const parents = new Map();
-        parents.set(startEntity, null);
-        while (stack.length > 0) {
-            const { node, depth } = stack.pop();
-            // Skip if already visited
-            if (visited.has(node))
-                continue;
-            // Respect maxDepth limit
-            if (depth > opts.maxDepth)
-                continue;
-            visited.add(node);
-            nodes.push(node);
-            depths.set(node, depth);
-            // Get neighbors and add unvisited ones to stack
-            const neighbors = this.getNeighborsWithRelations(node, opts);
-            for (const { neighbor } of neighbors) {
-                if (!visited.has(neighbor)) {
-                    stack.push({ node: neighbor, depth: depth + 1 });
-                    if (!parents.has(neighbor)) {
-                        parents.set(neighbor, node);
-                    }
-                }
-            }
-        }
-        return { nodes, depths, parents };
-    }
-    // ==================== Sprint 7: Path Finding Algorithms ====================
-    /**
-     * Find the shortest path between two entities using BFS.
-     *
-     * @param source - Source entity name
-     * @param target - Target entity name
-     * @param options - Traversal options
-     * @returns PathResult if path exists, null otherwise
-     */
-    async findShortestPath(source, target, options = {}) {
-        // Ensure graph is loaded to populate indexes
-        await this.storage.loadGraph();
-        // Validate entities exist
-        if (!this.storage.hasEntity(source) || !this.storage.hasEntity(target)) {
-            return null;
-        }
-        // Same source and target
-        if (source === target) {
-            return { path: [source], length: 0, relations: [] };
-        }
-        const opts = { ...DEFAULT_OPTIONS, ...options };
-        const visited = new Set();
-        const queue = [source];
-        const parents = new Map();
-        visited.add(source);
-        parents.set(source, null);
-        while (queue.length > 0) {
-            const current = queue.shift();
-            // Found target, reconstruct path
-            if (current === target) {
-                return this.reconstructPath(source, target, parents);
-            }
-            // Get neighbors
-            const neighbors = this.getNeighborsWithRelations(current, opts);
-            for (const { neighbor, relation } of neighbors) {
-                if (!visited.has(neighbor)) {
-                    visited.add(neighbor);
-                    queue.push(neighbor);
-                    parents.set(neighbor, { parent: current, relation });
-                }
-            }
-        }
-        // No path found
-        return null;
-    }
-    /**
-     * Reconstruct path from parent pointers.
-     */
-    reconstructPath(_source, target, parents) {
-        const path = [];
-        const relations = [];
-        let current = target;
-        while (current !== null) {
-            path.unshift(current);
-            const parentInfo = parents.get(current);
-            if (parentInfo) {
-                relations.unshift(parentInfo.relation);
-                current = parentInfo.parent;
-            }
-            else {
-                current = null;
-            }
-        }
-        return {
-            path,
-            length: path.length - 1,
-            relations,
-        };
-    }
-    /**
-     * Find all paths between two entities up to a maximum depth.
-     *
-     * Phase 9B: Supports cancellation via AbortSignal in options.
-     *
-     * @param source - Source entity name
-     * @param target - Target entity name
-     * @param maxDepth - Maximum path length (default: 5)
-     * @param options - Traversal options (includes signal for cancellation)
-     * @returns Array of PathResult objects for all found paths
-     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
-     */
-    async findAllPaths(source, target, maxDepth = 5, options = {}) {
-        // Check for early cancellation
-        const { signal, ...traversalOptions } = options;
-        checkCancellation(signal, 'findAllPaths');
-        // Ensure graph is loaded to populate indexes
-        await this.storage.loadGraph();
-        // Check for cancellation after load
-        checkCancellation(signal, 'findAllPaths');
-        // Validate entities exist
-        if (!this.storage.hasEntity(source) || !this.storage.hasEntity(target)) {
-            return [];
-        }
-        const opts = { ...DEFAULT_OPTIONS, ...traversalOptions };
-        const allPaths = [];
-        const currentPath = [source];
-        const currentRelations = [];
-        const visited = new Set([source]);
-        // Track iterations for periodic cancellation checks
-        let iterationCount = 0;
-        const CANCELLATION_CHECK_INTERVAL = 100;
-        const dfsAllPaths = (current, depth) => {
-            // Periodic cancellation check
-            iterationCount++;
-            if (iterationCount % CANCELLATION_CHECK_INTERVAL === 0) {
-                checkCancellation(signal, 'findAllPaths');
-            }
-            if (depth > maxDepth)
-                return;
-            if (current === target && depth > 0) {
-                allPaths.push({
-                    path: [...currentPath],
-                    length: currentPath.length - 1,
-                    relations: [...currentRelations],
-                });
-                return;
-            }
-            const neighbors = this.getNeighborsWithRelations(current, opts);
-            for (const { neighbor, relation } of neighbors) {
-                if (!visited.has(neighbor)) {
-                    visited.add(neighbor);
-                    currentPath.push(neighbor);
-                    currentRelations.push(relation);
-                    dfsAllPaths(neighbor, depth + 1);
-                    currentPath.pop();
-                    currentRelations.pop();
-                    visited.delete(neighbor);
-                }
-            }
-        };
-        dfsAllPaths(source, 0);
-        return allPaths;
-    }
-    // ==================== Sprint 8: Connected Components ====================
-    /**
-     * Find all connected components in the graph.
-     *
-     * Uses BFS to find all weakly connected components (treating the graph as undirected).
-     *
-     * @returns ConnectedComponentsResult with all components
-     */
-    async findConnectedComponents() {
-        const graph = await this.storage.loadGraph();
-        const visited = new Set();
-        const components = [];
-        for (const entity of graph.entities) {
-            if (!visited.has(entity.name)) {
-                // BFS to find all nodes in this component
-                const component = [];
-                const queue = [entity.name];
-                visited.add(entity.name);
-                while (queue.length > 0) {
-                    const current = queue.shift();
-                    component.push(current);
-                    // Get all neighbors (both directions for weakly connected)
-                    const neighbors = this.getNeighborsWithRelations(current, { direction: 'both' });
-                    for (const { neighbor } of neighbors) {
-                        if (!visited.has(neighbor)) {
-                            visited.add(neighbor);
-                            queue.push(neighbor);
-                        }
-                    }
-                }
-                components.push(component);
-            }
-        }
-        // Sort components by size (largest first)
-        components.sort((a, b) => b.length - a.length);
-        return {
-            components,
-            count: components.length,
-            largestComponentSize: components.length > 0 ? components[0].length : 0,
-        };
-    }
-    // ==================== Sprint 8: Centrality Algorithms ====================
-    /**
-     * Calculate degree centrality for all entities.
-     *
-     * Degree centrality is the number of connections an entity has,
-     * normalized by the maximum possible connections.
-     *
-     * @param direction - Direction to count: 'in', 'out', or 'both' (default)
-     * @param topN - Number of top entities to return (default: 10)
-     * @returns CentralityResult with scores and top entities
-     */
-    async calculateDegreeCentrality(direction = 'both', topN = 10) {
-        const graph = await this.storage.loadGraph();
-        const scores = new Map();
-        const n = graph.entities.length;
-        // Calculate degree for each entity
-        for (const entity of graph.entities) {
-            let degree = 0;
-            if (direction === 'in' || direction === 'both') {
-                degree += this.storage.getRelationsTo(entity.name).length;
-            }
-            if (direction === 'out' || direction === 'both') {
-                degree += this.storage.getRelationsFrom(entity.name).length;
-            }
-            // Normalize by maximum possible degree
-            const normalizedDegree = n > 1 ? degree / (n - 1) : 0;
-            scores.set(entity.name, normalizedDegree);
-        }
-        // Get top N entities
-        const topEntities = this.getTopEntities(scores, topN);
-        return {
-            scores,
-            topEntities,
-            algorithm: 'degree',
-        };
-    }
-    /**
-     * Calculate betweenness centrality for all entities.
-     *
-     * Betweenness centrality measures how often a node appears on shortest paths
-     * between other nodes. Uses Brandes' algorithm for efficiency.
-     *
-     * @param options - Configuration options
-     * @param options.topN - Number of top entities to return (default: 10)
-     * @param options.chunkSize - Yield control every N vertices (default: 50)
-     * @param options.onProgress - Progress callback (0.0 to 1.0)
-     * @param options.approximate - Use approximation for faster results (default: false)
-     * @param options.sampleRate - Sample rate for approximation (default: 0.2)
-     * @returns CentralityResult with scores and top entities
-     */
-    async calculateBetweennessCentrality(options = {}) {
-        const { topN = 10, chunkSize = 50, onProgress, approximate = false, sampleRate = 0.2 } = options;
-        const graph = await this.storage.loadGraph();
-        const scores = new Map();
-        // Initialize scores
-        for (const entity of graph.entities) {
-            scores.set(entity.name, 0);
-        }
-        // Determine which sources to process (full or sampled)
-        let sourcesToProcess = graph.entities;
-        if (approximate && graph.entities.length > 100) {
-            const sampleSize = Math.max(10, Math.floor(graph.entities.length * sampleRate));
-            sourcesToProcess = this.sampleEntities(graph.entities, sampleSize);
-        }
-        // Brandes' algorithm with chunked processing
-        let processed = 0;
-        for (const source of sourcesToProcess) {
-            const stack = [];
-            const predecessors = new Map();
-            const sigma = new Map(); // Number of shortest paths
-            const distance = new Map(); // Distance from source
-            const delta = new Map(); // Dependency
-            // Initialize
-            for (const entity of graph.entities) {
-                predecessors.set(entity.name, []);
-                sigma.set(entity.name, 0);
-                distance.set(entity.name, -1);
-                delta.set(entity.name, 0);
-            }
-            sigma.set(source.name, 1);
-            distance.set(source.name, 0);
-            // BFS
-            const queue = [source.name];
-            while (queue.length > 0) {
-                const v = queue.shift();
-                stack.push(v);
-                const neighbors = this.getNeighborsWithRelations(v, { direction: 'both' });
-                for (const { neighbor: w } of neighbors) {
-                    // First time w is discovered
-                    if (distance.get(w) === -1) {
-                        distance.set(w, distance.get(v) + 1);
-                        queue.push(w);
-                    }
-                    // w is on a shortest path from source via v
-                    if (distance.get(w) === distance.get(v) + 1) {
-                        sigma.set(w, sigma.get(w) + sigma.get(v));
-                        predecessors.get(w).push(v);
-                    }
-                }
-            }
-            // Accumulation
-            while (stack.length > 0) {
-                const w = stack.pop();
-                for (const v of predecessors.get(w)) {
-                    const contribution = (sigma.get(v) / sigma.get(w)) * (1 + delta.get(w));
-                    delta.set(v, delta.get(v) + contribution);
-                }
-                if (w !== source.name) {
-                    scores.set(w, scores.get(w) + delta.get(w));
-                }
-            }
-            // Yield control periodically to prevent blocking event loop
-            processed++;
-            if (processed % chunkSize === 0) {
-                // Yield control to allow event loop to process other events
-                await new Promise(resolve => setImmediate(resolve));
-                // Report progress
-                if (onProgress) {
-                    onProgress(processed / sourcesToProcess.length);
-                }
-            }
-        }
-        // Final progress update
-        if (onProgress) {
-            onProgress(1);
-        }
-        // Scale scores if using approximation
-        if (approximate && sampleRate < 1.0) {
-            const scaleFactor = 1 / sampleRate;
-            for (const [entity, score] of scores) {
-                scores.set(entity, score * scaleFactor);
-            }
-        }
-        // Normalize scores
-        const n = graph.entities.length;
-        const normalization = n > 2 ? 2 / ((n - 1) * (n - 2)) : 1;
-        for (const [name, score] of scores) {
-            scores.set(name, score * normalization);
-        }
-        const topEntities = this.getTopEntities(scores, topN);
-        return {
-            scores,
-            topEntities,
-            algorithm: 'betweenness',
-        };
-    }
-    /**
-     * Sample entities randomly for approximation algorithms.
-     *
-     * @param entities - Array of entities to sample from
-     * @param sampleSize - Number of entities to sample
-     * @returns Array of sampled entities
-     */
-    sampleEntities(entities, sampleSize) {
-        const shuffled = [...entities];
-        // Fisher-Yates shuffle
-        for (let i = shuffled.length - 1; i > 0; i--) {
-            const j = Math.floor(Math.random() * (i + 1));
-            [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];
-        }
-        return shuffled.slice(0, sampleSize);
-    }
-    /**
-     * Calculate PageRank centrality for all entities.
-     *
-     * PageRank measures importance based on incoming connections from
-     * other important nodes. Uses iterative power method.
-     *
-     * @param dampingFactor - Damping factor (default: 0.85)
-     * @param maxIterations - Maximum iterations (default: 100)
-     * @param tolerance - Convergence tolerance (default: 1e-6)
-     * @param topN - Number of top entities to return (default: 10)
-     * @returns CentralityResult with scores and top entities
-     */
-    async calculatePageRank(dampingFactor = 0.85, maxIterations = 100, tolerance = 1e-6, topN = 10) {
-        const graph = await this.storage.loadGraph();
-        const n = graph.entities.length;
-        if (n === 0) {
-            return { scores: new Map(), topEntities: [], algorithm: 'pagerank' };
-        }
-        // Initialize PageRank scores
-        const scores = new Map();
-        const initialScore = 1 / n;
-        for (const entity of graph.entities) {
-            scores.set(entity.name, initialScore);
-        }
-        // Build outgoing links map
-        const outLinks = new Map();
-        for (const entity of graph.entities) {
-            const outgoing = this.storage.getRelationsFrom(entity.name);
-            outLinks.set(entity.name, outgoing.map(r => r.to));
-        }
-        // Power iteration
-        for (let iteration = 0; iteration < maxIterations; iteration++) {
-            const newScores = new Map();
-            let totalDiff = 0;
-            // Calculate dangling node contribution (nodes with no outgoing links)
-            let danglingSum = 0;
-            for (const entity of graph.entities) {
-                if (outLinks.get(entity.name).length === 0) {
-                    danglingSum += scores.get(entity.name);
-                }
-            }
-            const danglingContribution = (dampingFactor * danglingSum) / n;
-            // Calculate new scores
-            for (const entity of graph.entities) {
-                let incomingScore = 0;
-                const incoming = this.storage.getRelationsTo(entity.name);
-                for (const relation of incoming) {
-                    const source = relation.from;
-                    const sourceOutCount = outLinks.get(source)?.length || 1;
-                    incomingScore += scores.get(source) / sourceOutCount;
-                }
-                const newScore = (1 - dampingFactor) / n + dampingFactor * incomingScore + danglingContribution;
-                newScores.set(entity.name, newScore);
-                totalDiff += Math.abs(newScore - scores.get(entity.name));
-            }
-            // Update scores
-            for (const [name, score] of newScores) {
-                scores.set(name, score);
-            }
-            // Check convergence
-            if (totalDiff < tolerance) {
-                break;
-            }
-        }
-        const topEntities = this.getTopEntities(scores, topN);
-        return {
-            scores,
-            topEntities,
-            algorithm: 'pagerank',
-        };
-    }
-    /**
-     * Get top N entities from a scores map.
-     */
-    getTopEntities(scores, topN) {
-        return Array.from(scores.entries())
-            .sort((a, b) => b[1] - a[1])
-            .slice(0, topN)
-            .map(([name, score]) => ({ name, score }));
-    }
-}
-//# sourceMappingURL=GraphTraversal.js.map

package/dist/core/GraphTraversal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"GraphTraversal.js","sourceRoot":"","sources":["../../src/core/GraphTraversal.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAYH,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAEtD;;GAEG;AACH,MAAM,eAAe,GAA+B;IAClD,SAAS,EAAE,MAAM;IACjB,QAAQ,EAAE,QAAQ;IAClB,aAAa,EAAE,EAAE;IACjB,WAAW,EAAE,EAAE;CAChB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IACL;IAApB,YAAoB,OAAqB;QAArB,YAAO,GAAP,OAAO,CAAc;IAAG,CAAC;IAE7C,4EAA4E;IAE5E;;;;;;OAMG;IACH,yBAAyB,CACvB,UAAkB,EAClB,UAA4B,EAAE;QAE9B,2DAA2D;QAC3D,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW,CACvC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAC3D,CAAC;QACF,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,cAAc,EAAE,CAAC;QACvD,MAAM,SAAS,GAAoD,EAAE,CAAC;QAEtE,mCAAmC;QACnC,IAAI,SAAS,GAAe,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS,KAAK,UAAU,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/D,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;QAC1E,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,KAAK,UAAU,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/D,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;QACxE,CAAC;QAED,wCAAwC;QACxC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACtE,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAC/E,CAAC;QAED,qCAAqC;QACrC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;YAE5E,kBAAkB;YAClB,IAAI,QAAQ,KAAK,UAAU;gBAAE,SAAS;YAEtC,sCAAsC;YACtC,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;gBACtD,IAAI,CAAC,MAAM;oBAAE,SAAS;gBACtB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;gBACpE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC;oBAAE,SAAS;YAC9D,CAAC;YAED,SAAS,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,WAAmB,EAAE,UAA4B,EAAE;QACrD,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAEhD,+BAA+B;QAC/B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;QAC9D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA2C,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACxF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;QAEjD,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAE/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEvC,yBAAyB;YACzB,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAEpC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAExB,gDAAgD;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC7D,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;gBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACjD,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,WAAmB,EAAE,UAA4B,EAAE;QACrD,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAEhD,+BAA+B;QAC/B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;QAC9D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAA2C,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACxF,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;QAEjD,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAE/B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAErC,0BAA0B;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAEhC,yBAAyB;YACzB,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAEpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAExB,gDAAgD;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC7D,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;gBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;oBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IACpC,CAAC;IAED,8EAA8E;IAE9E;;;;;;;OAOG;IACH,KAAK,CAAC,gBAAgB,CACpB,MAAc,EACd,MAAc,EACd,UAA4B,EAAE;QAE9B,6CAA6C;QAC7C,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAE/B,0BAA0B;QAC1B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACvE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,yBAAyB;QACzB,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,OAAO,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyD,CAAC;QAEjF,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,iCAAiC;YACjC,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;gBACvB,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;YAED,gBAAgB;YAChB,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAChE,KAAK,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrB,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,OAAe,EACf,MAAc,EACd,OAAmE;QAEnE,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,OAAO,GAAkB,MAAM,CAAC;QAEpC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACtB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,UAAU,EAAE,CAAC;gBACf,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBACvC,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QAED,OAAO;YACL,IAAI;YACJ,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC;YACvB,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,YAAY,CAChB,MAAc,EACd,MAAc,EACd,WAAmB,CAAC,EACpB,UAAuD,EAAE;QAEzD,+BAA+B;QAC/B,MAAM,EAAE,MAAM,EAAE,GAAG,gBAAgB,EAAE,GAAG,OAAO,CAAC;QAChD,iBAAiB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAE1C,6CAA6C;QAC7C,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAE/B,oCAAoC;QACpC,iBAAiB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAE1C,0BAA0B;QAC1B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACvE,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,gBAAgB,EAAE,CAAC;QACzD,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,MAAM,WAAW,GAAa,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,gBAAgB,GAAe,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAE1C,oDAAoD;QACpD,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,MAAM,2BAA2B,GAAG,GAAG,CAAC;QAExC,MAAM,WAAW,GAAG,CAAC,OAAe,EAAE,KAAa,EAAE,EAAE;YACrD,8BAA8B;YAC9B,cAAc,EAAE,CAAC;YACjB,IAAI,cAAc,GAAG,2BAA2B,KAAK,CAAC,EAAE,CAAC;gBACvD,iBAAiB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;YAC5C,CAAC;YAED,IAAI,KAAK,GAAG,QAAQ;gBAAE,OAAO;YAE7B,IAAI,OAAO,KAAK,MAAM,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACpC,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,CAAC,GAAG,WAAW,CAAC;oBACtB,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;oBAC9B,SAAS,EAAE,CAAC,GAAG,gBAAgB,CAAC;iBACjC,CAAC,CAAC;gBACH,OAAO;YACT,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAChE,KAAK,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC3B,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAEhC,WAAW,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAEjC,WAAW,CAAC,GAAG,EAAE,CAAC;oBAClB,gBAAgB,CAAC,GAAG,EAAE,CAAC;oBACvB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,2EAA2E;IAE3E;;;;;;OAMG;IACH,KAAK,CAAC,uBAAuB;QAC3B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,UAAU,GAAe,EAAE,CAAC;QAElC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,0CAA0C;gBAC1C,MAAM,SAAS,GAAa,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACtC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAEzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;oBAC/B,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAExB,2DAA2D;oBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;oBACjF,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;wBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;4BAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;4BACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE/C,OAAO;YACL,UAAU;YACV,KAAK,EAAE,UAAU,CAAC,MAAM;YACxB,oBAAoB,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SACvE,CAAC;IACJ,CAAC;IAED,4EAA4E;IAE5E;;;;;;;;;OASG;IACH,KAAK,CAAC,yBAAyB,CAC7B,YAAmC,MAAM,EACzC,OAAe,EAAE;QAEjB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAEhC,mCAAmC;QACnC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBAC/C,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YAC5D,CAAC;YACD,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBAChD,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YAC9D,CAAC;YAED,uCAAuC;YACvC,MAAM,gBAAgB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;QAC5C,CAAC;QAED,qBAAqB;QACrB,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAEtD,OAAO;YACL,MAAM;YACN,WAAW;YACX,SAAS,EAAE,QAAQ;SACpB,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,8BAA8B,CAClC,UAMI,EAAE;QAEN,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,UAAU,EAAE,WAAW,GAAG,KAAK,EAAE,UAAU,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC;QACjG,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,oBAAoB;QACpB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,uDAAuD;QACvD,IAAI,gBAAgB,GAAG,KAAK,CAAC,QAAQ,CAAC;QACtC,IAAI,WAAW,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;YAChF,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACrE,CAAC;QAED,6CAA6C;QAC7C,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;YACtC,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;YACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,2BAA2B;YACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,uBAAuB;YACnE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,aAAa;YAEtD,aAAa;YACb,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAClC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC1B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC9B,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC5B,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAC1B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAE7B,MAAM;YACN,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACtC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEd,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC3E,KAAK,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,SAAS,EAAE,CAAC;oBACxC,6BAA6B;oBAC7B,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;wBAC3B,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;wBACtC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAChB,CAAC;oBAED,4CAA4C;oBAC5C,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;wBAC7C,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;wBAC5C,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,eAAe;YACf,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACvB,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC;oBACrC,MAAM,YAAY,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;oBAC3E,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,YAAY,CAAC,CAAC;gBAC7C,CAAC;gBACD,IAAI,CAAC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBAChD,CAAC;YACH,CAAC;YAED,4DAA4D;YAC5D,SAAS,EAAE,CAAC;YACZ,IAAI,SAAS,GAAG,SAAS,KAAK,CAAC,EAAE,CAAC;gBAChC,4DAA4D;gBAC5D,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;gBAEpD,kBAAkB;gBAClB,IAAI,UAAU,EAAE,CAAC;oBACf,UAAU,CAAC,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,IAAI,UAAU,EAAE,CAAC;YACf,UAAU,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;QAED,sCAAsC;QACtC,IAAI,WAAW,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;YACpC,MAAM,WAAW,GAAG,CAAC,GAAG,UAAU,CAAC;YACnC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,WAAW,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAChC,MAAM,aAAa,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,aAAa,CAAC,CAAC;QAC1C,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAEtD,OAAO;YACL,MAAM;YACN,WAAW;YACX,SAAS,EAAE,aAAa;SACzB,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,cAAc,CAAC,QAA2B,EAAE,UAAkB;QACpE,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC/B,uBAAuB;QACvB,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,iBAAiB,CACrB,gBAAwB,IAAI,EAC5B,gBAAwB,GAAG,EAC3B,YAAoB,IAAI,EACxB,OAAe,EAAE;QAEjB,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAEhC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;QACvE,CAAC;QAED,6BAA6B;QAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACxC,CAAC;QAED,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC5D,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,kBAAkB;QAClB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;YAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,sEAAsE;YACtE,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpC,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC5C,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC;gBAC1C,CAAC;YACH,CAAC;YACD,MAAM,oBAAoB,GAAG,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAE/D,uBAAuB;YACvB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpC,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAE1D,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;oBAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC;oBAC7B,MAAM,cAAc,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;oBACzD,aAAa,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,cAAc,CAAC;gBACxD,CAAC;gBAED,MAAM,QAAQ,GACZ,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,aAAa,GAAG,aAAa,GAAG,oBAAoB,CAAC;gBAEjF,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBACrC,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,CAAC,CAAC;YAC7D,CAAC;YAED,gBAAgB;YAChB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC1B,CAAC;YAED,oBAAoB;YACpB,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;gBAC1B,MAAM;YACR,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAEtD,OAAO;YACL,MAAM;YACN,WAAW;YACX,SAAS,EAAE,UAAU;SACtB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,MAA2B,EAC3B,IAAY;QAEZ,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;aAChC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;aACd,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;CACF"}