code-auditor-mcp 3.1.1 → 3.4.0

package/dist/graph/importGraph.js

@@ -0,0 +1,602 @@
+/**
+ * Spec 14 R3, R4 — Import Graph, Community Detection, and Martin Metrics
+ *
+ * Builds a file-level import graph from `function_dependencies`, runs Louvain
+ * community detection, computes directory purity vs community structure, and
+ * calculates Martin instability/abstractness metrics.
+ *
+ * IMPORTANT (R4 abstractness gate): The `functions` entity_type column stores
+ * only 'function' and 'component' — NOT type/interface declarations. Abstractness (A)
+ * is computed from `is_exported` rows using a per-file AST scan for export type/interface
+ * declarations. Without this, A = 0 everywhere (dead path).
+ *
+ * All advisory — zero violations. Reports and annotations only.
+ */
+// ── R1 — Import graph construction ──────────────────────────────────────
+/**
+ * Build a file-level import graph by aggregating `function_dependencies`
+ * joined with `functions.file_path`.
+ *
+ * Edge weight = count of distinct dependency symbols between a file pair.
+ */
+export function buildImportGraph(db) {
+    const adjacency = new Map();
+    // Collect all files with indexed functions
+    const files = db.prepare('SELECT DISTINCT file_path FROM functions').all();
+    const filePaths = new Set();
+    for (const row of files) {
+        filePaths.add(row.file_path);
+    }
+    // Aggregate import edges: for each function, its dependencies map to
+    // the files those dependencies likely resolve to (module/file resolution)
+    const rows = db.prepare(`
+    SELECT
+      f.file_path AS source_file,
+      fd.dependency
+    FROM function_dependencies fd
+    JOIN functions f ON f.id = fd.function_id
+    ORDER BY f.file_path, fd.dependency
+  `).all();
+    // Group by (source_file, dependency) — weight = count of imports
+    const edgeWeights = new Map();
+    for (const row of rows) {
+        if (!edgeWeights.has(row.source_file)) {
+            edgeWeights.set(row.source_file, new Map());
+        }
+        const inner = edgeWeights.get(row.source_file);
+        inner.set(row.dependency, (inner.get(row.dependency) ?? 0) + 1);
+    }
+    // Now resolve each dependency to a file in the project
+    // Build a lookup: module name → file path
+    const moduleToFile = new Map();
+    // First pass: build a dependency → file lookup by matching dependency names
+    // against file basenames
+    for (const fp of filePaths) {
+        const basename = basenameNoExt(fp);
+        if (!moduleToFile.has(basename)) {
+            moduleToFile.set(basename, new Set());
+        }
+        moduleToFile.get(basename).add(fp);
+    }
+    // Second pass: resolve import edges
+    for (const [sourceFile, depMap] of edgeWeights) {
+        if (!adjacency.has(sourceFile)) {
+            adjacency.set(sourceFile, new Map());
+        }
+        for (const [dep, weight] of depMap) {
+            // Try to resolve the dependency to a file
+            const targets = resolveDependency(dep, filePaths, moduleToFile, sourceFile);
+            for (const target of targets) {
+                if (target === sourceFile)
+                    continue; // Skip self-loops
+                if (!adjacency.has(sourceFile)) {
+                    adjacency.set(sourceFile, new Map());
+                }
+                const adjMap = adjacency.get(sourceFile);
+                adjMap.set(target, (adjMap.get(target) ?? 0) + weight);
+            }
+        }
+    }
+    return { adjacency, filePaths };
+}
+function basenameNoExt(fp) {
+    const segments = fp.replace(/\\/g, '/').split('/');
+    const basename = segments[segments.length - 1];
+    const dot = basename.lastIndexOf('.');
+    return dot > 0 ? basename.substring(0, dot) : basename;
+}
+/**
+ * Resolve a dependency name to a set of file paths.
+ *
+ * Tries multiple strategies:
+ * 1. Exact file path match
+ * 2. Module name matching (npm package → search path patterns)
+ * 3. Relative import resolution
+ * 4. Basename matching
+ */
+function resolveDependency(dep, filePaths, moduleToFile, sourceFile) {
+    const results = [];
+    // Strategy 1: Exact file path match
+    if (filePaths.has(dep)) {
+        return [dep];
+    }
+    // Strategy 2: Check if dep is a relative path
+    if (dep.startsWith('.') || dep.startsWith('/')) {
+        // Resolve relative to source file directory
+        const sourceDir = sourceFile.replace(/\\/g, '/').split('/').slice(0, -1).join('/');
+        const resolved = normalizePath(sourceDir ? `${sourceDir}/${dep}` : dep);
+        // Try with various extensions
+        for (const ext of ['', '.ts', '.tsx', '.js', '.jsx', '/index.ts', '/index.tsx']) {
+            const candidate = resolved + ext;
+            if (filePaths.has(candidate)) {
+                return [candidate];
+            }
+        }
+        // Partial match: check if any file starts with the resolved path
+        for (const fp of filePaths) {
+            if (fp.startsWith(resolved + '/') || fp === resolved) {
+                results.push(fp);
+            }
+        }
+        return results;
+    }
+    // Strategy 3: Module name matching — try to find project files with matching
+    // directory/package names
+    const depParts = dep.split('/');
+    const lastName = depParts[depParts.length - 1];
+    // Check moduleToFile for the last segment
+    const candidates = moduleToFile.get(lastName);
+    if (candidates) {
+        // Filter: prefer files whose path contains the dep name
+        for (const fp of candidates) {
+            if (fp.includes('/' + dep + '/') || fp.includes('/' + dep + '.')) {
+                results.push(fp);
+            }
+        }
+        // If no strong matches, prefer files not in the source directory
+        if (results.length === 0) {
+            for (const fp of candidates) {
+                results.push(fp);
+            }
+        }
+        return results;
+    }
+    // Strategy 4: Fuzzy matching — check if dep appears as a file path segment
+    for (const fp of filePaths) {
+        const segments = fp.replace(/\\/g, '/').split('/');
+        if (segments.includes(lastName) || segments.includes(dep)) {
+            results.push(fp);
+        }
+    }
+    return results;
+}
+function normalizePath(p) {
+    const parts = p.replace(/\\/g, '/').split('/');
+    const result = [];
+    for (const part of parts) {
+        if (part === '..') {
+            result.pop();
+        }
+        else if (part !== '.' && part !== '') {
+            result.push(part);
+        }
+    }
+    return result.join('/');
+}
+/**
+ * Populate `graph_cache` with import graph edges.
+ */
+export function populateImportGraphCache(db) {
+    const { adjacency } = buildImportGraph(db);
+    const txn = db.transaction(() => {
+        db.prepare("DELETE FROM graph_cache WHERE graph_type = 'import'").run();
+        const stmt = db.prepare(`INSERT OR REPLACE INTO graph_cache (graph_type, node_key, neighbor_key, weight)
+       VALUES ('import', ?, ?, ?)`);
+        for (const [sourceFile, neighbors] of adjacency) {
+            for (const [targetFile, weight] of neighbors) {
+                stmt.run(sourceFile, targetFile, weight);
+            }
+        }
+    });
+    txn();
+}
+/**
+ * Build an import graph from the persistent `graph_cache` table (fast path).
+ */
+export function buildImportGraphFromCache(db) {
+    const adjacency = new Map();
+    const filePaths = new Set();
+    const rows = db.prepare(`SELECT node_key, neighbor_key, weight FROM graph_cache WHERE graph_type = 'import'`).all();
+    for (const row of rows) {
+        filePaths.add(row.node_key);
+        filePaths.add(row.neighbor_key);
+        if (!adjacency.has(row.node_key))
+            adjacency.set(row.node_key, new Map());
+        adjacency.get(row.node_key).set(row.neighbor_key, row.weight);
+    }
+    return { adjacency, filePaths };
+}
+// ── R3 — Louvain community detection ────────────────────────────────────
+/**
+ * Louvain community detection on weighted undirected graph.
+ *
+ * Standard two-phase algorithm:
+ * Phase 1: Greedy modularity optimization (move nodes between communities)
+ * Phase 2: Community aggregation (build super-graph)
+ * Repeat until modularity gain < threshold.
+ */
+export function detectCommunities(adjacency, filePaths) {
+    // Convert to undirected weighted graph
+    // For each directed edge, add reverse if not present
+    const undirected = new Map();
+    for (const [src, neighbors] of adjacency) {
+        if (!undirected.has(src))
+            undirected.set(src, new Map());
+        const srcMap = undirected.get(src);
+        for (const [dst, weight] of neighbors) {
+            srcMap.set(dst, (srcMap.get(dst) ?? 0) + weight);
+            // Add reverse edge
+            if (!undirected.has(dst))
+                undirected.set(dst, new Map());
+            const dstMap = undirected.get(dst);
+            dstMap.set(src, (dstMap.get(src) ?? 0) + weight);
+        }
+    }
+    const files = [...filePaths];
+    const N = files.length;
+    if (N === 0) {
+        return { communities: new Map(), communityCount: 0, modularity: 0 };
+    }
+    // Map file → index for fast access
+    const fileToIdx = new Map();
+    for (let i = 0; i < N; i++) {
+        fileToIdx.set(files[i], i);
+    }
+    // Initialize: each node in its own community
+    let communities = new Map();
+    for (let i = 0; i < N; i++) {
+        communities.set(files[i], i);
+    }
+    // Compute total edge weight (m) for modularity normalization
+    let m2 = 0; // 2 × m (undirected, each edge counted twice)
+    for (const [, neighbors] of undirected) {
+        for (const weight of neighbors.values()) {
+            m2 += weight;
+        }
+    }
+    if (m2 === 0) {
+        return { communities, communityCount: N, modularity: 0 };
+    }
+    // Compute weighted degree for each node
+    const weightedDegree = new Map();
+    for (const [node, neighbors] of undirected) {
+        let deg = 0;
+        for (const w of neighbors.values())
+            deg += w;
+        weightedDegree.set(node, deg);
+    }
+    const MODULARITY_THRESHOLD = 1e-5;
+    let currentModularity = computeModularity(undirected, communities, m2, weightedDegree);
+    let improved = true;
+    // Louvain iteration
+    while (improved) {
+        improved = false;
+        // Phase 1: Move nodes between communities
+        let phaseImproved = true;
+        while (phaseImproved) {
+            phaseImproved = false;
+            for (const node of files) {
+                const nodeComm = communities.get(node);
+                // Compute best community for this node
+                const neighborComms = new Map(); // commId → edgeWeightSum
+                const nodeNeighbors = undirected.get(node);
+                if (nodeNeighbors) {
+                    for (const [neighbor, weight] of nodeNeighbors) {
+                        const neighborComm = communities.get(neighbor);
+                        if (neighborComm !== undefined) {
+                            neighborComms.set(neighborComm, (neighborComms.get(neighborComm) ?? 0) + weight);
+                        }
+                    }
+                }
+                // Compute current modularity contribution of node to its community
+                const ki = weightedDegree.get(node) ?? 0;
+                // Total weight of edges from node to community
+                const toSelf = neighborComms.get(nodeComm) ?? 0;
+                // Compute sigma_tot for current community
+                let sigmaTotCurrent = 0;
+                for (const [n, comm] of communities) {
+                    if (comm === nodeComm && n !== node) {
+                        sigmaTotCurrent += weightedDegree.get(n) ?? 0;
+                    }
+                }
+                // Remove node from its community and check gain
+                let bestComm = nodeComm;
+                let bestGain = 0;
+                for (const [comm, kiIn] of neighborComms) {
+                    if (comm === nodeComm)
+                        continue;
+                    // Compute sigma_tot for candidate community
+                    let sigmaTotComm = 0;
+                    for (const [n, c] of communities) {
+                        if (c === comm) {
+                            sigmaTotComm += weightedDegree.get(n) ?? 0;
+                        }
+                    }
+                    // Modularity gain of moving node to comm
+                    const gain = (kiIn / (m2 / 2)) -
+                        ((sigmaTotComm * ki) / (m2 * m2 / 4)) -
+                        (toSelf / (m2 / 2)) +
+                        ((sigmaTotCurrent * ki) / (m2 * m2 / 4));
+                    if (gain > bestGain) {
+                        bestGain = gain;
+                        bestComm = comm;
+                    }
+                }
+                if (bestComm !== nodeComm) {
+                    communities.set(node, bestComm);
+                    phaseImproved = true;
+                    improved = true;
+                }
+            }
+        }
+        // Phase 2: Aggregate communities into super-graph
+        // Count communities
+        const commSet = new Set(communities.values());
+        const newCommCount = commSet.size;
+        // Map old comm → new index
+        const commToNew = new Map();
+        let idx = 0;
+        for (const c of commSet) {
+            commToNew.set(c, idx++);
+        }
+        // Build super-graph adjacency
+        const superAdj = new Map();
+        for (const [node, neighbors] of undirected) {
+            const srcComm = commToNew.get(communities.get(node));
+            const srcKey = String(srcComm);
+            if (!superAdj.has(srcKey))
+                superAdj.set(srcKey, new Map());
+            for (const [neighbor, weight] of neighbors) {
+                const dstComm = commToNew.get(communities.get(neighbor));
+                if (dstComm === undefined)
+                    continue;
+                const dstKey = String(dstComm);
+                if (srcKey === dstKey)
+                    continue; // Self-loop
+                const inner = superAdj.get(srcKey);
+                inner.set(dstKey, (inner.get(dstKey) ?? 0) + weight);
+            }
+        }
+        // If no aggregation happened (communities stayed same), break
+        if (newCommCount === N)
+            break;
+        // Update for next iteration: remap communities
+        const newCommunities = new Map();
+        for (const node of files) {
+            newCommunities.set(node, commToNew.get(communities.get(node)));
+        }
+        communities = newCommunities;
+        // Recompute modularity
+        const newModularity = computeModularity(undirected, communities, m2, weightedDegree);
+        if (newModularity - currentModularity < MODULARITY_THRESHOLD) {
+            break;
+        }
+        currentModularity = newModularity;
+    }
+    return {
+        communities,
+        communityCount: new Set(communities.values()).size,
+        modularity: currentModularity,
+    };
+}
+/**
+ * Compute modularity Q for a given community assignment.
+ */
+function computeModularity(adjacency, communities, m2, weightedDegree) {
+    let Q = 0;
+    for (const [node, neighbors] of adjacency) {
+        const commI = communities.get(node);
+        if (commI === undefined)
+            continue;
+        const ki = weightedDegree.get(node) ?? 0;
+        for (const [neighbor, weight] of neighbors) {
+            const commJ = communities.get(neighbor);
+            if (commJ === undefined)
+                continue;
+            if (commI === commJ) {
+                const kj = weightedDegree.get(neighbor) ?? 0;
+                Q += weight - (ki * kj) / m2;
+            }
+        }
+    }
+    return Q / m2;
+}
+// ── R3 — Directory purity ───────────────────────────────────────────────
+const COMMUNITY_MIN_FILES = 5;
+/**
+ * Compute directory purity against detected communities.
+ *
+ * For each directory, compute: share of its files in the plurality community.
+ * Detects split candidates (directories spanning ≥2 communities) and
+ * merge candidates (one community dominating ≥2 directories).
+ */
+export function computeDirectoryPurity(communities, filePaths) {
+    // Group files by directory
+    const dirFiles = new Map();
+    for (const fp of filePaths) {
+        const dir = dirname(fp);
+        if (!dirFiles.has(dir))
+            dirFiles.set(dir, []);
+        dirFiles.get(dir).push(fp);
+    }
+    const directoryPurities = [];
+    const splitCandidates = [];
+    const mergeCandidates = [];
+    // Per-directory purity
+    for (const [dir, files] of dirFiles) {
+        if (files.length === 0)
+            continue;
+        const commCounts = new Map();
+        for (const fp of files) {
+            const comm = communities.get(fp);
+            if (comm !== undefined) {
+                commCounts.set(comm, (commCounts.get(comm) ?? 0) + 1);
+            }
+        }
+        if (commCounts.size === 0)
+            continue;
+        // Find plurality community
+        let pluralityComm = -1;
+        let pluralityCount = 0;
+        for (const [comm, count] of commCounts) {
+            if (count > pluralityCount) {
+                pluralityCount = count;
+                pluralityComm = comm;
+            }
+        }
+        const purity = pluralityCount / files.length;
+        directoryPurities.push({
+            directory: dir,
+            totalFiles: files.length,
+            pluralityCommunity: pluralityComm,
+            pluralityCount,
+            purity,
+        });
+        // Split candidate: directory spanning ≥2 communities with ≥COMMUNITY_MIN_FILES each
+        const significantComms = [];
+        for (const [comm, count] of commCounts) {
+            if (count >= COMMUNITY_MIN_FILES && comm !== pluralityComm) {
+                significantComms.push({ comm, count });
+            }
+        }
+        if (significantComms.length >= 1 && pluralityCount >= COMMUNITY_MIN_FILES) {
+            splitCandidates.push({
+                directory: dir,
+                communities: [pluralityComm, ...significantComms.map(s => s.comm)],
+                fileCounts: [pluralityCount, ...significantComms.map(s => s.count)],
+            });
+        }
+    }
+    // Merge candidates: one community dominating ≥2 directories
+    const commToDirs = new Map();
+    for (const dp of directoryPurities) {
+        const comm = dp.pluralityCommunity;
+        if (!commToDirs.has(comm))
+            commToDirs.set(comm, []);
+        commToDirs.get(comm).push({ dir: dp.directory, count: dp.pluralityCount });
+    }
+    for (const [, entries] of commToDirs) {
+        if (entries.length >= 2) {
+            const dirs = entries.map(e => e.dir);
+            const maxCount = Math.max(...entries.map(e => e.count));
+            mergeCandidates.push({
+                directories: dirs,
+                community: directoryPurities.find(dp => dp.directory === dirs[0]).pluralityCommunity,
+                fileCount: maxCount,
+            });
+        }
+    }
+    // Agreement score: mean purity weighted by directory file count
+    let totalWeightedPurity = 0;
+    let totalFiles = 0;
+    for (const dp of directoryPurities) {
+        totalWeightedPurity += dp.purity * dp.totalFiles;
+        totalFiles += dp.totalFiles;
+    }
+    const agreementScore = totalFiles > 0 ? totalWeightedPurity / totalFiles : 0;
+    return { directoryPurities, splitCandidates, mergeCandidates, agreementScore };
+}
+function dirname(fp) {
+    const parts = fp.replace(/\\/g, '/').split('/');
+    parts.pop();
+    return parts.join('/');
+}
+// ── R4 — Martin instability & abstractness metrics ──────────────────────
+/**
+ * Compute Martin metrics per directory (treated as package).
+ *
+ * Ce = efferent couplings: distinct directories this directory imports from
+ * Ca = afferent couplings: distinct directories that import this directory
+ * I  = Ce / (Ca + Ce) — instability (0 if both zero)
+ * A  = abstractness: exported type/interface declarations ÷ total exported symbols
+ * D  = |A + I − 1| — distance from main sequence
+ *
+ * IMPORTANT: Abstractness computation uses an AST scan for export type/interface
+ * declarations because the `functions` table does not index type/interface entities.
+ * Uses a lightweight file-content scan.
+ */
+export function computeMartinMetrics(db, importGraph) {
+    // Collect all directories from filePaths
+    const dirSet = new Set();
+    for (const fp of importGraph.filePaths) {
+        dirSet.add(dirname(fp));
+    }
+    const directories = [...dirSet];
+    // Build directory-level adjacency: dir → Set<imported dir>
+    const dirImports = new Map();
+    for (const [srcFile, neighbors] of importGraph.adjacency) {
+        const srcDir = dirname(srcFile);
+        if (!dirImports.has(srcDir))
+            dirImports.set(srcDir, new Set());
+        for (const dstFile of neighbors.keys()) {
+            const dstDir = dirname(dstFile);
+            if (dstDir !== srcDir) {
+                dirImports.get(srcDir).add(dstDir);
+            }
+        }
+    }
+    // Compute Ca (reverse: who imports each directory)
+    const dirImportedBy = new Map();
+    for (const [srcDir, importedDirs] of dirImports) {
+        for (const dstDir of importedDirs) {
+            if (!dirImportedBy.has(dstDir))
+                dirImportedBy.set(dstDir, new Set());
+            dirImportedBy.get(dstDir).add(srcDir);
+        }
+    }
+    // Count exported symbols per directory: total exported functions + type/interface declarations
+    // For abstractness: count type/interface declarations from file-content scan
+    const dirExported = new Map();
+    const dirAbstract = new Map();
+    // Get all exported function counts from DB
+    const exportedRows = db.prepare('SELECT file_path, COUNT(*) as cnt FROM functions WHERE is_exported = 1 GROUP BY file_path').all();
+    for (const row of exportedRows) {
+        const dir = dirname(row.file_path);
+        dirExported.set(dir, (dirExported.get(dir) ?? 0) + row.cnt);
+    }
+    // Scan for exported type/interface declarations per directory
+    // This is a lightweight content-based scan since entity_type doesn't include type/interface
+    const filePaths = [...importGraph.filePaths];
+    const filesPerDir = new Map();
+    for (const fp of filePaths) {
+        const dir = dirname(fp);
+        if (!filesPerDir.has(dir))
+            filesPerDir.set(dir, []);
+        filesPerDir.get(dir).push(fp);
+    }
+    for (const [dir, files] of filesPerDir) {
+        let abstractCount = 0;
+        for (const fp of files) {
+            try {
+                const content = require('fs').readFileSync(fp, 'utf-8');
+                // Count exported type/interface declarations
+                const typeMatches = content.match(/export\s+(type|interface)\s+\w+/g);
+                if (typeMatches) {
+                    abstractCount += typeMatches.length;
+                }
+            }
+            catch {
+                // Skip unreadable files
+            }
+        }
+        dirAbstract.set(dir, abstractCount);
+    }
+    // Build Martin entries
+    const entries = [];
+    for (const dir of directories) {
+        const imports = dirImports.get(dir);
+        const importedBy = dirImportedBy.get(dir);
+        const ce = imports?.size ?? 0;
+        const ca = importedBy?.size ?? 0;
+        const i = ca + ce > 0 ? ce / (ca + ce) : 0;
+        const totalExported = dirExported.get(dir) ?? 0;
+        const abstractCount = dirAbstract.get(dir) ?? 0;
+        // A = exported abstract entities / total exported symbols
+        const a = totalExported + abstractCount > 0
+            ? abstractCount / (totalExported + abstractCount)
+            : 0;
+        const d = Math.abs(a + i - 1);
+        entries.push({
+            directory: dir,
+            ce,
+            ca,
+            instability: i,
+            abstractness: a,
+            distanceFromMain: d,
+        });
+    }
+    // Sort by distance from main sequence descending
+    entries.sort((a, b) => b.distanceFromMain - a.distanceFromMain);
+    return entries;
+}
+//# sourceMappingURL=importGraph.js.map

