@steno-ai/engine 0.1.15 → 0.1.17

package/src/retrieval/graph-traversal.js

@@ -1,208 +0,0 @@
-const DEFAULT_MAX_DEPTH = 2;
-const MAX_ALLOWED_DEPTH = 5;
-const DEFAULT_MAX_ENTITIES = 200;
-const MIN_TOKEN_LENGTH = 2;
-/** Known entity types to search against for each token */
-const ENTITY_TYPES = ['person', 'organization', 'location', 'topic', 'concept', 'product', 'event'];
-/**
- * Tokenize query into candidate entity names.
- * Splits on whitespace and dots, filters short words (< 2 chars), lowercases for canonical lookup.
- * Also preserves dot-separated names as candidate names (e.g., "clean.ai" → tokens ["clean", "ai"] + candidate "clean.ai")
- */
-export function tokenizeQuery(query) {
-    return query
-        .split(/[\s.]+/)
-        .map((t) => t.replace(/[^\w-]/g, ''))
-        .filter((t) => t.length >= MIN_TOKEN_LENGTH)
-        .map((t) => t.toLowerCase());
-}
-/**
- * Graph-based retrieval module.
- *
- * 1. Extracts potential entity names from query (simple tokenization)
- * 2. For each token, tries to find matching entities by canonical name
- * 3. Uses found entity IDs as seeds for graphTraversal
- * 4. Gets facts connected to discovered entities via getFactsForEntity
- * 5. Assigns graphScore based on hop distance: 1/(2^hop_depth)
- *    - 0-hop (seed) = 1.0
- *    - 1-hop = 0.5
- *    - 2-hop = 0.25
- *    - 3-hop = 0.125
- */
-export async function graphSearch(storage, embedding, query, tenantId, _scope, _scopeId, limit, config) {
-    const maxDepth = Math.min(config?.maxDepth ?? DEFAULT_MAX_DEPTH, MAX_ALLOWED_DEPTH);
-    const maxEntities = Math.min(config?.maxEntities ?? DEFAULT_MAX_ENTITIES, 500);
-    const tokens = tokenizeQuery(query);
-    if (tokens.length === 0)
-        return [];
-    const seedEntityIds = [];
-    // Build all candidate names to search for (tokens + multi-word combos + original query forms)
-    // NOTE: We intentionally do NOT always include 'user' — it's linked to nearly every fact
-    // and floods results. The 'user' entity is only included if the query mentions "user" or "me".
-    const candidateNames = [];
-    if (/\b(user|me|my|i)\b/i.test(query)) {
-        candidateNames.push('user');
-    }
-    for (const token of tokens) {
-        if (token.length >= 2)
-            candidateNames.push(token);
-    }
-    // Add multi-word combos from adjacent tokens
-    if (tokens.length >= 2) {
-        for (let i = 0; i < tokens.length - 1; i++) {
-            candidateNames.push(`${tokens[i]} ${tokens[i + 1]}`);
-            // Also try dot-separated form (for entities like "clean.ai")
-            candidateNames.push(`${tokens[i]}.${tokens[i + 1]}`);
-        }
-    }
-    // Add the full lowercased query as a candidate (catches exact entity names)
-    const fullQuery = query.toLowerCase().trim();
-    if (fullQuery.length >= 2 && !candidateNames.includes(fullQuery)) {
-        candidateNames.push(fullQuery);
-    }
-    // Also add dot-stripped version (e.g., "clean.ai" → "clean ai")
-    const dotStripped = fullQuery.replace(/\./g, ' ').replace(/\s+/g, ' ').trim();
-    if (dotStripped !== fullQuery && !candidateNames.includes(dotStripped)) {
-        candidateNames.push(dotStripped);
-    }
-    // ONE query to find all matching entities instead of 78 sequential calls
-    try {
-        const { data } = await storage.client
-            .from('entities')
-            .select('id, canonical_name')
-            .eq('tenant_id', tenantId)
-            .in('canonical_name', candidateNames);
-        if (data) {
-            for (const row of data) {
-                if (!seedEntityIds.includes(row.id)) {
-                    seedEntityIds.push(row.id);
-                }
-            }
-        }
-    }
-    catch (err) {
-        console.error('[steno-graph] Batch entity lookup failed, falling back to sequential:', err instanceof Error ? err.message : err);
-        // Fallback: sequential lookups if batch fails
-        const userEntity = await storage.findEntityByCanonicalName(tenantId, 'user', 'person');
-        if (userEntity)
-            seedEntityIds.push(userEntity.id);
-        for (const token of tokens) {
-            for (const entityType of ENTITY_TYPES) {
-                const entity = await storage.findEntityByCanonicalName(tenantId, token, entityType);
-                if (entity && !seedEntityIds.includes(entity.id)) {
-                    seedEntityIds.push(entity.id);
-                }
-            }
-        }
-    }
-    if (seedEntityIds.length === 0)
-        return [];
-    // 2. Graph traversal from seed entities
-    const traversalResult = await storage.graphTraversal({
-        tenantId,
-        entityIds: seedEntityIds,
-        maxDepth,
-        maxEntities,
-        asOf: config?.asOf,
-    });
-    if (traversalResult.entities.length === 0)
-        return [];
-    // Build hop-depth map from traversal result using BFS from seed entities
-    // via the edge list returned by the traversal
-    const entityHopMap = new Map();
-    // Initialize seed entities at depth 0
-    for (const entity of traversalResult.entities) {
-        if (seedEntityIds.includes(entity.id)) {
-            entityHopMap.set(entity.id, 0);
-        }
-    }
-    // Build adjacency list from edges
-    const adjacency = new Map();
-    for (const edge of traversalResult.edges) {
-        if (!adjacency.has(edge.sourceId))
-            adjacency.set(edge.sourceId, []);
-        if (!adjacency.has(edge.targetId))
-            adjacency.set(edge.targetId, []);
-        adjacency.get(edge.sourceId).push(edge.targetId);
-        adjacency.get(edge.targetId).push(edge.sourceId);
-    }
-    // BFS to compute min hop depth for all reachable entities
-    const queue = [...entityHopMap.keys()];
-    while (queue.length > 0) {
-        const currentId = queue.shift();
-        const currentDepth = entityHopMap.get(currentId);
-        const neighbors = adjacency.get(currentId) ?? [];
-        for (const neighborId of neighbors) {
-            if (!entityHopMap.has(neighborId)) {
-                entityHopMap.set(neighborId, currentDepth + 1);
-                queue.push(neighborId);
-            }
-        }
-    }
-    // Any entity not reached by BFS gets maxDepth
-    for (const entity of traversalResult.entities) {
-        if (!entityHopMap.has(entity.id)) {
-            entityHopMap.set(entity.id, maxDepth);
-        }
-    }
-    // 3. Get facts for ALL discovered entities in ONE query via fact_entities join
-    //    This replaces N sequential getFactsForEntity calls with 1 batch query.
-    const candidateMap = new Map();
-    const entityIds = traversalResult.entities.map(e => e.id);
-    if (entityIds.length > 0) {
-        const PER_ENTITY_LIMIT = Math.max(3, Math.ceil(limit / Math.max(entityIds.length, 1)));
-        // Single query: get all facts linked to any of these entities
-        try {
-            const batchResult = await storage.getFactsForEntities(tenantId, entityIds, PER_ENTITY_LIMIT);
-            for (const { entityId, fact } of batchResult) {
-                const hopDepth = entityHopMap.get(entityId) ?? maxDepth;
-                const graphScore = 1 / Math.pow(2, hopDepth);
-                const existing = candidateMap.get(fact.id);
-                if (existing) {
-                    if (graphScore > existing.graphScore) {
-                        existing.graphScore = graphScore;
-                    }
-                }
-                else {
-                    candidateMap.set(fact.id, {
-                        fact,
-                        vectorScore: 0,
-                        keywordScore: 0,
-                        graphScore,
-                        recencyScore: 0,
-                        salienceScore: 0,
-                        temporalScore: 0,
-                        source: 'graph',
-                    });
-                }
-            }
-        }
-        catch (err) {
-            console.error('[steno-graph] Batch getFactsForEntities failed, falling back to sequential:', err instanceof Error ? err.message : err);
-            // Fallback to sequential if batch not supported
-            for (const entity of traversalResult.entities) {
-                const hopDepth = entityHopMap.get(entity.id) ?? maxDepth;
-                const graphScore = 1 / Math.pow(2, hopDepth);
-                try {
-                    const factsResult = await storage.getFactsForEntity(tenantId, entity.id, { limit: 3 });
-                    for (const fact of factsResult.data) {
-                        if (!candidateMap.has(fact.id)) {
-                            candidateMap.set(fact.id, {
-                                fact, vectorScore: 0, keywordScore: 0, graphScore,
-                                recencyScore: 0, salienceScore: 0, temporalScore: 0, source: 'graph',
-                            });
-                        }
-                    }
-                }
-                catch (err) {
-                    console.error('[steno-graph] getFactsForEntity failed for entity:', entity.id, err instanceof Error ? err.message : err);
-                }
-            }
-        }
-    }
-    // 4. Return candidates, sorted by graphScore descending, limited
-    return Array.from(candidateMap.values())
-        .sort((a, b) => b.graphScore - a.graphScore)
-        .slice(0, limit);
-}
-//# sourceMappingURL=graph-traversal.js.map

