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

memos/_js/graph.js

@@ -0,0 +1,482 @@
+/**
+ * In-memory graph engine for MemOS.
+ *
+ * Maintains an adjacency-list representation of the memory graph for
+ * fast traversal, clustering, and auto-linking. The graph mirrors
+ * what is persisted in the storage backend.
+ *
+ * @module @memos/graph
+ */
+/**
+ * Default per-node cap on edges created by `autoLink()`.
+ *
+ * Without a cap, a corpus of similar memories converges to a complete
+ * graph (K_N): every new node links to every existing one, so edge
+ * writes grow quadratically and dominate ingestion time. 16 links is
+ * enough to preserve local cluster structure for `findClusters()` /
+ * `injectContext()` while keeping bulk ingestion near-linear. Pass `0`
+ * to `autoLink()` to restore uncapped (legacy) behavior.
+ */
+export const DEFAULT_AUTO_LINK_CAP = 16;
+/**
+ * Bag-of-words cosine similarity between two strings.
+ *
+ * This is intentionally lightweight — no external embedding model needed.
+ * For production use-cases requiring semantic similarity, supply your own
+ * embedding-based linker via the adapter interface.
+ *
+ * @param a — First text.
+ * @param b — Second text.
+ * @returns Cosine similarity in [0, 1].
+ */
+export function textSimilarity(a, b) {
+    const tokensA = bagOfWords(a);
+    const tokensB = bagOfWords(b);
+    if (tokensA.size === 0 || tokensB.size === 0)
+        return 0;
+    return tokenSetSimilarity(tokensA, tokensB);
+}
+/**
+ * Cosine similarity of two pre-tokenized bags (binary term frequency).
+ * Exported for reuse by GraphEngine.autoLink, which tokenizes the new node
+ * once and reuses cached token sets for existing nodes instead of
+ * re-tokenizing both sides on every comparison.
+ */
+export function tokenSetSimilarity(tokensA, tokensB) {
+    if (tokensA.size === 0 || tokensB.size === 0)
+        return 0;
+    let intersection = 0;
+    // Iterate the smaller set for fewer hash lookups.
+    const [small, large] = tokensA.size <= tokensB.size ? [tokensA, tokensB] : [tokensB, tokensA];
+    for (const token of small) {
+        if (large.has(token))
+            intersection += 1;
+    }
+    return intersection / Math.sqrt(tokensA.size * tokensB.size);
+}
+/**
+ * Tokenise text into a set of lowercased, de-stopped words.
+ */
+// Module-level: bagOfWords runs O(N) times per autoLink() call, so the
+// ~100-word Set must not be re-allocated on every invocation.
+const BAG_OF_WORDS_STOP_WORDS = new Set([
+    "a",
+    "an",
+    "the",
+    "is",
+    "are",
+    "was",
+    "were",
+    "be",
+    "been",
+    "being",
+    "have",
+    "has",
+    "had",
+    "do",
+    "does",
+    "did",
+    "will",
+    "would",
+    "shall",
+    "should",
+    "may",
+    "might",
+    "must",
+    "can",
+    "could",
+    "to",
+    "of",
+    "in",
+    "for",
+    "on",
+    "with",
+    "at",
+    "by",
+    "from",
+    "as",
+    "into",
+    "through",
+    "during",
+    "before",
+    "after",
+    "above",
+    "below",
+    "between",
+    "and",
+    "but",
+    "or",
+    "nor",
+    "not",
+    "so",
+    "yet",
+    "both",
+    "either",
+    "neither",
+    "each",
+    "every",
+    "all",
+    "any",
+    "few",
+    "more",
+    "most",
+    "other",
+    "some",
+    "such",
+    "no",
+    "only",
+    "own",
+    "same",
+    "than",
+    "too",
+    "very",
+    "just",
+    "because",
+    "about",
+    "up",
+    "out",
+    "it",
+    "its",
+    "this",
+    "that",
+    "these",
+    "those",
+    "i",
+    "me",
+    "my",
+    "we",
+    "our",
+    "you",
+    "your",
+    "he",
+    "him",
+    "his",
+    "she",
+    "her",
+    "they",
+    "them",
+    "their",
+]);
+function bagOfWords(text) {
+    return new Set(text
+        .toLowerCase()
+        .replace(/[^a-z0-9\s]/g, "")
+        .split(/\s+/)
+        .filter((w) => w.length > 1 && !BAG_OF_WORDS_STOP_WORDS.has(w)));
+}
+/**
+ * Bitemporal validity predicate: an edge is valid at `timeMs` when its
+ * event-time interval covers it. NULL/undefined bounds are open-ended.
+ * (eqeqeq-safe explicit null checks — the lint config forbids `== null`.)
+ */
+function isEdgeValidAt(edge, timeMs) {
+    const fromOpen = edge.validFrom === undefined || edge.validFrom === null;
+    const toOpen = edge.validTo === undefined || edge.validTo === null;
+    return ((fromOpen || edge.validFrom <= timeMs) &&
+        (toOpen || edge.validTo > timeMs));
+}
+/**
+ * Graph engine managing the in-memory representation of the memory graph.
+ */
+export class GraphEngine {
+    /** Adjacency list: nodeId → Set of edge IDs. */
+    adjacency = new Map();
+    /** Edge lookup: edgeId → MemoryEdge. */
+    edges = new Map();
+    /** Node lookup: nodeId → MemoryNode. */
+    nodes = new Map();
+    /**
+     * Lazily-computed bag-of-words token sets per node, for autoLink().
+     * Populated on first use and invalidated on update/remove — avoids
+     * re-tokenizing every existing node on every store().
+     */
+    tokenCache = new Map();
+    /**
+     * Add a node to the graph.
+     *
+     * @param node — The memory node to add.
+     */
+    addNode(node) {
+        this.nodes.set(node.id, node);
+        // Fresh content for this id — drop any cached token set.
+        this.tokenCache.delete(node.id);
+        if (!this.adjacency.has(node.id)) {
+            this.adjacency.set(node.id, new Set());
+        }
+    }
+    /**
+     * Remove a node and all its connected edges from the graph.
+     *
+     * @param id — Node ID to remove.
+     * @returns `true` if the node existed.
+     */
+    removeNode(id) {
+        if (!this.nodes.has(id))
+            return false;
+        // Remove connected edges
+        const edgeIds = this.adjacency.get(id);
+        if (edgeIds) {
+            for (const edgeId of [...edgeIds]) {
+                this.removeEdge(edgeId);
+            }
+        }
+        this.nodes.delete(id);
+        this.adjacency.delete(id);
+        this.tokenCache.delete(id);
+        return true;
+    }
+    /**
+     * Update a node in the graph.
+     */
+    updateNode(node) {
+        this.nodes.set(node.id, node);
+        // Content may have changed — drop the cached token set.
+        this.tokenCache.delete(node.id);
+    }
+    /**
+     * Add an edge to the graph.
+     *
+     * @param input — Edge creation input. `validFrom`/`validTo` define the
+     *   bitemporal event-time validity interval (`createdAt` stays the
+     *   transaction/ingest time); omitted bounds are open-ended.
+     * @returns The created edge.
+     */
+    addEdge(input) {
+        const edge = {
+            id: generateId(),
+            sourceId: input.sourceId,
+            targetId: input.targetId,
+            relation: input.relation ?? "relates_to",
+            weight: input.weight ?? 0.5,
+            metadata: input.metadata ?? {},
+            createdAt: Date.now(),
+            validFrom: input.validFrom ?? null,
+            validTo: input.validTo ?? null,
+        };
+        this.edges.set(edge.id, edge);
+        if (!this.adjacency.has(edge.sourceId)) {
+            this.adjacency.set(edge.sourceId, new Set());
+        }
+        this.adjacency.get(edge.sourceId).add(edge.id);
+        if (!this.adjacency.has(edge.targetId)) {
+            this.adjacency.set(edge.targetId, new Set());
+        }
+        this.adjacency.get(edge.targetId).add(edge.id);
+        return edge;
+    }
+    /**
+     * Remove an edge from the graph.
+     */
+    removeEdge(id) {
+        const edge = this.edges.get(id);
+        if (!edge)
+            return false;
+        this.adjacency.get(edge.sourceId)?.delete(id);
+        this.adjacency.get(edge.targetId)?.delete(id);
+        this.edges.delete(id);
+        return true;
+    }
+    /**
+     * Lazily-computed bag-of-words token set for a node, cached across
+     * autoLink() calls. The cache is invalidated on add/update/remove/clear.
+     */
+    tokensFor(node) {
+        let tokens = this.tokenCache.get(node.id);
+        if (!tokens) {
+            tokens = bagOfWords(node.content);
+            this.tokenCache.set(node.id, tokens);
+        }
+        return tokens;
+    }
+    /**
+     * Get all edges connected to a node.
+     */
+    getEdgesForNode(nodeId) {
+        const edgeIds = this.adjacency.get(nodeId);
+        if (!edgeIds)
+            return [];
+        const result = [];
+        for (const edgeId of edgeIds) {
+            const edge = this.edges.get(edgeId);
+            if (edge)
+                result.push(edge);
+        }
+        return result;
+    }
+    /**
+     * Get neighbours of a node (nodes connected by an edge).
+     */
+    getNeighbours(nodeId) {
+        const edges = this.getEdgesForNode(nodeId);
+        const neighbourIds = new Set();
+        for (const edge of edges) {
+            if (edge.sourceId === nodeId)
+                neighbourIds.add(edge.targetId);
+            else
+                neighbourIds.add(edge.sourceId);
+        }
+        const result = [];
+        for (const id of neighbourIds) {
+            const node = this.nodes.get(id);
+            if (node)
+                result.push(node);
+        }
+        return result;
+    }
+    /**
+     * Attempt to auto-link a node to existing nodes based on text similarity.
+     *
+     * Cost control: linking is O(N) per store, and every accepted link is a
+     * persisted row. Without a per-node cap a repetitive corpus converges to
+     * a complete graph — K_N edges for N nodes (measured: 100 similar nodes
+     * → 4,950 edges, and 300 stores took 2.7s vs 0.1s with linking off).
+     * The cap keeps the most similar `maxLinksPerNode` edges and skips the
+     * long tail, which preserves cluster structure (`findClusters`,
+     * `injectContext`) while making ingestion cost linear-ish in practice.
+     *
+     * @param node     — The node to link.
+     * @param threshold — Minimum similarity score to create an edge [0, 1].
+     * @param maxLinksPerNode — Hard cap on edges created per call.
+     *   `0` disables the cap (legacy complete-graph behavior).
+     * @returns Array of created edges.
+     */
+    autoLink(node, threshold, maxLinksPerNode = DEFAULT_AUTO_LINK_CAP) {
+        const created = [];
+        // Collect candidates first so the cap keeps the BEST links (highest
+        // similarity) rather than whichever happened to be iterated first.
+        const candidates = [];
+        // Tokenize the new node ONCE and reuse cached token sets for existing
+        // nodes: previously both sides were re-tokenized on every comparison
+        // (2 x N bagOfWords calls per store).
+        const tokensNew = this.tokensFor(node);
+        for (const [id, existing] of this.nodes) {
+            if (id === node.id)
+                continue;
+            const sim = tokenSetSimilarity(tokensNew, this.tokensFor(existing));
+            if (sim >= threshold) {
+                candidates.push({ id, sim });
+            }
+        }
+        // Cap AFTER collecting, keeping the strongest links.
+        const selected = maxLinksPerNode > 0 && candidates.length > maxLinksPerNode
+            ? candidates.sort((a, b) => b.sim - a.sim).slice(0, maxLinksPerNode)
+            : candidates;
+        for (const { id, sim } of selected) {
+            const edge = this.addEdge({
+                sourceId: node.id,
+                targetId: id,
+                relation: "relates_to",
+                weight: sim,
+            });
+            created.push(edge);
+        }
+        return created;
+    }
+    /**
+     * Find clusters of strongly connected nodes using a simple BFS approach.
+     *
+     * @param minClusterSize — Minimum number of nodes per cluster.
+     * @returns Array of clusters (each cluster is an array of node IDs).
+     */
+    findClusters(minClusterSize = 2) {
+        const visited = new Set();
+        const clusters = [];
+        for (const nodeId of this.nodes.keys()) {
+            if (visited.has(nodeId))
+                continue;
+            const cluster = [];
+            const queue = [nodeId];
+            while (queue.length > 0) {
+                const current = queue.shift();
+                if (visited.has(current))
+                    continue;
+                visited.add(current);
+                cluster.push(current);
+                const neighbours = this.getNeighbours(current);
+                for (const n of neighbours) {
+                    if (!visited.has(n.id))
+                        queue.push(n.id);
+                }
+            }
+            if (cluster.length >= minClusterSize) {
+                clusters.push(cluster);
+            }
+        }
+        return clusters;
+    }
+    /**
+     * Get a node by ID.
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * Get all nodes.
+     */
+    getAllNodes() {
+        return [...this.nodes.values()];
+    }
+    /**
+     * Get all edges.
+     */
+    getAllEdges() {
+        return [...this.edges.values()];
+    }
+    /**
+     * Bitemporal as-of read: edges whose event-time validity interval covers
+     * `timeMs`. NULL bounds are open-ended. Superseded edges (whose
+     * `validTo` was stamped by invalidation) are excluded for timestamps
+     * at or after their `validTo`, but returned by as-of reads at earlier
+     * times — nothing is deleted.
+     *
+     * @param timeMs — The as-of timestamp (Unix ms).
+     */
+    edgesValidAt(timeMs) {
+        return [...this.edges.values()].filter((edge) => isEdgeValidAt(edge, timeMs));
+    }
+    /**
+     * Close (invalidate) the currently-valid edges incident to a node by
+     * stamping `validTo`. In-memory edges are mutated in place so the mirror
+     * stays consistent with storage; nothing is deleted (add-only).
+     *
+     * @param nodeId — Node whose incident edges to close.
+     * @param timeMs — The invalidation timestamp (Unix ms), usually `now`.
+     * @returns The edges that were closed.
+     */
+    closeEdgesForNode(nodeId, timeMs) {
+        const closed = [];
+        for (const edge of this.getEdgesForNode(nodeId)) {
+            if (isEdgeValidAt(edge, timeMs)) {
+                edge.validTo = timeMs;
+                closed.push(edge);
+            }
+        }
+        return closed;
+    }
+    /**
+     * Node count.
+     */
+    get size() {
+        return this.nodes.size;
+    }
+    /**
+     * Clear the entire graph.
+     */
+    clear() {
+        this.nodes.clear();
+        this.edges.clear();
+        this.adjacency.clear();
+        this.tokenCache.clear();
+    }
+}
+/**
+ * Generate a UUID v4.
+ */
+export function generateId() {
+    return "xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx".replace(/[xy]/g, (c) => {
+        const r = (Math.random() * 16) | 0;
+        const v = c === "x" ? r : (r & 0x3) | 0x8;
+        return v.toString(16);
+    });
+}
+//# sourceMappingURL=graph.js.map

