@danielsimonjr/memoryjs 1.0.0

package/dist/search/SemanticSearch.d.ts

@@ -0,0 +1,149 @@
+/**
+ * Semantic Search Manager
+ *
+ * Phase 4 Sprint 12: Orchestrates embedding service and vector store
+ * to provide semantic similarity search capabilities.
+ *
+ * @module search/SemanticSearch
+ */
+import type { Entity, EmbeddingService, IVectorStore, SemanticSearchResult, SemanticIndexOptions, ReadonlyKnowledgeGraph } from '../types/index.js';
+/**
+ * Convert an entity to a text representation for embedding.
+ *
+ * Creates a structured text that captures the entity's key information
+ * for generating meaningful embeddings.
+ *
+ * @param entity - Entity to convert
+ * @returns Text representation suitable for embedding
+ */
+export declare function entityToText(entity: Entity): string;
+/**
+ * Semantic Search Manager
+ *
+ * Provides semantic similarity search by converting entities to embeddings
+ * and storing them in a vector store. Supports search by query text and
+ * finding similar entities.
+ *
+ * @example
+ * ```typescript
+ * const semanticSearch = new SemanticSearch(embeddingService, vectorStore);
+ * await semanticSearch.indexAll(graph);
+ * const results = await semanticSearch.search(graph, "machine learning");
+ * ```
+ */
+export declare class SemanticSearch {
+    /** Embedding service for generating vectors */
+    private embeddingService;
+    /** Vector store for storing and searching embeddings */
+    private vectorStore;
+    /** Whether embeddings have been indexed */
+    private indexed;
+    /** Number of entities currently indexed */
+    private indexedCount;
+    /**
+     * Create a semantic search manager.
+     *
+     * @param embeddingService - Service for generating embeddings
+     * @param vectorStore - Store for vector storage and search
+     */
+    constructor(embeddingService: EmbeddingService, vectorStore?: IVectorStore);
+    /**
+     * Index all entities in the knowledge graph.
+     *
+     * Generates embeddings for all entities and stores them in the vector store.
+     * Can be called incrementally - only indexes entities that aren't already indexed.
+     *
+     * Phase 9B: Supports cancellation via AbortSignal in options.
+     *
+     * @param graph - Knowledge graph to index
+     * @param options - Indexing options (includes signal for cancellation)
+     * @returns Index statistics
+     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
+     */
+    indexAll(graph: ReadonlyKnowledgeGraph, options?: SemanticIndexOptions): Promise<{
+        indexed: number;
+        skipped: number;
+        errors: number;
+    }>;
+    /**
+     * Index a single entity.
+     *
+     * @param entity - Entity to index
+     * @returns True if indexed successfully
+     */
+    indexEntity(entity: Entity): Promise<boolean>;
+    /**
+     * Remove an entity from the index.
+     *
+     * @param entityName - Name of entity to remove
+     * @returns True if found and removed
+     */
+    removeEntity(entityName: string): boolean;
+    /**
+     * Search for entities semantically similar to a query.
+     *
+     * @param graph - Knowledge graph to search in
+     * @param query - Search query text
+     * @param limit - Maximum number of results (default: 10)
+     * @param minSimilarity - Minimum similarity threshold (default: 0)
+     * @returns Array of search results with similarity scores
+     */
+    search(graph: ReadonlyKnowledgeGraph, query: string, limit?: number, minSimilarity?: number): Promise<SemanticSearchResult[]>;
+    /**
+     * Find entities similar to a given entity.
+     *
+     * @param graph - Knowledge graph to search in
+     * @param entityName - Name of entity to find similar entities for
+     * @param limit - Maximum number of results (default: 10)
+     * @param minSimilarity - Minimum similarity threshold (default: 0)
+     * @returns Array of search results with similarity scores
+     */
+    findSimilar(graph: ReadonlyKnowledgeGraph, entityName: string, limit?: number, minSimilarity?: number): Promise<SemanticSearchResult[]>;
+    /**
+     * Get the embedding service.
+     *
+     * @returns Embedding service instance
+     */
+    getEmbeddingService(): EmbeddingService;
+    /**
+     * Get the vector store.
+     *
+     * @returns Vector store instance
+     */
+    getVectorStore(): IVectorStore;
+    /**
+     * Check if the index has been built.
+     *
+     * @returns True if indexAll has been called
+     */
+    isIndexed(): boolean;
+    /**
+     * Get the number of indexed entities.
+     *
+     * @returns Number of entities in the vector store
+     */
+    getIndexedCount(): number;
+    /**
+     * Clear all indexed embeddings.
+     */
+    clearIndex(): void;
+    /**
+     * Check if semantic search is available.
+     *
+     * @returns True if embedding service is ready
+     */
+    isAvailable(): Promise<boolean>;
+    /**
+     * Get semantic search statistics.
+     *
+     * @returns Statistics about the semantic search index
+     */
+    getStats(): {
+        indexed: boolean;
+        indexedCount: number;
+        provider: string;
+        model: string;
+        dimensions: number;
+    };
+}
+//# sourceMappingURL=SemanticSearch.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SemanticSearch.d.ts","sourceRoot":"","sources":["../../src/search/SemanticSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,MAAM,EACN,gBAAgB,EAChB,YAAY,EACZ,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACvB,MAAM,mBAAmB,CAAC;AAK3B;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAkBnD;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,cAAc;IACzB,+CAA+C;IAC/C,OAAO,CAAC,gBAAgB,CAAmB;IAE3C,wDAAwD;IACxD,OAAO,CAAC,WAAW,CAAe;IAElC,2CAA2C;IAC3C,OAAO,CAAC,OAAO,CAAS;IAExB,2CAA2C;IAC3C,OAAO,CAAC,YAAY,CAAK;IAEzB;;;;;OAKG;gBACS,gBAAgB,EAAE,gBAAgB,EAAE,WAAW,CAAC,EAAE,YAAY;IAK1E;;;;;;;;;;;;OAYG;IACG,QAAQ,CACZ,KAAK,EAAE,sBAAsB,EAC7B,OAAO,GAAE,oBAAyB,GACjC,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAwEhE;;;;;OAKG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAYnD;;;;;OAKG;IACH,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAQzC;;;;;;;;OAQG;IACG,MAAM,CACV,KAAK,EAAE,sBAAsB,EAC7B,KAAK,EAAE,MAAM,EACb,KAAK,GAAE,MAA6C,EACpD,aAAa,GAAE,MAA8C,GAC5D,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAsClC;;;;;;;;OAQG;IACG,WAAW,CACf,KAAK,EAAE,sBAAsB,EAC7B,UAAU,EAAE,MAAM,EAClB,KAAK,GAAE,MAA6C,EACpD,aAAa,GAAE,MAA8C,GAC5D,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAoDlC;;;;OAIG;IACH,mBAAmB,IAAI,gBAAgB;IAIvC;;;;OAIG;IACH,cAAc,IAAI,YAAY;IAI9B;;;;OAIG;IACH,SAAS,IAAI,OAAO;IAIpB;;;;OAIG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,UAAU,IAAI,IAAI;IAMlB;;;;OAIG;IACG,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAIrC;;;;OAIG;IACH,QAAQ,IAAI;QACV,OAAO,EAAE,OAAO,CAAC;QACjB,YAAY,EAAE,MAAM,CAAC;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,UAAU,EAAE,MAAM,CAAC;KACpB;CASF"}

