@neurcode-ai/cli 0.9.63 → 0.9.65

package/dist/semantic/index.js

@@ -0,0 +1,30 @@
+"use strict";
+/**
+ * Neurcode Semantic Layer — public API
+ *
+ * Phase 1: TF-IDF semantic vector store (deterministic, zero external deps)
+ * Phase 2: Optional embedding upgrade (drop-in, same API surface)
+ *
+ * Usage:
+ *   import { buildSemanticIndex, semanticSearch } from '../semantic';
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.explainQuery = exports.clearSemanticIndex = exports.getSemanticIndexStats = exports.removeFileFromIndex = exports.upsertFileInIndex = exports.semanticSearch = exports.buildSemanticIndex = exports.removeDocumentFromCorpus = exports.upsertDocumentInCorpus = exports.computeIDF = exports.searchCorpus = exports.buildCorpus = exports.tokenize = void 0;
+var tfidf_engine_1 = require("./tfidf-engine");
+// TF-IDF engine primitives (for testing / advanced use)
+Object.defineProperty(exports, "tokenize", { enumerable: true, get: function () { return tfidf_engine_1.tokenize; } });
+Object.defineProperty(exports, "buildCorpus", { enumerable: true, get: function () { return tfidf_engine_1.buildCorpus; } });
+Object.defineProperty(exports, "searchCorpus", { enumerable: true, get: function () { return tfidf_engine_1.searchCorpus; } });
+Object.defineProperty(exports, "computeIDF", { enumerable: true, get: function () { return tfidf_engine_1.computeIDF; } });
+Object.defineProperty(exports, "upsertDocumentInCorpus", { enumerable: true, get: function () { return tfidf_engine_1.upsertDocumentInCorpus; } });
+Object.defineProperty(exports, "removeDocumentFromCorpus", { enumerable: true, get: function () { return tfidf_engine_1.removeDocumentFromCorpus; } });
+var vector_store_1 = require("./vector-store");
+// High-level vector store (persists to .neurcode/semantic-index.json)
+Object.defineProperty(exports, "buildSemanticIndex", { enumerable: true, get: function () { return vector_store_1.buildSemanticIndex; } });
+Object.defineProperty(exports, "semanticSearch", { enumerable: true, get: function () { return vector_store_1.semanticSearch; } });
+Object.defineProperty(exports, "upsertFileInIndex", { enumerable: true, get: function () { return vector_store_1.upsertFileInIndex; } });
+Object.defineProperty(exports, "removeFileFromIndex", { enumerable: true, get: function () { return vector_store_1.removeFileFromIndex; } });
+Object.defineProperty(exports, "getSemanticIndexStats", { enumerable: true, get: function () { return vector_store_1.getSemanticIndexStats; } });
+Object.defineProperty(exports, "clearSemanticIndex", { enumerable: true, get: function () { return vector_store_1.clearSemanticIndex; } });
+Object.defineProperty(exports, "explainQuery", { enumerable: true, get: function () { return vector_store_1.explainQuery; } });
+//# sourceMappingURL=index.js.map

package/dist/semantic/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/semantic/index.ts"],"names":[],"mappings":";AAAA;;;;;;;;GAQG;;;AAEH,+CAQwB;AAPtB,wDAAwD;AACxD,wGAAA,QAAQ,OAAA;AACR,2GAAA,WAAW,OAAA;AACX,4GAAA,YAAY,OAAA;AACZ,0GAAA,UAAU,OAAA;AACV,sHAAA,sBAAsB,OAAA;AACtB,wHAAA,wBAAwB,OAAA;AAY1B,+CASwB;AARtB,sEAAsE;AACtE,kHAAA,kBAAkB,OAAA;AAClB,8GAAA,cAAc,OAAA;AACd,iHAAA,iBAAiB,OAAA;AACjB,mHAAA,mBAAmB,OAAA;AACnB,qHAAA,qBAAqB,OAAA;AACrB,kHAAA,kBAAkB,OAAA;AAClB,4GAAA,YAAY,OAAA"}

package/dist/semantic/tfidf-engine.d.ts

@@ -0,0 +1,81 @@
+/**
+ * TF-IDF Semantic Engine — fully deterministic, zero external dependencies.
+ *
+ * Implements the classic TF-IDF (Term Frequency × Inverse Document Frequency)
+ * information-retrieval model with cosine similarity ranking.
+ *
+ * Why this over raw keyword matching:
+ *  - Weights rare/distinctive terms higher (IDF) than common ones
+ *  - File-length normalised (TF prevents long files dominating)
+ *  - Cosine similarity handles partial matches gracefully
+ *  - Identical results every run — fully deterministic, no LLM required
+ *  - Upgradeable: the same SparseVector type works with real embeddings later
+ *
+ * Algorithm:
+ *  TF(t, d)   = log(1 + freq(t, d) / |d|)
+ *  IDF(t, D)  = log((|D| + 1) / (df(t) + 1)) + 1   [smoothed]
+ *  weight     = TF × IDF
+ *  similarity = cosine(vec_query, vec_doc)
+ */
+/** Sparse vector: termId → TF-IDF weight.  Keys are term strings, not integers. */
+export type SparseVector = Map<string, number>;
+export interface TfIdfDocument {
+    id: string;
+    text: string;
+    metadata?: Record<string, unknown>;
+}
+export interface TfIdfSearchResult {
+    id: string;
+    score: number;
+    metadata?: Record<string, unknown>;
+}
+/** Serialisable form of SparseVector (for JSON persistence). */
+export type SparseVectorRecord = Record<string, number>;
+export interface TfIdfIndexEntry {
+    id: string;
+    vector: SparseVectorRecord;
+    norm: number;
+    termCount: number;
+    metadata?: Record<string, unknown>;
+}
+export interface TfIdfCorpus {
+    schemaVersion: 1;
+    builtAt: string;
+    documentCount: number;
+    /** term → document-frequency (how many docs contain it) */
+    df: Record<string, number>;
+    entries: TfIdfIndexEntry[];
+}
+/**
+ * Tokenises source text into normalised terms.
+ * Splits on: whitespace, punctuation, camelCase, PascalCase, snake_case.
+ */
+export declare function tokenize(text: string): string[];
+/**
+ * Computes smoothed IDF for every term in the vocabulary.
+ * IDF(t) = log((N + 1) / (df(t) + 1)) + 1
+ */
+export declare function computeIDF(df: Record<string, number>, N: number): Map<string, number>;
+export declare function buildCorpus(documents: TfIdfDocument[]): TfIdfCorpus;
+/**
+ * Vectorises a query using the corpus IDF weights, then ranks documents
+ * by cosine similarity.
+ *
+ * Returns results sorted descending by score, filtered by minScore.
+ */
+export declare function searchCorpus(query: string, corpus: TfIdfCorpus, options?: {
+    limit?: number;
+    minScore?: number;
+}): TfIdfSearchResult[];
+/**
+ * Adds or replaces a single document in an existing corpus.
+ * DF is updated incrementally to avoid full rebuilds on every watch change.
+ * Note: IDF values become slightly approximate after incremental updates;
+ * a full rebuild is recommended periodically (e.g. on `neurcode brain build`).
+ */
+export declare function upsertDocumentInCorpus(corpus: TfIdfCorpus, doc: TfIdfDocument): TfIdfCorpus;
+/**
+ * Removes a document from the corpus.
+ */
+export declare function removeDocumentFromCorpus(corpus: TfIdfCorpus, docId: string): TfIdfCorpus;
+//# sourceMappingURL=tfidf-engine.d.ts.map

