mem-os-python 1.6.27__py3-none-any.whl

memos/_js/rerank-local.js

@@ -0,0 +1,210 @@
+/**
+ * ─── Local cross-encoder reranking ──────────────────────────────────────────
+ *
+ * In-process alternative to the HTTP `/rerank` endpoint path in
+ * `MemOS.applyRerank`. Loads a sequence-classification cross-encoder
+ * (default `Xenova/bge-reranker-base`, ~280 MB) through
+ * `@huggingface/transformers` (falling back to `@xenova/transformers`),
+ * scores `[query, document]` pairs, and returns sigmoid-squashed relevance
+ * scores in [0,1].
+ *
+ * Design rules (same as the endpoint path):
+ * - Opt-in only: nothing here runs unless `experimental.rerank` selects the
+ *   local provider (or `MEMOS_RERANK_LOCAL=1`).
+ * - Any failure — missing package, model download failure, inference
+ *   error — returns `null` so the caller keeps the fused ranking. A broken
+ *   reranker degrades quality, never availability.
+ * - The model is loaded once per (model, dtype) and reused; the download
+ *   happens on first use, so the first reranked query pays for it.
+ */
+import { createRequire } from "node:module";
+export const DEFAULT_LOCAL_RERANK_MODEL = "Xenova/bge-reranker-base";
+/** Default quantization for local rerank inference. q8 is ~4x faster on CPU. */
+export const DEFAULT_LOCAL_RERANK_DTYPE = "q8";
+// ─── test seam ──────────────────────────────────────────────────────────────
+let testLoader = null;
+/** Test-only override for the model loader (stubbed inference, no download). */
+export function __setLocalRerankLoaderForTests(loader) {
+    testLoader = loader;
+}
+const modelCache = new Map();
+let warnedMissingPackage = false;
+/**
+ * Tokenize (query, doc) pairs for the cross-encoder. Tries the fast batched
+ * path first; some tokenizers (XLM-R family in transformers.js v4) throw on
+ * batched pair input (`text.replace is not a function`), in which case we
+ * fall back to per-pair tokenization with manual padding. Exported for tests.
+ */
+export async function tokenizePairsForRerank(tokenizer, pairs, maxLength) {
+    try {
+        return await tokenizer(pairs, {
+            padding: true,
+            truncation: true,
+            max_length: maxLength,
+        });
+    }
+    catch {
+        const allIds = [];
+        const allMasks = [];
+        for (const [q, d] of pairs) {
+            const t = await tokenizer(q, {
+                text_pair: d,
+                truncation: true,
+                max_length: maxLength,
+            });
+            allIds.push(Array.from(t["input_ids"].data));
+            allMasks.push(Array.from(t["attention_mask"].data));
+        }
+        const ml = Math.max(...allIds.map((a) => a.length));
+        const B = pairs.length;
+        const padId = BigInt(tokenizer.pad_token_id ?? 1);
+        const inputIds = new BigInt64Array(B * ml);
+        const attnMask = new BigInt64Array(B * ml);
+        allIds.forEach((arr, i) => {
+            for (let j = 0; j < ml; j++) {
+                inputIds[i * ml + j] = j < arr.length ? BigInt(arr[j]) : padId;
+                attnMask[i * ml + j] = j < arr.length ? BigInt(allMasks[i][j]) : 0n;
+            }
+        });
+        return {
+            input_ids: { type: "int64", data: inputIds, dims: [B, ml] },
+            attention_mask: { type: "int64", data: attnMask, dims: [B, ml] },
+        };
+    }
+}
+async function defaultLoader(model, dtype, maxLength) {
+    const key = `${model}::${dtype}::${maxLength}`;
+    let cached = modelCache.get(key);
+    if (!cached) {
+        cached = (async () => {
+            // Both packages are optional peer deps. We load them with
+            // `createRequire` (not dynamic `import()`): the ESM entry of
+            // `@huggingface/transformers` v4 does a named import from the CJS
+            // `onnxruntime-common` that Node's ESM loader rejects, while the
+            // CJS build loads fine.
+            const require = createRequire(import.meta.url);
+            let spec = null;
+            let resolved = null;
+            for (const candidate of [
+                "@huggingface/transformers",
+                "@xenova/transformers",
+            ]) {
+                try {
+                    resolved = require(candidate);
+                    spec = candidate;
+                    break;
+                }
+                catch {
+                    // try the next package
+                }
+            }
+            if (!resolved || !spec) {
+                if (!warnedMissingPackage) {
+                    warnedMissingPackage = true;
+                    console.warn("[memos] local rerank unavailable: neither @huggingface/transformers " +
+                        "nor @xenova/transformers is installed — keeping fused ranking. " +
+                        "Install one of them to enable local reranking.");
+                }
+                return null;
+            }
+            try {
+                const tokenizer = await resolved.AutoTokenizer.from_pretrained(model);
+                const mdl = await resolved.AutoModelForSequenceClassification.from_pretrained(model, { dtype });
+                // Raw InferenceSession: transformers.js v4 wraps input tensors in a
+                // way the installed onnxruntime-native binding rejects
+                // ("Tensor.location must be a string" — version skew between the
+                // wrapper and onnxruntime-node 1.30). Driving the session directly
+                // with tensors built from the package's OWN onnxruntime copy avoids
+                // the skew entirely.
+                const session = mdl.sessions?.["model"] ?? mdl.session;
+                if (!session) {
+                    throw new Error("no inference session exposed on the loaded model");
+                }
+                const ortRequire = createRequire(require.resolve(spec));
+                const ort = ortRequire("onnxruntime-node");
+                const inputNames = session.inputNames;
+                return {
+                    async scorePairs(pairs) {
+                        const batch = await tokenizePairsForRerank(tokenizer, pairs, maxLength);
+                        const feeds = {};
+                        const batchDims = batch["input_ids"]?.dims;
+                        for (const name of inputNames) {
+                            let t = batch[name];
+                            if (!t && name === "token_type_ids" && batchDims) {
+                                // BERT-style models expect segment ids; tokenizers for
+                                // single-pair cross-encoders sometimes omit them (all zeros
+                                // is correct for [query, doc] pairs).
+                                const size = batchDims.reduce((a, b) => a * b, 1);
+                                t = {
+                                    type: "int64",
+                                    data: new BigInt64Array(size),
+                                    dims: [...batchDims],
+                                };
+                            }
+                            if (!t)
+                                continue;
+                            feeds[name] = new ort.Tensor(t.type, t.data, t.dims);
+                        }
+                        const out = await session.run(feeds);
+                        const logits = out["logits"] ?? out[Object.keys(out)[0]];
+                        if (!logits)
+                            throw new Error("model returned no outputs");
+                        const data = logits.data;
+                        const rowSize = logits.dims.length >= 2
+                            ? logits.dims[logits.dims.length - 1]
+                            : 1;
+                        const result = [];
+                        for (let i = 0; i < pairs.length; i += 1) {
+                            result.push(Number(data[i * rowSize]));
+                        }
+                        return result;
+                    },
+                };
+            }
+            catch (err) {
+                console.error("[memos] local rerank model failed to load " +
+                    `("${model}", dtype "${dtype}") — keeping fused ranking:`, err instanceof Error ? err.message : String(err));
+                return null;
+            }
+        })();
+        modelCache.set(key, cached);
+    }
+    return cached;
+}
+function sigmoid(x) {
+    return 1 / (1 + Math.exp(-x));
+}
+/**
+ * Score each document against the query with the local cross-encoder.
+ * Returns sigmoid-squashed scores in input order, or `null` when the
+ * reranker is unavailable — the caller must keep the fused ranking.
+ */
+export async function scorePairsLocal(query, docs, opts = {}) {
+    if (docs.length === 0)
+        return [];
+    const model = opts.model ?? DEFAULT_LOCAL_RERANK_MODEL;
+    const dtype = opts.dtype ?? DEFAULT_LOCAL_RERANK_DTYPE;
+    const maxLength = opts.maxLength ?? 512;
+    const loader = testLoader ?? defaultLoader;
+    let loaded;
+    try {
+        loaded = await loader(model, dtype, maxLength);
+    }
+    catch {
+        return null;
+    }
+    if (!loaded)
+        return null;
+    try {
+        const pairs = docs.map((doc) => [query, doc]);
+        const logits = await loaded.scorePairs(pairs);
+        if (logits.length !== docs.length)
+            return null;
+        return logits.map(sigmoid);
+    }
+    catch (err) {
+        console.error("[memos] local rerank inference failed — keeping fused ranking:", err instanceof Error ? err.message : String(err));
+        return null;
+    }
+}
+//# sourceMappingURL=rerank-local.js.map