memos/_js/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../src/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,EAAE,CAAC;AAExC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAE9B,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEvD,OAAO,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAoB,EACpB,OAAoB;IAEpB,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEvD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,kDAAkD;IAClD,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAClB,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACzE,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,YAAY,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAC/D,CAAC;AAED;;GAEG;AAEH,uEAAuE;AACvE,8DAA8D;AAC9D,MAAM,uBAAuB,GAAG,IAAI,GAAG,CAAC;IACtC,GAAG;IACH,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,MAAM;IACN,OAAO;IACP,MAAM;IACN,KAAK;IACL,KAAK;IACL,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,OAAO;IACP,OAAO;IACP,QAAQ;IACR,KAAK;IACL,OAAO;IACP,MAAM;IACN,KAAK;IACL,OAAO;IACP,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,IAAI;IACJ,MAAM;IACN,IAAI;IACJ,MAAM;IACN,SAAS;IACT,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,OAAO;IACP,OAAO;IACP,SAAS;IACT,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,QAAQ;IACR,SAAS;IACT,MAAM;IACN,OAAO;IACP,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,MAAM;IACN,MAAM;IACN,IAAI;IACJ,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,MAAM;IACN,MAAM;IACN,SAAS;IACT,OAAO;IACP,IAAI;IACJ,KAAK;IACL,IAAI;IACJ,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;IACP,OAAO;IACP,GAAG;IACH,IAAI;IACJ,IAAI;IACJ,IAAI;IACJ,KAAK;IACL,KAAK;IACL,MAAM;IACN,IAAI;IACJ,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,MAAM;IACN,MAAM;IACN,OAAO;CACR,CAAC,CAAC;AAEH,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,IAAI,GAAG,CACZ,IAAI;SACD,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC;SAC3B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAClE,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,IAAgB,EAAE,MAAc;IACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC;IACzE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC;IACnE,OAAO,CACL,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAU,IAAI,MAAM,CAAC;QACvC,CAAC,MAAM,IAAI,IAAI,CAAC,OAAQ,GAAG,MAAM,CAAC,CACnC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,WAAW;IACtB,gDAAgD;IACxC,SAAS,GAA6B,IAAI,GAAG,EAAE,CAAC;IACxD,wCAAwC;IAChC,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAC;IACnD,wCAAwC;IAChC,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAC;IACnD;;;;OAIG;IACK,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEpD;;;;OAIG;IACH,OAAO,CAAC,IAAgB;QACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,yDAAyD;QACzD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACjC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QAEtC,yBAAyB;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,IAAgB;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,wDAAwD;QACxD,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,KAAsB;QAC5B,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,UAAU,EAAE;YAChB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,YAAY;YACxC,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,GAAG;YAC3B,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE;YAC9B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,SAAS,EAAE,KAAK,CAAC,SAAS,IAAI,IAAI;YAClC,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI;SAC/B,CAAC;QAEF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAE9B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEhD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEhD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,EAAU;QACnB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,IAAgB;QAChC,IAAI,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,MAAc;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,MAAc;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QAEvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM;gBAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;;gBACzD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,QAAQ,CACN,IAAgB,EAChB,SAAiB,EACjB,eAAe,GAAG,qBAAqB;QAEvC,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,oEAAoE;QACpE,mEAAmE;QACnE,MAAM,UAAU,GAAuC,EAAE,CAAC;QAE1D,sEAAsE;QACtE,qEAAqE;QACrE,sCAAsC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACvC,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE;gBAAE,SAAS;YAE7B,MAAM,GAAG,GAAG,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;YACpE,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,MAAM,QAAQ,GACZ,eAAe,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,eAAe;YACxD,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC;YACpE,CAAC,CAAC,UAAU,CAAC;QAEjB,KAAK,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;gBACxB,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACjB,QAAQ,EAAE,EAAE;gBACZ,QAAQ,EAAE,YAAY;gBACtB,MAAM,EAAE,GAAG;aACZ,CAAC,CAAC;YACH,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,cAAc,GAAG,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAe,EAAE,CAAC;QAEhC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,SAAS;YAElC,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;YAEjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS;gBACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAEtB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;gBAC/C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;oBAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YAED,IAAI,OAAO,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;gBACrC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,MAAc;QACzB,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAC9C,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAC5B,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,iBAAiB,CAAC,MAAc,EAAE,MAAc;QAC9C,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,CAAC;YAChD,IAAI,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,UAAU;IACxB,OAAO,sCAAsC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE;QACnE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAC1C,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC"}

