@claude-flow/memory 3.0.0-alpha.9 → 3.0.1

package/dist/smart-retrieval.js

@@ -0,0 +1,399 @@
+/**
+ * SmartRetrieval — LongMemEval-derived retrieval pipeline (ADR-090)
+ *
+ * Wraps a raw HNSW `SearchFn` with the optimizations identified by the
+ * ADR-088 LongMemEval benchmark:
+ *
+ *   1. Query expansion (template-based, no LLM)
+ *   2. Multi-query fan-out + Reciprocal Rank Fusion
+ *   3. Recency boost from metadata timestamps
+ *   4. MMR diversity re-ranking (token-Jaccard proxy)
+ *   5. Session round-robin for multi-session coverage
+ *
+ * The module is pluggable: callers provide a `SearchFn` that hits whatever
+ * raw store they use (AgentDB HNSW, sql.js, a test fake, etc.). That keeps
+ * `@claude-flow/memory` free of a hard dependency on the CLI's memory-initializer
+ * and makes the pipeline easy to benchmark in isolation.
+ */
+// ── Query Expansion ────────────────────────────────────────────
+const STOPWORDS = new Set([
+    'a', 'an', 'and', 'are', 'as', 'at', 'be', 'but', 'by', 'did', 'do', 'does',
+    'for', 'from', 'has', 'have', 'how', 'i', 'if', 'in', 'is', 'it', 'its', 'me',
+    'my', 'of', 'on', 'or', 'that', 'the', 'this', 'to', 'was', 'were', 'what',
+    'when', 'where', 'which', 'who', 'why', 'will', 'with', 'you', 'your',
+]);
+/**
+ * Default query expansion set. Keeps variants cheap (≤3) so we only pay
+ * ~3× the HNSW cost on the hot path.
+ */
+export function defaultQueryExpansions(query) {
+    const trimmed = query.trim();
+    if (!trimmed)
+        return [];
+    const variants = new Set();
+    variants.add(trimmed);
+    const keywords = keywordExtract(trimmed);
+    if (keywords && keywords !== trimmed.toLowerCase()) {
+        variants.add(keywords);
+    }
+    // Context-priming variant — helps when the query is short or imperative.
+    const words = trimmed.toLowerCase().replace(/[?.!]+$/, '');
+    if (words && !words.startsWith('tell me')) {
+        variants.add(`tell me about ${words}`);
+    }
+    return [...variants];
+}
+function keywordExtract(query) {
+    return query
+        .toLowerCase()
+        .replace(/[^\w\s]/g, ' ')
+        .split(/\s+/)
+        .filter((w) => w.length > 2 && !STOPWORDS.has(w))
+        .join(' ');
+}
+/**
+ * Public-facing Reciprocal Rank Fusion. Takes any number of pre-sorted
+ * candidate lists (best-first) and fuses them with the RRF score
+ * `sum(1 / (k + rank_i))`. Used by the ADR-125 Phase 5 hybridSearch
+ * controller to fuse dense + sparse arms.
+ */
+export function applyRRF(rankedLists, k = 60) {
+    return reciprocalRankFusion(rankedLists, k);
+}
+function reciprocalRankFusion(rankedLists, k) {
+    const fused = new Map();
+    for (const list of rankedLists) {
+        for (let rank = 0; rank < list.length; rank++) {
+            const cand = list[rank];
+            const rrfContribution = 1 / (k + rank + 1);
+            const key = candidateKey(cand);
+            const existing = fused.get(key);
+            if (existing) {
+                existing.score += rrfContribution;
+                // Keep the highest raw score we've seen for display purposes.
+                if (cand.score > existing.candidate.score) {
+                    existing.candidate = cand;
+                }
+            }
+            else {
+                fused.set(key, { candidate: cand, score: rrfContribution });
+            }
+        }
+    }
+    return [...fused.values()].sort((a, b) => b.score - a.score);
+}
+function candidateKey(cand) {
+    // Fall back through id → key → content hash so deduplication is robust
+    // even when the raw store omits ids.
+    return cand.id || cand.key || cand.content.slice(0, 128);
+}
+// ── Recency Boost ──────────────────────────────────────────────
+function applyRecencyBoost(scored, opts) {
+    const halfLifeMs = opts.recencyHalfLifeDays * 24 * 60 * 60 * 1000;
+    if (halfLifeMs <= 0)
+        return scored;
+    return scored
+        .map(({ candidate, score }) => {
+        const ts = pickTimestamp(candidate);
+        if (!ts || !Number.isFinite(ts)) {
+            return { candidate, score };
+        }
+        const ageMs = Math.max(0, opts.now - ts);
+        // Exponential decay, normalized to [0,1].
+        const recency = Math.pow(0.5, ageMs / halfLifeMs);
+        const boosted = score * (1 + opts.recencyWeight * recency);
+        return { candidate, score: boosted };
+    })
+        .sort((a, b) => b.score - a.score);
+}
+function pickTimestamp(cand) {
+    if (cand.updatedAt && Number.isFinite(cand.updatedAt))
+        return cand.updatedAt;
+    if (cand.createdAt && Number.isFinite(cand.createdAt))
+        return cand.createdAt;
+    const meta = cand.metadata;
+    if (meta) {
+        const candidates = ['timestamp', 'updatedAt', 'createdAt', 'time', 'ts'];
+        for (const k of candidates) {
+            const v = meta[k];
+            if (typeof v === 'number' && Number.isFinite(v))
+                return v;
+            if (typeof v === 'string') {
+                const parsed = Date.parse(v);
+                if (Number.isFinite(parsed))
+                    return parsed;
+            }
+        }
+    }
+    return undefined;
+}
+// ── MMR Diversity (embedding-cosine, token-Jaccard fallback) ───
+//
+// Dream Cycle 2026-09-03: 2026 production practice (LangChain's reference
+// `maximal_marginal_relevance`, Qdrant's native `Mmr` query, Weaviate 1.37's
+// MMR reranker) universally computes MMR's "similarity to already-selected"
+// term over the embedding space, not lexical overlap — token-Jaccard misses
+// low-token-overlap paraphrases that embeddings correctly flag as
+// near-duplicates (see e.g. openclaw/openclaw#19760). Ruflo's own retrieval
+// pipeline already computes these embeddings upstream; this only threads
+// them through to MMR. Falls back to token-Jaccard whenever either
+// candidate lacks an embedding (test fakes, or a SearchFn that doesn't
+// supply one) or the two embeddings have mismatched dimensions, so existing
+// callers/tests that never populate `.embedding` are unaffected.
+/**
+ * Public-facing MMR rerank.
+ *
+ * Re-exported as `applyMMR` for ADR-125 Phase 5 callers (the hybridSearch
+ * controller). Takes already-scored candidates plus an MMR lambda
+ * (1.0 = pure relevance, 0.0 = pure diversity).
+ */
+export function applyMMR(scored, lambda = 0.7, limit) {
+    return mmrRerank(scored, lambda, limit ?? scored.length);
+}
+function mmrRerank(scored, lambda, limit) {
+    if (scored.length <= 1)
+        return scored.slice(0, limit);
+    // Lazy, per-candidate token cache: PR #3169 made embedding-cosine the
+    // common `pairSimilarity` path, so eager per-outer-pass tokenization
+    // (the prior implementation) mostly computed tokens that were then
+    // discarded. Tokens are now computed at most once per candidate, only
+    // when the Jaccard fallback actually needs them (Dream Cycle 2026-09-10).
+    const tokenCache = new Map();
+    const getTokens = (item) => {
+        let tokens = tokenCache.get(item.candidate);
+        if (!tokens) {
+            tokens = tokenize(item.candidate.content);
+            tokenCache.set(item.candidate, tokens);
+        }
+        return tokens;
+    };
+    const selected = [];
+    const remaining = [...scored];
+    // Running per-remaining-candidate "max similarity to any already-selected
+    // item" cache. #3169/#3266 made the Jaccard-fallback *tokenization* lazy
+    // but left this half of the redundant-recompute problem untouched: every
+    // outer pass still re-walked the full `selected` list for every remaining
+    // candidate (O(candidates x selected) `pairSimilarity` calls per pass,
+    // growing every round). Since `max(0, s_1, ..., s_k)` can be folded in
+    // incrementally, each round only needs one new comparison per remaining
+    // candidate (to the just-added item) instead of re-comparing against the
+    // whole selected set — turning the total `pairSimilarity` call count from
+    // O(candidates x selected^2) into O(candidates x selected) (Dream Cycle
+    // 2026-09-28, flagged A-grade by 2026-09-27's memory scan). The zero floor
+    // matches the original loop's `let maxOverlap = 0` seed exactly, so the
+    // fold-in is mathematically identical to recomputing the max from
+    // scratch — output is byte-identical, not merely "close enough".
+    const maxSimCache = new Map();
+    // Seed with the top-scored candidate.
+    const first = remaining.shift();
+    selected.push(first);
+    while (selected.length < limit && remaining.length > 0) {
+        let bestIdx = -1;
+        let bestMmr = -Infinity;
+        const newest = selected[selected.length - 1];
+        for (let i = 0; i < remaining.length; i++) {
+            const cand = remaining[i];
+            const simToNewest = pairSimilarity(cand.candidate.embedding, newest.candidate.embedding, cand, newest, getTokens);
+            const maxOverlap = Math.max(maxSimCache.get(cand) ?? 0, simToNewest);
+            maxSimCache.set(cand, maxOverlap);
+            const mmr = lambda * cand.score - (1 - lambda) * maxOverlap;
+            if (mmr > bestMmr) {
+                bestMmr = mmr;
+                bestIdx = i;
+            }
+        }
+        if (bestIdx < 0)
+            break;
+        const [chosen] = remaining.splice(bestIdx, 1);
+        maxSimCache.delete(chosen);
+        selected.push(chosen);
+    }
+    return selected;
+}
+/** Cosine similarity when both embeddings exist, agree in dimension, and are well-formed; token-Jaccard (computed lazily via `getTokens`) otherwise. */
+function pairSimilarity(embA, embB, a, b, getTokens) {
+    if (isWellFormedEmbedding(embA) &&
+        isWellFormedEmbedding(embB) &&
+        embA.length === embB.length) {
+        return cosineSimilarity(embA, embB);
+    }
+    return jaccard(getTokens(a), getTokens(b));
+}
+/**
+ * Guards against malformed embeddings (NaN/Infinity components, empty
+ * arrays, non-arrays) reaching `cosineSimilarity`, where a single NaN/
+ * Infinity would poison the dot product and silently corrupt every
+ * downstream MMR comparison for the rest of the rerank — falls back to
+ * `jaccard` instead, same as a missing/dimension-mismatched embedding.
+ */
+function isWellFormedEmbedding(emb) {
+    return (Array.isArray(emb) &&
+        emb.length > 0 &&
+        emb.every((v) => typeof v === 'number' && Number.isFinite(v)));
+}
+function cosineSimilarity(a, b) {
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    if (normA === 0 || normB === 0)
+        return 0;
+    return dot / (Math.sqrt(normA) * Math.sqrt(normB));
+}
+/**
+ * Exported (this package's `exports` map is a `"./*"` wildcard, so this is
+ * real public API, not just test access) so the mmrRerank tokenize-call-
+ * count regression test can spy on it (Dream Cycle 2026-09-10). Pure and
+ * side-effect-free, so widening its visibility carries no behavioral risk.
+ */
+export function tokenize(text) {
+    return new Set(text
+        .toLowerCase()
+        .replace(/[^\w\s]/g, ' ')
+        .split(/\s+/)
+        .filter((t) => t.length > 2 && !STOPWORDS.has(t)));
+}
+function jaccard(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let intersect = 0;
+    for (const t of a)
+        if (b.has(t))
+            intersect++;
+    const union = a.size + b.size - intersect;
+    return union === 0 ? 0 : intersect / union;
+}
+// ── Session Round-Robin ────────────────────────────────────────
+function sessionRoundRobin(scored, sessionKey, limit) {
+    if (scored.length === 0)
+        return scored;
+    const bySession = new Map();
+    for (const item of scored) {
+        const sid = getSessionId(item.candidate, sessionKey) ?? '__no_session__';
+        const bucket = bySession.get(sid);
+        if (bucket)
+            bucket.push(item);
+        else
+            bySession.set(sid, [item]);
+    }
+    // If every candidate falls in the same bucket we can't diversify — pass through.
+    if (bySession.size <= 1)
+        return scored.slice(0, limit);
+    // Round-robin across session buckets, preferring each bucket's highest score.
+    const buckets = [...bySession.values()].map((b) => [...b].sort((a, b) => b.score - a.score));
+    const interleaved = [];
+    const seen = new Set();
+    while (interleaved.length < limit) {
+        let progressed = false;
+        for (const bucket of buckets) {
+            while (bucket.length > 0) {
+                const next = bucket.shift();
+                const key = candidateKey(next.candidate);
+                if (seen.has(key))
+                    continue;
+                seen.add(key);
+                interleaved.push(next);
+                progressed = true;
+                break;
+            }
+            if (interleaved.length >= limit)
+                break;
+        }
+        if (!progressed)
+            break;
+    }
+    return interleaved;
+}
+function getSessionId(cand, key) {
+    const meta = cand.metadata;
+    if (!meta)
+        return undefined;
+    const v = meta[key];
+    return typeof v === 'string' ? v : undefined;
+}
+// ── Public API ─────────────────────────────────────────────────
+export async function smartSearch(search, opts) {
+    const start = Date.now();
+    const limit = opts.limit ?? 10;
+    const threshold = opts.threshold ?? 0.3;
+    const fanOutK = opts.fanOutK ?? Math.max(limit * 3, 20);
+    const rrfK = opts.rrfK ?? 60;
+    const recencyHalfLifeDays = opts.recencyHalfLifeDays ?? 30;
+    const recencyWeight = opts.recencyWeight ?? 0.2;
+    const mmrLambda = opts.mmrLambda ?? 0.7;
+    const sessionKey = opts.sessionKey ?? 'session_id';
+    const now = opts.now ?? Date.now();
+    const multiQuery = opts.multiQuery !== false;
+    const recencyBoost = opts.recencyBoost !== false;
+    const diversityMMR = opts.diversityMMR !== false;
+    const sessionDiversity = opts.sessionDiversity !== false;
+    const expander = opts.queryExpansions ?? defaultQueryExpansions;
+    // ── Phase 1: query expansion + fan-out ──
+    const variants = multiQuery ? expander(opts.query) : [opts.query];
+    if (variants.length === 0)
+        variants.push(opts.query);
+    const ranked = [];
+    let totalRaw = 0;
+    for (const v of variants) {
+        const resp = await search({
+            query: v,
+            namespace: opts.namespace,
+            limit: fanOutK,
+            threshold,
+        });
+        ranked.push(resp.results);
+        totalRaw += resp.results.length;
+    }
+    // ── Phase 2: RRF fusion ──
+    let scored = ranked.length === 1
+        ? ranked[0].map((c) => ({ candidate: c, score: c.score }))
+        : reciprocalRankFusion(ranked, rrfK);
+    const afterRrfCount = scored.length;
+    // ── Phase 3: recency boost ──
+    if (recencyBoost) {
+        scored = applyRecencyBoost(scored, { recencyHalfLifeDays, recencyWeight, now });
+    }
+    const afterRecencyCount = scored.length;
+    // Truncate before MMR so we don't re-rank thousands of items.
+    if (scored.length > fanOutK)
+        scored = scored.slice(0, fanOutK);
+    // ── Phase 4: MMR diversity ──
+    if (diversityMMR) {
+        scored = mmrRerank(scored, mmrLambda, Math.min(limit * 2, scored.length));
+    }
+    else {
+        scored = scored.slice(0, Math.min(limit * 2, scored.length));
+    }
+    const afterMmrCount = scored.length;
+    // ── Phase 5: session round-robin ──
+    let final = scored;
+    if (sessionDiversity) {
+        final = sessionRoundRobin(scored, sessionKey, limit);
+    }
+    else {
+        final = scored.slice(0, limit);
+    }
+    const afterSessionCount = final.length;
+    return {
+        results: final.slice(0, limit).map(({ candidate, score }) => ({
+            ...candidate,
+            rawScore: candidate.rawScore ?? candidate.score,
+            score,
+        })),
+        stats: {
+            variantCount: variants.length,
+            variants,
+            rawCandidateCount: totalRaw,
+            afterRrfCount,
+            afterRecencyCount,
+            afterMmrCount,
+            afterSessionCount,
+            durationMs: Date.now() - start,
+        },
+    };
+}
+//# sourceMappingURL=smart-retrieval.js.map