package/src/retrieval/graph-traversal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph-traversal.js","sourceRoot":"","sources":["graph-traversal.ts"],"names":[],"mappings":"AAUA,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,oBAAoB,GAAG,GAAG,CAAC;AACjC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B,0DAA0D;AAC1D,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,cAAc,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,CAAU,CAAC;AAE7G;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,OAAO,KAAK;SACT,KAAK,CAAC,QAAQ,CAAC;SACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;SACpC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,gBAAgB,CAAC;SAC3C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AACjC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,OAAuB,EACvB,SAA2B,EAC3B,KAAa,EACb,QAAgB,EAChB,MAAc,EACd,QAAgB,EAChB,KAAa,EACb,MAAmC;IAEnC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,IAAI,iBAAiB,EAAE,iBAAiB,CAAC,CAAC;IACpF,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,IAAI,oBAAoB,EAAE,GAAG,CAAC,CAAC;IAE/E,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,8FAA8F;IAC9F,yFAAyF;IACzF,+FAA+F;IAC/F,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;YAAE,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IACD,6CAA6C;IAC7C,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACrD,6DAA6D;YAC7D,cAAc,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAC7C,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QACjE,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;IACD,gEAAgE;IAChE,MAAM,WAAW,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9E,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QACvE,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,yEAAyE;IACzE,IAAI,CAAC;QACH,MAAM,EAAE,IAAI,EAAE,GAAG,MAAO,OAAe,CAAC,MAAM;aAC3C,IAAI,CAAC,UAAU,CAAC;aAChB,MAAM,CAAC,oBAAoB,CAAC;aAC5B,EAAE,CAAC,WAAW,EAAE,QAAQ,CAAC;aACzB,EAAE,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;QACxC,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAqD,EAAE,CAAC;gBACxE,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBACpC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,KAAK,CAAC,uEAAuE,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjI,8CAA8C;QAC9C,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,yBAAyB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACvF,IAAI,UAAU;YAAE,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAClD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;gBACtC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;gBACpF,IAAI,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;oBACjD,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE1C,wCAAwC;IACxC,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,cAAc,CAAC;QACnD,QAAQ;QACR,SAAS,EAAE,aAAa;QACxB,QAAQ;QACR,WAAW;QACX,IAAI,EAAE,MAAM,EAAE,IAAI;KACnB,CAAC,CAAC;IAEH,IAAI,eAAe,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErD,yEAAyE;IACzE,8CAA8C;IAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,sCAAsC;IACtC,KAAK,MAAM,MAAM,IAAI,eAAe,CAAC,QAAQ,EAAE,CAAC;QAC9C,IAAI,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACtC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,KAAK,EAAE,CAAC;QACzC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACpE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACpE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAClD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED,0DAA0D;IAC1D,MAAM,KAAK,GAAG,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACjC,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;QAClD,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACjD,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBAClC,YAAY,CAAC,GAAG,CAAC,UAAU,EAAE,YAAY,GAAG,CAAC,CAAC,CAAC;gBAC/C,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,KAAK,MAAM,MAAM,IAAI,eAAe,CAAC,QAAQ,EAAE,CAAC;QAC9C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACjC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,4EAA4E;IAC5E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAqB,CAAC;IAClD,MAAM,SAAS,GAAG,eAAe,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE1D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvF,8DAA8D;QAC9D,IAAI,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,mBAAmB,CACnD,QAAQ,EAAE,SAAS,EAAE,gBAAgB,CACtC,CAAC;YAEF,KAAK,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7C,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;gBACxD,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBAC7C,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC3C,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,UAAU,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;wBACrC,QAAQ,CAAC,UAAU,GAAG,UAAU,CAAC;oBACnC,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;wBACxB,IAAI;wBACJ,WAAW,EAAE,CAAC;wBACd,YAAY,EAAE,CAAC;wBACf,UAAU;wBACV,YAAY,EAAE,CAAC;wBACf,aAAa,EAAE,CAAC;wBAChB,aAAa,EAAE,CAAC;wBAChB,MAAM,EAAE,OAAgB;qBACzB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,6EAA6E,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACvI,gDAAgD;YAChD,KAAK,MAAM,MAAM,IAAI,eAAe,CAAC,QAAQ,EAAE,CAAC;gBAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC;gBACzD,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;gBAC7C,IAAI,CAAC;oBACH,MAAM,WAAW,GAAG,MAAM,OAAO,CAAC,iBAAiB,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;oBACvF,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;wBACpC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;4BAC/B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gCACxB,IAAI,EAAE,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU;gCACjD,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,OAAgB;6BAC9E,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBAAC,OAAO,CAAC,KAAK,CAAC,oDAAoD,EAAE,MAAM,CAAC,EAAE,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAC,CAAC;YAC7I,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,OAAO,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;SACrC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;SAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC"}