memos/_js/rerank-local.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rerank-local.js","sourceRoot":"","sources":["../src/rerank-local.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,MAAM,CAAC,MAAM,0BAA0B,GAAG,0BAA0B,CAAC;AAErE,gFAAgF;AAChF,MAAM,CAAC,MAAM,0BAA0B,GAAG,IAAI,CAAC;AAuB/C,+EAA+E;AAE/E,IAAI,UAAU,GAA6B,IAAI,CAAC;AAEhD,gFAAgF;AAChF,MAAM,UAAU,8BAA8B,CAC5C,MAAgC;IAEhC,UAAU,GAAG,MAAM,CAAC;AACtB,CAAC;AA+CD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4C,CAAC;AACvE,IAAI,oBAAoB,GAAG,KAAK,CAAC;AAEjC;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,SAMC,EACD,KAA8B,EAC9B,SAAiB;IAEjB,IAAI,CAAC;QACH,OAAO,MAAM,SAAS,CAAC,KAAK,EAAE;YAC5B,OAAO,EAAE,IAAI;YACb,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,SAAS;SACtB,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAe,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,MAAM,SAAS,CAAC,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC;gBACZ,UAAU,EAAE,IAAI;gBAChB,UAAU,EAAE,SAAS;aACtB,CAAC,CAAC;YACH,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAE,CAAC,IAAyB,CAAC,CAAC,CAAC;YACnE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAE,CAAC,IAAyB,CAAC,CAAC,CAAC;QAC5E,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,QAAQ,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBAChE,QAAQ,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxE,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO;YACL,SAAS,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;YAC3D,cAAc,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE;SACjE,CAAC;IACJ,CAAC;AACH,CAAC;AAaD,KAAK,UAAU,aAAa,CAC1B,KAAa,EACb,KAAa,EACb,SAAiB;IAEjB,MAAM,GAAG,GAAG,GAAG,KAAK,KAAK,KAAK,KAAK,SAAS,EAAE,CAAC;IAC/C,IAAI,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,CAAC,KAAK,IAAsC,EAAE;YACrD,0DAA0D;YAC1D,6DAA6D;YAC7D,kEAAkE;YAClE,iEAAiE;YACjE,wBAAwB;YACxB,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,IAAI,GAAkB,IAAI,CAAC;YAC/B,IAAI,QAAQ,GAAmC,IAAI,CAAC;YACpD,KAAK,MAAM,SAAS,IAAI;gBACtB,2BAA2B;gBAC3B,sBAAsB;aACvB,EAAE,CAAC;gBACF,IAAI,CAAC;oBACH,QAAQ,GAAG,OAAO,CAAC,SAAS,CAA4B,CAAC;oBACzD,IAAI,GAAG,SAAS,CAAC;oBACjB,MAAM;gBACR,CAAC;gBAAC,MAAM,CAAC;oBACP,uBAAuB;gBACzB,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC,oBAAoB,EAAE,CAAC;oBAC1B,oBAAoB,GAAG,IAAI,CAAC;oBAC5B,OAAO,CAAC,IAAI,CACV,sEAAsE;wBACpE,iEAAiE;wBACjE,gDAAgD,CACnD,CAAC;gBACJ,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,aAAa,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;gBACtE,MAAM,GAAG,GACP,MAAM,QAAQ,CAAC,kCAAkC,CAAC,eAAe,CAC/D,KAAK,EACL,EAAE,KAAK,EAAE,CACV,CAAC;gBACJ,oEAAoE;gBACpE,uDAAuD;gBACvD,iEAAiE;gBACjE,mEAAmE;gBACnE,oEAAoE;gBACpE,qBAAqB;gBACrB,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC;gBACvD,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;gBACtE,CAAC;gBACD,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxD,MAAM,GAAG,GAAG,UAAU,CAAC,kBAAkB,CAExC,CAAC;gBACF,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;gBAEtC,OAAO;oBACL,KAAK,CAAC,UAAU,CAAC,KAA8B;wBAC7C,MAAM,KAAK,GAAG,MAAM,sBAAsB,CACxC,SAAyD,EACzD,KAAK,EACL,SAAS,CACV,CAAC;wBACF,MAAM,KAAK,GAA4B,EAAE,CAAC;wBAC1C,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC;wBAC3C,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;4BAC9B,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;4BACpB,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,gBAAgB,IAAI,SAAS,EAAE,CAAC;gCACjD,uDAAuD;gCACvD,4DAA4D;gCAC5D,sCAAsC;gCACtC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gCAClD,CAAC,GAAG;oCACF,IAAI,EAAE,OAAO;oCACb,IAAI,EAAE,IAAI,aAAa,CAAC,IAAI,CAAC;oCAC7B,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC;iCACrB,CAAC;4BACJ,CAAC;4BACD,IAAI,CAAC,CAAC;gCAAE,SAAS;4BACjB,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;wBACvD,CAAC;wBACD,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;wBACrC,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;wBAC1D,IAAI,CAAC,MAAM;4BAAE,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;wBAC1D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;wBACzB,MAAM,OAAO,GACX,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC;4BACrB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE;4BACtC,CAAC,CAAC,CAAC,CAAC;wBACR,MAAM,MAAM,GAAa,EAAE,CAAC;wBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;4BACzC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;wBACzC,CAAC;wBACD,OAAO,MAAM,CAAC;oBAChB,CAAC;iBACF,CAAC;YACJ,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,OAAO,CAAC,KAAK,CACX,4CAA4C;oBAC1C,KAAK,KAAK,aAAa,KAAK,6BAA6B,EAC3D,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CACjD,CAAC;gBACF,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC,CAAC,EAAE,CAAC;QACL,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,KAAa,EACb,IAAc,EACd,IAAI,GAAuB,EAAE;IAE7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,0BAA0B,CAAC;IACvD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,0BAA0B,CAAC;IACvD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAC;IACxC,MAAM,MAAM,GAAG,UAAU,IAAI,aAAa,CAAC;IAC3C,IAAI,MAA+B,CAAC;IACpC,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,CAAC;QACH,MAAM,KAAK,GAA4B,IAAI,CAAC,GAAG,CAC7C,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,CAAqB,CAC1C,CAAC;QACF,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAC/C,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO,CAAC,KAAK,CACX,gEAAgE,EAChE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CACjD,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

