@jafreck/lore 0.3.3 → 0.3.5

package/dist/indexer/graph-analysis.js

@@ -0,0 +1,575 @@
+/**
+ * @module indexer/graph-analysis
+ *
+ * Higher-level graph analysis primitives operating on the SQLite
+ * knowledge-base:
+ *
+ *  - `detectSymbolCycles(db, opts)` — Tarjan's SCC on the symbol adjacency
+ *    graph (call_refs, type_refs, or both).
+ *  - `findConnectedComponents(db, opts)` — union-find connected components
+ *    at file or symbol scope.
+ *  - `clusterSymbols(db, opts)` — partitions the call graph into bounded-
+ *    size coherent chunks via SCC contraction, same-file merge, greedy
+ *    edge-weight consolidation, and affinity folding.
+ *  - `buildCodebaseSummary(db, opts)` — condensed dependency summary with
+ *    per-module files, symbol counts, line spans, and SCCs.
+ */
+import { RESOLVED_METHODS } from './resolution-method.js';
+/**
+ * Loads resolved symbol-level edges from the database.
+ * Returns only edges where both source and target are non-NULL and the
+ * resolution_method passes the configured filter.
+ */
+function loadSymbolEdges(db, options = {}) {
+    const edgeKinds = options.edgeKinds ?? 'both';
+    const methods = options.methods ?? [...RESOLVED_METHODS];
+    const branch = options.branch;
+    if (methods.length === 0)
+        return [];
+    const placeholders = methods.map(() => '?').join(', ');
+    const edges = [];
+    if (edgeKinds === 'call' || edgeKinds === 'both') {
+        const where = [`sr.callee_id IS NOT NULL`, `sr.resolution_method IN (${placeholders})`];
+        const params = [...methods];
+        if (branch !== undefined) {
+            where.push('f.branch = ?');
+            params.push(branch);
+        }
+        const rows = db.prepare(`SELECT sr.caller_id AS source, sr.callee_id AS target
+         FROM symbol_refs sr
+         JOIN symbols s ON s.id = sr.caller_id
+         JOIN files f ON f.id = s.file_id
+        WHERE ${where.join(' AND ')}`).all(...params);
+        edges.push(...rows);
+    }
+    if (edgeKinds === 'type' || edgeKinds === 'both') {
+        const where = [`tr.type_id IS NOT NULL`, `tr.resolution_method IN (${placeholders})`];
+        const params = [...methods];
+        if (branch !== undefined) {
+            where.push('f.branch = ?');
+            params.push(branch);
+        }
+        const rows = db.prepare(`SELECT tr.symbol_id AS source, tr.type_id AS target
+         FROM type_refs tr
+         JOIN files f ON f.id = tr.file_id
+        WHERE tr.symbol_id IS NOT NULL AND ${where.join(' AND ')}`).all(...params);
+        edges.push(...rows);
+    }
+    return edges;
+}
+// ─── detectSymbolCycles ───────────────────────────────────────────────────────
+/**
+ * Detects strongly connected components (mutual recursion, circular type
+ * dependencies) in the **symbol** adjacency graph using Tarjan's algorithm.
+ *
+ * Returns arrays of symbol IDs where each SCC has 2+ members (or a single
+ * member with a self-edge).
+ */
+export function detectSymbolCycles(db, options = {}) {
+    const edges = loadSymbolEdges(db, options);
+    // Build directed adjacency list
+    const adjacency = new Map();
+    const allNodes = new Set();
+    for (const { source, target } of edges) {
+        allNodes.add(source);
+        allNodes.add(target);
+        let list = adjacency.get(source);
+        if (!list) {
+            list = [];
+            adjacency.set(source, list);
+        }
+        list.push(target);
+    }
+    // Tarjan's SCC
+    let index = 0;
+    const indices = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const sccs = [];
+    function strongConnect(v) {
+        indices.set(v, index);
+        lowlink.set(v, index);
+        index++;
+        stack.push(v);
+        onStack.add(v);
+        for (const w of adjacency.get(v) ?? []) {
+            if (!indices.has(w)) {
+                strongConnect(w);
+                lowlink.set(v, Math.min(lowlink.get(v), lowlink.get(w)));
+            }
+            else if (onStack.has(w)) {
+                lowlink.set(v, Math.min(lowlink.get(v), indices.get(w)));
+            }
+        }
+        if (lowlink.get(v) === indices.get(v)) {
+            const scc = [];
+            let w;
+            do {
+                w = stack.pop();
+                onStack.delete(w);
+                scc.push(w);
+            } while (w !== v);
+            if (scc.length > 1) {
+                sccs.push(scc);
+            }
+            else {
+                // Single-node SCC — only report if self-loop exists
+                const selfLoop = (adjacency.get(scc[0]) ?? []).includes(scc[0]);
+                if (selfLoop)
+                    sccs.push(scc);
+            }
+        }
+    }
+    for (const node of allNodes) {
+        if (!indices.has(node)) {
+            strongConnect(node);
+        }
+    }
+    return sccs;
+}
+/**
+ * Finds connected components in the **undirected** graph of files or symbols
+ * using a union-find (disjoint set) data structure.
+ *
+ * Returns arrays of IDs where each component has 2+ members.
+ */
+export function findConnectedComponents(db, options = {}) {
+    const scope = options.scope ?? 'symbol';
+    if (scope === 'file') {
+        return findFileComponents(db, options);
+    }
+    return findSymbolComponents(db, options);
+}
+function findFileComponents(db, options) {
+    const branch = options.branch;
+    const allFiles = (branch !== undefined
+        ? db.prepare('SELECT id FROM files WHERE branch = ?').all(branch)
+        : db.prepare('SELECT id FROM files').all());
+    const edges = (branch !== undefined
+        ? db.prepare(`SELECT fi.file_id AS source, fi.resolved_id AS target
+             FROM file_imports fi
+             JOIN files f ON f.id = fi.file_id
+            WHERE fi.resolved_id IS NOT NULL AND f.branch = ?`).all(branch)
+        : db.prepare(`SELECT fi.file_id AS source, fi.resolved_id AS target
+             FROM file_imports fi
+            WHERE fi.resolved_id IS NOT NULL`).all());
+    const uf = new UnionFind();
+    for (const f of allFiles)
+        uf.makeSet(f.id);
+    for (const { source, target } of edges)
+        uf.union(source, target);
+    return uf.components().filter(c => c.length > 1);
+}
+function findSymbolComponents(db, options) {
+    const edges = loadSymbolEdges(db, options);
+    const uf = new UnionFind();
+    for (const { source, target } of edges) {
+        uf.makeSet(source);
+        uf.makeSet(target);
+        uf.union(source, target);
+    }
+    return uf.components().filter(c => c.length > 1);
+}
+/** Simple union-find with path compression and union by rank. */
+class UnionFind {
+    parent = new Map();
+    rank = new Map();
+    makeSet(x) {
+        if (!this.parent.has(x)) {
+            this.parent.set(x, x);
+            this.rank.set(x, 0);
+        }
+    }
+    find(x) {
+        let root = x;
+        while (this.parent.get(root) !== root) {
+            root = this.parent.get(root);
+        }
+        // Path compression
+        let curr = x;
+        while (curr !== root) {
+            const next = this.parent.get(curr);
+            this.parent.set(curr, root);
+            curr = next;
+        }
+        return root;
+    }
+    union(a, b) {
+        this.makeSet(a);
+        this.makeSet(b);
+        const ra = this.find(a);
+        const rb = this.find(b);
+        if (ra === rb)
+            return;
+        const rankA = this.rank.get(ra);
+        const rankB = this.rank.get(rb);
+        if (rankA < rankB) {
+            this.parent.set(ra, rb);
+        }
+        else if (rankA > rankB) {
+            this.parent.set(rb, ra);
+        }
+        else {
+            this.parent.set(rb, ra);
+            this.rank.set(ra, rankA + 1);
+        }
+    }
+    components() {
+        const groups = new Map();
+        for (const x of this.parent.keys()) {
+            const root = this.find(x);
+            let list = groups.get(root);
+            if (!list) {
+                list = [];
+                groups.set(root, list);
+            }
+            list.push(x);
+        }
+        return [...groups.values()];
+    }
+}
+/**
+ * Partition the symbol call graph into bounded-size coherent clusters.
+ *
+ * Algorithm:
+ * 1. Contract SCCs (mutually dependent symbols → same cluster)
+ * 2. Merge same-file symbols into one cluster per file
+ * 3. Greedy merge by edge weight (respecting maxLines)
+ * 4. Fold undersized clusters into their heaviest-edge neighbor
+ */
+export function clusterSymbols(db, options = {}) {
+    const maxLines = options.maxLinesPerCluster ?? 500;
+    const branch = options.branch;
+    // Load all symbols with line spans
+    const symbolRows = (branch !== undefined
+        ? db.prepare(`SELECT s.id, s.file_id, (s.end_line - s.start_line + 1) AS lines
+             FROM symbols s JOIN files f ON f.id = s.file_id
+            WHERE f.branch = ?`).all(branch)
+        : db.prepare('SELECT id, file_id, (end_line - start_line + 1) AS lines FROM symbols').all());
+    if (symbolRows.length === 0)
+        return [];
+    const symbolById = new Map();
+    for (const s of symbolRows)
+        symbolById.set(s.id, s);
+    const edges = loadSymbolEdges(db, options);
+    // Filter edges to only include symbols we loaded
+    const validEdges = edges.filter(e => symbolById.has(e.source) && symbolById.has(e.target));
+    // Step 1: SCC contraction — assign each symbol to a cluster
+    const sccs = detectSymbolCycles(db, options);
+    const clusterOf = new Map(); // symbol → cluster representative
+    let nextCluster = 0;
+    for (const scc of sccs) {
+        const cid = nextCluster++;
+        for (const sid of scc)
+            clusterOf.set(sid, cid);
+    }
+    // Assign singletons
+    for (const s of symbolRows) {
+        if (!clusterOf.has(s.id)) {
+            clusterOf.set(s.id, nextCluster++);
+        }
+    }
+    // Step 2: Same-file merge — merge clusters whose symbols share a file
+    const fileToClusterIds = new Map();
+    for (const s of symbolRows) {
+        const cid = clusterOf.get(s.id);
+        let set = fileToClusterIds.get(s.fileId);
+        if (!set) {
+            set = new Set();
+            fileToClusterIds.set(s.fileId, set);
+        }
+        set.add(cid);
+    }
+    // Use union-find for merging
+    const clusterUf = new UnionFind();
+    for (const cid of new Set(clusterOf.values()))
+        clusterUf.makeSet(cid);
+    for (const clusterIds of fileToClusterIds.values()) {
+        const ids = [...clusterIds];
+        for (let i = 1; i < ids.length; i++) {
+            // Only merge if combined size stays within bounds
+            const rootA = clusterUf.find(ids[0]);
+            const rootB = clusterUf.find(ids[i]);
+            if (rootA !== rootB) {
+                const sizeA = clusterLineCount(rootA, clusterOf, clusterUf, symbolById);
+                const sizeB = clusterLineCount(rootB, clusterOf, clusterUf, symbolById);
+                if (sizeA + sizeB <= maxLines) {
+                    clusterUf.union(rootA, rootB);
+                }
+            }
+        }
+    }
+    // Step 3: Greedy merge by edge weight
+    const crossEdgeWeights = new Map();
+    for (const { source, target } of validEdges) {
+        const ca = clusterUf.find(clusterOf.get(source));
+        const cb = clusterUf.find(clusterOf.get(target));
+        if (ca === cb)
+            continue;
+        const key = ca < cb ? `${ca}:${cb}` : `${cb}:${ca}`;
+        crossEdgeWeights.set(key, (crossEdgeWeights.get(key) ?? 0) + 1);
+    }
+    // Sort by edge weight descending and greedily merge
+    const sortedPairs = [...crossEdgeWeights.entries()]
+        .sort((a, b) => b[1] - a[1]);
+    for (const [key] of sortedPairs) {
+        const [aStr, bStr] = key.split(':');
+        const ca = clusterUf.find(Number(aStr));
+        const cb = clusterUf.find(Number(bStr));
+        if (ca === cb)
+            continue;
+        const sizeA = clusterLineCount(ca, clusterOf, clusterUf, symbolById);
+        const sizeB = clusterLineCount(cb, clusterOf, clusterUf, symbolById);
+        if (sizeA + sizeB <= maxLines) {
+            clusterUf.union(ca, cb);
+        }
+    }
+    // Step 4: Fold undersized clusters (<30 lines) into heaviest neighbor
+    const MIN_CLUSTER_LINES = 30;
+    const finalClusters = new Map(); // root → symbol ids
+    for (const s of symbolRows) {
+        const root = clusterUf.find(clusterOf.get(s.id));
+        let list = finalClusters.get(root);
+        if (!list) {
+            list = [];
+            finalClusters.set(root, list);
+        }
+        list.push(s.id);
+    }
+    // Find undersized clusters and their best merge target
+    for (const [root, symbolIds] of finalClusters) {
+        const totalLines = symbolIds.reduce((sum, id) => sum + (symbolById.get(id)?.lines ?? 0), 0);
+        if (totalLines >= MIN_CLUSTER_LINES)
+            continue;
+        // Find the neighbor cluster with the most edges
+        let bestNeighbor;
+        let bestWeight = 0;
+        for (const { source, target } of validEdges) {
+            const cs = clusterUf.find(clusterOf.get(source));
+            const ct = clusterUf.find(clusterOf.get(target));
+            if (cs === root && ct !== root) {
+                const neighborLines = clusterLineCount(ct, clusterOf, clusterUf, symbolById);
+                if (neighborLines + totalLines <= maxLines) {
+                    const key = root < ct ? `${root}:${ct}` : `${ct}:${root}`;
+                    const w = crossEdgeWeights.get(key) ?? 1;
+                    if (w > bestWeight) {
+                        bestWeight = w;
+                        bestNeighbor = ct;
+                    }
+                }
+            }
+            else if (ct === root && cs !== root) {
+                const neighborLines = clusterLineCount(cs, clusterOf, clusterUf, symbolById);
+                if (neighborLines + totalLines <= maxLines) {
+                    const key = root < cs ? `${root}:${cs}` : `${cs}:${root}`;
+                    const w = crossEdgeWeights.get(key) ?? 1;
+                    if (w > bestWeight) {
+                        bestWeight = w;
+                        bestNeighbor = cs;
+                    }
+                }
+            }
+        }
+        if (bestNeighbor !== undefined) {
+            clusterUf.union(root, bestNeighbor);
+        }
+    }
+    // Build final result
+    const resultMap = new Map();
+    for (const s of symbolRows) {
+        const root = clusterUf.find(clusterOf.get(s.id));
+        let entry = resultMap.get(root);
+        if (!entry) {
+            entry = { symbolIds: [], fileIds: new Set(), totalLines: 0 };
+            resultMap.set(root, entry);
+        }
+        entry.symbolIds.push(s.id);
+        entry.fileIds.add(s.fileId);
+        entry.totalLines += s.lines;
+    }
+    // Count internal/external edges per cluster
+    const results = [];
+    let idx = 0;
+    for (const entry of resultMap.values()) {
+        const memberSet = new Set(entry.symbolIds);
+        let internalEdges = 0;
+        let externalEdges = 0;
+        for (const { source, target } of validEdges) {
+            const sIn = memberSet.has(source);
+            const tIn = memberSet.has(target);
+            if (sIn && tIn)
+                internalEdges++;
+            else if (sIn || tIn)
+                externalEdges++;
+        }
+        results.push({
+            id: idx++,
+            symbolIds: entry.symbolIds,
+            totalLines: entry.totalLines,
+            fileIds: [...entry.fileIds],
+            internalEdges,
+            externalEdges,
+        });
+    }
+    return results.sort((a, b) => b.totalLines - a.totalLines);
+}
+function clusterLineCount(clusterRoot, clusterOf, uf, symbolById) {
+    let total = 0;
+    for (const [symId, cid] of clusterOf) {
+        if (uf.find(cid) === clusterRoot) {
+            total += symbolById.get(symId)?.lines ?? 0;
+        }
+    }
+    return total;
+}
+/**
+ * Produces a condensed dependency summary of the codebase — the "30-second
+ * architecture overview."
+ *
+ * Combines symbol clustering with inter-module edge analysis and SCC/CC
+ * detection at the module level.
+ */
+export function buildCodebaseSummary(db, options = {}) {
+    const branch = options.branch;
+    // Counts
+    const totalFiles = (branch !== undefined
+        ? db.prepare('SELECT COUNT(*) AS cnt FROM files WHERE branch = ?').get(branch)
+        : db.prepare('SELECT COUNT(*) AS cnt FROM files').get());
+    const totalSymbols = (branch !== undefined
+        ? db.prepare('SELECT COUNT(*) AS cnt FROM symbols s JOIN files f ON f.id = s.file_id WHERE f.branch = ?').get(branch)
+        : db.prepare('SELECT COUNT(*) AS cnt FROM symbols').get());
+    const totalEdges = (branch !== undefined
+        ? db.prepare(`SELECT COUNT(*) AS cnt FROM symbol_refs sr
+           JOIN symbols s ON s.id = sr.caller_id
+           JOIN files f ON f.id = s.file_id
+           WHERE sr.callee_id IS NOT NULL AND f.branch = ?`).get(branch)
+        : db.prepare('SELECT COUNT(*) AS cnt FROM symbol_refs WHERE callee_id IS NOT NULL').get());
+    // Cluster symbols into modules
+    const clusters = clusterSymbols(db, {
+        ...options,
+        maxLinesPerCluster: options.maxLinesPerModule ?? 500,
+    });
+    if (clusters.length === 0) {
+        return {
+            totalFiles: totalFiles.cnt,
+            totalSymbols: totalSymbols.cnt,
+            totalEdges: totalEdges.cnt,
+            modules: [],
+            connectedComponents: [],
+            cyclicGroups: [],
+        };
+    }
+    // Build symbol → cluster mapping
+    const symbolToCluster = new Map();
+    for (const c of clusters) {
+        for (const sid of c.symbolIds) {
+            symbolToCluster.set(sid, c.id);
+        }
+    }
+    // Load file paths for each cluster
+    const filePathById = new Map((branch !== undefined
+        ? db.prepare('SELECT id, path FROM files WHERE branch = ?').all(branch)
+        : db.prepare('SELECT id, path FROM files').all()).map((r) => [r.id, r.path]));
+    // Build module summaries
+    const edges = loadSymbolEdges(db, options);
+    const moduleAdj = new Map(); // module → set of modules it depends on
+    const moduleRevAdj = new Map(); // module → set of modules that depend on it
+    for (const c of clusters) {
+        moduleAdj.set(c.id, new Set());
+        moduleRevAdj.set(c.id, new Set());
+    }
+    for (const { source, target } of edges) {
+        const cm = symbolToCluster.get(source);
+        const cn = symbolToCluster.get(target);
+        if (cm === undefined || cn === undefined || cm === cn)
+            continue;
+        moduleAdj.get(cm).add(cn);
+        moduleRevAdj.get(cn).add(cm);
+    }
+    const modules = clusters.map(c => ({
+        id: c.id,
+        files: c.fileIds.map(fid => filePathById.get(fid) ?? `file:${fid}`).sort(),
+        symbolCount: c.symbolIds.length,
+        totalLines: c.totalLines,
+        dependsOn: [...(moduleAdj.get(c.id) ?? [])].sort((a, b) => a - b),
+        dependedOnBy: [...(moduleRevAdj.get(c.id) ?? [])].sort((a, b) => a - b),
+    }));
+    // Module-level connected components
+    const moduleUf = new UnionFind();
+    for (const c of clusters)
+        moduleUf.makeSet(c.id);
+    for (const { source, target } of edges) {
+        const cm = symbolToCluster.get(source);
+        const cn = symbolToCluster.get(target);
+        if (cm !== undefined && cn !== undefined && cm !== cn) {
+            moduleUf.union(cm, cn);
+        }
+    }
+    const connectedComponents = moduleUf.components().filter(c => c.length > 1);
+    // Module-level SCCs
+    const moduleSccAdj = new Map();
+    for (const c of clusters)
+        moduleSccAdj.set(c.id, []);
+    for (const [mid, deps] of moduleAdj) {
+        moduleSccAdj.set(mid, [...deps]);
+    }
+    const cyclicGroups = tarjanScc(moduleSccAdj);
+    return {
+        totalFiles: totalFiles.cnt,
+        totalSymbols: totalSymbols.cnt,
+        totalEdges: totalEdges.cnt,
+        modules,
+        connectedComponents,
+        cyclicGroups,
+    };
+}
+/** Generic Tarjan's SCC for number-keyed adjacency. */
+function tarjanScc(adjacency) {
+    let index = 0;
+    const indices = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const sccs = [];
+    function strongConnect(v) {
+        indices.set(v, index);
+        lowlink.set(v, index);
+        index++;
+        stack.push(v);
+        onStack.add(v);
+        for (const w of adjacency.get(v) ?? []) {
+            if (!indices.has(w)) {
+                strongConnect(w);
+                lowlink.set(v, Math.min(lowlink.get(v), lowlink.get(w)));
+            }
+            else if (onStack.has(w)) {
+                lowlink.set(v, Math.min(lowlink.get(v), indices.get(w)));
+            }
+        }
+        if (lowlink.get(v) === indices.get(v)) {
+            const scc = [];
+            let w;
+            do {
+                w = stack.pop();
+                onStack.delete(w);
+                scc.push(w);
+            } while (w !== v);
+            if (scc.length > 1) {
+                sccs.push(scc);
+            }
+            else {
+                const selfLoop = (adjacency.get(scc[0]) ?? []).includes(scc[0]);
+                if (selfLoop)
+                    sccs.push(scc);
+            }
+        }
+    }
+    for (const node of adjacency.keys()) {
+        if (!indices.has(node)) {
+            strongConnect(node);
+        }
+    }
+    return sccs;
+}
+//# sourceMappingURL=graph-analysis.js.map

