codesift-mcp 0.1.0 → 0.2.1

package/dist/tools/boundary-tools.js

@@ -0,0 +1,62 @@
+import { getCodeIndex } from "./index-tools.js";
+import { collectImportEdges } from "../utils/import-graph.js";
+/**
+ * Check architecture boundary rules against the import graph.
+ *
+ * Rules use path substring matching:
+ *   { from: "src/domain", cannot_import: ["src/infrastructure", "src/api"] }
+ *   { from: "src/api", can_only_import: ["src/domain", "src/application"] }
+ *
+ * `cannot_import` — files matching `from` must NOT import files matching any listed pattern.
+ * `can_only_import` — files matching `from` may ONLY import files matching one of the listed patterns.
+ */
+export async function checkBoundaries(repo, rules, options) {
+    if (!rules.length) {
+        return { violations: [], edges_checked: 0, rules_applied: 0, passed: true };
+    }
+    const index = await getCodeIndex(repo);
+    if (!index)
+        throw new Error(`Repository not found: ${repo}`);
+    const edges = await collectImportEdges(index);
+    const violations = [];
+    let edgesChecked = 0;
+    for (const edge of edges) {
+        if (options?.file_pattern && !edge.from.includes(options.file_pattern))
+            continue;
+        edgesChecked++;
+        for (const rule of rules) {
+            if (!edge.from.includes(rule.from))
+                continue;
+            if (rule.cannot_import) {
+                for (const forbidden of rule.cannot_import) {
+                    if (edge.to.includes(forbidden)) {
+                        violations.push({
+                            file: edge.from,
+                            imports: edge.to,
+                            rule_from: rule.from,
+                            reason: `"${rule.from}" cannot import "${forbidden}"`,
+                        });
+                    }
+                }
+            }
+            if (rule.can_only_import) {
+                const allowed = rule.can_only_import.some((pattern) => edge.to.includes(pattern));
+                if (!allowed) {
+                    violations.push({
+                        file: edge.from,
+                        imports: edge.to,
+                        rule_from: rule.from,
+                        reason: `"${rule.from}" can only import [${rule.can_only_import.join(", ")}]`,
+                    });
+                }
+            }
+        }
+    }
+    return {
+        violations,
+        edges_checked: edgesChecked,
+        rules_applied: rules.length,
+        passed: violations.length === 0,
+    };
+}
+//# sourceMappingURL=boundary-tools.js.map

package/dist/tools/boundary-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"boundary-tools.js","sourceRoot":"","sources":["../../src/tools/boundary-tools.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAsB9D;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,IAAY,EACZ,KAAqB,EACrB,OAA+C;IAE/C,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAC9E,CAAC;IAED,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,IAAI,EAAE,CAAC,CAAC;IAE7D,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAE9C,MAAM,UAAU,GAAwB,EAAE,CAAC;IAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,OAAO,EAAE,YAAY,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC;YAAE,SAAS;QACjF,YAAY,EAAE,CAAC;QAEf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,SAAS;YAE7C,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;oBAC3C,IAAI,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;wBAChC,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,IAAI,CAAC,IAAI;4BACf,OAAO,EAAE,IAAI,CAAC,EAAE;4BAChB,SAAS,EAAE,IAAI,CAAC,IAAI;4BACpB,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,oBAAoB,SAAS,GAAG;yBACtD,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;gBACzB,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;gBAClF,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,UAAU,CAAC,IAAI,CAAC;wBACd,IAAI,EAAE,IAAI,CAAC,IAAI;wBACf,OAAO,EAAE,IAAI,CAAC,EAAE;wBAChB,SAAS,EAAE,IAAI,CAAC,IAAI;wBACpB,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,sBAAsB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;qBAC9E,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,UAAU;QACV,aAAa,EAAE,YAAY;QAC3B,aAAa,EAAE,KAAK,CAAC,MAAM;QAC3B,MAAM,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC;KAChC,CAAC;AACJ,CAAC"}

package/dist/tools/clone-tools.d.ts

@@ -0,0 +1,35 @@
+import type { SymbolKind } from "../types.js";
+export interface CodeClone {
+    symbol_a: {
+        name: string;
+        kind: SymbolKind;
+        file: string;
+        start_line: number;
+        end_line: number;
+    };
+    symbol_b: {
+        name: string;
+        kind: SymbolKind;
+        file: string;
+        start_line: number;
+        end_line: number;
+    };
+    similarity: number;
+    shared_lines: number;
+}
+export interface CloneResult {
+    clones: CodeClone[];
+    scanned_symbols: number;
+    threshold: number;
+}
+/**
+ * Find code clones: pairs of symbols with similar normalized source.
+ * Uses hash-based bucketing for O(n) average case instead of O(n²) all-pairs.
+ */
+export declare function findClones(repo: string, options?: {
+    file_pattern?: string | undefined;
+    min_similarity?: number | undefined;
+    min_lines?: number | undefined;
+    include_tests?: boolean | undefined;
+}): Promise<CloneResult>;
+//# sourceMappingURL=clone-tools.d.ts.map