memos/_js/retain-filter.d.ts

@@ -0,0 +1,98 @@
+/**
+ * Retain pre-filter for MemOS memory writes (v1.6.26).
+ *
+ * Hermes-style signal gate (cf. NousResearch/hermes-agent #16834): a cheap
+ * local classifier that decides whether a piece of content is worth storing in
+ * long-term memory before the write happens. Without this, every turn —
+ * including low-signal acknowledgements, chit-chat, and retries — enters
+ * memory and later bloats context-packs, costing retrieval tokens and diluting
+ * relevance ranking.
+ *
+ * Default mode is a ZERO-LLM-CALL local classifier (keeps MemOS fast and
+ * local). The *decision* is conservative-first: a write is skipped only
+ * on positive evidence of noise (empty content, pure acknowledgements,
+ * fragments, near-duplicates of existing same-scope memories) — when in
+ * doubt the memory is kept, because a false skip silently loses user
+ * data. The *score* (0–1) separately estimates signal density from
+ * length, entity/code presence, action verbs, and novelty, and is
+ * reported for debugging/telemetry. An optional custom classifier can
+ * be injected via `setRetainClassifier()`.
+ *
+ * @module @mem-os/sdk/retain-filter
+ */
+/** Inputs the retain gate uses to make its decision. */
+export interface RetainInput {
+    /** The content proposed for storage. */
+    content: string;
+    /**
+     * Existing memory content in the same namespace (for novelty detection).
+     * Optional; when absent, novelty is assumed maximal.
+     */
+    existingContent?: string[];
+}
+/** The gate's verdict plus the score that drove it. */
+export interface RetainDecision {
+    /** True = store the content. */
+    retain: boolean;
+    /** Signal-density score in [0, 1]. Higher = more worth storing. */
+    score: number;
+    /** Human-readable reason for the decision (for debugging). */
+    reason: string;
+}
+/** Score at or above which content is retained. */
+declare const RETAIN_THRESHOLD = 0.3;
+/**
+ * Does this content read as a correction of something already stored?
+ *
+ * The gate's near-duplicate rule exists to stop *identical restatements*
+ * from re-entering memory. A negation/retraction ("user no longer lives in
+ * Berlin", "switched from vim to neovim") is deliberately NOT a duplicate —
+ * it is the update the confidence lifecycle exists to process, and it
+ * arrives sharing most of its tokens with the memory it retracts (a
+ * retraction necessarily names the same subject). Dropping it as a
+ * "near-duplicate" is how a retraction silently never reaches the
+ * confidence machine, leaving the old belief in place at full weight.
+ * This check reuses the SAME signal list as `classifyEvidence` so the gate
+ * and the state machine cannot drift apart.
+ */
+export declare function carriesContradictionSignal(content: string): boolean;
+/**
+ * Max token overlap of `content` against any entry of `existingContent`
+ * (0–1). Tokens are lowercase alphanumeric words longer than 2 chars.
+ */
+export declare function maxTokenOverlap(content: string, existingContent: string[]): number;
+/**
+ * Default local classifier: scores content on signal density (0-1).
+ *
+ * Components:
+ *  - Length floor: tiny content scores ~0.
+ *  - Signal density: entities / code refs / numbers per 100 chars.
+ *  - Action / preference verbs: factual statements score higher.
+ *  - Low-signal penalty: pure acknowledgements score ~0.
+ *  - Novelty: down-weight content that duplicates existing memory.
+ *
+ * No LLM call, no I/O — runs in well under 1ms.
+ */
+export declare function scoreRetain(input: RetainInput): number;
+/**
+ * Decide whether to retain (store) content. Default uses the local
+ * classifier; callers can inject a custom classifier via
+ * `setRetainClassifier()`.
+ *
+ * Conservative-first contract (the accuracy gate): a write is skipped
+ * ONLY on positive evidence of noise —
+ *   1. empty content,
+ *   2. a pure acknowledgement ("ok", "thanks", "ok ok ok", …),
+ *   3. a fragment with almost no alphanumeric content ("...", "k"),
+ *   4. a near-duplicate of an existing same-scope memory.
+ * Everything else is retained. When in doubt, keep the memory — a
+ * false skip silently loses user data, while a false keep only costs a
+ * little storage. `score` still reports the signal-density estimate
+ * from `scoreRetain` for debugging/telemetry.
+ */
+export declare function shouldRetain(input: RetainInput): RetainDecision;
+export declare function setRetainClassifier(classifier?: (input: RetainInput) => RetainDecision): void;
+/** Decide whether to retain, using the custom classifier if installed. */
+export declare function decideRetain(input: RetainInput): RetainDecision;
+export { RETAIN_THRESHOLD };
+//# sourceMappingURL=retain-filter.d.ts.map

