vesper-memory 0.5.1 → 0.5.3

package/dist/retrieval 2/hybrid-search.d.ts

@@ -1,186 +0,0 @@
-/**
- * Hybrid Search Engine
- *
- * Implements multi-index retrieval combining dense embeddings, sparse vectors,
- * and BM25 full-text search. Currently implements dense search with RRF fusion
- * stubs for future sparse/BM25 integration.
- *
- * Retrieval Pipeline:
- * - Dense embeddings (BGE-large, 1024-dim)
- * - Sparse vectors (SPLADE++, coming soon)
- * - BM25 full-text search (coming soon)
- * - ColBERT late-interaction reranking (Phase 2)
- * - Reciprocal Rank Fusion (k=60)
- */
-/**
- * Dense search result from vector similarity
- */
-export interface DenseSearchResult {
-    id: string;
-    score: number;
-    payload?: Record<string, unknown>;
-}
-/**
- * Sparse search result from sparse embeddings
- */
-export interface SparseSearchResult {
-    id: string;
-    score: number;
-    payload?: Record<string, unknown>;
-}
-/**
- * BM25 full-text search result
- */
-export interface BM25SearchResult {
-    id: string;
-    score: number;
-    payload?: Record<string, unknown>;
-}
-/**
- * Unified search result after RRF fusion
- */
-export interface HybridSearchResult {
-    id: string;
-    denseScore?: number;
-    sparseScore?: number;
-    bm25Score?: number;
-    fusedScore: number;
-    payload?: Record<string, unknown>;
-    rank: number;
-}
-/**
- * Qdrant Hybrid Search Engine
- *
- * Manages vector operations and retrieval across multiple index types.
- * Currently focused on dense search; sparse and BM25 stubs provided for future phases.
- */
-export declare class HybridSearchEngine {
-    private client;
-    private collectionName;
-    private vectorSize;
-    /**
-     * Initialize the hybrid search engine
-     *
-     * @param qdrantUrl - Qdrant server URL (default: http://localhost:6333)
-     * @param collectionName - Name of the collection (default: memory-vectors)
-     * @param vectorSize - Dimension of dense vectors (default: 1024 for BGE-large)
-     * @param apiKey - Optional Qdrant API key for authentication
-     */
-    constructor(qdrantUrl?: string, collectionName?: string, vectorSize?: number, apiKey?: string);
-    /**
-     * Initialize collection with proper schema
-     *
-     * Creates a collection with:
-     * - Dense vectors (1024-dim, cosine similarity)
-     * - Payload storage for metadata
-     * - Future: sparse vectors, BM25 indexes
-     */
-    initializeCollection(): Promise<void>;
-    /**
-     * Dense vector search using cosine similarity
-     *
-     * Performs semantic search using dense embeddings (BGE-large, 1024-dim).
-     * Returns top-k results ranked by similarity score.
-     *
-     * @param queryVector - Query embedding (1024-dim array)
-     * @param topK - Number of results to return (default: 5)
-     * @returns Array of dense search results sorted by score (highest first)
-     */
-    denseSearch(queryVector: number[], topK?: number): Promise<DenseSearchResult[]>;
-    /**
-     * Sparse vector search using SPLADE++ (stub)
-     *
-     * TODO: Phase 2 implementation
-     * - Integrate SPLADE++ sparse embeddings
-     * - Query sparse index in Qdrant
-     * - Return top-k sparse results
-     *
-     * @param querySparseVector - Query sparse embedding
-     * @param topK - Number of results to return
-     * @returns Array of sparse search results
-     */
-    sparseSearch(_querySparseVector: Record<number, number>, _topK?: number): Promise<SparseSearchResult[]>;
-    /**
-     * BM25 full-text search (stub)
-     *
-     * TODO: Phase 2 implementation
-     * - Integrate BM25 index (Qdrant or external)
-     * - Tokenize and search query text
-     * - Return top-k BM25 results
-     *
-     * @param queryText - Query text for full-text search
-     * @param topK - Number of results to return
-     * @returns Array of BM25 search results
-     */
-    bm25Search(_queryText: string, _topK?: number): Promise<BM25SearchResult[]>;
-    /**
-     * Reciprocal Rank Fusion combining multiple indexes
-     *
-     * Implements RRF formula to combine rankings from dense, sparse, and BM25 indexes:
-     * RRF(d) = Σ 1 / (k + rank(d))
-     *
-     * where k is the fusion parameter (default 60) and rank is the position in each ranking.
-     *
-     * TODO: Phase 2 - Integrate with sparse/BM25 results once available
-     *
-     * @param denseResults - Results from dense search
-     * @param sparseResults - Results from sparse search
-     * @param bm25Results - Results from BM25 search
-     * @param k - RRF fusion parameter (default: 60)
-     * @returns Fused results sorted by RRF score
-     */
-    static rrfFusion(denseResults: DenseSearchResult[], sparseResults?: SparseSearchResult[], bm25Results?: BM25SearchResult[], k?: number): HybridSearchResult[];
-    /**
-     * Hybrid search combining all available indexes
-     *
-     * Currently implements dense search only. Will be extended to include
-     * sparse vectors and BM25 once those are implemented in Phase 2.
-     *
-     * Pipeline:
-     * 1. Dense vector search (semantic search)
-     * 2. Sparse vector search (keyword-level semantics)
-     * 3. BM25 full-text search
-     * 4. Reciprocal Rank Fusion
-     *
-     * @param queryVector - Query embedding (1024-dim for BGE-large)
-     * @param topK - Number of final results to return (default: 5)
-     * @returns Array of fused results ranked by combined scores
-     */
-    hybridSearch(queryVector: number[], topK?: number): Promise<HybridSearchResult[]>;
-    /**
-     * Add or update a memory record with embedding
-     *
-     * @param id - Unique identifier for the memory
-     * @param vector - Dense embedding (1024-dim)
-     * @param payload - Associated metadata (content, timestamp, source, etc.)
-     */
-    upsertMemory(id: string, vector: number[], payload?: Record<string, unknown>): Promise<void>;
-    /**
-     * Delete a memory record
-     *
-     * @param id - Unique identifier of the memory to delete
-     */
-    deleteMemory(id: string): Promise<void>;
-    /**
-     * Get collection statistics
-     *
-     * @returns Object containing collection size, vector count, etc.
-     */
-    getCollectionStats(): Promise<Record<string, unknown>>;
-}
-/**
- * Factory function to create and initialize a hybrid search engine
- *
- * Usage:
- * ```typescript
- * const engine = await createHybridSearchEngine();
- * const results = await engine.hybridSearch(queryVector);
- * ```
- *
- * @param qdrantUrl - Qdrant server URL (default: http://localhost:6333)
- * @param collectionName - Name of the collection (default: memory-vectors)
- * @param vectorSize - Dimension of dense vectors (default: 1024 for BGE-large)
- * @param apiKey - Optional Qdrant API key for authentication
- */
-export declare function createHybridSearchEngine(qdrantUrl?: string, collectionName?: string, vectorSize?: number, apiKey?: string): Promise<HybridSearchEngine>;
-//# sourceMappingURL=hybrid-search.d.ts.map

