@melandlabs/memory-store 0.2.6 → 0.3.0

package/dist/search/unified-search.d.ts

@@ -1,103 +1,5 @@
-import { d as UnifiedSearchDeps } from '../config-BYfTzG3h.js';
-
-/**
- * Pure helpers used by the unified memory search pipeline.
- *
- * Kept side-effect free so they can be reused by tests, MCP tools,
- * and the HTTP daemon without pulling in any of the heavier
- * storage/search implementations.
- */
-type UnifiedMemorySearchSource = "memory" | "insights" | "knowledge";
-interface UnifiedMemorySearchWarning {
-    source: UnifiedMemorySearchSource;
-    code: string;
-    message: string;
-}
-interface UnifiedMemorySearchInput {
-    userId: string;
-    query: string;
-    sources?: UnifiedMemorySearchSource[];
-    limit?: number;
-    threshold?: number;
-    authToken?: string;
-    includeArchivedInsights?: boolean;
-    botIds?: string[];
-    documentIds?: string[];
-    /**
-     * Optional ISO-8601 timestamp. When set, graph-aware retrieval and other
-     * snapshot consumers drop nodes / edges whose `applicability.validFrom` /
-     * `validUntil` window is closed at that instant. Backward-compatible:
-     * omitted `asOf` keeps the legacy behaviour exactly.
-     */
-    asOf?: string;
-    /**
-     * How to merge per-source result lists. Defaults to `"similarity"` —
-     * the legacy global sort by similarity, then type/id tie-break. The
-     * alternate value `"rrf"` invokes reciprocal-rank fusion across the
-     * lists fed via the (internal) `rankedLists` option.
-     */
-    mergeStrategy?: UnifiedMemoryMergeStrategy;
-}
-type UnifiedMemoryMergeStrategy = "similarity" | "rrf";
-/**
- * A single ranked list from one retrieval channel. Used by the RRF merge to
- * combine multiple signals (semantic + lexical + insights + knowledge) without
- * flattening them into a single similarity score first.
- */
-interface UnifiedMemoryRankedList {
-    name: "memory-bm25" | "memory-semantic" | "insights" | "knowledge";
-    hits: UnifiedMemorySearchResult[];
-}
-interface UnifiedMemorySearchResult {
-    type: "memory" | "insight" | "knowledge";
-    id: string;
-    content: string;
-    similarity: number;
-    metadata: Record<string, unknown>;
-}
-interface UnifiedMemorySearchOutput {
-    query: string;
-    sources: UnifiedMemorySearchSource[];
-    results: UnifiedMemorySearchResult[];
-    count: number;
-    warnings: UnifiedMemorySearchWarning[];
-}
-declare function normalizeUnifiedMemorySearchSources(sources: unknown): UnifiedMemorySearchSource[];
-declare function clampUnifiedMemorySearchLimit(limit: unknown): number;
-declare function clampUnifiedMemorySearchThreshold(threshold: unknown): number;
-declare function mergeUnifiedMemorySearchResults(results: UnifiedMemorySearchResult[], limit: number, options?: {
-    strategy?: UnifiedMemoryMergeStrategy;
-    rankedLists?: UnifiedMemoryRankedList[];
-}): UnifiedMemorySearchResult[];
-declare function normalizeUnifiedMemoryMergeStrategy(value: unknown): UnifiedMemoryMergeStrategy;
-/**
- * Reciprocal Rank Fusion across multiple ranked lists. Each list contributes
- * `1 / (k + rank + 1)` to a hit's accumulated score. Hits are de-duplicated by
- * `(type, id)` so the same message surfaced by both lexical and semantic
- * channels naturally outranks single-channel matches. Tie-break is
- * deterministic: descending RRF score, then `(type, id)` lexical.
- */
-declare function mergeUnifiedMemorySearchResultsRrf(lists: UnifiedMemoryRankedList[], limit: number, k?: number): UnifiedMemorySearchResult[];
-declare function toKnowledgeResult(result: {
-    chunkId: string;
-    documentId: string;
-    documentName: string;
-    content: string;
-    similarity: number;
-    chunkIndex: number;
-}): UnifiedMemorySearchResult;
-declare function toMemoryResult(result: {
-    id: string;
-    content: string;
-    similarity: number;
-    metadata: Record<string, unknown>;
-}): UnifiedMemorySearchResult;
-declare function isRawMemorySemanticResult(result: unknown): result is {
-    id: string;
-    content: string;
-    similarity: number;
-    metadata: Record<string, unknown>;
-};
+import { m as UnifiedMemorySearchInput, n as UnifiedMemorySearchOutput, o as UnifiedMemorySearchResult, H as UnifiedSearchDeps } from '../config-2Q092MUz.js';
+export { J as UnifiedMemoryMergeStrategy, K as UnifiedMemoryRankedList, l as UnifiedMemoryReasoningStrategy, p as UnifiedMemorySearchSource, q as UnifiedMemorySearchWarning, u as clampUnifiedMemorySearchLimit, v as clampUnifiedMemorySearchThreshold, A as isRawMemorySemanticResult, B as mergeUnifiedMemorySearchResults, L as mergeUnifiedMemorySearchResultsRrf, N as normalizeUnifiedMemoryMergeStrategy, C as normalizeUnifiedMemoryReasoningStrategy, D as normalizeUnifiedMemorySearchSources, F as toKnowledgeResult, G as toMemoryResult } from '../config-2Q092MUz.js';
 
 /**
  * Unified semantic search facade.
@@ -114,4 +16,4 @@ interface UnifiedSearch {
 }
 declare function createUnifiedSearch(deps?: UnifiedSearchDeps): UnifiedSearch;
 
-export { type UnifiedMemoryMergeStrategy, type UnifiedMemoryRankedList, type UnifiedMemorySearchInput, type UnifiedMemorySearchOutput, type UnifiedMemorySearchResult, type UnifiedMemorySearchSource, type UnifiedMemorySearchWarning, type UnifiedSearch, clampUnifiedMemorySearchLimit, clampUnifiedMemorySearchThreshold, createUnifiedSearch, isRawMemorySemanticResult, mergeUnifiedMemorySearchResults, mergeUnifiedMemorySearchResultsRrf, normalizeUnifiedMemoryMergeStrategy, normalizeUnifiedMemorySearchSources, toKnowledgeResult, toMemoryResult };
+export { UnifiedMemorySearchInput, UnifiedMemorySearchOutput, UnifiedMemorySearchResult, type UnifiedSearch, createUnifiedSearch };