@monoes/monomindcli 2.16.12 → 2.16.13

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

@@ -0,0 +1,239 @@
+/**
+ * Memory Knowledge Graph — retrieval: kgSearch (seed nodes, neighbourhood
+ * expansion, evidence-aware ranking) and kgGlossary for extraction prompts.
+ * Split out of memory-kg.ts, which re-exports the public symbols.
+ */
+import { bridgeGetEntry, bridgeSearchEntries } from './memory-bridge.js';
+import { readAdj, readIndexStatus } from './memory-kg-index.js';
+import { kgNamespaces, normalizeName } from './memory-kg-model.js';
+import { SEARCH_EDGE_SCAN_MAX, scanNamespace } from './memory-kg-scan.js';
+/** Seed candidates pulled before filtering and ranking. */
+const SEARCH_SEED_LIMIT = 15;
+/** Extra candidates fetched when a `nodeSet` narrows the graph.
+ *
+ *  The bridge has no tag filter, so set membership can only be tested after
+ *  retrieval. Filtering the unfiltered top-15 meant a node that IS in the set
+ *  but ranks 16th overall was missed — the set made results scarcer instead of
+ *  more precise. Over-fetching moves the cutoff after the filter. */
+const SEARCH_NODE_SET_OVERFETCH = 4;
+/** How far a co-occurrence guess drops below an equally-seeded stated fact.
+ *  Enough to lose a tie, not enough to hide it: `mentioned_with` between two
+ *  strong seeds is still worth surfacing when nothing better was asserted. */
+const HEURISTIC_PENALTY = 0.15;
+/** Live origins disagree about what this edge says. Still returned — a disputed
+ *  fact is information — but it does not outrank a settled one. */
+const CONFLICT_PENALTY = 0.1;
+/** Seeded retrieval → neighborhood → triplet ranking (cognee's brute-force
+ *  triplet search, scaled down). Seed scores already carry the Phase 1 feedback
+ *  blend, and the seed retrieval may be vector or keyword — `method` on the
+ *  result says which actually ran.
+ *
+ *  Ranking weighs exactly two evidence signals, both read off the claim ledger:
+ *  extraction method and description conflict. It deliberately does NOT model
+ *  source credibility, claim freshness, or whether the relation itself answers
+ *  the query — those need an evaluation set to tune against, and guessing at
+ *  them would be the same overclaim this weighting exists to correct. */
+export async function kgSearch(options) {
+    try {
+        const limit = options.limit ?? 8;
+        const ns = kgNamespaces(options.scope);
+        const seedsRes = await bridgeSearchEntries({
+            query: options.query,
+            namespace: ns.nodes,
+            // Over-fetch when a set filter follows, so the cutoff lands AFTER it.
+            limit: options.nodeSet ? SEARCH_SEED_LIMIT * SEARCH_NODE_SET_OVERFETCH : SEARCH_SEED_LIMIT,
+            threshold: 0.25,
+            dbPath: options.dbPath,
+        });
+        // What the retrieval actually was, carried on every return below: a keyword
+        // fallback presented as vector-seeded search is the overclaim B5 names.
+        const retrieval = {
+            ...(seedsRes?.searchMethod ? { method: seedsRes.searchMethod } : {}),
+            ...(seedsRes?.fallbackReason ? { fallbackReason: seedsRes.fallbackReason } : {}),
+        };
+        let seedResults = seedsRes?.results ?? [];
+        if (options.nodeSet) {
+            const setTag = normalizeName(options.nodeSet);
+            seedResults = seedResults.filter((r) => (r.tags ?? []).includes(setTag));
+        }
+        seedResults = seedResults.slice(0, SEARCH_SEED_LIMIT);
+        if (!seedResults.length)
+            return { success: true, context: '', triplets: [], seeds: [], ...retrieval };
+        const seedScore = new Map();
+        for (const s of seedResults)
+            seedScore.set(s.key, s.score);
+        const triplets = [];
+        let scannedEdges = 0;
+        let truncated = false;
+        /** Score one edge against the seeded entities and, if relevant, push its
+         *  triplet — shared by the indexed and exhaustive gathering paths below
+         *  so ranking never depends on which one ran (K7). */
+        const considerEdge = (e) => {
+            scannedEdges++;
+            const md = (e.metadata ?? {});
+            if (md?.kg !== 'edge' || md.valid_to != null)
+                return;
+            const src = String(md.src ?? '');
+            const dst = String(md.dst ?? '');
+            const sSrc = seedScore.get(src) ?? 0;
+            const sDst = seedScore.get(dst) ?? 0;
+            if (sSrc === 0 && sDst === 0)
+                return;
+            // Both endpoints seeded beats one; the unseeded endpoint contributes a
+            // neutral 0.35 so bridging edges from a strong seed still surface.
+            const relevance = (Math.max(sSrc, 0.35) + Math.max(sDst, 0.35)) / 2 + (sSrc > 0 && sDst > 0 ? 0.1 : 0);
+            // Evidence, from the claim ledger. An edge whose method was never
+            // recorded is left at its relevance score — unknown is not evidence
+            // against it, and penalizing it would demote the entire pre-existing
+            // graph relative to anything written today.
+            const method = md.method === 'asserted' || md.method === 'heuristic'
+                ? md.method
+                : undefined;
+            const conflict = md.conflict === true;
+            const score = Math.max(0, relevance -
+                (method === 'heuristic' ? HEURISTIC_PENALTY : 0) -
+                (conflict ? CONFLICT_PENALTY : 0));
+            triplets.push({
+                source: String(md.source_name ?? src),
+                relation: String(md.relation ?? 'related_to'),
+                target: String(md.target_name ?? dst),
+                fact: e.content,
+                score,
+                ...(method ? { method } : {}),
+                ...(conflict ? { conflict } : {}),
+                id: e.id,
+                key: e.key,
+            });
+        };
+        // Scores are per-edge, so pruning to the running top-`limit` after every
+        // batch yields exactly the same result as sorting the whole set at the end.
+        const pruneToLimit = () => {
+            if (triplets.length > limit) {
+                triplets.sort((a, b) => b.score - a.score);
+                triplets.length = limit;
+            }
+        };
+        // K7: gather candidate edges via each seed's adjacency entry — O(seeds ×
+        // degree) instead of a full namespace scan — when the scope's index is
+        // ready and every seed's adjacency entry resolves. Any seed that misses
+        // (index not ready, or an unresolvable ref) falls the WHOLE query back to
+        // the exhaustive scan rather than silently searching only some seeds.
+        let covered = false;
+        let usedIndex = false;
+        if ((await readIndexStatus(ns, options.dbPath)).state === 'ready') {
+            const candidateKeys = new Set();
+            let indexOk = true;
+            for (const s of seedResults) {
+                const adj = await readAdj(ns, s.key, options.dbPath);
+                if (adj === null) {
+                    indexOk = false;
+                    break;
+                }
+                for (const key of adj.edgeKeys)
+                    candidateKeys.add(key);
+            }
+            if (indexOk) {
+                for (const key of candidateKeys) {
+                    const res = await bridgeGetEntry({ key, namespace: ns.edges, dbPath: options.dbPath });
+                    if (res?.found && res.entry)
+                        considerEdge(res.entry);
+                }
+                pruneToLimit();
+                usedIndex = true;
+                covered = true;
+            }
+        }
+        // Paged edge scan (see monolean note in module header). Each page is folded
+        // into the running top-`limit` immediately, so memory stays at one page
+        // regardless of how many edges the namespace holds.
+        if (!usedIndex) {
+            covered = await scanNamespace(ns.edges, options.dbPath, (page) => {
+                for (const e of page)
+                    considerEdge(e);
+                pruneToLimit();
+                if (scannedEdges >= SEARCH_EDGE_SCAN_MAX) {
+                    truncated = true;
+                    return false;
+                }
+                return true;
+            });
+        }
+        // An unreadable namespace is an incomplete answer, not an empty graph.
+        if (!covered)
+            truncated = true;
+        triplets.sort((a, b) => b.score - a.score);
+        const seeds = seedResults.slice(0, limit).map((s) => {
+            // metadata is not in search results; parse from rendered content "name — description"
+            const dash = s.content.indexOf(' — ');
+            return {
+                name: dash > 0 ? s.content.slice(0, dash) : s.key,
+                // Tags carry the stored type (`['kg', <type>, …]`). The key never did:
+                // reading `key.split(':')[1]` reported the type of `n:shared_service`
+                // as `shared_service`, and under hashed IDs would report a digest.
+                type: (s.tags ?? [])[1] ?? 'entity',
+                description: dash > 0 ? s.content.slice(dash + 3) : s.content,
+                score: s.score,
+                id: s.id,
+            };
+        });
+        const context = [
+            ...triplets.map((t) => `${t.source} —${t.relation}→ ${t.target}${t.fact && t.fact !== `${t.source} ${t.relation} ${t.target}` ? ` (${t.fact})` : ''}`),
+            ...(triplets.length ? [] : seeds.map((s) => `${s.name}: ${s.description}`)),
+        ].join('\n');
+        return {
+            success: true,
+            context,
+            triplets,
+            seeds,
+            scannedEdges,
+            ...(truncated && { truncated }),
+            ...retrieval,
+        };
+    }
+    catch (err) {
+        return {
+            success: false,
+            context: '',
+            triplets: [],
+            seeds: [],
+            error: err instanceof Error ? err.message : String(err),
+        };
+    }
+}
+// ── Glossary (anti-duplicate-entity injection for extraction prompts) ──
+export async function kgGlossary(options) {
+    const limit = options?.limit ?? 40;
+    // Running top-`limit` by rank, deduplicated by normalized name. Folding each
+    // page in and pruning keeps the whole node namespace in scope without ever
+    // holding more than a page plus `limit` names.
+    let top = [];
+    await scanNamespace(kgNamespaces(options?.scope).nodes, options?.dbPath, (page) => {
+        for (const e of page) {
+            const md = e.metadata;
+            // Glossary is for ENTITY name reuse — rule prose and extraction-source
+            // Session nodes would drown it.
+            const t = String(md?.type ?? '').toLowerCase();
+            if (md?.node_set === 'rules' || t === 'rule' || t === 'session')
+                continue;
+            const fw = typeof md.feedback_weight === 'number' ? md.feedback_weight : 0.5;
+            const freq = typeof md.frequency_weight === 'number' ? md.frequency_weight : 0;
+            const version = typeof md.version === 'number' ? md.version : 1;
+            const name = String(md.name ?? e.key);
+            top.push({ name, norm: normalizeName(name), rank: version + freq + fw });
+        }
+        top.sort((a, b) => b.rank - a.rank);
+        const seen = new Set();
+        const pruned = [];
+        for (const n of top) {
+            if (seen.has(n.norm))
+                continue;
+            seen.add(n.norm);
+            pruned.push(n);
+            if (pruned.length >= limit)
+                break;
+        }
+        top = pruned;
+    });
+    return top.map((n) => n.name);
+}
+//# sourceMappingURL=memory-kg-search.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-kg-search.js","sourceRoot":"","sources":["../../../src/memory/memory-kg-search.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAEzE,OAAO,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEhE,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAEnE,OAAO,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AA4C1E,2DAA2D;AAC3D,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAC7B;;;;;qEAKqE;AACrE,MAAM,yBAAyB,GAAG,CAAC,CAAC;AAEpC;;8EAE8E;AAC9E,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAC/B;mEACmE;AACnE,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B;;;;;;;;;yEASyE;AACzE,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAQ9B;IACC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,MAAM,mBAAmB,CAAC;YACzC,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,SAAS,EAAE,EAAE,CAAC,KAAK;YACnB,sEAAsE;YACtE,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,GAAG,yBAAyB,CAAC,CAAC,CAAC,iBAAiB;YAC1F,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CAAC,CAAC;QACH,4EAA4E;QAC5E,wEAAwE;QACxE,MAAM,SAAS,GAAG;YAChB,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,GAAG,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACjF,CAAC;QACF,IAAI,WAAW,GAAG,QAAQ,EAAE,OAAO,IAAI,EAAE,CAAC;QAC1C,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC9C,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3E,CAAC;QACD,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;QACtD,IAAI,CAAC,WAAW,CAAC,MAAM;YACrB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC;QAE/E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,WAAW;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAE3D,MAAM,QAAQ,GAA+B,EAAE,CAAC;QAChD,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,SAAS,GAAG,KAAK,CAAC;QAEtB;;8DAEsD;QACtD,MAAM,YAAY,GAAG,CAAC,CAAe,EAAQ,EAAE;YAC7C,YAAY,EAAE,CAAC;YACf,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAA4B,CAAC;YACzD,IAAI,EAAE,EAAE,EAAE,KAAK,MAAM,IAAI,EAAE,CAAC,QAAQ,IAAI,IAAI;gBAAE,OAAO;YACrD,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC;gBAAE,OAAO;YACrC,uEAAuE;YACvE,mEAAmE;YACnE,MAAM,SAAS,GACb,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,kEAAkE;YAClE,oEAAoE;YACpE,qEAAqE;YACrE,4CAA4C;YAC5C,MAAM,MAAM,GACV,EAAE,CAAC,MAAM,KAAK,UAAU,IAAI,EAAE,CAAC,MAAM,KAAK,WAAW;gBACnD,CAAC,CAAE,EAAE,CAAC,MAA6B;gBACnC,CAAC,CAAC,SAAS,CAAC;YAChB,MAAM,QAAQ,GAAG,EAAE,CAAC,QAAQ,KAAK,IAAI,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,EACD,SAAS;gBACP,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChD,CAAC,QAAQ,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CACpC,CAAC;YACF,QAAQ,CAAC,IAAI,CAAC;gBACZ,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,WAAW,IAAI,GAAG,CAAC;gBACrC,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,QAAQ,IAAI,YAAY,CAAC;gBAC7C,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,WAAW,IAAI,GAAG,CAAC;gBACrC,IAAI,EAAE,CAAC,CAAC,OAAO;gBACf,KAAK;gBACL,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7B,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjC,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,GAAG,EAAE,CAAC,CAAC,GAAG;aACX,CAAC,CAAC;QACL,CAAC,CAAC;QACF,yEAAyE;QACzE,4EAA4E;QAC5E,MAAM,YAAY,GAAG,GAAS,EAAE;YAC9B,IAAI,QAAQ,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC3C,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC;QAEF,yEAAyE;QACzE,uEAAuE;QACvE,wEAAwE;QACxE,0EAA0E;QAC1E,sEAAsE;QACtE,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,MAAM,eAAe,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,OAAO,EAAE,CAAC;YAClE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;YACxC,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC5B,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBACrD,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;oBACjB,OAAO,GAAG,KAAK,CAAC;oBAChB,MAAM;gBACR,CAAC;gBACD,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ;oBAAE,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACzD,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACZ,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;oBAChC,MAAM,GAAG,GAAG,MAAM,cAAc,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;oBACvF,IAAI,GAAG,EAAE,KAAK,IAAI,GAAG,CAAC,KAAK;wBAAE,YAAY,CAAC,GAAG,CAAC,KAAqB,CAAC,CAAC;gBACvE,CAAC;gBACD,YAAY,EAAE,CAAC;gBACf,SAAS,GAAG,IAAI,CAAC;gBACjB,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;QACD,4EAA4E;QAC5E,wEAAwE;QACxE,oDAAoD;QACpD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,GAAG,MAAM,aAAa,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;gBAC/D,KAAK,MAAM,CAAC,IAAI,IAAI;oBAAE,YAAY,CAAC,CAAC,CAAC,CAAC;gBACtC,YAAY,EAAE,CAAC;gBACf,IAAI,YAAY,IAAI,oBAAoB,EAAE,CAAC;oBACzC,SAAS,GAAG,IAAI,CAAC;oBACjB,OAAO,KAAK,CAAC;gBACf,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;QACL,CAAC;QACD,uEAAuE;QACvE,IAAI,CAAC,OAAO;YAAE,SAAS,GAAG,IAAI,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAClD,sFAAsF;YACtF,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACtC,OAAO;gBACL,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;gBACjD,uEAAuE;gBACvE,sEAAsE;gBACtE,mEAAmE;gBACnE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ;gBACnC,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;gBAC7D,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,EAAE,EAAE,CAAC,CAAC,EAAE;aACT,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG;YACd,GAAG,QAAQ,CAAC,GAAG,CACb,CAAC,CAAC,EAAE,EAAE,CACJ,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACjI;YACD,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;SAC5E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,OAAO;YACL,OAAO,EAAE,IAAI;YACb,OAAO;YACP,QAAQ;YACR,KAAK;YACL,YAAY;YACZ,GAAG,CAAC,SAAS,IAAI,EAAE,SAAS,EAAE,CAAC;YAC/B,GAAG,SAAS;SACb,CAAC;IACJ,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,OAAO;YACL,OAAO,EAAE,KAAK;YACd,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,EAAE;YACZ,KAAK,EAAE,EAAE;YACT,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;SACxD,CAAC;IACJ,CAAC;AACH,CAAC;AAED,0EAA0E;AAE1E,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,OAOhC;IACC,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC;IACnC,6EAA6E;IAC7E,2EAA2E;IAC3E,+CAA+C;IAC/C,IAAI,GAAG,GAAmD,EAAE,CAAC;IAE7D,MAAM,aAAa,CAAC,YAAY,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QAChF,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,EAAE,GAAG,CAAC,CAAC,QAAmC,CAAC;YACjD,uEAAuE;YACvE,gCAAgC;YAChC,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YAC/C,IAAI,EAAE,EAAE,QAAQ,KAAK,OAAO,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YAC1E,MAAM,EAAE,GAAG,OAAO,EAAE,CAAC,eAAe,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC;YAC7E,MAAM,IAAI,GAAG,OAAO,EAAE,CAAC,gBAAgB,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/E,MAAM,OAAO,GAAG,OAAO,EAAE,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACtC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,SAAS;YAC/B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,IAAI,MAAM,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACpC,CAAC;QACD,GAAG,GAAG,MAAM,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC"}