package/dist/smart-retrieval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"smart-retrieval.js","sourceRoot":"","sources":["../src/smart-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAsGH,kEAAkE;AAElE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM;IAC3E,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IAC7E,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IAC1E,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;CACtE,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAClD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAEtB,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,QAAQ,IAAI,QAAQ,KAAK,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC;QACnD,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACzB,CAAC;IAED,yEAAyE;IACzE,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;IAC3D,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1C,QAAQ,CAAC,GAAG,CAAC,iBAAiB,KAAK,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,cAAc,CAAC,KAAa;IACnC,OAAO,KAAK;SACT,WAAW,EAAE;SACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAChD,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CACtB,WAAkB,EAClB,IAAY,EAAE;IAEd,OAAO,oBAAoB,CAAC,WAAkB,EAAE,CAAC,CAAQ,CAAC;AAC5D,CAAC;AAED,SAAS,oBAAoB,CAC3B,WAAgC,EAChC,CAAS;IAET,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyD,CAAC;IAE/E,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,MAAM,eAAe,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,KAAK,IAAI,eAAe,CAAC;gBAClC,8DAA8D;gBAC9D,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;oBAC1C,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC;gBAC5B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,YAAY,CAAC,IAAqB;IACzC,uEAAuE;IACvE,qCAAqC;IACrC,OAAO,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED,kEAAkE;AAElE,SAAS,iBAAiB,CACxB,MAAgB,EAChB,IAAmG;IAEnG,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;IAClE,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAEnC,OAAO,MAAM;SACV,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE;QAC5B,MAAM,EAAE,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QAC9B,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC;QACzC,0CAA0C;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,UAAU,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,CAAC;QAC3D,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;IACvC,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,aAAa,CAAC,IAAqB;IAC1C,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC;IAC7E,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,UAAU,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;YAC1D,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC;oBAAE,OAAO,MAAM,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,kEAAkE;AAClE,EAAE;AACF,0EAA0E;AAC1E,6EAA6E;AAC7E,4EAA4E;AAC5E,4EAA4E;AAC5E,kEAAkE;AAClE,4EAA4E;AAC5E,yEAAyE;AACzE,mEAAmE;AACnE,uEAAuE;AACvE,4EAA4E;AAC5E,iEAAiE;AAEjE;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CACtB,MAA8C,EAC9C,SAAiB,GAAG,EACpB,KAAc;IAEd,OAAO,SAAS,CAAC,MAAa,EAAE,MAAM,EAAE,KAAK,IAAI,MAAM,CAAC,MAAM,CAAQ,CAAC;AACzE,CAAC;AAED,SAAS,SAAS,CAAC,MAAgB,EAAE,MAAc,EAAE,KAAa;IAChE,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEtD,sEAAsE;IACtE,qEAAqE;IACrE,mEAAmE;IACnE,sEAAsE;IACtE,0EAA0E;IAC1E,MAAM,UAAU,GAAG,IAAI,GAAG,EAAgC,CAAC;IAC3D,MAAM,SAAS,GAAG,CAAC,IAAY,EAAe,EAAE;QAC9C,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC1C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAE9B,0EAA0E;IAC1E,yEAAyE;IACzE,yEAAyE;IACzE,0EAA0E;IAC1E,uEAAuE;IACvE,uEAAuE;IACvE,wEAAwE;IACxE,yEAAyE;IACzE,0EAA0E;IAC1E,wEAAwE;IACxE,2EAA2E;IAC3E,wEAAwE;IACxE,kEAAkE;IAClE,iEAAiE;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,sCAAsC;IACtC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;IACjC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAErB,OAAO,QAAQ,CAAC,MAAM,GAAG,KAAK,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,IAAI,OAAO,GAAG,CAAC,QAAQ,CAAC;QACxB,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,WAAW,GAAG,cAAc,CAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EACxB,MAAM,CAAC,SAAS,CAAC,SAAS,EAC1B,IAAI,EACJ,MAAM,EACN,SAAS,CACV,CAAC;YACF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,CAAC;YACrE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAElC,MAAM,GAAG,GAAG,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,UAAU,CAAC;YAC5D,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;gBAClB,OAAO,GAAG,GAAG,CAAC;gBACd,OAAO,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,IAAI,OAAO,GAAG,CAAC;YAAE,MAAM;QACvB,MAAM,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAC9C,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,wJAAwJ;AACxJ,SAAS,cAAc,CACrB,IAA0B,EAC1B,IAA0B,EAC1B,CAAS,EACT,CAAS,EACT,SAAwC;IAExC,IACE,qBAAqB,CAAC,IAAI,CAAC;QAC3B,qBAAqB,CAAC,IAAI,CAAC;QAC3B,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAC3B,CAAC;QACD,OAAO,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,qBAAqB,CAAC,GAAyB;IACtD,OAAO,CACL,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC;QAClB,GAAG,CAAC,MAAM,GAAG,CAAC;QACd,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAC9D,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,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,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzC,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,GAAG,CACZ,IAAI;SACD,WAAW,EAAE;SACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACpD,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,CAAc,EAAE,CAAc;IAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,EAAE,CAAC;IAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC;IAC1C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC;AAC7C,CAAC;AAED,kEAAkE;AAElE,SAAS,iBAAiB,CACxB,MAAgB,EAChB,UAAkB,EAClB,KAAa;IAEb,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAEvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,IAAI,gBAAgB,CAAC;QACzE,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACzB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,iFAAiF;IACjF,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEvD,8EAA8E;IAC9E,MAAM,OAAO,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAChD,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CACzC,CAAC;IACF,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,OAAO,WAAW,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;QAClC,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;gBAC7B,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,UAAU,GAAG,IAAI,CAAC;gBAClB,MAAM;YACR,CAAC;YACD,IAAI,WAAW,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACzC,CAAC;QACD,IAAI,CAAC,UAAU;YAAE,MAAM;IACzB,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,SAAS,YAAY,CAAC,IAAqB,EAAE,GAAW;IACtD,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,IAAI,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/C,CAAC;AAED,kEAAkE;AAElE,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,MAAgB,EAChB,IAAwB;IAExB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;IAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;IAC7B,MAAM,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,IAAI,EAAE,CAAC;IAC3D,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,GAAG,CAAC;IAChD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC;IACxC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,YAAY,CAAC;IACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEnC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC;IAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,KAAK,KAAK,CAAC;IACjD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,KAAK,KAAK,CAAC;IACjD,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,KAAK,KAAK,CAAC;IAEzD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,IAAI,sBAAsB,CAAC;IAEhE,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAErD,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC;YACxB,KAAK,EAAE,CAAC;YACR,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,OAAO;YACd,SAAS;SACV,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1B,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAClC,CAAC;IAED,4BAA4B;IAC5B,IAAI,MAAM,GACR,MAAM,CAAC,MAAM,KAAK,CAAC;QACjB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,oBAAoB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEzC,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC;IAEpC,+BAA+B;IAC/B,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,GAAG,iBAAiB,CAAC,MAAM,EAAE,EAAE,mBAAmB,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC;IAExC,8DAA8D;IAC9D,IAAI,MAAM,CAAC,MAAM,GAAG,OAAO;QAAE,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAE/D,+BAA+B;IAC/B,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5E,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC;IAEpC,qCAAqC;IACrC,IAAI,KAAK,GAAa,MAAM,CAAC;IAC7B,IAAI,gBAAgB,EAAE,CAAC;QACrB,KAAK,GAAG,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;IACD,MAAM,iBAAiB,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvC,OAAO;QACL,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5D,GAAG,SAAS;YACZ,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,SAAS,CAAC,KAAK;YAC/C,KAAK;SACN,CAAC,CAAC;QACH,KAAK,EAAE;YACL,YAAY,EAAE,QAAQ,CAAC,MAAM;YAC7B,QAAQ;YACR,iBAAiB,EAAE,QAAQ;YAC3B,aAAa;YACb,iBAAiB;YACjB,aAAa;YACb,iBAAiB;YACjB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SAC/B;KACF,CAAC;AACJ,CAAC"}

package/dist/smart-retrieval.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=smart-retrieval.test.d.ts.map

package/dist/smart-retrieval.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"smart-retrieval.test.d.ts","sourceRoot":"","sources":["../src/smart-retrieval.test.ts"],"names":[],"mappings":""}