brainbank 0.1.0

package/dist/chunk-YGSEUWLV.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/config.ts","../src/vector/hnsw.ts","../src/embeddings/local.ts","../src/vector/mmr.ts","../src/query/search.ts","../src/query/fts-utils.ts","../src/query/bm25.ts","../src/query/context-builder.ts","../src/core/collection.ts","../src/core/brainbank.ts","../src/storage/database.ts","../src/core/schema.ts","../src/core/reembed.ts","../src/core/watch.ts"],"sourcesContent":["import type { BrainBankConfig, ResolvedConfig } from '../types.ts';\nimport * as path from 'node:path';\n\n// ── Defaults ────────────────────────────────────────\n\nexport const DEFAULTS: ResolvedConfig = {\n    repoPath: '.',\n    dbPath: '.brainbank/brainbank.db',\n    gitDepth: 500,\n    maxFileSize: 512_000,      // 500KB\n    maxDiffBytes: 8192,\n    hnswM: 16,\n    hnswEfConstruction: 200,\n    hnswEfSearch: 50,\n    embeddingDims: 384,\n    maxElements: 2_000_000,\n};\n\n// ── Resolver ────────────────────────────────────────\n\n/**\n * Merge partial config with defaults.\n * All fields become required.\n * Relative dbPath is resolved against repoPath.\n */\nexport function resolveConfig(partial: BrainBankConfig = {}): ResolvedConfig {\n    const repoPath = path.resolve(partial.repoPath ?? DEFAULTS.repoPath);\n    const rawDbPath = partial.dbPath ?? DEFAULTS.dbPath;\n    // Resolve relative dbPath against repoPath so DB lives alongside the repo\n    const dbPath = path.isAbsolute(rawDbPath) ? rawDbPath : path.join(repoPath, rawDbPath);\n\n    return {\n        repoPath,\n        dbPath,\n        gitDepth:          partial.gitDepth          ?? DEFAULTS.gitDepth,\n        maxFileSize:       partial.maxFileSize       ?? DEFAULTS.maxFileSize,\n        maxDiffBytes:      partial.maxDiffBytes      ?? DEFAULTS.maxDiffBytes,\n        hnswM:             partial.hnswM             ?? DEFAULTS.hnswM,\n        hnswEfConstruction: partial.hnswEfConstruction ?? DEFAULTS.hnswEfConstruction,\n        hnswEfSearch:      partial.hnswEfSearch      ?? DEFAULTS.hnswEfSearch,\n        embeddingDims:     partial.embeddingDims     ?? DEFAULTS.embeddingDims,\n        maxElements:       partial.maxElements       ?? DEFAULTS.maxElements,\n        embeddingProvider: partial.embeddingProvider,\n        reranker: partial.reranker,\n    };\n}\n\n","/**\n * BrainBank — HNSW Vector Index\n * \n * Wraps hnswlib-node for O(log n) approximate nearest neighbor search.\n * M=16 connections, ef=200 construction, ef=50 search by default.\n * 150x faster than brute force at 1M vectors.\n */\n\nimport type { VectorIndex, SearchHit } from '../types.ts';\n\nexport class HNSWIndex implements VectorIndex {\n    private _index: any = null;\n    private _count = 0;\n\n    constructor(\n        private _dims: number,\n        private _maxElements: number = 2_000_000,\n        private _M: number = 16,\n        private _efConstruction: number = 200,\n        private _efSearch: number = 50,\n    ) {}\n\n    /**\n     * Initialize the HNSW index.\n     * Must be called before add/search.\n     */\n    async init(): Promise<this> {\n        const HNSWLib = await import('hnswlib-node');\n        const HNSW = HNSWLib.default?.HierarchicalNSW ?? HNSWLib.HierarchicalNSW;\n        this._index = new HNSW('cosine', this._dims);\n        this._index.initIndex(this._maxElements, this._M, this._efConstruction);\n        this._index.setEf(this._efSearch);\n        return this;\n    }\n\n    /**\n     * Add a vector with an integer ID.\n     * The vector should be pre-normalized for cosine distance.\n     */\n    add(vector: Float32Array, id: number): void {\n        if (!this._index) throw new Error('HNSW index not initialized — call init() first');\n        this._index.addPoint(Array.from(vector), id);\n        this._count++;\n    }\n\n    /**\n     * Search for the k nearest neighbors.\n     * Returns results sorted by score (highest first).\n     * Score is 1 - cosine_distance (1.0 = identical).\n     */\n    search(query: Float32Array, k: number): SearchHit[] {\n        if (!this._index || this._count === 0) return [];\n\n        const actualK = Math.min(k, this._count);\n        const result = this._index.searchKnn(Array.from(query), actualK);\n\n        return result.neighbors.map((id: number, i: number) => ({\n            id,\n            score: 1 - result.distances[i],\n        }));\n    }\n\n    /** Number of vectors in the index. */\n    get size(): number {\n        return this._count;\n    }\n}\n","/**\n * BrainBank — Local Embedding Provider\n * \n * Uses @xenova/transformers with all-MiniLM-L6-v2 (384 dims, WASM).\n * Downloads ~23MB on first use, cached locally.\n * No external API calls — runs entirely in-process.\n */\n\nimport type { EmbeddingProvider } from '../types.ts';\n\nexport class LocalEmbedding implements EmbeddingProvider {\n    readonly dims: number = 384;\n\n    private _pipeline: any = null;\n    private _modelName: string;\n    private _cacheDir: string;\n\n    constructor(options: { model?: string; cacheDir?: string } = {}) {\n        this._modelName = options.model ?? 'Xenova/all-MiniLM-L6-v2';\n        this._cacheDir = options.cacheDir ?? '.model-cache';\n    }\n\n    /**\n     * Lazy-load the transformer pipeline.\n     * Singleton — created once and reused.\n     */\n    private async _getPipeline(): Promise<any> {\n        if (this._pipeline) return this._pipeline;\n\n        const { pipeline, env } = await import('@xenova/transformers' as any);\n        env.cacheDir = this._cacheDir;\n        env.allowLocalModels = true;\n\n        this._pipeline = await pipeline('feature-extraction', this._modelName, {\n            quantized: true,\n        });\n\n        return this._pipeline;\n    }\n\n    /**\n     * Embed a single text string.\n     * Returns a normalized Float32Array of length 384.\n     */\n    async embed(text: string): Promise<Float32Array> {\n        const pipe = await this._getPipeline();\n        const output = await pipe(text, { pooling: 'mean', normalize: true });\n        return output.data as Float32Array;\n    }\n\n    /**\n     * Embed multiple texts.\n     * Processes sequentially to avoid OOM on large batches.\n     */\n    async embedBatch(texts: string[]): Promise<Float32Array[]> {\n        const results: Float32Array[] = [];\n        for (const text of texts) {\n            results.push(await this.embed(text));\n        }\n        return results;\n    }\n\n    async close(): Promise<void> {\n        this._pipeline = null;\n    }\n}\n","/**\n * BrainBank — Maximum Marginal Relevance (MMR)\n * \n * Diversifies vector search results to avoid returning redundant items.\n * λ=1.0 → pure relevance, λ=0.0 → pure diversity.\n * Default λ=0.7 balances both.\n */\n\nimport type { VectorIndex, SearchHit } from '../types.ts';\nimport { cosineSimilarity } from '../embeddings/math.ts';\n\n/**\n * Search with Maximum Marginal Relevance for diversified results.\n * \n * Algorithm:\n *   1. Get 3x candidates from HNSW\n *   2. Greedily select items that maximize: λ * relevance - (1-λ) * max_sim_to_selected\n */\nexport function searchMMR(\n    index: VectorIndex,\n    query: Float32Array,\n    vectorCache: Map<number, Float32Array>,\n    k: number,\n    lambda: number = 0.7,\n): SearchHit[] {\n    // Get more candidates than needed\n    const candidates = index.search(query, k * 3);\n    if (candidates.length <= k) return candidates;\n\n    const selected: SearchHit[] = [];\n    const remaining = [...candidates];\n\n    while (selected.length < k && remaining.length > 0) {\n        let bestScore = -Infinity;\n        let bestIdx = 0;\n\n        for (let i = 0; i < remaining.length; i++) {\n            const relevance = remaining[i].score;\n\n            // Max similarity to any already-selected item\n            let maxSim = 0;\n            for (const sel of selected) {\n                const candidateVec = vectorCache.get(remaining[i].id);\n                const selectedVec = vectorCache.get(sel.id);\n                if (candidateVec && selectedVec) {\n                    maxSim = Math.max(maxSim, cosineSimilarity(candidateVec, selectedVec));\n                }\n            }\n\n            // MMR score: balance relevance vs diversity\n            const mmrScore = lambda * relevance - (1 - lambda) * maxSim;\n\n            if (mmrScore > bestScore) {\n                bestScore = mmrScore;\n                bestIdx = i;\n            }\n        }\n\n        selected.push(remaining[bestIdx]);\n        remaining.splice(bestIdx, 1);\n    }\n\n    return selected;\n}\n","/**\n * BrainBank — Unified Search\n * \n * Searches across all three indices (code, git, memory)\n * and returns typed results sorted by relevance.\n */\n\nimport type { Database } from '../storage/database.ts';\nimport type { EmbeddingProvider, Reranker, SearchResult } from '../types.ts';\nimport type { HNSWIndex } from '../vector/hnsw.ts';\nimport { searchMMR } from '../vector/mmr.ts';\n\nexport interface SearchDeps {\n    db: Database;\n    codeHnsw?: HNSWIndex;\n    gitHnsw?: HNSWIndex;\n    memHnsw?: HNSWIndex;\n    codeVecs: Map<number, Float32Array>;\n    gitVecs: Map<number, Float32Array>;\n    memVecs: Map<number, Float32Array>;\n    embedding: EmbeddingProvider;\n    reranker?: Reranker;\n}\n\nexport interface SearchOptions {\n    /** Max code results. Default: 6 */\n    codeK?: number;\n    /** Max git results. Default: 5 */\n    gitK?: number;\n    /** Max memory results. Default: 4 */\n    memoryK?: number;\n    /** Minimum similarity score. Default: 0.25 */\n    minScore?: number;\n    /** Use MMR for diversity. Default: true */\n    useMMR?: boolean;\n    /** MMR lambda. Default: 0.7 */\n    mmrLambda?: number;\n}\n\nexport class UnifiedSearch {\n    private _deps: SearchDeps;\n\n    constructor(deps: SearchDeps) {\n        this._deps = deps;\n    }\n\n    /**\n     * Search across all indices.\n     * Returns combined results sorted by score.\n     */\n    async search(query: string, options: SearchOptions = {}): Promise<SearchResult[]> {\n        const {\n            codeK = 6,\n            gitK = 5,\n            memoryK = 4,\n            minScore = 0.25,\n            useMMR = true,\n            mmrLambda = 0.7,\n        } = options;\n\n        const queryVec = await this._deps.embedding.embed(query);\n        const results: SearchResult[] = [];\n\n        // ── Code search ────────────────────────────\n        if (this._deps.codeHnsw && this._deps.codeHnsw.size > 0) {\n            const hits = useMMR\n                ? searchMMR(this._deps.codeHnsw, queryVec, this._deps.codeVecs, codeK, mmrLambda)\n                : this._deps.codeHnsw.search(queryVec, codeK);\n\n            if (hits.length > 0) {\n                const ids = hits.map(h => h.id);\n                const scoreMap = new Map(hits.map(h => [h.id, h.score]));\n                const placeholders = ids.map(() => '?').join(',');\n\n                const rows = this._deps.db.prepare(\n                    `SELECT * FROM code_chunks WHERE id IN (${placeholders})`\n                ).all(...ids) as any[];\n\n                for (const r of rows) {\n                    const score = scoreMap.get(r.id) ?? 0;\n                    if (score >= minScore) {\n                        results.push({\n                            type: 'code',\n                            score,\n                            filePath: r.file_path,\n                            content: r.content,\n                            metadata: {\n                                chunkType: r.chunk_type,\n                                name: r.name,\n                                startLine: r.start_line,\n                                endLine: r.end_line,\n                                language: r.language,\n                            },\n                        });\n                    }\n                }\n            }\n        }\n\n        // ── Git search ─────────────────────────────\n        if (this._deps.gitHnsw && this._deps.gitHnsw.size > 0) {\n            const hits = this._deps.gitHnsw.search(queryVec, gitK * 2);\n\n            if (hits.length > 0) {\n                const ids = hits.map(h => h.id);\n                const scoreMap = new Map(hits.map(h => [h.id, h.score]));\n                const placeholders = ids.map(() => '?').join(',');\n\n                const rows = this._deps.db.prepare(\n                    `SELECT * FROM git_commits WHERE id IN (${placeholders}) AND is_merge = 0`\n                ).all(...ids) as any[];\n\n                for (const r of rows) {\n                    const score = scoreMap.get(r.id) ?? 0;\n                    if (score >= minScore) {\n                        results.push({\n                            type: 'commit',\n                            score,\n                            content: r.message,\n                            metadata: {\n                                hash: r.hash,\n                                shortHash: r.short_hash,\n                                author: r.author,\n                                date: r.date,\n                                files: JSON.parse(r.files_json ?? '[]'),\n                                additions: r.additions,\n                                deletions: r.deletions,\n                                diff: r.diff,\n                            },\n                        });\n                    }\n                }\n            }\n        }\n\n        // ── Memory search ──────────────────────────\n        if (this._deps.memHnsw && this._deps.memHnsw.size > 0) {\n            const hits = useMMR\n                ? searchMMR(this._deps.memHnsw, queryVec, this._deps.memVecs, memoryK, mmrLambda)\n                : this._deps.memHnsw.search(queryVec, memoryK);\n\n            if (hits.length > 0) {\n                const ids = hits.map(h => h.id);\n                const scoreMap = new Map(hits.map(h => [h.id, h.score]));\n                const placeholders = ids.map(() => '?').join(',');\n\n                const rows = this._deps.db.prepare(\n                    `SELECT * FROM memory_patterns WHERE id IN (${placeholders}) AND success_rate >= 0.5`\n                ).all(...ids) as any[];\n\n                for (const r of rows) {\n                    const score = scoreMap.get(r.id) ?? 0;\n                    if (score >= minScore) {\n                        results.push({\n                            type: 'pattern',\n                            score,\n                            content: r.approach,\n                            metadata: {\n                                taskType: r.task_type,\n                                task: r.task,\n                                outcome: r.outcome,\n                                successRate: r.success_rate,\n                                critique: r.critique,\n                            },\n                        });\n                    }\n                }\n            }\n        }\n\n        // Sort by score descending\n        results.sort((a, b) => b.score - a.score);\n\n        // Apply re-ranking if available\n        if (this._deps.reranker && results.length > 1) {\n            return this._rerank(query, results);\n        }\n\n        return results;\n    }\n\n    /**\n     * Re-rank results using position-aware blending.\n     * \n     * Top 1-3:  75% retrieval / 25% reranker (preserves exact matches)\n     * Top 4-10: 60% retrieval / 40% reranker\n     * Top 11+:  40% retrieval / 60% reranker (trust reranker more)\n     */\n    private async _rerank(query: string, results: SearchResult[]): Promise<SearchResult[]> {\n        const reranker = this._deps.reranker!;\n        const documents = results.map(r => r.content);\n        const scores = await reranker.rank(query, documents);\n\n        const blended = results.map((r, i) => {\n            const pos = i + 1;\n            const rrfWeight = pos <= 3 ? 0.75 : pos <= 10 ? 0.60 : 0.40;\n            return {\n                ...r,\n                score: rrfWeight * r.score + (1 - rrfWeight) * (scores[i] ?? 0),\n            };\n        });\n\n        return blended.sort((a, b) => b.score - a.score);\n    }\n}\n","/**\n * BrainBank — FTS Utilities\n * \n * Shared helpers for SQLite FTS5 query sanitization.\n */\n\n/**\n * Sanitize a user query for FTS5 syntax.\n * Strips operators that would cause parse errors and converts\n * words to implicit AND with exact-match quoting.\n */\nexport function sanitizeFTS(query: string): string {\n    const clean = query\n        .replace(/[{}[\\]()^~*:]/g, ' ')\n        .replace(/\\bAND\\b|\\bOR\\b|\\bNOT\\b|\\bNEAR\\b/gi, '')\n        .trim();\n\n    const words = clean.split(/\\s+/).filter(w => w.length > 1);\n    if (words.length === 0) return '';\n\n    return words.map(w => `\"${w}\"`).join(' ');\n}\n\n/**\n * Normalize BM25 score from SQLite (negative, lower = better)\n * to 0.0–1.0 (higher = better) for consistency with vector search.\n */\nexport function normalizeBM25(rawScore: number): number {\n    const abs = Math.abs(rawScore);\n    return 1.0 / (1.0 + Math.exp(-0.3 * (abs - 5)));\n}\n","/**\n * BrainBank — BM25 Full-Text Search\n * \n * Keyword search via SQLite FTS5 with BM25 ranking.\n * Searches across code chunks, git commits, and memory patterns.\n * Uses Porter stemming + unicode61 tokenizer.\n */\n\nimport type { Database } from '../storage/database.ts';\nimport type { SearchResult } from '../types.ts';\nimport { sanitizeFTS, normalizeBM25 } from './fts-utils.ts';\n\nexport interface BM25Options {\n    /** Max code results. Default: 8 */\n    codeK?: number;\n    /** Max git results. Default: 5 */\n    gitK?: number;\n    /** Max memory results. Default: 4 */\n    memoryK?: number;\n}\n\nexport class BM25Search {\n    constructor(private _db: Database) {}\n\n    /**\n     * Full-text keyword search across all FTS5 indices.\n     * Uses BM25 scoring — lower scores = better matches.\n     * Query syntax: simple words, OR, NOT, \"exact phrases\", prefix*\n     */\n    search(query: string, options: BM25Options = {}): SearchResult[] {\n        const { codeK = 8, gitK = 5, memoryK = 4 } = options;\n        const results: SearchResult[] = [];\n\n        const ftsQuery = sanitizeFTS(query);\n        if (!ftsQuery) return [];\n\n        // ── Code search ────────────────────────────\n        if (codeK > 0) {\n            try {\n                const rows = this._db.prepare(`\n                    SELECT c.id, c.file_path, c.chunk_type, c.name, c.start_line, c.end_line,\n                           c.content, c.language, bm25(fts_code, 5.0, 3.0, 1.0) AS score\n                    FROM fts_code f\n                    JOIN code_chunks c ON c.id = f.rowid\n                    WHERE fts_code MATCH ?\n                    ORDER BY score ASC\n                    LIMIT ?\n                `).all(ftsQuery, codeK) as any[];\n\n                for (const r of rows) {\n                    results.push({\n                        type: 'code',\n                        score: normalizeBM25(r.score),\n                        filePath: r.file_path,\n                        content: r.content,\n                        metadata: {\n                            chunkType: r.chunk_type,\n                            name: r.name,\n                            startLine: r.start_line,\n                            endLine: r.end_line,\n                            language: r.language,\n                            searchType: 'bm25',\n                        },\n                    });\n                }\n            } catch {}\n        }\n\n        // ── Git search ─────────────────────────────\n        if (gitK > 0) {\n            try {\n                const rows = this._db.prepare(`\n                    SELECT c.id, c.hash, c.short_hash, c.message, c.author, c.date,\n                           c.files_json, c.diff, c.additions, c.deletions,\n                           bm25(fts_commits, 5.0, 2.0, 1.0) AS score\n                    FROM fts_commits f\n                    JOIN git_commits c ON c.id = f.rowid\n                    WHERE fts_commits MATCH ? AND c.is_merge = 0\n                    ORDER BY score ASC\n                    LIMIT ?\n                `).all(ftsQuery, gitK) as any[];\n\n                for (const r of rows) {\n                    results.push({\n                        type: 'commit',\n                        score: normalizeBM25(r.score),\n                        content: r.message,\n                        metadata: {\n                            hash: r.hash,\n                            shortHash: r.short_hash,\n                            author: r.author,\n                            date: r.date,\n                            files: JSON.parse(r.files_json ?? '[]'),\n                            additions: r.additions,\n                            deletions: r.deletions,\n                            diff: r.diff,\n                            searchType: 'bm25',\n                        },\n                    });\n                }\n            } catch {}\n        }\n\n        // ── Memory search ──────────────────────────\n        if (memoryK > 0) {\n            try {\n                const rows = this._db.prepare(`\n                    SELECT p.id, p.task_type, p.task, p.approach, p.outcome,\n                           p.success_rate, p.critique,\n                           bm25(fts_patterns, 3.0, 5.0, 5.0, 1.0) AS score\n                    FROM fts_patterns f\n                    JOIN memory_patterns p ON p.id = f.rowid\n                    WHERE fts_patterns MATCH ? AND p.success_rate >= 0.5\n                    ORDER BY score ASC\n                    LIMIT ?\n                `).all(ftsQuery, memoryK) as any[];\n\n                for (const r of rows) {\n                    results.push({\n                        type: 'pattern',\n                        score: normalizeBM25(r.score),\n                        content: r.approach,\n                        metadata: {\n                            taskType: r.task_type,\n                            task: r.task,\n                            outcome: r.outcome,\n                            successRate: r.success_rate,\n                            critique: r.critique,\n                            searchType: 'bm25',\n                        },\n                    });\n                }\n            } catch {}\n        }\n\n        return results.sort((a, b) => b.score - a.score);\n    }\n\n    /**\n     * Rebuild the FTS index from scratch.\n     * Call this after bulk imports or if FTS gets out of sync.\n     */\n    rebuild(): void {\n        try {\n            this._db.prepare(\"INSERT INTO fts_code(fts_code) VALUES('rebuild')\").run();\n            this._db.prepare(\"INSERT INTO fts_commits(fts_commits) VALUES('rebuild')\").run();\n            this._db.prepare(\"INSERT INTO fts_patterns(fts_patterns) VALUES('rebuild')\").run();\n        } catch {}\n    }\n\n}\n","/**\n * BrainBank — Context Builder\n * \n * Builds a formatted markdown context block from search results.\n * Ready for injection into an LLM system prompt.\n * Groups code by file, includes git history and learned patterns.\n */\n\nimport type { SearchResult, CoEditSuggestion, ContextOptions } from '../types.ts';\nimport type { UnifiedSearch } from './search.ts';\nimport type { CoEditAnalyzer } from './co-edits.ts';\n\nexport class ContextBuilder {\n    constructor(\n        private _search: UnifiedSearch,\n        private _coEdits: CoEditAnalyzer,\n    ) {}\n\n    /**\n     * Build a full context block for a task.\n     * Returns clean markdown ready for system prompt injection.\n     */\n    async build(task: string, options: ContextOptions = {}): Promise<string> {\n        const {\n            codeResults = 6,\n            gitResults = 5,\n            memoryResults = 4,\n            affectedFiles = [],\n            minScore = 0.25,\n            useMMR = true,\n            mmrLambda = 0.7,\n        } = options;\n\n        // Run unified search\n        const results = await this._search.search(task, {\n            codeK: codeResults,\n            gitK: gitResults,\n            memoryK: memoryResults,\n            minScore,\n            useMMR,\n            mmrLambda,\n        });\n\n        const parts: string[] = [`# Context for: \"${task}\"\\n`];\n\n        // ── Code Results ────────────────────────────\n        const codeHits = results.filter(r => r.type === 'code').slice(0, codeResults);\n        if (codeHits.length > 0) {\n            parts.push('## Relevant Code\\n');\n\n            // Group by file\n            const byFile = new Map<string, typeof codeHits>();\n            for (const r of codeHits) {\n                const key = r.filePath ?? 'unknown';\n                if (!byFile.has(key)) byFile.set(key, []);\n                byFile.get(key)!.push(r);\n            }\n\n            for (const [file, chunks] of byFile) {\n                parts.push(`### ${file}`);\n                for (const c of chunks) {\n                    const m = c.metadata;\n                    const label = m.name\n                        ? `${m.chunkType} \\`${m.name}\\` (L${m.startLine}-${m.endLine})`\n                        : `L${m.startLine}-${m.endLine}`;\n                    parts.push(`**${label}** — ${Math.round(c.score * 100)}% match`);\n                    parts.push('```' + (m.language || ''));\n                    parts.push(c.content);\n                    parts.push('```\\n');\n                }\n            }\n        }\n\n        // ── Git Results ─────────────────────────────\n        const gitHits = results.filter(r => r.type === 'commit').slice(0, gitResults);\n        if (gitHits.length > 0) {\n            parts.push('## Related Git History\\n');\n            for (const c of gitHits) {\n                const m = c.metadata;\n                const score = Math.round(c.score * 100);\n                const files = (m.files ?? []).slice(0, 4).join(', ');\n                parts.push(`**[${m.shortHash}]** ${c.content} *(${m.author}, ${m.date?.slice(0, 10)}, ${score}%)*`);\n                if (files) parts.push(`  Files: ${files}`);\n                if (m.diff) {\n                    const snippet = m.diff\n                        .split('\\n')\n                        .filter((l: string) => l.startsWith('+') || l.startsWith('-') || l.startsWith('@@'))\n                        .slice(0, 10)\n                        .join('\\n');\n                    if (snippet) {\n                        parts.push('```diff');\n                        parts.push(snippet);\n                        parts.push('```');\n                    }\n                }\n                parts.push('');\n            }\n        }\n\n        // ── Co-Edits ────────────────────────────────\n        if (affectedFiles.length > 0) {\n            const coEditLines: string[] = [];\n            for (const file of affectedFiles.slice(0, 3)) {\n                const suggestions = this._coEdits.suggest(file, 4);\n                if (suggestions.length > 0) {\n                    coEditLines.push(\n                        `- **${file}** → also tends to change: ${suggestions.map(s => `${s.file} (${s.count}x)`).join(', ')}`\n                    );\n                }\n            }\n            if (coEditLines.length > 0) {\n                parts.push('## Co-Edit Patterns\\n');\n                parts.push(...coEditLines);\n                parts.push('');\n            }\n        }\n\n        // ── Memory Results ──────────────────────────\n        const memHits = results.filter(r => r.type === 'pattern').slice(0, memoryResults);\n        if (memHits.length > 0) {\n            parts.push('## Learned Patterns\\n');\n            for (const p of memHits) {\n                const m = p.metadata;\n                const score = Math.round(p.score * 100);\n                const success = Math.round((m.successRate ?? 0) * 100);\n                parts.push(`**${m.taskType}** — ${success}% success, ${score}% match`);\n                parts.push(`Task: ${m.task}`);\n                parts.push(`Approach: ${p.content}`);\n                if (m.critique) parts.push(`Lesson: ${m.critique}`);\n                parts.push('');\n            }\n        }\n\n        return parts.join('\\n');\n    }\n}\n","/**\n * BrainBank — Collection\n * \n * Universal key-value store with vector + BM25 hybrid search.\n * The foundation primitive — store anything, search semantically.\n * \n *   const errors = brain.collection('debug_errors');\n *   await errors.add('Fixed null check in api handler', { file: 'api.ts' });\n *   const hits = await errors.search('null pointer');\n */\n\nimport type { Database } from '../storage/database.ts';\nimport type { EmbeddingProvider, Reranker } from '../types.ts';\nimport type { HNSWIndex } from '../vector/hnsw.ts';\nimport { reciprocalRankFusion } from '../query/rrf.ts';\nimport { sanitizeFTS, normalizeBM25 } from '../query/fts-utils.ts';\n\nexport interface CollectionItem {\n    id: number;\n    collection: string;\n    content: string;\n    metadata: Record<string, any>;\n    tags: string[];\n    createdAt: number;\n    expiresAt?: number;\n    score?: number;\n}\n\nexport interface CollectionSearchOptions {\n    /** Max results. Default: 5 */\n    k?: number;\n    /** Search mode. Default: 'hybrid' */\n    mode?: 'hybrid' | 'vector' | 'keyword';\n    /** Minimum score threshold. Default: 0.15 */\n    minScore?: number;\n    /** Filter by tags (item must have ALL specified tags). */\n    tags?: string[];\n}\n\nexport interface CollectionAddOptions {\n    /** Metadata key-value pairs. */\n    metadata?: Record<string, any>;\n    /** Tags for filtering. */\n    tags?: string[];\n    /** Time-to-live duration string (e.g. '7d', '24h', '30m'). */\n    ttl?: string;\n}\n\nexport class Collection {\n    constructor(\n        private _name: string,\n        private _db: Database,\n        private _embedding: EmbeddingProvider,\n        private _hnsw: HNSWIndex,\n        private _vecs: Map<number, Float32Array>,\n        private _reranker?: Reranker,\n    ) {}\n\n    /** Collection name. */\n    get name(): string { return this._name; }\n\n    /** Add an item. Returns its ID. */\n    async add(content: string, options: CollectionAddOptions | Record<string, any> = {}): Promise<number> {\n        // Support legacy signature: add(content, metadata)\n        const opts = 'tags' in options || 'ttl' in options || 'metadata' in options\n            ? options as CollectionAddOptions\n            : { metadata: options as Record<string, any> };\n\n        const metadata = opts.metadata ?? {};\n        const tags = opts.tags ?? [];\n        const expiresAt = opts.ttl ? Math.floor(Date.now() / 1000) + parseDuration(opts.ttl) : null;\n\n        const result = this._db.prepare(\n            'INSERT INTO kv_data (collection, content, meta_json, tags_json, expires_at) VALUES (?, ?, ?, ?, ?)'\n        ).run(this._name, content, JSON.stringify(metadata), JSON.stringify(tags), expiresAt);\n\n        const id = Number(result.lastInsertRowid);\n\n        const vec = await this._embedding.embed(content);\n        this._db.prepare(\n            'INSERT INTO kv_vectors (data_id, embedding) VALUES (?, ?)'\n        ).run(id, Buffer.from(vec.buffer));\n\n        this._hnsw.add(vec, id);\n        this._vecs.set(id, vec);\n\n        return id;\n    }\n\n    /** Add multiple items. Returns their IDs. */\n    async addMany(items: { content: string; metadata?: Record<string, any>; tags?: string[]; ttl?: string }[]): Promise<number[]> {\n        const ids: number[] = [];\n        for (const item of items) {\n            ids.push(await this.add(item.content, {\n                metadata: item.metadata,\n                tags: item.tags,\n                ttl: item.ttl,\n            }));\n        }\n        return ids;\n    }\n\n    /** Search this collection. */\n    async search(query: string, options: CollectionSearchOptions = {}): Promise<CollectionItem[]> {\n        const { k = 5, mode = 'hybrid', minScore = 0.15, tags } = options;\n\n        // Auto-prune expired items before search\n        this._pruneExpired();\n\n        if (mode === 'keyword') return this._filterByTags(this._searchBM25(query, k, minScore), tags);\n        if (mode === 'vector') return this._filterByTags(await this._searchVector(query, k, minScore), tags);\n\n        // Hybrid: vector + BM25 → RRF\n        const [vectorHits, bm25Hits] = await Promise.all([\n            this._searchVector(query, k, 0),\n            Promise.resolve(this._searchBM25(query, k, 0)),\n        ]);\n\n        const fused = reciprocalRankFusion([\n            vectorHits.map(h => ({ type: 'document' as const, score: h.score ?? 0, content: h.content, metadata: { id: h.id } })),\n            bm25Hits.map(h => ({ type: 'document' as const, score: h.score ?? 0, content: h.content, metadata: { id: h.id } })),\n        ]);\n\n        const allById = new Map<number, CollectionItem>();\n        for (const h of [...vectorHits, ...bm25Hits]) allById.set(h.id, h);\n\n        const results: CollectionItem[] = [];\n        for (const r of fused) {\n            const item = allById.get(r.metadata.id);\n            if (!item) continue;\n            const scored = { ...item, score: r.score };\n            if (scored.score >= minScore) results.push(scored);\n            if (results.length >= k) break;\n        }\n\n        // Apply re-ranking if available\n        if (this._reranker && results.length > 1) {\n            const documents = results.map(r => r.content);\n            const scores = await this._reranker.rank(query, documents);\n            const blended = results.map((r, i) => ({\n                ...r,\n                score: 0.6 * (r.score ?? 0) + 0.4 * (scores[i] ?? 0),\n            }));\n            return this._filterByTags(\n                blended.sort((a, b) => (b.score ?? 0) - (a.score ?? 0)),\n                tags,\n            );\n        }\n\n        return this._filterByTags(results, tags);\n    }\n\n    /** List items (newest first). */\n    list(options: { limit?: number; offset?: number; tags?: string[] } = {}): CollectionItem[] {\n        const { limit = 20, offset = 0, tags } = options;\n\n        // Auto-prune expired items\n        this._pruneExpired();\n\n        const rows = this._db.prepare(\n            'SELECT * FROM kv_data WHERE collection = ? AND (expires_at IS NULL OR expires_at > ?) ORDER BY created_at DESC, id DESC LIMIT ? OFFSET ?'\n        ).all(this._name, Math.floor(Date.now() / 1000), limit, offset) as any[];\n        return this._filterByTags(rows.map(r => this._rowToItem(r)), tags);\n    }\n\n    /** Count items in this collection. */\n    count(): number {\n        return (this._db.prepare(\n            'SELECT COUNT(*) as c FROM kv_data WHERE collection = ?'\n        ).get(this._name) as any).c;\n    }\n\n    /** Keep only the N most recent items, remove the rest. */\n    async trim(options: { keep: number }): Promise<{ removed: number }> {\n        const before = this.count();\n        if (before <= options.keep) return { removed: 0 };\n\n        // Get IDs to remove (oldest first, beyond the keep window)\n        const toRemove = this._db.prepare(`\n            SELECT id FROM kv_data \n            WHERE collection = ? \n            ORDER BY created_at DESC, id DESC \n            LIMIT -1 OFFSET ?\n        `).all(this._name, options.keep) as any[];\n\n        for (const row of toRemove) {\n            this._removeById(row.id);\n        }\n\n        return { removed: toRemove.length };\n    }\n\n    /** Remove items older than a duration string (e.g. '30d', '12h'). */\n    async prune(options: { olderThan: string }): Promise<{ removed: number }> {\n        const seconds = parseDuration(options.olderThan);\n        const cutoff = Math.floor(Date.now() / 1000) - seconds;\n\n        const toRemove = this._db.prepare(\n            'SELECT id FROM kv_data WHERE collection = ? AND created_at < ?'\n        ).all(this._name, cutoff) as any[];\n\n        for (const row of toRemove) {\n            this._removeById(row.id);\n        }\n\n        return { removed: toRemove.length };\n    }\n\n    /** Remove a specific item by ID. */\n    remove(id: number): void {\n        this._removeById(id);\n    }\n\n    /** Clear all items in this collection. */\n    clear(): void {\n        const rows = this._db.prepare(\n            'SELECT id FROM kv_data WHERE collection = ?'\n        ).all(this._name) as any[];\n\n        for (const row of rows) {\n            this._removeById(row.id);\n        }\n    }\n\n    // ── Private ──────────────────────────────────────\n\n    private _removeById(id: number): void {\n        // Remove from HNSW + cache\n        this._vecs.delete(id);\n        // Remove from DB (cascades to kv_vectors, FTS trigger handles fts_kv)\n        this._db.prepare('DELETE FROM kv_data WHERE id = ?').run(id);\n    }\n\n    private async _searchVector(query: string, k: number, minScore: number): Promise<CollectionItem[]> {\n        if (this._hnsw.size === 0) return [];\n\n        const queryVec = await this._embedding.embed(query);\n        // Search across all collections in HNSW, then filter\n        const hits = this._hnsw.search(queryVec, k * 3);\n\n        const ids = hits.map(h => h.id);\n        if (ids.length === 0) return [];\n\n        const scoreMap = new Map(hits.map(h => [h.id, h.score]));\n        const placeholders = ids.map(() => '?').join(',');\n\n        const rows = this._db.prepare(\n            `SELECT * FROM kv_data WHERE id IN (${placeholders}) AND collection = ?`\n        ).all(...ids, this._name) as any[];\n\n        return rows\n            .map(r => ({ ...this._rowToItem(r), score: scoreMap.get(r.id) ?? 0 }))\n            .filter(r => r.score >= minScore)\n            .sort((a, b) => (b.score ?? 0) - (a.score ?? 0))\n            .slice(0, k);\n    }\n\n    private _searchBM25(query: string, k: number, minScore: number): CollectionItem[] {\n        const ftsQuery = sanitizeFTS(query);\n        if (!ftsQuery) return [];\n\n        try {\n            const rows = this._db.prepare(`\n                SELECT d.*, bm25(fts_kv, 5.0, 1.0) AS score\n                FROM fts_kv f\n                JOIN kv_data d ON d.id = f.rowid\n                WHERE fts_kv MATCH ? AND d.collection = ?\n                ORDER BY score ASC\n                LIMIT ?\n            `).all(ftsQuery, this._name, k) as any[];\n\n            return rows\n                .map(r => ({\n                    ...this._rowToItem(r),\n                    score: normalizeBM25(r.score),\n                }))\n                .filter(r => (r.score ?? 0) >= minScore);\n        } catch {\n            return [];\n        }\n    }\n\n    private _rowToItem(r: any): CollectionItem {\n        return {\n            id: r.id,\n            collection: r.collection,\n            content: r.content,\n            metadata: JSON.parse(r.meta_json || '{}'),\n            tags: JSON.parse(r.tags_json || '[]'),\n            createdAt: r.created_at,\n            expiresAt: r.expires_at ?? undefined,\n        };\n    }\n\n    /** Filter results by tags (item must have ALL specified tags). */\n    private _filterByTags(items: CollectionItem[], tags?: string[]): CollectionItem[] {\n        if (!tags || tags.length === 0) return items;\n        return items.filter(item =>\n            tags.every(t => item.tags.includes(t))\n        );\n    }\n\n    /** Remove expired items (TTL). Called automatically on search/list. */\n    private _pruneExpired(): void {\n        const now = Math.floor(Date.now() / 1000);\n        const expired = this._db.prepare(\n            'SELECT id FROM kv_data WHERE collection = ? AND expires_at IS NOT NULL AND expires_at <= ?'\n        ).all(this._name, now) as any[];\n\n        for (const row of expired) {\n            this._removeById(row.id);\n        }\n    }\n}\n\n/** Parse a duration string like '30d', '12h', '5m' to seconds. */\nfunction parseDuration(s: string): number {\n    const match = s.match(/^(\\d+)([dhms])$/);\n    if (!match) throw new Error(`Invalid duration: \"${s}\". Use format like '30d', '12h', '5m'.`);\n\n    const n = parseInt(match[1], 10);\n    switch (match[2]) {\n        case 'd': return n * 86400;\n        case 'h': return n * 3600;\n        case 'm': return n * 60;\n        case 's': return n;\n        default: return n;\n    }\n}\n","/**\n * BrainBank — Main Orchestrator\n * \n * Composable semantic knowledge bank for AI agents.\n * Enable only the modules you need via .use():\n * \n *   import { BrainBank } from 'brainbank';\n *   import { code } from 'brainbank/code';\n *   import { docs } from 'brainbank/docs';\n *   import { notes } from 'brainbank/notes';\n *   import { memory } from 'brainbank/memory';\n *   \n *   const brain = new BrainBank()\n *     .use(code({ repoPath: '.' }))\n *     .use(docs())\n *     .use(notes())\n *     .use(memory());\n */\n\nimport { EventEmitter } from 'node:events';\nimport { resolveConfig } from './config.ts';\nimport { Database } from '../storage/database.ts';\nimport { HNSWIndex } from '../vector/hnsw.ts';\nimport { LocalEmbedding } from '../embeddings/local.ts';\nimport { UnifiedSearch } from '../query/search.ts';\nimport { BM25Search } from '../query/bm25.ts';\nimport { reciprocalRankFusion } from '../query/rrf.ts';\nimport { ContextBuilder } from '../query/context-builder.ts';\nimport { Collection } from './collection.ts';\nimport { reembedAll, setEmbeddingMeta, detectProviderMismatch } from './reembed.ts';\nimport { createWatcher, type WatchOptions, type Watcher } from './watch.ts';\nimport type { ReembedResult, ReembedOptions } from './reembed.ts';\nimport type { Indexer, IndexerContext } from '../plugins/types.ts';\nimport type {\n    BrainBankConfig, ResolvedConfig, EmbeddingProvider,\n    IndexResult, IndexStats, SearchResult,\n    ContextOptions, CoEditSuggestion, ProgressCallback,\n    DocumentCollection,\n} from '../types.ts';\n\nexport class BrainBank extends EventEmitter {\n    private _config: ResolvedConfig;\n    private _db!: Database;\n    private _embedding!: EmbeddingProvider;\n    private _modules = new Map<string, Indexer>();\n\n    // Cross-module search (created if code/git/memory are present)\n    private _search?: UnifiedSearch;\n    private _bm25?: BM25Search;\n    private _contextBuilder?: ContextBuilder;\n\n    private _initialized = false;\n    private _watcher?: Watcher;\n\n    // Collections\n    private _collections = new Map<string, Collection>();\n    private _kvHnsw?: HNSWIndex;\n    private _kvVecs = new Map<number, Float32Array>();\n\n    // Shared HNSW pool for multi-repo (code:frontend, code:backend share one HNSW)\n    private _sharedHnsw = new Map<string, { hnsw: HNSWIndex; vecCache: Map<number, Float32Array> }>();\n\n    constructor(config: BrainBankConfig = {}) {\n        super();\n        this._config = resolveConfig(config);\n    }\n\n    // ── Indexer Registration ────────────────────────\n\n    /**\n     * Register an indexer. Chainable.\n     * \n     *   brain.use(code({ repoPath: '.' })).use(docs());\n     */\n    use(indexer: Indexer): this {\n        if (this._initialized) {\n            throw new Error(\n                `BrainBank: Cannot add indexer '${indexer.name}' after initialization. ` +\n                `Call .use() before any operations.`\n            );\n        }\n        this._modules.set(indexer.name, indexer);\n        return this;\n    }\n\n    /** Get the list of registered indexer names. */\n    get indexers(): string[] {\n        return [...this._modules.keys()];\n    }\n\n    /** @deprecated Use .indexers instead. */\n    get modules(): string[] {\n        return this.indexers;\n    }\n\n    /** Check if an indexer is loaded. Also matches type prefix (e.g. 'code' matches 'code:frontend'). */\n    has(name: string): boolean {\n        if (this._modules.has(name)) return true;\n        // Check if any module starts with this type prefix\n        for (const key of this._modules.keys()) {\n            if (key.startsWith(name + ':')) return true;\n        }\n        return false;\n    }\n\n    /** Get an indexer instance. Throws if not loaded. */\n    indexer<T extends Indexer = Indexer>(name: string): T {\n        const mod = this._modules.get(name);\n        if (!mod) {\n            // Fall back to finding by type prefix\n            const first = this._findFirstByType(name);\n            if (first) return first as T;\n            throw new Error(\n                `BrainBank: Indexer '${name}' is not loaded. ` +\n                `Add .use(${name}()) to your BrainBank instance.`\n            );\n        }\n        return mod as T;\n    }\n\n    /** @deprecated Use .indexer() instead. */\n    module(name: string): Indexer {\n        return this.indexer(name);\n    }\n\n    /** Find all indexers whose name equals or starts with the type prefix. */\n    private _findAllByType(type: string): Indexer[] {\n        return [...this._modules.values()].filter(\n            m => m.name === type || m.name.startsWith(type + ':')\n        );\n    }\n\n    /** Find the first indexer that matches the type. */\n    private _findFirstByType(type: string): Indexer | undefined {\n        for (const m of this._modules.values()) {\n            if (m.name === type || m.name.startsWith(type + ':')) return m;\n        }\n        return undefined;\n    }\n\n    // ── Initialization ──────────────────────────────\n\n    /**\n     * Initialize database, HNSW indices, and load existing vectors.\n     * Only initializes registered modules.\n     * Automatically called by index/search methods if not yet initialized.\n     */\n    async initialize(): Promise<void> {\n        if (this._initialized) return;\n\n        const config = this._config;\n\n        // Database (always needed)\n        this._db = new Database(config.dbPath);\n\n        // Embedding provider (needed for modules and collections)\n        this._embedding = config.embeddingProvider ?? new LocalEmbedding();\n\n        // Initialize HNSW for dynamic collections (must come before indexer init)\n        this._kvHnsw = new HNSWIndex(\n            config.embeddingDims,\n            config.maxElements ?? 500_000,\n            config.hnswM,\n            config.hnswEfConstruction,\n            config.hnswEfSearch,\n        );\n        await this._kvHnsw.init();\n        this._loadVectors('kv_vectors', 'data_id', this._kvHnsw, this._kvVecs);\n\n        // Create the shared context for indexers\n        const ctx: IndexerContext = {\n            db: this._db,\n            embedding: this._embedding,\n            config: config,\n            createHnsw: async (maxElements?: number) => {\n                return new HNSWIndex(\n                    config.embeddingDims,\n                    maxElements ?? config.maxElements,\n                    config.hnswM,\n                    config.hnswEfConstruction,\n                    config.hnswEfSearch,\n                ).init();\n            },\n            loadVectors: (table, idCol, hnsw, cache) => {\n                this._loadVectors(table, idCol, hnsw, cache);\n            },\n            getOrCreateSharedHnsw: async (type: string, maxElements?: number) => {\n                const existing = this._sharedHnsw.get(type);\n                if (existing) return { ...existing, isNew: false };\n                const hnsw = await new HNSWIndex(\n                    config.embeddingDims,\n                    maxElements ?? config.maxElements,\n                    config.hnswM,\n                    config.hnswEfConstruction,\n                    config.hnswEfSearch,\n                ).init();\n                const vecCache = new Map<number, Float32Array>();\n                this._sharedHnsw.set(type, { hnsw, vecCache });\n                return { hnsw, vecCache, isNew: true };\n            },\n            collection: (name: string) => this.collection(name),\n        };\n\n        // Initialize all registered indexers\n        for (const mod of this._modules.values()) {\n            await mod.initialize(ctx);\n        }\n\n        // Cross-module search (needs code, git, or memory)\n        // For multi-repo: find ANY indexer that starts with 'code' or 'git'\n        const codeShared = this._sharedHnsw.get('code');\n        const gitShared = this._sharedHnsw.get('git');\n        const memMod = this._modules.get('memory') as any;\n\n        if (codeShared || gitShared || memMod) {\n            this._search = new UnifiedSearch({\n                db: this._db,\n                codeHnsw: codeShared?.hnsw,\n                gitHnsw: gitShared?.hnsw,\n                memHnsw: memMod?.hnsw,\n                codeVecs: codeShared?.vecCache ?? new Map(),\n                gitVecs: gitShared?.vecCache ?? new Map(),\n                memVecs: memMod?.vecCache ?? new Map(),\n                embedding: this._embedding,\n                reranker: this._config.reranker,\n            });\n\n            this._bm25 = new BM25Search(this._db);\n        }\n\n        // Context builder (needs search + optional co-edits from first git indexer)\n        if (this._search) {\n            const firstGit = this._findFirstByType('git') as any;\n            this._contextBuilder = new ContextBuilder(this._search, firstGit?.coEdits);\n        }\n\n        // Track embedding provider metadata\n        setEmbeddingMeta(this._db, this._embedding);\n\n        // Check for provider mismatch\n        const mismatch = detectProviderMismatch(this._db, this._embedding);\n        if (mismatch?.mismatch) {\n            this.emit('warning', {\n                type: 'provider_mismatch',\n                message: `Embedding provider changed (${mismatch.stored} → ${mismatch.current}). ` +\n                    `Run brain.reembed() to regenerate vectors.`,\n            });\n        }\n\n        this._initialized = true;\n        this.emit('initialized', { indexers: this.indexers });\n    }\n\n    // ── Collections ─────────────────────────────────\n\n    /**\n     * Get or create a dynamic collection.\n     * Collections are the universal data primitive — store anything, search semantically.\n     * \n     *   const errors = brain.collection('debug_errors');\n     *   await errors.add('Fixed null check', { file: 'api.ts' });\n     *   const hits = await errors.search('null pointer');\n     */\n    collection(name: string): Collection {\n        let coll = this._collections.get(name);\n        if (coll) return coll;\n\n        if (!this._initialized) {\n            throw new Error(\n                'BrainBank: Must call initialize() before using collections. ' +\n                'Or use await brain.collection() after an async operation.'\n            );\n        }\n\n        // Lazy-create shared HNSW for all collections\n        if (!this._kvHnsw) {\n            throw new Error('BrainBank: Collections HNSW not initialized. Call initialize() first.');\n        }\n\n        coll = new Collection(name, this._db, this._embedding, this._kvHnsw, this._kvVecs, this._config.reranker);\n        this._collections.set(name, coll);\n        return coll;\n    }\n\n    /** List all collection names that have data. */\n    listCollectionNames(): string[] {\n        const rows = this._db.prepare(\n            'SELECT DISTINCT collection FROM kv_data ORDER BY collection'\n        ).all() as any[];\n        return rows.map(r => r.collection);\n    }\n\n    // ── Indexing ─────────────────────────────────────\n\n    /**\n     * Index code and git history in one call.\n     * Incremental — only processes changes since last run.\n     */\n    async index(options: {\n        gitDepth?: number;\n        forceReindex?: boolean;\n        onProgress?: (stage: string, msg: string) => void;\n    } = {}): Promise<{ code?: IndexResult; git?: IndexResult }> {\n        await this.initialize();\n\n        const result: { code?: IndexResult; git?: IndexResult } = {};\n\n        // Index ALL code-type indexers (code, code:frontend, code:backend, etc.)\n        const codeMods = this._findAllByType('code');\n        for (const mod of codeMods) {\n            const label = mod.name === 'code' ? 'code' : mod.name;\n            options.onProgress?.(label, 'Starting...');\n            const r = await mod.index!({\n                forceReindex: options.forceReindex,\n                onProgress: (f: string, i: number, t: number) => options.onProgress?.(label, `[${i}/${t}] ${f}`),\n            });\n            // Merge results\n            if (result.code) {\n                result.code.indexed += r.indexed;\n                result.code.skipped += r.skipped;\n                result.code.chunks = (result.code.chunks ?? 0) + (r.chunks ?? 0);\n            } else {\n                result.code = r;\n            }\n        }\n\n        // Index ALL git-type indexers\n        const gitMods = this._findAllByType('git');\n        for (const mod of gitMods) {\n            const label = mod.name === 'git' ? 'git' : mod.name;\n            options.onProgress?.(label, 'Starting...');\n            const r = await mod.index!({\n                depth: options.gitDepth ?? this._config.gitDepth,\n                onProgress: (f: string, i: number, t: number) => options.onProgress?.(label, `[${i}/${t}] ${f}`),\n            });\n            if (result.git) {\n                result.git.indexed += r.indexed;\n                result.git.skipped += r.skipped;\n            } else {\n                result.git = r;\n            }\n        }\n\n        this.emit('indexed', result);\n        return result;\n    }\n\n    /** Index only code files. */\n    async indexCode(options: {\n        forceReindex?: boolean;\n        onProgress?: ProgressCallback;\n    } = {}): Promise<IndexResult> {\n        await this.initialize();\n        return this.module('code').index!(options);\n    }\n\n    /** Index only git history. */\n    async indexGit(options: {\n        depth?: number;\n        onProgress?: ProgressCallback;\n    } = {}): Promise<IndexResult> {\n        await this.initialize();\n        return this.module('git').index!(options);\n    }\n\n    // ── Document Collections ────────────────────────\n\n    /** Register a document collection. */\n    async addCollection(collection: DocumentCollection): Promise<void> {\n        await this.initialize();\n        this.module('docs').addCollection!(collection);\n    }\n\n    /** Remove a collection and all its indexed data. */\n    async removeCollection(name: string): Promise<void> {\n        await this.initialize();\n        this.module('docs').removeCollection!(name);\n    }\n\n    /** List all registered collections. */\n    listCollections(): DocumentCollection[] {\n        return this.module('docs').listCollections!();\n    }\n\n    /** Index all (or specific) document collections. */\n    async indexDocs(options: {\n        collections?: string[];\n        onProgress?: (collection: string, file: string, current: number, total: number) => void;\n    } = {}): Promise<Record<string, { indexed: number; skipped: number; chunks: number }>> {\n        await this.initialize();\n        const results = await this.module('docs').indexCollections!(options);\n        this.emit('docsIndexed', results);\n        return results;\n    }\n\n    /** Search documents only. */\n    async searchDocs(query: string, options?: {\n        collection?: string;\n        k?: number;\n        minScore?: number;\n    }): Promise<SearchResult[]> {\n        await this.initialize();\n        return this.module('docs').search!(query, options);\n    }\n\n    // ── Context Metadata ────────────────────────────\n\n    /** Add context description for a collection path. */\n    addContext(collection: string, path: string, context: string): void {\n        this.module('docs').addContext!(collection, path, context);\n    }\n\n    /** Remove context for a collection path. */\n    removeContext(collection: string, path: string): void {\n        this.module('docs').removeContext!(collection, path);\n    }\n\n    /** List all context entries. */\n    listContexts(): { collection: string; path: string; context: string }[] {\n        return this.module('docs').listContexts!();\n    }\n\n    // ── Context ─────────────────────────────────────\n\n    /**\n     * Get formatted context for a task.\n     * Returns markdown ready for system prompt injection.\n     */\n    async getContext(task: string, options: ContextOptions = {}): Promise<string> {\n        await this.initialize();\n\n        const sections: string[] = [];\n\n        // Code/git/patterns context\n        if (this._contextBuilder) {\n            const coreContext = await this._contextBuilder.build(task, options);\n            if (coreContext) sections.push(coreContext);\n        }\n\n        // Document context\n        if (this.has('docs')) {\n            const docResults = await this.searchDocs(task, { k: options.codeResults ?? 4 });\n            if (docResults.length > 0) {\n                const docSection = docResults.map(r => {\n                    const header = r.context\n                        ? `**[${r.metadata.collection}]** ${r.metadata.title} — _${r.context}_`\n                        : `**[${r.metadata.collection}]** ${r.metadata.title}`;\n                    return `${header}\\n\\n${r.content}`;\n                }).join('\\n\\n---\\n\\n');\n                sections.push(`## Relevant Documents\\n\\n${docSection}`);\n            }\n        }\n        return sections.join('\\n\\n');\n    }\n\n    // ── Search ──────────────────────────────────────\n\n    /** Semantic search across all loaded modules. */\n    async search(query: string, options?: {\n        codeK?: number; gitK?: number; memoryK?: number;\n        minScore?: number; useMMR?: boolean;\n    }): Promise<SearchResult[]> {\n        await this.initialize();\n        if (!this._search) {\n            // No code/git/memory — fall back to doc search\n            if (this.has('docs')) return this.searchDocs(query, { k: 8 });\n            return [];\n        }\n        return this._search.search(query, options);\n    }\n\n    /** Semantic search over code only. */\n    async searchCode(query: string, k: number = 8): Promise<SearchResult[]> {\n        this.module('code'); // throws if not loaded\n        await this.initialize();\n        return this._search!.search(query, { codeK: k, gitK: 0, memoryK: 0 });\n    }\n\n    /** Semantic search over commits only. */\n    async searchCommits(query: string, k: number = 8): Promise<SearchResult[]> {\n        this.module('git'); // throws if not loaded\n        await this.initialize();\n        return this._search!.search(query, { codeK: 0, gitK: k, memoryK: 0 });\n    }\n\n    // ── Hybrid Search ───────────────────────────────\n\n    /**\n     * Hybrid search: vector + BM25 fused with Reciprocal Rank Fusion.\n     * Best quality — catches both exact keyword matches and conceptual similarities.\n     */\n    async hybridSearch(query: string, options?: {\n        /** @deprecated Use collections: { code: N } instead */\n        codeK?: number;\n        /** @deprecated Use collections: { git: N } instead */\n        gitK?: number;\n        memoryK?: number;\n        minScore?: number; useMMR?: boolean;\n        /**\n         * Sources to include and max results per source.\n         * Reserved keys: \"code\", \"git\", \"docs\" control built-in indexers.\n         * Any other key is treated as a KV collection name.\n         * Example: { code: 8, git: 5, docs: 4, errors: 3, slack: 2 }\n         */\n        collections?: Record<string, number>;\n    }): Promise<SearchResult[]> {\n        await this.initialize();\n\n        const cols = options?.collections ?? {};\n        // Backward compat: codeK/gitK fallback when not in collections\n        const codeK = cols.code ?? options?.codeK ?? 6;\n        const gitK = cols.git ?? options?.gitK ?? 5;\n        const docsK = cols.docs ?? 8;\n\n        const resultLists: SearchResult[][] = [];\n\n        if (this._search) {\n            const searchOpts = { ...options, codeK, gitK };\n            const [vectorResults, bm25Results] = await Promise.all([\n                this._search.search(query, searchOpts),\n                Promise.resolve(this._bm25!.search(query, searchOpts)),\n            ]);\n            resultLists.push(vectorResults, bm25Results);\n        }\n\n        if (this.has('docs')) {\n            const docResults = await this.searchDocs(query, { k: docsK });\n            if (docResults.length > 0) resultLists.push(docResults);\n        }\n\n        // Include KV collections (skip reserved keys)\n        const reserved = new Set(['code', 'git', 'docs']);\n        for (const [name, k] of Object.entries(cols)) {\n            if (reserved.has(name)) continue;\n            const col = this.collection(name);\n            const hits = await col.search(query, { k });\n            if (hits.length > 0) {\n                resultLists.push(hits.map(h => ({\n                    type: 'collection' as const,\n                    score: h.score ?? 0,\n                    content: h.content,\n                    metadata: { collection: name, id: h.id, ...h.metadata },\n                })));\n            }\n        }\n\n        if (resultLists.length === 0) return [];\n\n        const fused = reciprocalRankFusion(resultLists);\n\n        // Apply position-aware re-ranking if available\n        if (this._config.reranker && fused.length > 1) {\n            const documents = fused.map(r => r.content);\n            const scores = await this._config.reranker.rank(query, documents);\n            const blended = fused.map((r, i) => {\n                const pos = i + 1;\n                const rrfWeight = pos <= 3 ? 0.75 : pos <= 10 ? 0.60 : 0.40;\n                return {\n                    ...r,\n                    score: rrfWeight * r.score + (1 - rrfWeight) * (scores[i] ?? 0),\n                };\n            });\n            return blended.sort((a, b) => b.score - a.score);\n        }\n\n        return fused;\n    }\n\n    /** BM25 keyword search only (no embeddings needed). */\n    searchBM25(query: string, options?: {\n        codeK?: number; gitK?: number; memoryK?: number;\n    }): SearchResult[] {\n        if (!this._bm25) return [];\n        return this._bm25.search(query, options);\n    }\n\n    /** Rebuild FTS5 indices. */\n    rebuildFTS(): void {\n        this._bm25?.rebuild();\n    }\n\n\n\n    // ── Query ───────────────────────────────────────\n\n    /** Get git history for a specific file. */\n    async fileHistory(filePath: string, limit: number = 20): Promise<any[]> {\n        this.module('git');\n        await this.initialize();\n        return this._db.prepare(`\n            SELECT c.short_hash, c.message, c.author, c.date, c.additions, c.deletions\n            FROM git_commits c\n            INNER JOIN commit_files cf ON c.id = cf.commit_id\n            WHERE cf.file_path LIKE ? AND c.is_merge = 0\n            ORDER BY c.timestamp DESC LIMIT ?\n        `).all(`%${filePath}%`, limit) as any[];\n    }\n\n    /** Get co-edit suggestions for a file. */\n    coEdits(filePath: string, limit: number = 5): CoEditSuggestion[] {\n        const gitMod = this.module('git') as any;\n        return gitMod.suggest(filePath, limit);\n    }\n\n    // ── Stats ───────────────────────────────────────\n\n    /** Get statistics for all loaded modules. */\n    stats(): IndexStats {\n        const result: IndexStats = {};\n\n        if (this.has('code')) {\n            const mod = this.indexer('code') as any;\n            result.code = {\n                files: (this._db.prepare('SELECT COUNT(DISTINCT file_path) as c FROM code_chunks').get() as any).c,\n                chunks: (this._db.prepare('SELECT COUNT(*) as c FROM code_chunks').get() as any).c,\n                hnswSize: mod.hnsw?.size ?? 0,\n            };\n        }\n\n        if (this.has('git')) {\n            const mod = this.indexer('git') as any;\n            result.git = {\n                commits: (this._db.prepare('SELECT COUNT(*) as c FROM git_commits').get() as any).c,\n                filesTracked: (this._db.prepare('SELECT COUNT(DISTINCT file_path) as c FROM commit_files').get() as any).c,\n                coEdits: (this._db.prepare('SELECT COUNT(*) as c FROM co_edits').get() as any).c,\n                hnswSize: mod.hnsw?.size ?? 0,\n            };\n        }\n\n        if (this.has('docs')) {\n            const mod = this.indexer('docs') as any;\n            result.documents = mod.stats();\n        }\n\n        return result;\n    }\n\n    // ── Watch Mode ───────────────────────────────────\n\n    /**\n     * Start watching for file changes and auto-re-index.\n     * Works with built-in and custom indexers.\n     * \n     *   const watcher = brain.watch({\n     *     onIndex: (file, indexer) => console.log(`${indexer}: ${file}`),\n     *   });\n     *   // later: watcher.close();\n     */\n    watch(options: WatchOptions = {}): Watcher {\n        if (!this._initialized) {\n            throw new Error('BrainBank: Not initialized. Call initialize() before watch().');\n        }\n\n        // Close any existing watcher\n        this._watcher?.close();\n\n        this._watcher = createWatcher(\n            async () => { await this.index(); },\n            this._modules,\n            this._config.repoPath,\n            options,\n        );\n\n        return this._watcher;\n    }\n\n    // ── Re-embedding ────────────────────────────────\n\n    /**\n     * Re-embed all existing text with the current embedding provider.\n     * Use this when switching providers (e.g. Local → OpenAI).\n     * Does NOT re-parse files, git history, or documents — only regenerates vectors.\n     *\n     * @example\n     *   const brain = new BrainBank({ embeddingProvider: new OpenAIEmbedding() });\n     *   await brain.initialize();\n     *   const result = await brain.reembed();\n     *   // → { code: 1200, git: 500, docs: 80, kv: 45, notes: 12, total: 1837 }\n     */\n    async reembed(options: ReembedOptions = {}): Promise<ReembedResult> {\n        if (!this._initialized) {\n            throw new Error('BrainBank: Not initialized. Call initialize() before reembed().');\n        }\n\n        // Build HNSW map for rebuild\n        const hnswMap = new Map<string, { hnsw: HNSWIndex; vecs: Map<number, Float32Array> }>();\n\n        // KV collections HNSW\n        if (this._kvHnsw) {\n            hnswMap.set('kv', { hnsw: this._kvHnsw, vecs: this._kvVecs });\n        }\n\n        // Indexer-managed HNSW indices\n        const codeMod = this._modules.get('code') as any;\n        const gitMod = this._modules.get('git') as any;\n        const memMod = this._modules.get('memory') as any;\n        const docsMod = this._modules.get('docs') as any;\n        const notesMod = this._modules.get('notes') as any;\n\n        if (codeMod?.hnsw) hnswMap.set('code', { hnsw: codeMod.hnsw, vecs: codeMod.vecCache });\n        if (gitMod?.hnsw) hnswMap.set('git', { hnsw: gitMod.hnsw, vecs: gitMod.vecCache });\n        if (memMod?.hnsw) hnswMap.set('memory', { hnsw: memMod.hnsw, vecs: memMod.vecCache });\n        if (notesMod?.hnsw) hnswMap.set('notes', { hnsw: notesMod.hnsw, vecs: notesMod.vecCache });\n        if (docsMod?.hnsw) hnswMap.set('docs', { hnsw: docsMod.hnsw, vecs: docsMod.vecCache });\n\n        const result = await reembedAll(\n            this._db,\n            this._embedding,\n            hnswMap,\n            options,\n        );\n\n        this.emit('reembedded', result);\n        return result;\n    }\n\n    // ── Lifecycle ────────────────────────────────────\n\n    /** Close database and release resources. */\n    close(): void {\n        this._watcher?.close();\n        for (const indexer of this._modules.values()) {\n            indexer.close?.();\n        }\n        if (this._db) this._db.close();\n        this._initialized = false;\n        this._collections.clear();\n    }\n\n    /** Whether the brainbank has been initialized. */\n    get isInitialized(): boolean {\n        return this._initialized;\n    }\n\n    /** The resolved configuration. */\n    get config(): Readonly<ResolvedConfig> {\n        return this._config;\n    }\n\n    // ── Internals ───────────────────────────────────\n\n    /** Load vectors from SQLite into HNSW index. */\n    private _loadVectors(\n        table: string,\n        idCol: string,\n        hnsw: HNSWIndex,\n        cache: Map<number, Float32Array>,\n    ): void {\n        const rows = this._db.prepare(`SELECT ${idCol}, embedding FROM ${table}`).all() as any[];\n        for (const row of rows) {\n            const vec = new Float32Array(row.embedding.buffer.slice(\n                row.embedding.byteOffset,\n                row.embedding.byteOffset + row.embedding.byteLength,\n            ));\n            hnsw.add(vec, row[idCol]);\n            cache.set(row[idCol], vec);\n        }\n    }\n}\n","/**\n * BrainBank — Database\n * \n * Thin wrapper over better-sqlite3.\n * Handles WAL mode, directory creation, schema init, and transactions.\n */\n\nimport BetterSqlite3 from 'better-sqlite3';\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { createSchema } from '../core/schema.ts';\n\nexport class Database {\n    readonly db: BetterSqlite3.Database;\n\n    constructor(dbPath: string) {\n        // Ensure parent directory exists\n        const dir = path.dirname(dbPath);\n        if (!fs.existsSync(dir)) {\n            fs.mkdirSync(dir, { recursive: true });\n        }\n\n        this.db = new BetterSqlite3(dbPath);\n        this.db.pragma('journal_mode = WAL');\n        this.db.pragma('synchronous = NORMAL');\n        this.db.pragma('foreign_keys = ON');\n\n        // Initialize schema\n        createSchema(this.db);\n    }\n\n    /**\n     * Run a function inside a transaction.\n     * Auto-commits on success, auto-rollbacks on error.\n     */\n    transaction<T>(fn: () => T): T {\n        const tx = this.db.transaction(fn);\n        return tx();\n    }\n\n    /**\n     * Run a prepared statement on multiple rows.\n     * Wraps in a single transaction for performance.\n     */\n    batch<T extends any[]>(sql: string, rows: T[]): void {\n        const stmt = this.db.prepare(sql);\n        const tx = this.db.transaction(() => {\n            for (const row of rows) {\n                stmt.run(...row);\n            }\n        });\n        tx();\n    }\n\n    /** Prepare a reusable statement. */\n    prepare(sql: string): BetterSqlite3.Statement {\n        return this.db.prepare(sql);\n    }\n\n    /** Execute raw SQL (no results). */\n    exec(sql: string): void {\n        this.db.exec(sql);\n    }\n\n    /** Close the database. */\n    close(): void {\n        this.db.close();\n    }\n}\n","/**\n * BrainBank — SQLite Schema\n * \n * Idempotent schema creation for the knowledge database.\n * Uses better-sqlite3 directly.\n */\n\nimport type Database from 'better-sqlite3';\n\nexport const SCHEMA_VERSION = 4;\n\n/**\n * Create all tables and indices.\n * Safe to call multiple times — uses IF NOT EXISTS.\n */\nexport function createSchema(db: Database.Database): void {\n    db.exec(`\n        -- ── Schema versioning ──────────────────────────\n        CREATE TABLE IF NOT EXISTS schema_version (\n            version     INTEGER PRIMARY KEY,\n            applied_at  INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n        INSERT OR IGNORE INTO schema_version (version) VALUES (${SCHEMA_VERSION});\n\n        -- ── Code chunks ────────────────────────────────\n        CREATE TABLE IF NOT EXISTS code_chunks (\n            id          INTEGER PRIMARY KEY AUTOINCREMENT,\n            file_path   TEXT    NOT NULL,\n            chunk_type  TEXT    NOT NULL,\n            name        TEXT,\n            start_line  INTEGER NOT NULL,\n            end_line    INTEGER NOT NULL,\n            content     TEXT    NOT NULL,\n            language    TEXT    NOT NULL,\n            file_hash   TEXT,\n            indexed_at  INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        CREATE TABLE IF NOT EXISTS code_vectors (\n            chunk_id    INTEGER PRIMARY KEY REFERENCES code_chunks(id) ON DELETE CASCADE,\n            embedding   BLOB    NOT NULL\n        );\n\n        CREATE TABLE IF NOT EXISTS indexed_files (\n            file_path   TEXT PRIMARY KEY,\n            file_hash   TEXT    NOT NULL,\n            indexed_at  INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        -- ── Git history ────────────────────────────────\n        CREATE TABLE IF NOT EXISTS git_commits (\n            id          INTEGER PRIMARY KEY AUTOINCREMENT,\n            hash        TEXT    UNIQUE NOT NULL,\n            short_hash  TEXT    NOT NULL,\n            message     TEXT    NOT NULL,\n            author      TEXT    NOT NULL,\n            date        TEXT    NOT NULL,\n            timestamp   INTEGER NOT NULL,\n            files_json  TEXT    NOT NULL,\n            diff        TEXT,\n            additions   INTEGER DEFAULT 0,\n            deletions   INTEGER DEFAULT 0,\n            is_merge    INTEGER DEFAULT 0\n        );\n\n        CREATE TABLE IF NOT EXISTS commit_files (\n            commit_id   INTEGER NOT NULL REFERENCES git_commits(id),\n            file_path   TEXT    NOT NULL\n        );\n\n        CREATE TABLE IF NOT EXISTS co_edits (\n            file_a      TEXT NOT NULL,\n            file_b      TEXT NOT NULL,\n            count       INTEGER NOT NULL DEFAULT 1,\n            PRIMARY KEY (file_a, file_b)\n        );\n\n        CREATE TABLE IF NOT EXISTS git_vectors (\n            commit_id   INTEGER PRIMARY KEY REFERENCES git_commits(id) ON DELETE CASCADE,\n            embedding   BLOB    NOT NULL\n        );\n\n        -- ── Agent memory ───────────────────────────────\n        CREATE TABLE IF NOT EXISTS memory_patterns (\n            id           INTEGER PRIMARY KEY AUTOINCREMENT,\n            task_type    TEXT    NOT NULL,\n            task         TEXT    NOT NULL,\n            approach     TEXT    NOT NULL,\n            outcome      TEXT,\n            success_rate REAL    NOT NULL DEFAULT 0.5,\n            critique     TEXT,\n            tokens_used  INTEGER,\n            latency_ms   INTEGER,\n            created_at   INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        CREATE TABLE IF NOT EXISTS memory_vectors (\n            pattern_id  INTEGER PRIMARY KEY REFERENCES memory_patterns(id) ON DELETE CASCADE,\n            embedding   BLOB    NOT NULL\n        );\n\n        CREATE TABLE IF NOT EXISTS distilled_strategies (\n            task_type   TEXT PRIMARY KEY,\n            strategy    TEXT    NOT NULL,\n            confidence  REAL    NOT NULL DEFAULT 0.8,\n            updated_at  INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        -- ── Indices ────────────────────────────────────\n        CREATE INDEX IF NOT EXISTS idx_cc_file      ON code_chunks(file_path);\n        CREATE INDEX IF NOT EXISTS idx_cf_path      ON commit_files(file_path);\n        CREATE INDEX IF NOT EXISTS idx_gc_ts        ON git_commits(timestamp DESC);\n        CREATE INDEX IF NOT EXISTS idx_gc_hash      ON git_commits(hash);\n        CREATE INDEX IF NOT EXISTS idx_mp_type      ON memory_patterns(task_type);\n        CREATE INDEX IF NOT EXISTS idx_mp_success   ON memory_patterns(success_rate);\n        CREATE INDEX IF NOT EXISTS idx_mp_created   ON memory_patterns(created_at);\n\n        -- ── FTS5 Full-Text Search ─────────────────────\n        -- Code chunks: search by file path, name, and content\n        CREATE VIRTUAL TABLE IF NOT EXISTS fts_code USING fts5(\n            file_path,\n            name,\n            content,\n            content='code_chunks',\n            content_rowid='id',\n            tokenize='porter unicode61'\n        );\n\n        -- Git commits: search by message, author, and diff\n        CREATE VIRTUAL TABLE IF NOT EXISTS fts_commits USING fts5(\n            message,\n            author,\n            diff,\n            content='git_commits',\n            content_rowid='id',\n            tokenize='porter unicode61'\n        );\n\n        -- Memory patterns: search by task type, task, approach, and critique\n        CREATE VIRTUAL TABLE IF NOT EXISTS fts_patterns USING fts5(\n            task_type,\n            task,\n            approach,\n            critique,\n            content='memory_patterns',\n            content_rowid='id',\n            tokenize='porter unicode61'\n        );\n\n        -- ── FTS5 Sync Triggers ────────────────────────\n        -- Auto-sync FTS indices on INSERT/UPDATE/DELETE\n\n        CREATE TRIGGER IF NOT EXISTS trg_fts_code_insert AFTER INSERT ON code_chunks BEGIN\n            INSERT INTO fts_code(rowid, file_path, name, content)\n            VALUES (new.id, new.file_path, COALESCE(new.name, ''), new.content);\n        END;\n        CREATE TRIGGER IF NOT EXISTS trg_fts_code_delete AFTER DELETE ON code_chunks BEGIN\n            INSERT INTO fts_code(fts_code, rowid, file_path, name, content)\n            VALUES ('delete', old.id, old.file_path, COALESCE(old.name, ''), old.content);\n        END;\n\n        CREATE TRIGGER IF NOT EXISTS trg_fts_commits_insert AFTER INSERT ON git_commits BEGIN\n            INSERT INTO fts_commits(rowid, message, author, diff)\n            VALUES (new.id, new.message, new.author, COALESCE(new.diff, ''));\n        END;\n        CREATE TRIGGER IF NOT EXISTS trg_fts_commits_delete AFTER DELETE ON git_commits BEGIN\n            INSERT INTO fts_commits(fts_commits, rowid, message, author, diff)\n            VALUES ('delete', old.id, old.message, old.author, COALESCE(old.diff, ''));\n        END;\n\n        CREATE TRIGGER IF NOT EXISTS trg_fts_patterns_insert AFTER INSERT ON memory_patterns BEGIN\n            INSERT INTO fts_patterns(rowid, task_type, task, approach, critique)\n            VALUES (new.id, new.task_type, new.task, new.approach, COALESCE(new.critique, ''));\n        END;\n        CREATE TRIGGER IF NOT EXISTS trg_fts_patterns_delete AFTER DELETE ON memory_patterns BEGIN\n            INSERT INTO fts_patterns(fts_patterns, rowid, task_type, task, approach, critique)\n            VALUES ('delete', old.id, old.task_type, old.task, old.approach, COALESCE(old.critique, ''));\n        END;\n\n        -- ── Note Memory ───────────────────────────────\n        CREATE TABLE IF NOT EXISTS note_memories (\n            id              INTEGER PRIMARY KEY AUTOINCREMENT,\n            title           TEXT    NOT NULL,\n            summary         TEXT    NOT NULL,\n            decisions_json  TEXT    NOT NULL DEFAULT '[]',\n            files_json      TEXT    NOT NULL DEFAULT '[]',\n            patterns_json   TEXT    NOT NULL DEFAULT '[]',\n            open_json       TEXT    NOT NULL DEFAULT '[]',\n            tags_json       TEXT    NOT NULL DEFAULT '[]',\n            tier            TEXT    NOT NULL DEFAULT 'short',\n            created_at      INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        CREATE TABLE IF NOT EXISTS note_vectors (\n            note_id     INTEGER PRIMARY KEY REFERENCES note_memories(id) ON DELETE CASCADE,\n            embedding   BLOB    NOT NULL\n        );\n\n        CREATE VIRTUAL TABLE IF NOT EXISTS fts_notes USING fts5(\n            title,\n            summary,\n            decisions,\n            patterns,\n            tags,\n            content='note_memories',\n            content_rowid='id',\n            tokenize='porter unicode61'\n        );\n\n        CREATE TRIGGER IF NOT EXISTS trg_fts_notes_insert AFTER INSERT ON note_memories BEGIN\n            INSERT INTO fts_notes(rowid, title, summary, decisions, patterns, tags)\n            VALUES (new.id, new.title, new.summary, new.decisions_json, new.patterns_json, new.tags_json);\n        END;\n        CREATE TRIGGER IF NOT EXISTS trg_fts_notes_delete AFTER DELETE ON note_memories BEGIN\n            INSERT INTO fts_notes(fts_notes, rowid, title, summary, decisions, patterns, tags)\n            VALUES ('delete', old.id, old.title, old.summary, old.decisions_json, old.patterns_json, old.tags_json);\n        END;\n\n        CREATE INDEX IF NOT EXISTS idx_nm_tier     ON note_memories(tier);\n        CREATE INDEX IF NOT EXISTS idx_nm_created  ON note_memories(created_at DESC);\n\n        -- ── Document Collections ──────────────────────\n        CREATE TABLE IF NOT EXISTS collections (\n            name        TEXT PRIMARY KEY,\n            path        TEXT    NOT NULL,\n            pattern     TEXT    NOT NULL DEFAULT '**/*.md',\n            ignore_json TEXT    NOT NULL DEFAULT '[]',\n            context     TEXT,\n            created_at  INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        CREATE TABLE IF NOT EXISTS doc_chunks (\n            id           INTEGER PRIMARY KEY AUTOINCREMENT,\n            collection   TEXT    NOT NULL REFERENCES collections(name) ON DELETE CASCADE,\n            file_path    TEXT    NOT NULL,\n            title        TEXT    NOT NULL,\n            content      TEXT    NOT NULL,\n            seq          INTEGER NOT NULL DEFAULT 0,\n            pos          INTEGER NOT NULL DEFAULT 0,\n            content_hash TEXT    NOT NULL,\n            indexed_at   INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        CREATE TABLE IF NOT EXISTS doc_vectors (\n            chunk_id    INTEGER PRIMARY KEY REFERENCES doc_chunks(id) ON DELETE CASCADE,\n            embedding   BLOB    NOT NULL\n        );\n\n        CREATE INDEX IF NOT EXISTS idx_dc_collection ON doc_chunks(collection);\n        CREATE INDEX IF NOT EXISTS idx_dc_file       ON doc_chunks(file_path);\n        CREATE INDEX IF NOT EXISTS idx_dc_hash       ON doc_chunks(content_hash);\n\n        CREATE VIRTUAL TABLE IF NOT EXISTS fts_docs USING fts5(\n            title,\n            content,\n            file_path,\n            collection,\n            content='doc_chunks',\n            content_rowid='id',\n            tokenize='porter unicode61'\n        );\n\n        CREATE TRIGGER IF NOT EXISTS trg_fts_docs_insert AFTER INSERT ON doc_chunks BEGIN\n            INSERT INTO fts_docs(rowid, title, content, file_path, collection)\n            VALUES (new.id, new.title, new.content, new.file_path, new.collection);\n        END;\n        CREATE TRIGGER IF NOT EXISTS trg_fts_docs_delete AFTER DELETE ON doc_chunks BEGIN\n            INSERT INTO fts_docs(fts_docs, rowid, title, content, file_path, collection)\n            VALUES ('delete', old.id, old.title, old.content, old.file_path, old.collection);\n        END;\n\n        -- ── Path Contexts ─────────────────────────────\n        CREATE TABLE IF NOT EXISTS path_contexts (\n            collection  TEXT    NOT NULL,\n            path        TEXT    NOT NULL,\n            context     TEXT    NOT NULL,\n            PRIMARY KEY (collection, path)\n        );\n\n        -- ── Dynamic Collections (KV Store) ───────────\n        CREATE TABLE IF NOT EXISTS kv_data (\n            id          INTEGER PRIMARY KEY AUTOINCREMENT,\n            collection  TEXT    NOT NULL,\n            content     TEXT    NOT NULL,\n            meta_json   TEXT    NOT NULL DEFAULT '{}',\n            tags_json   TEXT    NOT NULL DEFAULT '[]',\n            expires_at  INTEGER,\n            created_at  INTEGER NOT NULL DEFAULT (unixepoch())\n        );\n\n        CREATE TABLE IF NOT EXISTS kv_vectors (\n            data_id   INTEGER PRIMARY KEY REFERENCES kv_data(id) ON DELETE CASCADE,\n            embedding BLOB    NOT NULL\n        );\n\n        CREATE VIRTUAL TABLE IF NOT EXISTS fts_kv USING fts5(\n            content,\n            collection,\n            content='kv_data',\n            content_rowid='id',\n            tokenize='porter unicode61'\n        );\n\n        CREATE TRIGGER IF NOT EXISTS trg_fts_kv_insert AFTER INSERT ON kv_data BEGIN\n            INSERT INTO fts_kv(rowid, content, collection)\n            VALUES (new.id, new.content, new.collection);\n        END;\n        CREATE TRIGGER IF NOT EXISTS trg_fts_kv_delete AFTER DELETE ON kv_data BEGIN\n            INSERT INTO fts_kv(fts_kv, rowid, content, collection)\n            VALUES ('delete', old.id, old.content, old.collection);\n        END;\n\n        CREATE INDEX IF NOT EXISTS idx_kv_collection ON kv_data(collection);\n        CREATE INDEX IF NOT EXISTS idx_kv_created    ON kv_data(created_at DESC);\n\n        -- ── Embedding Metadata ───────────────────────\n        CREATE TABLE IF NOT EXISTS embedding_meta (\n            key     TEXT PRIMARY KEY,\n            value   TEXT NOT NULL\n        );\n    `);\n}\n\n/**\n * Get the current schema version from the database.\n */\nexport function getSchemaVersion(db: Database.Database): number {\n    try {\n        const row = db.prepare('SELECT MAX(version) as v FROM schema_version').get() as any;\n        return row?.v ?? 0;\n    } catch {\n        return 0;\n    }\n}\n","/**\n * BrainBank — Re-embedding Engine\n * \n * Regenerates all vectors without re-indexing.\n * Reads existing text from SQLite, embeds with the current provider,\n * and replaces vector BLOBs. No file I/O, no git parsing, no re-chunking.\n * \n * Usage:\n *   const result = await brain.reembed({ onProgress });\n *   // → { code: 1200, git: 500, docs: 80, kv: 45, notes: 12, total: 1837 }\n */\n\nimport type { Database } from '../storage/database.ts';\nimport type { EmbeddingProvider, ProgressCallback } from '../types.ts';\nimport type { HNSWIndex } from '../vector/hnsw.ts';\n\n// ── Table Definitions ───────────────────────────────\n\ninterface ReembedTable {\n    /** Human-readable name (for progress) */\n    name: string;\n    /** Table with text content */\n    textTable: string;\n    /** Table with vector BLOBs */\n    vectorTable: string;\n    /** PK column in text table */\n    idColumn: string;\n    /** FK column in vector table */\n    fkColumn: string;\n    /** Build the embedding text from a row (same logic as each indexer) */\n    textBuilder: (row: any) => string;\n}\n\nconst TABLES: ReembedTable[] = [\n    {\n        name: 'code',\n        textTable: 'code_chunks',\n        vectorTable: 'code_vectors',\n        idColumn: 'id',\n        fkColumn: 'chunk_id',\n        textBuilder: (r) => [\n            `File: ${r.file_path}`,\n            r.name ? `${r.chunk_type}: ${r.name}` : r.chunk_type,\n            r.content,\n        ].join('\\n'),\n    },\n    {\n        name: 'git',\n        textTable: 'git_commits',\n        vectorTable: 'git_vectors',\n        idColumn: 'id',\n        fkColumn: 'commit_id',\n        textBuilder: (r) => [\n            r.message,\n            r.diff ?? '',\n        ].filter(Boolean).join('\\n'),\n    },\n    {\n        name: 'memory',\n        textTable: 'memory_patterns',\n        vectorTable: 'memory_vectors',\n        idColumn: 'id',\n        fkColumn: 'pattern_id',\n        textBuilder: (r) => [\n            r.task_type,\n            r.task,\n            r.approach,\n            r.outcome ?? '',\n        ].filter(Boolean).join('\\n'),\n    },\n    {\n        name: 'notes',\n        textTable: 'note_memories',\n        vectorTable: 'note_vectors',\n        idColumn: 'id',\n        fkColumn: 'note_id',\n        textBuilder: (r) => [\n            r.title,\n            r.summary,\n            r.decisions_json !== '[]' ? `Decisions: ${r.decisions_json}` : '',\n            r.tags_json !== '[]' ? `Tags: ${r.tags_json}` : '',\n        ].filter(Boolean).join('\\n'),\n    },\n    {\n        name: 'docs',\n        textTable: 'doc_chunks',\n        vectorTable: 'doc_vectors',\n        idColumn: 'id',\n        fkColumn: 'chunk_id',\n        textBuilder: (r) => [\n            r.title ? `# ${r.title}` : '',\n            r.content,\n        ].filter(Boolean).join('\\n'),\n    },\n    {\n        name: 'kv',\n        textTable: 'kv_data',\n        vectorTable: 'kv_vectors',\n        idColumn: 'id',\n        fkColumn: 'data_id',\n        textBuilder: (r) => r.content,\n    },\n];\n\n// ── Result ──────────────────────────────────────────\n\nexport interface ReembedResult {\n    code: number;\n    git: number;\n    memory: number;\n    notes: number;\n    docs: number;\n    kv: number;\n    total: number;\n}\n\nexport interface ReembedOptions {\n    /** Progress callback: (tableName, current, total) */\n    onProgress?: ProgressCallback;\n    /** Batch size for embedBatch. Default: 50 */\n    batchSize?: number;\n}\n\n// ── Engine ──────────────────────────────────────────\n\n/**\n * Re-embed all existing text with the current embedding provider.\n * Does NOT re-parse files, git, or documents — only replaces vectors.\n */\nexport async function reembedAll(\n    db: Database,\n    embedding: EmbeddingProvider,\n    hnswMap: Map<string, { hnsw: HNSWIndex; vecs: Map<number, Float32Array> }>,\n    options: ReembedOptions = {},\n): Promise<ReembedResult> {\n    const { batchSize = 50, onProgress } = options;\n    const result: Record<string, number> = {};\n    let total = 0;\n\n    for (const table of TABLES) {\n        const count = await reembedTable(db, embedding, table, batchSize, onProgress);\n        result[table.name] = count;\n        total += count;\n\n        // Rebuild HNSW if available\n        const entry = hnswMap.get(table.name);\n        if (entry && count > 0) {\n            await rebuildHnsw(db, table, entry.hnsw, entry.vecs);\n        }\n    }\n\n    // Update embedding metadata\n    const meta = {\n        provider: embedding.constructor?.name ?? 'unknown',\n        dims: String(embedding.dims),\n        reembedded_at: new Date().toISOString(),\n    };\n    const upsert = db.prepare(\n        'INSERT OR REPLACE INTO embedding_meta (key, value) VALUES (?, ?)'\n    );\n    for (const [k, v] of Object.entries(meta)) {\n        upsert.run(k, v);\n    }\n\n    return {\n        code: result.code ?? 0,\n        git: result.git ?? 0,\n        memory: result.memory ?? 0,\n        notes: result.notes ?? 0,\n        docs: result.docs ?? 0,\n        kv: result.kv ?? 0,\n        total,\n    };\n}\n\n/** Re-embed a single table. Returns count of vectors regenerated. */\nasync function reembedTable(\n    db: Database,\n    embedding: EmbeddingProvider,\n    table: ReembedTable,\n    batchSize: number,\n    onProgress?: ProgressCallback,\n): Promise<number> {\n    const rows = db.prepare(\n        `SELECT * FROM ${table.textTable}`\n    ).all() as any[];\n\n    if (rows.length === 0) return 0;\n\n    // Clear existing vectors\n    db.prepare(`DELETE FROM ${table.vectorTable}`).run();\n\n    const insertVec = db.prepare(\n        `INSERT INTO ${table.vectorTable} (${table.fkColumn}, embedding) VALUES (?, ?)`\n    );\n\n    let processed = 0;\n\n    // Process in batches\n    for (let i = 0; i < rows.length; i += batchSize) {\n        const batch = rows.slice(i, i + batchSize);\n        const texts = batch.map(r => table.textBuilder(r));\n        const vectors = await embedding.embedBatch(texts);\n\n        db.transaction(() => {\n            for (let j = 0; j < batch.length; j++) {\n                const id = batch[j][table.idColumn];\n                const vec = vectors[j];\n                insertVec.run(id, Buffer.from(vec.buffer));\n            }\n        });\n\n        processed += batch.length;\n        onProgress?.(table.name, processed, rows.length);\n    }\n\n    return processed;\n}\n\n/** Rebuild HNSW index from vector table. */\nasync function rebuildHnsw(\n    db: Database,\n    table: ReembedTable,\n    hnsw: HNSWIndex,\n    vecs: Map<number, Float32Array>,\n): Promise<void> {\n    // Clear existing HNSW\n    vecs.clear();\n\n    const rows = db.prepare(\n        `SELECT ${table.fkColumn} as id, embedding FROM ${table.vectorTable}`\n    ).all() as any[];\n\n    for (const row of rows) {\n        const vec = new Float32Array(new Uint8Array(row.embedding).buffer);\n        hnsw.add(vec, row.id);\n        vecs.set(row.id, vec);\n    }\n}\n\n// ── Provider Detection ──────────────────────────────\n\n/** Get stored embedding metadata. Returns null if not set. */\nexport function getEmbeddingMeta(db: Database): { provider: string; dims: number } | null {\n    try {\n        const provider = db.prepare(\n            \"SELECT value FROM embedding_meta WHERE key = 'provider'\"\n        ).get() as any;\n        const dims = db.prepare(\n            \"SELECT value FROM embedding_meta WHERE key = 'dims'\"\n        ).get() as any;\n\n        if (!provider || !dims) return null;\n        return { provider: provider.value, dims: Number(dims.value) };\n    } catch {\n        return null;\n    }\n}\n\n/** Store current provider info. */\nexport function setEmbeddingMeta(db: Database, embedding: EmbeddingProvider): void {\n    const upsert = db.prepare(\n        'INSERT OR REPLACE INTO embedding_meta (key, value) VALUES (?, ?)'\n    );\n    upsert.run('provider', embedding.constructor?.name ?? 'unknown');\n    upsert.run('dims', String(embedding.dims));\n    upsert.run('indexed_at', new Date().toISOString());\n}\n\n/** Check if the configured provider differs from what's stored. */\nexport function detectProviderMismatch(\n    db: Database,\n    embedding: EmbeddingProvider,\n): { mismatch: boolean; stored: string; current: string } | null {\n    const meta = getEmbeddingMeta(db);\n    if (!meta) return null; // First time, no mismatch\n\n    const currentName = embedding.constructor?.name ?? 'unknown';\n    const mismatch = meta.dims !== embedding.dims || meta.provider !== currentName;\n\n    return {\n        mismatch,\n        stored: `${meta.provider}/${meta.dims}`,\n        current: `${currentName}/${embedding.dims}`,\n    };\n}\n","/**\n * BrainBank — Watch Mode\n * \n * Auto-indexes on file changes using fs.watch.\n * Works with built-in indexers (code, git, docs) and custom indexers.\n * \n * Built-in behavior:\n *   - Code files → re-indexes changed file\n *   - Doc files  → re-indexes changed collection\n * \n * Custom indexers:\n *   - Implement `onFileChange(path, event)` to handle changes\n *   - Implement `watchPatterns()` to specify which files to watch\n * \n * Usage:\n *   const watcher = brain.watch({ paths: ['.'] });\n *   watcher.close(); // stop watching\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { isSupported, isIgnoredDir, isIgnoredFile } from '../indexers/languages.ts';\nimport type { Indexer } from '../plugins/types.ts';\n\n// ── Types ───────────────────────────────────────────\n\nexport interface WatchOptions {\n    /** Paths to watch. Default: [config.repoPath] */\n    paths?: string[];\n    /** Debounce interval in ms. Default: 2000 */\n    debounceMs?: number;\n    /** Called when a file is re-indexed. */\n    onIndex?: (filePath: string, indexer: string) => void;\n    /** Called on errors. */\n    onError?: (error: Error) => void;\n}\n\nexport interface Watcher {\n    /** Stop watching. */\n    close(): void;\n    /** Whether the watcher is active. */\n    readonly active: boolean;\n}\n\n// ── Watch Engine ────────────────────────────────────\n\n/**\n * Create a file watcher that auto-re-indexes on changes.\n * \n * @param reindexFn  — called to re-index code+git (brain.index())\n * @param indexers   — registered indexers (for custom onFileChange hooks)\n * @param repoPath   — base repo path (for resolving relative paths)\n * @param options    — watch configuration\n */\nexport function createWatcher(\n    reindexFn: () => Promise<void>,\n    indexers: Map<string, Indexer>,\n    repoPath: string,\n    options: WatchOptions = {},\n): Watcher {\n    const {\n        paths = [repoPath],\n        debounceMs = 2000,\n        onIndex,\n        onError,\n    } = options;\n\n    let active = true;\n    const watchers: fs.FSWatcher[] = [];\n    const pending = new Set<string>();\n    let timer: ReturnType<typeof setTimeout> | null = null;\n\n    // Collect custom watch patterns from indexers\n    const customPatterns: { indexer: Indexer; patterns: string[] }[] = [];\n    for (const indexer of indexers.values()) {\n        if (indexer.watchPatterns) {\n            customPatterns.push({ indexer, patterns: indexer.watchPatterns() });\n        }\n    }\n\n    // Check if a file matches any custom indexer pattern\n    function matchCustomIndexer(filePath: string): Indexer | null {\n        const rel = path.relative(repoPath, filePath);\n        for (const { indexer, patterns } of customPatterns) {\n            for (const pattern of patterns) {\n                if (matchGlob(rel, pattern)) return indexer;\n            }\n        }\n        return null;\n    }\n\n    // Simple glob matching (supports **, *, and extension matching)\n    function matchGlob(filePath: string, pattern: string): boolean {\n        // **/*.ext → match any file with that extension\n        if (pattern.startsWith('**/')) {\n            const suffix = pattern.slice(3); // e.g. \"*.csv\"\n            const ext = suffix.startsWith('*.') ? suffix.slice(1) : null; // e.g. \".csv\"\n            if (ext) return filePath.endsWith(ext);\n            return path.basename(filePath) === suffix;\n        }\n        // *.ext → match extension in any directory\n        if (pattern.startsWith('*.')) {\n            return filePath.endsWith(pattern.slice(1));\n        }\n        return filePath === pattern;\n    }\n\n    // Process pending file changes\n    async function flush() {\n        if (pending.size === 0) return;\n\n        const files = [...pending];\n        pending.clear();\n\n        // Group by handler\n        let needsReindex = false;\n\n        for (const filePath of files) {\n            const absPath = path.resolve(repoPath, filePath);\n\n            // Try custom indexers first\n            const customIndexer = matchCustomIndexer(absPath);\n            if (customIndexer?.onFileChange) {\n                try {\n                    const handled = await customIndexer.onFileChange(absPath, detectEvent(absPath));\n                    if (handled) {\n                        onIndex?.(filePath, customIndexer.name);\n                        continue;\n                    }\n                } catch (err) {\n                    onError?.(err instanceof Error ? err : new Error(String(err)));\n                }\n            }\n\n            // Fall back to built-in re-index for supported code files\n            if (isSupported(filePath)) {\n                needsReindex = true;\n                onIndex?.(filePath, 'code');\n            }\n        }\n\n        // Batch re-index if any code files changed\n        if (needsReindex) {\n            try {\n                await reindexFn();\n            } catch (err) {\n                onError?.(err instanceof Error ? err : new Error(String(err)));\n            }\n        }\n    }\n\n    function detectEvent(filePath: string): 'create' | 'update' | 'delete' {\n        try {\n            fs.accessSync(filePath);\n            return 'update';\n        } catch {\n            return 'delete';\n        }\n    }\n\n    // Should we watch this file?\n    function shouldWatch(filename: string): boolean {\n        if (!filename) return false;\n        const parts = filename.split(path.sep);\n\n        // Skip ignored directories\n        for (const part of parts) {\n            if (isIgnoredDir(part)) return false;\n        }\n\n        // Skip ignored files\n        if (isIgnoredFile(path.basename(filename))) return false;\n\n        // Accept supported code files\n        if (isSupported(filename)) return true;\n\n        // Accept files matching custom indexer patterns\n        if (matchCustomIndexer(path.resolve(repoPath, filename))) return true;\n\n        return false;\n    }\n\n    // Set up watchers\n    for (const watchPath of paths) {\n        const resolved = path.resolve(watchPath);\n        try {\n            const watcher = fs.watch(resolved, { recursive: true }, (_event, filename) => {\n                if (!active || !filename) return;\n                if (!shouldWatch(filename)) return;\n\n                pending.add(filename);\n\n                // Debounce\n                if (timer) clearTimeout(timer);\n                timer = setTimeout(() => flush(), debounceMs);\n            });\n\n            watcher.on('error', (err) => {\n                onError?.(err instanceof Error ? err : new Error(String(err)));\n            });\n\n            watchers.push(watcher);\n        } catch (err) {\n            onError?.(err instanceof Error ? err : new Error(String(err)));\n        }\n    }\n\n    return {\n        close() {\n            active = false;\n            if (timer) clearTimeout(timer);\n            for (const w of watchers) w.close();\n            watchers.length = 0;\n        },\n        get active() { return active; },\n    };\n}\n"],"mappings":";;;;;;;;;;;;;;;;AACA,YAAY,UAAU;AAIf,IAAM,WAA2B;AAAA,EACpC,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,aAAa;AAAA;AAAA,EACb,cAAc;AAAA,EACd,OAAO;AAAA,EACP,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,eAAe;AAAA,EACf,aAAa;AACjB;AASO,SAAS,cAAc,UAA2B,CAAC,GAAmB;AACzE,QAAM,WAAgB,aAAQ,QAAQ,YAAY,SAAS,QAAQ;AACnE,QAAM,YAAY,QAAQ,UAAU,SAAS;AAE7C,QAAM,SAAc,gBAAW,SAAS,IAAI,YAAiB,UAAK,UAAU,SAAS;AAErF,SAAO;AAAA,IACH;AAAA,IACA;AAAA,IACA,UAAmB,QAAQ,YAAqB,SAAS;AAAA,IACzD,aAAmB,QAAQ,eAAqB,SAAS;AAAA,IACzD,cAAmB,QAAQ,gBAAqB,SAAS;AAAA,IACzD,OAAmB,QAAQ,SAAqB,SAAS;AAAA,IACzD,oBAAoB,QAAQ,sBAAsB,SAAS;AAAA,IAC3D,cAAmB,QAAQ,gBAAqB,SAAS;AAAA,IACzD,eAAmB,QAAQ,iBAAqB,SAAS;AAAA,IACzD,aAAmB,QAAQ,eAAqB,SAAS;AAAA,IACzD,mBAAmB,QAAQ;AAAA,IAC3B,UAAU,QAAQ;AAAA,EACtB;AACJ;AApBgB;;;ACfT,IAAM,YAAN,MAAuC;AAAA,EAI1C,YACY,OACA,eAAuB,KACvB,KAAa,IACb,kBAA0B,KAC1B,YAAoB,IAC9B;AALU;AACA;AACA;AACA;AACA;AAAA,EACT;AAAA,EApBP,OAU8C;AAAA;AAAA;AAAA,EAClC,SAAc;AAAA,EACd,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAcjB,MAAM,OAAsB;AACxB,UAAM,UAAU,MAAM,OAAO,cAAc;AAC3C,UAAM,OAAO,QAAQ,SAAS,mBAAmB,QAAQ;AACzD,SAAK,SAAS,IAAI,KAAK,UAAU,KAAK,KAAK;AAC3C,SAAK,OAAO,UAAU,KAAK,cAAc,KAAK,IAAI,KAAK,eAAe;AACtE,SAAK,OAAO,MAAM,KAAK,SAAS;AAChC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAI,QAAsB,IAAkB;AACxC,QAAI,CAAC,KAAK,OAAQ,OAAM,IAAI,MAAM,qDAAgD;AAClF,SAAK,OAAO,SAAS,MAAM,KAAK,MAAM,GAAG,EAAE;AAC3C,SAAK;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAqB,GAAwB;AAChD,QAAI,CAAC,KAAK,UAAU,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/C,UAAM,UAAU,KAAK,IAAI,GAAG,KAAK,MAAM;AACvC,UAAM,SAAS,KAAK,OAAO,UAAU,MAAM,KAAK,KAAK,GAAG,OAAO;AAE/D,WAAO,OAAO,UAAU,IAAI,CAAC,IAAY,OAAe;AAAA,MACpD;AAAA,MACA,OAAO,IAAI,OAAO,UAAU,CAAC;AAAA,IACjC,EAAE;AAAA,EACN;AAAA;AAAA,EAGA,IAAI,OAAe;AACf,WAAO,KAAK;AAAA,EAChB;AACJ;;;ACxDO,IAAM,iBAAN,MAAkD;AAAA,EAVzD,OAUyD;AAAA;AAAA;AAAA,EAC5C,OAAe;AAAA,EAEhB,YAAiB;AAAA,EACjB;AAAA,EACA;AAAA,EAER,YAAY,UAAiD,CAAC,GAAG;AAC7D,SAAK,aAAa,QAAQ,SAAS;AACnC,SAAK,YAAY,QAAQ,YAAY;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,eAA6B;AACvC,QAAI,KAAK,UAAW,QAAO,KAAK;AAEhC,UAAM,EAAE,UAAU,IAAI,IAAI,MAAM,OAAO,sBAA6B;AACpE,QAAI,WAAW,KAAK;AACpB,QAAI,mBAAmB;AAEvB,SAAK,YAAY,MAAM,SAAS,sBAAsB,KAAK,YAAY;AAAA,MACnE,WAAW;AAAA,IACf,CAAC;AAED,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAM,MAAqC;AAC7C,UAAM,OAAO,MAAM,KAAK,aAAa;AACrC,UAAM,SAAS,MAAM,KAAK,MAAM,EAAE,SAAS,QAAQ,WAAW,KAAK,CAAC;AACpE,WAAO,OAAO;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,WAAW,OAA0C;AACvD,UAAM,UAA0B,CAAC;AACjC,eAAW,QAAQ,OAAO;AACtB,cAAQ,KAAK,MAAM,KAAK,MAAM,IAAI,CAAC;AAAA,IACvC;AACA,WAAO;AAAA,EACX;AAAA,EAEA,MAAM,QAAuB;AACzB,SAAK,YAAY;AAAA,EACrB;AACJ;;;AC/CO,SAAS,UACZ,OACA,OACA,aACA,GACA,SAAiB,KACN;AAEX,QAAM,aAAa,MAAM,OAAO,OAAO,IAAI,CAAC;AAC5C,MAAI,WAAW,UAAU,EAAG,QAAO;AAEnC,QAAM,WAAwB,CAAC;AAC/B,QAAM,YAAY,CAAC,GAAG,UAAU;AAEhC,SAAO,SAAS,SAAS,KAAK,UAAU,SAAS,GAAG;AAChD,QAAI,YAAY;AAChB,QAAI,UAAU;AAEd,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,YAAM,YAAY,UAAU,CAAC,EAAE;AAG/B,UAAI,SAAS;AACb,iBAAW,OAAO,UAAU;AACxB,cAAM,eAAe,YAAY,IAAI,UAAU,CAAC,EAAE,EAAE;AACpD,cAAM,cAAc,YAAY,IAAI,IAAI,EAAE;AAC1C,YAAI,gBAAgB,aAAa;AAC7B,mBAAS,KAAK,IAAI,QAAQ,iBAAiB,cAAc,WAAW,CAAC;AAAA,QACzE;AAAA,MACJ;AAGA,YAAM,WAAW,SAAS,aAAa,IAAI,UAAU;AAErD,UAAI,WAAW,WAAW;AACtB,oBAAY;AACZ,kBAAU;AAAA,MACd;AAAA,IACJ;AAEA,aAAS,KAAK,UAAU,OAAO,CAAC;AAChC,cAAU,OAAO,SAAS,CAAC;AAAA,EAC/B;AAEA,SAAO;AACX;AA7CgB;;;ACqBT,IAAM,gBAAN,MAAoB;AAAA,EAvC3B,OAuC2B;AAAA;AAAA;AAAA,EACf;AAAA,EAER,YAAY,MAAkB;AAC1B,SAAK,QAAQ;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,OAAe,UAAyB,CAAC,GAA4B;AAC9E,UAAM;AAAA,MACF,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,UAAU;AAAA,MACV,WAAW;AAAA,MACX,SAAS;AAAA,MACT,YAAY;AAAA,IAChB,IAAI;AAEJ,UAAM,WAAW,MAAM,KAAK,MAAM,UAAU,MAAM,KAAK;AACvD,UAAM,UAA0B,CAAC;AAGjC,QAAI,KAAK,MAAM,YAAY,KAAK,MAAM,SAAS,OAAO,GAAG;AACrD,YAAM,OAAO,SACP,UAAU,KAAK,MAAM,UAAU,UAAU,KAAK,MAAM,UAAU,OAAO,SAAS,IAC9E,KAAK,MAAM,SAAS,OAAO,UAAU,KAAK;AAEhD,UAAI,KAAK,SAAS,GAAG;AACjB,cAAM,MAAM,KAAK,IAAI,OAAK,EAAE,EAAE;AAC9B,cAAM,WAAW,IAAI,IAAI,KAAK,IAAI,OAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACvD,cAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAEhD,cAAM,OAAO,KAAK,MAAM,GAAG;AAAA,UACvB,0CAA0C,YAAY;AAAA,QAC1D,EAAE,IAAI,GAAG,GAAG;AAEZ,mBAAW,KAAK,MAAM;AAClB,gBAAM,QAAQ,SAAS,IAAI,EAAE,EAAE,KAAK;AACpC,cAAI,SAAS,UAAU;AACnB,oBAAQ,KAAK;AAAA,cACT,MAAM;AAAA,cACN;AAAA,cACA,UAAU,EAAE;AAAA,cACZ,SAAS,EAAE;AAAA,cACX,UAAU;AAAA,gBACN,WAAW,EAAE;AAAA,gBACb,MAAM,EAAE;AAAA,gBACR,WAAW,EAAE;AAAA,gBACb,SAAS,EAAE;AAAA,gBACX,UAAU,EAAE;AAAA,cAChB;AAAA,YACJ,CAAC;AAAA,UACL;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAGA,QAAI,KAAK,MAAM,WAAW,KAAK,MAAM,QAAQ,OAAO,GAAG;AACnD,YAAM,OAAO,KAAK,MAAM,QAAQ,OAAO,UAAU,OAAO,CAAC;AAEzD,UAAI,KAAK,SAAS,GAAG;AACjB,cAAM,MAAM,KAAK,IAAI,OAAK,EAAE,EAAE;AAC9B,cAAM,WAAW,IAAI,IAAI,KAAK,IAAI,OAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACvD,cAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAEhD,cAAM,OAAO,KAAK,MAAM,GAAG;AAAA,UACvB,0CAA0C,YAAY;AAAA,QAC1D,EAAE,IAAI,GAAG,GAAG;AAEZ,mBAAW,KAAK,MAAM;AAClB,gBAAM,QAAQ,SAAS,IAAI,EAAE,EAAE,KAAK;AACpC,cAAI,SAAS,UAAU;AACnB,oBAAQ,KAAK;AAAA,cACT,MAAM;AAAA,cACN;AAAA,cACA,SAAS,EAAE;AAAA,cACX,UAAU;AAAA,gBACN,MAAM,EAAE;AAAA,gBACR,WAAW,EAAE;AAAA,gBACb,QAAQ,EAAE;AAAA,gBACV,MAAM,EAAE;AAAA,gBACR,OAAO,KAAK,MAAM,EAAE,cAAc,IAAI;AAAA,gBACtC,WAAW,EAAE;AAAA,gBACb,WAAW,EAAE;AAAA,gBACb,MAAM,EAAE;AAAA,cACZ;AAAA,YACJ,CAAC;AAAA,UACL;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAGA,QAAI,KAAK,MAAM,WAAW,KAAK,MAAM,QAAQ,OAAO,GAAG;AACnD,YAAM,OAAO,SACP,UAAU,KAAK,MAAM,SAAS,UAAU,KAAK,MAAM,SAAS,SAAS,SAAS,IAC9E,KAAK,MAAM,QAAQ,OAAO,UAAU,OAAO;AAEjD,UAAI,KAAK,SAAS,GAAG;AACjB,cAAM,MAAM,KAAK,IAAI,OAAK,EAAE,EAAE;AAC9B,cAAM,WAAW,IAAI,IAAI,KAAK,IAAI,OAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACvD,cAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAEhD,cAAM,OAAO,KAAK,MAAM,GAAG;AAAA,UACvB,8CAA8C,YAAY;AAAA,QAC9D,EAAE,IAAI,GAAG,GAAG;AAEZ,mBAAW,KAAK,MAAM;AAClB,gBAAM,QAAQ,SAAS,IAAI,EAAE,EAAE,KAAK;AACpC,cAAI,SAAS,UAAU;AACnB,oBAAQ,KAAK;AAAA,cACT,MAAM;AAAA,cACN;AAAA,cACA,SAAS,EAAE;AAAA,cACX,UAAU;AAAA,gBACN,UAAU,EAAE;AAAA,gBACZ,MAAM,EAAE;AAAA,gBACR,SAAS,EAAE;AAAA,gBACX,aAAa,EAAE;AAAA,gBACf,UAAU,EAAE;AAAA,cAChB;AAAA,YACJ,CAAC;AAAA,UACL;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAGA,YAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAGxC,QAAI,KAAK,MAAM,YAAY,QAAQ,SAAS,GAAG;AAC3C,aAAO,KAAK,QAAQ,OAAO,OAAO;AAAA,IACtC;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,QAAQ,OAAe,SAAkD;AACnF,UAAM,WAAW,KAAK,MAAM;AAC5B,UAAM,YAAY,QAAQ,IAAI,OAAK,EAAE,OAAO;AAC5C,UAAM,SAAS,MAAM,SAAS,KAAK,OAAO,SAAS;AAEnD,UAAM,UAAU,QAAQ,IAAI,CAAC,GAAG,MAAM;AAClC,YAAM,MAAM,IAAI;AAChB,YAAM,YAAY,OAAO,IAAI,OAAO,OAAO,KAAK,MAAO;AACvD,aAAO;AAAA,QACH,GAAG;AAAA,QACH,OAAO,YAAY,EAAE,SAAS,IAAI,cAAc,OAAO,CAAC,KAAK;AAAA,MACjE;AAAA,IACJ,CAAC;AAED,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAAA,EACnD;AACJ;;;ACjMO,SAAS,YAAY,OAAuB;AAC/C,QAAM,QAAQ,MACT,QAAQ,kBAAkB,GAAG,EAC7B,QAAQ,qCAAqC,EAAE,EAC/C,KAAK;AAEV,QAAM,QAAQ,MAAM,MAAM,KAAK,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AACzD,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,SAAO,MAAM,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,GAAG;AAC5C;AAVgB;AAgBT,SAAS,cAAc,UAA0B;AACpD,QAAM,MAAM,KAAK,IAAI,QAAQ;AAC7B,SAAO,KAAO,IAAM,KAAK,IAAI,QAAQ,MAAM,EAAE;AACjD;AAHgB;;;ACNT,IAAM,aAAN,MAAiB;AAAA,EACpB,YAAoB,KAAe;AAAf;AAAA,EAAgB;AAAA,EAtBxC,OAqBwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQpB,OAAO,OAAe,UAAuB,CAAC,GAAmB;AAC7D,UAAM,EAAE,QAAQ,GAAG,OAAO,GAAG,UAAU,EAAE,IAAI;AAC7C,UAAM,UAA0B,CAAC;AAEjC,UAAM,WAAW,YAAY,KAAK;AAClC,QAAI,CAAC,SAAU,QAAO,CAAC;AAGvB,QAAI,QAAQ,GAAG;AACX,UAAI;AACA,cAAM,OAAO,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAQ7B,EAAE,IAAI,UAAU,KAAK;AAEtB,mBAAW,KAAK,MAAM;AAClB,kBAAQ,KAAK;AAAA,YACT,MAAM;AAAA,YACN,OAAO,cAAc,EAAE,KAAK;AAAA,YAC5B,UAAU,EAAE;AAAA,YACZ,SAAS,EAAE;AAAA,YACX,UAAU;AAAA,cACN,WAAW,EAAE;AAAA,cACb,MAAM,EAAE;AAAA,cACR,WAAW,EAAE;AAAA,cACb,SAAS,EAAE;AAAA,cACX,UAAU,EAAE;AAAA,cACZ,YAAY;AAAA,YAChB;AAAA,UACJ,CAAC;AAAA,QACL;AAAA,MACJ,QAAQ;AAAA,MAAC;AAAA,IACb;AAGA,QAAI,OAAO,GAAG;AACV,UAAI;AACA,cAAM,OAAO,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAS7B,EAAE,IAAI,UAAU,IAAI;AAErB,mBAAW,KAAK,MAAM;AAClB,kBAAQ,KAAK;AAAA,YACT,MAAM;AAAA,YACN,OAAO,cAAc,EAAE,KAAK;AAAA,YAC5B,SAAS,EAAE;AAAA,YACX,UAAU;AAAA,cACN,MAAM,EAAE;AAAA,cACR,WAAW,EAAE;AAAA,cACb,QAAQ,EAAE;AAAA,cACV,MAAM,EAAE;AAAA,cACR,OAAO,KAAK,MAAM,EAAE,cAAc,IAAI;AAAA,cACtC,WAAW,EAAE;AAAA,cACb,WAAW,EAAE;AAAA,cACb,MAAM,EAAE;AAAA,cACR,YAAY;AAAA,YAChB;AAAA,UACJ,CAAC;AAAA,QACL;AAAA,MACJ,QAAQ;AAAA,MAAC;AAAA,IACb;AAGA,QAAI,UAAU,GAAG;AACb,UAAI;AACA,cAAM,OAAO,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAS7B,EAAE,IAAI,UAAU,OAAO;AAExB,mBAAW,KAAK,MAAM;AAClB,kBAAQ,KAAK;AAAA,YACT,MAAM;AAAA,YACN,OAAO,cAAc,EAAE,KAAK;AAAA,YAC5B,SAAS,EAAE;AAAA,YACX,UAAU;AAAA,cACN,UAAU,EAAE;AAAA,cACZ,MAAM,EAAE;AAAA,cACR,SAAS,EAAE;AAAA,cACX,aAAa,EAAE;AAAA,cACf,UAAU,EAAE;AAAA,cACZ,YAAY;AAAA,YAChB;AAAA,UACJ,CAAC;AAAA,QACL;AAAA,MACJ,QAAQ;AAAA,MAAC;AAAA,IACb;AAEA,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAgB;AACZ,QAAI;AACA,WAAK,IAAI,QAAQ,kDAAkD,EAAE,IAAI;AACzE,WAAK,IAAI,QAAQ,wDAAwD,EAAE,IAAI;AAC/E,WAAK,IAAI,QAAQ,0DAA0D,EAAE,IAAI;AAAA,IACrF,QAAQ;AAAA,IAAC;AAAA,EACb;AAEJ;;;AC1IO,IAAM,iBAAN,MAAqB;AAAA,EACxB,YACY,SACA,UACV;AAFU;AACA;AAAA,EACT;AAAA,EAhBP,OAY4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUxB,MAAM,MAAM,MAAc,UAA0B,CAAC,GAAoB;AACrE,UAAM;AAAA,MACF,cAAc;AAAA,MACd,aAAa;AAAA,MACb,gBAAgB;AAAA,MAChB,gBAAgB,CAAC;AAAA,MACjB,WAAW;AAAA,MACX,SAAS;AAAA,MACT,YAAY;AAAA,IAChB,IAAI;AAGJ,UAAM,UAAU,MAAM,KAAK,QAAQ,OAAO,MAAM;AAAA,MAC5C,OAAO;AAAA,MACP,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA;AAAA,IACJ,CAAC;AAED,UAAM,QAAkB,CAAC,mBAAmB,IAAI;AAAA,CAAK;AAGrD,UAAM,WAAW,QAAQ,OAAO,OAAK,EAAE,SAAS,MAAM,EAAE,MAAM,GAAG,WAAW;AAC5E,QAAI,SAAS,SAAS,GAAG;AACrB,YAAM,KAAK,oBAAoB;AAG/B,YAAM,SAAS,oBAAI,IAA6B;AAChD,iBAAW,KAAK,UAAU;AACtB,cAAM,MAAM,EAAE,YAAY;AAC1B,YAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,CAAC,CAAC;AACxC,eAAO,IAAI,GAAG,EAAG,KAAK,CAAC;AAAA,MAC3B;AAEA,iBAAW,CAAC,MAAM,MAAM,KAAK,QAAQ;AACjC,cAAM,KAAK,OAAO,IAAI,EAAE;AACxB,mBAAW,KAAK,QAAQ;AACpB,gBAAM,IAAI,EAAE;AACZ,gBAAM,QAAQ,EAAE,OACV,GAAG,EAAE,SAAS,MAAM,EAAE,IAAI,QAAQ,EAAE,SAAS,IAAI,EAAE,OAAO,MAC1D,IAAI,EAAE,SAAS,IAAI,EAAE,OAAO;AAClC,gBAAM,KAAK,KAAK,KAAK,aAAQ,KAAK,MAAM,EAAE,QAAQ,GAAG,CAAC,SAAS;AAC/D,gBAAM,KAAK,SAAS,EAAE,YAAY,GAAG;AACrC,gBAAM,KAAK,EAAE,OAAO;AACpB,gBAAM,KAAK,OAAO;AAAA,QACtB;AAAA,MACJ;AAAA,IACJ;AAGA,UAAM,UAAU,QAAQ,OAAO,OAAK,EAAE,SAAS,QAAQ,EAAE,MAAM,GAAG,UAAU;AAC5E,QAAI,QAAQ,SAAS,GAAG;AACpB,YAAM,KAAK,0BAA0B;AACrC,iBAAW,KAAK,SAAS;AACrB,cAAM,IAAI,EAAE;AACZ,cAAM,QAAQ,KAAK,MAAM,EAAE,QAAQ,GAAG;AACtC,cAAM,SAAS,EAAE,SAAS,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI;AACnD,cAAM,KAAK,MAAM,EAAE,SAAS,OAAO,EAAE,OAAO,MAAM,EAAE,MAAM,KAAK,EAAE,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,KAAK,KAAK;AAClG,YAAI,MAAO,OAAM,KAAK,YAAY,KAAK,EAAE;AACzC,YAAI,EAAE,MAAM;AACR,gBAAM,UAAU,EAAE,KACb,MAAM,IAAI,EACV,OAAO,CAAC,MAAc,EAAE,WAAW,GAAG,KAAK,EAAE,WAAW,GAAG,KAAK,EAAE,WAAW,IAAI,CAAC,EAClF,MAAM,GAAG,EAAE,EACX,KAAK,IAAI;AACd,cAAI,SAAS;AACT,kBAAM,KAAK,SAAS;AACpB,kBAAM,KAAK,OAAO;AAClB,kBAAM,KAAK,KAAK;AAAA,UACpB;AAAA,QACJ;AACA,cAAM,KAAK,EAAE;AAAA,MACjB;AAAA,IACJ;AAGA,QAAI,cAAc,SAAS,GAAG;AAC1B,YAAM,cAAwB,CAAC;AAC/B,iBAAW,QAAQ,cAAc,MAAM,GAAG,CAAC,GAAG;AAC1C,cAAM,cAAc,KAAK,SAAS,QAAQ,MAAM,CAAC;AACjD,YAAI,YAAY,SAAS,GAAG;AACxB,sBAAY;AAAA,YACR,OAAO,IAAI,mCAA8B,YAAY,IAAI,OAAK,GAAG,EAAE,IAAI,KAAK,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,CAAC;AAAA,UACvG;AAAA,QACJ;AAAA,MACJ;AACA,UAAI,YAAY,SAAS,GAAG;AACxB,cAAM,KAAK,uBAAuB;AAClC,cAAM,KAAK,GAAG,WAAW;AACzB,cAAM,KAAK,EAAE;AAAA,MACjB;AAAA,IACJ;AAGA,UAAM,UAAU,QAAQ,OAAO,OAAK,EAAE,SAAS,SAAS,EAAE,MAAM,GAAG,aAAa;AAChF,QAAI,QAAQ,SAAS,GAAG;AACpB,YAAM,KAAK,uBAAuB;AAClC,iBAAW,KAAK,SAAS;AACrB,cAAM,IAAI,EAAE;AACZ,cAAM,QAAQ,KAAK,MAAM,EAAE,QAAQ,GAAG;AACtC,cAAM,UAAU,KAAK,OAAO,EAAE,eAAe,KAAK,GAAG;AACrD,cAAM,KAAK,KAAK,EAAE,QAAQ,aAAQ,OAAO,cAAc,KAAK,SAAS;AACrE,cAAM,KAAK,SAAS,EAAE,IAAI,EAAE;AAC5B,cAAM,KAAK,aAAa,EAAE,OAAO,EAAE;AACnC,YAAI,EAAE,SAAU,OAAM,KAAK,WAAW,EAAE,QAAQ,EAAE;AAClD,cAAM,KAAK,EAAE;AAAA,MACjB;AAAA,IACJ;AAEA,WAAO,MAAM,KAAK,IAAI;AAAA,EAC1B;AACJ;;;ACvFO,IAAM,aAAN,MAAiB;AAAA,EACpB,YACY,OACA,KACA,YACA,OACA,OACA,WACV;AANU;AACA;AACA;AACA;AACA;AACA;AAAA,EACT;AAAA,EAxDP,OAgDwB;AAAA;AAAA;AAAA;AAAA,EAWpB,IAAI,OAAe;AAAE,WAAO,KAAK;AAAA,EAAO;AAAA;AAAA,EAGxC,MAAM,IAAI,SAAiB,UAAsD,CAAC,GAAoB;AAElG,UAAM,OAAO,UAAU,WAAW,SAAS,WAAW,cAAc,UAC9D,UACA,EAAE,UAAU,QAA+B;AAEjD,UAAM,WAAW,KAAK,YAAY,CAAC;AACnC,UAAM,OAAO,KAAK,QAAQ,CAAC;AAC3B,UAAM,YAAY,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,IAAI,cAAc,KAAK,GAAG,IAAI;AAEvF,UAAM,SAAS,KAAK,IAAI;AAAA,MACpB;AAAA,IACJ,EAAE,IAAI,KAAK,OAAO,SAAS,KAAK,UAAU,QAAQ,GAAG,KAAK,UAAU,IAAI,GAAG,SAAS;AAEpF,UAAM,KAAK,OAAO,OAAO,eAAe;AAExC,UAAM,MAAM,MAAM,KAAK,WAAW,MAAM,OAAO;AAC/C,SAAK,IAAI;AAAA,MACL;AAAA,IACJ,EAAE,IAAI,IAAI,OAAO,KAAK,IAAI,MAAM,CAAC;AAEjC,SAAK,MAAM,IAAI,KAAK,EAAE;AACtB,SAAK,MAAM,IAAI,IAAI,GAAG;AAEtB,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,QAAQ,OAAgH;AAC1H,UAAM,MAAgB,CAAC;AACvB,eAAW,QAAQ,OAAO;AACtB,UAAI,KAAK,MAAM,KAAK,IAAI,KAAK,SAAS;AAAA,QAClC,UAAU,KAAK;AAAA,QACf,MAAM,KAAK;AAAA,QACX,KAAK,KAAK;AAAA,MACd,CAAC,CAAC;AAAA,IACN;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,OAAO,OAAe,UAAmC,CAAC,GAA8B;AAC1F,UAAM,EAAE,IAAI,GAAG,OAAO,UAAU,WAAW,MAAM,KAAK,IAAI;AAG1D,SAAK,cAAc;AAEnB,QAAI,SAAS,UAAW,QAAO,KAAK,cAAc,KAAK,YAAY,OAAO,GAAG,QAAQ,GAAG,IAAI;AAC5F,QAAI,SAAS,SAAU,QAAO,KAAK,cAAc,MAAM,KAAK,cAAc,OAAO,GAAG,QAAQ,GAAG,IAAI;AAGnG,UAAM,CAAC,YAAY,QAAQ,IAAI,MAAM,QAAQ,IAAI;AAAA,MAC7C,KAAK,cAAc,OAAO,GAAG,CAAC;AAAA,MAC9B,QAAQ,QAAQ,KAAK,YAAY,OAAO,GAAG,CAAC,CAAC;AAAA,IACjD,CAAC;AAED,UAAM,QAAQ,qBAAqB;AAAA,MAC/B,WAAW,IAAI,QAAM,EAAE,MAAM,YAAqB,OAAO,EAAE,SAAS,GAAG,SAAS,EAAE,SAAS,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;AAAA,MACpH,SAAS,IAAI,QAAM,EAAE,MAAM,YAAqB,OAAO,EAAE,SAAS,GAAG,SAAS,EAAE,SAAS,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE;AAAA,IACtH,CAAC;AAED,UAAM,UAAU,oBAAI,IAA4B;AAChD,eAAW,KAAK,CAAC,GAAG,YAAY,GAAG,QAAQ,EAAG,SAAQ,IAAI,EAAE,IAAI,CAAC;AAEjE,UAAM,UAA4B,CAAC;AACnC,eAAW,KAAK,OAAO;AACnB,YAAM,OAAO,QAAQ,IAAI,EAAE,SAAS,EAAE;AACtC,UAAI,CAAC,KAAM;AACX,YAAM,SAAS,EAAE,GAAG,MAAM,OAAO,EAAE,MAAM;AACzC,UAAI,OAAO,SAAS,SAAU,SAAQ,KAAK,MAAM;AACjD,UAAI,QAAQ,UAAU,EAAG;AAAA,IAC7B;AAGA,QAAI,KAAK,aAAa,QAAQ,SAAS,GAAG;AACtC,YAAM,YAAY,QAAQ,IAAI,OAAK,EAAE,OAAO;AAC5C,YAAM,SAAS,MAAM,KAAK,UAAU,KAAK,OAAO,SAAS;AACzD,YAAM,UAAU,QAAQ,IAAI,CAAC,GAAG,OAAO;AAAA,QACnC,GAAG;AAAA,QACH,OAAO,OAAO,EAAE,SAAS,KAAK,OAAO,OAAO,CAAC,KAAK;AAAA,MACtD,EAAE;AACF,aAAO,KAAK;AAAA,QACR,QAAQ,KAAK,CAAC,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EAAE;AAAA,QACtD;AAAA,MACJ;AAAA,IACJ;AAEA,WAAO,KAAK,cAAc,SAAS,IAAI;AAAA,EAC3C;AAAA;AAAA,EAGA,KAAK,UAAgE,CAAC,GAAqB;AACvF,UAAM,EAAE,QAAQ,IAAI,SAAS,GAAG,KAAK,IAAI;AAGzC,SAAK,cAAc;AAEnB,UAAM,OAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACJ,EAAE,IAAI,KAAK,OAAO,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,GAAG,OAAO,MAAM;AAC9D,WAAO,KAAK,cAAc,KAAK,IAAI,OAAK,KAAK,WAAW,CAAC,CAAC,GAAG,IAAI;AAAA,EACrE;AAAA;AAAA,EAGA,QAAgB;AACZ,WAAQ,KAAK,IAAI;AAAA,MACb;AAAA,IACJ,EAAE,IAAI,KAAK,KAAK,EAAU;AAAA,EAC9B;AAAA;AAAA,EAGA,MAAM,KAAK,SAAyD;AAChE,UAAM,SAAS,KAAK,MAAM;AAC1B,QAAI,UAAU,QAAQ,KAAM,QAAO,EAAE,SAAS,EAAE;AAGhD,UAAM,WAAW,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA,SAKjC,EAAE,IAAI,KAAK,OAAO,QAAQ,IAAI;AAE/B,eAAW,OAAO,UAAU;AACxB,WAAK,YAAY,IAAI,EAAE;AAAA,IAC3B;AAEA,WAAO,EAAE,SAAS,SAAS,OAAO;AAAA,EACtC;AAAA;AAAA,EAGA,MAAM,MAAM,SAA8D;AACtE,UAAM,UAAU,cAAc,QAAQ,SAAS;AAC/C,UAAM,SAAS,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,IAAI;AAE/C,UAAM,WAAW,KAAK,IAAI;AAAA,MACtB;AAAA,IACJ,EAAE,IAAI,KAAK,OAAO,MAAM;AAExB,eAAW,OAAO,UAAU;AACxB,WAAK,YAAY,IAAI,EAAE;AAAA,IAC3B;AAEA,WAAO,EAAE,SAAS,SAAS,OAAO;AAAA,EACtC;AAAA;AAAA,EAGA,OAAO,IAAkB;AACrB,SAAK,YAAY,EAAE;AAAA,EACvB;AAAA;AAAA,EAGA,QAAc;AACV,UAAM,OAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACJ,EAAE,IAAI,KAAK,KAAK;AAEhB,eAAW,OAAO,MAAM;AACpB,WAAK,YAAY,IAAI,EAAE;AAAA,IAC3B;AAAA,EACJ;AAAA;AAAA,EAIQ,YAAY,IAAkB;AAElC,SAAK,MAAM,OAAO,EAAE;AAEpB,SAAK,IAAI,QAAQ,kCAAkC,EAAE,IAAI,EAAE;AAAA,EAC/D;AAAA,EAEA,MAAc,cAAc,OAAe,GAAW,UAA6C;AAC/F,QAAI,KAAK,MAAM,SAAS,EAAG,QAAO,CAAC;AAEnC,UAAM,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK;AAElD,UAAM,OAAO,KAAK,MAAM,OAAO,UAAU,IAAI,CAAC;AAE9C,UAAM,MAAM,KAAK,IAAI,OAAK,EAAE,EAAE;AAC9B,QAAI,IAAI,WAAW,EAAG,QAAO,CAAC;AAE9B,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,OAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACvD,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAEhD,UAAM,OAAO,KAAK,IAAI;AAAA,MAClB,sCAAsC,YAAY;AAAA,IACtD,EAAE,IAAI,GAAG,KAAK,KAAK,KAAK;AAExB,WAAO,KACF,IAAI,QAAM,EAAE,GAAG,KAAK,WAAW,CAAC,GAAG,OAAO,SAAS,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,EACpE,OAAO,OAAK,EAAE,SAAS,QAAQ,EAC/B,KAAK,CAAC,GAAG,OAAO,EAAE,SAAS,MAAM,EAAE,SAAS,EAAE,EAC9C,MAAM,GAAG,CAAC;AAAA,EACnB;AAAA,EAEQ,YAAY,OAAe,GAAW,UAAoC;AAC9E,UAAM,WAAW,YAAY,KAAK;AAClC,QAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,QAAI;AACA,YAAM,OAAO,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aAO7B,EAAE,IAAI,UAAU,KAAK,OAAO,CAAC;AAE9B,aAAO,KACF,IAAI,QAAM;AAAA,QACP,GAAG,KAAK,WAAW,CAAC;AAAA,QACpB,OAAO,cAAc,EAAE,KAAK;AAAA,MAChC,EAAE,EACD,OAAO,QAAM,EAAE,SAAS,MAAM,QAAQ;AAAA,IAC/C,QAAQ;AACJ,aAAO,CAAC;AAAA,IACZ;AAAA,EACJ;AAAA,EAEQ,WAAW,GAAwB;AACvC,WAAO;AAAA,MACH,IAAI,EAAE;AAAA,MACN,YAAY,EAAE;AAAA,MACd,SAAS,EAAE;AAAA,MACX,UAAU,KAAK,MAAM,EAAE,aAAa,IAAI;AAAA,MACxC,MAAM,KAAK,MAAM,EAAE,aAAa,IAAI;AAAA,MACpC,WAAW,EAAE;AAAA,MACb,WAAW,EAAE,cAAc;AAAA,IAC/B;AAAA,EACJ;AAAA;AAAA,EAGQ,cAAc,OAAyB,MAAmC;AAC9E,QAAI,CAAC,QAAQ,KAAK,WAAW,EAAG,QAAO;AACvC,WAAO,MAAM;AAAA,MAAO,UAChB,KAAK,MAAM,OAAK,KAAK,KAAK,SAAS,CAAC,CAAC;AAAA,IACzC;AAAA,EACJ;AAAA;AAAA,EAGQ,gBAAsB;AAC1B,UAAM,MAAM,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AACxC,UAAM,UAAU,KAAK,IAAI;AAAA,MACrB;AAAA,IACJ,EAAE,IAAI,KAAK,OAAO,GAAG;AAErB,eAAW,OAAO,SAAS;AACvB,WAAK,YAAY,IAAI,EAAE;AAAA,IAC3B;AAAA,EACJ;AACJ;AAGA,SAAS,cAAc,GAAmB;AACtC,QAAM,QAAQ,EAAE,MAAM,iBAAiB;AACvC,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,sBAAsB,CAAC,wCAAwC;AAE3F,QAAM,IAAI,SAAS,MAAM,CAAC,GAAG,EAAE;AAC/B,UAAQ,MAAM,CAAC,GAAG;AAAA,IACd,KAAK;AAAK,aAAO,IAAI;AAAA,IACrB,KAAK;AAAK,aAAO,IAAI;AAAA,IACrB,KAAK;AAAK,aAAO,IAAI;AAAA,IACrB,KAAK;AAAK,aAAO;AAAA,IACjB;AAAS,aAAO;AAAA,EACpB;AACJ;AAZS;;;ACzST,SAAS,oBAAoB;;;ACZ7B,OAAO,mBAAmB;AAC1B,YAAY,QAAQ;AACpB,YAAYA,WAAU;;;ACAf,IAAM,iBAAiB;AAMvB,SAAS,aAAa,IAA6B;AACtD,KAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iEAMqD,cAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KA0S1E;AACL;AAlTgB;;;ADHT,IAAM,WAAN,MAAe;AAAA,EAZtB,OAYsB;AAAA;AAAA;AAAA,EACT;AAAA,EAET,YAAY,QAAgB;AAExB,UAAM,MAAW,cAAQ,MAAM;AAC/B,QAAI,CAAI,cAAW,GAAG,GAAG;AACrB,MAAG,aAAU,KAAK,EAAE,WAAW,KAAK,CAAC;AAAA,IACzC;AAEA,SAAK,KAAK,IAAI,cAAc,MAAM;AAClC,SAAK,GAAG,OAAO,oBAAoB;AACnC,SAAK,GAAG,OAAO,sBAAsB;AACrC,SAAK,GAAG,OAAO,mBAAmB;AAGlC,iBAAa,KAAK,EAAE;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAe,IAAgB;AAC3B,UAAM,KAAK,KAAK,GAAG,YAAY,EAAE;AACjC,WAAO,GAAG;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAuB,KAAa,MAAiB;AACjD,UAAM,OAAO,KAAK,GAAG,QAAQ,GAAG;AAChC,UAAM,KAAK,KAAK,GAAG,YAAY,MAAM;AACjC,iBAAW,OAAO,MAAM;AACpB,aAAK,IAAI,GAAG,GAAG;AAAA,MACnB;AAAA,IACJ,CAAC;AACD,OAAG;AAAA,EACP;AAAA;AAAA,EAGA,QAAQ,KAAsC;AAC1C,WAAO,KAAK,GAAG,QAAQ,GAAG;AAAA,EAC9B;AAAA;AAAA,EAGA,KAAK,KAAmB;AACpB,SAAK,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA;AAAA,EAGA,QAAc;AACV,SAAK,GAAG,MAAM;AAAA,EAClB;AACJ;;;AEnCA,IAAM,SAAyB;AAAA,EAC3B;AAAA,IACI,MAAM;AAAA,IACN,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,UAAU;AAAA,IACV,aAAa,wBAAC,MAAM;AAAA,MAChB,SAAS,EAAE,SAAS;AAAA,MACpB,EAAE,OAAO,GAAG,EAAE,UAAU,KAAK,EAAE,IAAI,KAAK,EAAE;AAAA,MAC1C,EAAE;AAAA,IACN,EAAE,KAAK,IAAI,GAJE;AAAA,EAKjB;AAAA,EACA;AAAA,IACI,MAAM;AAAA,IACN,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,UAAU;AAAA,IACV,aAAa,wBAAC,MAAM;AAAA,MAChB,EAAE;AAAA,MACF,EAAE,QAAQ;AAAA,IACd,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI,GAHd;AAAA,EAIjB;AAAA,EACA;AAAA,IACI,MAAM;AAAA,IACN,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,UAAU;AAAA,IACV,aAAa,wBAAC,MAAM;AAAA,MAChB,EAAE;AAAA,MACF,EAAE;AAAA,MACF,EAAE;AAAA,MACF,EAAE,WAAW;AAAA,IACjB,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI,GALd;AAAA,EAMjB;AAAA,EACA;AAAA,IACI,MAAM;AAAA,IACN,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,UAAU;AAAA,IACV,aAAa,wBAAC,MAAM;AAAA,MAChB,EAAE;AAAA,MACF,EAAE;AAAA,MACF,EAAE,mBAAmB,OAAO,cAAc,EAAE,cAAc,KAAK;AAAA,MAC/D,EAAE,cAAc,OAAO,SAAS,EAAE,SAAS,KAAK;AAAA,IACpD,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI,GALd;AAAA,EAMjB;AAAA,EACA;AAAA,IACI,MAAM;AAAA,IACN,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,UAAU;AAAA,IACV,aAAa,wBAAC,MAAM;AAAA,MAChB,EAAE,QAAQ,KAAK,EAAE,KAAK,KAAK;AAAA,MAC3B,EAAE;AAAA,IACN,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI,GAHd;AAAA,EAIjB;AAAA,EACA;AAAA,IACI,MAAM;AAAA,IACN,WAAW;AAAA,IACX,aAAa;AAAA,IACb,UAAU;AAAA,IACV,UAAU;AAAA,IACV,aAAa,wBAAC,MAAM,EAAE,SAAT;AAAA,EACjB;AACJ;AA2BA,eAAsB,WAClB,IACA,WACA,SACA,UAA0B,CAAC,GACL;AACtB,QAAM,EAAE,YAAY,IAAI,WAAW,IAAI;AACvC,QAAM,SAAiC,CAAC;AACxC,MAAI,QAAQ;AAEZ,aAAW,SAAS,QAAQ;AACxB,UAAM,QAAQ,MAAM,aAAa,IAAI,WAAW,OAAO,WAAW,UAAU;AAC5E,WAAO,MAAM,IAAI,IAAI;AACrB,aAAS;AAGT,UAAM,QAAQ,QAAQ,IAAI,MAAM,IAAI;AACpC,QAAI,SAAS,QAAQ,GAAG;AACpB,YAAM,YAAY,IAAI,OAAO,MAAM,MAAM,MAAM,IAAI;AAAA,IACvD;AAAA,EACJ;AAGA,QAAM,OAAO;AAAA,IACT,UAAU,UAAU,aAAa,QAAQ;AAAA,IACzC,MAAM,OAAO,UAAU,IAAI;AAAA,IAC3B,gBAAe,oBAAI,KAAK,GAAE,YAAY;AAAA,EAC1C;AACA,QAAM,SAAS,GAAG;AAAA,IACd;AAAA,EACJ;AACA,aAAW,CAAC,GAAG,CAAC,KAAK,OAAO,QAAQ,IAAI,GAAG;AACvC,WAAO,IAAI,GAAG,CAAC;AAAA,EACnB;AAEA,SAAO;AAAA,IACH,MAAM,OAAO,QAAQ;AAAA,IACrB,KAAK,OAAO,OAAO;AAAA,IACnB,QAAQ,OAAO,UAAU;AAAA,IACzB,OAAO,OAAO,SAAS;AAAA,IACvB,MAAM,OAAO,QAAQ;AAAA,IACrB,IAAI,OAAO,MAAM;AAAA,IACjB;AAAA,EACJ;AACJ;AA5CsB;AA+CtB,eAAe,aACX,IACA,WACA,OACA,WACA,YACe;AACf,QAAM,OAAO,GAAG;AAAA,IACZ,iBAAiB,MAAM,SAAS;AAAA,EACpC,EAAE,IAAI;AAEN,MAAI,KAAK,WAAW,EAAG,QAAO;AAG9B,KAAG,QAAQ,eAAe,MAAM,WAAW,EAAE,EAAE,IAAI;AAEnD,QAAM,YAAY,GAAG;AAAA,IACjB,eAAe,MAAM,WAAW,KAAK,MAAM,QAAQ;AAAA,EACvD;AAEA,MAAI,YAAY;AAGhB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,WAAW;AAC7C,UAAM,QAAQ,KAAK,MAAM,GAAG,IAAI,SAAS;AACzC,UAAM,QAAQ,MAAM,IAAI,OAAK,MAAM,YAAY,CAAC,CAAC;AACjD,UAAM,UAAU,MAAM,UAAU,WAAW,KAAK;AAEhD,OAAG,YAAY,MAAM;AACjB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,cAAM,KAAK,MAAM,CAAC,EAAE,MAAM,QAAQ;AAClC,cAAM,MAAM,QAAQ,CAAC;AACrB,kBAAU,IAAI,IAAI,OAAO,KAAK,IAAI,MAAM,CAAC;AAAA,MAC7C;AAAA,IACJ,CAAC;AAED,iBAAa,MAAM;AACnB,iBAAa,MAAM,MAAM,WAAW,KAAK,MAAM;AAAA,EACnD;AAEA,SAAO;AACX;AAzCe;AA4Cf,eAAe,YACX,IACA,OACA,MACA,MACa;AAEb,OAAK,MAAM;AAEX,QAAM,OAAO,GAAG;AAAA,IACZ,UAAU,MAAM,QAAQ,0BAA0B,MAAM,WAAW;AAAA,EACvE,EAAE,IAAI;AAEN,aAAW,OAAO,MAAM;AACpB,UAAM,MAAM,IAAI,aAAa,IAAI,WAAW,IAAI,SAAS,EAAE,MAAM;AACjE,SAAK,IAAI,KAAK,IAAI,EAAE;AACpB,SAAK,IAAI,IAAI,IAAI,GAAG;AAAA,EACxB;AACJ;AAlBe;AAuBR,SAAS,iBAAiB,IAAyD;AACtF,MAAI;AACA,UAAM,WAAW,GAAG;AAAA,MAChB;AAAA,IACJ,EAAE,IAAI;AACN,UAAM,OAAO,GAAG;AAAA,MACZ;AAAA,IACJ,EAAE,IAAI;AAEN,QAAI,CAAC,YAAY,CAAC,KAAM,QAAO;AAC/B,WAAO,EAAE,UAAU,SAAS,OAAO,MAAM,OAAO,KAAK,KAAK,EAAE;AAAA,EAChE,QAAQ;AACJ,WAAO;AAAA,EACX;AACJ;AAdgB;AAiBT,SAAS,iBAAiB,IAAc,WAAoC;AAC/E,QAAM,SAAS,GAAG;AAAA,IACd;AAAA,EACJ;AACA,SAAO,IAAI,YAAY,UAAU,aAAa,QAAQ,SAAS;AAC/D,SAAO,IAAI,QAAQ,OAAO,UAAU,IAAI,CAAC;AACzC,SAAO,IAAI,eAAc,oBAAI,KAAK,GAAE,YAAY,CAAC;AACrD;AAPgB;AAUT,SAAS,uBACZ,IACA,WAC6D;AAC7D,QAAM,OAAO,iBAAiB,EAAE;AAChC,MAAI,CAAC,KAAM,QAAO;AAElB,QAAM,cAAc,UAAU,aAAa,QAAQ;AACnD,QAAM,WAAW,KAAK,SAAS,UAAU,QAAQ,KAAK,aAAa;AAEnE,SAAO;AAAA,IACH;AAAA,IACA,QAAQ,GAAG,KAAK,QAAQ,IAAI,KAAK,IAAI;AAAA,IACrC,SAAS,GAAG,WAAW,IAAI,UAAU,IAAI;AAAA,EAC7C;AACJ;AAfgB;;;AC3PhB,YAAYC,SAAQ;AACpB,YAAYC,WAAU;AAkCf,SAAS,cACZ,WACA,UACA,UACA,UAAwB,CAAC,GAClB;AACP,QAAM;AAAA,IACF,QAAQ,CAAC,QAAQ;AAAA,IACjB,aAAa;AAAA,IACb;AAAA,IACA;AAAA,EACJ,IAAI;AAEJ,MAAI,SAAS;AACb,QAAM,WAA2B,CAAC;AAClC,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,QAA8C;AAGlD,QAAM,iBAA6D,CAAC;AACpE,aAAW,WAAW,SAAS,OAAO,GAAG;AACrC,QAAI,QAAQ,eAAe;AACvB,qBAAe,KAAK,EAAE,SAAS,UAAU,QAAQ,cAAc,EAAE,CAAC;AAAA,IACtE;AAAA,EACJ;AAGA,WAAS,mBAAmB,UAAkC;AAC1D,UAAM,MAAW,eAAS,UAAU,QAAQ;AAC5C,eAAW,EAAE,SAAS,SAAS,KAAK,gBAAgB;AAChD,iBAAW,WAAW,UAAU;AAC5B,YAAI,UAAU,KAAK,OAAO,EAAG,QAAO;AAAA,MACxC;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AARS;AAWT,WAAS,UAAU,UAAkB,SAA0B;AAE3D,QAAI,QAAQ,WAAW,KAAK,GAAG;AAC3B,YAAM,SAAS,QAAQ,MAAM,CAAC;AAC9B,YAAM,MAAM,OAAO,WAAW,IAAI,IAAI,OAAO,MAAM,CAAC,IAAI;AACxD,UAAI,IAAK,QAAO,SAAS,SAAS,GAAG;AACrC,aAAY,eAAS,QAAQ,MAAM;AAAA,IACvC;AAEA,QAAI,QAAQ,WAAW,IAAI,GAAG;AAC1B,aAAO,SAAS,SAAS,QAAQ,MAAM,CAAC,CAAC;AAAA,IAC7C;AACA,WAAO,aAAa;AAAA,EACxB;AAbS;AAgBT,iBAAe,QAAQ;AACnB,QAAI,QAAQ,SAAS,EAAG;AAExB,UAAM,QAAQ,CAAC,GAAG,OAAO;AACzB,YAAQ,MAAM;AAGd,QAAI,eAAe;AAEnB,eAAW,YAAY,OAAO;AAC1B,YAAM,UAAe,cAAQ,UAAU,QAAQ;AAG/C,YAAM,gBAAgB,mBAAmB,OAAO;AAChD,UAAI,eAAe,cAAc;AAC7B,YAAI;AACA,gBAAM,UAAU,MAAM,cAAc,aAAa,SAAS,YAAY,OAAO,CAAC;AAC9E,cAAI,SAAS;AACT,sBAAU,UAAU,cAAc,IAAI;AACtC;AAAA,UACJ;AAAA,QACJ,SAAS,KAAK;AACV,oBAAU,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC;AAAA,QACjE;AAAA,MACJ;AAGA,UAAI,YAAY,QAAQ,GAAG;AACvB,uBAAe;AACf,kBAAU,UAAU,MAAM;AAAA,MAC9B;AAAA,IACJ;AAGA,QAAI,cAAc;AACd,UAAI;AACA,cAAM,UAAU;AAAA,MACpB,SAAS,KAAK;AACV,kBAAU,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC;AAAA,MACjE;AAAA,IACJ;AAAA,EACJ;AAzCe;AA2Cf,WAAS,YAAY,UAAkD;AACnE,QAAI;AACA,MAAG,eAAW,QAAQ;AACtB,aAAO;AAAA,IACX,QAAQ;AACJ,aAAO;AAAA,IACX;AAAA,EACJ;AAPS;AAUT,WAAS,YAAY,UAA2B;AAC5C,QAAI,CAAC,SAAU,QAAO;AACtB,UAAM,QAAQ,SAAS,MAAW,SAAG;AAGrC,eAAW,QAAQ,OAAO;AACtB,UAAI,aAAa,IAAI,EAAG,QAAO;AAAA,IACnC;AAGA,QAAI,cAAmB,eAAS,QAAQ,CAAC,EAAG,QAAO;AAGnD,QAAI,YAAY,QAAQ,EAAG,QAAO;AAGlC,QAAI,mBAAwB,cAAQ,UAAU,QAAQ,CAAC,EAAG,QAAO;AAEjE,WAAO;AAAA,EACX;AAnBS;AAsBT,aAAW,aAAa,OAAO;AAC3B,UAAM,WAAgB,cAAQ,SAAS;AACvC,QAAI;AACA,YAAM,UAAa,UAAM,UAAU,EAAE,WAAW,KAAK,GAAG,CAAC,QAAQ,aAAa;AAC1E,YAAI,CAAC,UAAU,CAAC,SAAU;AAC1B,YAAI,CAAC,YAAY,QAAQ,EAAG;AAE5B,gBAAQ,IAAI,QAAQ;AAGpB,YAAI,MAAO,cAAa,KAAK;AAC7B,gBAAQ,WAAW,MAAM,MAAM,GAAG,UAAU;AAAA,MAChD,CAAC;AAED,cAAQ,GAAG,SAAS,CAAC,QAAQ;AACzB,kBAAU,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC;AAAA,MACjE,CAAC;AAED,eAAS,KAAK,OAAO;AAAA,IACzB,SAAS,KAAK;AACV,gBAAU,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC;AAAA,IACjE;AAAA,EACJ;AAEA,SAAO;AAAA,IACH,QAAQ;AACJ,eAAS;AACT,UAAI,MAAO,cAAa,KAAK;AAC7B,iBAAW,KAAK,SAAU,GAAE,MAAM;AAClC,eAAS,SAAS;AAAA,IACtB;AAAA,IACA,IAAI,SAAS;AAAE,aAAO;AAAA,IAAQ;AAAA,EAClC;AACJ;AAlKgB;;;AJdT,IAAM,YAAN,cAAwB,aAAa;AAAA,EAxC5C,OAwC4C;AAAA;AAAA;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW,oBAAI,IAAqB;AAAA;AAAA,EAGpC;AAAA,EACA;AAAA,EACA;AAAA,EAEA,eAAe;AAAA,EACf;AAAA;AAAA,EAGA,eAAe,oBAAI,IAAwB;AAAA,EAC3C;AAAA,EACA,UAAU,oBAAI,IAA0B;AAAA;AAAA,EAGxC,cAAc,oBAAI,IAAsE;AAAA,EAEhG,YAAY,SAA0B,CAAC,GAAG;AACtC,UAAM;AACN,SAAK,UAAU,cAAc,MAAM;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,SAAwB;AACxB,QAAI,KAAK,cAAc;AACnB,YAAM,IAAI;AAAA,QACN,kCAAkC,QAAQ,IAAI;AAAA,MAElD;AAAA,IACJ;AACA,SAAK,SAAS,IAAI,QAAQ,MAAM,OAAO;AACvC,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,IAAI,WAAqB;AACrB,WAAO,CAAC,GAAG,KAAK,SAAS,KAAK,CAAC;AAAA,EACnC;AAAA;AAAA,EAGA,IAAI,UAAoB;AACpB,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA,EAGA,IAAI,MAAuB;AACvB,QAAI,KAAK,SAAS,IAAI,IAAI,EAAG,QAAO;AAEpC,eAAW,OAAO,KAAK,SAAS,KAAK,GAAG;AACpC,UAAI,IAAI,WAAW,OAAO,GAAG,EAAG,QAAO;AAAA,IAC3C;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,QAAqC,MAAiB;AAClD,UAAM,MAAM,KAAK,SAAS,IAAI,IAAI;AAClC,QAAI,CAAC,KAAK;AAEN,YAAM,QAAQ,KAAK,iBAAiB,IAAI;AACxC,UAAI,MAAO,QAAO;AAClB,YAAM,IAAI;AAAA,QACN,uBAAuB,IAAI,6BACf,IAAI;AAAA,MACpB;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,OAAO,MAAuB;AAC1B,WAAO,KAAK,QAAQ,IAAI;AAAA,EAC5B;AAAA;AAAA,EAGQ,eAAe,MAAyB;AAC5C,WAAO,CAAC,GAAG,KAAK,SAAS,OAAO,CAAC,EAAE;AAAA,MAC/B,OAAK,EAAE,SAAS,QAAQ,EAAE,KAAK,WAAW,OAAO,GAAG;AAAA,IACxD;AAAA,EACJ;AAAA;AAAA,EAGQ,iBAAiB,MAAmC;AACxD,eAAW,KAAK,KAAK,SAAS,OAAO,GAAG;AACpC,UAAI,EAAE,SAAS,QAAQ,EAAE,KAAK,WAAW,OAAO,GAAG,EAAG,QAAO;AAAA,IACjE;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,aAA4B;AAC9B,QAAI,KAAK,aAAc;AAEvB,UAAM,SAAS,KAAK;AAGpB,SAAK,MAAM,IAAI,SAAS,OAAO,MAAM;AAGrC,SAAK,aAAa,OAAO,qBAAqB,IAAI,eAAe;AAGjE,SAAK,UAAU,IAAI;AAAA,MACf,OAAO;AAAA,MACP,OAAO,eAAe;AAAA,MACtB,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,IACX;AACA,UAAM,KAAK,QAAQ,KAAK;AACxB,SAAK,aAAa,cAAc,WAAW,KAAK,SAAS,KAAK,OAAO;AAGrE,UAAM,MAAsB;AAAA,MACxB,IAAI,KAAK;AAAA,MACT,WAAW,KAAK;AAAA,MAChB;AAAA,MACA,YAAY,8BAAO,gBAAyB;AACxC,eAAO,IAAI;AAAA,UACP,OAAO;AAAA,UACP,eAAe,OAAO;AAAA,UACtB,OAAO;AAAA,UACP,OAAO;AAAA,UACP,OAAO;AAAA,QACX,EAAE,KAAK;AAAA,MACX,GARY;AAAA,MASZ,aAAa,wBAAC,OAAO,OAAO,MAAM,UAAU;AACxC,aAAK,aAAa,OAAO,OAAO,MAAM,KAAK;AAAA,MAC/C,GAFa;AAAA,MAGb,uBAAuB,8BAAO,MAAc,gBAAyB;AACjE,cAAM,WAAW,KAAK,YAAY,IAAI,IAAI;AAC1C,YAAI,SAAU,QAAO,EAAE,GAAG,UAAU,OAAO,MAAM;AACjD,cAAM,OAAO,MAAM,IAAI;AAAA,UACnB,OAAO;AAAA,UACP,eAAe,OAAO;AAAA,UACtB,OAAO;AAAA,UACP,OAAO;AAAA,UACP,OAAO;AAAA,QACX,EAAE,KAAK;AACP,cAAM,WAAW,oBAAI,IAA0B;AAC/C,aAAK,YAAY,IAAI,MAAM,EAAE,MAAM,SAAS,CAAC;AAC7C,eAAO,EAAE,MAAM,UAAU,OAAO,KAAK;AAAA,MACzC,GAbuB;AAAA,MAcvB,YAAY,wBAAC,SAAiB,KAAK,WAAW,IAAI,GAAtC;AAAA,IAChB;AAGA,eAAW,OAAO,KAAK,SAAS,OAAO,GAAG;AACtC,YAAM,IAAI,WAAW,GAAG;AAAA,IAC5B;AAIA,UAAM,aAAa,KAAK,YAAY,IAAI,MAAM;AAC9C,UAAM,YAAY,KAAK,YAAY,IAAI,KAAK;AAC5C,UAAM,SAAS,KAAK,SAAS,IAAI,QAAQ;AAEzC,QAAI,cAAc,aAAa,QAAQ;AACnC,WAAK,UAAU,IAAI,cAAc;AAAA,QAC7B,IAAI,KAAK;AAAA,QACT,UAAU,YAAY;AAAA,QACtB,SAAS,WAAW;AAAA,QACpB,SAAS,QAAQ;AAAA,QACjB,UAAU,YAAY,YAAY,oBAAI,IAAI;AAAA,QAC1C,SAAS,WAAW,YAAY,oBAAI,IAAI;AAAA,QACxC,SAAS,QAAQ,YAAY,oBAAI,IAAI;AAAA,QACrC,WAAW,KAAK;AAAA,QAChB,UAAU,KAAK,QAAQ;AAAA,MAC3B,CAAC;AAED,WAAK,QAAQ,IAAI,WAAW,KAAK,GAAG;AAAA,IACxC;AAGA,QAAI,KAAK,SAAS;AACd,YAAM,WAAW,KAAK,iBAAiB,KAAK;AAC5C,WAAK,kBAAkB,IAAI,eAAe,KAAK,SAAS,UAAU,OAAO;AAAA,IAC7E;AAGA,qBAAiB,KAAK,KAAK,KAAK,UAAU;AAG1C,UAAM,WAAW,uBAAuB,KAAK,KAAK,KAAK,UAAU;AACjE,QAAI,UAAU,UAAU;AACpB,WAAK,KAAK,WAAW;AAAA,QACjB,MAAM;AAAA,QACN,SAAS,+BAA+B,SAAS,MAAM,WAAM,SAAS,OAAO;AAAA,MAEjF,CAAC;AAAA,IACL;AAEA,SAAK,eAAe;AACpB,SAAK,KAAK,eAAe,EAAE,UAAU,KAAK,SAAS,CAAC;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,WAAW,MAA0B;AACjC,QAAI,OAAO,KAAK,aAAa,IAAI,IAAI;AACrC,QAAI,KAAM,QAAO;AAEjB,QAAI,CAAC,KAAK,cAAc;AACpB,YAAM,IAAI;AAAA,QACN;AAAA,MAEJ;AAAA,IACJ;AAGA,QAAI,CAAC,KAAK,SAAS;AACf,YAAM,IAAI,MAAM,uEAAuE;AAAA,IAC3F;AAEA,WAAO,IAAI,WAAW,MAAM,KAAK,KAAK,KAAK,YAAY,KAAK,SAAS,KAAK,SAAS,KAAK,QAAQ,QAAQ;AACxG,SAAK,aAAa,IAAI,MAAM,IAAI;AAChC,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,sBAAgC;AAC5B,UAAM,OAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACJ,EAAE,IAAI;AACN,WAAO,KAAK,IAAI,OAAK,EAAE,UAAU;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,MAAM,UAIR,CAAC,GAAuD;AACxD,UAAM,KAAK,WAAW;AAEtB,UAAM,SAAoD,CAAC;AAG3D,UAAM,WAAW,KAAK,eAAe,MAAM;AAC3C,eAAW,OAAO,UAAU;AACxB,YAAM,QAAQ,IAAI,SAAS,SAAS,SAAS,IAAI;AACjD,cAAQ,aAAa,OAAO,aAAa;AACzC,YAAM,IAAI,MAAM,IAAI,MAAO;AAAA,QACvB,cAAc,QAAQ;AAAA,QACtB,YAAY,wBAAC,GAAW,GAAW,MAAc,QAAQ,aAAa,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAnF;AAAA,MAChB,CAAC;AAED,UAAI,OAAO,MAAM;AACb,eAAO,KAAK,WAAW,EAAE;AACzB,eAAO,KAAK,WAAW,EAAE;AACzB,eAAO,KAAK,UAAU,OAAO,KAAK,UAAU,MAAM,EAAE,UAAU;AAAA,MAClE,OAAO;AACH,eAAO,OAAO;AAAA,MAClB;AAAA,IACJ;AAGA,UAAM,UAAU,KAAK,eAAe,KAAK;AACzC,eAAW,OAAO,SAAS;AACvB,YAAM,QAAQ,IAAI,SAAS,QAAQ,QAAQ,IAAI;AAC/C,cAAQ,aAAa,OAAO,aAAa;AACzC,YAAM,IAAI,MAAM,IAAI,MAAO;AAAA,QACvB,OAAO,QAAQ,YAAY,KAAK,QAAQ;AAAA,QACxC,YAAY,wBAAC,GAAW,GAAW,MAAc,QAAQ,aAAa,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAnF;AAAA,MAChB,CAAC;AACD,UAAI,OAAO,KAAK;AACZ,eAAO,IAAI,WAAW,EAAE;AACxB,eAAO,IAAI,WAAW,EAAE;AAAA,MAC5B,OAAO;AACH,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AAEA,SAAK,KAAK,WAAW,MAAM;AAC3B,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,UAAU,UAGZ,CAAC,GAAyB;AAC1B,UAAM,KAAK,WAAW;AACtB,WAAO,KAAK,OAAO,MAAM,EAAE,MAAO,OAAO;AAAA,EAC7C;AAAA;AAAA,EAGA,MAAM,SAAS,UAGX,CAAC,GAAyB;AAC1B,UAAM,KAAK,WAAW;AACtB,WAAO,KAAK,OAAO,KAAK,EAAE,MAAO,OAAO;AAAA,EAC5C;AAAA;AAAA;AAAA,EAKA,MAAM,cAAc,YAA+C;AAC/D,UAAM,KAAK,WAAW;AACtB,SAAK,OAAO,MAAM,EAAE,cAAe,UAAU;AAAA,EACjD;AAAA;AAAA,EAGA,MAAM,iBAAiB,MAA6B;AAChD,UAAM,KAAK,WAAW;AACtB,SAAK,OAAO,MAAM,EAAE,iBAAkB,IAAI;AAAA,EAC9C;AAAA;AAAA,EAGA,kBAAwC;AACpC,WAAO,KAAK,OAAO,MAAM,EAAE,gBAAiB;AAAA,EAChD;AAAA;AAAA,EAGA,MAAM,UAAU,UAGZ,CAAC,GAAkF;AACnF,UAAM,KAAK,WAAW;AACtB,UAAM,UAAU,MAAM,KAAK,OAAO,MAAM,EAAE,iBAAkB,OAAO;AACnE,SAAK,KAAK,eAAe,OAAO;AAChC,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,WAAW,OAAe,SAIJ;AACxB,UAAM,KAAK,WAAW;AACtB,WAAO,KAAK,OAAO,MAAM,EAAE,OAAQ,OAAO,OAAO;AAAA,EACrD;AAAA;AAAA;AAAA,EAKA,WAAW,YAAoBC,OAAc,SAAuB;AAChE,SAAK,OAAO,MAAM,EAAE,WAAY,YAAYA,OAAM,OAAO;AAAA,EAC7D;AAAA;AAAA,EAGA,cAAc,YAAoBA,OAAoB;AAClD,SAAK,OAAO,MAAM,EAAE,cAAe,YAAYA,KAAI;AAAA,EACvD;AAAA;AAAA,EAGA,eAAwE;AACpE,WAAO,KAAK,OAAO,MAAM,EAAE,aAAc;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,WAAW,MAAc,UAA0B,CAAC,GAAoB;AAC1E,UAAM,KAAK,WAAW;AAEtB,UAAM,WAAqB,CAAC;AAG5B,QAAI,KAAK,iBAAiB;AACtB,YAAM,cAAc,MAAM,KAAK,gBAAgB,MAAM,MAAM,OAAO;AAClE,UAAI,YAAa,UAAS,KAAK,WAAW;AAAA,IAC9C;AAGA,QAAI,KAAK,IAAI,MAAM,GAAG;AAClB,YAAM,aAAa,MAAM,KAAK,WAAW,MAAM,EAAE,GAAG,QAAQ,eAAe,EAAE,CAAC;AAC9E,UAAI,WAAW,SAAS,GAAG;AACvB,cAAM,aAAa,WAAW,IAAI,OAAK;AACnC,gBAAM,SAAS,EAAE,UACX,MAAM,EAAE,SAAS,UAAU,OAAO,EAAE,SAAS,KAAK,YAAO,EAAE,OAAO,MAClE,MAAM,EAAE,SAAS,UAAU,OAAO,EAAE,SAAS,KAAK;AACxD,iBAAO,GAAG,MAAM;AAAA;AAAA,EAAO,EAAE,OAAO;AAAA,QACpC,CAAC,EAAE,KAAK,aAAa;AACrB,iBAAS,KAAK;AAAA;AAAA,EAA4B,UAAU,EAAE;AAAA,MAC1D;AAAA,IACJ;AACA,WAAO,SAAS,KAAK,MAAM;AAAA,EAC/B;AAAA;AAAA;AAAA,EAKA,MAAM,OAAO,OAAe,SAGA;AACxB,UAAM,KAAK,WAAW;AACtB,QAAI,CAAC,KAAK,SAAS;AAEf,UAAI,KAAK,IAAI,MAAM,EAAG,QAAO,KAAK,WAAW,OAAO,EAAE,GAAG,EAAE,CAAC;AAC5D,aAAO,CAAC;AAAA,IACZ;AACA,WAAO,KAAK,QAAQ,OAAO,OAAO,OAAO;AAAA,EAC7C;AAAA;AAAA,EAGA,MAAM,WAAW,OAAe,IAAY,GAA4B;AACpE,SAAK,OAAO,MAAM;AAClB,UAAM,KAAK,WAAW;AACtB,WAAO,KAAK,QAAS,OAAO,OAAO,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC;AAAA,EACxE;AAAA;AAAA,EAGA,MAAM,cAAc,OAAe,IAAY,GAA4B;AACvE,SAAK,OAAO,KAAK;AACjB,UAAM,KAAK,WAAW;AACtB,WAAO,KAAK,QAAS,OAAO,OAAO,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,EAAE,CAAC;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,aAAa,OAAe,SAcN;AACxB,UAAM,KAAK,WAAW;AAEtB,UAAM,OAAO,SAAS,eAAe,CAAC;AAEtC,UAAM,QAAQ,KAAK,QAAQ,SAAS,SAAS;AAC7C,UAAM,OAAO,KAAK,OAAO,SAAS,QAAQ;AAC1C,UAAM,QAAQ,KAAK,QAAQ;AAE3B,UAAM,cAAgC,CAAC;AAEvC,QAAI,KAAK,SAAS;AACd,YAAM,aAAa,EAAE,GAAG,SAAS,OAAO,KAAK;AAC7C,YAAM,CAAC,eAAe,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,QACnD,KAAK,QAAQ,OAAO,OAAO,UAAU;AAAA,QACrC,QAAQ,QAAQ,KAAK,MAAO,OAAO,OAAO,UAAU,CAAC;AAAA,MACzD,CAAC;AACD,kBAAY,KAAK,eAAe,WAAW;AAAA,IAC/C;AAEA,QAAI,KAAK,IAAI,MAAM,GAAG;AAClB,YAAM,aAAa,MAAM,KAAK,WAAW,OAAO,EAAE,GAAG,MAAM,CAAC;AAC5D,UAAI,WAAW,SAAS,EAAG,aAAY,KAAK,UAAU;AAAA,IAC1D;AAGA,UAAM,WAAW,oBAAI,IAAI,CAAC,QAAQ,OAAO,MAAM,CAAC;AAChD,eAAW,CAAC,MAAM,CAAC,KAAK,OAAO,QAAQ,IAAI,GAAG;AAC1C,UAAI,SAAS,IAAI,IAAI,EAAG;AACxB,YAAM,MAAM,KAAK,WAAW,IAAI;AAChC,YAAM,OAAO,MAAM,IAAI,OAAO,OAAO,EAAE,EAAE,CAAC;AAC1C,UAAI,KAAK,SAAS,GAAG;AACjB,oBAAY,KAAK,KAAK,IAAI,QAAM;AAAA,UAC5B,MAAM;AAAA,UACN,OAAO,EAAE,SAAS;AAAA,UAClB,SAAS,EAAE;AAAA,UACX,UAAU,EAAE,YAAY,MAAM,IAAI,EAAE,IAAI,GAAG,EAAE,SAAS;AAAA,QAC1D,EAAE,CAAC;AAAA,MACP;AAAA,IACJ;AAEA,QAAI,YAAY,WAAW,EAAG,QAAO,CAAC;AAEtC,UAAM,QAAQ,qBAAqB,WAAW;AAG9C,QAAI,KAAK,QAAQ,YAAY,MAAM,SAAS,GAAG;AAC3C,YAAM,YAAY,MAAM,IAAI,OAAK,EAAE,OAAO;AAC1C,YAAM,SAAS,MAAM,KAAK,QAAQ,SAAS,KAAK,OAAO,SAAS;AAChE,YAAM,UAAU,MAAM,IAAI,CAAC,GAAG,MAAM;AAChC,cAAM,MAAM,IAAI;AAChB,cAAM,YAAY,OAAO,IAAI,OAAO,OAAO,KAAK,MAAO;AACvD,eAAO;AAAA,UACH,GAAG;AAAA,UACH,OAAO,YAAY,EAAE,SAAS,IAAI,cAAc,OAAO,CAAC,KAAK;AAAA,QACjE;AAAA,MACJ,CAAC;AACD,aAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAAA,IACnD;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,WAAW,OAAe,SAEP;AACf,QAAI,CAAC,KAAK,MAAO,QAAO,CAAC;AACzB,WAAO,KAAK,MAAM,OAAO,OAAO,OAAO;AAAA,EAC3C;AAAA;AAAA,EAGA,aAAmB;AACf,SAAK,OAAO,QAAQ;AAAA,EACxB;AAAA;AAAA;AAAA,EAOA,MAAM,YAAY,UAAkB,QAAgB,IAAoB;AACpE,SAAK,OAAO,KAAK;AACjB,UAAM,KAAK,WAAW;AACtB,WAAO,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAMvB,EAAE,IAAI,IAAI,QAAQ,KAAK,KAAK;AAAA,EACjC;AAAA;AAAA,EAGA,QAAQ,UAAkB,QAAgB,GAAuB;AAC7D,UAAM,SAAS,KAAK,OAAO,KAAK;AAChC,WAAO,OAAO,QAAQ,UAAU,KAAK;AAAA,EACzC;AAAA;AAAA;AAAA,EAKA,QAAoB;AAChB,UAAM,SAAqB,CAAC;AAE5B,QAAI,KAAK,IAAI,MAAM,GAAG;AAClB,YAAM,MAAM,KAAK,QAAQ,MAAM;AAC/B,aAAO,OAAO;AAAA,QACV,OAAQ,KAAK,IAAI,QAAQ,wDAAwD,EAAE,IAAI,EAAU;AAAA,QACjG,QAAS,KAAK,IAAI,QAAQ,uCAAuC,EAAE,IAAI,EAAU;AAAA,QACjF,UAAU,IAAI,MAAM,QAAQ;AAAA,MAChC;AAAA,IACJ;AAEA,QAAI,KAAK,IAAI,KAAK,GAAG;AACjB,YAAM,MAAM,KAAK,QAAQ,KAAK;AAC9B,aAAO,MAAM;AAAA,QACT,SAAU,KAAK,IAAI,QAAQ,uCAAuC,EAAE,IAAI,EAAU;AAAA,QAClF,cAAe,KAAK,IAAI,QAAQ,yDAAyD,EAAE,IAAI,EAAU;AAAA,QACzG,SAAU,KAAK,IAAI,QAAQ,oCAAoC,EAAE,IAAI,EAAU;AAAA,QAC/E,UAAU,IAAI,MAAM,QAAQ;AAAA,MAChC;AAAA,IACJ;AAEA,QAAI,KAAK,IAAI,MAAM,GAAG;AAClB,YAAM,MAAM,KAAK,QAAQ,MAAM;AAC/B,aAAO,YAAY,IAAI,MAAM;AAAA,IACjC;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,UAAwB,CAAC,GAAY;AACvC,QAAI,CAAC,KAAK,cAAc;AACpB,YAAM,IAAI,MAAM,+DAA+D;AAAA,IACnF;AAGA,SAAK,UAAU,MAAM;AAErB,SAAK,WAAW;AAAA,MACZ,YAAY;AAAE,cAAM,KAAK,MAAM;AAAA,MAAG;AAAA,MAClC,KAAK;AAAA,MACL,KAAK,QAAQ;AAAA,MACb;AAAA,IACJ;AAEA,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,MAAM,QAAQ,UAA0B,CAAC,GAA2B;AAChE,QAAI,CAAC,KAAK,cAAc;AACpB,YAAM,IAAI,MAAM,iEAAiE;AAAA,IACrF;AAGA,UAAM,UAAU,oBAAI,IAAkE;AAGtF,QAAI,KAAK,SAAS;AACd,cAAQ,IAAI,MAAM,EAAE,MAAM,KAAK,SAAS,MAAM,KAAK,QAAQ,CAAC;AAAA,IAChE;AAGA,UAAM,UAAU,KAAK,SAAS,IAAI,MAAM;AACxC,UAAM,SAAS,KAAK,SAAS,IAAI,KAAK;AACtC,UAAM,SAAS,KAAK,SAAS,IAAI,QAAQ;AACzC,UAAM,UAAU,KAAK,SAAS,IAAI,MAAM;AACxC,UAAM,WAAW,KAAK,SAAS,IAAI,OAAO;AAE1C,QAAI,SAAS,KAAM,SAAQ,IAAI,QAAQ,EAAE,MAAM,QAAQ,MAAM,MAAM,QAAQ,SAAS,CAAC;AACrF,QAAI,QAAQ,KAAM,SAAQ,IAAI,OAAO,EAAE,MAAM,OAAO,MAAM,MAAM,OAAO,SAAS,CAAC;AACjF,QAAI,QAAQ,KAAM,SAAQ,IAAI,UAAU,EAAE,MAAM,OAAO,MAAM,MAAM,OAAO,SAAS,CAAC;AACpF,QAAI,UAAU,KAAM,SAAQ,IAAI,SAAS,EAAE,MAAM,SAAS,MAAM,MAAM,SAAS,SAAS,CAAC;AACzF,QAAI,SAAS,KAAM,SAAQ,IAAI,QAAQ,EAAE,MAAM,QAAQ,MAAM,MAAM,QAAQ,SAAS,CAAC;AAErF,UAAM,SAAS,MAAM;AAAA,MACjB,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,IACJ;AAEA,SAAK,KAAK,cAAc,MAAM;AAC9B,WAAO;AAAA,EACX;AAAA;AAAA;AAAA,EAKA,QAAc;AACV,SAAK,UAAU,MAAM;AACrB,eAAW,WAAW,KAAK,SAAS,OAAO,GAAG;AAC1C,cAAQ,QAAQ;AAAA,IACpB;AACA,QAAI,KAAK,IAAK,MAAK,IAAI,MAAM;AAC7B,SAAK,eAAe;AACpB,SAAK,aAAa,MAAM;AAAA,EAC5B;AAAA;AAAA,EAGA,IAAI,gBAAyB;AACzB,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA,EAGA,IAAI,SAAmC;AACnC,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA;AAAA,EAKQ,aACJ,OACA,OACA,MACA,OACI;AACJ,UAAM,OAAO,KAAK,IAAI,QAAQ,UAAU,KAAK,oBAAoB,KAAK,EAAE,EAAE,IAAI;AAC9E,eAAW,OAAO,MAAM;AACpB,YAAM,MAAM,IAAI,aAAa,IAAI,UAAU,OAAO;AAAA,QAC9C,IAAI,UAAU;AAAA,QACd,IAAI,UAAU,aAAa,IAAI,UAAU;AAAA,MAC7C,CAAC;AACD,WAAK,IAAI,KAAK,IAAI,KAAK,CAAC;AACxB,YAAM,IAAI,IAAI,KAAK,GAAG,GAAG;AAAA,IAC7B;AAAA,EACJ;AACJ;","names":["path","fs","path","path"]}

