@danielsimonjr/memoryjs 1.0.0 → 1.2.0

package/dist/search/TFIDFIndexManager.js

@@ -1,433 +0,0 @@
-/**
- * TF-IDF Index Manager
- *
- * Manages pre-calculated TF-IDF indexes for fast ranked search.
- * Handles index building, incremental updates, and persistence.
- *
- * @module search/TFIDFIndexManager
- */
-import * as fs from 'fs/promises';
-import * as path from 'path';
-import { calculateIDFFromTokenSets, tokenize } from '../utils/index.js';
-const INDEX_VERSION = '1.0';
-const INDEX_FILENAME = 'tfidf-index.json';
-/**
- * Manages TF-IDF index lifecycle: building, updating, and persistence.
- */
-export class TFIDFIndexManager {
-    indexPath;
-    index = null;
-    constructor(storageDir) {
-        this.indexPath = path.join(storageDir, '.indexes', INDEX_FILENAME);
-    }
-    /**
-     * Build a complete TF-IDF index from a knowledge graph.
-     *
-     * @param graph - Knowledge graph to index
-     * @returns Newly built TF-IDF index
-     */
-    async buildIndex(graph) {
-        const documents = new Map();
-        const allTokenSets = [];
-        // Build document vectors - tokenize once per document
-        for (const entity of graph.entities) {
-            const documentText = [
-                entity.name,
-                entity.entityType,
-                ...entity.observations,
-            ].join(' ');
-            const tokens = tokenize(documentText);
-            const tokenSet = new Set(tokens);
-            allTokenSets.push(tokenSet);
-            // Calculate term frequencies
-            const termFreq = {};
-            for (const term of tokens) {
-                termFreq[term] = (termFreq[term] || 0) + 1;
-            }
-            documents.set(entity.name, {
-                entityName: entity.name,
-                terms: termFreq,
-                documentText,
-            });
-        }
-        // Calculate IDF for all terms using pre-tokenized sets (O(1) lookup per document)
-        const idf = new Map();
-        const allTerms = new Set(allTokenSets.flatMap(s => Array.from(s)));
-        for (const term of allTerms) {
-            const idfScore = calculateIDFFromTokenSets(term, allTokenSets);
-            idf.set(term, idfScore);
-        }
-        this.index = {
-            version: INDEX_VERSION,
-            lastUpdated: new Date().toISOString(),
-            documents,
-            idf,
-        };
-        return this.index;
-    }
-    /**
-     * Update the index incrementally when entities change.
-     *
-     * More efficient than rebuilding the entire index.
-     *
-     * @param graph - Updated knowledge graph
-     * @param changedEntityNames - Names of entities that changed
-     */
-    async updateIndex(graph, changedEntityNames) {
-        if (!this.index) {
-            // No existing index, build from scratch
-            return this.buildIndex(graph);
-        }
-        // Rebuild document vectors for changed entities
-        const allTokenSets = [];
-        const updatedDocuments = new Map(this.index.documents);
-        // Remove deleted entities
-        for (const entityName of changedEntityNames) {
-            const entity = graph.entities.find(e => e.name === entityName);
-            if (!entity) {
-                updatedDocuments.delete(entityName);
-            }
-        }
-        // Update/add changed entities - tokenize once per document
-        for (const entity of graph.entities) {
-            const documentText = [
-                entity.name,
-                entity.entityType,
-                ...entity.observations,
-            ].join(' ');
-            const tokens = tokenize(documentText);
-            const tokenSet = new Set(tokens);
-            allTokenSets.push(tokenSet);
-            if (changedEntityNames.has(entity.name)) {
-                // Calculate term frequencies for changed entity
-                const termFreq = {};
-                for (const term of tokens) {
-                    termFreq[term] = (termFreq[term] || 0) + 1;
-                }
-                updatedDocuments.set(entity.name, {
-                    entityName: entity.name,
-                    terms: termFreq,
-                    documentText,
-                });
-            }
-        }
-        // Recalculate IDF using pre-tokenized sets (O(1) lookup per document)
-        const idf = new Map();
-        const allTerms = new Set(allTokenSets.flatMap(s => Array.from(s)));
-        for (const term of allTerms) {
-            const idfScore = calculateIDFFromTokenSets(term, allTokenSets);
-            idf.set(term, idfScore);
-        }
-        this.index = {
-            version: INDEX_VERSION,
-            lastUpdated: new Date().toISOString(),
-            documents: updatedDocuments,
-            idf,
-        };
-        return this.index;
-    }
-    /**
-     * Load index from disk.
-     *
-     * @returns Loaded index or null if not found
-     */
-    async loadIndex() {
-        try {
-            const data = await fs.readFile(this.indexPath, 'utf-8');
-            const serialized = JSON.parse(data);
-            this.index = {
-                version: serialized.version,
-                lastUpdated: serialized.lastUpdated,
-                documents: new Map(serialized.documents),
-                idf: new Map(serialized.idf),
-            };
-            return this.index;
-        }
-        catch (error) {
-            // Index doesn't exist or is invalid
-            return null;
-        }
-    }
-    /**
-     * Save index to disk.
-     *
-     * @param index - Index to save (uses cached index if not provided)
-     */
-    async saveIndex(index) {
-        const indexToSave = index || this.index;
-        if (!indexToSave) {
-            throw new Error('No index to save');
-        }
-        // Ensure index directory exists
-        const indexDir = path.dirname(this.indexPath);
-        await fs.mkdir(indexDir, { recursive: true });
-        // Serialize Map objects to arrays for JSON
-        const serialized = {
-            version: indexToSave.version,
-            lastUpdated: indexToSave.lastUpdated,
-            documents: Array.from(indexToSave.documents.entries()),
-            idf: Array.from(indexToSave.idf.entries()),
-        };
-        await fs.writeFile(this.indexPath, JSON.stringify(serialized, null, 2), 'utf-8');
-    }
-    /**
-     * Get the current cached index.
-     *
-     * @returns Cached index or null if not loaded
-     */
-    getIndex() {
-        return this.index;
-    }
-    /**
-     * Clear the cached index and delete from disk.
-     */
-    async clearIndex() {
-        this.index = null;
-        try {
-            await fs.unlink(this.indexPath);
-        }
-        catch {
-            // Index file doesn't exist, nothing to delete
-        }
-    }
-    /**
-     * Check if the index needs rebuilding based on graph state.
-     *
-     * @param graph - Current knowledge graph
-     * @returns True if index should be rebuilt
-     */
-    needsRebuild(graph) {
-        if (!this.index) {
-            return true;
-        }
-        // Check if entity count matches
-        if (this.index.documents.size !== graph.entities.length) {
-            return true;
-        }
-        // Check if all entities are in index
-        for (const entity of graph.entities) {
-            if (!this.index.documents.has(entity.name)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    // ==================== Phase 10 Sprint 3: Incremental Index Updates ====================
-    /**
-     * Phase 10 Sprint 3: Add a single document to the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity additions.
-     * Updates TF for the new document and recalculates IDF for affected terms.
-     *
-     * @param entity - The entity to add
-     *
-     * @example
-     * ```typescript
-     * const indexManager = new TFIDFIndexManager('/data');
-     * await indexManager.loadIndex();
-     *
-     * // Add new entity
-     * indexManager.addDocument({
-     *   name: 'NewEntity',
-     *   entityType: 'person',
-     *   observations: ['Software engineer']
-     * });
-     * ```
-     */
-    addDocument(entity) {
-        if (!this.index) {
-            // Can't add to non-existent index
-            return;
-        }
-        // Build document text and tokens
-        const documentText = [entity.name, entity.entityType, ...entity.observations].join(' ');
-        const tokens = tokenize(documentText);
-        // Calculate term frequencies
-        const termFreq = {};
-        for (const term of tokens) {
-            termFreq[term] = (termFreq[term] || 0) + 1;
-        }
-        // Add to documents map
-        this.index.documents.set(entity.name, {
-            entityName: entity.name,
-            terms: termFreq,
-            documentText,
-        });
-        // Update IDF for ALL terms because N changed (total document count)
-        // IDF = log(N/df), and N has increased
-        this.recalculateAllIDF();
-        // Update timestamp
-        this.index.lastUpdated = new Date().toISOString();
-    }
-    /**
-     * Phase 10 Sprint 3: Remove a single document from the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity deletions.
-     * Recalculates IDF for terms that were in the removed document.
-     *
-     * @param entityName - Name of the entity to remove
-     *
-     * @example
-     * ```typescript
-     * indexManager.removeDocument('DeletedEntity');
-     * ```
-     */
-    removeDocument(entityName) {
-        if (!this.index) {
-            return;
-        }
-        const document = this.index.documents.get(entityName);
-        if (!document) {
-            return;
-        }
-        // Remove from documents map
-        this.index.documents.delete(entityName);
-        // Update IDF for ALL terms because N changed (total document count)
-        // IDF = log(N/df), and N has decreased
-        this.recalculateAllIDF();
-        // Update timestamp
-        this.index.lastUpdated = new Date().toISOString();
-    }
-    /**
-     * Phase 10 Sprint 3: Update a single document in the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity updates.
-     * Handles both term changes and observation updates.
-     *
-     * @param entity - The updated entity
-     *
-     * @example
-     * ```typescript
-     * indexManager.updateDocument({
-     *   name: 'ExistingEntity',
-     *   entityType: 'person',
-     *   observations: ['Updated observations']
-     * });
-     * ```
-     */
-    updateDocument(entity) {
-        if (!this.index) {
-            return;
-        }
-        const oldDocument = this.index.documents.get(entity.name);
-        const oldTerms = oldDocument ? new Set(Object.keys(oldDocument.terms)) : new Set();
-        // Build new document
-        const documentText = [entity.name, entity.entityType, ...entity.observations].join(' ');
-        const tokens = tokenize(documentText);
-        const newTerms = new Set(tokens);
-        // Calculate term frequencies
-        const termFreq = {};
-        for (const term of tokens) {
-            termFreq[term] = (termFreq[term] || 0) + 1;
-        }
-        // Update documents map
-        this.index.documents.set(entity.name, {
-            entityName: entity.name,
-            terms: termFreq,
-            documentText,
-        });
-        // Find terms that changed (added or removed)
-        const changedTerms = new Set();
-        for (const term of oldTerms) {
-            if (!newTerms.has(term)) {
-                changedTerms.add(term);
-            }
-        }
-        for (const term of newTerms) {
-            if (!oldTerms.has(term)) {
-                changedTerms.add(term);
-            }
-        }
-        // Recalculate IDF for changed terms
-        if (changedTerms.size > 0) {
-            this.recalculateIDFForTerms(changedTerms);
-        }
-        // Update timestamp
-        this.index.lastUpdated = new Date().toISOString();
-    }
-    /**
-     * Phase 10 Sprint 3: Recalculate IDF scores for a set of terms.
-     *
-     * @param terms - Set of terms to recalculate IDF for
-     * @private
-     */
-    recalculateIDFForTerms(terms) {
-        if (!this.index) {
-            return;
-        }
-        const totalDocs = this.index.documents.size;
-        if (totalDocs === 0) {
-            // No documents, clear all IDF for these terms
-            for (const term of terms) {
-                this.index.idf.delete(term);
-            }
-            return;
-        }
-        // Count documents containing each term
-        for (const term of terms) {
-            let docCount = 0;
-            for (const doc of this.index.documents.values()) {
-                if (term in doc.terms) {
-                    docCount++;
-                }
-            }
-            if (docCount > 0) {
-                // IDF = log(N / df) where N = total docs, df = doc frequency
-                const idfScore = Math.log(totalDocs / docCount);
-                this.index.idf.set(term, idfScore);
-            }
-            else {
-                // Term no longer exists in any document
-                this.index.idf.delete(term);
-            }
-        }
-    }
-    /**
-     * Phase 10 Sprint 3: Recalculate IDF scores for ALL terms in the index.
-     *
-     * Called when the total document count changes (add/remove document).
-     * @private
-     */
-    recalculateAllIDF() {
-        if (!this.index) {
-            return;
-        }
-        const totalDocs = this.index.documents.size;
-        if (totalDocs === 0) {
-            // No documents, clear all IDF
-            this.index.idf.clear();
-            return;
-        }
-        // Build term -> document count map
-        const termDocCounts = new Map();
-        for (const doc of this.index.documents.values()) {
-            for (const term of Object.keys(doc.terms)) {
-                termDocCounts.set(term, (termDocCounts.get(term) ?? 0) + 1);
-            }
-        }
-        // Clear old IDF and recalculate
-        this.index.idf.clear();
-        for (const [term, docCount] of termDocCounts) {
-            // IDF = log(N / df) where N = total docs, df = doc frequency
-            const idfScore = Math.log(totalDocs / docCount);
-            this.index.idf.set(term, idfScore);
-        }
-    }
-    /**
-     * Phase 10 Sprint 3: Check if the index is loaded/initialized.
-     *
-     * @returns True if index is available
-     */
-    isInitialized() {
-        return this.index !== null;
-    }
-    /**
-     * Phase 10 Sprint 3: Get the number of documents in the index.
-     *
-     * @returns Document count or 0 if not initialized
-     */
-    getDocumentCount() {
-        return this.index?.documents.size ?? 0;
-    }
-}
-//# sourceMappingURL=TFIDFIndexManager.js.map

package/dist/search/TFIDFIndexManager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TFIDFIndexManager.js","sourceRoot":"","sources":["../../src/search/TFIDFIndexManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,MAAM,aAAa,CAAC;AAClC,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,OAAO,EAAE,yBAAyB,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAExE,MAAM,aAAa,GAAG,KAAK,CAAC;AAC5B,MAAM,cAAc,GAAG,kBAAkB,CAAC;AAY1C;;GAEG;AACH,MAAM,OAAO,iBAAiB;IACpB,SAAS,CAAS;IAClB,KAAK,GAAsB,IAAI,CAAC;IAExC,YAAY,UAAkB;QAC5B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;IACrE,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,UAAU,CAAC,KAA6B;QAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAA0B,CAAC;QACpD,MAAM,YAAY,GAAkB,EAAE,CAAC;QAEvC,sDAAsD;QACtD,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG;gBACnB,MAAM,CAAC,IAAI;gBACX,MAAM,CAAC,UAAU;gBACjB,GAAG,MAAM,CAAC,YAAY;aACvB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAEZ,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;YACjC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAE5B,6BAA6B;YAC7B,MAAM,QAAQ,GAA2B,EAAE,CAAC;YAC5C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC7C,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;gBACzB,UAAU,EAAE,MAAM,CAAC,IAAI;gBACvB,KAAK,EAAE,QAAQ;gBACf,YAAY;aACb,CAAC,CAAC;QACL,CAAC;QAED,kFAAkF;QAClF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,yBAAyB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC/D,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,KAAK,GAAG;YACX,OAAO,EAAE,aAAa;YACtB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACrC,SAAS;YACT,GAAG;SACJ,CAAC;QAEF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,WAAW,CAAC,KAA6B,EAAE,kBAA+B;QAC9E,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,wCAAwC;YACxC,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QAED,gDAAgD;QAChD,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAEvD,0BAA0B;QAC1B,KAAK,MAAM,UAAU,IAAI,kBAAkB,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YAC/D,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG;gBACnB,MAAM,CAAC,IAAI;gBACX,MAAM,CAAC,UAAU;gBACjB,GAAG,MAAM,CAAC,YAAY;aACvB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAEZ,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;YACjC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAE5B,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,gDAAgD;gBAChD,MAAM,QAAQ,GAA2B,EAAE,CAAC;gBAC5C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;oBAC1B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC7C,CAAC;gBAED,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;oBAChC,UAAU,EAAE,MAAM,CAAC,IAAI;oBACvB,KAAK,EAAE,QAAQ;oBACf,YAAY;iBACb,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,yBAAyB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YAC/D,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,KAAK,GAAG;YACX,OAAO,EAAE,aAAa;YACtB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACrC,SAAS,EAAE,gBAAgB;YAC3B,GAAG;SACJ,CAAC;QAEF,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAS;QACb,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACxD,MAAM,UAAU,GAAyB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAE1D,IAAI,CAAC,KAAK,GAAG;gBACX,OAAO,EAAE,UAAU,CAAC,OAAO;gBAC3B,WAAW,EAAE,UAAU,CAAC,WAAW;gBACnC,SAAS,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;gBACxC,GAAG,EAAE,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;aAC7B,CAAC;YAEF,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,oCAAoC;YACpC,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAS,CAAC,KAAkB;QAChC,MAAM,WAAW,GAAG,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QACxC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;QACtC,CAAC;QAED,gCAAgC;QAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE9C,2CAA2C;QAC3C,MAAM,UAAU,GAAyB;YACvC,OAAO,EAAE,WAAW,CAAC,OAAO;YAC5B,WAAW,EAAE,WAAW,CAAC,WAAW;YACpC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YACtD,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;SAC3C,CAAC;QAEF,MAAM,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACnF,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC;YACH,MAAM,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,8CAA8C;QAChD,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,KAAqB;QAChC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,gCAAgC;QAChC,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,qCAAqC;QACrC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,yFAAyF;IAEzF;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,WAAW,CAAC,MAAoE;QAC9E,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,kCAAkC;YAClC,OAAO;QACT,CAAC;QAED,iCAAiC;QACjC,MAAM,YAAY,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxF,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;QAEtC,6BAA6B;QAC7B,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7C,CAAC;QAED,uBAAuB;QACvB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;YACpC,UAAU,EAAE,MAAM,CAAC,IAAI;YACvB,KAAK,EAAE,QAAQ;YACf,YAAY;SACb,CAAC,CAAC;QAEH,oEAAoE;QACpE,uCAAuC;QACvC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,mBAAmB;QACnB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,cAAc,CAAC,UAAkB;QAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO;QACT,CAAC;QAED,4BAA4B;QAC5B,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAExC,oEAAoE;QACpE,uCAAuC;QACvC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,mBAAmB;QACnB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,cAAc,CAAC,MAAoE;QACjF,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1D,MAAM,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAU,CAAC;QAE3F,qBAAqB;QACrB,MAAM,YAAY,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxF,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAEjC,6BAA6B;QAC7B,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7C,CAAC;QAED,uBAAuB;QACvB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE;YACpC,UAAU,EAAE,MAAM,CAAC,IAAI;YACvB,KAAK,EAAE,QAAQ;YACf,YAAY;SACb,CAAC,CAAC;QAEH,6CAA6C;QAC7C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC;QAED,mBAAmB;QACnB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACK,sBAAsB,CAAC,KAAkB;QAC/C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC;QAC5C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,8CAA8C;YAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO;QACT,CAAC;QAED,uCAAuC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;gBAChD,IAAI,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;oBACtB,QAAQ,EAAE,CAAC;gBACb,CAAC;YACH,CAAC;YAED,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,6DAA6D;gBAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC;gBAChD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,wCAAwC;gBACxC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,iBAAiB;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC;QAE5C,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,8BAA8B;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QAED,mCAAmC;QACnC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1C,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,aAAa,EAAE,CAAC;YAC7C,6DAA6D;YAC7D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,QAAQ,CAAC,CAAC;YAChD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACH,gBAAgB;QACd,OAAO,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC;IACzC,CAAC;CACF"}

package/dist/search/VectorStore.d.ts

@@ -1,235 +0,0 @@
-/**
- * Vector Store
- *
- * Phase 4 Sprint 11: Vector storage and retrieval for semantic search.
- * Provides in-memory and SQLite-backed implementations.
- *
- * @module search/VectorStore
- */
-import type { IVectorStore, VectorSearchResult } from '../types/index.js';
-/**
- * Calculate cosine similarity between two vectors.
- *
- * Uses an optimized inner loop without array methods for maximum performance.
- *
- * @param a - First vector
- * @param b - Second vector
- * @returns Cosine similarity score (0.0 to 1.0)
- */
-export declare function cosineSimilarity(a: number[], b: number[]): number;
-/**
- * In-Memory Vector Store
- *
- * Stores vectors in memory using a Map for O(1) add/remove operations.
- * Search uses brute-force cosine similarity which is O(n) but fast for
- * small to medium graphs (<10K entities).
- *
- * @example
- * ```typescript
- * const store = new InMemoryVectorStore();
- * store.add("entity1", [0.1, 0.2, 0.3]);
- * store.add("entity2", [0.4, 0.5, 0.6]);
- * const results = store.search([0.1, 0.2, 0.3], 5);
- * console.log(results); // [{ name: "entity1", score: 1.0 }, ...]
- * ```
- */
-export declare class InMemoryVectorStore implements IVectorStore {
-    /** Map of entity name to embedding vector */
-    private vectors;
-    /**
-     * Add a vector for an entity.
-     *
-     * @param entityName - Name of the entity
-     * @param vector - Embedding vector
-     */
-    add(entityName: string, vector: number[]): void;
-    /**
-     * Search for similar vectors using cosine similarity.
-     *
-     * @param queryVector - Query embedding vector
-     * @param k - Number of results to return
-     * @returns Array of results with entity name and similarity score
-     */
-    search(queryVector: number[], k: number): VectorSearchResult[];
-    /**
-     * Remove a vector by entity name.
-     *
-     * @param entityName - Name of the entity to remove
-     * @returns True if found and removed
-     */
-    remove(entityName: string): boolean;
-    /**
-     * Get the number of vectors stored.
-     *
-     * @returns Number of vectors
-     */
-    size(): number;
-    /**
-     * Clear all vectors from the store.
-     */
-    clear(): void;
-    /**
-     * Check if a vector exists for an entity.
-     *
-     * @param entityName - Name of the entity
-     * @returns True if vector exists
-     */
-    has(entityName: string): boolean;
-    /**
-     * Get the vector for an entity.
-     *
-     * @param entityName - Name of the entity
-     * @returns Vector if found, undefined otherwise
-     */
-    get(entityName: string): number[] | undefined;
-    /**
-     * Get all entity names with stored vectors.
-     *
-     * @returns Array of entity names
-     */
-    getEntityNames(): string[];
-    /**
-     * Load vectors from an iterable source.
-     *
-     * @param entries - Iterable of [entityName, vector] pairs
-     */
-    loadFrom(entries: Iterable<[string, number[]]>): void;
-}
-/**
- * SQLite Vector Store
- *
- * Persists vectors to SQLite storage while maintaining an in-memory cache
- * for fast search operations. Combines persistence with performance.
- *
- * Uses SQLiteStorage's embedding storage methods for persistence.
- *
- * @example
- * ```typescript
- * const store = new SQLiteVectorStore(sqliteStorage);
- * await store.initialize();
- * store.add("entity1", [0.1, 0.2, 0.3]);
- * const results = store.search([0.1, 0.2, 0.3], 5);
- * ```
- */
-export declare class SQLiteVectorStore implements IVectorStore {
-    /** In-memory cache for fast search */
-    private memoryStore;
-    /** SQLite storage reference for persistence */
-    private storage;
-    /** Whether the store has been initialized */
-    private initialized;
-    /** Model name used for embeddings */
-    private embeddingModel;
-    /**
-     * Create a SQLite vector store.
-     *
-     * @param storage - SQLite storage instance with embedding support
-     * @param embeddingModel - Model name used for embeddings
-     */
-    constructor(storage?: SQLiteStorageWithEmbeddings, embeddingModel?: string);
-    /**
-     * Initialize the store by loading vectors from SQLite.
-     */
-    initialize(): Promise<void>;
-    /**
-     * Add a vector for an entity.
-     * Stores in both memory and SQLite for persistence.
-     *
-     * @param entityName - Name of the entity
-     * @param vector - Embedding vector
-     */
-    add(entityName: string, vector: number[]): void;
-    /**
-     * Search for similar vectors using cosine similarity.
-     *
-     * @param queryVector - Query embedding vector
-     * @param k - Number of results to return
-     * @returns Array of results with entity name and similarity score
-     */
-    search(queryVector: number[], k: number): VectorSearchResult[];
-    /**
-     * Remove a vector by entity name.
-     *
-     * @param entityName - Name of the entity to remove
-     * @returns True if found and removed
-     */
-    remove(entityName: string): boolean;
-    /**
-     * Get the number of vectors stored.
-     *
-     * @returns Number of vectors
-     */
-    size(): number;
-    /**
-     * Clear all vectors from the store.
-     */
-    clear(): void;
-    /**
-     * Check if a vector exists for an entity.
-     *
-     * @param entityName - Name of the entity
-     * @returns True if vector exists
-     */
-    has(entityName: string): boolean;
-    /**
-     * Get the vector for an entity.
-     *
-     * @param entityName - Name of the entity
-     * @returns Vector if found, undefined otherwise
-     */
-    get(entityName: string): number[] | undefined;
-    /**
-     * Set the SQLite storage reference.
-     *
-     * @param storage - SQLite storage instance
-     */
-    setStorage(storage: SQLiteStorageWithEmbeddings): void;
-    /**
-     * Set the embedding model name.
-     *
-     * @param model - Model name
-     */
-    setEmbeddingModel(model: string): void;
-}
-/**
- * Interface for SQLite storage with embedding support.
- *
- * This is a subset of SQLiteStorage that only includes embedding-related methods.
- * Allows for loose coupling between VectorStore and SQLiteStorage.
- */
-export interface SQLiteStorageWithEmbeddings {
-    /**
-     * Store an embedding for an entity.
-     *
-     * @param entityName - Name of the entity
-     * @param vector - Embedding vector
-     * @param model - Model name used for the embedding
-     */
-    storeEmbedding(entityName: string, vector: number[], model: string): void;
-    /**
-     * Load all embeddings from storage.
-     *
-     * @returns Array of [entityName, vector] pairs
-     */
-    loadAllEmbeddings(): Promise<[string, number[]][]>;
-    /**
-     * Remove an embedding for an entity.
-     *
-     * @param entityName - Name of the entity
-     */
-    removeEmbedding(entityName: string): void;
-    /**
-     * Clear all embeddings from storage.
-     */
-    clearAllEmbeddings(): void;
-}
-/**
- * Create a vector store based on storage type.
- *
- * @param storageType - Storage type: 'jsonl' or 'sqlite'
- * @param storage - Optional SQLite storage reference for 'sqlite' type
- * @param embeddingModel - Optional model name for embedding tracking
- * @returns Vector store instance
- */
-export declare function createVectorStore(storageType?: 'jsonl' | 'sqlite', storage?: SQLiteStorageWithEmbeddings, embeddingModel?: string): IVectorStore;
-//# sourceMappingURL=VectorStore.d.ts.map

package/dist/search/VectorStore.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"VectorStore.d.ts","sourceRoot":"","sources":["../../src/search/VectorStore.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAE1E;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CA2BjE;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,mBAAoB,YAAW,YAAY;IACtD,6CAA6C;IAC7C,OAAO,CAAC,OAAO,CAAoC;IAEnD;;;;;OAKG;IACH,GAAG,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI;IAI/C;;;;;;OAMG;IACH,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,kBAAkB,EAAE;IAuB9D;;;;;OAKG;IACH,MAAM,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAInC;;;;OAIG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,KAAK,IAAI,IAAI;IAIb;;;;;OAKG;IACH,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAIhC;;;;;OAKG;IACH,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS;IAI7C;;;;OAIG;IACH,cAAc,IAAI,MAAM,EAAE;IAI1B;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,IAAI;CAKtD;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,iBAAkB,YAAW,YAAY;IACpD,sCAAsC;IACtC,OAAO,CAAC,WAAW,CAAkD;IAErE,+CAA+C;IAC/C,OAAO,CAAC,OAAO,CAA4C;IAE3D,6CAA6C;IAC7C,OAAO,CAAC,WAAW,CAAS;IAE5B,qCAAqC;IACrC,OAAO,CAAC,cAAc,CAAc;IAEpC;;;;;OAKG;gBACS,OAAO,CAAC,EAAE,2BAA2B,EAAE,cAAc,GAAE,MAAkB;IAKrF;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAYjC;;;;;;OAMG;IACH,GAAG,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI;IAU/C;;;;;;OAMG;IACH,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,kBAAkB,EAAE;IAI9D;;;;;OAKG;IACH,MAAM,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAWnC;;;;OAIG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,KAAK,IAAI,IAAI;IAQb;;;;;OAKG;IACH,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAIhC;;;;;OAKG;IACH,GAAG,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS;IAI7C;;;;OAIG;IACH,UAAU,CAAC,OAAO,EAAE,2BAA2B,GAAG,IAAI;IAItD;;;;OAIG;IACH,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;CAGvC;AAED;;;;;GAKG;AACH,MAAM,WAAW,2BAA2B;IAC1C;;;;;;OAMG;IACH,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAE1E;;;;OAIG;IACH,iBAAiB,IAAI,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IAEnD;;;;OAIG;IACH,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAE1C;;OAEG;IACH,kBAAkB,IAAI,IAAI,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,WAAW,GAAE,OAAO,GAAG,QAAkB,EACzC,OAAO,CAAC,EAAE,2BAA2B,EACrC,cAAc,CAAC,EAAE,MAAM,GACtB,YAAY,CAQd"}