package/dist/tools/clone-tools.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone-tools.d.ts","sourceRoot":"","sources":["../../src/tools/clone-tools.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAQ9C,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,UAAU,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACjG,QAAQ,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,UAAU,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACjG,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;CACnB;AA2LD;;;GAGG;AACH,wBAAsB,UAAU,CAC9B,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE;IACR,YAAY,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,cAAc,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/B,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;CACrC,GACA,OAAO,CAAC,WAAW,CAAC,CAuBtB"}

package/dist/tools/clone-tools.js

@@ -0,0 +1,181 @@
+import { getCodeIndex } from "./index-tools.js";
+import { isTestFileStrict as isTestFile } from "../utils/test-file.js";
+const MIN_CLONE_LINES = 10;
+const MAX_CLONES = 50;
+const DEFAULT_MIN_SIMILARITY = 0.7;
+/** Max line-count ratio for near-match comparison (30% tolerance) */
+const MAX_LINE_RATIO = 1.3;
+const ANALYZABLE_KINDS = new Set([
+    "function", "method", "class",
+]);
+/**
+ * Normalize source for comparison: strip whitespace, comments, string literals.
+ * Returns array of normalized non-empty lines.
+ */
+function normalizeSource(source) {
+    return source
+        .split("\n")
+        .map((line) => {
+        let l = line.trim();
+        // Strip single-line comments
+        const commentIdx = l.indexOf("//");
+        if (commentIdx >= 0)
+            l = l.slice(0, commentIdx).trim();
+        // Normalize whitespace
+        l = l.replace(/\s+/g, " ");
+        return l;
+    })
+        .filter((l) => l.length > 0 && l !== "{" && l !== "}" && l !== ");");
+}
+/**
+ * Simple fingerprint: hash of normalized lines joined.
+ * Uses djb2 for speed (not crypto).
+ */
+function hashLines(lines) {
+    let hash = 5381;
+    for (const line of lines) {
+        for (let i = 0; i < line.length; i++) {
+            hash = ((hash << 5) + hash + line.charCodeAt(i)) | 0;
+        }
+    }
+    return hash;
+}
+/**
+ * Compute line-level similarity between two normalized sources.
+ * Uses set intersection of lines (bag-of-lines similarity).
+ */
+function computeSimilarity(linesA, linesB) {
+    const setA = new Set(linesA);
+    const setB = new Set(linesB);
+    let shared = 0;
+    for (const line of setA) {
+        if (setB.has(line))
+            shared++;
+    }
+    const total = Math.max(setA.size, setB.size);
+    return {
+        similarity: total > 0 ? Math.round((shared / total) * 100) / 100 : 0,
+        sharedLines: shared,
+    };
+}
+/** Build a CodeClone from two entries and their similarity result */
+function buildClone(a, b, similarity, sharedLines) {
+    return {
+        symbol_a: { name: a.name, kind: a.kind, file: a.file, start_line: a.start_line, end_line: a.end_line },
+        symbol_b: { name: b.name, kind: b.kind, file: b.file, start_line: b.start_line, end_line: b.end_line },
+        similarity,
+        shared_lines: sharedLines,
+    };
+}
+/** Filter, normalize, and hash symbols into clone-comparable entries */
+function prepareEntries(symbols, minLines, includeTests, filePattern) {
+    const entries = [];
+    for (const sym of symbols) {
+        if (!ANALYZABLE_KINDS.has(sym.kind))
+            continue;
+        if (!sym.source)
+            continue;
+        if (!includeTests && isTestFile(sym.file))
+            continue;
+        if (filePattern && !sym.file.includes(filePattern))
+            continue;
+        const lines = normalizeSource(sym.source);
+        if (lines.length < minLines)
+            continue;
+        entries.push({
+            name: sym.name,
+            kind: sym.kind,
+            file: sym.file,
+            start_line: sym.start_line,
+            end_line: sym.end_line,
+            lines,
+            hash: hashLines(lines),
+        });
+    }
+    return entries;
+}
+/** Phase 1: Find exact hash matches via O(n) bucketing */
+function findExactMatches(entries, minSimilarity, minLines, maxClones) {
+    const clones = [];
+    const hashBuckets = new Map();
+    for (const entry of entries) {
+        const bucket = hashBuckets.get(entry.hash);
+        if (bucket)
+            bucket.push(entry);
+        else
+            hashBuckets.set(entry.hash, [entry]);
+    }
+    for (const bucket of hashBuckets.values()) {
+        if (bucket.length < 2)
+            continue;
+        for (let i = 0; i < bucket.length; i++) {
+            for (let j = i + 1; j < bucket.length; j++) {
+                if (clones.length >= maxClones)
+                    break;
+                const a = bucket[i];
+                const b = bucket[j];
+                if (a.file === b.file && a.start_line === b.start_line)
+                    continue;
+                const { similarity, sharedLines } = computeSimilarity(a.lines, b.lines);
+                if (similarity >= minSimilarity && sharedLines >= minLines) {
+                    clones.push(buildClone(a, b, similarity, sharedLines));
+                }
+            }
+        }
+    }
+    return clones;
+}
+/** Phase 2: Find near-matches by comparing entries with similar line counts */
+function findNearMatches(entries, existingClones, minSimilarity, minLines, maxClones) {
+    const clones = [];
+    const remaining = maxClones - existingClones.length;
+    if (remaining <= 0)
+        return clones;
+    const sorted = [...entries].sort((a, b) => a.lines.length - b.lines.length);
+    for (let i = 0; i < sorted.length && clones.length < remaining; i++) {
+        for (let j = i + 1; j < sorted.length && clones.length < remaining; j++) {
+            const a = sorted[i];
+            const b = sorted[j];
+            if (b.lines.length > a.lines.length * MAX_LINE_RATIO)
+                break;
+            if (a.hash === b.hash)
+                continue;
+            if (a.file === b.file && a.start_line === b.start_line)
+                continue;
+            const alreadyFound = existingClones.some((c) => (c.symbol_a.file === a.file && c.symbol_a.start_line === a.start_line &&
+                c.symbol_b.file === b.file && c.symbol_b.start_line === b.start_line));
+            if (alreadyFound)
+                continue;
+            const { similarity, sharedLines } = computeSimilarity(a.lines, b.lines);
+            if (similarity >= minSimilarity && sharedLines >= minLines) {
+                clones.push(buildClone(a, b, similarity, sharedLines));
+            }
+        }
+    }
+    return clones;
+}
+/**
+ * Find code clones: pairs of symbols with similar normalized source.
+ * Uses hash-based bucketing for O(n) average case instead of O(n²) all-pairs.
+ */
+export async function findClones(repo, options) {
+    const index = await getCodeIndex(repo);
+    if (!index) {
+        throw new Error(`Repository "${repo}" not found. Index it first with index_folder.`);
+    }
+    const minSimilarity = options?.min_similarity ?? DEFAULT_MIN_SIMILARITY;
+    const minLines = options?.min_lines ?? MIN_CLONE_LINES;
+    const includeTests = options?.include_tests ?? false;
+    const filePattern = options?.file_pattern;
+    const entries = prepareEntries(index.symbols, minLines, includeTests, filePattern);
+    const exactClones = findExactMatches(entries, minSimilarity, minLines, MAX_CLONES);
+    const nearClones = findNearMatches(entries, exactClones, minSimilarity, minLines, MAX_CLONES);
+    const allClones = [...exactClones, ...nearClones];
+    allClones.sort((a, b) => b.similarity - a.similarity);
+    return {
+        clones: allClones.slice(0, MAX_CLONES),
+        scanned_symbols: entries.length,
+        threshold: minSimilarity,
+    };
+}
+//# sourceMappingURL=clone-tools.js.map