package/src/retrieval/query-expansion.d.ts

@@ -1,20 +0,0 @@
-import type { LLMAdapter } from '../adapters/llm.js';
-/**
- * Multi-query expansion — like Hydra DB's Adaptive Query Expansion.
- *
- * Takes a single query and generates 3-4 semantically diverse reformulations.
- * Each captures a different interpretation of the user's intent:
- * - Paraphrases
- * - Temporal concretizations ("last week" → "projects from March 18-25")
- * - Domain-specific restatements
- *
- * All expanded queries are searched in parallel for higher recall.
- */
-export declare function expandQuery(llm: LLMAdapter, query: string): Promise<string[]>;
-/**
- * Fast heuristic expansion — no LLM needed.
- * Generates simple reformulations using string manipulation.
- * Use this when you don't have an LLM available or want zero latency.
- */
-export declare function expandQueryHeuristic(query: string): string[];
-//# sourceMappingURL=query-expansion.d.ts.map

package/src/retrieval/query-expansion.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"query-expansion.d.ts","sourceRoot":"","sources":["query-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAErD;;;;;;;;;;GAUG;AACH,wBAAsB,WAAW,CAC/B,GAAG,EAAE,UAAU,EACf,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,MAAM,EAAE,CAAC,CAoCnB;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CA0B5D"}

