@monoes/monomindcli 2.16.12 → 2.16.13

package/dist/src/memory/memory-bridge-search.js

@@ -0,0 +1,383 @@
+/**
+ * Memory Bridge — the read/search path: bridgeSearchEntries (semantic +
+ * FTS5/BM25 keyword merge, stale and superseded-knowledge filtering,
+ * cross-encoder reranking). Split out of memory-bridge.ts, which re-exports
+ * it.
+ */
+import { _embedder, _reranker, _rerankerPromise, getBackend, loadReranker, rerankerDisabled, rerankResults, } from './memory-bridge-backend.js';
+import { blendScore, capResultContent, entryWeights, getAutomemConfig, logBridgeError, } from './memory-bridge-core.js';
+import { GLOBAL_BRAIN, getGlobalBrainDir, getProjectRoot } from './memory-bridge-paths.js';
+export async function bridgeSearchEntries(options) {
+    const backend = await getBackend(options.dbPath);
+    if (!backend)
+        return null;
+    try {
+        const { query: queryStr, limit = 10, threshold = 0.3 } = options;
+        // CLI callers pass 'all' as a no-filter sentinel — never treat it as a literal namespace
+        const namespace = options.namespace && options.namespace !== 'all' ? options.namespace : undefined;
+        const startTime = Date.now();
+        // ── Knowledge removal support (issue #106) ──────────────────────
+        // Pre-compute live document hashes for knowledge namespaces so we can
+        // (a) over-fetch to compensate for superseded entries being filtered,
+        // (b) filter them out after retrieval — ensuring removed documents
+        //     are invisible to EVERY caller, not just searchKnowledge.
+        // Dynamic import breaks the circular dependency: document-pipeline
+        // imports getProjectRoot from this module.
+        let _knowledgeLive = null;
+        let _knowledgeHasMeta = false;
+        let _isSupersededKey = null;
+        const knowledgeFilterActive = namespace?.startsWith('knowledge:') && !options.includeSuperseded;
+        if (knowledgeFilterActive) {
+            try {
+                const dp = await import('../knowledge/document-pipeline.js');
+                const rootDir = options.dbPath === GLOBAL_BRAIN
+                    ? getGlobalBrainDir()
+                    : (options.rootDir ?? getProjectRoot());
+                _knowledgeLive = dp.liveContentHashes(rootDir);
+                _knowledgeHasMeta = dp.hasKnowledgeMetadata(rootDir);
+                _isSupersededKey = dp.isSupersededKey;
+            }
+            catch (e) {
+                logBridgeError('bridgeSearchEntries.knowledgeFilter', e); /* non-fatal: skip filtering when pipeline is unavailable */
+            }
+        }
+        // Over-retrieve when the reranker is available: fetch more candidates so the
+        // cross-encoder can reshuffle them. The reranker trims back to `limit`.
+        // For knowledge namespaces, also over-fetch to compensate for superseded
+        // document versions that will be filtered out below.
+        const rerankerActive = !options.skipRerank && _reranker !== null && !rerankerDisabled();
+        const knowledgeLimit = _knowledgeLive && _knowledgeLive.size > 0
+            ? Math.min(Math.max(limit * 20, limit), 300)
+            : limit;
+        const retrieveK = rerankerActive
+            ? Math.min(knowledgeLimit * 3, Math.max(20, knowledgeLimit))
+            : knowledgeLimit;
+        let results = [];
+        let searchMethod = 'keyword';
+        // Reported to callers so "(semantic)" can never be printed over keyword hits.
+        // The two reasons for skipping the vector path are distinct and must not be
+        // conflated: a healthy model given an empty query is not a missing model.
+        let fallbackReason = !_embedder
+            ? 'no-embedding-model'
+            : queryStr.length === 0
+                ? 'empty-query'
+                : undefined;
+        let semanticAttempted = false;
+        if (_embedder && queryStr.length > 0) {
+            semanticAttempted = true;
+            try {
+                const queryEmbedding = await _embedder(queryStr);
+                const searchResults = await backend.search(queryEmbedding, {
+                    k: retrieveK,
+                    threshold,
+                    filters: namespace ? { type: 'exact', namespace } : undefined,
+                });
+                const { feedbackInfluence } = getAutomemConfig();
+                results = searchResults
+                    .map((r) => {
+                    const weights = entryWeights(r.entry.metadata);
+                    // Blend only here (semantic path): r.score is a genuine cosine similarity.
+                    const blended = blendScore(r.score, weights, feedbackInfluence);
+                    return {
+                        id: r.entry.id,
+                        key: r.entry.key,
+                        content: capResultContent(r.entry.content || ''),
+                        score: blended,
+                        namespace: r.entry.namespace,
+                        provenance: `semantic:${r.score.toFixed(3)}${blended !== r.score ? `→${blended.toFixed(3)}` : ''}`,
+                        tags: r.entry.tags ?? [],
+                        _createdAt: r.entry.createdAt || 0,
+                    };
+                })
+                    .sort((a, b) => b.score - a.score);
+                searchMethod = 'semantic';
+                fallbackReason = undefined;
+            }
+            catch (e) {
+                // fall through to keyword search — but never claim this was semantic
+                fallbackReason = 'embedding-failed';
+                if (process.env.DEBUG || process.env.MONOMIND_DEBUG)
+                    console.error('[memory-bridge] semantic search failed — falling back to keyword matching:', e);
+            }
+        }
+        // Keyword search — always runs (not just as a fallback).
+        // Entries stored without embeddings are invisible to the vector path,
+        // so keyword results are merged into semantic results (union, deduplicated
+        // by key) to ensure every findable entry surfaces regardless of whether
+        // it has an embedding.  Semantic hits take priority on score.
+        //
+        // Issue #66: When the backend has FTS5, keyword matching runs inside
+        // SQLite via MATCH — orders of magnitude faster than the old path that
+        // loaded up to 50k rows and scanned them in JS. The JS fallback is
+        // kept for sql.js WASM builds that lack the FTS5 extension.
+        {
+            const tokens = queryStr
+                .toLowerCase()
+                .split(/[^a-z0-9]+/)
+                .filter((t) => t.length > 1);
+            let keywordHits = [];
+            if (tokens.length) {
+                // ── FTS5 fast path ──────────────────────────────────────────
+                const fts5Results = typeof backend.keywordSearch === 'function'
+                    ? await backend.keywordSearch(queryStr, { namespace, limit }).catch(() => null)
+                    : null;
+                if (fts5Results !== null && fts5Results.length > 0) {
+                    // FTS5 rank is negative (lower = better); normalise to 0–1 against
+                    // the BEST (largest-magnitude) result, not a hard floor of 1
+                    // (issue #224). BM25 IDF goes to zero/negative when a query term
+                    // appears in most or all of the matched rows — a small or
+                    // lexically-homogeneous result set (a duplicated FTS row for one
+                    // entry, per sql-schema.ts's `ensureFTS5Triggers`, was one way to
+                    // reach exactly this) — so a genuinely-best (or sole) match can
+                    // legitimately have |rank| < 1. A hard `Math.max(…,
+                    // 1)` floor then divides that down toward 0, displaying the
+                    // correct top match as ~0.00 instead of its best-available 1.0.
+                    // Mirrors the identical fix already applied to the JS BM25
+                    // fallback below (#126-review): only fall back to a floor of 1
+                    // when every rank is genuinely 0 (nothing to normalise against),
+                    // never merely because the raw magnitude is under 1.
+                    const rawMaxRank = Math.max(...fts5Results.map((r) => Math.abs(r.rank)));
+                    const maxRank = rawMaxRank > 0 ? rawMaxRank : 1;
+                    keywordHits = fts5Results.map((r) => {
+                        const score = rawMaxRank > 0 ? Math.abs(r.rank) / maxRank : 1;
+                        return {
+                            id: r.id,
+                            key: r.key,
+                            content: capResultContent(r.content || ''),
+                            score,
+                            namespace: r.namespace,
+                            provenance: `keyword-fts5:${score.toFixed(2)}`,
+                            tags: [],
+                            _createdAt: 0,
+                        };
+                    });
+                }
+                else {
+                    // ── JS fallback (no FTS5 or empty FTS5 result) ────────────
+                    const entries = await backend.query({
+                        type: 'exact',
+                        ...(namespace ? { namespace } : {}),
+                        limit: 50000,
+                    });
+                    // #126: Bm25Index.build() costs real time at scale (measured in
+                    // bm25-index.ts's own header: ~113ms/673 chunks, ~1.7s/12.5k
+                    // chunks) — this fallback can be handed up to 50,000 entries, so
+                    // building a fresh index on every call without a cap would make
+                    // large stores' searches slower, not better. Below the cap, BM25
+                    // (proper IDF weighting) replaces the naive token-overlap-fraction
+                    // scan; above it, the fast scan keeps running so latency never
+                    // regresses. MONOMIND_BM25=0 disables this arm entirely (mirrors
+                    // the MONOMIND_RERANKER kill-switch).
+                    const BM25_ENTRY_CAP = 1500;
+                    const bm25Enabled = (process.env.MONOMIND_BM25 ?? '1') !== '0';
+                    let bm25Ok = false;
+                    if (bm25Enabled && entries.length > 0 && entries.length <= BM25_ENTRY_CAP) {
+                        try {
+                            const { Bm25Index } = await import('./bm25-index.js');
+                            // #126-review: index by the entry's ARRAY POSITION, not e.key —
+                            // memory_entries only enforces UNIQUE(namespace, key), so a bare
+                            // key string can legitimately repeat across namespaces (e.g. two
+                            // agents each storing a 'summary' key in their own namespace).
+                            // Keying by e.key alone collided in that case: every BM25 hit
+                            // sharing that key string resolved to whichever entry happened
+                            // to be inserted last into the lookup map, silently returning
+                            // the wrong entry's id/content/namespace.
+                            const chunks = entries.map((e, i) => ({
+                                key: String(i),
+                                text: `${e.key || ''} ${e.content || ''}`,
+                            }));
+                            const idx = Bm25Index.build(chunks, () => false); // no superseded concept at this generic KV level — filtered later by callers that care
+                            const hits = idx.search(queryStr, limit);
+                            // #126-review: Math.max(..., 1) as a divide-by-zero guard also
+                            // silently floors the normalization divisor whenever every real
+                            // score is < 1 (common for small/sparse corpora — exactly the
+                            // regime this capped fallback runs in), so the top hit stopped
+                            // normalizing to 1.0 as the comment below claims. Only fall
+                            // back to 1 when there is no positive score to divide by.
+                            const rawMax = hits.length ? Math.max(...hits.map((h) => h.score)) : 0;
+                            const maxScore = rawMax > 0 ? rawMax : 1;
+                            keywordHits = hits.map((h) => {
+                                const e = entries[Number(h.key)];
+                                const normalized = h.score / maxScore; // BM25 scores aren't comparable across queries/corpora — normalise 0-1 like the FTS5 path does
+                                return {
+                                    id: e.id,
+                                    key: e.key,
+                                    content: capResultContent(e.content || ''),
+                                    score: normalized,
+                                    namespace: e.namespace,
+                                    provenance: `keyword-bm25:${normalized.toFixed(2)}`,
+                                    tags: e.tags ?? [],
+                                    _createdAt: e.createdAt || 0,
+                                };
+                            });
+                            bm25Ok = true;
+                        }
+                        catch (e) {
+                            // #126-review: BM25 build/search had no local try/catch, unlike
+                            // every other sub-path in this function — an exception here
+                            // used to propagate to the function's single outer catch,
+                            // discarding the whole call (including already-computed
+                            // semantic results) instead of degrading to the naive scan
+                            // below, which is what every other keyword-path failure does.
+                            if (process.env.DEBUG || process.env.MONOMIND_DEBUG)
+                                console.error('[memory-bridge] BM25 keyword search failed — falling back to token-overlap scan:', e);
+                        }
+                    }
+                    if (!bm25Ok) {
+                        keywordHits = entries
+                            .map((e) => {
+                            const haystack = `${e.key || ''} ${e.content || ''}`.toLowerCase();
+                            const hits = tokens.filter((t) => haystack.includes(t)).length;
+                            return { e, score: hits / tokens.length };
+                        })
+                            .filter((x) => x.score > 0)
+                            .sort((a, b) => b.score - a.score)
+                            .slice(0, limit)
+                            .map(({ e, score }) => ({
+                            id: e.id,
+                            key: e.key,
+                            content: capResultContent(e.content || ''),
+                            // Raw token-overlap fraction, NOT rescaled to look like a cosine.
+                            score,
+                            namespace: e.namespace,
+                            provenance: `keyword:${score.toFixed(2)}`,
+                            tags: e.tags ?? [],
+                            _createdAt: e.createdAt || 0,
+                        }));
+                    }
+                }
+                // Issue #223/#224 follow-up: FTS5/BM25 ranks above are normalised
+                // RELATIVE to the best result in this call's own small candidate set
+                // (score = |rank| / maxRank), so the top — or sole — hit always
+                // lands at ~1.0 by construction, no matter how weak the actual
+                // match is. `options.threshold` compared against that already-
+                // inflated score can never reject a top/sole hit, so a single
+                // coincidental partial-token overlap looks exactly as confident as
+                // a genuine strong match. Gate on independent evidence instead: how
+                // much of the QUERY the candidate actually covers. This can only
+                // narrow the result set (never rescue something already excluded),
+                // and doesn't touch the rank-normalisation math other callers rely on.
+                keywordHits = keywordHits.filter((h) => {
+                    if (h.score < threshold)
+                        return false;
+                    const haystack = `${h.key || ''} ${h.content || ''}`.toLowerCase();
+                    const matchedFraction = tokens.filter((t) => haystack.includes(t)).length / tokens.length;
+                    return matchedFraction >= threshold;
+                });
+                if (results.length === 0) {
+                    // No semantic results — keyword is all we have.
+                    results = keywordHits;
+                    searchMethod = semanticAttempted ? 'keyword-fallback' : 'keyword';
+                    if (semanticAttempted && !fallbackReason)
+                        fallbackReason = 'no-semantic-matches';
+                }
+                else {
+                    // Merge: union deduplicated by key, semantic wins on duplicates.
+                    // Extras are flagged _keywordOnly so the reranking step below can
+                    // skip them — the cross-encoder scores r.content, and an entry
+                    // findable ONLY by keyword (e.g. a placeholder/near-empty content
+                    // whose relevance lives in the key) reranks as noise and gets
+                    // sliced off by the final `limit`, silently defeating the whole
+                    // point of merging it in. Guaranteed inclusion has to survive
+                    // reranking, not just the merge.
+                    const seenKeys = new Set(results.map((r) => r.key));
+                    const extras = keywordHits.filter((kh) => !seenKeys.has(kh.key));
+                    if (extras.length) {
+                        results = [...results, ...extras.map((e) => ({ ...e, _keywordOnly: true }))];
+                        // searchMethod stays 'semantic' — the primary path succeeded;
+                        // keyword only supplemented entries that lacked embeddings.
+                    }
+                }
+            }
+            else if (results.length === 0) {
+                // Empty token list AND no semantic results — nothing to search.
+                searchMethod = semanticAttempted ? 'keyword-fallback' : 'keyword';
+                if (semanticAttempted && !fallbackReason)
+                    fallbackReason = 'no-semantic-matches';
+            }
+        }
+        // Filter stale entries based on automem config — skip for knowledge
+        // namespaces (documents should remain searchable indefinitely)
+        // Stale filtering is per-RESULT namespace (documents stay searchable
+        // forever) — keying it on the query's namespace filter meant an
+        // all-namespace search silently dropped knowledge:* results past the
+        // stale cutoff.
+        // org:* (cross-run org memory) and rules are durable learned state like
+        // documents — the stale cliff silently erased org recall after a week.
+        const durableNs = (ns) => ns.startsWith('knowledge:') ||
+            ns.startsWith('org:') ||
+            ns.startsWith('agent:') ||
+            ns.startsWith('kg:') ||
+            ns === 'rules';
+        const isKnowledgeNs = namespace ? durableNs(namespace) : false;
+        if (!isKnowledgeNs) {
+            const { staleDays } = getAutomemConfig();
+            const staleCutoff = Date.now() - staleDays * 86400000;
+            results = results.filter((r) => durableNs(String(r.namespace ?? '')) || !r._createdAt || r._createdAt > staleCutoff);
+        }
+        results.forEach((r) => delete r._createdAt);
+        // ── Knowledge superseded filtering (issue #106) ─────────────────
+        // Remove document chunks whose content hash is no longer current
+        // (i.e. the document was removed via `knowledge_remove` or replaced
+        // by a newer ingest). This runs inside the bridge so every caller —
+        // embeddings_search, CLI `memory search`, and searchKnowledge — gets
+        // the same removal guarantee.
+        if (_knowledgeLive && _isSupersededKey && results.length > 0) {
+            results = results.filter((r) => !_isSupersededKey?.(String(r.key ?? ''), _knowledgeLive, _knowledgeHasMeta));
+            // Trim back to the originally requested limit after overfetch — but
+            // never let this blind size-based cut drop a _keywordOnly extra (see
+            // the merge above): reserve its slot and trim the rest first.
+            if (results.length > limit) {
+                const extras = results.filter((r) => r._keywordOnly);
+                const main = results.filter((r) => !r._keywordOnly);
+                const keep = Math.max(0, limit - extras.length);
+                results = [...main.slice(0, keep), ...extras.slice(0, limit)];
+            }
+        }
+        // Keyword-only extras are guaranteed to survive to the final result —
+        // pull them out before reranking so the cross-encoder (which scores
+        // r.content only) can't outrank them into oblivion, then reserve their
+        // slots when re-merging below.
+        const keywordOnlyResults = results.filter((r) => r._keywordOnly);
+        let rerankPool = results.filter((r) => !r._keywordOnly);
+        // ── Cross-encoder reranking ──────────────────────────────────────
+        // Fires only when: reranker loaded, >1 result, not explicitly skipped.
+        // Lazy-load on first qualifying search so startup stays fast.
+        let reranked = false;
+        if (!options.skipRerank && !rerankerDisabled() && rerankPool.length > 1) {
+            if (!_reranker && !_rerankerPromise) {
+                // First qualifying search — kick off the lazy load. This search
+                // proceeds without reranking; the NEXT search will use it.
+                loadReranker().catch(() => {
+                    /* swallowed — retry next time */
+                });
+            }
+            if (_reranker) {
+                const rr = await rerankResults(queryStr, rerankPool, limit);
+                rerankPool = rr.reranked;
+                reranked = rr.applied;
+            }
+        }
+        if (keywordOnlyResults.length) {
+            const keep = Math.max(0, limit - keywordOnlyResults.length);
+            results = [...rerankPool.slice(0, keep), ...keywordOnlyResults.slice(0, limit)];
+        }
+        else {
+            results = rerankPool;
+        }
+        results.forEach((r) => delete r._keywordOnly);
+        return {
+            success: true,
+            results,
+            searchTime: Date.now() - startTime,
+            searchMethod,
+            reranked,
+            ...(searchMethod === 'semantic' ? {} : { fallbackReason }),
+        };
+    }
+    catch (e) {
+        logBridgeError('bridgeSearchEntries', e);
+        return null;
+    }
+}
+//# sourceMappingURL=memory-bridge-search.js.map