memos/_js/harness.d.ts

@@ -0,0 +1,63 @@
+/**
+ * Harness attribution for MemOS — "one memory, every harness."
+ *
+ * Every memory records the agent harness (Claude Code, Cline, Codex,
+ * Gemini CLI, OpenClaw, …) that wrote it, stamped deterministically at
+ * write time. Detection is environment-based — pure, synchronous, no
+ * LLM anywhere — so a fresh process on the same DB file attributes
+ * identically to the process that wrote the memory.
+ *
+ * Detection rules, in priority order:
+ *
+ * 1. `MEMOS_HARNESS` — explicit override. Wins over everything; this is
+ *    also the supported seam for tests and for deployments where the
+ *    harness is known but leaves no env marker.
+ * 2. Known harness env markers (prefix match, first hit wins in the
+ *    table order below).
+ * 3. `"unknown"` — unattributed (plain SDK use, legacy rows, tests).
+ *
+ * The tag is *attribution*, not isolation: it says which harness
+ * authored a memory version. Cross-harness reads default to `all`;
+ * `recall({ harness })` / `search({ harness })` scope to one harness.
+ * When harness B updates a memory written by harness A, the old version
+ * keeps its A tag and the replacement carries B — supersession is
+ * version-scoped, so the version ledger stays honest.
+ *
+ * @module @memos/harness
+ */
+/** Attribution value for memories written with no detectable harness. */
+export declare const UNKNOWN_HARNESS = "unknown";
+/** Environment variable that explicitly overrides harness detection. */
+export declare const MEMOS_HARNESS_ENV = "MEMOS_HARNESS";
+/**
+ * Known harness env markers. Order is priority: the first matching
+ * entry wins, so more specific harnesses must precede less specific
+ * ones. `match` is either an exact variable name or a prefix
+ * (trailing `_` means "prefix match").
+ */
+export declare const HARNESS_MARKERS: ReadonlyArray<{
+    /** Exact env var name or `PREFIX_` for a prefix match. */
+    match: string;
+    /** Normalized harness slug stamped on memories. */
+    harness: string;
+}>;
+/**
+ * Normalize a raw harness name to a stable slug: trimmed, lowercased,
+ * whitespace/underscores collapsed to `-`. Empty input normalizes to
+ * {@link UNKNOWN_HARNESS}.
+ */
+export declare function normalizeHarness(raw: string): string;
+/**
+ * Deterministically detect the current harness from the environment.
+ *
+ * Pure function of its input — pass `process.env` in production, a
+ * stub record in tests. Scans each marker in priority order; the first
+ * env var that is set and non-empty wins. `MEMOS_HARNESS` always wins.
+ *
+ * @param env — Environment mapping. Defaults to `process.env`.
+ * @returns A harness slug (`"claude-code"`, `"cline"`, `"codex"`,
+ *   `"gemini-cli"`, `"openclaw"`, a `MEMOS_HARNESS` slug, or
+ *   `"unknown"`).
+ */
+export declare function detectHarness(env?: NodeJS.ProcessEnv | Record<string, string | undefined>): string;
+//# sourceMappingURL=harness.d.ts.map