package/src/retrieval/query-expansion.js

@@ -1,76 +0,0 @@
-/**
- * Multi-query expansion — like Hydra DB's Adaptive Query Expansion.
- *
- * Takes a single query and generates 3-4 semantically diverse reformulations.
- * Each captures a different interpretation of the user's intent:
- * - Paraphrases
- * - Temporal concretizations ("last week" → "projects from March 18-25")
- * - Domain-specific restatements
- *
- * All expanded queries are searched in parallel for higher recall.
- */
-export async function expandQuery(llm, query) {
-    // Short queries or very specific ones don't need expansion
-    if (query.length < 15 || query.split(' ').length <= 3) {
-        return [query];
-    }
-    try {
-        const response = await llm.complete([
-            {
-                role: 'system',
-                content: `You generate search query expansions for a memory retrieval system. Given a user query, produce 3 alternative phrasings that capture different aspects of the intent.
-
-Rules:
-- Each alternative should use different keywords/phrasing
-- Include temporal concretizations if relevant ("recently" → "in the past week")
-- Include domain-specific restatements
-- Keep each alternative concise (under 15 words)
-- Return ONLY a JSON array of strings: ["query1", "query2", "query3"]`,
-            },
-            {
-                role: 'user',
-                content: query,
-            },
-        ], { temperature: 0.3, responseFormat: 'json' });
-        const parsed = JSON.parse(response.content);
-        const expansions = Array.isArray(parsed)
-            ? parsed.filter((q) => typeof q === 'string' && q.trim().length > 0)
-            : [];
-        // Always include the original query first
-        return [query, ...expansions.slice(0, 3)];
-    }
-    catch {
-        // If expansion fails, just use the original query
-        return [query];
-    }
-}
-/**
- * Fast heuristic expansion — no LLM needed.
- * Generates simple reformulations using string manipulation.
- * Use this when you don't have an LLM available or want zero latency.
- */
-export function expandQueryHeuristic(query) {
-    const queries = [query];
-    const lower = query.toLowerCase();
-    // Add "User" prefix version if not present
-    if (!lower.startsWith('user') && !lower.includes('my ') && !lower.includes('i ')) {
-        queries.push(`User ${lower}`);
-    }
-    // Convert "my X" to "user's X"
-    if (lower.includes('my ')) {
-        queries.push(lower.replace(/\bmy\b/g, "user's"));
-    }
-    // Convert questions to statements
-    if (lower.startsWith('what ') || lower.startsWith('who ') || lower.startsWith('where ') || lower.startsWith('when ')) {
-        const statement = lower
-            .replace(/^what (is|are|was|were) /, '')
-            .replace(/^who (is|are|was|were) /, '')
-            .replace(/^where (is|are|was|were|does|did) /, '')
-            .replace(/^when (did|does|was|were|is) /, '')
-            .replace(/\?$/, '');
-        if (statement !== lower)
-            queries.push(statement);
-    }
-    return queries.slice(0, 4);
-}
-//# sourceMappingURL=query-expansion.js.map