package/dist/src/memory/memory-bridge-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-bridge-search.js","sourceRoot":"","sources":["../../../src/memory/memory-bridge-search.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,SAAS,EACT,SAAS,EACT,gBAAgB,EAChB,UAAU,EACV,YAAY,EACZ,gBAAgB,EAChB,aAAa,GACd,MAAM,4BAA4B,CAAC;AACpC,OAAO,EACL,UAAU,EACV,gBAAgB,EAChB,YAAY,EACZ,gBAAgB,EAChB,cAAc,GACf,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,YAAY,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAE3F,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,OAoBzC;IAyBC,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,IAAI,CAAC;QACH,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,EAAE,EAAE,SAAS,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC;QACjE,yFAAyF;QACzF,MAAM,SAAS,GACb,OAAO,CAAC,SAAS,IAAI,OAAO,CAAC,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QACnF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,mEAAmE;QACnE,sEAAsE;QACtE,sEAAsE;QACtE,mEAAmE;QACnE,+DAA+D;QAC/D,mEAAmE;QACnE,2CAA2C;QAC3C,IAAI,cAAc,GAAuB,IAAI,CAAC;QAC9C,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAC9B,IAAI,gBAAgB,GAET,IAAI,CAAC;QAChB,MAAM,qBAAqB,GAAG,SAAS,EAAE,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC;QAChG,IAAI,qBAAqB,EAAE,CAAC;YAC1B,IAAI,CAAC;gBACH,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,mCAAmC,CAAC,CAAC;gBAC7D,MAAM,OAAO,GACX,OAAO,CAAC,MAAM,KAAK,YAAY;oBAC7B,CAAC,CAAC,iBAAiB,EAAE;oBACrB,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,IAAI,cAAc,EAAE,CAAC,CAAC;gBAC5C,cAAc,GAAG,EAAE,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;gBAC/C,iBAAiB,GAAG,EAAE,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;gBACrD,gBAAgB,GAAG,EAAE,CAAC,eAAe,CAAC;YACxC,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,cAAc,CACZ,qCAAqC,EACrC,CAAC,CACF,CAAC,CAAC,4DAA4D;YACjE,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,wEAAwE;QACxE,yEAAyE;QACzE,qDAAqD;QACrD,MAAM,cAAc,GAAG,CAAC,OAAO,CAAC,UAAU,IAAI,SAAS,KAAK,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxF,MAAM,cAAc,GAClB,cAAc,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC;YACvC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,EAAE,KAAK,CAAC,EAAE,GAAG,CAAC;YAC5C,CAAC,CAAC,KAAK,CAAC;QACZ,MAAM,SAAS,GAAG,cAAc;YAC9B,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC;YAC5D,CAAC,CAAC,cAAc,CAAC;QAEnB,IAAI,OAAO,GAAU,EAAE,CAAC;QACxB,IAAI,YAAY,GAAgD,SAAS,CAAC;QAC1E,8EAA8E;QAC9E,4EAA4E;QAC5E,0EAA0E;QAC1E,IAAI,cAAc,GAKF,CAAC,SAAS;YACxB,CAAC,CAAC,oBAAoB;YACtB,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBACrB,CAAC,CAAC,aAAa;gBACf,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAE9B,IAAI,SAAS,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,iBAAiB,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,cAAc,GAAG,MAAM,SAAS,CAAC,QAAQ,CAAC,CAAC;gBACjD,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE;oBACzD,CAAC,EAAE,SAAS;oBACZ,SAAS;oBACT,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;iBAC9D,CAAC,CAAC;gBACH,MAAM,EAAE,iBAAiB,EAAE,GAAG,gBAAgB,EAAE,CAAC;gBACjD,OAAO,GAAG,aAAa;qBACpB,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE;oBACd,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;oBAC/C,2EAA2E;oBAC3E,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,CAAC,CAAC;oBAChE,OAAO;wBACL,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;wBACd,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG;wBAChB,OAAO,EAAE,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;wBAChD,KAAK,EAAE,OAAO;wBACd,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS;wBAC5B,UAAU,EAAE,YAAY,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;wBAClG,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE;wBACxB,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC;qBACnC,CAAC;gBACJ,CAAC,CAAC;qBACD,IAAI,CAAC,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC/C,YAAY,GAAG,UAAU,CAAC;gBAC1B,cAAc,GAAG,SAAS,CAAC;YAC7B,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,qEAAqE;gBACrE,cAAc,GAAG,kBAAkB,CAAC;gBACpC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,cAAc;oBACjD,OAAO,CAAC,KAAK,CACX,4EAA4E,EAC5E,CAAC,CACF,CAAC;YACN,CAAC;QACH,CAAC;QAED,yDAAyD;QACzD,sEAAsE;QACtE,2EAA2E;QAC3E,wEAAwE;QACxE,8DAA8D;QAC9D,EAAE;QACF,qEAAqE;QACrE,uEAAuE;QACvE,mEAAmE;QACnE,4DAA4D;QAC5D,CAAC;YACC,MAAM,MAAM,GAAG,QAAQ;iBACpB,WAAW,EAAE;iBACb,KAAK,CAAC,YAAY,CAAC;iBACnB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/B,IAAI,WAAW,GAAU,EAAE,CAAC;YAE5B,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAClB,+DAA+D;gBAC/D,MAAM,WAAW,GACf,OAAO,OAAO,CAAC,aAAa,KAAK,UAAU;oBACzC,CAAC,CAAC,MAAM,OAAO,CAAC,aAAa,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;oBAC/E,CAAC,CAAC,IAAI,CAAC;gBAEX,IAAI,WAAW,KAAK,IAAI,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACnD,mEAAmE;oBACnE,6DAA6D;oBAC7D,iEAAiE;oBACjE,0DAA0D;oBAC1D,iEAAiE;oBACjE,kEAAkE;oBAClE,gEAAgE;oBAChE,oDAAoD;oBACpD,4DAA4D;oBAC5D,gEAAgE;oBAChE,2DAA2D;oBAC3D,+DAA+D;oBAC/D,iEAAiE;oBACjE,qDAAqD;oBACrD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC9E,MAAM,OAAO,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChD,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE;wBACvC,MAAM,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC9D,OAAO;4BACL,EAAE,EAAE,CAAC,CAAC,EAAE;4BACR,GAAG,EAAE,CAAC,CAAC,GAAG;4BACV,OAAO,EAAE,gBAAgB,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;4BAC1C,KAAK;4BACL,SAAS,EAAE,CAAC,CAAC,SAAS;4BACtB,UAAU,EAAE,gBAAgB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;4BAC9C,IAAI,EAAE,EAAc;4BACpB,UAAU,EAAE,CAAC;yBACd,CAAC;oBACJ,CAAC,CAAC,CAAC;gBACL,CAAC;qBAAM,CAAC;oBACN,6DAA6D;oBAC7D,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC;wBAClC,IAAI,EAAE,OAAO;wBACb,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;wBACnC,KAAK,EAAE,KAAK;qBACb,CAAC,CAAC;oBAEH,gEAAgE;oBAChE,6DAA6D;oBAC7D,iEAAiE;oBACjE,gEAAgE;oBAChE,iEAAiE;oBACjE,mEAAmE;oBACnE,+DAA+D;oBAC/D,iEAAiE;oBACjE,sCAAsC;oBACtC,MAAM,cAAc,GAAG,IAAI,CAAC;oBAC5B,MAAM,WAAW,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,aAAa,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC;oBAE/D,IAAI,MAAM,GAAG,KAAK,CAAC;oBACnB,IAAI,WAAW,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;wBAC1E,IAAI,CAAC;4BACH,MAAM,EAAE,SAAS,EAAE,GAAG,MAAM,MAAM,CAAC,iBAAiB,CAAC,CAAC;4BACtD,gEAAgE;4BAChE,iEAAiE;4BACjE,iEAAiE;4BACjE,+DAA+D;4BAC/D,8DAA8D;4BAC9D,+DAA+D;4BAC/D,8DAA8D;4BAC9D,0CAA0C;4BAC1C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC;gCACjD,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;gCACd,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE;6BAC1C,CAAC,CAAC,CAAC;4BACJ,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,uFAAuF;4BACzI,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;4BACzC,+DAA+D;4BAC/D,gEAAgE;4BAChE,8DAA8D;4BAC9D,+DAA+D;4BAC/D,4DAA4D;4BAC5D,0DAA0D;4BAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;4BACvE,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;4BACzC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gCAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gCACjC,MAAM,UAAU,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,+FAA+F;gCACtI,OAAO;oCACL,EAAE,EAAE,CAAC,CAAC,EAAE;oCACR,GAAG,EAAE,CAAC,CAAC,GAAG;oCACV,OAAO,EAAE,gBAAgB,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;oCAC1C,KAAK,EAAE,UAAU;oCACjB,SAAS,EAAE,CAAC,CAAC,SAAS;oCACtB,UAAU,EAAE,gBAAgB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;oCACnD,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE;oCAClB,UAAU,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC;iCAC7B,CAAC;4BACJ,CAAC,CAAC,CAAC;4BACH,MAAM,GAAG,IAAI,CAAC;wBAChB,CAAC;wBAAC,OAAO,CAAC,EAAE,CAAC;4BACX,gEAAgE;4BAChE,4DAA4D;4BAC5D,0DAA0D;4BAC1D,wDAAwD;4BACxD,2DAA2D;4BAC3D,8DAA8D;4BAC9D,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,cAAc;gCACjD,OAAO,CAAC,KAAK,CACX,kFAAkF,EAClF,CAAC,CACF,CAAC;wBACN,CAAC;oBACH,CAAC;oBACD,IAAI,CAAC,MAAM,EAAE,CAAC;wBACZ,WAAW,GAAG,OAAO;6BAClB,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE;4BACd,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC;4BACnE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;4BAC/D,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;wBAC5C,CAAC,CAAC;6BACD,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;6BAC/B,IAAI,CAAC,CAAC,CAAM,EAAE,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;6BAC3C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;6BACf,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAO,EAAE,EAAE,CAAC,CAAC;4BAC3B,EAAE,EAAE,CAAC,CAAC,EAAE;4BACR,GAAG,EAAE,CAAC,CAAC,GAAG;4BACV,OAAO,EAAE,gBAAgB,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;4BAC1C,kEAAkE;4BAClE,KAAK;4BACL,SAAS,EAAE,CAAC,CAAC,SAAS;4BACtB,UAAU,EAAE,WAAW,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;4BACzC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE;4BAClB,UAAU,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC;yBAC7B,CAAC,CAAC,CAAC;oBACR,CAAC;gBACH,CAAC;gBAED,kEAAkE;gBAClE,qEAAqE;gBACrE,gEAAgE;gBAChE,+DAA+D;gBAC/D,+DAA+D;gBAC/D,8DAA8D;gBAC9D,mEAAmE;gBACnE,oEAAoE;gBACpE,iEAAiE;gBACjE,mEAAmE;gBACnE,uEAAuE;gBACvE,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE;oBAC1C,IAAI,CAAC,CAAC,KAAK,GAAG,SAAS;wBAAE,OAAO,KAAK,CAAC;oBACtC,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC;oBACnE,MAAM,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;oBAC1F,OAAO,eAAe,IAAI,SAAS,CAAC;gBACtC,CAAC,CAAC,CAAC;gBAEH,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACzB,gDAAgD;oBAChD,OAAO,GAAG,WAAW,CAAC;oBACtB,YAAY,GAAG,iBAAiB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC;oBAClE,IAAI,iBAAiB,IAAI,CAAC,cAAc;wBAAE,cAAc,GAAG,qBAAqB,CAAC;gBACnF,CAAC;qBAAM,CAAC;oBACN,iEAAiE;oBACjE,kEAAkE;oBAClE,+DAA+D;oBAC/D,kEAAkE;oBAClE,8DAA8D;oBAC9D,gEAAgE;oBAChE,8DAA8D;oBAC9D,iCAAiC;oBACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,EAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBACtE,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;wBAClB,OAAO,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;wBAClF,8DAA8D;wBAC9D,4DAA4D;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,gEAAgE;gBAChE,YAAY,GAAG,iBAAiB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC;gBAClE,IAAI,iBAAiB,IAAI,CAAC,cAAc;oBAAE,cAAc,GAAG,qBAAqB,CAAC;YACnF,CAAC;QACH,CAAC;QAED,oEAAoE;QACpE,+DAA+D;QAC/D,qEAAqE;QACrE,gEAAgE;QAChE,qEAAqE;QACrE,gBAAgB;QAChB,wEAAwE;QACxE,uEAAuE;QACvE,MAAM,SAAS,GAAG,CAAC,EAAU,EAAE,EAAE,CAC/B,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;YAC3B,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC;YACrB,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC;YACvB,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;YACpB,EAAE,KAAK,OAAO,CAAC;QACjB,MAAM,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC/D,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,MAAM,EAAE,SAAS,EAAE,GAAG,gBAAgB,EAAE,CAAC;YACzC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,QAAQ,CAAC;YACtD,OAAO,GAAG,OAAO,CAAC,MAAM,CACtB,CAAC,CAAM,EAAE,EAAE,CACT,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,GAAG,WAAW,CACtF,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC;QAEjD,mEAAmE;QACnE,iEAAiE;QACjE,oEAAoE;QACpE,oEAAoE;QACpE,qEAAqE;QACrE,8BAA8B;QAC9B,IAAI,cAAc,IAAI,gBAAgB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7D,OAAO,GAAG,OAAO,CAAC,MAAM,CACtB,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,gBAAgB,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,cAAe,EAAE,iBAAiB,CAAC,CACzF,CAAC;YACF,oEAAoE;YACpE,qEAAqE;YACrE,8DAA8D;YAC9D,IAAI,OAAO,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;gBAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;gBAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;gBACzD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;gBAChD,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,oEAAoE;QACpE,uEAAuE;QACvE,+BAA+B;QAC/B,MAAM,kBAAkB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QAE7D,oEAAoE;QACpE,uEAAuE;QACvE,8DAA8D;QAC9D,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,CAAC,gBAAgB,EAAE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxE,IAAI,CAAC,SAAS,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACpC,gEAAgE;gBAChE,2DAA2D;gBAC3D,YAAY,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE;oBACxB,iCAAiC;gBACnC,CAAC,CAAC,CAAC;YACL,CAAC;YACD,IAAI,SAAS,EAAE,CAAC;gBACd,MAAM,EAAE,GAAG,MAAM,aAAa,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;gBAC5D,UAAU,GAAG,EAAE,CAAC,QAAQ,CAAC;gBACzB,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;YACxB,CAAC;QACH,CAAC;QAED,IAAI,kBAAkB,CAAC,MAAM,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;YAC5D,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QAClF,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,UAAU,CAAC;QACvB,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC;QAEnD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,OAAO;YACP,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YAClC,YAAY;YACZ,QAAQ;YACR,GAAG,CAAC,YAAY,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC;SAC3D,CAAC;IACJ,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,cAAc,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/src/memory/memory-bridge-sessions.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Memory Bridge — session lifecycle rows (start, end, latest) in the
+ * `sessions` namespace. Split out of memory-bridge.ts, which re-exports the
+ * public symbols.
+ */
+export declare function bridgeSessionStart(options: {
+    sessionId: string;
+    agentId?: string;
+    metadata?: Record<string, unknown>;
+    dbPath?: string;
+}): Promise<{
+    success: boolean;
+    id: string;
+    error?: string;
+} | null>;
+export declare function bridgeSessionEnd(options: {
+    sessionId: string;
+    summary?: string;
+    metrics?: Record<string, unknown>;
+    dbPath?: string;
+}): Promise<{
+    success: boolean;
+    error?: string;
+} | null>;
+/** The most recently started session recorded by bridgeSessionStart, read
+ *  back from its row — or null when there is none (or no backend). */
+export declare function bridgeLatestSession(options: {
+    excludeSessionId?: string;
+    dbPath?: string;
+}): Promise<{
+    sessionId: string;
+    status: string;
+    startedAt: string;
+    endedAt?: string;
+    summary?: string;
+    metrics?: Record<string, unknown>;
+} | null>;
+//# sourceMappingURL=memory-bridge-sessions.d.ts.map