memos/_js/harness.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"harness.d.ts","sourceRoot":"","sources":["../src/harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,yEAAyE;AACzE,eAAO,MAAM,eAAe,YAAY,CAAC;AAEzC,wEAAwE;AACxE,eAAO,MAAM,iBAAiB,kBAAkB,CAAC;AAEjD;;;;;GAKG;AACH,eAAO,MAAM,eAAe,EAAE,aAAa,CAAC;IAC1C,0DAA0D;IAC1D,KAAK,EAAE,MAAM,CAAC;IACd,mDAAmD;IACnD,OAAO,EAAE,MAAM,CAAC;CACjB,CAOA,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAOpD;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,aAAa,CAC3B,GAAG,GAAE,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAe,GACxE,MAAM,CAsBR"}

memos/_js/harness.js

@@ -0,0 +1,93 @@
+/**
+ * Harness attribution for MemOS — "one memory, every harness."
+ *
+ * Every memory records the agent harness (Claude Code, Cline, Codex,
+ * Gemini CLI, OpenClaw, …) that wrote it, stamped deterministically at
+ * write time. Detection is environment-based — pure, synchronous, no
+ * LLM anywhere — so a fresh process on the same DB file attributes
+ * identically to the process that wrote the memory.
+ *
+ * Detection rules, in priority order:
+ *
+ * 1. `MEMOS_HARNESS` — explicit override. Wins over everything; this is
+ *    also the supported seam for tests and for deployments where the
+ *    harness is known but leaves no env marker.
+ * 2. Known harness env markers (prefix match, first hit wins in the
+ *    table order below).
+ * 3. `"unknown"` — unattributed (plain SDK use, legacy rows, tests).
+ *
+ * The tag is *attribution*, not isolation: it says which harness
+ * authored a memory version. Cross-harness reads default to `all`;
+ * `recall({ harness })` / `search({ harness })` scope to one harness.
+ * When harness B updates a memory written by harness A, the old version
+ * keeps its A tag and the replacement carries B — supersession is
+ * version-scoped, so the version ledger stays honest.
+ *
+ * @module @memos/harness
+ */
+/** Attribution value for memories written with no detectable harness. */
+export const UNKNOWN_HARNESS = "unknown";
+/** Environment variable that explicitly overrides harness detection. */
+export const MEMOS_HARNESS_ENV = "MEMOS_HARNESS";
+/**
+ * Known harness env markers. Order is priority: the first matching
+ * entry wins, so more specific harnesses must precede less specific
+ * ones. `match` is either an exact variable name or a prefix
+ * (trailing `_` means "prefix match").
+ */
+export const HARNESS_MARKERS = [
+    { match: "CLAUDECODE", harness: "claude-code" },
+    { match: "CLAUDE_CODE_", harness: "claude-code" },
+    { match: "CLINE_", harness: "cline" },
+    { match: "CODEX_", harness: "codex" },
+    { match: "GEMINI_", harness: "gemini-cli" },
+    { match: "OPENCLAW_", harness: "openclaw" },
+];
+/**
+ * Normalize a raw harness name to a stable slug: trimmed, lowercased,
+ * whitespace/underscores collapsed to `-`. Empty input normalizes to
+ * {@link UNKNOWN_HARNESS}.
+ */
+export function normalizeHarness(raw) {
+    const slug = raw
+        .trim()
+        .toLowerCase()
+        .replace(/[\s_]+/g, "-")
+        .replace(/[^a-z0-9-]/g, "");
+    return slug.length > 0 ? slug : UNKNOWN_HARNESS;
+}
+/**
+ * Deterministically detect the current harness from the environment.
+ *
+ * Pure function of its input — pass `process.env` in production, a
+ * stub record in tests. Scans each marker in priority order; the first
+ * env var that is set and non-empty wins. `MEMOS_HARNESS` always wins.
+ *
+ * @param env — Environment mapping. Defaults to `process.env`.
+ * @returns A harness slug (`"claude-code"`, `"cline"`, `"codex"`,
+ *   `"gemini-cli"`, `"openclaw"`, a `MEMOS_HARNESS` slug, or
+ *   `"unknown"`).
+ */
+export function detectHarness(env = process.env) {
+    const override = env[MEMOS_HARNESS_ENV];
+    if (override !== undefined && override.trim().length > 0) {
+        return normalizeHarness(override);
+    }
+    const names = Object.keys(env);
+    for (const marker of HARNESS_MARKERS) {
+        if (marker.match.endsWith("_")) {
+            // Prefix marker, e.g. CLAUDE_CODE_ matches CLAUDE_CODE_ENTRYPOINT.
+            const hit = names.some((name) => name.startsWith(marker.match) && (env[name] ?? "").trim().length > 0);
+            if (hit)
+                return marker.harness;
+        }
+        else {
+            const value = env[marker.match];
+            if (value !== undefined && value.trim().length > 0) {
+                return marker.harness;
+            }
+        }
+    }
+    return UNKNOWN_HARNESS;
+}
+//# sourceMappingURL=harness.js.map