package/dist/semantic/tfidf-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf-engine.d.ts","sourceRoot":"","sources":["../../src/semantic/tfidf-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,mFAAmF;AACnF,MAAM,MAAM,YAAY,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAE/C,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,gEAAgE;AAChE,MAAM,MAAM,kBAAkB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAExD,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,kBAAkB,CAAC;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,WAAW;IAC1B,aAAa,EAAE,CAAC,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,2DAA2D;IAC3D,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC3B,OAAO,EAAE,eAAe,EAAE,CAAC;CAC5B;AA2BD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAa/C;AAyBD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAMrF;AAID,wBAAgB,WAAW,CAAC,SAAS,EAAE,aAAa,EAAE,GAAG,WAAW,CAuDnE;AAID;;;;;GAKG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,WAAW,EACnB,OAAO,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GAClD,iBAAiB,EAAE,CA8CrB;AAID;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,WAAW,EACnB,GAAG,EAAE,aAAa,GACjB,WAAW,CAiEb;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,WAAW,EACnB,KAAK,EAAE,MAAM,GACZ,WAAW,CAoBb"}

package/dist/semantic/tfidf-engine.js

@@ -0,0 +1,278 @@
+"use strict";
+/**
+ * TF-IDF Semantic Engine — fully deterministic, zero external dependencies.
+ *
+ * Implements the classic TF-IDF (Term Frequency × Inverse Document Frequency)
+ * information-retrieval model with cosine similarity ranking.
+ *
+ * Why this over raw keyword matching:
+ *  - Weights rare/distinctive terms higher (IDF) than common ones
+ *  - File-length normalised (TF prevents long files dominating)
+ *  - Cosine similarity handles partial matches gracefully
+ *  - Identical results every run — fully deterministic, no LLM required
+ *  - Upgradeable: the same SparseVector type works with real embeddings later
+ *
+ * Algorithm:
+ *  TF(t, d)   = log(1 + freq(t, d) / |d|)
+ *  IDF(t, D)  = log((|D| + 1) / (df(t) + 1)) + 1   [smoothed]
+ *  weight     = TF × IDF
+ *  similarity = cosine(vec_query, vec_doc)
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tokenize = tokenize;
+exports.computeIDF = computeIDF;
+exports.buildCorpus = buildCorpus;
+exports.searchCorpus = searchCorpus;
+exports.upsertDocumentInCorpus = upsertDocumentInCorpus;
+exports.removeDocumentFromCorpus = removeDocumentFromCorpus;
+// ── Constants ──────────────────────────────────────────────────────────────────
+/** Terms shorter than this are discarded. */
+const MIN_TERM_LEN = 2;
+/** Max distinct terms stored per document (cap to control memory). */
+const MAX_TERMS_PER_DOC = 400;
+/**
+ * Stop-words that carry no semantic signal for code search.
+ * Keep this tight — over-pruning hurts recall.
+ */
+const STOP_WORDS = new Set([
+    'the', 'and', 'for', 'are', 'was', 'were', 'has', 'have', 'had',
+    'not', 'but', 'with', 'from', 'this', 'that', 'they', 'their',
+    'its', 'also', 'will', 'can', 'may', 'would', 'could', 'should',
+    'into', 'out', 'any', 'all', 'one', 'two', 'new', 'use', 'used',
+    'var', 'let', 'const', 'type', 'interface', 'class', 'function',
+    'return', 'import', 'export', 'from', 'default', 'async', 'await',
+    'true', 'false', 'null', 'undefined', 'void', 'string', 'number',
+    'boolean', 'object', 'array', 'promise', 'error', 'extends', 'implements',
+]);
+// ── Tokenisation ───────────────────────────────────────────────────────────────
+/**
+ * Tokenises source text into normalised terms.
+ * Splits on: whitespace, punctuation, camelCase, PascalCase, snake_case.
+ */
+function tokenize(text) {
+    if (!text)
+        return [];
+    // Split camelCase / PascalCase into sub-words: getUserById → get User By Id
+    const camelSplit = text.replace(/([a-z])([A-Z])/g, '$1 $2')
+        .replace(/([A-Z]+)([A-Z][a-z])/g, '$1 $2');
+    const tokens = camelSplit
+        .toLowerCase()
+        .split(/[\s\W_]+/) // split on whitespace, punctuation, underscores
+        .filter((t) => t.length >= MIN_TERM_LEN && !STOP_WORDS.has(t));
+    return tokens;
+}
+// ── TF computation ─────────────────────────────────────────────────────────────
+/**
+ * Returns a term-frequency map for a single document.
+ * Uses log-normalised TF: log(1 + count / doc_length)
+ */
+function computeTF(tokens) {
+    const freq = new Map();
+    for (const token of tokens) {
+        freq.set(token, (freq.get(token) ?? 0) + 1);
+    }
+    const docLen = Math.max(1, tokens.length);
+    const tf = new Map();
+    for (const [term, count] of freq) {
+        tf.set(term, Math.log(1 + count / docLen));
+    }
+    return tf;
+}
+// ── IDF computation ────────────────────────────────────────────────────────────
+/**
+ * Computes smoothed IDF for every term in the vocabulary.
+ * IDF(t) = log((N + 1) / (df(t) + 1)) + 1
+ */
+function computeIDF(df, N) {
+    const idf = new Map();
+    for (const [term, docFreq] of Object.entries(df)) {
+        idf.set(term, Math.log((N + 1) / (docFreq + 1)) + 1);
+    }
+    return idf;
+}
+// ── Corpus building ────────────────────────────────────────────────────────────
+function buildCorpus(documents) {
+    const N = documents.length;
+    // Pass 1: collect per-document token lists and global DF
+    const docTokens = [];
+    const df = {};
+    for (const doc of documents) {
+        const tokens = tokenize(doc.text);
+        docTokens.push({ id: doc.id, tokens, metadata: doc.metadata });
+        // Each unique term contributes 1 to DF
+        const unique = new Set(tokens);
+        for (const term of unique) {
+            df[term] = (df[term] ?? 0) + 1;
+        }
+    }
+    const idf = computeIDF(df, N);
+    // Pass 2: compute TF-IDF vectors and norms
+    const entries = [];
+    for (const { id, tokens, metadata } of docTokens) {
+        const tf = computeTF(tokens);
+        // Build sparse TF-IDF vector, capped at MAX_TERMS_PER_DOC by weight
+        const weightedTerms = [];
+        for (const [term, tfVal] of tf) {
+            const idfVal = idf.get(term) ?? 1;
+            weightedTerms.push([term, tfVal * idfVal]);
+        }
+        // Sort by weight descending and keep top MAX_TERMS_PER_DOC
+        weightedTerms.sort((a, b) => b[1] - a[1]);
+        const topTerms = weightedTerms.slice(0, MAX_TERMS_PER_DOC);
+        const vector = {};
+        let normSq = 0;
+        for (const [term, weight] of topTerms) {
+            vector[term] = weight;
+            normSq += weight * weight;
+        }
+        const norm = Math.sqrt(normSq);
+        entries.push({ id, vector, norm, termCount: topTerms.length, metadata });
+    }
+    return {
+        schemaVersion: 1,
+        builtAt: new Date().toISOString(),
+        documentCount: N,
+        df,
+        entries,
+    };
+}
+// ── Search ─────────────────────────────────────────────────────────────────────
+/**
+ * Vectorises a query using the corpus IDF weights, then ranks documents
+ * by cosine similarity.
+ *
+ * Returns results sorted descending by score, filtered by minScore.
+ */
+function searchCorpus(query, corpus, options = {}) {
+    const limit = Math.max(1, options.limit ?? 20);
+    const minScore = Math.max(0, options.minScore ?? 0.01);
+    const N = Math.max(1, corpus.documentCount);
+    const idf = computeIDF(corpus.df, N);
+    const queryTokens = tokenize(query);
+    if (queryTokens.length === 0)
+        return [];
+    // Build query TF-IDF vector
+    const queryTF = computeTF(queryTokens);
+    const queryVec = new Map();
+    let queryNormSq = 0;
+    for (const [term, tfVal] of queryTF) {
+        const idfVal = idf.get(term) ?? (Math.log((N + 1) / 1) + 1); // IDF for unseen term
+        const weight = tfVal * idfVal;
+        queryVec.set(term, weight);
+        queryNormSq += weight * weight;
+    }
+    const queryNorm = Math.sqrt(queryNormSq);
+    if (queryNorm === 0)
+        return [];
+    // Score each document
+    const scored = [];
+    for (const entry of corpus.entries) {
+        if (entry.norm === 0)
+            continue;
+        // Dot product of query and document sparse vectors
+        let dot = 0;
+        for (const [term, qWeight] of queryVec) {
+            const dWeight = entry.vector[term];
+            if (dWeight !== undefined) {
+                dot += qWeight * dWeight;
+            }
+        }
+        const cosine = dot / (queryNorm * entry.norm);
+        if (cosine >= minScore) {
+            scored.push({ id: entry.id, score: cosine, metadata: entry.metadata });
+        }
+    }
+    return scored
+        .sort((a, b) => b.score - a.score)
+        .slice(0, limit);
+}
+// ── Incremental update helpers ─────────────────────────────────────────────────
+/**
+ * Adds or replaces a single document in an existing corpus.
+ * DF is updated incrementally to avoid full rebuilds on every watch change.
+ * Note: IDF values become slightly approximate after incremental updates;
+ * a full rebuild is recommended periodically (e.g. on `neurcode brain build`).
+ */
+function upsertDocumentInCorpus(corpus, doc) {
+    const existingIdx = corpus.entries.findIndex((e) => e.id === doc.id);
+    // If replacing, first remove old DF contributions
+    const dfMutable = { ...corpus.df };
+    let N = corpus.documentCount;
+    if (existingIdx !== -1) {
+        const old = corpus.entries[existingIdx];
+        for (const term of Object.keys(old.vector)) {
+            if (dfMutable[term] !== undefined) {
+                dfMutable[term] -= 1;
+                if (dfMutable[term] <= 0)
+                    delete dfMutable[term];
+            }
+        }
+    }
+    else {
+        N += 1;
+    }
+    // Add new DF contributions
+    const tokens = tokenize(doc.text);
+    const unique = new Set(tokens);
+    for (const term of unique) {
+        dfMutable[term] = (dfMutable[term] ?? 0) + 1;
+    }
+    const idf = computeIDF(dfMutable, N);
+    const tf = computeTF(tokens);
+    const weightedTerms = [];
+    for (const [term, tfVal] of tf) {
+        const idfVal = idf.get(term) ?? 1;
+        weightedTerms.push([term, tfVal * idfVal]);
+    }
+    weightedTerms.sort((a, b) => b[1] - a[1]);
+    const topTerms = weightedTerms.slice(0, MAX_TERMS_PER_DOC);
+    const vector = {};
+    let normSq = 0;
+    for (const [term, weight] of topTerms) {
+        vector[term] = weight;
+        normSq += weight * weight;
+    }
+    const norm = Math.sqrt(normSq);
+    const newEntry = {
+        id: doc.id,
+        vector,
+        norm,
+        termCount: topTerms.length,
+        metadata: doc.metadata,
+    };
+    const newEntries = existingIdx !== -1
+        ? corpus.entries.map((e, i) => (i === existingIdx ? newEntry : e))
+        : [...corpus.entries, newEntry];
+    return {
+        schemaVersion: 1,
+        builtAt: new Date().toISOString(),
+        documentCount: N,
+        df: dfMutable,
+        entries: newEntries,
+    };
+}
+/**
+ * Removes a document from the corpus.
+ */
+function removeDocumentFromCorpus(corpus, docId) {
+    const existingIdx = corpus.entries.findIndex((e) => e.id === docId);
+    if (existingIdx === -1)
+        return corpus;
+    const dfMutable = { ...corpus.df };
+    const old = corpus.entries[existingIdx];
+    for (const term of Object.keys(old.vector)) {
+        if (dfMutable[term] !== undefined) {
+            dfMutable[term] -= 1;
+            if (dfMutable[term] <= 0)
+                delete dfMutable[term];
+        }
+    }
+    return {
+        schemaVersion: 1,
+        builtAt: new Date().toISOString(),
+        documentCount: corpus.documentCount - 1,
+        df: dfMutable,
+        entries: corpus.entries.filter((_, i) => i !== existingIdx),
+    };
+}
+//# sourceMappingURL=tfidf-engine.js.map