package/dist/src/memory/memory-bridge-sessions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-bridge-sessions.d.ts","sourceRoot":"","sources":["../../../src/memory/memory-bridge-sessions.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,wBAAsB,kBAAkB,CAAC,OAAO,EAAE;IAChD,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,GAAG,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC,CAgBnE;AAED,wBAAsB,gBAAgB,CAAC,OAAO,EAAE;IAC9C,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,GAAG,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAAC,CAoCvD;AAED;sEACsE;AACtE,wBAAsB,mBAAmB,CAAC,OAAO,EAAE;IACjD,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB,GAAG,OAAO,CAAC;IACV,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC,GAAG,IAAI,CAAC,CAuCR"}

package/dist/src/memory/memory-bridge-sessions.js

@@ -0,0 +1,109 @@
+/**
+ * Memory Bridge — session lifecycle rows (start, end, latest) in the
+ * `sessions` namespace. Split out of memory-bridge.ts, which re-exports the
+ * public symbols.
+ */
+import { flushBackend, getBackend } from './memory-bridge-backend.js';
+import { logBridgeError } from './memory-bridge-core.js';
+import { bridgeStoreEntry } from './memory-bridge-store.js';
+// ===== Session lifecycle =====
+export async function bridgeSessionStart(options) {
+    return bridgeStoreEntry({
+        key: `session_${options.sessionId}`,
+        value: JSON.stringify({
+            sessionId: options.sessionId,
+            agentId: options.agentId,
+            startedAt: Date.now(),
+            status: 'active',
+            metadata: options.metadata ?? {},
+        }),
+        namespace: 'sessions',
+        tags: ['session', 'active'],
+        generateEmbeddingFlag: false,
+        dbPath: options.dbPath,
+        upsert: true,
+    });
+}
+export async function bridgeSessionEnd(options) {
+    const backend = await getBackend(options.dbPath);
+    if (!backend)
+        return null;
+    try {
+        const existing = await backend.getByKey('sessions', `session_${options.sessionId}`);
+        // Nothing is written for a session that was never started — do not report
+        // that as a recorded session end.
+        if (!existing)
+            return { success: false, error: `no session ${options.sessionId} to end` };
+        let data = {};
+        try {
+            data = JSON.parse(existing.content);
+        }
+        catch (e) {
+            if (process.env.DEBUG || process.env.MONOMIND_DEBUG)
+                console.error('[memory-bridge] session content failed to parse — ending session with empty prior state:', e);
+        }
+        const updated = await backend.update(existing.id, {
+            content: JSON.stringify({
+                ...data,
+                status: 'ended',
+                endedAt: Date.now(),
+                summary: options.summary,
+                metrics: options.metrics ?? {},
+            }),
+            tags: ['session', 'ended'],
+        });
+        if (!updated)
+            return { success: false, error: `session ${options.sessionId} vanished` };
+        await flushBackend(backend);
+        return { success: true };
+    }
+    catch (e) {
+        logBridgeError('bridgeSessionEnd', e);
+        return { success: false };
+    }
+}
+/** The most recently started session recorded by bridgeSessionStart, read
+ *  back from its row — or null when there is none (or no backend). */
+export async function bridgeLatestSession(options) {
+    const backend = await getBackend(options.dbPath);
+    if (!backend)
+        return null;
+    try {
+        // Newest two rows: one of them may be the excluded (current) session.
+        const rows = await backend.query({
+            type: 'exact',
+            namespace: 'sessions',
+            keyPrefix: 'session_',
+            sortField: 'createdAt',
+            sortDirection: 'desc',
+            limit: 2,
+        });
+        for (const row of rows) {
+            let data;
+            try {
+                data = JSON.parse(row.content);
+            }
+            catch {
+                continue;
+            }
+            if (typeof data?.sessionId !== 'string' || data.sessionId === options.excludeSessionId)
+                continue;
+            return {
+                sessionId: data.sessionId,
+                status: typeof data.status === 'string' ? data.status : 'unknown',
+                startedAt: new Date(data.startedAt ?? row.createdAt).toISOString(),
+                ...(typeof data.endedAt === 'number'
+                    ? { endedAt: new Date(data.endedAt).toISOString() }
+                    : {}),
+                ...(typeof data.summary === 'string' ? { summary: data.summary } : {}),
+                ...(data.metrics && typeof data.metrics === 'object' ? { metrics: data.metrics } : {}),
+            };
+        }
+        return null;
+    }
+    catch (e) {
+        logBridgeError('bridgeLatestSession', e);
+        return null;
+    }
+}
+//# sourceMappingURL=memory-bridge-sessions.js.map