package/src/retrieval/query-expansion.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"query-expansion.js","sourceRoot":"","sources":["query-expansion.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,GAAe,EACf,KAAa;IAEb,2DAA2D;IAC3D,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtD,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,QAAQ,CAAC;YAClC;gBACE,IAAI,EAAE,QAAQ;gBACd,OAAO,EAAE;;;;;;;sEAOqD;aAC/D;YACD;gBACE,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,KAAK;aACf;SACF,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC,CAAC;QAEjD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YACtC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;YACjF,CAAC,CAAC,EAAE,CAAC;QAEP,0CAA0C;QAC1C,OAAO,CAAC,KAAK,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAAC,MAAM,CAAC;QACP,kDAAkD;QAClD,OAAO,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC;IACxB,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAElC,2CAA2C;IAC3C,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACjF,OAAO,CAAC,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,+BAA+B;IAC/B,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,kCAAkC;IAClC,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;QACrH,MAAM,SAAS,GAAG,KAAK;aACpB,OAAO,CAAC,0BAA0B,EAAE,EAAE,CAAC;aACvC,OAAO,CAAC,yBAAyB,EAAE,EAAE,CAAC;aACtC,OAAO,CAAC,oCAAoC,EAAE,EAAE,CAAC;aACjD,OAAO,CAAC,+BAA+B,EAAE,EAAE,CAAC;aAC5C,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACtB,IAAI,SAAS,KAAK,KAAK;YAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnD,CAAC;IAED,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7B,CAAC"}

package/src/retrieval/reranker.d.ts

@@ -1,15 +0,0 @@
-import type { EmbeddingAdapter } from '../adapters/embedding.js';
-import type { SearchResult } from './types.js';
-/**
- * Re-rank search results using embedding cosine similarity.
- * Deterministic, free (uses existing embedding model), no LLM call.
- *
- * How it works:
- * 1. Embed the query
- * 2. Embed all fact content texts in a single batch call
- * 3. Compute cosine similarity between query embedding and each fact embedding
- * 4. Blend the similarity score with the original fusion score
- * 5. Re-sort by blended score
- */
-export declare function rerank(embedding: EmbeddingAdapter, query: string, results: SearchResult[], topK?: number): Promise<SearchResult[]>;
-//# sourceMappingURL=reranker.d.ts.map

package/src/retrieval/reranker.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reranker.d.ts","sourceRoot":"","sources":["reranker.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C;;;;;;;;;;GAUG;AACH,wBAAsB,MAAM,CAC1B,SAAS,EAAE,gBAAgB,EAC3B,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,YAAY,EAAE,EACvB,IAAI,GAAE,MAAW,GAChB,OAAO,CAAC,YAAY,EAAE,CAAC,CAsBzB"}

package/src/retrieval/reranker.js