package/dist/retrieval 2/hybrid-search.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"hybrid-search.d.ts","sourceRoot":"","sources":["../../src/retrieval/hybrid-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,IAAI,EAAE,MAAM,CAAC;CACd;AAWD;;;;;GAKG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,cAAc,CAAS;IAC/B,OAAO,CAAC,UAAU,CAAS;IAE3B;;;;;;;OAOG;gBAED,SAAS,GAAE,MAAgC,EAC3C,cAAc,GAAE,MAAyB,EACzC,UAAU,GAAE,MAAa,EACzB,MAAM,CAAC,EAAE,MAAM;IAkBjB;;;;;;;OAOG;IACG,oBAAoB,IAAI,OAAO,CAAC,IAAI,CAAC;IAoC3C;;;;;;;;;OASG;IACG,WAAW,CACf,WAAW,EAAE,MAAM,EAAE,EACrB,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,iBAAiB,EAAE,CAAC;IA0B/B;;;;;;;;;;;OAWG;IACG,YAAY,CAChB,kBAAkB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,KAAK,GAAE,MAAU,GAChB,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAKhC;;;;;;;;;;;OAWG;IACG,UAAU,CACd,UAAU,EAAE,MAAM,EAClB,KAAK,GAAE,MAAU,GAChB,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAK9B;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,SAAS,CACd,YAAY,EAAE,iBAAiB,EAAE,EACjC,aAAa,GAAE,kBAAkB,EAAO,EACxC,WAAW,GAAE,gBAAgB,EAAO,EACpC,CAAC,GAAE,MAAW,GACb,kBAAkB,EAAE;IA+DvB;;;;;;;;;;;;;;;OAeG;IACG,YAAY,CAChB,WAAW,EAAE,MAAM,EAAE,EACrB,IAAI,GAAE,MAAU,GACf,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAchC;;;;;;OAMG;IACG,YAAY,CAChB,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,MAAM,EAAE,EAChB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAChC,OAAO,CAAC,IAAI,CAAC;IAuBhB;;;;OAIG;IACG,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAc7C;;;;OAIG;IACG,kBAAkB,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAiB7D;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAsB,wBAAwB,CAC5C,SAAS,CAAC,EAAE,MAAM,EAClB,cAAc,CAAC,EAAE,MAAM,EACvB,UAAU,CAAC,EAAE,MAAM,EACnB,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,kBAAkB,CAAC,CAI7B"}