package/dist/graph/importGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"importGraph.js","sourceRoot":"","sources":["../../src/graph/importGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AA8BH,2EAA2E;AAE3E;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,EAAqB;IACpD,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IAEzD,2CAA2C;IAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CACtB,0CAA0C,CAC3C,CAAC,GAAG,EAAkC,CAAC;IAExC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;IAED,qEAAqE;IACrE,0EAA0E;IAC1E,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;GAOvB,CAAC,CAAC,GAAG,EAAwD,CAAC;IAE/D,iEAAiE;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+B,CAAC;IAE3D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACtC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;QAChD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,uDAAuD;IACvD,0CAA0C;IAC1C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEpD,4EAA4E;IAC5E,yBAAyB;IACzB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAChC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,oCAAoC;IACpC,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC/C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACnC,0CAA0C;YAC1C,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;YAE5E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,MAAM,KAAK,UAAU;oBAAE,SAAS,CAAC,kBAAkB;gBAEvD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC/B,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACvC,CAAC;gBACD,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;AAClC,CAAC;AAED,SAAS,aAAa,CAAC,EAAU;IAC/B,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACnD,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACtC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AACzD,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,iBAAiB,CACxB,GAAW,EACX,SAAsB,EACtB,YAAsC,EACtC,UAAkB;IAElB,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,oCAAoC;IACpC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,8CAA8C;IAC9C,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,4CAA4C;QAC5C,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACxE,8BAA8B;QAC9B,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,CAAC,EAAE,CAAC;YAChF,MAAM,SAAS,GAAG,QAAQ,GAAG,GAAG,CAAC;YACjC,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,OAAO,CAAC,SAAS,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,EAAE,CAAC,UAAU,CAAC,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,KAAK,QAAQ,EAAE,CAAC;gBACrD,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,6EAA6E;IAC7E,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE/C,0CAA0C;IAC1C,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC9C,IAAI,UAAU,EAAE,CAAC;QACf,wDAAwD;QACxD,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;gBACjE,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,iEAAiE;QACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,2EAA2E;IAC3E,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnD,IAAI,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1D,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,EAAE,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CAAC,EAAqB;IAC5D,MAAM,EAAE,SAAS,EAAE,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;IAE3C,MAAM,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;QAC9B,EAAE,CAAC,OAAO,CAAC,qDAAqD,CAAC,CAAC,GAAG,EAAE,CAAC;QAExE,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;kCAC4B,CAC7B,CAAC;QAEF,KAAK,MAAM,CAAC,UAAU,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;YAChD,KAAK,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC7C,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAC;IACH,GAAG,EAAE,CAAC;AACR,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,EAAqB;IAC7D,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+B,CAAC;IACzD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB,oFAAoF,CACrF,CAAC,GAAG,EAAuE,CAAC;IAE7E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACjE,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;AAClC,CAAC;AAED,2EAA2E;AAE3E;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,SAA2C,EAC3C,SAAsB;IAEtB,uCAAuC;IACvC,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA+B,CAAC;IAE1D,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;QACzC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAEpC,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YAEjD,mBAAmB;YACnB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACzD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACpC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACtE,CAAC;IAED,mCAAmC;IACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,6CAA6C;IAC7C,IAAI,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,6DAA6D;IAC7D,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,8CAA8C;IAC1D,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,EAAE,IAAI,MAAM,CAAC;QACf,CAAC;IACH,CAAC;IAED,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACb,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IAC3D,CAAC;IAED,wCAAwC;IACxC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC;QAC7C,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,oBAAoB,GAAG,IAAI,CAAC;IAClC,IAAI,iBAAiB,GAAG,iBAAiB,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,cAAc,CAAC,CAAC;IACvF,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,oBAAoB;IACpB,OAAO,QAAQ,EAAE,CAAC;QAChB,QAAQ,GAAG,KAAK,CAAC;QAEjB,0CAA0C;QAC1C,IAAI,aAAa,GAAG,IAAI,CAAC;QACzB,OAAO,aAAa,EAAE,CAAC;YACrB,aAAa,GAAG,KAAK,CAAC;YAEtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gBAExC,uCAAuC;gBACvC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,yBAAyB;gBAC1E,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC3C,IAAI,aAAa,EAAE,CAAC;oBAClB,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;wBAC/C,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBAC/C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;4BAC/B,aAAa,CAAC,GAAG,CACf,YAAY,EACZ,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAChD,CAAC;wBACJ,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,mEAAmE;gBACnE,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEzC,+CAA+C;gBAC/C,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAEhD,0CAA0C;gBAC1C,IAAI,eAAe,GAAG,CAAC,CAAC;gBACxB,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;oBACpC,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;wBACpC,eAAe,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAChD,CAAC;gBACH,CAAC;gBAED,gDAAgD;gBAChD,IAAI,QAAQ,GAAG,QAAQ,CAAC;gBACxB,IAAI,QAAQ,GAAG,CAAC,CAAC;gBAEjB,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC;oBACzC,IAAI,IAAI,KAAK,QAAQ;wBAAE,SAAS;oBAEhC,4CAA4C;oBAC5C,IAAI,YAAY,GAAG,CAAC,CAAC;oBACrB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,WAAW,EAAE,CAAC;wBACjC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;4BACf,YAAY,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;wBAC7C,CAAC;oBACH,CAAC;oBAED,yCAAyC;oBACzC,MAAM,IAAI,GACR,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;wBACjB,CAAC,CAAC,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;wBACrC,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;wBACnB,CAAC,CAAC,eAAe,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;oBAE3C,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;wBACpB,QAAQ,GAAG,IAAI,CAAC;wBAChB,QAAQ,GAAG,IAAI,CAAC;oBAClB,CAAC;gBACH,CAAC;gBAED,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBAC1B,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oBAChC,aAAa,GAAG,IAAI,CAAC;oBACrB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,oBAAoB;QACpB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;QAElC,2BAA2B;QAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1B,CAAC;QAED,8BAA8B;QAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA+B,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAE,CAAE,CAAC;YACvD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAE/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAE3D,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC;gBAC1D,IAAI,OAAO,KAAK,SAAS;oBAAE,SAAS;gBACpC,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,MAAM;oBAAE,SAAS,CAAC,YAAY;gBAE7C,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBACpC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,IAAI,YAAY,KAAK,CAAC;YAAE,MAAM;QAE9B,+CAA+C;QAC/C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAE,CAAE,CAAC,CAAC;QACnE,CAAC;QACD,WAAW,GAAG,cAAc,CAAC;QAE7B,uBAAuB;QACvB,MAAM,aAAa,GAAG,iBAAiB,CAAC,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,cAAc,CAAC,CAAC;QACrF,IAAI,aAAa,GAAG,iBAAiB,GAAG,oBAAoB,EAAE,CAAC;YAC7D,MAAM;QACR,CAAC;QACD,iBAAiB,GAAG,aAAa,CAAC;IACpC,CAAC;IAED,OAAO;QACL,WAAW;QACX,cAAc,EAAE,IAAI,GAAG,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI;QAClD,UAAU,EAAE,iBAAiB;KAC9B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CACxB,SAA2C,EAC3C,WAAgC,EAChC,EAAU,EACV,cAAmC;IAEnC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEzC,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC3C,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACxC,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAS;YAElC,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;gBACpB,MAAM,EAAE,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC7C,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,EAAE,CAAC;AAChB,CAAC;AAED,2EAA2E;AAE3E,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B;;;;;;GAMG;AACH,MAAM,UAAU,sBAAsB,CACpC,WAAgC,EAChC,SAAsB;IAEtB,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC9C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,iBAAiB,GAAsB,EAAE,CAAC;IAChD,MAAM,eAAe,GAAoC,EAAE,CAAC;IAC5D,MAAM,eAAe,GAAoC,EAAE,CAAC;IAE5D,uBAAuB;IACvB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEjC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAEpC,2BAA2B;QAC3B,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;QACvB,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;YACvC,IAAI,KAAK,GAAG,cAAc,EAAE,CAAC;gBAC3B,cAAc,GAAG,KAAK,CAAC;gBACvB,aAAa,GAAG,IAAI,CAAC;YACvB,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC;QAE7C,iBAAiB,CAAC,IAAI,CAAC;YACrB,SAAS,EAAE,GAAG;YACd,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,kBAAkB,EAAE,aAAa;YACjC,cAAc;YACd,MAAM;SACP,CAAC,CAAC;QAEH,oFAAoF;QACpF,MAAM,gBAAgB,GAA2C,EAAE,CAAC;QACpE,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;YACvC,IAAI,KAAK,IAAI,mBAAmB,IAAI,IAAI,KAAK,aAAa,EAAE,CAAC;gBAC3D,gBAAgB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,IAAI,gBAAgB,CAAC,MAAM,IAAI,CAAC,IAAI,cAAc,IAAI,mBAAmB,EAAE,CAAC;YAC1E,eAAe,CAAC,IAAI,CAAC;gBACnB,SAAS,EAAE,GAAG;gBACd,WAAW,EAAE,CAAC,aAAa,EAAE,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAClE,UAAU,EAAE,CAAC,cAAc,EAAE,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACpE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiD,CAAC;IAC5E,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,EAAE,CAAC,kBAAkB,CAAC;QACnC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACpD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,UAAU,EAAE,CAAC;QACrC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACxD,eAAe,CAAC,IAAI,CAAC;gBACnB,WAAW,EAAE,IAAI;gBACjB,SAAS,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,kBAAkB;gBACrF,SAAS,EAAE,QAAQ;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,mBAAmB,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,UAAU,CAAC;QACjD,UAAU,IAAI,EAAE,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,MAAM,cAAc,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7E,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,eAAe,EAAE,cAAc,EAAE,CAAC;AACjF,CAAC;AAED,SAAS,OAAO,CAAC,EAAU;IACzB,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChD,KAAK,CAAC,GAAG,EAAE,CAAC;IACZ,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,2EAA2E;AAE3E;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAClC,EAAqB,EACrB,WAAwB;IAExB,yCAAyC;IACzC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,EAAE,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAEhC,2DAA2D;IAC3D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,KAAK,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAE/D,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;YAChC,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;gBACtB,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IACrD,KAAK,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,IAAI,UAAU,EAAE,CAAC;QAChD,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACrE,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,+FAA+F;IAC/F,6EAA6E;IAC7E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,2CAA2C;IAC3C,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAC7B,2FAA2F,CAC5F,CAAC,GAAG,EAA+C,CAAC;IAErD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACnC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9D,CAAC;IAED,8DAA8D;IAC9D,4FAA4F;IAC5F,MAAM,SAAS,GAAG,CAAC,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAoB,CAAC;IAChD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACpD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;QACvC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACxD,6CAA6C;gBAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,kCAAkC,CAAC,CAAC;gBACtE,IAAI,WAAW,EAAE,CAAC;oBAChB,aAAa,IAAI,WAAW,CAAC,MAAM,CAAC;gBACtC,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,wBAAwB;YAC1B,CAAC;QACH,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACtC,CAAC;IAED,uBAAuB;IACvB,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAE1C,MAAM,EAAE,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,UAAU,EAAE,IAAI,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3C,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEhD,0DAA0D;QAC1D,MAAM,CAAC,GAAG,aAAa,GAAG,aAAa,GAAG,CAAC;YACzC,CAAC,CAAC,aAAa,GAAG,CAAC,aAAa,GAAG,aAAa,CAAC;YACjD,CAAC,CAAC,CAAC,CAAC;QAEN,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAE9B,OAAO,CAAC,IAAI,CAAC;YACX,SAAS,EAAE,GAAG;YACd,EAAE;YACF,EAAE;YACF,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;YACf,gBAAgB,EAAE,CAAC;SACpB,CAAC,CAAC;IACL,CAAC;IAED,iDAAiD;IACjD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAEhE,OAAO,OAAO,CAAC;AACjB,CAAC"}