memos/_js/retain-filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retain-filter.d.ts","sourceRoot":"","sources":["../src/retain-filter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,wDAAwD;AACxD,MAAM,WAAW,WAAW;IAC1B,wCAAwC;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED,uDAAuD;AACvD,MAAM,WAAW,cAAc;IAC7B,gCAAgC;IAChC,MAAM,EAAE,OAAO,CAAC;IAChB,mEAAmE;IACnE,KAAK,EAAE,MAAM,CAAC;IACd,8DAA8D;IAC9D,MAAM,EAAE,MAAM,CAAC;CAChB;AAID,mDAAmD;AACnD,QAAA,MAAM,gBAAgB,MAAM,CAAC;AA+C7B;;;;;;;;;;;;;GAaG;AACH,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAGnE;AAKD;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,EACf,eAAe,EAAE,MAAM,EAAE,GACxB,MAAM,CAqBR;AAeD;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,CAmCtD;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,CA0C/D;AAQD,wBAAgB,mBAAmB,CACjC,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,cAAc,GAClD,IAAI,CAEN;AAED,0EAA0E;AAC1E,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG,cAAc,CAG/D;AAED,OAAO,EAAE,gBAAgB,EAAE,CAAC"}

memos/_js/retain-filter.js

@@ -0,0 +1,232 @@
+/**
+ * Retain pre-filter for MemOS memory writes (v1.6.26).
+ *
+ * Hermes-style signal gate (cf. NousResearch/hermes-agent #16834): a cheap
+ * local classifier that decides whether a piece of content is worth storing in
+ * long-term memory before the write happens. Without this, every turn —
+ * including low-signal acknowledgements, chit-chat, and retries — enters
+ * memory and later bloats context-packs, costing retrieval tokens and diluting
+ * relevance ranking.
+ *
+ * Default mode is a ZERO-LLM-CALL local classifier (keeps MemOS fast and
+ * local). The *decision* is conservative-first: a write is skipped only
+ * on positive evidence of noise (empty content, pure acknowledgements,
+ * fragments, near-duplicates of existing same-scope memories) — when in
+ * doubt the memory is kept, because a false skip silently loses user
+ * data. The *score* (0–1) separately estimates signal density from
+ * length, entity/code presence, action verbs, and novelty, and is
+ * reported for debugging/telemetry. An optional custom classifier can
+ * be injected via `setRetainClassifier()`.
+ *
+ * @module @mem-os/sdk/retain-filter
+ */
+import { CONTRADICTION_SIGNALS } from "./confidence-machine.js";
+/** Minimum content length (in chars) to consider storing. */
+const MIN_LENGTH = 15;
+/** Score at or above which content is retained. */
+const RETAIN_THRESHOLD = 0.3;
+// Action / signal verbs — presence pushes the score up.
+const ACTION_VERBS = /\b(?:prefers?|wants?|needs?|likes?|dislikes?|uses?|chose|chooses|set|configured?|created?|added?|removed?|updated?|installed?|deployed?|named|called|works?|lives?|located?|built|built with|wrote|fixed|decided|chose|switched|migrated|adopted|disabled|enabled|changed|replaced)\b/gi;
+const ENTITY_SIGNALS = [
+    /`[^`]+`/g, // code refs
+    /(?:[\w./-]+\.(?:ts|tsx|js|jsx|py|go|rs|md|json|yaml|yml|toml))/g, // file paths
+    /https?:\/\/[^\s,)]+/g, // urls
+    /\b[A-Z][a-z]+(?:\s+[A-Z][a-z]+)+\b/g, // proper nouns / concepts
+    /\b\d+(?:\.\d+)?(?:%|ms|s|usd|\$|x)\b/gi, // numbers with units
+];
+// Low-signal acknowledgement phrases — pure noise, not worth storing.
+// Anchored: the whole content must be an acknowledgement.
+const LOW_SIGNAL_PATTERNS = /^(?:ok|okay|sure|got it|understood|done|will do|sure thing|sounds good|great|perfect|thanks|thank you|yep|yup|no problem|of course|absolutely|right|correct|exactly|yes|no|maybe|sure|hi|hello|hey|lol|haha|k|kk|cool|nice|wow)[.!?]?$/i;
+// Individual acknowledgement words — used to catch repeated acks
+// ("ok ok ok", "thanks thanks") that the anchored phrase pattern misses.
+const ACK_WORDS = /^(?:ok|okay|sure|got|it|understood|done|will|do|thing|sounds|good|great|perfect|thanks|thank|you|yep|yup|no|problem|of|course|absolutely|right|correct|exactly|yes|maybe|hi|hello|hey|lol|haha|k|kk|cool|nice|wow)$/i;
+/**
+ * Strip trailing sentence punctuation.
+ *
+ * Hand-rolled rather than `/[.!?]+$/g`: that pattern is UNANCHORED, so the
+ * engine retries it at every offset in a long punctuation run, each retry
+ * backtracking through the rest of the run — quadratic on input like
+ * `"!!!!!…!x"` (CodeQL js/polynomial-redos). A single left-to-right scan
+ * is linear and behaves identically.
+ */
+function stripTrailingPunctuation(s, alsoComma = false) {
+    let end = s.length;
+    while (end > 0) {
+        const c = s.charCodeAt(end - 1);
+        // "." (46), "!" (33), "?" (63), "," (44 when alsoComma)
+        if (c !== 46 && c !== 33 && c !== 63 && !(alsoComma && c === 44))
+            break;
+        end--;
+    }
+    return end === s.length ? s : s.slice(0, end);
+}
+/** Near-duplicate threshold: token overlap at/above this is a duplicate. */
+const DUPLICATE_OVERLAP = 0.85;
+/**
+ * Does this content read as a correction of something already stored?
+ *
+ * The gate's near-duplicate rule exists to stop *identical restatements*
+ * from re-entering memory. A negation/retraction ("user no longer lives in
+ * Berlin", "switched from vim to neovim") is deliberately NOT a duplicate —
+ * it is the update the confidence lifecycle exists to process, and it
+ * arrives sharing most of its tokens with the memory it retracts (a
+ * retraction necessarily names the same subject). Dropping it as a
+ * "near-duplicate" is how a retraction silently never reaches the
+ * confidence machine, leaving the old belief in place at full weight.
+ * This check reuses the SAME signal list as `classifyEvidence` so the gate
+ * and the state machine cannot drift apart.
+ */
+export function carriesContradictionSignal(content) {
+    const lower = content.toLowerCase();
+    return CONTRADICTION_SIGNALS.some((w) => lower.includes(w));
+}
+/** Minimum alphanumeric characters for content to be storable at all. */
+const MIN_SIGNAL_CHARS = 4;
+/**
+ * Max token overlap of `content` against any entry of `existingContent`
+ * (0–1). Tokens are lowercase alphanumeric words longer than 2 chars.
+ */
+export function maxTokenOverlap(content, existingContent) {
+    const tokens = new Set(content
+        .toLowerCase()
+        .split(/[^a-z0-9]+/i)
+        .filter((w) => w.length > 2));
+    if (tokens.size === 0)
+        return 0;
+    let maxOverlap = 0;
+    for (const existing of existingContent.slice(0, 20)) {
+        const exTokens = new Set(existing
+            .toLowerCase()
+            .split(/[^a-z0-9]+/i)
+            .filter((w) => w.length > 2));
+        let overlap = 0;
+        for (const t of tokens)
+            if (exTokens.has(t))
+                overlap++;
+        maxOverlap = Math.max(maxOverlap, overlap / tokens.size);
+    }
+    return maxOverlap;
+}
+/**
+ * Count distinct signal indicators in the content.
+ */
+function countSignals(content) {
+    let count = 0;
+    for (const pattern of ENTITY_SIGNALS) {
+        const regex = new RegExp(pattern.source, pattern.flags);
+        const matches = content.match(regex);
+        if (matches)
+            count += new Set(matches).size;
+    }
+    return count;
+}
+/**
+ * Default local classifier: scores content on signal density (0-1).
+ *
+ * Components:
+ *  - Length floor: tiny content scores ~0.
+ *  - Signal density: entities / code refs / numbers per 100 chars.
+ *  - Action / preference verbs: factual statements score higher.
+ *  - Low-signal penalty: pure acknowledgements score ~0.
+ *  - Novelty: down-weight content that duplicates existing memory.
+ *
+ * No LLM call, no I/O — runs in well under 1ms.
+ */
+export function scoreRetain(input) {
+    const { content, existingContent = [] } = input;
+    if (!content || content.trim().length < MIN_LENGTH)
+        return 0;
+    // Hard penalty for pure acknowledgement turns.
+    if (LOW_SIGNAL_PATTERNS.test(content.trim()))
+        return 0.05;
+    let score = 0;
+    // Signal density.
+    const signalCount = countSignals(content);
+    const density = Math.min(1, signalCount / 3); // 3+ signals → max density
+    score += density * 0.45;
+    // Action / preference verbs (factual statements worth remembering).
+    const verbMatches = content.match(ACTION_VERBS) ?? [];
+    const verbDensity = Math.min(1, new Set(verbMatches.map((v) => v.toLowerCase())).size / 2);
+    score += verbDensity * 0.3;
+    // Length appropriateness.
+    const len = content.trim().length;
+    score += len >= 25 && len <= 500 ? 0.15 : 0.05;
+    // Novelty: down-weight near-duplicates of existing memory.
+    if (existingContent.length > 0) {
+        score += (1 - maxTokenOverlap(content, existingContent)) * 0.1;
+    }
+    else {
+        score += 0.1;
+    }
+    return Math.min(1, score);
+}
+/**
+ * Decide whether to retain (store) content. Default uses the local
+ * classifier; callers can inject a custom classifier via
+ * `setRetainClassifier()`.
+ *
+ * Conservative-first contract (the accuracy gate): a write is skipped
+ * ONLY on positive evidence of noise —
+ *   1. empty content,
+ *   2. a pure acknowledgement ("ok", "thanks", "ok ok ok", …),
+ *   3. a fragment with almost no alphanumeric content ("...", "k"),
+ *   4. a near-duplicate of an existing same-scope memory.
+ * Everything else is retained. When in doubt, keep the memory — a
+ * false skip silently loses user data, while a false keep only costs a
+ * little storage. `score` still reports the signal-density estimate
+ * from `scoreRetain` for debugging/telemetry.
+ */
+export function shouldRetain(input) {
+    const score = scoreRetain(input);
+    const content = input.content ?? "";
+    const trimmed = content.trim();
+    if (trimmed.length === 0) {
+        return { retain: false, score, reason: "empty content" };
+    }
+    if (LOW_SIGNAL_PATTERNS.test(trimmed)) {
+        return { retain: false, score, reason: "low-signal acknowledgement" };
+    }
+    // Repeated acks the anchored phrase pattern misses ("ok ok ok").
+    const words = trimmed
+        .slice(0, stripTrailingPunctuation(trimmed).length)
+        .split(/\s+/)
+        .filter(Boolean);
+    if (words.length > 0 &&
+        words.every((w) => ACK_WORDS.test(stripTrailingPunctuation(w, true)))) {
+        return { retain: false, score, reason: "low-signal acknowledgement" };
+    }
+    const signalChars = trimmed.replace(/[^a-z0-9]/gi, "").length;
+    if (signalChars < MIN_SIGNAL_CHARS) {
+        return { retain: false, score, reason: "too short" };
+    }
+    const existing = input.existingContent ?? [];
+    if (existing.length > 0 &&
+        maxTokenOverlap(content, existing) >= DUPLICATE_OVERLAP &&
+        // A retraction necessarily overlaps the memory it retracts — it names
+        // the same subject. Never skip one of those as a "duplicate", or the
+        // contradiction never reaches the confidence machine.
+        !carriesContradictionSignal(trimmed)) {
+        return {
+            retain: false,
+            score,
+            reason: "near-duplicate of existing memory",
+        };
+    }
+    return { retain: true, score, reason: "no noise evidence — retained" };
+}
+/**
+ * Optional pluggable classifier. When set, `shouldRetain` delegates to it.
+ * Pass undefined to restore the default local classifier.
+ */
+let customClassifier = null;
+export function setRetainClassifier(classifier) {
+    customClassifier = classifier ?? null;
+}
+/** Decide whether to retain, using the custom classifier if installed. */
+export function decideRetain(input) {
+    if (customClassifier)
+        return customClassifier(input);
+    return shouldRetain(input);
+}
+export { RETAIN_THRESHOLD };
+//# sourceMappingURL=retain-filter.js.map

memos/_js/retain-filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retain-filter.js","sourceRoot":"","sources":["../src/retain-filter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAuBhE,6DAA6D;AAC7D,MAAM,UAAU,GAAG,EAAE,CAAC;AACtB,mDAAmD;AACnD,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,wDAAwD;AACxD,MAAM,YAAY,GAChB,yRAAyR,CAAC;AAE5R,MAAM,cAAc,GAAG;IACrB,UAAU,EAAE,YAAY;IACxB,iEAAiE,EAAE,aAAa;IAChF,sBAAsB,EAAE,OAAO;IAC/B,qCAAqC,EAAE,0BAA0B;IACjE,wCAAwC,EAAE,qBAAqB;CAChE,CAAC;AAEF,sEAAsE;AACtE,0DAA0D;AAC1D,MAAM,mBAAmB,GACvB,yOAAyO,CAAC;AAE5O,iEAAiE;AACjE,yEAAyE;AACzE,MAAM,SAAS,GACb,sNAAsN,CAAC;AAEzN;;;;;;;;GAQG;AACH,SAAS,wBAAwB,CAAC,CAAS,EAAE,SAAS,GAAG,KAAK;IAC5D,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAChC,wDAAwD;QACxD,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC;YAAE,MAAM;QACxE,GAAG,EAAE,CAAC;IACR,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAChD,CAAC;AAED,4EAA4E;AAC5E,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAE/B;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,0BAA0B,CAAC,OAAe;IACxD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IACpC,OAAO,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,yEAAyE;AACzE,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,OAAe,EACf,eAAyB;IAEzB,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,OAAO;SACJ,WAAW,EAAE;SACb,KAAK,CAAC,aAAa,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;IACF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,QAAQ,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,QAAQ;aACL,WAAW,EAAE;aACb,KAAK,CAAC,aAAa,CAAC;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;QACF,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,EAAE,CAAC;QACvD,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CAAC,OAAe;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,OAAO;YAAE,KAAK,IAAI,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;IAC9C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,WAAW,CAAC,KAAkB;IAC5C,MAAM,EAAE,OAAO,EAAE,eAAe,GAAG,EAAE,EAAE,GAAG,KAAK,CAAC;IAEhD,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,UAAU;QAAE,OAAO,CAAC,CAAC;IAE7D,+CAA+C;IAC/C,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAE1D,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,kBAAkB;IAClB,MAAM,WAAW,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,2BAA2B;IACzE,KAAK,IAAI,OAAO,GAAG,IAAI,CAAC;IAExB,oEAAoE;IACpE,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;IACtD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,CAAC,EACD,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAC1D,CAAC;IACF,KAAK,IAAI,WAAW,GAAG,GAAG,CAAC;IAE3B,0BAA0B;IAC1B,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC;IAClC,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAE/C,2DAA2D;IAC3D,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,CAAC,GAAG,eAAe,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,GAAG,GAAG,CAAC;IACjE,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,GAAG,CAAC;IACf,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB;IAC7C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC;IACpC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAE/B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IAC3D,CAAC;IACD,IAAI,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACtC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACxE,CAAC;IACD,iEAAiE;IACjE,MAAM,KAAK,GAAG,OAAO;SAClB,KAAK,CAAC,CAAC,EAAE,wBAAwB,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;SAClD,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,OAAO,CAAC,CAAC;IACnB,IACE,KAAK,CAAC,MAAM,GAAG,CAAC;QAChB,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EACrE,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACxE,CAAC;IACD,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC;IAC9D,IAAI,WAAW,GAAG,gBAAgB,EAAE,CAAC;QACnC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IACvD,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,eAAe,IAAI,EAAE,CAAC;IAC7C,IACE,QAAQ,CAAC,MAAM,GAAG,CAAC;QACnB,eAAe,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,iBAAiB;QACvD,sEAAsE;QACtE,qEAAqE;QACrE,sDAAsD;QACtD,CAAC,0BAA0B,CAAC,OAAO,CAAC,EACpC,CAAC;QACD,OAAO;YACL,MAAM,EAAE,KAAK;YACb,KAAK;YACL,MAAM,EAAE,mCAAmC;SAC5C,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,8BAA8B,EAAE,CAAC;AACzE,CAAC;AAED;;;GAGG;AACH,IAAI,gBAAgB,GAAoD,IAAI,CAAC;AAE7E,MAAM,UAAU,mBAAmB,CACjC,UAAmD;IAEnD,gBAAgB,GAAG,UAAU,IAAI,IAAI,CAAC;AACxC,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,YAAY,CAAC,KAAkB;IAC7C,IAAI,gBAAgB;QAAE,OAAO,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACrD,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED,OAAO,EAAE,gBAAgB,EAAE,CAAC"}