package/dist/retrieval 2/hybrid-search.js

@@ -1,327 +0,0 @@
-/**
- * Hybrid Search Engine
- *
- * Implements multi-index retrieval combining dense embeddings, sparse vectors,
- * and BM25 full-text search. Currently implements dense search with RRF fusion
- * stubs for future sparse/BM25 integration.
- *
- * Retrieval Pipeline:
- * - Dense embeddings (BGE-large, 1024-dim)
- * - Sparse vectors (SPLADE++, coming soon)
- * - BM25 full-text search (coming soon)
- * - ColBERT late-interaction reranking (Phase 2)
- * - Reciprocal Rank Fusion (k=60)
- */
-import { QdrantClient } from "@qdrant/js-client-rest";
-import { validateVector, sanitizeCollectionName } from "../utils/validation.js";
-/**
- * Qdrant Hybrid Search Engine
- *
- * Manages vector operations and retrieval across multiple index types.
- * Currently focused on dense search; sparse and BM25 stubs provided for future phases.
- */
-export class HybridSearchEngine {
-    client;
-    collectionName;
-    vectorSize;
-    /**
-     * Initialize the hybrid search engine
-     *
-     * @param qdrantUrl - Qdrant server URL (default: http://localhost:6333)
-     * @param collectionName - Name of the collection (default: memory-vectors)
-     * @param vectorSize - Dimension of dense vectors (default: 1024 for BGE-large)
-     * @param apiKey - Optional Qdrant API key for authentication
-     */
-    constructor(qdrantUrl = "http://localhost:6333", collectionName = "memory-vectors", vectorSize = 1024, apiKey) {
-        // Sanitize collection name to prevent injection attacks (SEC-012)
-        this.collectionName = sanitizeCollectionName(collectionName);
-        this.vectorSize = vectorSize;
-        const clientConfig = {
-            url: qdrantUrl,
-        };
-        // Add API key if provided
-        if (apiKey) {
-            clientConfig.apiKey = apiKey;
-        }
-        this.client = new QdrantClient(clientConfig);
-    }
-    /**
-     * Initialize collection with proper schema
-     *
-     * Creates a collection with:
-     * - Dense vectors (1024-dim, cosine similarity)
-     * - Payload storage for metadata
-     * - Future: sparse vectors, BM25 indexes
-     */
-    async initializeCollection() {
-        try {
-            // Check if collection exists
-            const collections = await this.client.getCollections();
-            const collectionExists = collections.collections.some((c) => c.name === this.collectionName);
-            if (collectionExists) {
-                console.log(`Collection '${this.collectionName}' already exists`);
-                return;
-            }
-            // Create new collection with dense vector index
-            await this.client.createCollection(this.collectionName, {
-                vectors: {
-                    size: this.vectorSize,
-                    distance: "Cosine",
-                },
-            });
-            console.log(`Created collection '${this.collectionName}' with ${this.vectorSize}-dim vectors`);
-            // TODO: Phase 2 - Add sparse vector index
-            // TODO: Phase 2 - Add BM25 index
-        }
-        catch (error) {
-            console.error("Failed to initialize collection:", error instanceof Error ? error.message : error);
-            throw error;
-        }
-    }
-    /**
-     * Dense vector search using cosine similarity
-     *
-     * Performs semantic search using dense embeddings (BGE-large, 1024-dim).
-     * Returns top-k results ranked by similarity score.
-     *
-     * @param queryVector - Query embedding (1024-dim array)
-     * @param topK - Number of results to return (default: 5)
-     * @returns Array of dense search results sorted by score (highest first)
-     */
-    async denseSearch(queryVector, topK = 5) {
-        // Validate vector dimensions and values (SEC-005)
-        validateVector(queryVector, this.vectorSize);
-        try {
-            const searchResults = await this.client.search(this.collectionName, {
-                vector: queryVector,
-                limit: topK,
-                with_payload: true,
-                with_vector: false,
-            });
-            return searchResults.map((result) => ({
-                id: String(result.id),
-                score: result.score,
-                payload: result.payload ?? undefined,
-            }));
-        }
-        catch (error) {
-            console.error("Dense search failed:", error instanceof Error ? error.message : error);
-            throw error;
-        }
-    }
-    /**
-     * Sparse vector search using SPLADE++ (stub)
-     *
-     * TODO: Phase 2 implementation
-     * - Integrate SPLADE++ sparse embeddings
-     * - Query sparse index in Qdrant
-     * - Return top-k sparse results
-     *
-     * @param querySparseVector - Query sparse embedding
-     * @param topK - Number of results to return
-     * @returns Array of sparse search results
-     */
-    async sparseSearch(_querySparseVector, _topK = 5) {
-        console.warn("sparseSearch: Not yet implemented (Phase 2)");
-        return [];
-    }
-    /**
-     * BM25 full-text search (stub)
-     *
-     * TODO: Phase 2 implementation
-     * - Integrate BM25 index (Qdrant or external)
-     * - Tokenize and search query text
-     * - Return top-k BM25 results
-     *
-     * @param queryText - Query text for full-text search
-     * @param topK - Number of results to return
-     * @returns Array of BM25 search results
-     */
-    async bm25Search(_queryText, _topK = 5) {
-        console.warn("bm25Search: Not yet implemented (Phase 2)");
-        return [];
-    }
-    /**
-     * Reciprocal Rank Fusion combining multiple indexes
-     *
-     * Implements RRF formula to combine rankings from dense, sparse, and BM25 indexes:
-     * RRF(d) = Σ 1 / (k + rank(d))
-     *
-     * where k is the fusion parameter (default 60) and rank is the position in each ranking.
-     *
-     * TODO: Phase 2 - Integrate with sparse/BM25 results once available
-     *
-     * @param denseResults - Results from dense search
-     * @param sparseResults - Results from sparse search
-     * @param bm25Results - Results from BM25 search
-     * @param k - RRF fusion parameter (default: 60)
-     * @returns Fused results sorted by RRF score
-     */
-    static rrfFusion(denseResults, sparseResults = [], bm25Results = [], k = 60) {
-        // Create a map to accumulate scores
-        const resultMap = new Map();
-        // Process dense results
-        denseResults.forEach((result, index) => {
-            const rrfScore = 1 / (k + index + 1);
-            resultMap.set(result.id, {
-                id: result.id,
-                denseScore: result.score,
-                fusedScore: rrfScore,
-                payload: result.payload,
-                rank: 0, // Will be set after final sort
-            });
-        });
-        // Process sparse results
-        sparseResults.forEach((result, index) => {
-            const rrfScore = 1 / (k + index + 1);
-            const existing = resultMap.get(result.id);
-            if (existing) {
-                existing.sparseScore = result.score;
-                existing.fusedScore += rrfScore;
-            }
-            else {
-                resultMap.set(result.id, {
-                    id: result.id,
-                    sparseScore: result.score,
-                    fusedScore: rrfScore,
-                    payload: result.payload,
-                    rank: 0,
-                });
-            }
-        });
-        // Process BM25 results
-        bm25Results.forEach((result, index) => {
-            const rrfScore = 1 / (k + index + 1);
-            const existing = resultMap.get(result.id);
-            if (existing) {
-                existing.bm25Score = result.score;
-                existing.fusedScore += rrfScore;
-            }
-            else {
-                resultMap.set(result.id, {
-                    id: result.id,
-                    bm25Score: result.score,
-                    fusedScore: rrfScore,
-                    payload: result.payload,
-                    rank: 0,
-                });
-            }
-        });
-        // Sort by fused score and assign ranks
-        const fused = Array.from(resultMap.values())
-            .sort((a, b) => b.fusedScore - a.fusedScore)
-            .map((result, index) => {
-            result.rank = index + 1;
-            return result;
-        });
-        return fused;
-    }
-    /**
-     * Hybrid search combining all available indexes
-     *
-     * Currently implements dense search only. Will be extended to include
-     * sparse vectors and BM25 once those are implemented in Phase 2.
-     *
-     * Pipeline:
-     * 1. Dense vector search (semantic search)
-     * 2. Sparse vector search (keyword-level semantics)
-     * 3. BM25 full-text search
-     * 4. Reciprocal Rank Fusion
-     *
-     * @param queryVector - Query embedding (1024-dim for BGE-large)
-     * @param topK - Number of final results to return (default: 5)
-     * @returns Array of fused results ranked by combined scores
-     */
-    async hybridSearch(queryVector, topK = 5) {
-        // Phase 1: Dense search only
-        const denseResults = await this.denseSearch(queryVector, topK);
-        // Phase 2: Will add sparse and BM25
-        // const sparseResults = await this.sparseSearch(querySparseVector, topK);
-        // const bm25Results = await this.bm25Search(queryText, topK);
-        // Combine results with RRF
-        const fused = HybridSearchEngine.rrfFusion(denseResults);
-        return fused.slice(0, topK);
-    }
-    /**
-     * Add or update a memory record with embedding
-     *
-     * @param id - Unique identifier for the memory
-     * @param vector - Dense embedding (1024-dim)
-     * @param payload - Associated metadata (content, timestamp, source, etc.)
-     */
-    async upsertMemory(id, vector, payload) {
-        // Validate vector dimensions and values (SEC-005)
-        validateVector(vector, this.vectorSize);
-        try {
-            await this.client.upsert(this.collectionName, {
-                points: [
-                    {
-                        id: id,
-                        vector: vector,
-                        payload: payload || {},
-                    },
-                ],
-            });
-        }
-        catch (error) {
-            console.error("Failed to upsert memory:", error instanceof Error ? error.message : error);
-            throw error;
-        }
-    }
-    /**
-     * Delete a memory record
-     *
-     * @param id - Unique identifier of the memory to delete
-     */
-    async deleteMemory(id) {
-        try {
-            await this.client.delete(this.collectionName, {
-                points: [id],
-            });
-        }
-        catch (error) {
-            console.error("Failed to delete memory:", error instanceof Error ? error.message : error);
-            throw error;
-        }
-    }
-    /**
-     * Get collection statistics
-     *
-     * @returns Object containing collection size, vector count, etc.
-     */
-    async getCollectionStats() {
-        try {
-            const info = await this.client.getCollection(this.collectionName);
-            return {
-                pointsCount: info.points_count,
-                indexedVectorsCount: info.indexed_vectors_count,
-                segmentsCount: info.segments_count,
-                status: info.status,
-            };
-        }
-        catch (error) {
-            console.error("Failed to get collection stats:", error instanceof Error ? error.message : error);
-            throw error;
-        }
-    }
-}
-/**
- * Factory function to create and initialize a hybrid search engine
- *
- * Usage:
- * ```typescript
- * const engine = await createHybridSearchEngine();
- * const results = await engine.hybridSearch(queryVector);
- * ```
- *
- * @param qdrantUrl - Qdrant server URL (default: http://localhost:6333)
- * @param collectionName - Name of the collection (default: memory-vectors)
- * @param vectorSize - Dimension of dense vectors (default: 1024 for BGE-large)
- * @param apiKey - Optional Qdrant API key for authentication
- */
-export async function createHybridSearchEngine(qdrantUrl, collectionName, vectorSize, apiKey) {
-    const engine = new HybridSearchEngine(qdrantUrl, collectionName, vectorSize, apiKey);
-    await engine.initializeCollection();
-    return engine;
-}
-//# sourceMappingURL=hybrid-search.js.map