package/dist/tools/clone-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clone-tools.js","sourceRoot":"","sources":["../../src/tools/clone-tools.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,gBAAgB,IAAI,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAGvE,MAAM,eAAe,GAAG,EAAE,CAAC;AAC3B,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,MAAM,sBAAsB,GAAG,GAAG,CAAC;AACnC,qEAAqE;AACrE,MAAM,cAAc,GAAG,GAAG,CAAC;AAyB3B,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAa;IAC3C,UAAU,EAAE,QAAQ,EAAE,OAAO;CAC9B,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,eAAe,CAAC,MAAc;IACrC,OAAO,MAAM;SACV,KAAK,CAAC,IAAI,CAAC;SACX,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACZ,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACpB,6BAA6B;QAC7B,MAAM,UAAU,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC;YAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC;QACvD,uBAAuB;QACvB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;SACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;AACzE,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAe;IAChC,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,MAAgB,EAAE,MAAgB;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC7B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,EAAE,CAAC;IAC/B,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,OAAO;QACL,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACpE,WAAW,EAAE,MAAM;KACpB,CAAC;AACJ,CAAC;AAED,qEAAqE;AACrE,SAAS,UAAU,CACjB,CAAa,EACb,CAAa,EACb,UAAkB,EAClB,WAAmB;IAEnB,OAAO;QACL,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE;QACtG,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE;QACtG,UAAU;QACV,YAAY,EAAE,WAAW;KAC1B,CAAC;AACJ,CAAC;AAED,wEAAwE;AACxE,SAAS,cAAc,CACrB,OAAuH,EACvH,QAAgB,EAChB,YAAqB,EACrB,WAA+B;IAE/B,MAAM,OAAO,GAAiB,EAAE,CAAC;IAEjC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9C,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,SAAS;QAC1B,IAAI,CAAC,YAAY,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACpD,IAAI,WAAW,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;YAAE,SAAS;QAE7D,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ;YAAE,SAAS;QAEtC,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,KAAK;YACL,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC;SACvB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,0DAA0D;AAC1D,SAAS,gBAAgB,CACvB,OAAqB,EACrB,aAAqB,EACrB,QAAgB,EAChB,SAAiB;IAEjB,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;IAEpD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;YAC1B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;oBAAE,MAAM;gBACtC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;gBACrB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;oBAAE,SAAS;gBACjE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBACxE,IAAI,UAAU,IAAI,aAAa,IAAI,WAAW,IAAI,QAAQ,EAAE,CAAC;oBAC3D,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,SAAS,eAAe,CACtB,OAAqB,EACrB,cAA2B,EAC3B,aAAqB,EACrB,QAAgB,EAChB,SAAiB;IAEjB,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC;IACpD,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAElC,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAE5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACrB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACrB,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,cAAc;gBAAE,MAAM;YAC5D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;gBAAE,SAAS;YAChC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBAAE,SAAS;YAEjE,MAAM,YAAY,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7C,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBACpE,CAAC,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU,CAAC,CACvE,CAAC;YACF,IAAI,YAAY;gBAAE,SAAS;YAE3B,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,UAAU,IAAI,aAAa,IAAI,WAAW,IAAI,QAAQ,EAAE,CAAC;gBAC3D,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,IAAY,EACZ,OAKC;IAED,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,eAAe,IAAI,gDAAgD,CAAC,CAAC;IACvF,CAAC;IAED,MAAM,aAAa,GAAG,OAAO,EAAE,cAAc,IAAI,sBAAsB,CAAC;IACxE,MAAM,QAAQ,GAAG,OAAO,EAAE,SAAS,IAAI,eAAe,CAAC;IACvD,MAAM,YAAY,GAAG,OAAO,EAAE,aAAa,IAAI,KAAK,CAAC;IACrD,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,CAAC;IAE1C,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IACnF,MAAM,WAAW,GAAG,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IACnF,MAAM,UAAU,GAAG,eAAe,CAAC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IAE9F,MAAM,SAAS,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,UAAU,CAAC,CAAC;IAClD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAEtD,OAAO;QACL,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC;QACtC,eAAe,EAAE,OAAO,CAAC,MAAM;QAC/B,SAAS,EAAE,aAAa;KACzB,CAAC;AACJ,CAAC"}