@@ -1,47 +0,0 @@
-/**
- * Re-rank search results using embedding cosine similarity.
- * Deterministic, free (uses existing embedding model), no LLM call.
- *
- * How it works:
- * 1. Embed the query
- * 2. Embed all fact content texts in a single batch call
- * 3. Compute cosine similarity between query embedding and each fact embedding
- * 4. Blend the similarity score with the original fusion score
- * 5. Re-sort by blended score
- */
-export async function rerank(embedding, query, results, topK = 10) {
-    if (results.length === 0)
-        return [];
-    if (results.length <= 1)
-        return results;
-    // Embed query + all fact texts in one batch
-    const texts = [query, ...results.map(r => r.fact.content)];
-    const embeddings = await embedding.embedBatch(texts);
-    const queryEmbedding = embeddings[0];
-    const factEmbeddings = embeddings.slice(1);
-    // Score each result by cosine similarity with the query
-    const RERANK_WEIGHT = 0.4; // 40% embedding similarity, 60% original fusion score
-    const scored = results.map((r, i) => {
-        const rerankScore = cosineSimilarity(queryEmbedding, factEmbeddings[i]);
-        const blendedScore = r.score * (1 - RERANK_WEIGHT) + rerankScore * RERANK_WEIGHT;
-        return { ...r, score: blendedScore };
-    });
-    // Sort by blended score
-    scored.sort((a, b) => b.score - a.score);
-    return scored.slice(0, topK);
-}
-function cosineSimilarity(a, b) {
-    if (a.length !== b.length || a.length === 0)
-        return 0;
-    let dotProduct = 0;
-    let normA = 0;
-    let normB = 0;
-    for (let i = 0; i < a.length; i++) {
-        dotProduct += a[i] * b[i];
-        normA += a[i] * a[i];
-        normB += b[i] * b[i];
-    }
-    const denom = Math.sqrt(normA) * Math.sqrt(normB);
-    return denom === 0 ? 0 : dotProduct / denom;
-}
-//# sourceMappingURL=reranker.js.map

package/src/retrieval/reranker.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reranker.js","sourceRoot":"","sources":["reranker.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAC1B,SAA2B,EAC3B,KAAa,EACb,OAAuB,EACvB,OAAe,EAAE;IAEjB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IAExC,4CAA4C;IAC5C,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3D,MAAM,UAAU,GAAG,MAAM,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACrD,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;IACtC,MAAM,cAAc,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAE3C,wDAAwD;IACxD,MAAM,aAAa,GAAG,GAAG,CAAC,CAAC,sDAAsD;IACjF,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAClC,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAE,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,WAAW,GAAG,aAAa,CAAC;QACjF,OAAO,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,wBAAwB;IACxB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACzB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,KAAK,CAAC;AAC9C,CAAC"}

package/src/retrieval/salience-scorer.d.ts

@@ -1,15 +0,0 @@
-import type { Candidate } from './types.js';
-export interface SalienceConfig {
-    halfLifeDays: number;
-    normalizationK: number;
-}
-/**
- * Score all candidates with recency and salience signals.
- *
- * recencyScore = pure time decay (how recently the fact was accessed)
- * salienceScore = importance x frequency factor (how important and reinforced)
- *
- * These are separate signals that feed into fusion with independent weights.
- */
-export declare function scoreSalience(candidates: Candidate[], config?: Partial<SalienceConfig>): Candidate[];
-//# sourceMappingURL=salience-scorer.d.ts.map

package/src/retrieval/salience-scorer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"salience-scorer.d.ts","sourceRoot":"","sources":["salience-scorer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C,MAAM,WAAW,cAAc;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,UAAU,EAAE,SAAS,EAAE,EACvB,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAC/B,SAAS,EAAE,CAsCb"}

package/src/retrieval/salience-scorer.js

@@ -1,41 +0,0 @@
-/**
- * Score all candidates with recency and salience signals.
- *
- * recencyScore = pure time decay (how recently the fact was accessed)
- * salienceScore = importance x frequency factor (how important and reinforced)
- *
- * These are separate signals that feed into fusion with independent weights.
- */
-export function scoreSalience(candidates, config) {
-    const halfLifeDays = config?.halfLifeDays ?? 30;
-    const normalizationK = config?.normalizationK ?? 50;
-    return candidates.map(candidate => {
-        const { fact } = candidate;
-        // Recency: blend of access recency + creation recency
-        // Access recency = how recently the fact was recalled (reinforcement)
-        // Creation recency = how recently the fact was created (freshness)
-        // Git-style versioning needs creation recency so newer versions of
-        // the same lineage naturally rank higher.
-        const lambda = Math.LN2 / halfLifeDays;
-        const daysSinceAccess = fact.lastAccessed
-            ? (Date.now() - new Date(fact.lastAccessed).getTime()) / (1000 * 60 * 60 * 24)
-            : Infinity;
-        const accessRecency = fact.lastAccessed ? Math.exp(-lambda * daysSinceAccess) : 0;
-        const daysSinceCreation = fact.createdAt
-            ? (Date.now() - new Date(fact.createdAt).getTime()) / (1000 * 60 * 60 * 24)
-            : Infinity;
-        const creationRecency = fact.createdAt ? Math.exp(-lambda * daysSinceCreation) : 0;
-        // Blend: 50% access recency + 50% creation recency
-        const recencyScore = 0.5 * accessRecency + 0.5 * creationRecency;
-        // Salience: importance x frequency factor
-        // This captures "how important is this fact AND how often has it been reinforced"
-        const frequencyFactor = Math.min(1.0, Math.log(1 + fact.frequency) / Math.log(1 + normalizationK));
-        const salienceScore = fact.importance * frequencyFactor;
-        return {
-            ...candidate,
-            recencyScore: Math.max(0, Math.min(1, recencyScore)),
-            salienceScore: Math.max(0, Math.min(1, salienceScore)),
-        };
-    });
-}
-//# sourceMappingURL=salience-scorer.js.map