package/dist/retrieval 2/hybrid-search.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hybrid-search.js","sourceRoot":"","sources":["../../src/retrieval/hybrid-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,sBAAsB,EAAE,MAAM,wBAAwB,CAAC;AAmDhF;;;;;GAKG;AACH,MAAM,OAAO,kBAAkB;IACrB,MAAM,CAAe;IACrB,cAAc,CAAS;IACvB,UAAU,CAAS;IAE3B;;;;;;;OAOG;IACH,YACE,YAAoB,uBAAuB,EAC3C,iBAAyB,gBAAgB,EACzC,aAAqB,IAAI,EACzB,MAAe;QAEf,kEAAkE;QAClE,IAAI,CAAC,cAAc,GAAG,sBAAsB,CAAC,cAAc,CAAC,CAAC;QAC7D,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,MAAM,YAAY,GAAqC;YACrD,GAAG,EAAE,SAAS;SACf,CAAC;QAEF,0BAA0B;QAC1B,IAAI,MAAM,EAAE,CAAC;YACX,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,oBAAoB;QACxB,IAAI,CAAC;YACH,6BAA6B;YAC7B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YACvD,MAAM,gBAAgB,GAAG,WAAW,CAAC,WAAW,CAAC,IAAI,CACnD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,cAAc,CACtC,CAAC;YAEF,IAAI,gBAAgB,EAAE,CAAC;gBACrB,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,CAAC,cAAc,kBAAkB,CAAC,CAAC;gBAClE,OAAO;YACT,CAAC;YAED,gDAAgD;YAChD,MAAM,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,cAAc,EAAE;gBACtD,OAAO,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,UAAU;oBACrB,QAAQ,EAAE,QAAQ;iBACnB;aACF,CAAC,CAAC;YAEH,OAAO,CAAC,GAAG,CACT,uBAAuB,IAAI,CAAC,cAAc,UAAU,IAAI,CAAC,UAAU,cAAc,CAClF,CAAC;YAEF,0CAA0C;YAC1C,iCAAiC;QACnC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,kCAAkC,EAClC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;YACF,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,WAAW,CACf,WAAqB,EACrB,OAAe,CAAC;QAEhB,kDAAkD;QAClD,cAAc,CAAC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAE7C,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE;gBAClE,MAAM,EAAE,WAAW;gBACnB,KAAK,EAAE,IAAI;gBACX,YAAY,EAAE,IAAI;gBAClB,WAAW,EAAE,KAAK;aACnB,CAAC,CAAC;YAEH,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBACpC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrB,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,SAAS;aACrC,CAAC,CAAC,CAAC;QACN,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,sBAAsB,EACtB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;YACF,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,YAAY,CAChB,kBAA0C,EAC1C,QAAgB,CAAC;QAEjB,OAAO,CAAC,IAAI,CAAC,6CAA6C,CAAC,CAAC;QAC5D,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,UAAU,CACd,UAAkB,EAClB,QAAgB,CAAC;QAEjB,OAAO,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;QAC1D,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,SAAS,CACd,YAAiC,EACjC,gBAAsC,EAAE,EACxC,cAAkC,EAAE,EACpC,IAAY,EAAE;QAEd,oCAAoC;QACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAA8B,CAAC;QAExD,wBAAwB;QACxB,YAAY,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YACrC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE;gBACvB,EAAE,EAAE,MAAM,CAAC,EAAE;gBACb,UAAU,EAAE,MAAM,CAAC,KAAK;gBACxB,UAAU,EAAE,QAAQ;gBACpB,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,IAAI,EAAE,CAAC,EAAE,+BAA+B;aACzC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,yBAAyB;QACzB,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC;gBACpC,QAAQ,CAAC,UAAU,IAAI,QAAQ,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE;oBACvB,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,WAAW,EAAE,MAAM,CAAC,KAAK;oBACzB,UAAU,EAAE,QAAQ;oBACpB,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,IAAI,EAAE,CAAC;iBACR,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,uBAAuB;QACvB,WAAW,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;YACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC1C,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;gBAClC,QAAQ,CAAC,UAAU,IAAI,QAAQ,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE;oBACvB,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,SAAS,EAAE,MAAM,CAAC,KAAK;oBACvB,UAAU,EAAE,QAAQ;oBACpB,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,IAAI,EAAE,CAAC;iBACR,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,uCAAuC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;aACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACrB,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACxB,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;QAEL,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,YAAY,CAChB,WAAqB,EACrB,OAAe,CAAC;QAEhB,6BAA6B;QAC7B,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAE/D,oCAAoC;QACpC,0EAA0E;QAC1E,8DAA8D;QAE9D,2BAA2B;QAC3B,MAAM,KAAK,GAAG,kBAAkB,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAEzD,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,YAAY,CAChB,EAAU,EACV,MAAgB,EAChB,OAAiC;QAEjC,kDAAkD;QAClD,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QAExC,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE;gBAC5C,MAAM,EAAE;oBACN;wBACE,EAAE,EAAE,EAAE;wBACN,MAAM,EAAE,MAAM;wBACd,OAAO,EAAE,OAAO,IAAI,EAAE;qBACvB;iBACF;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,0BAA0B,EAC1B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;YACF,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,CAAC,EAAU;QAC3B,IAAI,CAAC;YACH,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE;gBAC5C,MAAM,EAAE,CAAC,EAAE,CAAC;aACb,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,0BAA0B,EAC1B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;YACF,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,kBAAkB;QACtB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAClE,OAAO;gBACL,WAAW,EAAE,IAAI,CAAC,YAAY;gBAC9B,mBAAmB,EAAE,IAAI,CAAC,qBAAqB;gBAC/C,aAAa,EAAE,IAAI,CAAC,cAAc;gBAClC,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,iCAAiC,EACjC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;YACF,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;CACF;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,SAAkB,EAClB,cAAuB,EACvB,UAAmB,EACnB,MAAe;IAEf,MAAM,MAAM,GAAG,IAAI,kBAAkB,CAAC,SAAS,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IACrF,MAAM,MAAM,CAAC,oBAAoB,EAAE,CAAC;IACpC,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/router 2/smart-router.d.ts