package/dist/chunk-Z5SU54HP.js

@@ -0,0 +1,171 @@
+import {
+  cosineSimilarity
+} from "./chunk-2P3EGY6S.js";
+import {
+  __name
+} from "./chunk-7QVYU63E.js";
+
+// src/memory/pattern-store.ts
+var PatternStore = class {
+  static {
+    __name(this, "PatternStore");
+  }
+  _deps;
+  constructor(deps) {
+    this._deps = deps;
+  }
+  /**
+   * Store a learned pattern.
+   * Returns the pattern ID.
+   */
+  async learn(pattern) {
+    const result = this._deps.db.prepare(`
+            INSERT INTO memory_patterns (task_type, task, approach, outcome, success_rate, critique, tokens_used, latency_ms)
+            VALUES (?, ?, ?, ?, ?, ?, ?, ?)
+        `).run(
+      pattern.taskType,
+      pattern.task,
+      pattern.approach,
+      pattern.outcome ?? null,
+      pattern.successRate,
+      pattern.critique ?? null,
+      pattern.tokensUsed ?? null,
+      pattern.latencyMs ?? null
+    );
+    const id = Number(result.lastInsertRowid);
+    const text = `${pattern.taskType} ${pattern.task} ${pattern.approach}`;
+    const vec = await this._deps.embedding.embed(text);
+    this._deps.db.prepare(
+      "INSERT INTO memory_vectors (pattern_id, embedding) VALUES (?, ?)"
+    ).run(id, Buffer.from(vec.buffer));
+    this._deps.hnsw.add(vec, id);
+    this._deps.vectorCache.set(id, vec);
+    return id;
+  }
+  /**
+   * Search for similar successful patterns.
+   * Filters by minimum success rate.
+   */
+  async search(query, k = 4, minSuccess = 0.5) {
+    if (this._deps.hnsw.size === 0) return [];
+    const vec = await this._deps.embedding.embed(query);
+    const hits = this._deps.hnsw.search(vec, k * 2);
+    if (hits.length === 0) return [];
+    const ids = hits.map((h) => h.id);
+    const scoreMap = new Map(hits.map((h) => [h.id, h.score]));
+    const placeholders = ids.map(() => "?").join(",");
+    const rows = this._deps.db.prepare(
+      `SELECT * FROM memory_patterns WHERE id IN (${placeholders}) AND success_rate >= ?`
+    ).all(...ids, minSuccess);
+    return rows.map((r) => ({
+      id: r.id,
+      taskType: r.task_type,
+      task: r.task,
+      approach: r.approach,
+      outcome: r.outcome,
+      successRate: r.success_rate,
+      critique: r.critique,
+      tokensUsed: r.tokens_used,
+      latencyMs: r.latency_ms,
+      score: scoreMap.get(r.id) ?? 0
+    })).sort((a, b) => b.score - a.score).slice(0, k);
+  }
+  /**
+   * Get all patterns for a specific task type.
+   */
+  getByTaskType(taskType, limit = 20) {
+    const rows = this._deps.db.prepare(
+      `SELECT * FROM memory_patterns WHERE task_type = ? ORDER BY success_rate DESC LIMIT ?`
+    ).all(taskType, limit);
+    return rows.map((r) => ({
+      id: r.id,
+      taskType: r.task_type,
+      task: r.task,
+      approach: r.approach,
+      outcome: r.outcome,
+      successRate: r.success_rate,
+      critique: r.critique,
+      tokensUsed: r.tokens_used,
+      latencyMs: r.latency_ms
+    }));
+  }
+  /** Total number of stored patterns. */
+  get count() {
+    return this._deps.db.prepare("SELECT COUNT(*) as c FROM memory_patterns").get().c;
+  }
+};
+
+// src/memory/consolidator.ts
+var Consolidator = class {
+  constructor(_db, _vectorCache) {
+    this._db = _db;
+    this._vectorCache = _vectorCache;
+  }
+  static {
+    __name(this, "Consolidator");
+  }
+  /**
+   * Remove old failed patterns.
+   * Criteria: success_rate < 0.3 AND created > 90 days ago.
+   */
+  prune(maxAgeDays = 90, minSuccess = 0.3) {
+    const cutoff = Math.floor(Date.now() / 1e3) - maxAgeDays * 86400;
+    const result = this._db.prepare(
+      "DELETE FROM memory_patterns WHERE success_rate < ? AND created_at < ?"
+    ).run(minSuccess, cutoff);
+    return result.changes;
+  }
+  /**
+   * Merge near-duplicate patterns.
+   * Keeps the one with higher success_rate.
+   * Threshold: cosine similarity > 0.95.
+   */
+  dedup(threshold = 0.95) {
+    const entries = Array.from(this._vectorCache.entries());
+    const toDelete = /* @__PURE__ */ new Set();
+    for (let i = 0; i < entries.length; i++) {
+      if (toDelete.has(entries[i][0])) continue;
+      for (let j = i + 1; j < entries.length; j++) {
+        if (toDelete.has(entries[j][0])) continue;
+        const sim = cosineSimilarity(entries[i][1], entries[j][1]);
+        if (sim > threshold) {
+          const pi = this._db.prepare(
+            "SELECT success_rate FROM memory_patterns WHERE id = ?"
+          ).get(entries[i][0]);
+          const pj = this._db.prepare(
+            "SELECT success_rate FROM memory_patterns WHERE id = ?"
+          ).get(entries[j][0]);
+          if (pi && pj) {
+            const deleteId = pi.success_rate >= pj.success_rate ? entries[j][0] : entries[i][0];
+            toDelete.add(deleteId);
+          }
+        }
+      }
+    }
+    if (toDelete.size > 0) {
+      const ids = Array.from(toDelete);
+      const placeholders = ids.map(() => "?").join(",");
+      this._db.prepare(
+        `DELETE FROM memory_patterns WHERE id IN (${placeholders})`
+      ).run(...ids);
+      for (const id of ids) {
+        this._vectorCache.delete(id);
+      }
+    }
+    return toDelete.size;
+  }
+  /**
+   * Run full consolidation: prune + dedup.
+   */
+  consolidate() {
+    const pruned = this.prune();
+    const deduped = this.dedup();
+    return { pruned, deduped };
+  }
+};
+
+export {
+  PatternStore,
+  Consolidator
+};
+//# sourceMappingURL=chunk-Z5SU54HP.js.map

