brainbank 0.3.1 → 0.5.0

package/dist/chunk-E6WQM4DN.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/lib/rrf.ts","../src/lib/fts.ts"],"sourcesContent":["/**\n * BrainBank — Reciprocal Rank Fusion (RRF)\n * \n * Combines results from multiple search systems (vector + BM25)\n * using the RRF algorithm: score = Σ 1/(k + rank_i)\n * \n * This is the same algorithm used by Elasticsearch, QMD, and most\n * production hybrid search systems. Simple but very effective.\n * \n * Reference: Cormack et al., \"Reciprocal Rank Fusion outperforms\n * Condorcet and individual Rank Learning Methods\" (2009)\n */\n\nimport type { SearchResult } from '@/types.ts';\n\n/**\n * Fuse ranked lists from different search systems into a single ranked list.\n * \n * @param resultSets - Arrays of SearchResult from different systems (e.g. vector, BM25)\n * @param k - Smoothing constant. Default: 60 (standard value). Higher = less emphasis on top ranks.\n * @param maxResults - Maximum results to return.\n */\nexport function reciprocalRankFusion(\n    resultSets: SearchResult[][],\n    k: number = 60,\n    maxResults: number = 15,\n): SearchResult[] {\n    // Build a map: unique key → { bestResult, rrfScore }\n    const fused = new Map<string, { result: SearchResult; rrfScore: number }>();\n\n    for (const results of resultSets) {\n        for (let rank = 0; rank < results.length; rank++) {\n            const r = results[rank];\n            const key = resultKey(r);\n            const rrfContribution = 1.0 / (k + rank + 1);\n\n            const existing = fused.get(key);\n            if (existing) {\n                existing.rrfScore += rrfContribution;\n                // Keep the result with the higher original score\n                if (r.score > existing.result.score) {\n                    existing.result = { ...r };\n                }\n            } else {\n                fused.set(key, {\n                    result: { ...r },\n                    rrfScore: rrfContribution,\n                });\n            }\n        }\n    }\n\n    // Sort by RRF score descending, normalize, and return\n    const sorted = Array.from(fused.values())\n        .sort((a, b) => b.rrfScore - a.rrfScore)\n        .slice(0, maxResults);\n\n    // Normalize RRF scores to 0..1 range\n    const maxRRF = sorted[0]?.rrfScore ?? 1;\n    return sorted.map(entry => ({\n        ...entry.result,\n        score: entry.rrfScore / maxRRF,\n        metadata: {\n            ...entry.result.metadata,\n            rrfScore: entry.rrfScore,\n        } as any,\n    }));\n}\n\n/**\n * Generate a unique key for a search result to detect duplicates across systems.\n */\nfunction resultKey(r: SearchResult): string {\n    switch (r.type) {\n        case 'code':\n            return `code:${r.filePath}:${r.metadata.startLine}-${r.metadata.endLine}`;\n        case 'commit':\n            return `commit:${r.metadata.hash || r.metadata.shortHash}`;\n        case 'pattern':\n            return `pattern:${r.metadata.taskType}:${r.content?.slice(0, 60)}`;\n        case 'document':\n            return `document:${r.filePath ?? ''}:${(r.metadata as any).collection ?? ''}:${(r.metadata as any).seq ?? ''}:${r.content?.slice(0, 80)}`;\n        case 'collection':\n            return `collection:${(r.metadata as any).id ?? r.content?.slice(0, 80)}`;\n    }\n}\n","/**\n * BrainBank — FTS Utilities\n * \n * Shared helpers for SQLite FTS5 query sanitization.\n */\n\n/**\n * Split camelCase, PascalCase, and snake_case into individual words.\n *   \"MagicLinkCallback\" → \"Magic Link Callback\"\n *   \"tenant_worker\"     → \"tenant worker\"\n */\nfunction splitCompound(word: string): string {\n    return word\n        .replace(/([a-z])([A-Z])/g, '$1 $2')   // camelCase → camel Case\n        .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2') // HTMLParser → HTML Parser\n        .replace(/[_\\-./\\\\]/g, ' ')              // snake_case, kebab-case, paths\n        .trim();\n}\n\n/**\n * Sanitize a user query for FTS5 syntax.\n * Strips operators that would cause parse errors, splits compound words,\n * and converts 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    // Split compound words (camelCase, PascalCase, snake_case)\n    const expanded = clean.split(/\\s+/)\n        .map(w => splitCompound(w))\n        .join(' ');\n\n    const words = expanded.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"],"mappings":";;;;;AAsBO,SAAS,qBACZ,YACA,IAAY,IACZ,aAAqB,IACP;AAEd,QAAM,QAAQ,oBAAI,IAAwD;AAE1E,aAAW,WAAW,YAAY;AAC9B,aAAS,OAAO,GAAG,OAAO,QAAQ,QAAQ,QAAQ;AAC9C,YAAM,IAAI,QAAQ,IAAI;AACtB,YAAM,MAAM,UAAU,CAAC;AACvB,YAAM,kBAAkB,KAAO,IAAI,OAAO;AAE1C,YAAM,WAAW,MAAM,IAAI,GAAG;AAC9B,UAAI,UAAU;AACV,iBAAS,YAAY;AAErB,YAAI,EAAE,QAAQ,SAAS,OAAO,OAAO;AACjC,mBAAS,SAAS,EAAE,GAAG,EAAE;AAAA,QAC7B;AAAA,MACJ,OAAO;AACH,cAAM,IAAI,KAAK;AAAA,UACX,QAAQ,EAAE,GAAG,EAAE;AAAA,UACf,UAAU;AAAA,QACd,CAAC;AAAA,MACL;AAAA,IACJ;AAAA,EACJ;AAGA,QAAM,SAAS,MAAM,KAAK,MAAM,OAAO,CAAC,EACnC,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ,EACtC,MAAM,GAAG,UAAU;AAGxB,QAAM,SAAS,OAAO,CAAC,GAAG,YAAY;AACtC,SAAO,OAAO,IAAI,YAAU;AAAA,IACxB,GAAG,MAAM;AAAA,IACT,OAAO,MAAM,WAAW;AAAA,IACxB,UAAU;AAAA,MACN,GAAG,MAAM,OAAO;AAAA,MAChB,UAAU,MAAM;AAAA,IACpB;AAAA,EACJ,EAAE;AACN;AA7CgB;AAkDhB,SAAS,UAAU,GAAyB;AACxC,UAAQ,EAAE,MAAM;AAAA,IACZ,KAAK;AACD,aAAO,QAAQ,EAAE,QAAQ,IAAI,EAAE,SAAS,SAAS,IAAI,EAAE,SAAS,OAAO;AAAA,IAC3E,KAAK;AACD,aAAO,UAAU,EAAE,SAAS,QAAQ,EAAE,SAAS,SAAS;AAAA,IAC5D,KAAK;AACD,aAAO,WAAW,EAAE,SAAS,QAAQ,IAAI,EAAE,SAAS,MAAM,GAAG,EAAE,CAAC;AAAA,IACpE,KAAK;AACD,aAAO,YAAY,EAAE,YAAY,EAAE,IAAK,EAAE,SAAiB,cAAc,EAAE,IAAK,EAAE,SAAiB,OAAO,EAAE,IAAI,EAAE,SAAS,MAAM,GAAG,EAAE,CAAC;AAAA,IAC3I,KAAK;AACD,aAAO,cAAe,EAAE,SAAiB,MAAM,EAAE,SAAS,MAAM,GAAG,EAAE,CAAC;AAAA,EAC9E;AACJ;AAbS;;;AC7DT,SAAS,cAAc,MAAsB;AACzC,SAAO,KACF,QAAQ,mBAAmB,OAAO,EAClC,QAAQ,yBAAyB,OAAO,EACxC,QAAQ,cAAc,GAAG,EACzB,KAAK;AACd;AANS;AAaF,SAAS,YAAY,OAAuB;AAC/C,QAAM,QAAQ,MACT,QAAQ,kBAAkB,GAAG,EAC7B,QAAQ,qCAAqC,EAAE,EAC/C,KAAK;AAGV,QAAM,WAAW,MAAM,MAAM,KAAK,EAC7B,IAAI,OAAK,cAAc,CAAC,CAAC,EACzB,KAAK,GAAG;AAEb,QAAM,QAAQ,SAAS,MAAM,KAAK,EAAE,OAAO,OAAK,EAAE,SAAS,CAAC;AAC5D,MAAI,MAAM,WAAW,EAAG,QAAO;AAE/B,SAAO,MAAM,IAAI,OAAK,IAAI,CAAC,GAAG,EAAE,KAAK,GAAG;AAC5C;AAfgB;AAqBT,SAAS,cAAc,UAA0B;AACpD,QAAM,MAAM,KAAK,IAAI,QAAQ;AAC7B,SAAO,KAAO,IAAM,KAAK,IAAI,QAAQ,MAAM,EAAE;AACjD;AAHgB;","names":[]}

package/dist/chunk-FI7GWG4W.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/indexers/git/git-indexer.ts","../src/indexers/git/co-edit-analyzer.ts","../src/indexers/git/git-plugin.ts"],"sourcesContent":["/**\n * BrainBank — Git Indexer\n * \n * Reads git history, embeds commit messages + diffs,\n * and computes file co-edit relationships.\n * Incremental: only processes new commits.\n */\n\nimport type { Database } from '@/db/database.ts';\nimport type { EmbeddingProvider, ProgressCallback, IndexResult } from '@/types.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\n\nexport interface GitIndexerDeps {\n    db: Database;\n    hnsw: HNSWIndex;\n    vectorCache: Map<number, Float32Array>;\n    embedding: EmbeddingProvider;\n}\n\nexport interface GitIndexOptions {\n    depth?: number;\n    onProgress?: ProgressCallback;\n}\n\ninterface CommitData {\n    commit: any;\n    diff: string;\n    additions: number;\n    deletions: number;\n    filesChanged: string[];\n    isMerge: boolean;\n    text: string;\n}\n\n/** Prepared statements for git commit operations. */\ninterface GitStatements {\n    check: any;\n    deleteFiles: any;\n    deleteCommit: any;\n    insertCommit: any;\n    insertFile: any;\n    insertVec: any;\n}\n\nexport class GitIndexer {\n    private _deps: GitIndexerDeps;\n    private _repoPath: string;\n    private _maxDiffBytes: number;\n\n    constructor(repoPath: string, deps: GitIndexerDeps, maxDiffBytes: number = 8192) {\n        this._deps = deps;\n        this._repoPath = repoPath;\n        this._maxDiffBytes = maxDiffBytes;\n    }\n\n    /**\n     * Index git history.\n     * Only processes commits not already in the database.\n     */\n    async index(options: GitIndexOptions = {}): Promise<IndexResult> {\n        const { depth = 500, onProgress } = options;\n\n        const git = await this._initGit();\n        if (!git) return { indexed: 0, skipped: 0 };\n\n        let log: any;\n        try { log = await git.log({ maxCount: depth }); }\n        catch { return { indexed: 0, skipped: 0 }; }\n\n        const stmts = this._prepareStatements();\n        const { toProcess, skipped } = await this._collectCommits(git, log.all, stmts, onProgress);\n\n        if (toProcess.length === 0) return { indexed: 0, skipped };\n\n        const vecs = await this._deps.embedding.embedBatch(toProcess.map(d => d.text));\n        const { indexed, newCommitIds } = this._insertCommits(toProcess, vecs, stmts);\n\n        this._updateHnsw(vecs, newCommitIds);\n\n        return { indexed, skipped };\n    }\n\n    /** Initialize simple-git. Returns null if git is unavailable. */\n    private async _initGit(): Promise<any | null> {\n        try {\n            const simpleGit = (await import('simple-git')).default;\n            return simpleGit(this._repoPath);\n        } catch {\n            return null;\n        }\n    }\n\n    /** Prepare all SQL statements (hoisted outside loops). */\n    private _prepareStatements(): GitStatements {\n        const db = this._deps.db;\n        return {\n            check: db.prepare(`\n                SELECT gc.id, gv.commit_id AS has_vector\n                FROM git_commits gc\n                LEFT JOIN git_vectors gv ON gv.commit_id = gc.id\n                WHERE gc.hash = ?`),\n            deleteFiles: db.prepare('DELETE FROM commit_files WHERE commit_id = ?'),\n            deleteCommit: db.prepare('DELETE FROM git_commits WHERE id = ?'),\n            insertCommit: db.prepare(`\n                INSERT OR IGNORE INTO git_commits (hash, short_hash, message, author, date, timestamp, files_json, diff, additions, deletions, is_merge)\n                VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`),\n            insertFile: db.prepare('INSERT INTO commit_files (commit_id, file_path) VALUES (?, ?)'),\n            insertVec: db.prepare('INSERT OR IGNORE INTO git_vectors (commit_id, embedding) VALUES (?, ?)'),\n        };\n    }\n\n    /** Phase 1: Collect commit data from git (async git calls). */\n    private async _collectCommits(\n        git: any,\n        commits: any[],\n        stmts: GitStatements,\n        onProgress?: ProgressCallback,\n    ): Promise<{ toProcess: CommitData[]; skipped: number }> {\n        const toProcess: CommitData[] = [];\n        let skipped = 0;\n\n        for (let i = 0; i < commits.length; i++) {\n            const c = commits[i];\n            onProgress?.(`[${c.hash.slice(0, 7)}] ${c.message.slice(0, 50)}`, i + 1, commits.length);\n\n            const exists = stmts.check.get(c.hash) as any;\n            if (exists?.has_vector) { skipped++; continue; }\n\n            // Zombie commit (data exists but vector missing) — clean up\n            if (exists && !exists.has_vector) {\n                stmts.deleteFiles.run(exists.id);\n                stmts.deleteCommit.run(exists.id);\n            }\n\n            const data = await this._parseCommit(git, c);\n            toProcess.push(data);\n        }\n\n        return { toProcess, skipped };\n    }\n\n    /** Extract diff, stat, and text from a single commit. */\n    private async _parseCommit(git: any, c: any): Promise<CommitData> {\n        let diff = '';\n        let additions = 0, deletions = 0;\n        const filesChanged: string[] = [];\n\n        try {\n            const numstat = await git.raw(['show', '--numstat', '--format=', c.hash]);\n            for (const line of numstat.trim().split('\\n')) {\n                if (!line.trim()) continue;\n                const parts = line.split('\\t');\n                if (parts.length < 3) continue;\n                const add = parseInt(parts[0], 10);\n                const del = parseInt(parts[1], 10);\n                const file = parts[2].trim();\n                if (file) {\n                    filesChanged.push(file);\n                    if (!isNaN(add)) additions += add;\n                    if (!isNaN(del)) deletions += del;\n                }\n            }\n\n            const rawDiff = await git.raw(['show', '--format=', '--unified=3', '--no-color', c.hash]);\n            diff = rawDiff.length > this._maxDiffBytes\n                ? rawDiff.slice(0, this._maxDiffBytes) + '\\n... [truncated]'\n                : rawDiff;\n        } catch {}\n\n        const isMerge = /^(Merge|merge)\\s+(branch|pull|remote|tag)\\b/.test(c.message);\n        const text = [\n            `Commit: ${c.message}`,\n            `Author: ${c.author_name}`,\n            `Date: ${c.date}`,\n            filesChanged.length > 0 ? `Files: ${filesChanged.join(', ')}` : '',\n            diff ? `Changes:\\n${diff.slice(0, 2000)}` : '',\n        ].filter(Boolean).join('\\n');\n\n        return { commit: c, diff, additions, deletions, filesChanged, isMerge, text };\n    }\n\n    /** Phase 3: Insert commits + vectors in a single transaction. */\n    private _insertCommits(\n        toProcess: CommitData[],\n        vecs: Float32Array[],\n        stmts: GitStatements,\n    ): { indexed: number; newCommitIds: { commitId: number; vecIndex: number }[] } {\n        let indexed = 0;\n        const newCommitIds: { commitId: number; vecIndex: number }[] = [];\n\n        this._deps.db.transaction(() => {\n            for (let i = 0; i < toProcess.length; i++) {\n                const d = toProcess[i];\n                const c = d.commit;\n                const ts = Math.floor(new Date(c.date).getTime() / 1000);\n\n                const result = stmts.insertCommit.run(\n                    c.hash, c.hash.slice(0, 7), c.message, c.author_name, c.date,\n                    ts, JSON.stringify(d.filesChanged), d.diff || null,\n                    d.additions, d.deletions, d.isMerge ? 1 : 0,\n                );\n\n                if (result.changes === 0) continue;\n                const commitId = Number(result.lastInsertRowid);\n\n                for (const f of d.filesChanged) {\n                    stmts.insertFile.run(commitId, f);\n                }\n\n                stmts.insertVec.run(commitId, Buffer.from(vecs[i].buffer));\n                newCommitIds.push({ commitId, vecIndex: i });\n                indexed++;\n            }\n        });\n\n        return { indexed, newCommitIds };\n    }\n\n    /** Phase 4: Update HNSW index and compute co-edits. */\n    private _updateHnsw(\n        vecs: Float32Array[],\n        inserted: { commitId: number; vecIndex: number }[],\n    ): void {\n        const newCommitIds: number[] = [];\n        for (const { commitId, vecIndex } of inserted) {\n            this._deps.hnsw.add(vecs[vecIndex], commitId);\n            this._deps.vectorCache.set(commitId, vecs[vecIndex]);\n            newCommitIds.push(commitId);\n        }\n\n        if (newCommitIds.length > 0) {\n            this._computeCoEdits(newCommitIds);\n        }\n    }\n\n    /** Compute which files tend to be edited together. */\n    private _computeCoEdits(newCommitIds: number[]): void {\n        if (newCommitIds.length === 0) return;\n\n        const rows = this._queryCommitFiles(newCommitIds);\n        const byCommit = this._groupFilesByCommit(rows);\n\n        const upsert = this._deps.db.prepare(\n            `INSERT INTO co_edits (file_a, file_b, count)\n             VALUES (?, ?, 1)\n             ON CONFLICT(file_a, file_b) DO UPDATE SET count = count + 1`\n        );\n\n        this._deps.db.transaction(() => {\n            for (const files of byCommit.values()) {\n                if (files.length < 2 || files.length > 20) continue;\n                for (let i = 0; i < files.length; i++) {\n                    for (let j = i + 1; j < files.length; j++) {\n                        const [a, b] = [files[i], files[j]].sort();\n                        upsert.run(a, b);\n                    }\n                }\n            }\n        });\n    }\n\n    /** Query commit_files in chunks to stay under SQLite's 999-variable limit. */\n    private _queryCommitFiles(commitIds: number[]): any[] {\n        const CHUNK_SIZE = 500;\n        const allRows: any[] = [];\n        for (let i = 0; i < commitIds.length; i += CHUNK_SIZE) {\n            const chunk = commitIds.slice(i, i + CHUNK_SIZE);\n            const placeholders = chunk.map(() => '?').join(',');\n            const rows = this._deps.db.prepare(\n                `SELECT commit_id, file_path FROM commit_files WHERE commit_id IN (${placeholders}) ORDER BY commit_id`\n            ).all(...chunk) as any[];\n            allRows.push(...rows);\n        }\n        return allRows;\n    }\n\n    /** Group file paths by commit ID. */\n    private _groupFilesByCommit(rows: any[]): Map<number, string[]> {\n        const byCommit = new Map<number, string[]>();\n        for (const r of rows) {\n            if (!byCommit.has(r.commit_id)) byCommit.set(r.commit_id, []);\n            byCommit.get(r.commit_id)!.push(r.file_path);\n        }\n        return byCommit;\n    }\n}\n","/**\n * BrainBank — Co-Edit Analyzer\n * \n * Suggests files that historically change together.\n * Based on git commit co-occurrence analysis.\n */\n\nimport type { Database } from '@/db/database.ts';\nimport type { CoEditSuggestion } from '@/types.ts';\n\nexport class CoEditAnalyzer {\n    constructor(private _db: Database) {}\n\n    /**\n     * Get files that frequently change alongside the given file.\n     * Returns sorted by co-edit count (highest first).\n     */\n    suggest(filePath: string, limit: number = 5): CoEditSuggestion[] {\n        const rows = this._db.prepare(`\n            SELECT\n                CASE WHEN file_a = ? THEN file_b ELSE file_a END AS file,\n                count\n            FROM co_edits\n            WHERE file_a = ? OR file_b = ?\n            ORDER BY count DESC\n            LIMIT ?\n        `).all(filePath, filePath, filePath, limit) as any[];\n\n        return rows.map(r => ({ file: r.file, count: r.count }));\n    }\n}\n","/**\n * BrainBank — Git Module\n * \n * Git history indexing with co-edit relationships.\n * \n *   import { git } from 'brainbank/git';\n *   brain.use(git({ depth: 500 }));\n *   \n *   // Multi-repo: namespace to avoid key collisions\n *   brain\n *     .use(git({ repoPath: './frontend', name: 'git:frontend' }))\n *     .use(git({ repoPath: './backend',  name: 'git:backend' }));\n */\n\nimport type { Indexer, IndexerContext } from '@/indexers/base.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\nimport type { Database } from '@/db/database.ts';\nimport { GitIndexer } from './git-indexer.ts';\nimport { CoEditAnalyzer } from './co-edit-analyzer.ts';\nimport type { IndexResult, ProgressCallback, CoEditSuggestion } from '@/types.ts';\n\nexport interface GitPluginOptions {\n    /** Repository path. Default: from config */\n    repoPath?: string;\n    /** Max commits to index. Default: from config */\n    depth?: number;\n    /** Max diff bytes. Default: from config */\n    maxDiffBytes?: number;\n    /** Custom indexer name for multi-repo (e.g. 'git:frontend'). Default: 'git' */\n    name?: string;\n}\n\nclass GitPlugin implements Indexer {\n    readonly name: string;\n    private db!: Database;\n    hnsw!: HNSWIndex;\n    indexer!: GitIndexer;\n    coEdits!: CoEditAnalyzer;\n    vecCache = new Map<number, Float32Array>();\n\n    constructor(private opts: GitPluginOptions = {}) {\n        this.name = opts.name ?? 'git';\n    }\n\n    async initialize(ctx: IndexerContext): Promise<void> {\n        this.db = ctx.db;\n        // Use shared HNSW so all git indexers share one index\n        const shared = await ctx.getOrCreateSharedHnsw('git', 500_000);\n        this.hnsw = shared.hnsw;\n        this.vecCache = shared.vecCache;\n\n        if (shared.isNew) {\n            ctx.loadVectors('git_vectors', 'commit_id', this.hnsw, this.vecCache);\n        }\n\n        const repoPath = this.opts.repoPath ?? ctx.config.repoPath;\n        this.indexer = new GitIndexer(repoPath, {\n            db: ctx.db,\n            hnsw: this.hnsw,\n            vectorCache: this.vecCache,\n            embedding: ctx.embedding,\n        }, this.opts.maxDiffBytes ?? ctx.config.maxDiffBytes);\n\n        this.coEdits = new CoEditAnalyzer(ctx.db);\n    }\n\n    async index(options: {\n        depth?: number;\n        onProgress?: ProgressCallback;\n    } = {}): Promise<IndexResult> {\n        return this.indexer.index(options);\n    }\n\n    suggestCoEdits(filePath: string, limit: number = 5): CoEditSuggestion[] {\n        return this.coEdits.suggest(filePath, limit);\n    }\n\n    /** Get git history for a specific file. */\n    fileHistory(filePath: string, limit: number = 20): any[] {\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    stats(): Record<string, number> {\n        return {\n            commits:      (this.db.prepare('SELECT COUNT(*) as c FROM git_commits').get() as { c: number }).c,\n            filesTracked: (this.db.prepare('SELECT COUNT(DISTINCT file_path) as c FROM commit_files').get() as { c: number }).c,\n            coEdits:      (this.db.prepare('SELECT COUNT(*) as c FROM co_edits').get() as { c: number }).c,\n            hnswSize:     this.hnsw.size,\n        };\n    }\n}\n\n/** Create a git history plugin. */\nexport function git(opts?: GitPluginOptions): Indexer {\n    return new GitPlugin(opts);\n}\n"],"mappings":";;;;;AA4CO,IAAM,aAAN,MAAiB;AAAA,EA5CxB,OA4CwB;AAAA;AAAA;AAAA,EACZ;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAY,UAAkB,MAAsB,eAAuB,MAAM;AAC7E,SAAK,QAAQ;AACb,SAAK,YAAY;AACjB,SAAK,gBAAgB;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAM,UAA2B,CAAC,GAAyB;AAC7D,UAAM,EAAE,QAAQ,KAAK,WAAW,IAAI;AAEpC,UAAMA,OAAM,MAAM,KAAK,SAAS;AAChC,QAAI,CAACA,KAAK,QAAO,EAAE,SAAS,GAAG,SAAS,EAAE;AAE1C,QAAI;AACJ,QAAI;AAAE,YAAM,MAAMA,KAAI,IAAI,EAAE,UAAU,MAAM,CAAC;AAAA,IAAG,QAC1C;AAAE,aAAO,EAAE,SAAS,GAAG,SAAS,EAAE;AAAA,IAAG;AAE3C,UAAM,QAAQ,KAAK,mBAAmB;AACtC,UAAM,EAAE,WAAW,QAAQ,IAAI,MAAM,KAAK,gBAAgBA,MAAK,IAAI,KAAK,OAAO,UAAU;AAEzF,QAAI,UAAU,WAAW,EAAG,QAAO,EAAE,SAAS,GAAG,QAAQ;AAEzD,UAAM,OAAO,MAAM,KAAK,MAAM,UAAU,WAAW,UAAU,IAAI,OAAK,EAAE,IAAI,CAAC;AAC7E,UAAM,EAAE,SAAS,aAAa,IAAI,KAAK,eAAe,WAAW,MAAM,KAAK;AAE5E,SAAK,YAAY,MAAM,YAAY;AAEnC,WAAO,EAAE,SAAS,QAAQ;AAAA,EAC9B;AAAA;AAAA,EAGA,MAAc,WAAgC;AAC1C,QAAI;AACA,YAAM,aAAa,MAAM,OAAO,YAAY,GAAG;AAC/C,aAAO,UAAU,KAAK,SAAS;AAAA,IACnC,QAAQ;AACJ,aAAO;AAAA,IACX;AAAA,EACJ;AAAA;AAAA,EAGQ,qBAAoC;AACxC,UAAM,KAAK,KAAK,MAAM;AACtB,WAAO;AAAA,MACH,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA,kCAII;AAAA,MACtB,aAAa,GAAG,QAAQ,8CAA8C;AAAA,MACtE,cAAc,GAAG,QAAQ,sCAAsC;AAAA,MAC/D,cAAc,GAAG,QAAQ;AAAA;AAAA,yDAEoB;AAAA,MAC7C,YAAY,GAAG,QAAQ,+DAA+D;AAAA,MACtF,WAAW,GAAG,QAAQ,wEAAwE;AAAA,IAClG;AAAA,EACJ;AAAA;AAAA,EAGA,MAAc,gBACVA,MACA,SACA,OACA,YACqD;AACrD,UAAM,YAA0B,CAAC;AACjC,QAAI,UAAU;AAEd,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACrC,YAAM,IAAI,QAAQ,CAAC;AACnB,mBAAa,IAAI,EAAE,KAAK,MAAM,GAAG,CAAC,CAAC,KAAK,EAAE,QAAQ,MAAM,GAAG,EAAE,CAAC,IAAI,IAAI,GAAG,QAAQ,MAAM;AAEvF,YAAM,SAAS,MAAM,MAAM,IAAI,EAAE,IAAI;AACrC,UAAI,QAAQ,YAAY;AAAE;AAAW;AAAA,MAAU;AAG/C,UAAI,UAAU,CAAC,OAAO,YAAY;AAC9B,cAAM,YAAY,IAAI,OAAO,EAAE;AAC/B,cAAM,aAAa,IAAI,OAAO,EAAE;AAAA,MACpC;AAEA,YAAM,OAAO,MAAM,KAAK,aAAaA,MAAK,CAAC;AAC3C,gBAAU,KAAK,IAAI;AAAA,IACvB;AAEA,WAAO,EAAE,WAAW,QAAQ;AAAA,EAChC;AAAA;AAAA,EAGA,MAAc,aAAaA,MAAU,GAA6B;AAC9D,QAAI,OAAO;AACX,QAAI,YAAY,GAAG,YAAY;AAC/B,UAAM,eAAyB,CAAC;AAEhC,QAAI;AACA,YAAM,UAAU,MAAMA,KAAI,IAAI,CAAC,QAAQ,aAAa,aAAa,EAAE,IAAI,CAAC;AACxE,iBAAW,QAAQ,QAAQ,KAAK,EAAE,MAAM,IAAI,GAAG;AAC3C,YAAI,CAAC,KAAK,KAAK,EAAG;AAClB,cAAM,QAAQ,KAAK,MAAM,GAAI;AAC7B,YAAI,MAAM,SAAS,EAAG;AACtB,cAAM,MAAM,SAAS,MAAM,CAAC,GAAG,EAAE;AACjC,cAAM,MAAM,SAAS,MAAM,CAAC,GAAG,EAAE;AACjC,cAAM,OAAO,MAAM,CAAC,EAAE,KAAK;AAC3B,YAAI,MAAM;AACN,uBAAa,KAAK,IAAI;AACtB,cAAI,CAAC,MAAM,GAAG,EAAG,cAAa;AAC9B,cAAI,CAAC,MAAM,GAAG,EAAG,cAAa;AAAA,QAClC;AAAA,MACJ;AAEA,YAAM,UAAU,MAAMA,KAAI,IAAI,CAAC,QAAQ,aAAa,eAAe,cAAc,EAAE,IAAI,CAAC;AACxF,aAAO,QAAQ,SAAS,KAAK,gBACvB,QAAQ,MAAM,GAAG,KAAK,aAAa,IAAI,sBACvC;AAAA,IACV,QAAQ;AAAA,IAAC;AAET,UAAM,UAAU,8CAA8C,KAAK,EAAE,OAAO;AAC5E,UAAM,OAAO;AAAA,MACT,WAAW,EAAE,OAAO;AAAA,MACpB,WAAW,EAAE,WAAW;AAAA,MACxB,SAAS,EAAE,IAAI;AAAA,MACf,aAAa,SAAS,IAAI,UAAU,aAAa,KAAK,IAAI,CAAC,KAAK;AAAA,MAChE,OAAO;AAAA,EAAa,KAAK,MAAM,GAAG,GAAI,CAAC,KAAK;AAAA,IAChD,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI;AAE3B,WAAO,EAAE,QAAQ,GAAG,MAAM,WAAW,WAAW,cAAc,SAAS,KAAK;AAAA,EAChF;AAAA;AAAA,EAGQ,eACJ,WACA,MACA,OAC2E;AAC3E,QAAI,UAAU;AACd,UAAM,eAAyD,CAAC;AAEhE,SAAK,MAAM,GAAG,YAAY,MAAM;AAC5B,eAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACvC,cAAM,IAAI,UAAU,CAAC;AACrB,cAAM,IAAI,EAAE;AACZ,cAAM,KAAK,KAAK,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,IAAI,GAAI;AAEvD,cAAM,SAAS,MAAM,aAAa;AAAA,UAC9B,EAAE;AAAA,UAAM,EAAE,KAAK,MAAM,GAAG,CAAC;AAAA,UAAG,EAAE;AAAA,UAAS,EAAE;AAAA,UAAa,EAAE;AAAA,UACxD;AAAA,UAAI,KAAK,UAAU,EAAE,YAAY;AAAA,UAAG,EAAE,QAAQ;AAAA,UAC9C,EAAE;AAAA,UAAW,EAAE;AAAA,UAAW,EAAE,UAAU,IAAI;AAAA,QAC9C;AAEA,YAAI,OAAO,YAAY,EAAG;AAC1B,cAAM,WAAW,OAAO,OAAO,eAAe;AAE9C,mBAAW,KAAK,EAAE,cAAc;AAC5B,gBAAM,WAAW,IAAI,UAAU,CAAC;AAAA,QACpC;AAEA,cAAM,UAAU,IAAI,UAAU,OAAO,KAAK,KAAK,CAAC,EAAE,MAAM,CAAC;AACzD,qBAAa,KAAK,EAAE,UAAU,UAAU,EAAE,CAAC;AAC3C;AAAA,MACJ;AAAA,IACJ,CAAC;AAED,WAAO,EAAE,SAAS,aAAa;AAAA,EACnC;AAAA;AAAA,EAGQ,YACJ,MACA,UACI;AACJ,UAAM,eAAyB,CAAC;AAChC,eAAW,EAAE,UAAU,SAAS,KAAK,UAAU;AAC3C,WAAK,MAAM,KAAK,IAAI,KAAK,QAAQ,GAAG,QAAQ;AAC5C,WAAK,MAAM,YAAY,IAAI,UAAU,KAAK,QAAQ,CAAC;AACnD,mBAAa,KAAK,QAAQ;AAAA,IAC9B;AAEA,QAAI,aAAa,SAAS,GAAG;AACzB,WAAK,gBAAgB,YAAY;AAAA,IACrC;AAAA,EACJ;AAAA;AAAA,EAGQ,gBAAgB,cAA8B;AAClD,QAAI,aAAa,WAAW,EAAG;AAE/B,UAAM,OAAO,KAAK,kBAAkB,YAAY;AAChD,UAAM,WAAW,KAAK,oBAAoB,IAAI;AAE9C,UAAM,SAAS,KAAK,MAAM,GAAG;AAAA,MACzB;AAAA;AAAA;AAAA,IAGJ;AAEA,SAAK,MAAM,GAAG,YAAY,MAAM;AAC5B,iBAAW,SAAS,SAAS,OAAO,GAAG;AACnC,YAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAI;AAC3C,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,mBAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACvC,kBAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,KAAK;AACzC,mBAAO,IAAI,GAAG,CAAC;AAAA,UACnB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA,EAGQ,kBAAkB,WAA4B;AAClD,UAAM,aAAa;AACnB,UAAM,UAAiB,CAAC;AACxB,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK,YAAY;AACnD,YAAM,QAAQ,UAAU,MAAM,GAAG,IAAI,UAAU;AAC/C,YAAM,eAAe,MAAM,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG;AAClD,YAAM,OAAO,KAAK,MAAM,GAAG;AAAA,QACvB,qEAAqE,YAAY;AAAA,MACrF,EAAE,IAAI,GAAG,KAAK;AACd,cAAQ,KAAK,GAAG,IAAI;AAAA,IACxB;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,oBAAoB,MAAoC;AAC5D,UAAM,WAAW,oBAAI,IAAsB;AAC3C,eAAW,KAAK,MAAM;AAClB,UAAI,CAAC,SAAS,IAAI,EAAE,SAAS,EAAG,UAAS,IAAI,EAAE,WAAW,CAAC,CAAC;AAC5D,eAAS,IAAI,EAAE,SAAS,EAAG,KAAK,EAAE,SAAS;AAAA,IAC/C;AACA,WAAO;AAAA,EACX;AACJ;;;ACnRO,IAAM,iBAAN,MAAqB;AAAA,EACxB,YAAoB,KAAe;AAAf;AAAA,EAAgB;AAAA,EAXxC,OAU4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOxB,QAAQ,UAAkB,QAAgB,GAAuB;AAC7D,UAAM,OAAO,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAQ7B,EAAE,IAAI,UAAU,UAAU,UAAU,KAAK;AAE1C,WAAO,KAAK,IAAI,QAAM,EAAE,MAAM,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EAC3D;AACJ;;;ACEA,IAAM,YAAN,MAAmC;AAAA,EAQ/B,YAAoB,OAAyB,CAAC,GAAG;AAA7B;AAChB,SAAK,OAAO,KAAK,QAAQ;AAAA,EAC7B;AAAA,EA1CJ,OAgCmC;AAAA;AAAA;AAAA,EACtB;AAAA,EACD;AAAA,EACR;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW,oBAAI,IAA0B;AAAA,EAMzC,MAAM,WAAW,KAAoC;AACjD,SAAK,KAAK,IAAI;AAEd,UAAM,SAAS,MAAM,IAAI,sBAAsB,OAAO,GAAO;AAC7D,SAAK,OAAO,OAAO;AACnB,SAAK,WAAW,OAAO;AAEvB,QAAI,OAAO,OAAO;AACd,UAAI,YAAY,eAAe,aAAa,KAAK,MAAM,KAAK,QAAQ;AAAA,IACxE;AAEA,UAAM,WAAW,KAAK,KAAK,YAAY,IAAI,OAAO;AAClD,SAAK,UAAU,IAAI,WAAW,UAAU;AAAA,MACpC,IAAI,IAAI;AAAA,MACR,MAAM,KAAK;AAAA,MACX,aAAa,KAAK;AAAA,MAClB,WAAW,IAAI;AAAA,IACnB,GAAG,KAAK,KAAK,gBAAgB,IAAI,OAAO,YAAY;AAEpD,SAAK,UAAU,IAAI,eAAe,IAAI,EAAE;AAAA,EAC5C;AAAA,EAEA,MAAM,MAAM,UAGR,CAAC,GAAyB;AAC1B,WAAO,KAAK,QAAQ,MAAM,OAAO;AAAA,EACrC;AAAA,EAEA,eAAe,UAAkB,QAAgB,GAAuB;AACpE,WAAO,KAAK,QAAQ,QAAQ,UAAU,KAAK;AAAA,EAC/C;AAAA;AAAA,EAGA,YAAY,UAAkB,QAAgB,IAAW;AACrD,WAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAMtB,EAAE,IAAI,IAAI,QAAQ,KAAK,KAAK;AAAA,EACjC;AAAA,EAEA,QAAgC;AAC5B,WAAO;AAAA,MACH,SAAe,KAAK,GAAG,QAAQ,uCAAuC,EAAE,IAAI,EAAoB;AAAA,MAChG,cAAe,KAAK,GAAG,QAAQ,yDAAyD,EAAE,IAAI,EAAoB;AAAA,MAClH,SAAe,KAAK,GAAG,QAAQ,oCAAoC,EAAE,IAAI,EAAoB;AAAA,MAC7F,UAAc,KAAK,KAAK;AAAA,IAC5B;AAAA,EACJ;AACJ;AAGO,SAAS,IAAI,MAAkC;AAClD,SAAO,IAAI,UAAU,IAAI;AAC7B;AAFgB;","names":["git"]}