memos/_js/harness.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"harness.js","sourceRoot":"","sources":["../src/harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,yEAAyE;AACzE,MAAM,CAAC,MAAM,eAAe,GAAG,SAAS,CAAC;AAEzC,wEAAwE;AACxE,MAAM,CAAC,MAAM,iBAAiB,GAAG,eAAe,CAAC;AAEjD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAKvB;IACH,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,aAAa,EAAE;IAC/C,EAAE,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,aAAa,EAAE;IACjD,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE;IACrC,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE;IACrC,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE;IAC3C,EAAE,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE;CAC5C,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW;IAC1C,MAAM,IAAI,GAAG,GAAG;SACb,IAAI,EAAE;SACN,WAAW,EAAE;SACb,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC;SACvB,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;IAC9B,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC;AAClD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,aAAa,CAC3B,GAAG,GAA2D,OAAO,CAAC,GAAG;IAEzE,MAAM,QAAQ,GAAG,GAAG,CAAC,iBAAiB,CAAC,CAAC;IACxC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzD,OAAO,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;QACrC,IAAI,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,mEAAmE;YACnE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CACpB,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CACvE,CAAC;YACF,IAAI,GAAG;gBAAE,OAAO,MAAM,CAAC,OAAO,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnD,OAAO,MAAM,CAAC,OAAO,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC"}