package/src/retrieval/salience-scorer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"salience-scorer.js","sourceRoot":"","sources":["salience-scorer.ts"],"names":[],"mappings":"AAOA;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,UAAuB,EACvB,MAAgC;IAEhC,MAAM,YAAY,GAAG,MAAM,EAAE,YAAY,IAAI,EAAE,CAAC;IAChD,MAAM,cAAc,GAAG,MAAM,EAAE,cAAc,IAAI,EAAE,CAAC;IAEpD,OAAO,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;QAChC,MAAM,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC;QAE3B,sDAAsD;QACtD,sEAAsE;QACtE,mEAAmE;QACnE,mEAAmE;QACnE,0CAA0C;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,GAAG,YAAY,CAAC;QAEvC,MAAM,eAAe,GAAG,IAAI,CAAC,YAAY;YACvC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC9E,CAAC,CAAC,QAAQ,CAAC;QACb,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAElF,MAAM,iBAAiB,GAAG,IAAI,CAAC,SAAS;YACtC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC3E,CAAC,CAAC,QAAQ,CAAC;QACb,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnF,mDAAmD;QACnD,MAAM,YAAY,GAAG,GAAG,GAAG,aAAa,GAAG,GAAG,GAAG,eAAe,CAAC;QAEjE,0CAA0C;QAC1C,kFAAkF;QAClF,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC;QACnG,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC;QAExD,OAAO;YACL,GAAG,SAAS;YACZ,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YACpD,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;SACvD,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/src/retrieval/search.d.ts

@@ -1,21 +0,0 @@
-import type { StorageAdapter } from '../adapters/storage.js';
-import type { EmbeddingAdapter } from '../adapters/embedding.js';
-import type { CacheAdapter } from '../adapters/cache.js';
-import type { LLMAdapter } from '../adapters/llm.js';
-import type { SearchOptions, SearchResponse, FusionWeights } from './types.js';
-export interface SearchConfig {
-    storage: StorageAdapter;
-    embedding: EmbeddingAdapter;
-    cache?: CacheAdapter;
-    defaultWeights?: FusionWeights;
-    salienceHalfLifeDays?: number;
-    salienceNormalizationK?: number;
-    graphMaxDepth?: number;
-    graphMaxEntities?: number;
-    rerankerLLM?: LLMAdapter;
-    rerank?: boolean;
-    /** LLM for query expansion (optional — falls back to heuristic expansion) */
-    expansionLLM?: LLMAdapter;
-}
-export declare function search(config: SearchConfig, options: SearchOptions): Promise<SearchResponse>;
-//# sourceMappingURL=search.d.ts.map

package/src/retrieval/search.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["search.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AACjE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAa,MAAM,YAAY,CAAC;AAc1F,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,cAAc,CAAC;IACxB,SAAS,EAAE,gBAAgB,CAAC;IAC5B,KAAK,CAAC,EAAE,YAAY,CAAC;IACrB,cAAc,CAAC,EAAE,aAAa,CAAC;IAC/B,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,WAAW,CAAC,EAAE,UAAU,CAAC;IACzB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,6EAA6E;IAC7E,YAAY,CAAC,EAAE,UAAU,CAAC;CAC3B;AAED,wBAAsB,MAAM,CAC1B,MAAM,EAAE,YAAY,EACpB,OAAO,EAAE,aAAa,GACrB,OAAO,CAAC,cAAc,CAAC,CA6NzB"}