package/dist/indexer/graph-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-analysis.js","sourceRoot":"","sources":["../../src/indexer/graph-analysis.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAsB1D;;;;GAIG;AACH,SAAS,eAAe,CACtB,EAAqB,EACrB,UAAgC,EAAE;IAElC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,MAAM,CAAC;IAC9C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;IACzD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAE9B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,MAAM,KAAK,GAAiB,EAAE,CAAC;IAE/B,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,CAAC,0BAA0B,EAAE,4BAA4B,YAAY,GAAG,CAAC,CAAC;QACxF,MAAM,MAAM,GAA2B,CAAC,GAAG,OAAO,CAAC,CAAC;QAEpD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;;;gBAIU,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAChC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAiB,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,CAAC,wBAAwB,EAAE,4BAA4B,YAAY,GAAG,CAAC,CAAC;QACtF,MAAM,MAAM,GAA2B,CAAC,GAAG,OAAO,CAAC,CAAC;QAEpD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;;6CAGuC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAC7D,CAAC,GAAG,CAAC,GAAG,MAAM,CAAiB,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iFAAiF;AAEjF;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAChC,EAAqB,EACrB,UAAgC,EAAE;IAElC,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAE3C,gCAAgC;IAChC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,IAAI,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;YACV,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpB,CAAC;IAED,eAAe;IACf,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;IAE5B,SAAS,aAAa,CAAC,CAAS;QAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,aAAa,CAAC,CAAC,CAAC,CAAC;gBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC7D,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,IAAI,CAAS,CAAC;YACd,GAAG,CAAC;gBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAElB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,oDAAoD;gBACpD,MAAM,QAAQ,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBAClE,IAAI,QAAQ;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,EAAqB,EACrB,UAAsC,EAAE;IAExC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,QAAQ,CAAC;IAExC,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;QACrB,OAAO,kBAAkB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,oBAAoB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,kBAAkB,CACzB,EAAqB,EACrB,OAA6B;IAE7B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAE9B,MAAM,QAAQ,GAAG,CACf,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QACjE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,GAAG,EAAE,CACpB,CAAC;IAE3B,MAAM,KAAK,GAAG,CACZ,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CACR;;;8DAGoD,CACrD,CAAC,GAAG,CAAC,MAAM,CAAC;QACf,CAAC,CAAC,EAAE,CAAC,OAAO,CACR;;6CAEmC,CACpC,CAAC,GAAG,EAAE,CACI,CAAC;IAElB,MAAM,EAAE,GAAG,IAAI,SAAS,EAAU,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3C,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK;QAAE,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEjE,OAAO,EAAE,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,SAAS,oBAAoB,CAC3B,EAAqB,EACrB,OAA6B;IAE7B,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAE3C,MAAM,EAAE,GAAG,IAAI,SAAS,EAAU,CAAC;IACnC,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnB,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnB,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED,OAAO,EAAE,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,iEAAiE;AACjE,MAAM,SAAS;IACL,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAC;IACzB,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;IAEpC,OAAO,CAAC,CAAI;QACV,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,IAAI,CAAC,CAAI;QACP,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACtC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAChC,CAAC;QACD,mBAAmB;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5B,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,CAAI,EAAE,CAAI;QACd,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACjC,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,CAAC;aAAM,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,UAAU;QACR,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,EAAE,CAAC;gBACV,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9B,CAAC;CACF;AA8BD;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAC5B,EAAqB,EACrB,UAA0B,EAAE;IAE5B,MAAM,QAAQ,GAAG,OAAO,CAAC,kBAAkB,IAAI,GAAG,CAAC;IACnD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAE9B,mCAAmC;IACnC,MAAM,UAAU,GAAG,CACjB,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CACR;;+BAEqB,CACtB,CAAC,GAAG,CAAC,MAAM,CAAC;QACf,CAAC,CAAC,EAAE,CAAC,OAAO,CACR,uEAAuE,CACxE,CAAC,GAAG,EAAE,CACI,CAAC;IAElB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEvC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEpD,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAE3C,iDAAiD;IACjD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3F,4DAA4D;IAC5D,MAAM,IAAI,GAAG,kBAAkB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,kCAAkC;IAC/E,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,WAAW,EAAE,CAAC;QAC1B,KAAK,MAAM,GAAG,IAAI,GAAG;YAAE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,oBAAoB;IACpB,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAuB,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QACjC,IAAI,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;YAChB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,6BAA6B;IAC7B,MAAM,SAAS,GAAG,IAAI,SAAS,EAAU,CAAC;IAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QAAE,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAEtE,KAAK,MAAM,UAAU,IAAI,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;QACnD,MAAM,GAAG,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,kDAAkD;YAClD,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;YACtC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;YACtC,IAAI,KAAK,KAAK,KAAK,EAAE,CAAC;gBACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBACxE,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBACxE,IAAI,KAAK,GAAG,KAAK,IAAI,QAAQ,EAAE,CAAC;oBAC9B,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5C,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;QAClD,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS;QACxB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QACpD,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,oDAAoD;IACpD,MAAM,WAAW,GAAG,CAAC,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;SAChD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/B,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;QAChC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS;QACxB,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QACrE,IAAI,KAAK,GAAG,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC9B,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,sEAAsE;IACtE,MAAM,iBAAiB,GAAG,EAAE,CAAC;IAC7B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,oBAAoB;IACvE,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;QAClD,IAAI,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,EAAE,CAAC;YACV,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,uDAAuD;IACvD,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9C,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5F,IAAI,UAAU,IAAI,iBAAiB;YAAE,SAAS;QAE9C,gDAAgD;QAChD,IAAI,YAAgC,CAAC;QACrC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5C,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;YAClD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,CAAC;YAClD,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAC/B,MAAM,aAAa,GAAG,gBAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC7E,IAAI,aAAa,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAC;oBAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC;oBAC1D,MAAM,CAAC,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACzC,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;wBACnB,UAAU,GAAG,CAAC,CAAC;wBACf,YAAY,GAAG,EAAE,CAAC;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBACtC,MAAM,aAAa,GAAG,gBAAgB,CAAC,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC7E,IAAI,aAAa,GAAG,UAAU,IAAI,QAAQ,EAAE,CAAC;oBAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,EAAE,CAAC;oBAC1D,MAAM,CAAC,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACzC,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;wBACnB,UAAU,GAAG,CAAC,CAAC;wBACf,YAAY,GAAG,EAAE,CAAC;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,SAAS,GAAG,IAAI,GAAG,EAA6E,CAAC;IACvG,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC;QAClD,IAAI,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;YAC7D,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3B,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5B,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC,KAAK,CAAC;IAC9B,CAAC;IAED,4CAA4C;IAC5C,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5C,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,GAAG,IAAI,GAAG;gBAAE,aAAa,EAAE,CAAC;iBAC3B,IAAI,GAAG,IAAI,GAAG;gBAAE,aAAa,EAAE,CAAC;QACvC,CAAC;QACD,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,GAAG,EAAE;YACT,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,UAAU,EAAE,KAAK,CAAC,UAAU;YAC5B,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;YAC3B,aAAa;YACb,aAAa;SACd,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,gBAAgB,CACvB,WAAmB,EACnB,SAA8B,EAC9B,EAAqB,EACrB,UAAmC;IAEnC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;QACrC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,WAAW,EAAE,CAAC;YACjC,KAAK,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAuCD;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAClC,EAAqB,EACrB,UAAkC,EAAE;IAEpC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAE9B,SAAS;IACT,MAAM,UAAU,GAAG,CACjB,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QAC9E,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,mCAAmC,CAAC,CAAC,GAAG,EAAE,CACvC,CAAC;IAErB,MAAM,YAAY,GAAG,CACnB,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,2FAA2F,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QACrH,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,EAAE,CACzC,CAAC;IAErB,MAAM,UAAU,GAAG,CACjB,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CACR;;;2DAGiD,CAClD,CAAC,GAAG,CAAC,MAAM,CAAC;QACf,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,qEAAqE,CAAC,CAAC,GAAG,EAAE,CACzE,CAAC;IAErB,+BAA+B;IAC/B,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,EAAE;QAClC,GAAG,OAAO;QACV,kBAAkB,EAAE,OAAO,CAAC,iBAAiB,IAAI,GAAG;KACrD,CAAC,CAAC;IAEH,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO;YACL,UAAU,EAAE,UAAU,CAAC,GAAG;YAC1B,YAAY,EAAE,YAAY,CAAC,GAAG;YAC9B,UAAU,EAAE,UAAU,CAAC,GAAG;YAC1B,OAAO,EAAE,EAAE;YACX,mBAAmB,EAAE,EAAE;YACvB,YAAY,EAAE,EAAE;SACjB,CAAC;IACJ,CAAC;IAED,iCAAiC;IACjC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC9B,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,CACE,MAAM,KAAK,SAAS;QAClB,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QACvE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAAC,GAAG,EAAE,CACnD,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAClC,CAAC;IAEF,yBAAyB;IACzB,MAAM,KAAK,GAAG,eAAe,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,wCAAwC;IAC1F,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,4CAA4C;IAEjG,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE;YAAE,SAAS;QAChE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,YAAY,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,OAAO,GAAoB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,QAAQ,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE;QAC1E,WAAW,EAAE,CAAC,CAAC,SAAS,CAAC,MAAM;QAC/B,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,SAAS,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACjE,YAAY,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;KACxE,CAAC,CAAC,CAAC;IAEJ,oCAAoC;IACpC,MAAM,QAAQ,GAAG,IAAI,SAAS,EAAU,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjD,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACvC,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACtD,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IACD,MAAM,mBAAmB,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE5E,oBAAoB;IACpB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACrD,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACpC,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC;IAE7C,OAAO;QACL,UAAU,EAAE,UAAU,CAAC,GAAG;QAC1B,YAAY,EAAE,YAAY,CAAC,GAAG;QAC9B,UAAU,EAAE,UAAU,CAAC,GAAG;QAC1B,OAAO;QACP,mBAAmB;QACnB,YAAY;KACb,CAAC;AACJ,CAAC;AAED,uDAAuD;AACvD,SAAS,SAAS,CAAC,SAAgC;IACjD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAe,EAAE,CAAC;IAE5B,SAAS,aAAa,CAAC,CAAS;QAC9B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACtB,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,aAAa,CAAC,CAAC,CAAC,CAAC;gBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC7D,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,IAAI,CAAS,CAAC;YACd,GAAG,CAAC;gBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAElB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,MAAM,QAAQ,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBAClE,IAAI,QAAQ;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,aAAa,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/indexer/stages/embedding.d.ts