package/dist/semantic/tfidf-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf-engine.js","sourceRoot":"","sources":["../../src/semantic/tfidf-engine.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;AAoEH,4BAaC;AA6BD,gCAMC;AAID,kCAuDC;AAUD,oCAkDC;AAUD,wDAoEC;AAKD,4DAuBC;AA9SD,kFAAkF;AAElF,6CAA6C;AAC7C,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,sEAAsE;AACtE,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B;;;GAGG;AACH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;IAC/D,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IAC7D,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ;IAC/D,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IAC/D,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU;IAC/D,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO;IACjE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ;IAChE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY;CAC1E,CAAC,CAAC;AAEH,kFAAkF;AAElF;;;GAGG;AACH,SAAgB,QAAQ,CAAC,IAAY;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,4EAA4E;IAC5E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC;SACnC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC,CAAC;IAElE,MAAM,MAAM,GAAG,UAAU;SACtB,WAAW,EAAE;SACb,KAAK,CAAC,UAAU,CAAC,CAAQ,gDAAgD;SACzE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,YAAY,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjE,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,kFAAkF;AAElF;;;GAGG;AACH,SAAS,SAAS,CAAC,MAAgB;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;QACjC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,kFAAkF;AAElF;;;GAGG;AACH,SAAgB,UAAU,CAAC,EAA0B,EAAE,CAAS;IAC9D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QACjD,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kFAAkF;AAElF,SAAgB,WAAW,CAAC,SAA0B;IACpD,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAE3B,yDAAyD;IACzD,MAAM,SAAS,GAAgF,EAAE,CAAC;IAClG,MAAM,EAAE,GAA2B,EAAE,CAAC;IAEtC,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE/D,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE9B,2CAA2C;IAC3C,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;QACjD,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QAE7B,oEAAoE;QACpE,MAAM,aAAa,GAA4B,EAAE,CAAC;QAClD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,2DAA2D;QAC3D,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAE3D,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;YACtB,MAAM,IAAI,MAAM,GAAG,MAAM,CAAC;QAC5B,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE/B,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,OAAO;QACL,aAAa,EAAE,CAAC;QAChB,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,aAAa,EAAE,CAAC;QAChB,EAAE;QACF,OAAO;KACR,CAAC;AACJ,CAAC;AAED,kFAAkF;AAElF;;;;;GAKG;AACH,SAAgB,YAAY,CAC1B,KAAa,EACb,MAAmB,EACnB,UAAiD,EAAE;IAEnD,MAAM,KAAK,GAAM,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,IAAO,EAAE,CAAC,CAAC;IACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;IAEvD,MAAM,CAAC,GAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;IAC7C,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAErC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,4BAA4B;IAC5B,MAAM,OAAO,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,sBAAsB;QACnF,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;QAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC3B,WAAW,IAAI,MAAM,GAAG,MAAM,CAAC;IACjC,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACzC,IAAI,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE/B,sBAAsB;IACtB,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACnC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QAE/B,mDAAmD;QACnD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,GAAG,IAAI,OAAO,GAAG,OAAO,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,MAAM,IAAI,QAAQ,EAAE,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IAED,OAAO,MAAM;SACV,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,kFAAkF;AAElF;;;;;GAKG;AACH,SAAgB,sBAAsB,CACpC,MAAmB,EACnB,GAAkB;IAElB,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;IAErE,kDAAkD;IAClD,MAAM,SAAS,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC;IACnC,IAAI,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC;IAE7B,IAAI,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;QACvB,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBAClC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IAED,2BAA2B;IAC3B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,GAAG,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACrC,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IAE7B,MAAM,aAAa,GAA4B,EAAE,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAE3D,MAAM,MAAM,GAAuB,EAAE,CAAC;IACtC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACtC,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;QACtB,MAAM,IAAI,MAAM,GAAG,MAAM,CAAC;IAC5B,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAE/B,MAAM,QAAQ,GAAoB;QAChC,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,MAAM;QACN,IAAI;QACJ,SAAS,EAAE,QAAQ,CAAC,MAAM;QAC1B,QAAQ,EAAE,GAAG,CAAC,QAAQ;KACvB,CAAC;IAEF,MAAM,UAAU,GACd,WAAW,KAAK,CAAC,CAAC;QAChB,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEpC,OAAO;QACL,aAAa,EAAE,CAAC;QAChB,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,aAAa,EAAE,CAAC;QAChB,EAAE,EAAE,SAAS;QACb,OAAO,EAAE,UAAU;KACpB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAgB,wBAAwB,CACtC,MAAmB,EACnB,KAAa;IAEb,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC;IACpE,IAAI,WAAW,KAAK,CAAC,CAAC;QAAE,OAAO,MAAM,CAAC;IAEtC,MAAM,SAAS,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC;IACnC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3C,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAClC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,OAAO;QACL,aAAa,EAAE,CAAC;QAChB,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,aAAa,EAAE,MAAM,CAAC,aAAa,GAAG,CAAC;QACvC,EAAE,EAAE,SAAS;QACb,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,WAAW,CAAC;KAC5D,CAAC;AACJ,CAAC"}