package/dist/tools/community-tools.d.ts

@@ -0,0 +1,23 @@
+export interface Community {
+    id: number;
+    name: string;
+    files: string[];
+    symbol_count: number;
+    internal_edges: number;
+    external_edges: number;
+    cohesion: number;
+}
+export interface CommunityResult {
+    communities: Community[];
+    modularity: number;
+    total_files: number;
+    algorithm: "louvain";
+    resolution: number;
+}
+/**
+ * Detect code communities using Louvain algorithm on the import graph.
+ */
+export declare function detectCommunities(repo: string, focus?: string, resolution?: number, outputFormat?: "json" | "mermaid"): Promise<CommunityResult | {
+    mermaid: string;
+}>;
+//# sourceMappingURL=community-tools.d.ts.map

package/dist/tools/community-tools.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-tools.d.ts","sourceRoot":"","sources":["../../src/tools/community-tools.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,SAAS,EAAE,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,SAAS,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AA2ND;;GAEG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,MAAM,EACZ,KAAK,CAAC,EAAE,MAAM,EACd,UAAU,CAAC,EAAE,MAAM,EACnB,YAAY,CAAC,EAAE,MAAM,GAAG,SAAS,GAChC,OAAO,CAAC,eAAe,GAAG;IAAE,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,CA6FhD"}

package/dist/tools/community-tools.js