package/dist/chunk-Z5SU54HP.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/memory/pattern-store.ts","../src/memory/consolidator.ts"],"sourcesContent":["/**\n * BrainBank — Pattern Store (Agent Memory)\n * \n * Stores what the agent learned from past tasks.\n * Each pattern records task, approach, and success rate.\n * Searchable by semantic similarity via HNSW.\n */\n\nimport type { Database } from '../storage/database.ts';\nimport type { EmbeddingProvider, MemoryPattern } from '../types.ts';\nimport type { HNSWIndex } from '../vector/hnsw.ts';\n\nexport interface PatternStoreDeps {\n    db: Database;\n    hnsw: HNSWIndex;\n    vectorCache: Map<number, Float32Array>;\n    embedding: EmbeddingProvider;\n}\n\nexport class PatternStore {\n    private _deps: PatternStoreDeps;\n\n    constructor(deps: PatternStoreDeps) {\n        this._deps = deps;\n    }\n\n    /**\n     * Store a learned pattern.\n     * Returns the pattern ID.\n     */\n    async learn(pattern: MemoryPattern): Promise<number> {\n        const result = this._deps.db.prepare(`\n            INSERT INTO memory_patterns (task_type, task, approach, outcome, success_rate, critique, tokens_used, latency_ms)\n            VALUES (?, ?, ?, ?, ?, ?, ?, ?)\n        `).run(\n            pattern.taskType,\n            pattern.task,\n            pattern.approach,\n            pattern.outcome ?? null,\n            pattern.successRate,\n            pattern.critique ?? null,\n            pattern.tokensUsed ?? null,\n            pattern.latencyMs ?? null,\n        );\n\n        const id = Number(result.lastInsertRowid);\n\n        // Embed and store vector\n        const text = `${pattern.taskType} ${pattern.task} ${pattern.approach}`;\n        const vec = await this._deps.embedding.embed(text);\n\n        this._deps.db.prepare(\n            'INSERT INTO memory_vectors (pattern_id, embedding) VALUES (?, ?)'\n        ).run(id, Buffer.from(vec.buffer));\n\n        this._deps.hnsw.add(vec, id);\n        this._deps.vectorCache.set(id, vec);\n\n        return id;\n    }\n\n    /**\n     * Search for similar successful patterns.\n     * Filters by minimum success rate.\n     */\n    async search(query: string, k: number = 4, minSuccess: number = 0.5): Promise<(MemoryPattern & { score: number })[]> {\n        if (this._deps.hnsw.size === 0) return [];\n\n        const vec = await this._deps.embedding.embed(query);\n        const hits = this._deps.hnsw.search(vec, k * 2);\n\n        if (hits.length === 0) return [];\n\n        const ids = hits.map(h => h.id);\n        const scoreMap = new Map(hits.map(h => [h.id, h.score]));\n\n        const placeholders = ids.map(() => '?').join(',');\n        const rows = this._deps.db.prepare(\n            `SELECT * FROM memory_patterns WHERE id IN (${placeholders}) AND success_rate >= ?`\n        ).all(...ids, minSuccess) as any[];\n\n        return rows\n            .map(r => ({\n                id: r.id,\n                taskType: r.task_type,\n                task: r.task,\n                approach: r.approach,\n                outcome: r.outcome,\n                successRate: r.success_rate,\n                critique: r.critique,\n                tokensUsed: r.tokens_used,\n                latencyMs: r.latency_ms,\n                score: scoreMap.get(r.id) ?? 0,\n            }))\n            .sort((a, b) => b.score - a.score)\n            .slice(0, k);\n    }\n\n    /**\n     * Get all patterns for a specific task type.\n     */\n    getByTaskType(taskType: string, limit: number = 20): MemoryPattern[] {\n        const rows = this._deps.db.prepare(\n            `SELECT * FROM memory_patterns WHERE task_type = ? ORDER BY success_rate DESC LIMIT ?`\n        ).all(taskType, limit) as any[];\n\n        return rows.map(r => ({\n            id: r.id,\n            taskType: r.task_type,\n            task: r.task,\n            approach: r.approach,\n            outcome: r.outcome,\n            successRate: r.success_rate,\n            critique: r.critique,\n            tokensUsed: r.tokens_used,\n            latencyMs: r.latency_ms,\n        }));\n    }\n\n    /** Total number of stored patterns. */\n    get count(): number {\n        return (this._deps.db.prepare('SELECT COUNT(*) as c FROM memory_patterns').get() as any).c;\n    }\n}\n","/**\n * BrainBank — Consolidator\n * \n * Maintenance operations for the agent memory:\n *   - prune: remove old failed patterns\n *   - dedup: merge near-duplicate patterns (cosine > 0.95)\n *   - consolidate: run both\n */\n\nimport type { Database } from '../storage/database.ts';\nimport { cosineSimilarity } from '../embeddings/math.ts';\n\nexport class Consolidator {\n    constructor(\n        private _db: Database,\n        private _vectorCache: Map<number, Float32Array>,\n    ) {}\n\n    /**\n     * Remove old failed patterns.\n     * Criteria: success_rate < 0.3 AND created > 90 days ago.\n     */\n    prune(maxAgeDays: number = 90, minSuccess: number = 0.3): number {\n        const cutoff = Math.floor(Date.now() / 1000) - maxAgeDays * 86400;\n        const result = this._db.prepare(\n            'DELETE FROM memory_patterns WHERE success_rate < ? AND created_at < ?'\n        ).run(minSuccess, cutoff);\n        return result.changes;\n    }\n\n    /**\n     * Merge near-duplicate patterns.\n     * Keeps the one with higher success_rate.\n     * Threshold: cosine similarity > 0.95.\n     */\n    dedup(threshold: number = 0.95): number {\n        const entries = Array.from(this._vectorCache.entries());\n        const toDelete = new Set<number>();\n\n        for (let i = 0; i < entries.length; i++) {\n            if (toDelete.has(entries[i][0])) continue;\n\n            for (let j = i + 1; j < entries.length; j++) {\n                if (toDelete.has(entries[j][0])) continue;\n\n                const sim = cosineSimilarity(entries[i][1], entries[j][1]);\n                if (sim > threshold) {\n                    // Keep the one with higher success rate\n                    const pi = this._db.prepare(\n                        'SELECT success_rate FROM memory_patterns WHERE id = ?'\n                    ).get(entries[i][0]) as any;\n                    const pj = this._db.prepare(\n                        'SELECT success_rate FROM memory_patterns WHERE id = ?'\n                    ).get(entries[j][0]) as any;\n\n                    if (pi && pj) {\n                        const deleteId = pi.success_rate >= pj.success_rate\n                            ? entries[j][0]\n                            : entries[i][0];\n                        toDelete.add(deleteId);\n                    }\n                }\n            }\n        }\n\n        if (toDelete.size > 0) {\n            const ids = Array.from(toDelete);\n            const placeholders = ids.map(() => '?').join(',');\n            this._db.prepare(\n                `DELETE FROM memory_patterns WHERE id IN (${placeholders})`\n            ).run(...ids);\n\n            // Clean vector cache\n            for (const id of ids) {\n                this._vectorCache.delete(id);\n            }\n        }\n\n        return toDelete.size;\n    }\n\n    /**\n     * Run full consolidation: prune + dedup.\n     */\n    consolidate(): { pruned: number; deduped: number } {\n        const pruned = this.prune();\n        const deduped = this.dedup();\n        return { pruned, deduped };\n    }\n}\n"],"mappings":";;;;;;;;AAmBO,IAAM,eAAN,MAAmB;AAAA,EAnB1B,OAmB0B;AAAA;AAAA;AAAA,EACd;AAAA,EAER,YAAY,MAAwB;AAChC,SAAK,QAAQ;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAM,SAAyC;AACjD,UAAM,SAAS,KAAK,MAAM,GAAG,QAAQ;AAAA;AAAA;AAAA,SAGpC,EAAE;AAAA,MACC,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ,WAAW;AAAA,MACnB,QAAQ;AAAA,MACR,QAAQ,YAAY;AAAA,MACpB,QAAQ,cAAc;AAAA,MACtB,QAAQ,aAAa;AAAA,IACzB;AAEA,UAAM,KAAK,OAAO,OAAO,eAAe;AAGxC,UAAM,OAAO,GAAG,QAAQ,QAAQ,IAAI,QAAQ,IAAI,IAAI,QAAQ,QAAQ;AACpE,UAAM,MAAM,MAAM,KAAK,MAAM,UAAU,MAAM,IAAI;AAEjD,SAAK,MAAM,GAAG;AAAA,MACV;AAAA,IACJ,EAAE,IAAI,IAAI,OAAO,KAAK,IAAI,MAAM,CAAC;AAEjC,SAAK,MAAM,KAAK,IAAI,KAAK,EAAE;AAC3B,SAAK,MAAM,YAAY,IAAI,IAAI,GAAG;AAElC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,OAAe,IAAY,GAAG,aAAqB,KAAqD;AACjH,QAAI,KAAK,MAAM,KAAK,SAAS,EAAG,QAAO,CAAC;AAExC,UAAM,MAAM,MAAM,KAAK,MAAM,UAAU,MAAM,KAAK;AAClD,UAAM,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,CAAC;AAE9C,QAAI,KAAK,WAAW,EAAG,QAAO,CAAC;AAE/B,UAAM,MAAM,KAAK,IAAI,OAAK,EAAE,EAAE;AAC9B,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,OAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAEvD,UAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAChD,UAAM,OAAO,KAAK,MAAM,GAAG;AAAA,MACvB,8CAA8C,YAAY;AAAA,IAC9D,EAAE,IAAI,GAAG,KAAK,UAAU;AAExB,WAAO,KACF,IAAI,QAAM;AAAA,MACP,IAAI,EAAE;AAAA,MACN,UAAU,EAAE;AAAA,MACZ,MAAM,EAAE;AAAA,MACR,UAAU,EAAE;AAAA,MACZ,SAAS,EAAE;AAAA,MACX,aAAa,EAAE;AAAA,MACf,UAAU,EAAE;AAAA,MACZ,YAAY,EAAE;AAAA,MACd,WAAW,EAAE;AAAA,MACb,OAAO,SAAS,IAAI,EAAE,EAAE,KAAK;AAAA,IACjC,EAAE,EACD,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,CAAC;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,UAAkB,QAAgB,IAAqB;AACjE,UAAM,OAAO,KAAK,MAAM,GAAG;AAAA,MACvB;AAAA,IACJ,EAAE,IAAI,UAAU,KAAK;AAErB,WAAO,KAAK,IAAI,QAAM;AAAA,MAClB,IAAI,EAAE;AAAA,MACN,UAAU,EAAE;AAAA,MACZ,MAAM,EAAE;AAAA,MACR,UAAU,EAAE;AAAA,MACZ,SAAS,EAAE;AAAA,MACX,aAAa,EAAE;AAAA,MACf,UAAU,EAAE;AAAA,MACZ,YAAY,EAAE;AAAA,MACd,WAAW,EAAE;AAAA,IACjB,EAAE;AAAA,EACN;AAAA;AAAA,EAGA,IAAI,QAAgB;AAChB,WAAQ,KAAK,MAAM,GAAG,QAAQ,2CAA2C,EAAE,IAAI,EAAU;AAAA,EAC7F;AACJ;;;AC/GO,IAAM,eAAN,MAAmB;AAAA,EACtB,YACY,KACA,cACV;AAFU;AACA;AAAA,EACT;AAAA,EAhBP,OAY0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUtB,MAAM,aAAqB,IAAI,aAAqB,KAAa;AAC7D,UAAM,SAAS,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI,IAAI,aAAa;AAC5D,UAAM,SAAS,KAAK,IAAI;AAAA,MACpB;AAAA,IACJ,EAAE,IAAI,YAAY,MAAM;AACxB,WAAO,OAAO;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,YAAoB,MAAc;AACpC,UAAM,UAAU,MAAM,KAAK,KAAK,aAAa,QAAQ,CAAC;AACtD,UAAM,WAAW,oBAAI,IAAY;AAEjC,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACrC,UAAI,SAAS,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAG;AAEjC,eAAS,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACzC,YAAI,SAAS,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAG;AAEjC,cAAM,MAAM,iBAAiB,QAAQ,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;AACzD,YAAI,MAAM,WAAW;AAEjB,gBAAM,KAAK,KAAK,IAAI;AAAA,YAChB;AAAA,UACJ,EAAE,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;AACnB,gBAAM,KAAK,KAAK,IAAI;AAAA,YAChB;AAAA,UACJ,EAAE,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;AAEnB,cAAI,MAAM,IAAI;AACV,kBAAM,WAAW,GAAG,gBAAgB,GAAG,eACjC,QAAQ,CAAC,EAAE,CAAC,IACZ,QAAQ,CAAC,EAAE,CAAC;AAClB,qBAAS,IAAI,QAAQ;AAAA,UACzB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAEA,QAAI,SAAS,OAAO,GAAG;AACnB,YAAM,MAAM,MAAM,KAAK,QAAQ;AAC/B,YAAM,eAAe,IAAI,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAChD,WAAK,IAAI;AAAA,QACL,4CAA4C,YAAY;AAAA,MAC5D,EAAE,IAAI,GAAG,GAAG;AAGZ,iBAAW,MAAM,KAAK;AAClB,aAAK,aAAa,OAAO,EAAE;AAAA,MAC/B;AAAA,IACJ;AAEA,WAAO,SAAS;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,cAAmD;AAC/C,UAAM,SAAS,KAAK,MAAM;AAC1B,UAAM,UAAU,KAAK,MAAM;AAC3B,WAAO,EAAE,QAAQ,QAAQ;AAAA,EAC7B;AACJ;","names":[]}

package/dist/cli.d.ts

@@ -0,0 +1 @@
+#!/usr/bin/env node