@@ -1,111 +0,0 @@
-/**
- * Smart Query Router
- *
- * Implements intelligent routing logic from v3.0 plan:
- * 1. Always check working memory first (fast path)
- * 2. Classify query type using regex patterns
- * 3. Route to appropriate handler based on classification
- * 4. Fall back to hybrid search for complex queries
- */
-/**
- * Query type enumeration
- * Used to classify queries and route to appropriate handlers
- */
-export declare enum QueryType {
-    FACTUAL = "factual",
-    PREFERENCE = "preference",
-    PROJECT = "project",
-    TEMPORAL = "temporal",
-    SKILL = "skill",
-    COMPLEX = "complex"
-}
-/**
- * Query classification result
- */
-export interface ClassificationResult {
-    type: QueryType;
-    confidence: number;
-    matchedPattern?: string;
-}
-/**
- * Context for routing decisions
- */
-export interface RoutingContext {
-    userId: string;
-    conversationId: string;
-    timestamp: Date;
-    metadata?: Record<string, unknown>;
-}
-/**
- * Memory result from any layer
- */
-export interface MemoryResult {
-    id: string;
-    source: "working" | "semantic" | "procedural" | "hybrid";
-    content: string;
-    similarity: number;
-    timestamp: Date;
-    confidence?: number;
-}
-/**
- * Classify a query into one of the six query types
- *
- * Uses simple regex patterns to identify query intent without LLM calls.
- * Falls back to 'complex' for ambiguous queries.
- *
- * Patterns (in order of specificity):
- * - skill: "like before", "same as", "same way", "how you", "analyze"
- * - factual: "what is", "who is", "where is"
- * - temporal: "last week", "yesterday", "recently", etc.
- * - preference: "prefer", "want", "style", "favorite"
- * - project: "project", "working on", "decided", "building", "creating", "developing"
- * - complex: fallback for anything else
- */
-export declare function classifyQuery(query: string): ClassificationResult;
-/**
- * Smart query router following v3.0 plan retrieval strategy
- *
- * Routing decision tree:
- * 1. Check working memory first (5ms, high confidence threshold)
- * 2. Classify query type with regex
- * 3. Route to appropriate handler:
- *    - factual: direct entity lookup
- *    - preference: preference retrieval
- *    - project: graph traversal with HippoRAG
- *    - temporal: time-based filtering
- *    - skill: skill library search
- *    - complex: hybrid search (dense + sparse + BM25)
- *
- * @param query - The user's query string
- * @param context - Routing context (user, conversation, etc.)
- * @returns Promise resolving to array of memory results
- *
- * @throws Error if query is empty or context is invalid
- */
-export declare function retrieve(query: string, context: RoutingContext): Promise<MemoryResult[]>;
-/**
- * Extract entity name from a query
- *
- * Implementation stub for entity extraction
- * Will later integrate with NER or simple heuristics
- */
-export declare function extractEntityName(query: string): string | null;
-/**
- * Extract domain/category from a query
- *
- * Implementation stub for domain extraction
- * Used for preference and skill queries
- */
-export declare function extractDomain(query: string): string | null;
-/**
- * Parse temporal references from query
- *
- * Implementation stub for temporal parsing
- * Will extract time ranges like "last week", "yesterday", etc.
- */
-export interface TimeRange {
-    startDate: Date;
-    endDate: Date;
-}
-export declare function parseTimeRange(query: string): TimeRange | null;
-//# sourceMappingURL=smart-router.d.ts.map

package/dist/router 2/smart-router.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"smart-router.d.ts","sourceRoot":"","sources":["../../src/router/smart-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;;GAGG;AACH,oBAAY,SAAS;IACnB,OAAO,YAAY;IACnB,UAAU,eAAe;IACzB,OAAO,YAAY;IACnB,QAAQ,aAAa;IACrB,KAAK,UAAU;IACf,OAAO,YAAY;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,IAAI,EAAE,SAAS,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,cAAc,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,IAAI,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,YAAY,GAAG,QAAQ,CAAC;IACzD,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,oBAAoB,CA0FjE;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAsB,QAAQ,CAC5B,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,cAAc,GACtB,OAAO,CAAC,YAAY,EAAE,CAAC,CAyDzB;AAmND;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI9D;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI1D;AAED;;;;;GAKG;AACH,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,IAAI,CAAC;IAChB,OAAO,EAAE,IAAI,CAAC;CACf;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI,CAI9D"}