package/dist/chunk-FINIFKAY.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/indexers/memory/pattern-store.ts","../src/indexers/memory/consolidator.ts","../src/indexers/memory/distiller.ts","../src/indexers/memory/memory-plugin.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 '@/db/database.ts';\nimport type { EmbeddingProvider, LearningPattern } from '@/types.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.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: LearningPattern): 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<(LearningPattern & { 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): LearningPattern[] {\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 '@/db/database.ts';\nimport { cosineSimilarity } from '@/lib/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","/**\n * BrainBank — Strategy Distiller\n * \n * Aggregates top patterns for a task type into a single strategy text.\n * Analogous to SONA's Deep Loop — periodic knowledge distillation.\n */\n\nimport type { Database } from '@/db/database.ts';\nimport type { DistilledStrategy } from '@/types.ts';\n\nexport class StrategyDistiller {\n    constructor(private _db: Database) {}\n\n    /**\n     * Distill top patterns for a task type into a strategy.\n     * Updates the distilled_strategies table.\n     */\n    distill(taskType: string, topK: number = 10): DistilledStrategy | null {\n        const patterns = this._db.prepare(`\n            SELECT task, approach, outcome, critique, success_rate\n            FROM memory_patterns\n            WHERE task_type = ? AND success_rate >= 0.7\n            ORDER BY success_rate DESC, created_at DESC\n            LIMIT ?\n        `).all(taskType, topK) as any[];\n\n        if (patterns.length === 0) return null;\n\n        // Build strategy text from top patterns\n        const lines: string[] = [];\n        const avgSuccess = patterns.reduce((sum: number, p: any) => sum + p.success_rate, 0) / patterns.length;\n\n        lines.push(`Strategy for \"${taskType}\" (${patterns.length} patterns, avg success ${Math.round(avgSuccess * 100)}%):`);\n        lines.push('');\n\n        for (const p of patterns) {\n            lines.push(`• ${p.approach} (${Math.round(p.success_rate * 100)}%)`);\n            if (p.critique) lines.push(`  └ ${p.critique}`);\n        }\n\n        const strategy = lines.join('\\n');\n        const confidence = avgSuccess;\n        const now = Math.floor(Date.now() / 1000);\n\n        this._db.prepare(`\n            INSERT INTO distilled_strategies (task_type, strategy, confidence, updated_at)\n            VALUES (?, ?, ?, ?)\n            ON CONFLICT(task_type) DO UPDATE SET\n                strategy = excluded.strategy,\n                confidence = excluded.confidence,\n                updated_at = excluded.updated_at\n        `).run(taskType, strategy, confidence, now);\n\n        return { taskType, strategy, confidence, updatedAt: now };\n    }\n\n    /**\n     * Get a distilled strategy for a task type.\n     */\n    get(taskType: string): DistilledStrategy | null {\n        const row = this._db.prepare(\n            'SELECT * FROM distilled_strategies WHERE task_type = ?'\n        ).get(taskType) as any;\n\n        if (!row) return null;\n        return {\n            taskType: row.task_type,\n            strategy: row.strategy,\n            confidence: row.confidence,\n            updatedAt: row.updated_at,\n        };\n    }\n\n    /**\n     * List all distilled strategies.\n     */\n    list(): DistilledStrategy[] {\n        const rows = this._db.prepare(\n            'SELECT * FROM distilled_strategies ORDER BY confidence DESC'\n        ).all() as any[];\n\n        return rows.map(r => ({\n            taskType: r.task_type,\n            strategy: r.strategy,\n            confidence: r.confidence,\n            updatedAt: r.updated_at,\n        }));\n    }\n}\n","/**\n * BrainBank — Memory Plugin\n * \n * Agent learns from completed tasks — stores patterns,\n * consolidates failures, distills strategies.\n * \n *   import { memory } from 'brainbank/memory';\n *   brain.use(memory());\n */\n\nimport type { Indexer, IndexerContext } from '@/indexers/base.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\nimport type { Database } from '@/db/database.ts';\nimport { PatternStore } from './pattern-store.ts';\nimport { Consolidator } from './consolidator.ts';\nimport { StrategyDistiller } from './distiller.ts';\nimport type { LearningPattern, DistilledStrategy } from '@/types.ts';\n\nclass MemoryPlugin implements Indexer {\n    readonly name = 'memory';\n    hnsw!: HNSWIndex;\n    patternStore!: PatternStore;\n    consolidator!: Consolidator;\n    distiller!: StrategyDistiller;\n    vecCache = new Map<number, Float32Array>();\n    private _db!: Database;\n\n    async initialize(ctx: IndexerContext): Promise<void> {\n        this._db = ctx.db;\n        this.hnsw = await ctx.createHnsw(100_000);\n        ctx.loadVectors('memory_vectors', 'pattern_id', this.hnsw, this.vecCache);\n\n        this.patternStore = new PatternStore({\n            db: ctx.db,\n            hnsw: this.hnsw,\n            vectorCache: this.vecCache,\n            embedding: ctx.embedding,\n        });\n\n        this.consolidator = new Consolidator(ctx.db, this.vecCache);\n        this.distiller = new StrategyDistiller(ctx.db);\n    }\n\n    /** Store a learned pattern. */\n    async learn(pattern: LearningPattern): Promise<number> {\n        const id = await this.patternStore.learn(pattern);\n\n        // Auto-consolidate every 50 patterns (guard against count=0)\n        if (this.patternStore.count > 0 && this.patternStore.count % 50 === 0) {\n            this.consolidator.consolidate();\n        }\n\n        return id;\n    }\n\n    /** Search for similar patterns. */\n    async search(query: string, k: number = 4): Promise<(LearningPattern & { score: number })[]> {\n        return this.patternStore.search(query, k);\n    }\n\n    /** Consolidate: prune old failures + deduplicate. */\n    consolidate(): { pruned: number; deduped: number } {\n        return this.consolidator.consolidate();\n    }\n\n    /** Distill patterns into a strategy. */\n    distill(taskType: string): DistilledStrategy | null {\n        return this.distiller.distill(taskType);\n    }\n\n    stats(): Record<string, any> {\n        return {\n            patterns: this.patternStore.count,\n            avgSuccess: (this._db.prepare('SELECT AVG(success_rate) as a FROM memory_patterns').get() as any).a ?? 0,\n            hnswSize: this.hnsw.size,\n        };\n    }\n}\n\n/** Create an agent memory plugin. */\nexport function memory(): Indexer {\n    return new MemoryPlugin();\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,SAA2C;AACnD,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,KAAuD;AACnH,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,IAAuB;AACnE,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;;;AC/EO,IAAM,oBAAN,MAAwB;AAAA,EAC3B,YAAoB,KAAe;AAAf;AAAA,EAAgB;AAAA,EAXxC,OAU+B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAO3B,QAAQ,UAAkB,OAAe,IAA8B;AACnE,UAAM,WAAW,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAMjC,EAAE,IAAI,UAAU,IAAI;AAErB,QAAI,SAAS,WAAW,EAAG,QAAO;AAGlC,UAAM,QAAkB,CAAC;AACzB,UAAM,aAAa,SAAS,OAAO,CAAC,KAAa,MAAW,MAAM,EAAE,cAAc,CAAC,IAAI,SAAS;AAEhG,UAAM,KAAK,iBAAiB,QAAQ,MAAM,SAAS,MAAM,0BAA0B,KAAK,MAAM,aAAa,GAAG,CAAC,KAAK;AACpH,UAAM,KAAK,EAAE;AAEb,eAAW,KAAK,UAAU;AACtB,YAAM,KAAK,UAAK,EAAE,QAAQ,KAAK,KAAK,MAAM,EAAE,eAAe,GAAG,CAAC,IAAI;AACnE,UAAI,EAAE,SAAU,OAAM,KAAK,YAAO,EAAE,QAAQ,EAAE;AAAA,IAClD;AAEA,UAAM,WAAW,MAAM,KAAK,IAAI;AAChC,UAAM,aAAa;AACnB,UAAM,MAAM,KAAK,MAAM,KAAK,IAAI,IAAI,GAAI;AAExC,SAAK,IAAI,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAOhB,EAAE,IAAI,UAAU,UAAU,YAAY,GAAG;AAE1C,WAAO,EAAE,UAAU,UAAU,YAAY,WAAW,IAAI;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,UAA4C;AAC5C,UAAM,MAAM,KAAK,IAAI;AAAA,MACjB;AAAA,IACJ,EAAE,IAAI,QAAQ;AAEd,QAAI,CAAC,IAAK,QAAO;AACjB,WAAO;AAAA,MACH,UAAU,IAAI;AAAA,MACd,UAAU,IAAI;AAAA,MACd,YAAY,IAAI;AAAA,MAChB,WAAW,IAAI;AAAA,IACnB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKA,OAA4B;AACxB,UAAM,OAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACJ,EAAE,IAAI;AAEN,WAAO,KAAK,IAAI,QAAM;AAAA,MAClB,UAAU,EAAE;AAAA,MACZ,UAAU,EAAE;AAAA,MACZ,YAAY,EAAE;AAAA,MACd,WAAW,EAAE;AAAA,IACjB,EAAE;AAAA,EACN;AACJ;;;ACtEA,IAAM,eAAN,MAAsC;AAAA,EAlBtC,OAkBsC;AAAA;AAAA;AAAA,EACzB,OAAO;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,WAAW,oBAAI,IAA0B;AAAA,EACjC;AAAA,EAER,MAAM,WAAW,KAAoC;AACjD,SAAK,MAAM,IAAI;AACf,SAAK,OAAO,MAAM,IAAI,WAAW,GAAO;AACxC,QAAI,YAAY,kBAAkB,cAAc,KAAK,MAAM,KAAK,QAAQ;AAExE,SAAK,eAAe,IAAI,aAAa;AAAA,MACjC,IAAI,IAAI;AAAA,MACR,MAAM,KAAK;AAAA,MACX,aAAa,KAAK;AAAA,MAClB,WAAW,IAAI;AAAA,IACnB,CAAC;AAED,SAAK,eAAe,IAAI,aAAa,IAAI,IAAI,KAAK,QAAQ;AAC1D,SAAK,YAAY,IAAI,kBAAkB,IAAI,EAAE;AAAA,EACjD;AAAA;AAAA,EAGA,MAAM,MAAM,SAA2C;AACnD,UAAM,KAAK,MAAM,KAAK,aAAa,MAAM,OAAO;AAGhD,QAAI,KAAK,aAAa,QAAQ,KAAK,KAAK,aAAa,QAAQ,OAAO,GAAG;AACnE,WAAK,aAAa,YAAY;AAAA,IAClC;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,OAAO,OAAe,IAAY,GAAqD;AACzF,WAAO,KAAK,aAAa,OAAO,OAAO,CAAC;AAAA,EAC5C;AAAA;AAAA,EAGA,cAAmD;AAC/C,WAAO,KAAK,aAAa,YAAY;AAAA,EACzC;AAAA;AAAA,EAGA,QAAQ,UAA4C;AAChD,WAAO,KAAK,UAAU,QAAQ,QAAQ;AAAA,EAC1C;AAAA,EAEA,QAA6B;AACzB,WAAO;AAAA,MACH,UAAU,KAAK,aAAa;AAAA,MAC5B,YAAa,KAAK,IAAI,QAAQ,oDAAoD,EAAE,IAAI,EAAU,KAAK;AAAA,MACvG,UAAU,KAAK,KAAK;AAAA,IACxB;AAAA,EACJ;AACJ;AAGO,SAAS,SAAkB;AAC9B,SAAO,IAAI,aAAa;AAC5B;AAFgB;","names":[]}

package/dist/chunk-MGIFEPYZ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/indexers/code/code-indexer.ts","../src/indexers/code/code-chunker.ts","../src/indexers/code/grammars.ts","../src/indexers/languages.ts","../src/indexers/code/code-plugin.ts"],"sourcesContent":["/**\n * BrainBank — Code Indexer\n * \n * Walks a repository, chunks source files semantically,\n * embeds each chunk, and stores in SQLite + HNSW.\n * Incremental: only re-indexes files that changed (by content hash).\n */\n\nimport fs from 'node:fs';\nimport path from 'node:path';\nimport { CodeChunker } from './code-chunker.ts';\nimport { SUPPORTED_EXTENSIONS, IGNORE_DIRS, isIgnoredDir, isIgnoredFile } from '@/indexers/languages.ts';\nimport type { Database } from '@/db/database.ts';\nimport type { EmbeddingProvider, ProgressCallback, IndexResult } from '@/types.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\n\nexport interface CodeIndexerDeps {\n    db: Database;\n    hnsw: HNSWIndex;\n    vectorCache: Map<number, Float32Array>;\n    embedding: EmbeddingProvider;\n}\n\nexport interface CodeIndexOptions {\n    forceReindex?: boolean;\n    onProgress?: ProgressCallback;\n}\n\nexport class CodeIndexer {\n    private _chunker = new CodeChunker();\n    private _deps: CodeIndexerDeps;\n    private _repoPath: string;\n    private _maxFileSize: number;\n\n    constructor(repoPath: string, deps: CodeIndexerDeps, maxFileSize: number = 512_000) {\n        this._deps = deps;\n        this._repoPath = repoPath;\n        this._maxFileSize = maxFileSize;\n    }\n\n    /** Index all supported files. Skips unchanged files (same content hash). */\n    async index(options: CodeIndexOptions = {}): Promise<IndexResult> {\n        const { forceReindex = false, onProgress } = options;\n        const files = this._walkRepo(this._repoPath);\n        let indexed = 0, skipped = 0, totalChunks = 0;\n\n        for (let i = 0; i < files.length; i++) {\n            const filePath = files[i];\n            const rel = path.relative(this._repoPath, filePath);\n            onProgress?.(rel, i + 1, files.length);\n\n            let content: string;\n            try { content = fs.readFileSync(filePath, 'utf-8'); }\n            catch { continue; }\n\n            const hash = this._hash(content);\n            const existing = this._deps.db.prepare(\n                'SELECT file_hash FROM indexed_files WHERE file_path = ?'\n            ).get(rel) as any;\n\n            if (!forceReindex && existing?.file_hash === hash) {\n                skipped++;\n                continue;\n            }\n\n            this._removeOldChunks(rel);\n            const chunkCount = await this._indexFile(filePath, rel, content, hash);\n            indexed++;\n            totalChunks += chunkCount;\n        }\n\n        return { indexed, skipped, chunks: totalChunks };\n    }\n\n    /** Remove old chunks and their HNSW vectors for a file. */\n    private _removeOldChunks(relPath: string): void {\n        const oldChunks = this._deps.db.prepare(\n            'SELECT id FROM code_chunks WHERE file_path = ?'\n        ).all(relPath) as any[];\n\n        if (oldChunks.length > 0) {\n            for (const { id } of oldChunks) {\n                this._deps.hnsw.remove(id);\n                this._deps.vectorCache.delete(id);\n            }\n            this._deps.db.prepare('DELETE FROM code_chunks WHERE file_path = ?').run(relPath);\n        }\n    }\n\n    /** Chunk, embed, and store a single file. Returns chunk count. */\n    private async _indexFile(\n        filePath: string, rel: string, content: string, hash: string,\n    ): Promise<number> {\n        const ext = path.extname(filePath).toLowerCase();\n        const language = SUPPORTED_EXTENSIONS[ext] ?? 'text';\n        const chunks = await this._chunker.chunk(rel, content, language);\n\n        const embeddingTexts = chunks.map(chunk => [\n            `File: ${rel}`,\n            chunk.name ? `${chunk.chunkType}: ${chunk.name}` : chunk.chunkType,\n            chunk.content,\n        ].join('\\n'));\n\n        const vecs = await this._deps.embedding.embedBatch(embeddingTexts);\n\n        for (let ci = 0; ci < chunks.length; ci++) {\n            const chunk = chunks[ci];\n            const result = this._deps.db.prepare(\n                `INSERT INTO code_chunks (file_path, chunk_type, name, start_line, end_line, content, language, file_hash)\n                 VALUES (?, ?, ?, ?, ?, ?, ?, ?)`\n            ).run(rel, chunk.chunkType, chunk.name ?? null, chunk.startLine, chunk.endLine, chunk.content, language, hash);\n\n            const id = Number(result.lastInsertRowid);\n            this._deps.db.prepare(\n                'INSERT INTO code_vectors (chunk_id, embedding) VALUES (?, ?)'\n            ).run(id, Buffer.from(vecs[ci].buffer));\n\n            this._deps.hnsw.add(vecs[ci], id);\n            this._deps.vectorCache.set(id, vecs[ci]);\n        }\n\n        this._deps.db.prepare(\n            'INSERT OR REPLACE INTO indexed_files (file_path, file_hash) VALUES (?, ?)'\n        ).run(rel, hash);\n\n        return chunks.length;\n    }\n\n    // ── File Walker ─────────────────────────────────\n\n    private _walkRepo(dir: string, files: string[] = []): string[] {\n        let entries: fs.Dirent[];\n        try { entries = fs.readdirSync(dir, { withFileTypes: true }); }\n        catch { return files; }\n\n        for (const entry of entries) {\n            if (entry.isDirectory()) {\n                if (isIgnoredDir(entry.name)) continue;\n                this._walkRepo(path.join(dir, entry.name), files);\n            } else if (entry.isFile()) {\n                if (isIgnoredFile(entry.name)) continue;\n                const ext = path.extname(entry.name).toLowerCase();\n                if (!(ext in SUPPORTED_EXTENSIONS)) continue;\n\n                const full = path.join(dir, entry.name);\n                try {\n                    if (fs.statSync(full).size <= this._maxFileSize) {\n                        files.push(full);\n                    }\n                } catch {}\n            }\n        }\n        return files;\n    }\n\n    // ── FNV-1a Hash ─────────────────────────────────\n\n    private _hash(content: string): string {\n        let h = 2166136261;\n        for (let i = 0; i < content.length; i++) {\n            h ^= content.charCodeAt(i);\n            h = (h * 16777619) >>> 0;\n        }\n        return h.toString(16);\n    }\n}\n","/**\n * BrainBank — Tree-Sitter Code Chunker\n * \n * AST-aware code splitting using native tree-sitter bindings.\n * Extracts semantic blocks (functions, classes, methods, interfaces)\n * from the AST. Falls back to sliding window for unsupported languages.\n */\n\nimport { createRequire } from 'node:module';\nimport type { CodeChunk } from '@/types.ts';\nimport { GRAMMARS, type LangGrammar } from './grammars.ts';\n\nconst require = createRequire(import.meta.url);\n\n// ── Configuration ───────────────────────────────────\n\nexport interface ChunkerConfig {\n    /** Max lines per chunk. Default: 80 */\n    maxLines?: number;\n    /** Min lines for a detected block to be a chunk. Default: 3 */\n    minLines?: number;\n    /** Overlap between adjacent generic chunks. Default: 5 */\n    overlap?: number;\n}\n\n// ── CodeChunker ─────────────────────────────────────\n\nexport class CodeChunker {\n    private MAX: number;\n    private MIN: number;\n    private OVERLAP: number;\n    private _parser: any = null;\n    private _langCache = new Map<string, LangGrammar | null>();\n\n    constructor(config: ChunkerConfig = {}) {\n        this.MAX = config.maxLines ?? 80;\n        this.MIN = config.minLines ?? 3;\n        this.OVERLAP = config.overlap ?? 5;\n    }\n\n    /** Lazy-init tree-sitter parser. */\n    private _ensureParser(): any {\n        if (!this._parser) {\n            try {\n                const Parser = require('tree-sitter');\n                this._parser = new Parser();\n            } catch {\n                this._parser = false;  // Mark as unavailable\n            }\n        }\n        return this._parser || null;\n    }\n\n    /** Load a language grammar (cached). */\n    private _loadGrammar(language: string): LangGrammar | null {\n        if (this._langCache.has(language)) return this._langCache.get(language)!;\n\n        const factory = GRAMMARS[language];\n        const grammar = factory ? factory() : null;\n        this._langCache.set(language, grammar);\n        return grammar;\n    }\n\n    /**\n     * Split file content into semantic chunks using tree-sitter AST.\n     * Falls back to sliding window if grammar isn't available.\n     */\n    async chunk(filePath: string, content: string, language: string): Promise<CodeChunk[]> {\n        const lines = content.split('\\n');\n\n        // Small file → single chunk\n        if (lines.length <= this.MAX) {\n            return [{\n                filePath,\n                chunkType: 'file',\n                startLine: 1,\n                endLine: lines.length,\n                content: content.trim(),\n                language,\n            }];\n        }\n\n        // Try tree-sitter AST chunking\n        const parser = this._ensureParser();\n        const langConfig = this._loadGrammar(language);\n\n        if (parser && langConfig) {\n            try {\n                parser.setLanguage(langConfig.grammar);\n                const tree = parser.parse(content);\n                const chunks = this._extractChunks(filePath, lines, tree.rootNode, langConfig, language);\n\n                if (chunks.length > 0) {\n                    return chunks.filter(c => c.content.length > 20);\n                }\n            } catch {\n                // Tree-sitter failed — fall through to generic\n            }\n        }\n\n        // Fallback to sliding window\n        return this._chunkGeneric(filePath, lines, language);\n    }\n\n    /** Walk AST and extract top-level semantic blocks. */\n    private _extractChunks(\n        filePath: string, lines: string[],\n        rootNode: any, langConfig: LangGrammar, language: string,\n    ): CodeChunk[] {\n        const chunks: CodeChunk[] = [];\n        const seen = new Set<string>();\n\n        for (let i = 0; i < rootNode.childCount; i++) {\n            const child = rootNode.child(i);\n            this._processNode(filePath, lines, child, langConfig, language, chunks, seen);\n        }\n\n        return chunks;\n    }\n\n    /** Classify and process a single AST node. */\n    private _processNode(\n        filePath: string, lines: string[], node: any,\n        langConfig: LangGrammar, language: string,\n        chunks: CodeChunk[], seen: Set<string>,\n    ): void {\n        const type = node.type;\n\n        // Handle export_statement: process what it wraps\n        if (type === 'export_statement') {\n            for (let i = 0; i < node.childCount; i++) {\n                const child = node.child(i);\n                const category = this._categorize(child.type, langConfig);\n                if (category) {\n                    this._processDeclaration(filePath, lines, node, child, category, langConfig, language, chunks, seen);\n                    return;\n                }\n            }\n            // Export with no recognized declaration — chunk the whole thing if big enough\n            const nodeLines = node.endPosition.row - node.startPosition.row + 1;\n            if (nodeLines >= this.MIN) {\n                this._addChunk(filePath, lines, node, 'function', this._extractName(node), language, chunks, seen);\n            }\n            return;\n        }\n\n        // Python decorated definitions (@decorator + class/def)\n        if (type === 'decorated_definition') {\n            for (let i = 0; i < node.childCount; i++) {\n                const child = node.child(i);\n                const category = this._categorize(child.type, langConfig);\n                if (category) {\n                    this._processDeclaration(filePath, lines, node, child, category, langConfig, language, chunks, seen);\n                    return;\n                }\n            }\n        }\n\n        // Direct match\n        const category = this._categorize(type, langConfig);\n        if (category) {\n            this._processDeclaration(filePath, lines, node, node, category, langConfig, language, chunks, seen);\n        }\n    }\n\n    /** Check which category a node type belongs to. */\n    private _categorize(nodeType: string, langConfig: LangGrammar): string | null {\n        for (const [category, types] of Object.entries(langConfig.nodeTypes)) {\n            if (types && types.includes(nodeType)) return category;\n        }\n        return null;\n    }\n\n    /** Process a matched declaration: class → split by methods, else → chunk directly. */\n    private _processDeclaration(\n        filePath: string, lines: string[],\n        outerNode: any, innerNode: any, category: string,\n        langConfig: LangGrammar, language: string,\n        chunks: CodeChunk[], seen: Set<string>,\n    ): void {\n        const nodeLines = outerNode.endPosition.row - outerNode.startPosition.row + 1;\n        const name = this._extractName(innerNode);\n        const chunkType = this._toChunkType(category);\n\n        // Large class → split into methods\n        if ((category === 'class' || category === 'struct' || category === 'impl') && nodeLines > this.MAX) {\n            this._splitClassIntoMethods(filePath, lines, outerNode, innerNode, name, langConfig, language, chunks, seen);\n            return;\n        }\n\n        // Large non-class → split with overlap\n        if (nodeLines > this.MAX) {\n            chunks.push(...this._splitLargeBlock(filePath, lines,\n                outerNode.startPosition.row, outerNode.endPosition.row,\n                name, chunkType, language));\n            return;\n        }\n\n        // Normal-sized node\n        if (nodeLines >= this.MIN) {\n            this._addChunk(filePath, lines, outerNode, chunkType, name, language, chunks, seen);\n        }\n    }\n\n    /** Split a large class into individual method chunks. */\n    private _splitClassIntoMethods(\n        filePath: string, lines: string[],\n        outerNode: any, classNode: any, className: string,\n        langConfig: LangGrammar, language: string,\n        chunks: CodeChunk[], seen: Set<string>,\n    ): void {\n        // Find class body\n        const body = this._findClassBody(classNode);\n        if (!body) {\n            chunks.push(...this._splitLargeBlock(filePath, lines,\n                outerNode.startPosition.row, outerNode.endPosition.row,\n                className, 'class', language));\n            return;\n        }\n\n        // Get method node types\n        const methodTypes = new Set([\n            ...(langConfig.nodeTypes.function || []),\n            ...(langConfig.nodeTypes.method || []),\n        ]);\n\n        let methodsFound = false;\n        for (let i = 0; i < body.childCount; i++) {\n            const child = body.child(i);\n            let methodNode = child;\n\n            // Decorated methods\n            if (child.type === 'decorated_definition') {\n                for (let j = 0; j < child.childCount; j++) {\n                    if (methodTypes.has(child.child(j).type)) {\n                        methodNode = child.child(j);\n                        break;\n                    }\n                }\n            }\n\n            if (methodTypes.has(methodNode.type) || methodTypes.has(child.type)) {\n                const methodName = this._extractName(methodNode);\n                const nodeToChunk = child.type === 'decorated_definition' ? child : methodNode;\n                const methodLineCount = nodeToChunk.endPosition.row - nodeToChunk.startPosition.row + 1;\n\n                if (methodLineCount >= this.MIN) {\n                    methodsFound = true;\n                    const fullName = `${className}.${methodName}`;\n\n                    if (methodLineCount > this.MAX) {\n                        chunks.push(...this._splitLargeBlock(filePath, lines,\n                            nodeToChunk.startPosition.row, nodeToChunk.endPosition.row,\n                            fullName, 'method', language));\n                    } else {\n                        this._addChunk(filePath, lines, nodeToChunk, 'method', fullName, language, chunks, seen);\n                    }\n                }\n            }\n        }\n\n        // Fallback: no methods found → split the whole class\n        if (!methodsFound) {\n            chunks.push(...this._splitLargeBlock(filePath, lines,\n                outerNode.startPosition.row, outerNode.endPosition.row,\n                className, 'class', language));\n        }\n    }\n\n    /** Find the class body node. */\n    private _findClassBody(classNode: any): any | null {\n        const bodyTypes = ['class_body', 'block', 'declaration_list', 'body'];\n        for (let i = 0; i < classNode.childCount; i++) {\n            const child = classNode.child(i);\n            if (bodyTypes.includes(child.type)) return child;\n        }\n        return null;\n    }\n\n    /** Extract name from an AST node. */\n    private _extractName(node: any): string {\n        // Try childForFieldName('name')\n        if (typeof node.childForFieldName === 'function') {\n            const nameNode = node.childForFieldName('name');\n            if (nameNode) return nameNode.text;\n        }\n        // Try identifier children\n        for (let i = 0; i < node.namedChildCount; i++) {\n            const child = node.namedChild(i);\n            if (['identifier', 'type_identifier', 'property_identifier'].includes(child.type)) {\n                return child.text;\n            }\n        }\n        // For variable declarations, dig into declarators\n        if (node.type === 'lexical_declaration' || node.type === 'variable_declaration') {\n            for (let i = 0; i < node.namedChildCount; i++) {\n                const child = node.namedChild(i);\n                if (child.type === 'variable_declarator') {\n                    const nameNode = child.childForFieldName('name');\n                    if (nameNode) return nameNode.text;\n                }\n            }\n        }\n        return 'anonymous';\n    }\n\n    /** Map category to chunk type. */\n    private _toChunkType(category: string): string {\n        if (category === 'class' || category === 'struct' || category === 'impl') return 'class';\n        if (category === 'interface') return 'interface';\n        if (category === 'variable') return 'function';\n        return category;\n    }\n\n    /** Add a node as a chunk, avoiding duplicates. */\n    private _addChunk(\n        filePath: string, lines: string[], node: any,\n        chunkType: string, name: string, language: string,\n        chunks: CodeChunk[], seen: Set<string>,\n    ): void {\n        const start = node.startPosition.row;\n        const end = node.endPosition.row;\n        const key = `${start}-${end}`;\n        if (seen.has(key)) return;\n        seen.add(key);\n\n        const content = lines.slice(start, end + 1).join('\\n').trim();\n        if (content.length <= 20) return;\n\n        chunks.push({\n            filePath,\n            chunkType,\n            name,\n            startLine: start + 1,\n            endLine: end + 1,\n            content,\n            language,\n        });\n    }\n\n    // ── Fallback: Generic sliding window ────────────\n\n    private _chunkGeneric(filePath: string, lines: string[], language: string): CodeChunk[] {\n        const chunks: CodeChunk[] = [];\n        const step = Math.max(this.MAX - this.OVERLAP, 1);\n\n        for (let s = 0; s < lines.length; s += step) {\n            const e = Math.min(s + this.MAX, lines.length);\n            const content = lines.slice(s, e).join('\\n').trim();\n            if (content.length > 20) {\n                chunks.push({\n                    filePath,\n                    chunkType: 'block',\n                    startLine: s + 1,\n                    endLine: e,\n                    content,\n                    language,\n                });\n            }\n            if (e >= lines.length) break;\n        }\n\n        return chunks;\n    }\n\n    /** Split a large block into overlapping sub-chunks. */\n    private _splitLargeBlock(\n        filePath: string, lines: string[],\n        start: number, end: number,\n        name: string, type: string, language: string,\n    ): CodeChunk[] {\n        const chunks: CodeChunk[] = [];\n        const step = Math.max(this.MAX - this.OVERLAP, 1);\n        let part = 1;\n\n        for (let s = start; s <= end; s += step) {\n            const e = Math.min(s + this.MAX, end + 1);\n            const content = lines.slice(s, e).join('\\n').trim();\n            if (content.length > 20) {\n                chunks.push({\n                    filePath,\n                    chunkType: type,\n                    name: `${name} (part ${part++})`,\n                    startLine: s + 1,\n                    endLine: e,\n                    content,\n                    language,\n                });\n            }\n            if (e > end) break;\n        }\n\n        return chunks;\n    }\n}\n","/**\n * BrainBank — Tree-Sitter Grammar Registry\n *\n * Maps language names to their tree-sitter grammar packages\n * and the AST node types that represent semantic blocks.\n */\n\nimport { createRequire } from 'node:module';\n\nconst require = createRequire(import.meta.url);\n\n// ── Types ───────────────────────────────────────────\n\nexport interface LangGrammar {\n    grammar: any;\n    nodeTypes: {\n        class?: string[];\n        function?: string[];\n        interface?: string[];\n        variable?: string[];\n        method?: string[];\n        struct?: string[];\n        impl?: string[];\n    };\n}\n\n// ── Loader ──────────────────────────────────────────\n\n/** Try to require a grammar, return null if not installed. */\nfunction tryGrammar(pkg: string, nodeTypes: LangGrammar['nodeTypes'], accessor?: string): () => LangGrammar | null {\n    return () => {\n        try {\n            const mod = require(pkg);\n            return { grammar: accessor ? mod[accessor] : mod, nodeTypes };\n        } catch { return null; }\n    };\n}\n\n// ── Grammar Table ───────────────────────────────────\n\nexport const GRAMMARS: Record<string, () => LangGrammar | null> = {\n    // ── Web ──────────────────────────────────────────\n    typescript: tryGrammar('tree-sitter-typescript', {\n        class: ['class_declaration'],\n        interface: ['interface_declaration', 'type_alias_declaration'],\n        function: ['function_declaration', 'method_definition'],\n        variable: ['lexical_declaration'],\n    }, 'typescript'),\n    javascript: tryGrammar('tree-sitter-javascript', {\n        class: ['class_declaration'],\n        function: ['function_declaration', 'method_definition'],\n        variable: ['lexical_declaration'],\n    }),\n    html: tryGrammar('tree-sitter-html', {}),\n    css: tryGrammar('tree-sitter-css', {}),\n\n    // ── Systems ──────────────────────────────────────\n    go: tryGrammar('tree-sitter-go', {\n        function: ['function_declaration', 'method_declaration'],\n        struct: ['type_declaration'],\n    }),\n    rust: tryGrammar('tree-sitter-rust', {\n        function: ['function_item'],\n        struct: ['struct_item'],\n        impl: ['impl_item'],\n    }),\n    c: tryGrammar('tree-sitter-c', {\n        function: ['function_definition'],\n        struct: ['struct_specifier'],\n    }),\n    cpp: tryGrammar('tree-sitter-cpp', {\n        class: ['class_specifier'],\n        function: ['function_definition'],\n    }),\n    swift: tryGrammar('tree-sitter-swift', {\n        class: ['class_declaration'],\n        function: ['function_declaration'],\n        struct: ['struct_declaration'],\n    }),\n\n    // ── JVM ──────────────────────────────────────────\n    java: tryGrammar('tree-sitter-java', {\n        class: ['class_declaration'],\n        interface: ['interface_declaration'],\n        method: ['method_declaration'],\n    }),\n    kotlin: tryGrammar('tree-sitter-kotlin', {\n        class: ['class_declaration'],\n        function: ['function_declaration'],\n    }),\n    scala: tryGrammar('tree-sitter-scala', {\n        class: ['class_definition'],\n        function: ['function_definition'],\n    }),\n\n    // ── Scripting ────────────────────────────────────\n    python: tryGrammar('tree-sitter-python', {\n        class: ['class_definition'],\n        function: ['function_definition'],\n    }),\n    ruby: tryGrammar('tree-sitter-ruby', {\n        class: ['class'],\n        method: ['method', 'singleton_method'],\n    }),\n    php: tryGrammar('tree-sitter-php', {\n        class: ['class_declaration'],\n        function: ['function_definition', 'method_declaration'],\n    }, 'php'),\n    lua: tryGrammar('tree-sitter-lua', {\n        function: ['function_declaration'],\n    }),\n    bash: tryGrammar('tree-sitter-bash', {\n        function: ['function_definition'],\n    }),\n    elixir: tryGrammar('tree-sitter-elixir', {\n        function: ['call'],  // defmodule, def, defp\n    }),\n\n    // ── .NET ─────────────────────────────────────────\n    c_sharp: tryGrammar('tree-sitter-c-sharp', {\n        class: ['class_declaration'],\n        interface: ['interface_declaration'],\n        method: ['method_declaration'],\n    }),\n};\n","/**\n * BrainBank — Language Registry\n * \n * Supported file extensions, language mappings, and ignore lists.\n * Controls which files get indexed and how they're chunked.\n */\n\n// ── Supported Extensions ────────────────────────────\n\nexport const SUPPORTED_EXTENSIONS: Record<string, string> = {\n    // TypeScript / JavaScript\n    '.ts': 'typescript',\n    '.tsx': 'typescript',\n    '.js': 'javascript',\n    '.jsx': 'javascript',\n    '.mjs': 'javascript',\n    '.cjs': 'javascript',\n\n    // Systems\n    '.go': 'go',\n    '.rs': 'rust',\n    '.cpp': 'cpp',\n    '.cc': 'cpp',\n    '.c': 'c',\n    '.h': 'c',\n    '.hpp': 'cpp',\n\n    // JVM\n    '.java': 'java',\n    '.kt': 'kotlin',\n    '.scala': 'scala',\n\n    // Scripting\n    '.py': 'python',\n    '.rb': 'ruby',\n    '.php': 'php',\n    '.lua': 'lua',\n    '.sh': 'bash',\n    '.bash': 'bash',\n    '.zsh': 'bash',\n\n    // Web\n    '.html': 'html',\n    '.css': 'css',\n    '.scss': 'scss',\n    '.less': 'less',\n    '.svelte': 'svelte',\n    '.vue': 'vue',\n\n    // Data / Config\n    '.json': 'json',\n    '.yaml': 'yaml',\n    '.yml': 'yaml',\n    '.toml': 'toml',\n    '.xml': 'xml',\n    '.graphql': 'graphql',\n    '.gql': 'graphql',\n\n    // Docs\n    '.md': 'markdown',\n    '.mdx': 'markdown',\n\n    // Database\n    '.sql': 'sql',\n    '.prisma': 'prisma',\n\n    // Other\n    '.swift': 'swift',\n    '.dart': 'dart',\n    '.r': 'r',\n    '.ex': 'elixir',\n    '.exs': 'elixir',\n    '.erl': 'erlang',\n    '.zig': 'zig',\n};\n\n// ── Ignore Directories ──────────────────────────────\n\nexport const IGNORE_DIRS = new Set([\n    // Package managers\n    'node_modules',\n    'bower_components',\n    '.pnpm',\n\n    // Build output\n    'dist',\n    'build',\n    'out',\n    '.next',\n    '.nuxt',\n    '.output',\n    '.svelte-kit',\n\n    // Auto-generated code\n    'generated',\n    'sdk',\n    'openapi',\n\n    // Version control\n    '.git',\n    '.hg',\n    '.svn',\n\n    // IDE / Editor\n    '.idea',\n    '.vscode',\n\n    // Runtime / Cache\n    '__pycache__',\n    '.pytest_cache',\n    'venv',\n    '.venv',\n    '.env',\n    '.tox',\n\n    // Coverage / Test artifacts\n    'coverage',\n    '.nyc_output',\n    'htmlcov',\n\n    // Compiled\n    'target',     // Rust, Java\n    '.cargo',\n    'vendor',     // Go, PHP\n\n    // Database (auto-generated migrations, dumps, seeds)\n    'migrations',\n    'db_dumps',\n    'seeds',\n\n    // AI / Model cache\n    '.model-cache',\n    '.brainbank',\n\n    // OS\n    '.DS_Store',\n]);\n\n// ── Ignore Files ────────────────────────────────────\n\nexport const IGNORE_FILES = new Set([\n    'package-lock.json',\n    'yarn.lock',\n    'pnpm-lock.yaml',\n    'bun.lockb',\n    'Cargo.lock',\n    'Gemfile.lock',\n    'poetry.lock',\n    'composer.lock',\n    'go.sum',\n]);\n\n// ── Helpers ─────────────────────────────────────────\n\nimport path from 'node:path';\n\n/** Check if a file extension is supported for indexing. */\nexport function isSupported(filePath: string): boolean {\n    const ext = path.extname(filePath).toLowerCase();\n    return ext in SUPPORTED_EXTENSIONS;\n}\n\n/** Get the language name for a file. Returns undefined if not supported. */\nexport function getLanguage(filePath: string): string | undefined {\n    const ext = path.extname(filePath).toLowerCase();\n    return SUPPORTED_EXTENSIONS[ext];\n}\n\n/** Check if a directory name should be ignored. */\nexport function isIgnoredDir(dirName: string): boolean {\n    return IGNORE_DIRS.has(dirName);\n}\n\n/** Check if a filename should be ignored. */\nexport function isIgnoredFile(fileName: string): boolean {\n    return IGNORE_FILES.has(fileName);\n}\n","/**\n * BrainBank — Code Module\n * \n * Language-aware code indexing for 30+ languages.\n * \n *   import { BrainBank } from 'brainbank';\n *   import { code } from 'brainbank/code';\n *   \n *   const brain = new BrainBank().use(code({ repoPath: '.' }));\n *   \n *   // Multi-repo: namespace to avoid key collisions\n *   brain\n *     .use(code({ repoPath: './frontend', name: 'code:frontend' }))\n *     .use(code({ repoPath: './backend',  name: 'code:backend' }));\n */\n\nimport type { Indexer, IndexerContext } from '@/indexers/base.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\nimport type { Database } from '@/db/database.ts';\nimport { CodeIndexer } from './code-indexer.ts';\nimport type { IndexResult, ProgressCallback } from '@/types.ts';\n\nexport interface CodePluginOptions {\n    /** Repository path to index. Default: '.' */\n    repoPath?: string;\n    /** Maximum file size in bytes. Default: from config */\n    maxFileSize?: number;\n    /** Custom indexer name for multi-repo (e.g. 'code:frontend'). Default: 'code' */\n    name?: string;\n}\n\nclass CodePlugin implements Indexer {\n    readonly name: string;\n    private db!: Database;\n    hnsw!: HNSWIndex;\n    indexer!: CodeIndexer;\n    vecCache = new Map<number, Float32Array>();\n\n    constructor(private opts: CodePluginOptions = {}) {\n        this.name = opts.name ?? 'code';\n    }\n\n    async initialize(ctx: IndexerContext): Promise<void> {\n        this.db = ctx.db;\n        // Use shared HNSW so all code indexers (code, code:frontend, etc.) share one index\n        const shared = await ctx.getOrCreateSharedHnsw('code');\n        this.hnsw = shared.hnsw;\n        this.vecCache = shared.vecCache;\n\n        // Only load vectors once (first code indexer to initialize)\n        if (shared.isNew) {\n            ctx.loadVectors('code_vectors', 'chunk_id', this.hnsw, this.vecCache);\n        }\n\n        const repoPath = this.opts.repoPath ?? ctx.config.repoPath;\n        this.indexer = new CodeIndexer(repoPath, {\n            db: ctx.db,\n            hnsw: this.hnsw,\n            vectorCache: this.vecCache,\n            embedding: ctx.embedding,\n        }, this.opts.maxFileSize ?? ctx.config.maxFileSize);\n    }\n\n    async index(options: {\n        forceReindex?: boolean;\n        onProgress?: ProgressCallback;\n    } = {}): Promise<IndexResult> {\n        return this.indexer.index(options);\n    }\n\n    stats(): Record<string, number> {\n        return {\n            files:    (this.db.prepare('SELECT COUNT(DISTINCT file_path) as c FROM code_chunks').get() as { c: number }).c,\n            chunks:   (this.db.prepare('SELECT COUNT(*) as c FROM code_chunks').get() as { c: number }).c,\n            hnswSize: this.hnsw.size,\n        };\n    }\n}\n\n/** Create a code indexing plugin. */\nexport function code(opts?: CodePluginOptions): Indexer {\n    return new CodePlugin(opts);\n}\n"],"mappings":";;;;;AAQA,OAAO,QAAQ;AACf,OAAOA,WAAU;;;ACDjB,SAAS,iBAAAC,sBAAqB;;;ACD9B,SAAS,qBAAqB;AAE9B,IAAMC,WAAU,cAAc,YAAY,GAAG;AAoB7C,SAAS,WAAW,KAAa,WAAqC,UAA6C;AAC/G,SAAO,MAAM;AACT,QAAI;AACA,YAAM,MAAMA,SAAQ,GAAG;AACvB,aAAO,EAAE,SAAS,WAAW,IAAI,QAAQ,IAAI,KAAK,UAAU;AAAA,IAChE,QAAQ;AAAE,aAAO;AAAA,IAAM;AAAA,EAC3B;AACJ;AAPS;AAWF,IAAM,WAAqD;AAAA;AAAA,EAE9D,YAAY,WAAW,0BAA0B;AAAA,IAC7C,OAAO,CAAC,mBAAmB;AAAA,IAC3B,WAAW,CAAC,yBAAyB,wBAAwB;AAAA,IAC7D,UAAU,CAAC,wBAAwB,mBAAmB;AAAA,IACtD,UAAU,CAAC,qBAAqB;AAAA,EACpC,GAAG,YAAY;AAAA,EACf,YAAY,WAAW,0BAA0B;AAAA,IAC7C,OAAO,CAAC,mBAAmB;AAAA,IAC3B,UAAU,CAAC,wBAAwB,mBAAmB;AAAA,IACtD,UAAU,CAAC,qBAAqB;AAAA,EACpC,CAAC;AAAA,EACD,MAAM,WAAW,oBAAoB,CAAC,CAAC;AAAA,EACvC,KAAK,WAAW,mBAAmB,CAAC,CAAC;AAAA;AAAA,EAGrC,IAAI,WAAW,kBAAkB;AAAA,IAC7B,UAAU,CAAC,wBAAwB,oBAAoB;AAAA,IACvD,QAAQ,CAAC,kBAAkB;AAAA,EAC/B,CAAC;AAAA,EACD,MAAM,WAAW,oBAAoB;AAAA,IACjC,UAAU,CAAC,eAAe;AAAA,IAC1B,QAAQ,CAAC,aAAa;AAAA,IACtB,MAAM,CAAC,WAAW;AAAA,EACtB,CAAC;AAAA,EACD,GAAG,WAAW,iBAAiB;AAAA,IAC3B,UAAU,CAAC,qBAAqB;AAAA,IAChC,QAAQ,CAAC,kBAAkB;AAAA,EAC/B,CAAC;AAAA,EACD,KAAK,WAAW,mBAAmB;AAAA,IAC/B,OAAO,CAAC,iBAAiB;AAAA,IACzB,UAAU,CAAC,qBAAqB;AAAA,EACpC,CAAC;AAAA,EACD,OAAO,WAAW,qBAAqB;AAAA,IACnC,OAAO,CAAC,mBAAmB;AAAA,IAC3B,UAAU,CAAC,sBAAsB;AAAA,IACjC,QAAQ,CAAC,oBAAoB;AAAA,EACjC,CAAC;AAAA;AAAA,EAGD,MAAM,WAAW,oBAAoB;AAAA,IACjC,OAAO,CAAC,mBAAmB;AAAA,IAC3B,WAAW,CAAC,uBAAuB;AAAA,IACnC,QAAQ,CAAC,oBAAoB;AAAA,EACjC,CAAC;AAAA,EACD,QAAQ,WAAW,sBAAsB;AAAA,IACrC,OAAO,CAAC,mBAAmB;AAAA,IAC3B,UAAU,CAAC,sBAAsB;AAAA,EACrC,CAAC;AAAA,EACD,OAAO,WAAW,qBAAqB;AAAA,IACnC,OAAO,CAAC,kBAAkB;AAAA,IAC1B,UAAU,CAAC,qBAAqB;AAAA,EACpC,CAAC;AAAA;AAAA,EAGD,QAAQ,WAAW,sBAAsB;AAAA,IACrC,OAAO,CAAC,kBAAkB;AAAA,IAC1B,UAAU,CAAC,qBAAqB;AAAA,EACpC,CAAC;AAAA,EACD,MAAM,WAAW,oBAAoB;AAAA,IACjC,OAAO,CAAC,OAAO;AAAA,IACf,QAAQ,CAAC,UAAU,kBAAkB;AAAA,EACzC,CAAC;AAAA,EACD,KAAK,WAAW,mBAAmB;AAAA,IAC/B,OAAO,CAAC,mBAAmB;AAAA,IAC3B,UAAU,CAAC,uBAAuB,oBAAoB;AAAA,EAC1D,GAAG,KAAK;AAAA,EACR,KAAK,WAAW,mBAAmB;AAAA,IAC/B,UAAU,CAAC,sBAAsB;AAAA,EACrC,CAAC;AAAA,EACD,MAAM,WAAW,oBAAoB;AAAA,IACjC,UAAU,CAAC,qBAAqB;AAAA,EACpC,CAAC;AAAA,EACD,QAAQ,WAAW,sBAAsB;AAAA,IACrC,UAAU,CAAC,MAAM;AAAA;AAAA,EACrB,CAAC;AAAA;AAAA,EAGD,SAAS,WAAW,uBAAuB;AAAA,IACvC,OAAO,CAAC,mBAAmB;AAAA,IAC3B,WAAW,CAAC,uBAAuB;AAAA,IACnC,QAAQ,CAAC,oBAAoB;AAAA,EACjC,CAAC;AACL;;;ADhHA,IAAMC,WAAUC,eAAc,YAAY,GAAG;AAetC,IAAM,cAAN,MAAkB;AAAA,EA3BzB,OA2ByB;AAAA;AAAA;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA,UAAe;AAAA,EACf,aAAa,oBAAI,IAAgC;AAAA,EAEzD,YAAY,SAAwB,CAAC,GAAG;AACpC,SAAK,MAAM,OAAO,YAAY;AAC9B,SAAK,MAAM,OAAO,YAAY;AAC9B,SAAK,UAAU,OAAO,WAAW;AAAA,EACrC;AAAA;AAAA,EAGQ,gBAAqB;AACzB,QAAI,CAAC,KAAK,SAAS;AACf,UAAI;AACA,cAAM,SAASD,SAAQ,aAAa;AACpC,aAAK,UAAU,IAAI,OAAO;AAAA,MAC9B,QAAQ;AACJ,aAAK,UAAU;AAAA,MACnB;AAAA,IACJ;AACA,WAAO,KAAK,WAAW;AAAA,EAC3B;AAAA;AAAA,EAGQ,aAAa,UAAsC;AACvD,QAAI,KAAK,WAAW,IAAI,QAAQ,EAAG,QAAO,KAAK,WAAW,IAAI,QAAQ;AAEtE,UAAM,UAAU,SAAS,QAAQ;AACjC,UAAM,UAAU,UAAU,QAAQ,IAAI;AACtC,SAAK,WAAW,IAAI,UAAU,OAAO;AACrC,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAM,UAAkB,SAAiB,UAAwC;AACnF,UAAM,QAAQ,QAAQ,MAAM,IAAI;AAGhC,QAAI,MAAM,UAAU,KAAK,KAAK;AAC1B,aAAO,CAAC;AAAA,QACJ;AAAA,QACA,WAAW;AAAA,QACX,WAAW;AAAA,QACX,SAAS,MAAM;AAAA,QACf,SAAS,QAAQ,KAAK;AAAA,QACtB;AAAA,MACJ,CAAC;AAAA,IACL;AAGA,UAAM,SAAS,KAAK,cAAc;AAClC,UAAM,aAAa,KAAK,aAAa,QAAQ;AAE7C,QAAI,UAAU,YAAY;AACtB,UAAI;AACA,eAAO,YAAY,WAAW,OAAO;AACrC,cAAM,OAAO,OAAO,MAAM,OAAO;AACjC,cAAM,SAAS,KAAK,eAAe,UAAU,OAAO,KAAK,UAAU,YAAY,QAAQ;AAEvF,YAAI,OAAO,SAAS,GAAG;AACnB,iBAAO,OAAO,OAAO,OAAK,EAAE,QAAQ,SAAS,EAAE;AAAA,QACnD;AAAA,MACJ,QAAQ;AAAA,MAER;AAAA,IACJ;AAGA,WAAO,KAAK,cAAc,UAAU,OAAO,QAAQ;AAAA,EACvD;AAAA;AAAA,EAGQ,eACJ,UAAkB,OAClB,UAAe,YAAyB,UAC7B;AACX,UAAM,SAAsB,CAAC;AAC7B,UAAM,OAAO,oBAAI,IAAY;AAE7B,aAAS,IAAI,GAAG,IAAI,SAAS,YAAY,KAAK;AAC1C,YAAM,QAAQ,SAAS,MAAM,CAAC;AAC9B,WAAK,aAAa,UAAU,OAAO,OAAO,YAAY,UAAU,QAAQ,IAAI;AAAA,IAChF;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,aACJ,UAAkB,OAAiB,MACnC,YAAyB,UACzB,QAAqB,MACjB;AACJ,UAAM,OAAO,KAAK;AAGlB,QAAI,SAAS,oBAAoB;AAC7B,eAAS,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK;AACtC,cAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,cAAME,YAAW,KAAK,YAAY,MAAM,MAAM,UAAU;AACxD,YAAIA,WAAU;AACV,eAAK,oBAAoB,UAAU,OAAO,MAAM,OAAOA,WAAU,YAAY,UAAU,QAAQ,IAAI;AACnG;AAAA,QACJ;AAAA,MACJ;AAEA,YAAM,YAAY,KAAK,YAAY,MAAM,KAAK,cAAc,MAAM;AAClE,UAAI,aAAa,KAAK,KAAK;AACvB,aAAK,UAAU,UAAU,OAAO,MAAM,YAAY,KAAK,aAAa,IAAI,GAAG,UAAU,QAAQ,IAAI;AAAA,MACrG;AACA;AAAA,IACJ;AAGA,QAAI,SAAS,wBAAwB;AACjC,eAAS,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK;AACtC,cAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,cAAMA,YAAW,KAAK,YAAY,MAAM,MAAM,UAAU;AACxD,YAAIA,WAAU;AACV,eAAK,oBAAoB,UAAU,OAAO,MAAM,OAAOA,WAAU,YAAY,UAAU,QAAQ,IAAI;AACnG;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAGA,UAAM,WAAW,KAAK,YAAY,MAAM,UAAU;AAClD,QAAI,UAAU;AACV,WAAK,oBAAoB,UAAU,OAAO,MAAM,MAAM,UAAU,YAAY,UAAU,QAAQ,IAAI;AAAA,IACtG;AAAA,EACJ;AAAA;AAAA,EAGQ,YAAY,UAAkB,YAAwC;AAC1E,eAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,WAAW,SAAS,GAAG;AAClE,UAAI,SAAS,MAAM,SAAS,QAAQ,EAAG,QAAO;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,oBACJ,UAAkB,OAClB,WAAgB,WAAgB,UAChC,YAAyB,UACzB,QAAqB,MACjB;AACJ,UAAM,YAAY,UAAU,YAAY,MAAM,UAAU,cAAc,MAAM;AAC5E,UAAM,OAAO,KAAK,aAAa,SAAS;AACxC,UAAM,YAAY,KAAK,aAAa,QAAQ;AAG5C,SAAK,aAAa,WAAW,aAAa,YAAY,aAAa,WAAW,YAAY,KAAK,KAAK;AAChG,WAAK,uBAAuB,UAAU,OAAO,WAAW,WAAW,MAAM,YAAY,UAAU,QAAQ,IAAI;AAC3G;AAAA,IACJ;AAGA,QAAI,YAAY,KAAK,KAAK;AACtB,aAAO,KAAK,GAAG,KAAK;AAAA,QAAiB;AAAA,QAAU;AAAA,QAC3C,UAAU,cAAc;AAAA,QAAK,UAAU,YAAY;AAAA,QACnD;AAAA,QAAM;AAAA,QAAW;AAAA,MAAQ,CAAC;AAC9B;AAAA,IACJ;AAGA,QAAI,aAAa,KAAK,KAAK;AACvB,WAAK,UAAU,UAAU,OAAO,WAAW,WAAW,MAAM,UAAU,QAAQ,IAAI;AAAA,IACtF;AAAA,EACJ;AAAA;AAAA,EAGQ,uBACJ,UAAkB,OAClB,WAAgB,WAAgB,WAChC,YAAyB,UACzB,QAAqB,MACjB;AAEJ,UAAM,OAAO,KAAK,eAAe,SAAS;AAC1C,QAAI,CAAC,MAAM;AACP,aAAO,KAAK,GAAG,KAAK;AAAA,QAAiB;AAAA,QAAU;AAAA,QAC3C,UAAU,cAAc;AAAA,QAAK,UAAU,YAAY;AAAA,QACnD;AAAA,QAAW;AAAA,QAAS;AAAA,MAAQ,CAAC;AACjC;AAAA,IACJ;AAGA,UAAM,cAAc,oBAAI,IAAI;AAAA,MACxB,GAAI,WAAW,UAAU,YAAY,CAAC;AAAA,MACtC,GAAI,WAAW,UAAU,UAAU,CAAC;AAAA,IACxC,CAAC;AAED,QAAI,eAAe;AACnB,aAAS,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK;AACtC,YAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,UAAI,aAAa;AAGjB,UAAI,MAAM,SAAS,wBAAwB;AACvC,iBAAS,IAAI,GAAG,IAAI,MAAM,YAAY,KAAK;AACvC,cAAI,YAAY,IAAI,MAAM,MAAM,CAAC,EAAE,IAAI,GAAG;AACtC,yBAAa,MAAM,MAAM,CAAC;AAC1B;AAAA,UACJ;AAAA,QACJ;AAAA,MACJ;AAEA,UAAI,YAAY,IAAI,WAAW,IAAI,KAAK,YAAY,IAAI,MAAM,IAAI,GAAG;AACjE,cAAM,aAAa,KAAK,aAAa,UAAU;AAC/C,cAAM,cAAc,MAAM,SAAS,yBAAyB,QAAQ;AACpE,cAAM,kBAAkB,YAAY,YAAY,MAAM,YAAY,cAAc,MAAM;AAEtF,YAAI,mBAAmB,KAAK,KAAK;AAC7B,yBAAe;AACf,gBAAM,WAAW,GAAG,SAAS,IAAI,UAAU;AAE3C,cAAI,kBAAkB,KAAK,KAAK;AAC5B,mBAAO,KAAK,GAAG,KAAK;AAAA,cAAiB;AAAA,cAAU;AAAA,cAC3C,YAAY,cAAc;AAAA,cAAK,YAAY,YAAY;AAAA,cACvD;AAAA,cAAU;AAAA,cAAU;AAAA,YAAQ,CAAC;AAAA,UACrC,OAAO;AACH,iBAAK,UAAU,UAAU,OAAO,aAAa,UAAU,UAAU,UAAU,QAAQ,IAAI;AAAA,UAC3F;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AAGA,QAAI,CAAC,cAAc;AACf,aAAO,KAAK,GAAG,KAAK;AAAA,QAAiB;AAAA,QAAU;AAAA,QAC3C,UAAU,cAAc;AAAA,QAAK,UAAU,YAAY;AAAA,QACnD;AAAA,QAAW;AAAA,QAAS;AAAA,MAAQ,CAAC;AAAA,IACrC;AAAA,EACJ;AAAA;AAAA,EAGQ,eAAe,WAA4B;AAC/C,UAAM,YAAY,CAAC,cAAc,SAAS,oBAAoB,MAAM;AACpE,aAAS,IAAI,GAAG,IAAI,UAAU,YAAY,KAAK;AAC3C,YAAM,QAAQ,UAAU,MAAM,CAAC;AAC/B,UAAI,UAAU,SAAS,MAAM,IAAI,EAAG,QAAO;AAAA,IAC/C;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,aAAa,MAAmB;AAEpC,QAAI,OAAO,KAAK,sBAAsB,YAAY;AAC9C,YAAM,WAAW,KAAK,kBAAkB,MAAM;AAC9C,UAAI,SAAU,QAAO,SAAS;AAAA,IAClC;AAEA,aAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC3C,YAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,UAAI,CAAC,cAAc,mBAAmB,qBAAqB,EAAE,SAAS,MAAM,IAAI,GAAG;AAC/E,eAAO,MAAM;AAAA,MACjB;AAAA,IACJ;AAEA,QAAI,KAAK,SAAS,yBAAyB,KAAK,SAAS,wBAAwB;AAC7E,eAAS,IAAI,GAAG,IAAI,KAAK,iBAAiB,KAAK;AAC3C,cAAM,QAAQ,KAAK,WAAW,CAAC;AAC/B,YAAI,MAAM,SAAS,uBAAuB;AACtC,gBAAM,WAAW,MAAM,kBAAkB,MAAM;AAC/C,cAAI,SAAU,QAAO,SAAS;AAAA,QAClC;AAAA,MACJ;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,aAAa,UAA0B;AAC3C,QAAI,aAAa,WAAW,aAAa,YAAY,aAAa,OAAQ,QAAO;AACjF,QAAI,aAAa,YAAa,QAAO;AACrC,QAAI,aAAa,WAAY,QAAO;AACpC,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,UACJ,UAAkB,OAAiB,MACnC,WAAmB,MAAc,UACjC,QAAqB,MACjB;AACJ,UAAM,QAAQ,KAAK,cAAc;AACjC,UAAM,MAAM,KAAK,YAAY;AAC7B,UAAM,MAAM,GAAG,KAAK,IAAI,GAAG;AAC3B,QAAI,KAAK,IAAI,GAAG,EAAG;AACnB,SAAK,IAAI,GAAG;AAEZ,UAAM,UAAU,MAAM,MAAM,OAAO,MAAM,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK;AAC5D,QAAI,QAAQ,UAAU,GAAI;AAE1B,WAAO,KAAK;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW,QAAQ;AAAA,MACnB,SAAS,MAAM;AAAA,MACf;AAAA,MACA;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA,EAIQ,cAAc,UAAkB,OAAiB,UAA+B;AACpF,UAAM,SAAsB,CAAC;AAC7B,UAAM,OAAO,KAAK,IAAI,KAAK,MAAM,KAAK,SAAS,CAAC;AAEhD,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,MAAM;AACzC,YAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM,MAAM;AAC7C,YAAM,UAAU,MAAM,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK;AAClD,UAAI,QAAQ,SAAS,IAAI;AACrB,eAAO,KAAK;AAAA,UACR;AAAA,UACA,WAAW;AAAA,UACX,WAAW,IAAI;AAAA,UACf,SAAS;AAAA,UACT;AAAA,UACA;AAAA,QACJ,CAAC;AAAA,MACL;AACA,UAAI,KAAK,MAAM,OAAQ;AAAA,IAC3B;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,iBACJ,UAAkB,OAClB,OAAe,KACf,MAAc,MAAc,UACjB;AACX,UAAM,SAAsB,CAAC;AAC7B,UAAM,OAAO,KAAK,IAAI,KAAK,MAAM,KAAK,SAAS,CAAC;AAChD,QAAI,OAAO;AAEX,aAAS,IAAI,OAAO,KAAK,KAAK,KAAK,MAAM;AACrC,YAAM,IAAI,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM,CAAC;AACxC,YAAM,UAAU,MAAM,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,KAAK;AAClD,UAAI,QAAQ,SAAS,IAAI;AACrB,eAAO,KAAK;AAAA,UACR;AAAA,UACA,WAAW;AAAA,UACX,MAAM,GAAG,IAAI,UAAU,MAAM;AAAA,UAC7B,WAAW,IAAI;AAAA,UACf,SAAS;AAAA,UACT;AAAA,UACA;AAAA,QACJ,CAAC;AAAA,MACL;AACA,UAAI,IAAI,IAAK;AAAA,IACjB;AAEA,WAAO;AAAA,EACX;AACJ;;;AEhPA,OAAO,UAAU;AAjJV,IAAM,uBAA+C;AAAA;AAAA,EAExD,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA;AAAA,EAGR,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA;AAAA,EAGR,SAAS;AAAA,EACT,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,SAAS;AAAA,EACT,QAAQ;AAAA;AAAA,EAGR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,WAAW;AAAA,EACX,QAAQ;AAAA;AAAA,EAGR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,QAAQ;AAAA;AAAA,EAGR,OAAO;AAAA,EACP,QAAQ;AAAA;AAAA,EAGR,QAAQ;AAAA,EACR,WAAW;AAAA;AAAA,EAGX,UAAU;AAAA,EACV,SAAS;AAAA,EACT,MAAM;AAAA,EACN,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AACZ;AAIO,IAAM,cAAc,oBAAI,IAAI;AAAA;AAAA,EAE/B;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA;AAAA,EACA;AAAA,EACA;AAAA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAGA;AAAA,EACA;AAAA;AAAA,EAGA;AACJ,CAAC;AAIM,IAAM,eAAe,oBAAI,IAAI;AAAA,EAChC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ,CAAC;AAOM,SAAS,YAAY,UAA2B;AACnD,QAAM,MAAM,KAAK,QAAQ,QAAQ,EAAE,YAAY;AAC/C,SAAO,OAAO;AAClB;AAHgB;AAMT,SAAS,YAAY,UAAsC;AAC9D,QAAM,MAAM,KAAK,QAAQ,QAAQ,EAAE,YAAY;AAC/C,SAAO,qBAAqB,GAAG;AACnC;AAHgB;AAMT,SAAS,aAAa,SAA0B;AACnD,SAAO,YAAY,IAAI,OAAO;AAClC;AAFgB;AAKT,SAAS,cAAc,UAA2B;AACrD,SAAO,aAAa,IAAI,QAAQ;AACpC;AAFgB;;;AHlJT,IAAM,cAAN,MAAkB;AAAA,EA5BzB,OA4ByB;AAAA;AAAA;AAAA,EACb,WAAW,IAAI,YAAY;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EAER,YAAY,UAAkB,MAAuB,cAAsB,OAAS;AAChF,SAAK,QAAQ;AACb,SAAK,YAAY;AACjB,SAAK,eAAe;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,MAAM,UAA4B,CAAC,GAAyB;AAC9D,UAAM,EAAE,eAAe,OAAO,WAAW,IAAI;AAC7C,UAAM,QAAQ,KAAK,UAAU,KAAK,SAAS;AAC3C,QAAI,UAAU,GAAG,UAAU,GAAG,cAAc;AAE5C,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,YAAM,WAAW,MAAM,CAAC;AACxB,YAAM,MAAMC,MAAK,SAAS,KAAK,WAAW,QAAQ;AAClD,mBAAa,KAAK,IAAI,GAAG,MAAM,MAAM;AAErC,UAAI;AACJ,UAAI;AAAE,kBAAU,GAAG,aAAa,UAAU,OAAO;AAAA,MAAG,QAC9C;AAAE;AAAA,MAAU;AAElB,YAAM,OAAO,KAAK,MAAM,OAAO;AAC/B,YAAM,WAAW,KAAK,MAAM,GAAG;AAAA,QAC3B;AAAA,MACJ,EAAE,IAAI,GAAG;AAET,UAAI,CAAC,gBAAgB,UAAU,cAAc,MAAM;AAC/C;AACA;AAAA,MACJ;AAEA,WAAK,iBAAiB,GAAG;AACzB,YAAM,aAAa,MAAM,KAAK,WAAW,UAAU,KAAK,SAAS,IAAI;AACrE;AACA,qBAAe;AAAA,IACnB;AAEA,WAAO,EAAE,SAAS,SAAS,QAAQ,YAAY;AAAA,EACnD;AAAA;AAAA,EAGQ,iBAAiB,SAAuB;AAC5C,UAAM,YAAY,KAAK,MAAM,GAAG;AAAA,MAC5B;AAAA,IACJ,EAAE,IAAI,OAAO;AAEb,QAAI,UAAU,SAAS,GAAG;AACtB,iBAAW,EAAE,GAAG,KAAK,WAAW;AAC5B,aAAK,MAAM,KAAK,OAAO,EAAE;AACzB,aAAK,MAAM,YAAY,OAAO,EAAE;AAAA,MACpC;AACA,WAAK,MAAM,GAAG,QAAQ,6CAA6C,EAAE,IAAI,OAAO;AAAA,IACpF;AAAA,EACJ;AAAA;AAAA,EAGA,MAAc,WACV,UAAkB,KAAa,SAAiB,MACjC;AACf,UAAM,MAAMA,MAAK,QAAQ,QAAQ,EAAE,YAAY;AAC/C,UAAM,WAAW,qBAAqB,GAAG,KAAK;AAC9C,UAAM,SAAS,MAAM,KAAK,SAAS,MAAM,KAAK,SAAS,QAAQ;AAE/D,UAAM,iBAAiB,OAAO,IAAI,WAAS;AAAA,MACvC,SAAS,GAAG;AAAA,MACZ,MAAM,OAAO,GAAG,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK,MAAM;AAAA,MACzD,MAAM;AAAA,IACV,EAAE,KAAK,IAAI,CAAC;AAEZ,UAAM,OAAO,MAAM,KAAK,MAAM,UAAU,WAAW,cAAc;AAEjE,aAAS,KAAK,GAAG,KAAK,OAAO,QAAQ,MAAM;AACvC,YAAM,QAAQ,OAAO,EAAE;AACvB,YAAM,SAAS,KAAK,MAAM,GAAG;AAAA,QACzB;AAAA;AAAA,MAEJ,EAAE,IAAI,KAAK,MAAM,WAAW,MAAM,QAAQ,MAAM,MAAM,WAAW,MAAM,SAAS,MAAM,SAAS,UAAU,IAAI;AAE7G,YAAM,KAAK,OAAO,OAAO,eAAe;AACxC,WAAK,MAAM,GAAG;AAAA,QACV;AAAA,MACJ,EAAE,IAAI,IAAI,OAAO,KAAK,KAAK,EAAE,EAAE,MAAM,CAAC;AAEtC,WAAK,MAAM,KAAK,IAAI,KAAK,EAAE,GAAG,EAAE;AAChC,WAAK,MAAM,YAAY,IAAI,IAAI,KAAK,EAAE,CAAC;AAAA,IAC3C;AAEA,SAAK,MAAM,GAAG;AAAA,MACV;AAAA,IACJ,EAAE,IAAI,KAAK,IAAI;AAEf,WAAO,OAAO;AAAA,EAClB;AAAA;AAAA,EAIQ,UAAU,KAAa,QAAkB,CAAC,GAAa;AAC3D,QAAI;AACJ,QAAI;AAAE,gBAAU,GAAG,YAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,IAAG,QACxD;AAAE,aAAO;AAAA,IAAO;AAEtB,eAAW,SAAS,SAAS;AACzB,UAAI,MAAM,YAAY,GAAG;AACrB,YAAI,aAAa,MAAM,IAAI,EAAG;AAC9B,aAAK,UAAUA,MAAK,KAAK,KAAK,MAAM,IAAI,GAAG,KAAK;AAAA,MACpD,WAAW,MAAM,OAAO,GAAG;AACvB,YAAI,cAAc,MAAM,IAAI,EAAG;AAC/B,cAAM,MAAMA,MAAK,QAAQ,MAAM,IAAI,EAAE,YAAY;AACjD,YAAI,EAAE,OAAO,sBAAuB;AAEpC,cAAM,OAAOA,MAAK,KAAK,KAAK,MAAM,IAAI;AACtC,YAAI;AACA,cAAI,GAAG,SAAS,IAAI,EAAE,QAAQ,KAAK,cAAc;AAC7C,kBAAM,KAAK,IAAI;AAAA,UACnB;AAAA,QACJ,QAAQ;AAAA,QAAC;AAAA,MACb;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA,EAIQ,MAAM,SAAyB;AACnC,QAAI,IAAI;AACR,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACrC,WAAK,QAAQ,WAAW,CAAC;AACzB,UAAK,IAAI,aAAc;AAAA,IAC3B;AACA,WAAO,EAAE,SAAS,EAAE;AAAA,EACxB;AACJ;;;AItIA,IAAM,aAAN,MAAoC;AAAA,EAOhC,YAAoB,OAA0B,CAAC,GAAG;AAA9B;AAChB,SAAK,OAAO,KAAK,QAAQ;AAAA,EAC7B;AAAA,EAxCJ,OA+BoC;AAAA;AAAA;AAAA,EACvB;AAAA,EACD;AAAA,EACR;AAAA,EACA;AAAA,EACA,WAAW,oBAAI,IAA0B;AAAA,EAMzC,MAAM,WAAW,KAAoC;AACjD,SAAK,KAAK,IAAI;AAEd,UAAM,SAAS,MAAM,IAAI,sBAAsB,MAAM;AACrD,SAAK,OAAO,OAAO;AACnB,SAAK,WAAW,OAAO;AAGvB,QAAI,OAAO,OAAO;AACd,UAAI,YAAY,gBAAgB,YAAY,KAAK,MAAM,KAAK,QAAQ;AAAA,IACxE;AAEA,UAAM,WAAW,KAAK,KAAK,YAAY,IAAI,OAAO;AAClD,SAAK,UAAU,IAAI,YAAY,UAAU;AAAA,MACrC,IAAI,IAAI;AAAA,MACR,MAAM,KAAK;AAAA,MACX,aAAa,KAAK;AAAA,MAClB,WAAW,IAAI;AAAA,IACnB,GAAG,KAAK,KAAK,eAAe,IAAI,OAAO,WAAW;AAAA,EACtD;AAAA,EAEA,MAAM,MAAM,UAGR,CAAC,GAAyB;AAC1B,WAAO,KAAK,QAAQ,MAAM,OAAO;AAAA,EACrC;AAAA,EAEA,QAAgC;AAC5B,WAAO;AAAA,MACH,OAAW,KAAK,GAAG,QAAQ,wDAAwD,EAAE,IAAI,EAAoB;AAAA,MAC7G,QAAW,KAAK,GAAG,QAAQ,uCAAuC,EAAE,IAAI,EAAoB;AAAA,MAC5F,UAAU,KAAK,KAAK;AAAA,IACxB;AAAA,EACJ;AACJ;AAGO,SAAS,KAAK,MAAmC;AACpD,SAAO,IAAI,WAAW,IAAI;AAC9B;AAFgB;","names":["path","createRequire","require","require","createRequire","category","path"]}

package/dist/chunk-Y3JKI6QN.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/indexers/docs/docs-indexer.ts","../src/indexers/docs/docs-plugin.ts"],"sourcesContent":["/**\n * BrainBank — Document Indexer\n * \n * Indexes generic document collections (markdown, text, etc.)\n * with heading-aware smart chunking, inspired by qmd.\n * \n *   const indexer = new DocsIndexer(db, embedding, hnsw, vecCache);\n *   await indexer.indexCollection('notes', '/path/to/notes', '**\\/*.md');\n */\n\nimport * as fs from 'node:fs';\nimport * as path from 'node:path';\nimport { createHash } from 'node:crypto';\n\nimport type { Database } from '@/db/database.ts';\nimport type { EmbeddingProvider, VectorIndex } from '@/types.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\n\n// ── Break Point Scoring (qmd-inspired) ──────────────\n\ninterface BreakPoint {\n    pos: number;      // character position\n    score: number;    // break quality (higher = better)\n}\n\nconst BREAK_SCORES: [RegExp, number][] = [\n    [/^# /,      100],   // H1\n    [/^## /,      90],   // H2\n    [/^### /,     80],   // H3\n    [/^#### /,    70],   // H4\n    [/^##### /,   60],   // H5\n    [/^###### /,  50],   // H6\n    [/^```/,      80],   // Code fence\n    [/^---$/,     60],   // Horizontal rule\n    [/^\\*\\*\\*$/,  60],   // Horizontal rule alt\n    [/^$/,        20],   // Blank line (paragraph break)\n    [/^[-*+] /,    5],   // List item\n];\n\n// ── Chunk Target ────────────────────────────────────\n\nconst TARGET_CHARS = 3000;       // ~900 tokens\nconst WINDOW_CHARS = 600;        // search window before cutoff\nconst MIN_CHUNK_CHARS = 200;     // don't create tiny chunks\n\n/** Escape special regex characters so user-provided patterns behave as literals. */\nfunction escapeRegex(s: string): string {\n    return s.replace(/[.+?^${}()|[\\]\\\\]/g, '\\\\$&');\n}\n\n/** Ignored output/vendor directories when walking docs. */\nconst IGNORED_DOC_DIRS = new Set([\n    'node_modules', '.git', '.hg', '.svn',\n    'dist', 'build', 'out', 'coverage', '.next',\n    '__pycache__', '.tox', '.venv', 'venv',\n    'vendor', 'target', '.cache', '.turbo',\n]);\n\n// ── DocsIndexer ──────────────────────────────────────\n\nexport class DocsIndexer {\n    constructor(\n        private _db: Database,\n        private _embedding: EmbeddingProvider,\n        private _hnsw: HNSWIndex,\n        private _vecCache: Map<number, Float32Array>,\n    ) {}\n\n    /**\n     * Index all documents in a collection.\n     * Incremental — skips unchanged files (by content hash).\n     */\n    async indexCollection(\n        collection: string,\n        dirPath: string,\n        pattern: string = '**/*.md',\n        options: {\n            ignore?: string[];\n            onProgress?: (file: string, current: number, total: number) => void;\n        } = {},\n    ): Promise<{ indexed: number; skipped: number; chunks: number }> {\n        const absDir = path.resolve(dirPath);\n        if (!fs.existsSync(absDir)) {\n            throw new Error(`Collection path does not exist: ${absDir}`);\n        }\n\n        const files = this._walkFiles(absDir, pattern, options.ignore);\n        let indexed = 0, skipped = 0, totalChunks = 0;\n\n        for (let i = 0; i < files.length; i++) {\n            const relPath = files[i];\n            options.onProgress?.(relPath, i + 1, files.length);\n\n            const absPath = path.join(absDir, relPath);\n            const content = fs.readFileSync(absPath, 'utf-8');\n            const hash = createHash('sha256').update(content).digest('hex').slice(0, 16);\n\n            if (this._isUnchanged(collection, relPath, hash)) {\n                skipped++;\n                continue;\n            }\n\n            this._removeOldChunks(collection, relPath);\n            const chunkCount = await this._indexFile(collection, relPath, content, hash);\n            indexed++;\n            totalChunks += chunkCount;\n        }\n\n        return { indexed, skipped, chunks: totalChunks };\n    }\n\n    /** Walk directory tree and collect matching files. */\n    private _walkFiles(absDir: string, pattern: string, ignore?: string[]): string[] {\n        const patternExt = pattern.match(/\\.([\\w]+)$/)?.[1];\n        const files: string[] = [];\n\n        const walk = (dir: string, base: string): void => {\n            let entries: fs.Dirent[];\n            try { entries = fs.readdirSync(dir, { withFileTypes: true }); }\n            catch { return; }\n            for (const e of entries) {\n                const rel = base ? `${base}/${e.name}` : e.name;\n                if (e.isDirectory()) {\n                    if (IGNORED_DOC_DIRS.has(e.name)) continue;\n                    walk(path.join(dir, e.name), rel);\n                } else if (e.isFile()) {\n                    if (this._isIgnoredFile(rel, ignore)) continue;\n                    const ext = path.extname(e.name).slice(1);\n                    if (!patternExt || ext === patternExt) files.push(rel);\n                }\n            }\n        };\n        walk(absDir, '');\n        return files;\n    }\n\n    /** Check if a file matches any ignore patterns. */\n    private _isIgnoredFile(relPath: string, ignore?: string[]): boolean {\n        if (!ignore) return false;\n        return ignore.some(ig => {\n            const regex = ig\n                .replace(/\\*\\*/g, '{{GLOBSTAR}}')\n                .replace(/\\*/g, '{{STAR}}')\n                .replace(/[.+?^${}()|[\\]\\\\]/g, '\\\\$&')\n                .replace(/\\{\\{GLOBSTAR\\}\\}/g, '.*')\n                .replace(/\\{\\{STAR\\}\\}/g, '[^/]*');\n            return new RegExp(regex).test(relPath);\n        });\n    }\n\n    /** Check if all chunks for a file match the current hash and have vectors. */\n    private _isUnchanged(collection: string, relPath: string, hash: string): boolean {\n        const existing = this._db.prepare(\n            `SELECT dc.id, dc.content_hash, dv.chunk_id AS has_vector\n             FROM doc_chunks dc\n             LEFT JOIN doc_vectors dv ON dv.chunk_id = dc.id\n             WHERE dc.collection = ? AND dc.file_path = ?`\n        ).all(collection, relPath) as any[];\n\n        return existing.length > 0 &&\n            existing.every((c: any) => c.content_hash === hash && c.has_vector != null);\n    }\n\n    /** Remove old chunks and their HNSW vectors for a file. */\n    private _removeOldChunks(collection: string, relPath: string): void {\n        const oldChunks = this._db.prepare(\n            'SELECT id FROM doc_chunks WHERE collection = ? AND file_path = ?'\n        ).all(collection, relPath) as any[];\n\n        for (const old of oldChunks) {\n            this._hnsw.remove(old.id);\n            this._vecCache.delete(old.id);\n        }\n        this._db.prepare(\n            'DELETE FROM doc_chunks WHERE collection = ? AND file_path = ?'\n        ).run(collection, relPath);\n    }\n\n    /** Index a single file: chunk, embed, store in DB + HNSW. */\n    private async _indexFile(\n        collection: string, relPath: string, content: string, hash: string,\n    ): Promise<number> {\n        const title = this._extractTitle(content, relPath);\n        const chunks = this._smartChunk(content);\n\n        const insertChunk = this._db.prepare(`\n            INSERT INTO doc_chunks (collection, file_path, title, content, seq, pos, content_hash)\n            VALUES (?, ?, ?, ?, ?, ?, ?)\n        `);\n\n        const chunkIds: number[] = [];\n        this._db.transaction(() => {\n            for (let seq = 0; seq < chunks.length; seq++) {\n                const result = insertChunk.run(\n                    collection, relPath, title, chunks[seq].text, seq, chunks[seq].pos, hash,\n                );\n                chunkIds.push(Number(result.lastInsertRowid));\n            }\n        });\n\n        const texts = chunks.map(c => `title: ${title} | text: ${c.text}`);\n        const embeddings = await this._embedding.embedBatch(texts);\n\n        const insertVec = this._db.prepare(\n            'INSERT OR REPLACE INTO doc_vectors (chunk_id, embedding) VALUES (?, ?)'\n        );\n        this._db.transaction(() => {\n            for (let j = 0; j < chunkIds.length; j++) {\n                insertVec.run(chunkIds[j], Buffer.from(embeddings[j].buffer));\n            }\n        });\n\n        for (let j = 0; j < chunkIds.length; j++) {\n            this._hnsw.add(embeddings[j], chunkIds[j]);\n            this._vecCache.set(chunkIds[j], embeddings[j]);\n        }\n\n        return chunks.length;\n    }\n\n    /** Remove all indexed data for a collection. */\n    removeCollection(collection: string): void {\n        const chunks = this._db.prepare(\n            'SELECT id FROM doc_chunks WHERE collection = ?'\n        ).all(collection) as any[];\n        for (const chunk of chunks) {\n            this._hnsw.remove(chunk.id);\n            this._vecCache.delete(chunk.id);\n        }\n\n        this._db.prepare('DELETE FROM doc_chunks WHERE collection = ?').run(collection);\n        this._db.prepare('DELETE FROM collections WHERE name = ?').run(collection);\n        this._db.prepare('DELETE FROM path_contexts WHERE collection = ?').run(collection);\n    }\n\n    // ── Smart Chunking ──────────────────────────────\n\n    /** Split document into chunks at natural markdown boundaries. */\n    private _smartChunk(text: string): { text: string; pos: number }[] {\n        if (text.length <= TARGET_CHARS) {\n            return [{ text, pos: 0 }];\n        }\n\n        const lines = text.split('\\n');\n        const breakPoints = this._findBreakPoints(lines);\n        const chunks: { text: string; pos: number }[] = [];\n        let chunkStart = 0;\n\n        while (chunkStart < text.length) {\n            const remaining = text.length - chunkStart;\n            if (remaining <= TARGET_CHARS + WINDOW_CHARS) {\n                this._pushLastChunk(text, chunkStart, chunks);\n                break;\n            }\n\n            const bestBreak = this._findBestBreak(chunkStart, breakPoints);\n            const chunkText = text.slice(chunkStart, bestBreak).trim();\n            if (chunkText.length >= MIN_CHUNK_CHARS) {\n                chunks.push({ text: chunkText, pos: chunkStart });\n            }\n            chunkStart = bestBreak;\n        }\n\n        return chunks;\n    }\n\n    /** Handle the last chunk: merge if too small, otherwise push. */\n    private _pushLastChunk(\n        text: string, chunkStart: number, chunks: { text: string; pos: number }[],\n    ): void {\n        const lastText = text.slice(chunkStart).trim();\n        if (lastText.length >= MIN_CHUNK_CHARS) {\n            chunks.push({ text: lastText, pos: chunkStart });\n        } else if (chunks.length > 0) {\n            chunks[chunks.length - 1].text += '\\n' + lastText;\n        } else {\n            chunks.push({ text: lastText, pos: chunkStart });\n        }\n    }\n\n    /** Find the best break position within the target window. */\n    private _findBestBreak(chunkStart: number, breakPoints: BreakPoint[]): number {\n        const targetEnd = chunkStart + TARGET_CHARS;\n        const windowStart = targetEnd - WINDOW_CHARS;\n\n        let bestBreak = targetEnd;\n        let bestScore = 0;\n\n        for (const bp of breakPoints) {\n            if (bp.pos <= chunkStart) continue;\n            if (bp.pos > targetEnd + WINDOW_CHARS / 2) break;\n            if (bp.pos < windowStart) continue;\n\n            const distance = Math.abs(bp.pos - targetEnd);\n            const decay = 1 - (distance / WINDOW_CHARS) ** 2 * 0.7;\n            const finalScore = bp.score * decay;\n\n            if (finalScore > bestScore) {\n                bestScore = finalScore;\n                bestBreak = bp.pos;\n            }\n        }\n\n        return bestBreak;\n    }\n\n    /** Find all potential break points in the document with scores. */\n    private _findBreakPoints(lines: string[]): BreakPoint[] {\n        const points: BreakPoint[] = [];\n        let charPos = 0;\n        let inCodeBlock = false;\n\n        for (const line of lines) {\n            if (line.trimStart().startsWith('```')) {\n                inCodeBlock = !inCodeBlock;\n                if (!inCodeBlock) {\n                    points.push({ pos: charPos + line.length + 1, score: 80 });\n                }\n                charPos += line.length + 1;\n                continue;\n            }\n\n            if (inCodeBlock) {\n                charPos += line.length + 1;\n                continue;\n            }\n\n            for (const [pattern, score] of BREAK_SCORES) {\n                if (pattern.test(line.trim())) {\n                    points.push({ pos: charPos, score });\n                    break;\n                }\n            }\n\n            charPos += line.length + 1;\n        }\n\n        return points;\n    }\n\n    /** Extract document title from first heading or filename. */\n    private _extractTitle(content: string, filePath: string): string {\n        const match = content.match(/^#{1,3}\\s+(.+)$/m);\n        if (match) return match[1].trim();\n        return path.basename(filePath, path.extname(filePath));\n    }\n}\n","/**\n * BrainBank — Docs Module\n * \n * Index any folder of markdown/text files (notes, docs, wikis).\n * Heading-aware smart chunking inspired by qmd.\n * \n *   import { docs } from 'brainbank/docs';\n *   brain.use(docs());\n */\n\nimport type { Indexer, IndexerContext } from '@/indexers/base.ts';\nimport type { HNSWIndex } from '@/providers/vector/hnsw-index.ts';\nimport type { Database } from '@/db/database.ts';\nimport type { EmbeddingProvider, DocumentCollection, SearchResult } from '@/types.ts';\nimport { DocsIndexer } from './docs-indexer.ts';\n\nclass DocsPlugin implements Indexer {\n    readonly name = 'docs';\n    hnsw!: HNSWIndex;\n    indexer!: DocsIndexer;\n    vecCache = new Map<number, Float32Array>();\n    private _db!: Database;\n    private _embedding!: EmbeddingProvider;\n\n    async initialize(ctx: IndexerContext): Promise<void> {\n        this._db = ctx.db;\n        this._embedding = ctx.embedding;\n        this.hnsw = await ctx.createHnsw();\n        ctx.loadVectors('doc_vectors', 'chunk_id', this.hnsw, this.vecCache);\n        this.indexer = new DocsIndexer(ctx.db, ctx.embedding, this.hnsw, this.vecCache);\n    }\n\n    /** Register a document collection. */\n    addCollection(collection: DocumentCollection): void {\n        this._db.prepare(`\n            INSERT OR REPLACE INTO collections (name, path, pattern, ignore_json, context)\n            VALUES (?, ?, ?, ?, ?)\n        `).run(\n            collection.name,\n            collection.path,\n            collection.pattern ?? '**/*.md',\n            JSON.stringify(collection.ignore ?? []),\n            collection.context ?? null,\n        );\n    }\n\n    /** Remove a collection and its indexed data. */\n    removeCollection(name: string): void {\n        this.indexer.removeCollection(name);\n    }\n\n    /** List all registered collections. */\n    listCollections(): DocumentCollection[] {\n        return (this._db.prepare('SELECT * FROM collections').all() as any[]).map(row => ({\n            name: row.name,\n            path: row.path,\n            pattern: row.pattern,\n            ignore: JSON.parse(row.ignore_json),\n            context: row.context,\n        }));\n    }\n\n    /** Index all (or specific) collections. Incremental. */\n    async indexCollections(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        const allCollections = this.listCollections();\n        const toIndex = options.collections\n            ? allCollections.filter(c => options.collections!.includes(c.name))\n            : allCollections;\n\n        const results: Record<string, { indexed: number; skipped: number; chunks: number }> = {};\n\n        for (const coll of toIndex) {\n            results[coll.name] = await this.indexer.indexCollection(\n                coll.name,\n                coll.path,\n                coll.pattern,\n                {\n                    ignore: coll.ignore,\n                    onProgress: (file, cur, total) => options.onProgress?.(coll.name, file, cur, total),\n                },\n            );\n        }\n\n        return results;\n    }\n\n    /** Search documents only. */\n    async search(query: string, options?: {\n        collection?: string;\n        k?: number;\n        minScore?: number;\n    }): Promise<SearchResult[]> {\n        const k = options?.k ?? 8;\n        const queryVec = await this._embedding.embed(query);\n\n        // Over-fetch from shared HNSW when filtering by collection\n        // (same pattern as collection.ts ratio scaling)\n        let searchK = k;\n        if (options?.collection && this.hnsw.size > 0) {\n            const collectionCount = (this._db.prepare(\n                'SELECT COUNT(*) as c FROM doc_chunks WHERE collection = ?'\n            ).get(options.collection) as any)?.c ?? 0;\n            const totalChunks = (this._db.prepare(\n                'SELECT COUNT(*) as c FROM doc_chunks'\n            ).get() as any)?.c ?? 1;\n            const ratio = collectionCount > 0\n                ? Math.max(3, Math.min(50, Math.ceil(totalChunks / collectionCount)))\n                : 3;\n            searchK = Math.min(k * ratio, this.hnsw.size);\n        }\n\n        const hits = this.hnsw.search(queryVec, searchK);\n\n        const results: SearchResult[] = [];\n        for (const hit of hits) {\n            if (options?.minScore && hit.score < options.minScore) continue;\n\n            const chunk = this._db.prepare(\n                'SELECT * FROM doc_chunks WHERE id = ?'\n            ).get(hit.id) as any;\n\n            if (!chunk) continue;\n            if (options?.collection && chunk.collection !== options.collection) continue;\n\n            const ctx = this._getDocContext(chunk.collection, chunk.file_path);\n\n            results.push({\n                type: 'document',\n                score: hit.score,\n                filePath: chunk.file_path,\n                content: chunk.content,\n                context: ctx,\n                metadata: {\n                    collection: chunk.collection,\n                    title: chunk.title,\n                    seq: chunk.seq,\n                },\n            });\n\n            // Stop once we have enough results\n            if (results.length >= k) break;\n        }\n\n        return results;\n    }\n\n    /** Add context description for a document path. */\n    addContext(collection: string, path: string, context: string): void {\n        this._db.prepare(`\n            INSERT OR REPLACE INTO path_contexts (collection, path, context)\n            VALUES (?, ?, ?)\n        `).run(collection, path, context);\n    }\n\n    /** Remove context for a path. */\n    removeContext(collection: string, path: string): void {\n        this._db.prepare(\n            'DELETE FROM path_contexts WHERE collection = ? AND path = ?'\n        ).run(collection, path);\n    }\n\n    /** List all context entries. */\n    listContexts(): { collection: string; path: string; context: string }[] {\n        return this._db.prepare('SELECT * FROM path_contexts').all() as any[];\n    }\n\n    stats(): Record<string, any> {\n        return {\n            collections: (this._db.prepare('SELECT COUNT(*) as c FROM collections').get() as any).c,\n            documents: (this._db.prepare('SELECT COUNT(DISTINCT file_path) as c FROM doc_chunks').get() as any).c,\n            chunks: (this._db.prepare('SELECT COUNT(*) as c FROM doc_chunks').get() as any).c,\n            hnswSize: this.hnsw.size,\n        };\n    }\n\n    /** Resolve context for a document (checks path_contexts tree → collection context). */\n    private _getDocContext(collection: string, filePath: string): string | undefined {\n        const parts = filePath.split('/');\n        for (let i = parts.length; i >= 0; i--) {\n            const checkPath = i === 0 ? '/' : '/' + parts.slice(0, i).join('/');\n            const ctx = this._db.prepare(\n                'SELECT context FROM path_contexts WHERE collection = ? AND path = ?'\n            ).get(collection, checkPath) as any;\n            if (ctx) return ctx.context;\n        }\n\n        const coll = this._db.prepare(\n            'SELECT context FROM collections WHERE name = ?'\n        ).get(collection) as any;\n        return coll?.context ?? undefined;\n    }\n}\n\n/** Create a document collections plugin. */\nexport function docs(): Indexer {\n    return new DocsPlugin();\n}\n"],"mappings":";;;;;AAUA,YAAY,QAAQ;AACpB,YAAY,UAAU;AACtB,SAAS,kBAAkB;AAa3B,IAAM,eAAmC;AAAA,EACrC,CAAC,OAAY,GAAG;AAAA;AAAA,EAChB,CAAC,QAAa,EAAE;AAAA;AAAA,EAChB,CAAC,SAAa,EAAE;AAAA;AAAA,EAChB,CAAC,UAAa,EAAE;AAAA;AAAA,EAChB,CAAC,WAAa,EAAE;AAAA;AAAA,EAChB,CAAC,YAAa,EAAE;AAAA;AAAA,EAChB,CAAC,QAAa,EAAE;AAAA;AAAA,EAChB,CAAC,SAAa,EAAE;AAAA;AAAA,EAChB,CAAC,YAAa,EAAE;AAAA;AAAA,EAChB,CAAC,MAAa,EAAE;AAAA;AAAA,EAChB,CAAC,WAAc,CAAC;AAAA;AACpB;AAIA,IAAM,eAAe;AACrB,IAAM,eAAe;AACrB,IAAM,kBAAkB;AAQxB,IAAM,mBAAmB,oBAAI,IAAI;AAAA,EAC7B;AAAA,EAAgB;AAAA,EAAQ;AAAA,EAAO;AAAA,EAC/B;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAY;AAAA,EACpC;AAAA,EAAe;AAAA,EAAQ;AAAA,EAAS;AAAA,EAChC;AAAA,EAAU;AAAA,EAAU;AAAA,EAAU;AAClC,CAAC;AAIM,IAAM,cAAN,MAAkB;AAAA,EACrB,YACY,KACA,YACA,OACA,WACV;AAJU;AACA;AACA;AACA;AAAA,EACT;AAAA,EAlEP,OA4DyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYrB,MAAM,gBACF,YACA,SACA,UAAkB,WAClB,UAGI,CAAC,GACwD;AAC7D,UAAM,SAAc,aAAQ,OAAO;AACnC,QAAI,CAAI,cAAW,MAAM,GAAG;AACxB,YAAM,IAAI,MAAM,mCAAmC,MAAM,EAAE;AAAA,IAC/D;AAEA,UAAM,QAAQ,KAAK,WAAW,QAAQ,SAAS,QAAQ,MAAM;AAC7D,QAAI,UAAU,GAAG,UAAU,GAAG,cAAc;AAE5C,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACnC,YAAM,UAAU,MAAM,CAAC;AACvB,cAAQ,aAAa,SAAS,IAAI,GAAG,MAAM,MAAM;AAEjD,YAAM,UAAe,UAAK,QAAQ,OAAO;AACzC,YAAM,UAAa,gBAAa,SAAS,OAAO;AAChD,YAAM,OAAO,WAAW,QAAQ,EAAE,OAAO,OAAO,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE;AAE3E,UAAI,KAAK,aAAa,YAAY,SAAS,IAAI,GAAG;AAC9C;AACA;AAAA,MACJ;AAEA,WAAK,iBAAiB,YAAY,OAAO;AACzC,YAAM,aAAa,MAAM,KAAK,WAAW,YAAY,SAAS,SAAS,IAAI;AAC3E;AACA,qBAAe;AAAA,IACnB;AAEA,WAAO,EAAE,SAAS,SAAS,QAAQ,YAAY;AAAA,EACnD;AAAA;AAAA,EAGQ,WAAW,QAAgB,SAAiB,QAA6B;AAC7E,UAAM,aAAa,QAAQ,MAAM,YAAY,IAAI,CAAC;AAClD,UAAM,QAAkB,CAAC;AAEzB,UAAM,OAAO,wBAAC,KAAa,SAAuB;AAC9C,UAAI;AACJ,UAAI;AAAE,kBAAa,eAAY,KAAK,EAAE,eAAe,KAAK,CAAC;AAAA,MAAG,QACxD;AAAE;AAAA,MAAQ;AAChB,iBAAW,KAAK,SAAS;AACrB,cAAM,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,IAAI,KAAK,EAAE;AAC3C,YAAI,EAAE,YAAY,GAAG;AACjB,cAAI,iBAAiB,IAAI,EAAE,IAAI,EAAG;AAClC,eAAU,UAAK,KAAK,EAAE,IAAI,GAAG,GAAG;AAAA,QACpC,WAAW,EAAE,OAAO,GAAG;AACnB,cAAI,KAAK,eAAe,KAAK,MAAM,EAAG;AACtC,gBAAM,MAAW,aAAQ,EAAE,IAAI,EAAE,MAAM,CAAC;AACxC,cAAI,CAAC,cAAc,QAAQ,WAAY,OAAM,KAAK,GAAG;AAAA,QACzD;AAAA,MACJ;AAAA,IACJ,GAfa;AAgBb,SAAK,QAAQ,EAAE;AACf,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,eAAe,SAAiB,QAA4B;AAChE,QAAI,CAAC,OAAQ,QAAO;AACpB,WAAO,OAAO,KAAK,QAAM;AACrB,YAAM,QAAQ,GACT,QAAQ,SAAS,cAAc,EAC/B,QAAQ,OAAO,UAAU,EACzB,QAAQ,sBAAsB,MAAM,EACpC,QAAQ,qBAAqB,IAAI,EACjC,QAAQ,iBAAiB,OAAO;AACrC,aAAO,IAAI,OAAO,KAAK,EAAE,KAAK,OAAO;AAAA,IACzC,CAAC;AAAA,EACL;AAAA;AAAA,EAGQ,aAAa,YAAoB,SAAiB,MAAuB;AAC7E,UAAM,WAAW,KAAK,IAAI;AAAA,MACtB;AAAA;AAAA;AAAA;AAAA,IAIJ,EAAE,IAAI,YAAY,OAAO;AAEzB,WAAO,SAAS,SAAS,KACrB,SAAS,MAAM,CAAC,MAAW,EAAE,iBAAiB,QAAQ,EAAE,cAAc,IAAI;AAAA,EAClF;AAAA;AAAA,EAGQ,iBAAiB,YAAoB,SAAuB;AAChE,UAAM,YAAY,KAAK,IAAI;AAAA,MACvB;AAAA,IACJ,EAAE,IAAI,YAAY,OAAO;AAEzB,eAAW,OAAO,WAAW;AACzB,WAAK,MAAM,OAAO,IAAI,EAAE;AACxB,WAAK,UAAU,OAAO,IAAI,EAAE;AAAA,IAChC;AACA,SAAK,IAAI;AAAA,MACL;AAAA,IACJ,EAAE,IAAI,YAAY,OAAO;AAAA,EAC7B;AAAA;AAAA,EAGA,MAAc,WACV,YAAoB,SAAiB,SAAiB,MACvC;AACf,UAAM,QAAQ,KAAK,cAAc,SAAS,OAAO;AACjD,UAAM,SAAS,KAAK,YAAY,OAAO;AAEvC,UAAM,cAAc,KAAK,IAAI,QAAQ;AAAA;AAAA;AAAA,SAGpC;AAED,UAAM,WAAqB,CAAC;AAC5B,SAAK,IAAI,YAAY,MAAM;AACvB,eAAS,MAAM,GAAG,MAAM,OAAO,QAAQ,OAAO;AAC1C,cAAM,SAAS,YAAY;AAAA,UACvB;AAAA,UAAY;AAAA,UAAS;AAAA,UAAO,OAAO,GAAG,EAAE;AAAA,UAAM;AAAA,UAAK,OAAO,GAAG,EAAE;AAAA,UAAK;AAAA,QACxE;AACA,iBAAS,KAAK,OAAO,OAAO,eAAe,CAAC;AAAA,MAChD;AAAA,IACJ,CAAC;AAED,UAAM,QAAQ,OAAO,IAAI,OAAK,UAAU,KAAK,YAAY,EAAE,IAAI,EAAE;AACjE,UAAM,aAAa,MAAM,KAAK,WAAW,WAAW,KAAK;AAEzD,UAAM,YAAY,KAAK,IAAI;AAAA,MACvB;AAAA,IACJ;AACA,SAAK,IAAI,YAAY,MAAM;AACvB,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,kBAAU,IAAI,SAAS,CAAC,GAAG,OAAO,KAAK,WAAW,CAAC,EAAE,MAAM,CAAC;AAAA,MAChE;AAAA,IACJ,CAAC;AAED,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACtC,WAAK,MAAM,IAAI,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC;AACzC,WAAK,UAAU,IAAI,SAAS,CAAC,GAAG,WAAW,CAAC,CAAC;AAAA,IACjD;AAEA,WAAO,OAAO;AAAA,EAClB;AAAA;AAAA,EAGA,iBAAiB,YAA0B;AACvC,UAAM,SAAS,KAAK,IAAI;AAAA,MACpB;AAAA,IACJ,EAAE,IAAI,UAAU;AAChB,eAAW,SAAS,QAAQ;AACxB,WAAK,MAAM,OAAO,MAAM,EAAE;AAC1B,WAAK,UAAU,OAAO,MAAM,EAAE;AAAA,IAClC;AAEA,SAAK,IAAI,QAAQ,6CAA6C,EAAE,IAAI,UAAU;AAC9E,SAAK,IAAI,QAAQ,wCAAwC,EAAE,IAAI,UAAU;AACzE,SAAK,IAAI,QAAQ,gDAAgD,EAAE,IAAI,UAAU;AAAA,EACrF;AAAA;AAAA;AAAA,EAKQ,YAAY,MAA+C;AAC/D,QAAI,KAAK,UAAU,cAAc;AAC7B,aAAO,CAAC,EAAE,MAAM,KAAK,EAAE,CAAC;AAAA,IAC5B;AAEA,UAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,UAAM,cAAc,KAAK,iBAAiB,KAAK;AAC/C,UAAM,SAA0C,CAAC;AACjD,QAAI,aAAa;AAEjB,WAAO,aAAa,KAAK,QAAQ;AAC7B,YAAM,YAAY,KAAK,SAAS;AAChC,UAAI,aAAa,eAAe,cAAc;AAC1C,aAAK,eAAe,MAAM,YAAY,MAAM;AAC5C;AAAA,MACJ;AAEA,YAAM,YAAY,KAAK,eAAe,YAAY,WAAW;AAC7D,YAAM,YAAY,KAAK,MAAM,YAAY,SAAS,EAAE,KAAK;AACzD,UAAI,UAAU,UAAU,iBAAiB;AACrC,eAAO,KAAK,EAAE,MAAM,WAAW,KAAK,WAAW,CAAC;AAAA,MACpD;AACA,mBAAa;AAAA,IACjB;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,eACJ,MAAc,YAAoB,QAC9B;AACJ,UAAM,WAAW,KAAK,MAAM,UAAU,EAAE,KAAK;AAC7C,QAAI,SAAS,UAAU,iBAAiB;AACpC,aAAO,KAAK,EAAE,MAAM,UAAU,KAAK,WAAW,CAAC;AAAA,IACnD,WAAW,OAAO,SAAS,GAAG;AAC1B,aAAO,OAAO,SAAS,CAAC,EAAE,QAAQ,OAAO;AAAA,IAC7C,OAAO;AACH,aAAO,KAAK,EAAE,MAAM,UAAU,KAAK,WAAW,CAAC;AAAA,IACnD;AAAA,EACJ;AAAA;AAAA,EAGQ,eAAe,YAAoB,aAAmC;AAC1E,UAAM,YAAY,aAAa;AAC/B,UAAM,cAAc,YAAY;AAEhC,QAAI,YAAY;AAChB,QAAI,YAAY;AAEhB,eAAW,MAAM,aAAa;AAC1B,UAAI,GAAG,OAAO,WAAY;AAC1B,UAAI,GAAG,MAAM,YAAY,eAAe,EAAG;AAC3C,UAAI,GAAG,MAAM,YAAa;AAE1B,YAAM,WAAW,KAAK,IAAI,GAAG,MAAM,SAAS;AAC5C,YAAM,QAAQ,KAAK,WAAW,iBAAiB,IAAI;AACnD,YAAM,aAAa,GAAG,QAAQ;AAE9B,UAAI,aAAa,WAAW;AACxB,oBAAY;AACZ,oBAAY,GAAG;AAAA,MACnB;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,iBAAiB,OAA+B;AACpD,UAAM,SAAuB,CAAC;AAC9B,QAAI,UAAU;AACd,QAAI,cAAc;AAElB,eAAW,QAAQ,OAAO;AACtB,UAAI,KAAK,UAAU,EAAE,WAAW,KAAK,GAAG;AACpC,sBAAc,CAAC;AACf,YAAI,CAAC,aAAa;AACd,iBAAO,KAAK,EAAE,KAAK,UAAU,KAAK,SAAS,GAAG,OAAO,GAAG,CAAC;AAAA,QAC7D;AACA,mBAAW,KAAK,SAAS;AACzB;AAAA,MACJ;AAEA,UAAI,aAAa;AACb,mBAAW,KAAK,SAAS;AACzB;AAAA,MACJ;AAEA,iBAAW,CAAC,SAAS,KAAK,KAAK,cAAc;AACzC,YAAI,QAAQ,KAAK,KAAK,KAAK,CAAC,GAAG;AAC3B,iBAAO,KAAK,EAAE,KAAK,SAAS,MAAM,CAAC;AACnC;AAAA,QACJ;AAAA,MACJ;AAEA,iBAAW,KAAK,SAAS;AAAA,IAC7B;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGQ,cAAc,SAAiB,UAA0B;AAC7D,UAAM,QAAQ,QAAQ,MAAM,kBAAkB;AAC9C,QAAI,MAAO,QAAO,MAAM,CAAC,EAAE,KAAK;AAChC,WAAY,cAAS,UAAe,aAAQ,QAAQ,CAAC;AAAA,EACzD;AACJ;;;AC1UA,IAAM,aAAN,MAAoC;AAAA,EAhBpC,OAgBoC;AAAA;AAAA;AAAA,EACvB,OAAO;AAAA,EAChB;AAAA,EACA;AAAA,EACA,WAAW,oBAAI,IAA0B;AAAA,EACjC;AAAA,EACA;AAAA,EAER,MAAM,WAAW,KAAoC;AACjD,SAAK,MAAM,IAAI;AACf,SAAK,aAAa,IAAI;AACtB,SAAK,OAAO,MAAM,IAAI,WAAW;AACjC,QAAI,YAAY,eAAe,YAAY,KAAK,MAAM,KAAK,QAAQ;AACnE,SAAK,UAAU,IAAI,YAAY,IAAI,IAAI,IAAI,WAAW,KAAK,MAAM,KAAK,QAAQ;AAAA,EAClF;AAAA;AAAA,EAGA,cAAc,YAAsC;AAChD,SAAK,IAAI,QAAQ;AAAA;AAAA;AAAA,SAGhB,EAAE;AAAA,MACC,WAAW;AAAA,MACX,WAAW;AAAA,MACX,WAAW,WAAW;AAAA,MACtB,KAAK,UAAU,WAAW,UAAU,CAAC,CAAC;AAAA,MACtC,WAAW,WAAW;AAAA,IAC1B;AAAA,EACJ;AAAA;AAAA,EAGA,iBAAiB,MAAoB;AACjC,SAAK,QAAQ,iBAAiB,IAAI;AAAA,EACtC;AAAA;AAAA,EAGA,kBAAwC;AACpC,WAAQ,KAAK,IAAI,QAAQ,2BAA2B,EAAE,IAAI,EAAY,IAAI,UAAQ;AAAA,MAC9E,MAAM,IAAI;AAAA,MACV,MAAM,IAAI;AAAA,MACV,SAAS,IAAI;AAAA,MACb,QAAQ,KAAK,MAAM,IAAI,WAAW;AAAA,MAClC,SAAS,IAAI;AAAA,IACjB,EAAE;AAAA,EACN;AAAA;AAAA,EAGA,MAAM,iBAAiB,UAGnB,CAAC,GAAkF;AACnF,UAAM,iBAAiB,KAAK,gBAAgB;AAC5C,UAAM,UAAU,QAAQ,cAClB,eAAe,OAAO,OAAK,QAAQ,YAAa,SAAS,EAAE,IAAI,CAAC,IAChE;AAEN,UAAM,UAAgF,CAAC;AAEvF,eAAW,QAAQ,SAAS;AACxB,cAAQ,KAAK,IAAI,IAAI,MAAM,KAAK,QAAQ;AAAA,QACpC,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL;AAAA,UACI,QAAQ,KAAK;AAAA,UACb,YAAY,wBAAC,MAAM,KAAK,UAAU,QAAQ,aAAa,KAAK,MAAM,MAAM,KAAK,KAAK,GAAtE;AAAA,QAChB;AAAA,MACJ;AAAA,IACJ;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,MAAM,OAAO,OAAe,SAIA;AACxB,UAAM,IAAI,SAAS,KAAK;AACxB,UAAM,WAAW,MAAM,KAAK,WAAW,MAAM,KAAK;AAIlD,QAAI,UAAU;AACd,QAAI,SAAS,cAAc,KAAK,KAAK,OAAO,GAAG;AAC3C,YAAM,kBAAmB,KAAK,IAAI;AAAA,QAC9B;AAAA,MACJ,EAAE,IAAI,QAAQ,UAAU,GAAW,KAAK;AACxC,YAAM,cAAe,KAAK,IAAI;AAAA,QAC1B;AAAA,MACJ,EAAE,IAAI,GAAW,KAAK;AACtB,YAAM,QAAQ,kBAAkB,IAC1B,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,KAAK,cAAc,eAAe,CAAC,CAAC,IAClE;AACN,gBAAU,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,IAAI;AAAA,IAChD;AAEA,UAAM,OAAO,KAAK,KAAK,OAAO,UAAU,OAAO;AAE/C,UAAM,UAA0B,CAAC;AACjC,eAAW,OAAO,MAAM;AACpB,UAAI,SAAS,YAAY,IAAI,QAAQ,QAAQ,SAAU;AAEvD,YAAM,QAAQ,KAAK,IAAI;AAAA,QACnB;AAAA,MACJ,EAAE,IAAI,IAAI,EAAE;AAEZ,UAAI,CAAC,MAAO;AACZ,UAAI,SAAS,cAAc,MAAM,eAAe,QAAQ,WAAY;AAEpE,YAAM,MAAM,KAAK,eAAe,MAAM,YAAY,MAAM,SAAS;AAEjE,cAAQ,KAAK;AAAA,QACT,MAAM;AAAA,QACN,OAAO,IAAI;AAAA,QACX,UAAU,MAAM;AAAA,QAChB,SAAS,MAAM;AAAA,QACf,SAAS;AAAA,QACT,UAAU;AAAA,UACN,YAAY,MAAM;AAAA,UAClB,OAAO,MAAM;AAAA,UACb,KAAK,MAAM;AAAA,QACf;AAAA,MACJ,CAAC;AAGD,UAAI,QAAQ,UAAU,EAAG;AAAA,IAC7B;AAEA,WAAO;AAAA,EACX;AAAA;AAAA,EAGA,WAAW,YAAoBA,OAAc,SAAuB;AAChE,SAAK,IAAI,QAAQ;AAAA;AAAA;AAAA,SAGhB,EAAE,IAAI,YAAYA,OAAM,OAAO;AAAA,EACpC;AAAA;AAAA,EAGA,cAAc,YAAoBA,OAAoB;AAClD,SAAK,IAAI;AAAA,MACL;AAAA,IACJ,EAAE,IAAI,YAAYA,KAAI;AAAA,EAC1B;AAAA;AAAA,EAGA,eAAwE;AACpE,WAAO,KAAK,IAAI,QAAQ,6BAA6B,EAAE,IAAI;AAAA,EAC/D;AAAA,EAEA,QAA6B;AACzB,WAAO;AAAA,MACH,aAAc,KAAK,IAAI,QAAQ,uCAAuC,EAAE,IAAI,EAAU;AAAA,MACtF,WAAY,KAAK,IAAI,QAAQ,uDAAuD,EAAE,IAAI,EAAU;AAAA,MACpG,QAAS,KAAK,IAAI,QAAQ,sCAAsC,EAAE,IAAI,EAAU;AAAA,MAChF,UAAU,KAAK,KAAK;AAAA,IACxB;AAAA,EACJ;AAAA;AAAA,EAGQ,eAAe,YAAoB,UAAsC;AAC7E,UAAM,QAAQ,SAAS,MAAM,GAAG;AAChC,aAAS,IAAI,MAAM,QAAQ,KAAK,GAAG,KAAK;AACpC,YAAM,YAAY,MAAM,IAAI,MAAM,MAAM,MAAM,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;AAClE,YAAM,MAAM,KAAK,IAAI;AAAA,QACjB;AAAA,MACJ,EAAE,IAAI,YAAY,SAAS;AAC3B,UAAI,IAAK,QAAO,IAAI;AAAA,IACxB;AAEA,UAAM,OAAO,KAAK,IAAI;AAAA,MAClB;AAAA,IACJ,EAAE,IAAI,UAAU;AAChB,WAAO,MAAM,WAAW;AAAA,EAC5B;AACJ;AAGO,SAAS,OAAgB;AAC5B,SAAO,IAAI,WAAW;AAC1B;AAFgB;","names":["path"]}