package/dist/src/memory/memory-bridge-sessions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-bridge-sessions.js","sourceRoot":"","sources":["../../../src/memory/memory-bridge-sessions.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAE5D,gCAAgC;AAEhC,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,OAKxC;IACC,OAAO,gBAAgB,CAAC;QACtB,GAAG,EAAE,WAAW,OAAO,CAAC,SAAS,EAAE;QACnC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC;YACpB,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,MAAM,EAAE,QAAQ;YAChB,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,EAAE;SACjC,CAAC;QACF,SAAS,EAAE,UAAU;QACrB,IAAI,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC;QAC3B,qBAAqB,EAAE,KAAK;QAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;QACtB,MAAM,EAAE,IAAI;KACb,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,OAKtC;IACC,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,UAAU,EAAE,WAAW,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;QACpF,0EAA0E;QAC1E,kCAAkC;QAClC,IAAI,CAAC,QAAQ;YAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,OAAO,CAAC,SAAS,SAAS,EAAE,CAAC;QAC1F,IAAI,IAAI,GAAQ,EAAE,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,cAAc;gBACjD,OAAO,CAAC,KAAK,CACX,0FAA0F,EAC1F,CAAC,CACF,CAAC;QACN,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE;YAChD,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC;gBACtB,GAAG,IAAI;gBACP,MAAM,EAAE,OAAO;gBACf,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;gBACnB,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,EAAE;aAC/B,CAAC;YACF,IAAI,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC;SAC3B,CAAC,CAAC;QACH,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,OAAO,CAAC,SAAS,WAAW,EAAE,CAAC;QACxF,MAAM,YAAY,CAAC,OAAO,CAAC,CAAC;QAC5B,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC3B,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,cAAc,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QACtC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;sEACsE;AACtE,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,OAGzC;IAQC,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjD,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,IAAI,CAAC;QACH,sEAAsE;QACtE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC;YAC/B,IAAI,EAAE,OAAc;YACpB,SAAS,EAAE,UAAU;YACrB,SAAS,EAAE,UAAU;YACrB,SAAS,EAAE,WAAW;YACtB,aAAa,EAAE,MAAM;YACrB,KAAK,EAAE,CAAC;SACT,CAAC,CAAC;QACH,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,IAAS,CAAC;YACd,IAAI,CAAC;gBACH,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACjC,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,OAAO,IAAI,EAAE,SAAS,KAAK,QAAQ,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO,CAAC,gBAAgB;gBACpF,SAAS;YACX,OAAO;gBACL,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,MAAM,EAAE,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;gBACjE,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE;gBAClE,GAAG,CAAC,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ;oBAClC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE;oBACnD,CAAC,CAAC,EAAE,CAAC;gBACP,GAAG,CAAC,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtE,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACvF,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,cAAc,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/src/memory/memory-bridge-store.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Memory Bridge — the write path: bridgeStoreEntry (upsert identity, dedup
+ * gate, compare-and-swap) and the usage-recording helper it shares with the
+ * feedback loop. Split out of memory-bridge.ts, which re-exports the public
+ * symbols.
+ */
+export declare function bridgeStoreEntry(options: {
+    key: string;
+    value: string;
+    namespace?: string;
+    generateEmbeddingFlag?: boolean;
+    tags?: string[];
+    ttl?: number;
+    dbPath?: string;
+    upsert?: boolean;
+    /** Structured metadata persisted on the entry (KG nodes/edges, weights, provenance). */
+    metadata?: Record<string, unknown>;
+    /** Compare-and-swap guard for a read-merge-write caller (memory-kg.ts's
+     *  claim-ledger merge, K5). `'absent'` requires no row to exist yet at this
+     *  key; a number requires the row's CURRENT stored version to still equal
+     *  it. Either way, the check and the write are one atomic SQL statement
+     *  (see SqlBackend.storeIfVersion/storeIfAbsent) — a caller that read this
+     *  row (or found it absent) moments ago finds out here, via `conflict`,
+     *  whether a concurrent writer beat it, instead of silently overwriting (or
+     *  being overwritten by) that writer's update. Omit for the plain
+     *  last-write-wins upsert every other caller already relies on. */
+    ifVersion?: number | 'absent';
+}): Promise<{
+    success: boolean;
+    id: string;
+    embedding?: {
+        dimensions: number;
+        model: string;
+    };
+    guarded?: boolean;
+    cached?: boolean;
+    attested?: boolean;
+    duplicate?: boolean;
+    /** True when `ifVersion` did not match the row's current state — the row
+     *  changed (or was created) concurrently. `success` is false alongside this;
+     *  nothing was written. The caller must re-read and retry, not treat this
+     *  as a transient error. */
+    conflict?: boolean;
+    error?: string;
+} | null>;
+/** Ids a usage/feedback pass could not train, with why — so `updated: 0` and
+ *  `applied: 0` are never a silent success. `not_found` means the id resolved
+ *  to no entry (deleted, or orphaned by an older re-ingest); `error` means the
+ *  entry existed but could not be updated. */
+export type SkippedEntry = {
+    id: string;
+    reason: 'not_found' | 'error';
+};
+export declare function recordUsageOnBackend(backend: any, entryIds: string[]): Promise<{
+    updated: number;
+    skipped: SkippedEntry[];
+}>;
+//# sourceMappingURL=memory-bridge-store.d.ts.map

package/dist/src/memory/memory-bridge-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-bridge-store.d.ts","sourceRoot":"","sources":["../../../src/memory/memory-bridge-store.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAiBH,wBAAsB,gBAAgB,CAAC,OAAO,EAAE;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qBAAqB,CAAC,EAAE,OAAO,CAAC;IAChC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAChB,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,wFAAwF;IACxF,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC;;;;;;;;uEAQmE;IACnE,SAAS,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC;CAC/B,GAAG,OAAO,CAAC;IACV,OAAO,EAAE,OAAO,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAClD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;gCAG4B;IAC5B,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,GAAG,IAAI,CAAC,CAqLR;AAED;;;8CAG8C;AAC9C,MAAM,MAAM,YAAY,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAA;CAAE,CAAC;AAEzE,wBAAsB,oBAAoB,CACxC,OAAO,EAAE,GAAG,EACZ,QAAQ,EAAE,MAAM,EAAE,GACjB,OAAO,CAAC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,YAAY,EAAE,CAAA;CAAE,CAAC,CAuBvD"}