package/dist/search/SemanticSearch.js

@@ -0,0 +1,324 @@
+/**
+ * Semantic Search Manager
+ *
+ * Phase 4 Sprint 12: Orchestrates embedding service and vector store
+ * to provide semantic similarity search capabilities.
+ *
+ * @module search/SemanticSearch
+ */
+import { InMemoryVectorStore } from './VectorStore.js';
+import { EMBEDDING_DEFAULTS, SEMANTIC_SEARCH_LIMITS } from '../utils/constants.js';
+import { checkCancellation } from '../utils/index.js';
+/**
+ * Convert an entity to a text representation for embedding.
+ *
+ * Creates a structured text that captures the entity's key information
+ * for generating meaningful embeddings.
+ *
+ * @param entity - Entity to convert
+ * @returns Text representation suitable for embedding
+ */
+export function entityToText(entity) {
+    const parts = [];
+    // Name and type are most important
+    parts.push(`${entity.name} (${entity.entityType})`);
+    // Add observations (limited to prevent overly long text)
+    if (entity.observations.length > 0) {
+        const observationText = entity.observations.slice(0, 10).join('. ');
+        parts.push(observationText);
+    }
+    // Add tags if present
+    if (entity.tags && entity.tags.length > 0) {
+        parts.push(`Tags: ${entity.tags.join(', ')}`);
+    }
+    return parts.join('\n');
+}
+/**
+ * Semantic Search Manager
+ *
+ * Provides semantic similarity search by converting entities to embeddings
+ * and storing them in a vector store. Supports search by query text and
+ * finding similar entities.
+ *
+ * @example
+ * ```typescript
+ * const semanticSearch = new SemanticSearch(embeddingService, vectorStore);
+ * await semanticSearch.indexAll(graph);
+ * const results = await semanticSearch.search(graph, "machine learning");
+ * ```
+ */
+export class SemanticSearch {
+    /** Embedding service for generating vectors */
+    embeddingService;
+    /** Vector store for storing and searching embeddings */
+    vectorStore;
+    /** Whether embeddings have been indexed */
+    indexed = false;
+    /** Number of entities currently indexed */
+    indexedCount = 0;
+    /**
+     * Create a semantic search manager.
+     *
+     * @param embeddingService - Service for generating embeddings
+     * @param vectorStore - Store for vector storage and search
+     */
+    constructor(embeddingService, vectorStore) {
+        this.embeddingService = embeddingService;
+        this.vectorStore = vectorStore || new InMemoryVectorStore();
+    }
+    /**
+     * Index all entities in the knowledge graph.
+     *
+     * Generates embeddings for all entities and stores them in the vector store.
+     * Can be called incrementally - only indexes entities that aren't already indexed.
+     *
+     * Phase 9B: Supports cancellation via AbortSignal in options.
+     *
+     * @param graph - Knowledge graph to index
+     * @param options - Indexing options (includes signal for cancellation)
+     * @returns Index statistics
+     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
+     */
+    async indexAll(graph, options = {}) {
+        const { forceReindex = false, onProgress, batchSize = EMBEDDING_DEFAULTS.DEFAULT_BATCH_SIZE, signal, } = options;
+        // Check for early cancellation
+        checkCancellation(signal, 'indexAll');
+        let indexed = 0;
+        let skipped = 0;
+        let errors = 0;
+        const entities = graph.entities;
+        const total = entities.length;
+        // Collect entities to index
+        const toIndex = [];
+        for (const entity of entities) {
+            if (forceReindex || !this.vectorStore.has(entity.name)) {
+                toIndex.push(entity);
+            }
+            else {
+                skipped++;
+            }
+        }
+        // Process in batches
+        for (let i = 0; i < toIndex.length; i += batchSize) {
+            // Check for cancellation between batches
+            checkCancellation(signal, 'indexAll');
+            const batch = toIndex.slice(i, i + batchSize);
+            const texts = batch.map(entityToText);
+            try {
+                const embeddings = await this.embeddingService.embedBatch(texts);
+                for (let j = 0; j < batch.length; j++) {
+                    this.vectorStore.add(batch[j].name, embeddings[j]);
+                    indexed++;
+                }
+            }
+            catch (error) {
+                // Try individual embeddings on batch failure
+                for (const entity of batch) {
+                    // Check for cancellation during fallback
+                    checkCancellation(signal, 'indexAll');
+                    try {
+                        const text = entityToText(entity);
+                        const embedding = await this.embeddingService.embed(text);
+                        this.vectorStore.add(entity.name, embedding);
+                        indexed++;
+                    }
+                    catch {
+                        errors++;
+                    }
+                }
+            }
+            // Report progress
+            if (onProgress) {
+                onProgress(indexed + skipped + errors, total);
+            }
+        }
+        this.indexed = true;
+        this.indexedCount = this.vectorStore.size();
+        return { indexed, skipped, errors };
+    }
+    /**
+     * Index a single entity.
+     *
+     * @param entity - Entity to index
+     * @returns True if indexed successfully
+     */
+    async indexEntity(entity) {
+        try {
+            const text = entityToText(entity);
+            const embedding = await this.embeddingService.embed(text);
+            this.vectorStore.add(entity.name, embedding);
+            this.indexedCount = this.vectorStore.size();
+            return true;
+        }
+        catch {
+            return false;
+        }
+    }
+    /**
+     * Remove an entity from the index.
+     *
+     * @param entityName - Name of entity to remove
+     * @returns True if found and removed
+     */
+    removeEntity(entityName) {
+        const removed = this.vectorStore.remove(entityName);
+        if (removed) {
+            this.indexedCount = this.vectorStore.size();
+        }
+        return removed;
+    }
+    /**
+     * Search for entities semantically similar to a query.
+     *
+     * @param graph - Knowledge graph to search in
+     * @param query - Search query text
+     * @param limit - Maximum number of results (default: 10)
+     * @param minSimilarity - Minimum similarity threshold (default: 0)
+     * @returns Array of search results with similarity scores
+     */
+    async search(graph, query, limit = SEMANTIC_SEARCH_LIMITS.DEFAULT_LIMIT, minSimilarity = SEMANTIC_SEARCH_LIMITS.MIN_SIMILARITY) {
+        // Ensure limit is within bounds
+        const effectiveLimit = Math.min(limit, SEMANTIC_SEARCH_LIMITS.MAX_LIMIT);
+        // Generate embedding for query
+        const queryEmbedding = await this.embeddingService.embed(query);
+        // Search vector store
+        const vectorResults = this.vectorStore.search(queryEmbedding, effectiveLimit * 2); // Get extra for filtering
+        // Convert to SemanticSearchResult with entity lookup
+        const entityMap = new Map();
+        for (const entity of graph.entities) {
+            entityMap.set(entity.name, entity);
+        }
+        const results = [];
+        for (const result of vectorResults) {
+            if (result.score < minSimilarity) {
+                continue;
+            }
+            const entity = entityMap.get(result.name);
+            if (entity) {
+                results.push({
+                    entity,
+                    similarity: result.score,
+                });
+            }
+            if (results.length >= effectiveLimit) {
+                break;
+            }
+        }
+        return results;
+    }
+    /**
+     * Find entities similar to a given entity.
+     *
+     * @param graph - Knowledge graph to search in
+     * @param entityName - Name of entity to find similar entities for
+     * @param limit - Maximum number of results (default: 10)
+     * @param minSimilarity - Minimum similarity threshold (default: 0)
+     * @returns Array of search results with similarity scores
+     */
+    async findSimilar(graph, entityName, limit = SEMANTIC_SEARCH_LIMITS.DEFAULT_LIMIT, minSimilarity = SEMANTIC_SEARCH_LIMITS.MIN_SIMILARITY) {
+        // Get the entity's embedding
+        const embedding = this.vectorStore.get(entityName);
+        if (!embedding) {
+            // Try to find and index the entity
+            const entity = graph.entities.find(e => e.name === entityName);
+            if (entity) {
+                await this.indexEntity(entity);
+                return this.findSimilar(graph, entityName, limit, minSimilarity);
+            }
+            return [];
+        }
+        // Ensure limit is within bounds
+        const effectiveLimit = Math.min(limit, SEMANTIC_SEARCH_LIMITS.MAX_LIMIT);
+        // Search vector store (request extra to filter out self)
+        const vectorResults = this.vectorStore.search(embedding, effectiveLimit + 1);
+        // Convert to SemanticSearchResult with entity lookup
+        const entityMap = new Map();
+        for (const entity of graph.entities) {
+            entityMap.set(entity.name, entity);
+        }
+        const results = [];
+        for (const result of vectorResults) {
+            // Skip self
+            if (result.name === entityName) {
+                continue;
+            }
+            if (result.score < minSimilarity) {
+                continue;
+            }
+            const entity = entityMap.get(result.name);
+            if (entity) {
+                results.push({
+                    entity,
+                    similarity: result.score,
+                });
+            }
+            if (results.length >= effectiveLimit) {
+                break;
+            }
+        }
+        return results;
+    }
+    /**
+     * Get the embedding service.
+     *
+     * @returns Embedding service instance
+     */
+    getEmbeddingService() {
+        return this.embeddingService;
+    }
+    /**
+     * Get the vector store.
+     *
+     * @returns Vector store instance
+     */
+    getVectorStore() {
+        return this.vectorStore;
+    }
+    /**
+     * Check if the index has been built.
+     *
+     * @returns True if indexAll has been called
+     */
+    isIndexed() {
+        return this.indexed;
+    }
+    /**
+     * Get the number of indexed entities.
+     *
+     * @returns Number of entities in the vector store
+     */
+    getIndexedCount() {
+        return this.indexedCount;
+    }
+    /**
+     * Clear all indexed embeddings.
+     */
+    clearIndex() {
+        this.vectorStore.clear();
+        this.indexed = false;
+        this.indexedCount = 0;
+    }
+    /**
+     * Check if semantic search is available.
+     *
+     * @returns True if embedding service is ready
+     */
+    async isAvailable() {
+        return this.embeddingService.isReady();
+    }
+    /**
+     * Get semantic search statistics.
+     *
+     * @returns Statistics about the semantic search index
+     */
+    getStats() {
+        return {
+            indexed: this.indexed,
+            indexedCount: this.indexedCount,
+            provider: this.embeddingService.provider,
+            model: this.embeddingService.model,
+            dimensions: this.embeddingService.dimensions,
+        };
+    }
+}
+//# sourceMappingURL=SemanticSearch.js.map