package/dist/semantic/vector-store.d.ts

@@ -0,0 +1,108 @@
+/**
+ * Persistent Semantic Vector Store
+ *
+ * Manages a TF-IDF index over the project's brain-context file entries.
+ * Stored at: .neurcode/semantic-index.json
+ *
+ * Design principles:
+ *  - Built FROM the existing brain-context.json — no new scanning required
+ *  - Incremental updates on file changes (watch events)
+ *  - Atomic writes (tmp → rename) to prevent corruption
+ *  - Schema versioned for safe migrations
+ *  - Completely offline, zero API calls, zero latency cost
+ *
+ * Usage:
+ *   buildSemanticIndex(cwd, scope)   — full rebuild from brain context
+ *   semanticSearch(cwd, scope, query) — search the index
+ *   upsertFileInIndex(cwd, scope, filePath, content) — incremental update
+ */
+import { TfIdfSearchResult } from './tfidf-engine';
+export interface SemanticIndexScope {
+    orgId: string | null;
+    projectId: string | null;
+}
+export interface SemanticRetrievalConfidence {
+    /** Normalized TF-IDF score for this hit (not cross-corpus calibrated). */
+    retrievalScore: number;
+    /** Estimated share of brain-context docs that entered the index (0–1). */
+    corpusCoverageRatio: number;
+    /** True when indexing stopped at MAX_INDEX_DOCS. */
+    indexTruncated: boolean;
+    documentsIndexed: number;
+    documentsCap: number;
+    /** Deterministic TF-IDF retrieval — reproducible given same index + query. */
+    retrievalMethod: 'deterministic-tfidf';
+}
+export interface SemanticSearchResult extends TfIdfSearchResult {
+    filePath: string;
+    language: string;
+    summary: string;
+    symbols: string[];
+    contentHash: string;
+    confidence: SemanticRetrievalConfidence;
+    explainability: {
+        retrievalCategory: 'deterministic-semantic';
+        includedBecause: string;
+        matchedTerms: string[];
+        retrievalPath: string[];
+        federationSource: 'local-repo-index';
+        truncationStatus: 'none' | 'index-truncated';
+    };
+}
+export interface SemanticIndexStats {
+    exists: boolean;
+    documentCount: number;
+    builtAt: string | null;
+    schemaVersion: number | null;
+    sizeBytes: number | null;
+}
+/**
+ * Builds a full semantic index from the current brain-context entries.
+ * Should be called after `neurcode brain build` or equivalent full refresh.
+ *
+ * Returns: number of documents indexed.
+ */
+export declare function buildSemanticIndex(cwd: string, scope: SemanticIndexScope): number;
+/**
+ * Searches the semantic index.
+ *
+ * Falls back gracefully to an empty result if no index exists (never throws).
+ */
+export declare function semanticSearch(cwd: string, scope: SemanticIndexScope, query: string, options?: {
+    limit?: number;
+    minScore?: number;
+}): SemanticSearchResult[];
+/**
+ * Incrementally adds or updates a single file in the semantic index.
+ * Called by the watch daemon on file changes.
+ *
+ * `content` is the raw file content to vectorize.
+ * If the content hash matches what's already indexed, this is a no-op.
+ */
+export declare function upsertFileInIndex(cwd: string, scope: SemanticIndexScope, filePath: string, content: string, metadata?: {
+    language?: string;
+    summary?: string;
+    symbols?: string[];
+}): boolean;
+/**
+ * Removes a file from the semantic index.
+ * Called by the watch daemon on file deletions.
+ */
+export declare function removeFileFromIndex(cwd: string, scope: SemanticIndexScope, filePath: string): boolean;
+/**
+ * Returns metadata about the current index without loading the full corpus.
+ */
+export declare function getSemanticIndexStats(cwd: string, scope: SemanticIndexScope): SemanticIndexStats;
+/**
+ * Deletes the semantic index file for this workspace.
+ * Called by `neurcode brain clear`.
+ */
+export declare function clearSemanticIndex(cwd: string): boolean;
+/**
+ * Returns the query's tokenized representation for debugging/transparency.
+ */
+export declare function explainQuery(query: string): {
+    tokens: string[];
+    termCount: number;
+};
+//# sourceMappingURL=vector-store.d.ts.map