@@ -0,0 +1,297 @@
+/**
+ * Louvain community detection — discover code clusters from the import graph.
+ */
+import { getCodeIndex } from "./index-tools.js";
+import { collectImportEdges } from "../utils/import-graph.js";
+/**
+ * Louvain method for community detection on an undirected weighted graph.
+ * Returns mapping: node → community ID.
+ */
+function louvain(nodes, adj, resolution) {
+    const community = new Map();
+    const nodeSet = new Set(nodes);
+    // Init: each node in its own community
+    let nextId = 0;
+    for (const node of nodes) {
+        community.set(node, nextId++);
+    }
+    // Total edge weight
+    let totalWeight = 0;
+    for (const [, neighbors] of adj) {
+        for (const [, w] of neighbors)
+            totalWeight += w;
+    }
+    totalWeight /= 2; // Each edge counted twice
+    if (totalWeight === 0)
+        return community;
+    // Degree (sum of edge weights per node)
+    const degree = new Map();
+    for (const node of nodes) {
+        let d = 0;
+        const neighbors = adj.get(node);
+        if (neighbors)
+            for (const [, w] of neighbors)
+                d += w;
+        degree.set(node, d);
+    }
+    // Phase 1: Local moves
+    const MAX_PASSES = 20;
+    for (let pass = 0; pass < MAX_PASSES; pass++) {
+        let improved = false;
+        for (const node of nodes) {
+            if (!nodeSet.has(node))
+                continue;
+            const currentComm = community.get(node);
+            const ki = degree.get(node) ?? 0;
+            const neighbors = adj.get(node);
+            if (!neighbors)
+                continue;
+            // Calculate weight to each neighboring community
+            const commWeights = new Map();
+            for (const [neighbor, w] of neighbors) {
+                const nc = community.get(neighbor);
+                commWeights.set(nc, (commWeights.get(nc) ?? 0) + w);
+            }
+            // Sum of degrees in current community (excluding this node)
+            let sigmaCurrentWithout = 0;
+            for (const [n, c] of community) {
+                if (c === currentComm && n !== node)
+                    sigmaCurrentWithout += degree.get(n) ?? 0;
+            }
+            const weightToCurrentComm = commWeights.get(currentComm) ?? 0;
+            const removeCost = weightToCurrentComm - resolution * ki * sigmaCurrentWithout / (2 * totalWeight);
+            let bestComm = currentComm;
+            let bestGain = 0;
+            for (const [targetComm, weightToTarget] of commWeights) {
+                if (targetComm === currentComm)
+                    continue;
+                let sigmaTarget = 0;
+                for (const [n, c] of community) {
+                    if (c === targetComm)
+                        sigmaTarget += degree.get(n) ?? 0;
+                }
+                const gain = (weightToTarget - resolution * ki * sigmaTarget / (2 * totalWeight)) - removeCost;
+                if (gain > bestGain) {
+                    bestGain = gain;
+                    bestComm = targetComm;
+                }
+            }
+            if (bestComm !== currentComm) {
+                community.set(node, bestComm);
+                improved = true;
+            }
+        }
+        if (!improved)
+            break;
+    }
+    // Renumber communities to be contiguous (0, 1, 2, ...)
+    const commMap = new Map();
+    let nextComm = 0;
+    for (const [, c] of community) {
+        if (!commMap.has(c))
+            commMap.set(c, nextComm++);
+    }
+    for (const [node, c] of community) {
+        community.set(node, commMap.get(c));
+    }
+    return community;
+}
+/**
+ * Calculate modularity Q for a partition.
+ */
+function calculateModularity(community, adj) {
+    let totalWeight = 0;
+    for (const [, neighbors] of adj) {
+        for (const [, w] of neighbors)
+            totalWeight += w;
+    }
+    totalWeight /= 2;
+    if (totalWeight === 0)
+        return 0;
+    const degree = new Map();
+    for (const [node, neighbors] of adj) {
+        let d = 0;
+        for (const [, w] of neighbors)
+            d += w;
+        degree.set(node, d);
+    }
+    let Q = 0;
+    for (const [i, neighbors] of adj) {
+        for (const [j, Aij] of neighbors) {
+            if (community.get(i) !== community.get(j))
+                continue;
+            const ki = degree.get(i) ?? 0;
+            const kj = degree.get(j) ?? 0;
+            Q += Aij - (ki * kj) / (2 * totalWeight);
+        }
+    }
+    return Q / (2 * totalWeight);
+}
+/**
+ * Auto-name a community from the most specific common path prefix.
+ * Falls back to most frequent directory if no unique prefix.
+ */
+function nameCommunity(files, id) {
+    if (files.length === 0)
+        return `community-${id}`;
+    if (files.length === 1) {
+        const dir = files[0].split("/").slice(0, -1).join("/");
+        return dir || files[0];
+    }
+    // Find deepest common prefix
+    const parts = files.map((f) => f.split("/"));
+    const minLen = Math.min(...parts.map((p) => p.length));
+    let common = 0;
+    for (let i = 0; i < minLen - 1; i++) {
+        if (parts.every((p) => p[i] === parts[0][i]))
+            common = i + 1;
+        else
+            break;
+    }
+    // If common prefix is too short (just "src"), use most frequent subdirectory
+    if (common <= 1 && minLen > 2) {
+        const dirCounts = new Map();
+        for (const p of parts) {
+            const dir = p.slice(0, Math.min(3, p.length - 1)).join("/");
+            dirCounts.set(dir, (dirCounts.get(dir) ?? 0) + 1);
+        }
+        const topDir = [...dirCounts.entries()].sort((a, b) => b[1] - a[1])[0];
+        if (topDir)
+            return topDir[0];
+    }
+    return common > 0
+        ? parts[0].slice(0, common).join("/")
+        : `community-${id}`;
+}
+const MAX_MERMAID_COMMUNITIES = 15;
+const MAX_MERMAID_FILES_PER = 5;
+function communityToMermaid(result, edges) {
+    const lines = ["graph LR"];
+    const comms = result.communities.slice(0, MAX_MERMAID_COMMUNITIES);
+    const fileToCommunity = new Map();
+    for (const c of comms) {
+        for (const f of c.files) {
+            if (!f.startsWith("..."))
+                fileToCommunity.set(f, c.id);
+        }
+    }
+    for (const c of comms) {
+        const safeId = `c${c.id}`;
+        const label = `${c.name} (${c.files.length} files)`;
+        lines.push(`    subgraph ${safeId}["${label}"]`);
+        const showFiles = c.files.filter((f) => !f.startsWith("...")).slice(0, MAX_MERMAID_FILES_PER);
+        for (const f of showFiles) {
+            const short = f.split("/").pop()?.replace(/\.\w+$/, "") ?? f;
+            const nodeId = (safeId + "_" + short).replace(/[^a-zA-Z0-9_]/g, "_");
+            lines.push(`        ${nodeId}["${short}"]`);
+        }
+        lines.push("    end");
+    }
+    const crossEdges = new Set();
+    for (const edge of edges) {
+        const fromC = fileToCommunity.get(edge.from);
+        const toC = fileToCommunity.get(edge.to);
+        if (fromC !== undefined && toC !== undefined && fromC !== toC) {
+            const key = fromC < toC ? `c${fromC}-->c${toC}` : `c${toC}-->c${fromC}`;
+            if (!crossEdges.has(key)) {
+                crossEdges.add(key);
+                lines.push(`    c${Math.min(fromC, toC)} --> c${Math.max(fromC, toC)}`);
+            }
+        }
+    }
+    return lines.join("\n");
+}
+/**
+ * Detect code communities using Louvain algorithm on the import graph.
+ */
+export async function detectCommunities(repo, focus, resolution, outputFormat) {
+    const index = await getCodeIndex(repo);
+    if (!index)
+        throw new Error(`Repository "${repo}" not found.`);
+    // Filter files by focus; cap without focus to prevent 66K tok responses
+    const MAX_UNFOCUSED_FILES = 500;
+    const MAX_COMMUNITIES = 20;
+    let files = focus
+        ? index.files.filter((f) => f.path.includes(focus))
+        : index.files;
+    if (!focus && files.length > MAX_UNFOCUSED_FILES) {
+        // Keep files with most symbols (most architecturally relevant)
+        files = [...files].sort((a, b) => b.symbol_count - a.symbol_count).slice(0, MAX_UNFOCUSED_FILES);
+    }
+    const fileSet = new Set(files.map((f) => f.path));
+    const edges = await collectImportEdges(index, fileSet);
+    // Build weighted undirected adjacency
+    const adj = new Map();
+    for (const node of fileSet)
+        adj.set(node, new Map());
+    for (const edge of edges) {
+        if (!fileSet.has(edge.from) || !fileSet.has(edge.to))
+            continue;
+        const fromAdj = adj.get(edge.from);
+        fromAdj.set(edge.to, (fromAdj.get(edge.to) ?? 0) + 1);
+        const toAdj = adj.get(edge.to);
+        toAdj.set(edge.from, (toAdj.get(edge.from) ?? 0) + 1);
+    }
+    const res = resolution ?? 1.0;
+    const communityMap = louvain([...fileSet], adj, res);
+    const modularity = calculateModularity(communityMap, adj);
+    // Group files by community
+    const groups = new Map();
+    for (const [file, comm] of communityMap) {
+        let list = groups.get(comm);
+        if (!list) {
+            list = [];
+            groups.set(comm, list);
+        }
+        list.push(file);
+    }
+    // Symbol count per file
+    const symCountByFile = new Map();
+    for (const f of index.files)
+        symCountByFile.set(f.path, f.symbol_count);
+    // Build community objects
+    const communities = [];
+    for (const [id, communityFiles] of [...groups.entries()].sort((a, b) => b[1].length - a[1].length)) {
+        const fileSetComm = new Set(communityFiles);
+        let internal = 0;
+        let external = 0;
+        for (const edge of edges) {
+            const fromIn = fileSetComm.has(edge.from);
+            const toIn = fileSetComm.has(edge.to);
+            if (fromIn && toIn)
+                internal++;
+            else if (fromIn || toIn)
+                external++;
+        }
+        const MAX_FILES_PER_COMMUNITY = 20;
+        const sortedFiles = communityFiles.sort();
+        communities.push({
+            id,
+            name: nameCommunity(communityFiles, id),
+            files: sortedFiles.length > MAX_FILES_PER_COMMUNITY
+                ? [...sortedFiles.slice(0, MAX_FILES_PER_COMMUNITY), `... +${sortedFiles.length - MAX_FILES_PER_COMMUNITY} more`]
+                : sortedFiles,
+            symbol_count: communityFiles.reduce((sum, f) => sum + (symCountByFile.get(f) ?? 0), 0),
+            internal_edges: internal,
+            external_edges: external,
+            cohesion: internal + external > 0 ? internal / (internal + external) : 0,
+        });
+    }
+    // Cap communities output
+    const cappedCommunities = communities.slice(0, MAX_COMMUNITIES);
+    const result = {
+        communities: cappedCommunities,
+        modularity: Math.round(modularity * 1000) / 1000,
+        total_files: files.length,
+        ...(communities.length > MAX_COMMUNITIES
+            ? { truncated: true, total_communities: communities.length }
+            : {}),
+        algorithm: "louvain",
+        resolution: res,
+    };
+    if (outputFormat === "mermaid") {
+        return { mermaid: communityToMermaid(result, edges) };
+    }
+    return result;
+}
+//# sourceMappingURL=community-tools.js.map