package/dist/search/SemanticSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SemanticSearch.js","sourceRoot":"","sources":["../../src/search/SemanticSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAUH,OAAO,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACnF,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AAEtD;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,mCAAmC;IACnC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;IAEpD,yDAAyD;IACzD,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,eAAe,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC9B,CAAC;IAED,sBAAsB;IACtB,IAAI,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,SAAS,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,cAAc;IACzB,+CAA+C;IACvC,gBAAgB,CAAmB;IAE3C,wDAAwD;IAChD,WAAW,CAAe;IAElC,2CAA2C;IACnC,OAAO,GAAG,KAAK,CAAC;IAExB,2CAA2C;IACnC,YAAY,GAAG,CAAC,CAAC;IAEzB;;;;;OAKG;IACH,YAAY,gBAAkC,EAAE,WAA0B;QACxE,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,WAAW,IAAI,IAAI,mBAAmB,EAAE,CAAC;IAC9D,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,QAAQ,CACZ,KAA6B,EAC7B,UAAgC,EAAE;QAElC,MAAM,EACJ,YAAY,GAAG,KAAK,EACpB,UAAU,EACV,SAAS,GAAG,kBAAkB,CAAC,kBAAkB,EACjD,MAAM,GACP,GAAG,OAAO,CAAC;QAEZ,+BAA+B;QAC/B,iBAAiB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAEtC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE9B,4BAA4B;QAC5B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,YAAY,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;iBAAM,CAAC;gBACN,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YACnD,yCAAyC;YACzC,iBAAiB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAEtC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAEtC,IAAI,CAAC;gBACH,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBAEjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnD,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,6CAA6C;gBAC7C,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;oBAC3B,yCAAyC;oBACzC,iBAAiB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;oBAEtC,IAAI,CAAC;wBACH,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;wBAClC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBAC1D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;wBAC7C,OAAO,EAAE,CAAC;oBACZ,CAAC;oBAAC,MAAM,CAAC;wBACP,MAAM,EAAE,CAAC;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;YAED,kBAAkB;YAClB,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU,CAAC,OAAO,GAAG,OAAO,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAE5C,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IACtC,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC7C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,UAAkB;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC9C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,MAAM,CACV,KAA6B,EAC7B,KAAa,EACb,QAAgB,sBAAsB,CAAC,aAAa,EACpD,gBAAwB,sBAAsB,CAAC,cAAc;QAE7D,gCAAgC;QAChC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,sBAAsB,CAAC,SAAS,CAAC,CAAC;QAEzE,+BAA+B;QAC/B,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAEhE,sBAAsB;QACtB,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,0BAA0B;QAE7G,qDAAqD;QACrD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,IAAI,MAAM,CAAC,KAAK,GAAG,aAAa,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YAED,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM;oBACN,UAAU,EAAE,MAAM,CAAC,KAAK;iBACzB,CAAC,CAAC;YACL,CAAC;YAED,IAAI,OAAO,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;gBACrC,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,WAAW,CACf,KAA6B,EAC7B,UAAkB,EAClB,QAAgB,sBAAsB,CAAC,aAAa,EACpD,gBAAwB,sBAAsB,CAAC,cAAc;QAE7D,6BAA6B;QAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,mCAAmC;YACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YAC/D,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAC/B,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;YACnE,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,gCAAgC;QAChC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,sBAAsB,CAAC,SAAS,CAAC,CAAC;QAEzE,yDAAyD;QACzD,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,cAAc,GAAG,CAAC,CAAC,CAAC;QAE7E,qDAAqD;QACrD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;QAED,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,YAAY;YACZ,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YAED,IAAI,MAAM,CAAC,KAAK,GAAG,aAAa,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YAED,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM;oBACN,UAAU,EAAE,MAAM,CAAC,KAAK;iBACzB,CAAC,CAAC;YACL,CAAC;YAED,IAAI,OAAO,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;gBACrC,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,mBAAmB;QACjB,OAAO,IAAI,CAAC,gBAAgB,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACH,cAAc;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;;;OAIG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,QAAQ;QAON,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,QAAQ;YACxC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK;YAClC,UAAU,EAAE,IAAI,CAAC,gBAAgB,CAAC,UAAU;SAC7C,CAAC;IACJ,CAAC;CACF"}