@@ -3,6 +3,15 @@
  *
  * Pipeline stage: embed symbol signatures, documentation sections, and
  * commit messages into vec0 virtual tables for semantic search.
+ *
+ * Optimisations:
+ *   - **Token-aware batching**: batches are sized by estimated token budget
+ *     rather than a fixed item count, avoiding pathological padding waste
+ *     when one long signature inflates the whole batch.
+ *   - **Skip-unchanged**: in update mode, symbols whose embedding input text
+ *     has not changed (by SHA-256 hash) are skipped entirely.
+ *   - **Double-buffered I/O**: the next `embed()` call fires while the
+ *     current batch's vectors are written to SQLite.
  */
 import type { PipelineContext, PipelineStage } from '../pipeline.js';
 /**

package/dist/indexer/stages/embedding.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"embedding.d.ts","sourceRoot":"","sources":["../../../src/indexer/stages/embedding.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AASrE;;;;GAIG;AACH,qBAAa,cAAe,YAAW,aAAa;IAClD,QAAQ,CAAC,IAAI,eAAe;IAEtB,OAAO,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;CA6BjF"}
+{"version":3,"file":"embedding.d.ts","sourceRoot":"","sources":["../../../src/indexer/stages/embedding.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAMrE;;;;GAIG;AACH,qBAAa,cAAe,YAAW,aAAa;IAClD,QAAQ,CAAC,IAAI,eAAe;IAEtB,OAAO,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;CA6BjF"}