package/dist/tools/community-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-tools.js","sourceRoot":"","sources":["../../src/tools/community-tools.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAqB9D;;;GAGG;AACH,SAAS,OAAO,CACd,KAAe,EACf,GAAqC,EACrC,UAAkB;IAElB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAE/B,uCAAuC;IACvC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,oBAAoB;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;YAAE,WAAW,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,WAAW,IAAI,CAAC,CAAC,CAAC,0BAA0B;IAC5C,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAExC,wCAAwC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,SAAS;YAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;gBAAE,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,uBAAuB;IACvB,MAAM,UAAU,GAAG,EAAE,CAAC;IACtB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAEjC,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,SAAS;gBAAE,SAAS;YAEzB,iDAAiD;YACjD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBACtC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBACpC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtD,CAAC;YAED,4DAA4D;YAC5D,IAAI,mBAAmB,GAAG,CAAC,CAAC;YAC5B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,IAAI;oBAAE,mBAAmB,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjF,CAAC;YAED,MAAM,mBAAmB,GAAG,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YAC9D,MAAM,UAAU,GAAG,mBAAmB,GAAG,UAAU,GAAG,EAAE,GAAG,mBAAmB,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;YAEnG,IAAI,QAAQ,GAAG,WAAW,CAAC;YAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC;YAEjB,KAAK,MAAM,CAAC,UAAU,EAAE,cAAc,CAAC,IAAI,WAAW,EAAE,CAAC;gBACvD,IAAI,UAAU,KAAK,WAAW;oBAAE,SAAS;gBAEzC,IAAI,WAAW,GAAG,CAAC,CAAC;gBACpB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;oBAC/B,IAAI,CAAC,KAAK,UAAU;wBAAE,WAAW,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC1D,CAAC;gBAED,MAAM,IAAI,GAAG,CAAC,cAAc,GAAG,UAAU,GAAG,EAAE,GAAG,WAAW,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,GAAG,UAAU,CAAC;gBAC/F,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACpB,QAAQ,GAAG,IAAI,CAAC;oBAChB,QAAQ,GAAG,UAAU,CAAC;gBACxB,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;gBAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC9B,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ;YAAE,MAAM;IACvB,CAAC;IAED,uDAAuD;IACvD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;QAClC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAC1B,SAA8B,EAC9B,GAAqC;IAErC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;YAAE,WAAW,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,WAAW,IAAI,CAAC,CAAC;IACjB,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,SAAS;YAAE,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YACpD,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC9B,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,KAAe,EAAE,EAAU;IAChD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,aAAa,EAAE,EAAE,CAAC;IACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,OAAO,GAAG,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC;IAC1B,CAAC;IAED,6BAA6B;IAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC;YAAE,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;;YACzD,MAAM;IACb,CAAC;IAED,6EAA6E;IAC7E,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5D,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,MAAM,GAAG,CAAC;QACf,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;QACtC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC;AACxB,CAAC;AAED,MAAM,uBAAuB,GAAG,EAAE,CAAC;AACnC,MAAM,qBAAqB,GAAG,CAAC,CAAC;AAEhC,SAAS,kBAAkB,CAAC,MAAuB,EAAE,KAAmB;IACtE,MAAM,KAAK,GAAa,CAAC,UAAU,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,uBAAuB,CAAC,CAAC;IAEnE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC;gBAAE,eAAe,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,SAAS,CAAC;QACpD,KAAK,CAAC,IAAI,CAAC,gBAAgB,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC;QACjD,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;YAC7D,MAAM,MAAM,GAAG,CAAC,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;YACrE,KAAK,CAAC,IAAI,CAAC,WAAW,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC;QAC9C,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxB,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,KAAK,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;YAC9D,MAAM,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,KAAK,EAAE,CAAC;YACxE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,IAAY,EACZ,KAAc,EACd,UAAmB,EACnB,YAAiC;IAEjC,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK;QAAE,MAAM,IAAI,KAAK,CAAC,eAAe,IAAI,cAAc,CAAC,CAAC;IAE/D,wEAAwE;IACxE,MAAM,mBAAmB,GAAG,GAAG,CAAC;IAChC,MAAM,eAAe,GAAG,EAAE,CAAC;IAC3B,IAAI,KAAK,GAAG,KAAK;QACf,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnD,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;IAEhB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,GAAG,mBAAmB,EAAE,CAAC;QACjD,+DAA+D;QAC/D,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACnG,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAEvD,sCAAsC;IACtC,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,OAAO;QAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACrD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAC/D,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAE,CAAC;QAChC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,GAAG,GAAG,UAAU,IAAI,GAAG,CAAC;IAC9B,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACrD,MAAM,UAAU,GAAG,mBAAmB,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;IAE1D,2BAA2B;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;QACxC,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YAAC,IAAI,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClB,CAAC;IAED,wBAAwB;IACxB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;IAExE,0BAA0B;IAC1B,MAAM,WAAW,GAAgB,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,EAAE,EAAE,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACnG,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;QAC5C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,MAAM,IAAI,IAAI;gBAAE,QAAQ,EAAE,CAAC;iBAC1B,IAAI,MAAM,IAAI,IAAI;gBAAE,QAAQ,EAAE,CAAC;QACtC,CAAC;QAED,MAAM,uBAAuB,GAAG,EAAE,CAAC;QACnC,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;QAC1C,WAAW,CAAC,IAAI,CAAC;YACf,EAAE;YACF,IAAI,EAAE,aAAa,CAAC,cAAc,EAAE,EAAE,CAAC;YACvC,KAAK,EAAE,WAAW,CAAC,MAAM,GAAG,uBAAuB;gBACjD,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,uBAAuB,CAAC,EAAE,QAAQ,WAAW,CAAC,MAAM,GAAG,uBAAuB,OAAO,CAAC;gBACjH,CAAC,CAAC,WAAW;YACf,YAAY,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;YACtF,cAAc,EAAE,QAAQ;YACxB,cAAc,EAAE,QAAQ;YACxB,QAAQ,EAAE,QAAQ,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;SACzE,CAAC,CAAC;IACL,CAAC;IAED,yBAAyB;IACzB,MAAM,iBAAiB,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;IAEhE,MAAM,MAAM,GAAoB;QAC9B,WAAW,EAAE,iBAAiB;QAC9B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,IAAI;QAChD,WAAW,EAAE,KAAK,CAAC,MAAM;QACzB,GAAG,CAAC,WAAW,CAAC,MAAM,GAAG,eAAe;YACtC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,iBAAiB,EAAE,WAAW,CAAC,MAAM,EAAE;YAC5D,CAAC,CAAC,EAAE,CAAC;QACP,SAAS,EAAE,SAAS;QACpB,UAAU,EAAE,GAAG;KAChB,CAAC;IAEF,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,EAAE,OAAO,EAAE,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;IACxD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}