package/dist/search/SymbolicSearch.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Symbolic Search Layer
+ *
+ * Phase 11: Provides metadata-based filtering using structured predicates.
+ * Part of the three-layer hybrid search architecture.
+ *
+ * @module search/SymbolicSearch
+ */
+import type { Entity, SymbolicFilters } from '../types/index.js';
+/**
+ * Result from symbolic search with match score.
+ */
+export interface SymbolicResult {
+    entity: Entity;
+    score: number;
+    matchedFilters: string[];
+}
+/**
+ * Symbolic Search provides metadata-based filtering.
+ *
+ * Filters entities using structured predicates on tags, types,
+ * dates, importance, and hierarchy.
+ *
+ * @example
+ * ```typescript
+ * const symbolic = new SymbolicSearch();
+ * const results = symbolic.search(entities, {
+ *   tags: ['important'],
+ *   entityTypes: ['person'],
+ *   importance: { min: 5 }
+ * });
+ * ```
+ */
+export declare class SymbolicSearch {
+    /**
+     * Filter entities using structured metadata predicates.
+     * All filters are AND-combined.
+     *
+     * @param entities - Entities to filter
+     * @param filters - Symbolic filter criteria
+     * @returns Filtered entities with match scores
+     */
+    search(entities: readonly Entity[], filters: SymbolicFilters): SymbolicResult[];
+    /**
+     * Evaluate all filters against an entity.
+     */
+    private evaluateFilters;
+    /**
+     * Get entities matching a specific tag.
+     */
+    byTag(entities: readonly Entity[], tag: string): Entity[];
+    /**
+     * Get entities of a specific type.
+     */
+    byType(entities: readonly Entity[], entityType: string): Entity[];
+    /**
+     * Get entities within importance range.
+     */
+    byImportance(entities: readonly Entity[], min: number, max: number): Entity[];
+}
+//# sourceMappingURL=SymbolicSearch.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SymbolicSearch.d.ts","sourceRoot":"","sources":["../../src/search/SymbolicSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEjE;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,cAAc,EAAE,MAAM,EAAE,CAAC;CAC1B;AAED;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,cAAc;IACzB;;;;;;;OAOG;IACH,MAAM,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,eAAe,GAAG,cAAc,EAAE;IAc/E;;OAEG;IACH,OAAO,CAAC,eAAe;IAyGvB;;OAEG;IACH,KAAK,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE;IAMzD;;OAEG;IACH,MAAM,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,EAAE;IAMjE;;OAEG;IACH,YAAY,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE;CAM9E"}