package/dist/semantic/vector-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-store.d.ts","sourceRoot":"","sources":["../../src/semantic/vector-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAKH,OAAO,EAML,iBAAiB,EAGlB,MAAM,gBAAgB,CAAC;AAIxB,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AAED,MAAM,WAAW,2BAA2B;IAC1C,0EAA0E;IAC1E,cAAc,EAAE,MAAM,CAAC;IACvB,0EAA0E;IAC1E,mBAAmB,EAAE,MAAM,CAAC;IAC5B,oDAAoD;IACpD,cAAc,EAAE,OAAO,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,8EAA8E;IAC9E,eAAe,EAAE,qBAAqB,CAAC;CACxC;AAED,MAAM,WAAW,oBAAqB,SAAQ,iBAAiB;IAC7D,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,2BAA2B,CAAC;IACxC,cAAc,EAAE;QACd,iBAAiB,EAAE,wBAAwB,CAAC;QAC5C,eAAe,EAAE,MAAM,CAAC;QACxB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,aAAa,EAAE,MAAM,EAAE,CAAC;QACxB,gBAAgB,EAAE,kBAAkB,CAAC;QACrC,gBAAgB,EAAE,MAAM,GAAG,iBAAiB,CAAC;KAC9C,CAAC;CACH;AAED,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,OAAO,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B;AA2JD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,GACxB,MAAM,CAoBR;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,EACzB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAO,GAClD,oBAAoB,EAAE,CA+CxB;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,QAAQ,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,GACrE,OAAO,CAqCT;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,MAAM,GACf,OAAO,CAgBT;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,kBAAkB,GACxB,kBAAkB,CAmBpB;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAUvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG;IAC3C,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB,CAGA"}