@sema-ai/core 1.275.1

package/dist/core/memory-engine/sync-client.js

@@ -0,0 +1,328 @@
+// design/142 S2.5 — the TOC-side FILE half of one sync round ([657]③ 分工: plan 随数据走 — the side
+// HOLDING the data computes its own plan with the SAME pure functions; [671]① server half SHIPPED
+// as `POST /v1/memory/sync/:scope` in @sema-ai/server 1.175.0, src/memory-sync.ts there is the
+// authoritative wire-contract twin of this module).
+//
+// `syncMemoryScope` is a pure ORCHESTRATION over injected pieces — it owns NO I/O of its own:
+//   - the local `MemoryBackend` (the File authority plane on a TOC machine),
+//   - the persisted per-(scope,peer) `MemorySyncCursor` (the caller loads/stores it),
+//   - an injected `transport` (`(path, body) => Promise<unknown>`) — no fetch in core: the
+//     deployment owns HTTP, auth headers, retries and TLS.
+//
+// One round = one RTT, both directions (the [671]① response carries the pull half):
+//   ① read the scope's local entries (listHeaders → getByIds; a `deleted: true` frontmatter
+//     tombstone counts as an EXPLICIT local delete — types.ts §2.4: mere absence never deletes,
+//     but a tombstone is precisely the declared delete);
+//   ② compute the PUSH half with the same pure reconcile the server uses — peer modeled as
+//     BASELINE STUBS (id pinned at cursor.baseRevs[id]): by construction the plan can only contain
+//     `push` (new/changed here) and `deleteRemote` (deleted here, peer-unchanged-at-baseline);
+//   ③ POST { peer, baseRevs, entries, deletes } — the server screens/CASes our push and answers
+//     { applied, conflicts, serverEntries, serverDeletes, cursor };
+//   ④ land the pull half locally under the full CAS discipline (sync.ts header: the CALLER owns
+//     screening inbound entries — a sync channel bypasses the harvest gate by construction):
+//     rev honesty (computeEntryRev recomputed per entry — a lying rev breaks the identical-revs
+//     convergence judgment) + screenInboundEntries, then applyPatches with `baseRevs[id]` as the
+//     per-id CAS baseline (baseline present ⇒ update+baseRev; absent ⇒ plain add — the
+//     MemorySyncPlan JSDoc's CAS discipline verbatim); conflicts are AGGREGATED (server-reported +
+//     local CAS + gate rejects), never hidden;
+//   ⑤ cursor retention discipline: the response cursor is persisted ONLY when EVERY pull-half item
+//     landed cleanly. Any local conflict/reject ⇒ the cursor DOES NOT MOVE and the details come
+//     back — both endings converge with zero rollback (applied ⇒ next round identical revs no-op +
+//     baseline advance; not applied ⇒ the server re-pushes cleanly off the retained baseline).
+//
+// Transport failure timing: the transport is called BEFORE any local write, so a thrown transport
+// error propagates with ZERO local side effects (reads only).
+import { computeEntryRev } from "./frontmatter.js";
+import { screenInboundEntries } from "./data-plane.js";
+import { reconcileMemoryEntries } from "./sync.js";
+/** The server route (server.ts holds auth/owner-gate/shape-validation on its side). The scope is
+ *  a PATH SEGMENT: percent-encoded here, decoded by the server router. */
+function memorySyncPath(scope) {
+    return `/v1/memory/sync/${encodeURIComponent(scope)}`;
+}
+/** Baseline stub — the peer-as-of-last-round model for the client-side plan: only id/rev
+ *  participate in reconcile judgment; rev === baseRevs[id] ⇒ remoteChanged is constantly false ⇒
+ *  the stub can never be selected for pull/deleteLocal, and its empty body never lands anywhere
+ *  (the server uses the same construction for ids our push does not mention). */
+function baselineStub(id, rev, scope) {
+    return { id, rev, scope, slug: `sync-baseline-stub/${id}`, frontmatter: {}, body: "" };
+}
+const isRecord = (v) => v !== null && typeof v === "object" && !Array.isArray(v);
+const isNonEmptyString = (v) => typeof v === "string" && v.length > 0;
+/** Shape-validate the transport's response (picked-not-spread — unknown keys never flow into the
+ *  local data plane; entry-level trust gates [rev honesty, inbound screen] run separately in the
+ *  apply step so a bad ENTRY is a per-id conflict while a bad ENVELOPE is a thrown protocol error). */
+function parseMemorySyncResponse(raw, scope, peer) {
+    const fail = (why) => {
+        throw new Error(`memory sync: transport response is not a valid sync response (${why})`);
+    };
+    if (!isRecord(raw))
+        fail("body must be a JSON object { applied, conflicts, serverEntries, serverDeletes, cursor }");
+    const b = raw;
+    const applied = [];
+    if (!Array.isArray(b["applied"]))
+        fail("applied must be an array");
+    for (const a of b["applied"]) {
+        if (!isRecord(a) || (a["op"] !== "add" && a["op"] !== "update" && a["op"] !== "delete") || !isNonEmptyString(a["id"])) {
+            fail("each applied item must be { op: add|update|delete, id }");
+        }
+        const rec = a;
+        applied.push({ op: rec["op"], id: rec["id"], ...(isNonEmptyString(rec["slug"]) ? { slug: rec["slug"] } : {}) });
+    }
+    const conflicts = [];
+    if (!Array.isArray(b["conflicts"]))
+        fail("conflicts must be an array");
+    for (const c of b["conflicts"]) {
+        if (!isRecord(c) || !isNonEmptyString(c["id"]) || typeof c["reason"] !== "string")
+            fail("each conflict must be { id, reason }");
+        const rec = c;
+        conflicts.push({
+            id: rec["id"],
+            reason: rec["reason"],
+            ...(isNonEmptyString(rec["baseRev"]) ? { baseRev: rec["baseRev"] } : {}),
+            ...(isNonEmptyString(rec["currentRev"]) ? { currentRev: rec["currentRev"] } : {}),
+        });
+    }
+    const serverEntries = [];
+    if (!Array.isArray(b["serverEntries"]))
+        fail("serverEntries must be an array");
+    for (const raw2 of b["serverEntries"]) {
+        if (!isRecord(raw2))
+            fail("each server entry must be an object { id, slug, frontmatter, body, rev, scope }");
+        const e = raw2;
+        if (!isNonEmptyString(e["id"]) || !isNonEmptyString(e["slug"]) || typeof e["body"] !== "string" || !isNonEmptyString(e["rev"])) {
+            fail("each server entry must carry non-empty id/slug/rev and a string body");
+        }
+        // Cross-tenant depth: a response for THIS scope's route must never write another scope's disk.
+        if (e["scope"] !== scope)
+            fail(`server entry ${JSON.stringify(e["id"])} has scope ${JSON.stringify(e["scope"])} — must equal the synced scope`);
+        const fmRaw = e["frontmatter"] ?? {};
+        if (!isRecord(fmRaw))
+            fail("entry.frontmatter must be an object");
+        const fm = fmRaw;
+        for (const k of ["name", "description", "type"]) {
+            if (fm[k] !== undefined && typeof fm[k] !== "string")
+                fail(`entry.frontmatter.${k} must be a string when present`);
+        }
+        if (fm["deleted"] !== undefined && typeof fm["deleted"] !== "boolean")
+            fail("entry.frontmatter.deleted must be a boolean when present");
+        if (fm["extra"] !== undefined && !(Array.isArray(fm["extra"]) && fm["extra"].every((s) => typeof s === "string"))) {
+            fail("entry.frontmatter.extra must be an array of strings when present");
+        }
+        serverEntries.push({
+            id: e["id"],
+            slug: e["slug"],
+            body: e["body"],
+            rev: e["rev"],
+            scope,
+            frontmatter: {
+                ...(fm["name"] !== undefined ? { name: fm["name"] } : {}),
+                ...(fm["description"] !== undefined ? { description: fm["description"] } : {}),
+                ...(fm["type"] !== undefined ? { type: fm["type"] } : {}),
+                ...(fm["deleted"] !== undefined ? { deleted: fm["deleted"] } : {}),
+                ...(fm["extra"] !== undefined ? { extra: [...fm["extra"]] } : {}),
+            },
+        });
+    }
+    const serverDeletes = [];
+    if (!Array.isArray(b["serverDeletes"]))
+        fail("serverDeletes must be an array");
+    for (const d of b["serverDeletes"]) {
+        if (!isRecord(d) || !isNonEmptyString(d["id"]) || !isNonEmptyString(d["baseRev"]))
+            fail("each server delete must be { id, baseRev }");
+        const rec = d;
+        serverDeletes.push({ id: rec["id"], baseRev: rec["baseRev"] });
+    }
+    const cur = b["cursor"];
+    if (!isRecord(cur))
+        fail("cursor must be an object { peer, baseRevs, updatedAtMs }");
+    const curRec = cur;
+    if (curRec["peer"] !== peer)
+        fail(`cursor.peer ${JSON.stringify(curRec["peer"])} does not match the requested peer ${JSON.stringify(peer)}`);
+    if (!isRecord(curRec["baseRevs"]))
+        fail("cursor.baseRevs must be an object mapping id → rev");
+    const baseRevs = {};
+    for (const [id, rev] of Object.entries(curRec["baseRevs"])) {
+        if (!isNonEmptyString(rev))
+            fail(`cursor.baseRevs[${JSON.stringify(id)}] must be a non-empty rev string`);
+        baseRevs[id] = rev;
+    }
+    const updatedAtMs = curRec["updatedAtMs"];
+    if (typeof updatedAtMs !== "number" || !Number.isFinite(updatedAtMs))
+        fail("cursor.updatedAtMs must be a finite number");
+    return { applied, conflicts, serverEntries, serverDeletes, cursor: { peer, baseRevs, updatedAtMs: updatedAtMs } };
+}
+/**
+ * One full CLIENT sync round for one (scope, peer) against the [671]① central sync API — see the
+ * module header for the ①-⑤ flow and the cursor retention discipline. Pure orchestration: all I/O
+ * rides the injected backend/transport; the caller persists the returned cursor.
+ */
+export async function syncMemoryScope(opts) {
+    const { backend, scope, transport, cursor } = opts;
+    if (!isNonEmptyString(scope))
+        throw new Error("memory sync: scope must be a non-empty string");
+    const peer = opts.peer ?? cursor?.peer ?? "central";
+    const now = opts.now ?? Date.now;
+    // Cursor identity guards — a cursor is per-(scope, peer); wiring the wrong one is a caller bug
+    // that would silently misjudge every entry as changed/deleted. Fail loud instead.
+    if (cursor !== undefined && cursor.scope !== scope) {
+        throw new Error(`memory sync: cursor is for scope ${JSON.stringify(cursor.scope)}, not ${JSON.stringify(scope)}`);
+    }
+    if (cursor !== undefined && cursor.peer !== peer) {
+        throw new Error(`memory sync: cursor is for peer ${JSON.stringify(cursor.peer)}, not ${JSON.stringify(peer)}`);
+    }
+    const baseRevs = { ...(cursor?.baseRevs ?? {}) };
+    // ① Local read (headers → bodies; scope filter as depth — getByIds is id-keyed across scopes).
+    const headers = (await backend.listHeaders([scope])).filter((h) => h.scope === scope);
+    const fetched = (await backend.getByIds(headers.map((h) => h.id))).filter((e) => e.scope === scope);
+    // A `deleted: true` frontmatter tombstone is the EXPLICIT delete declaration (types.ts §2.4) —
+    // treat it as absent so a baselined id lands in `deletes` (a brand-new tombstone syncs as nothing).
+    const local = fetched.filter((e) => e.frontmatter.deleted !== true);
+    // ② The push half via the SAME pure function ([671]①: 对自己盘算 plan) — the peer modeled as
+    // baseline stubs. By construction only `push` / `deleteRemote` can be non-empty (a stub's rev
+    // equals the baseline, so `remoteChanged` is constantly false and every baseline id has a stub).
+    const stubs = Object.entries(baseRevs).map(([id, rev]) => baselineStub(id, rev, scope));
+    const plan = reconcileMemoryEntries(baseRevs, local, stubs);
+    if (plan.pull.length > 0 || plan.deleteLocal.length > 0 || plan.conflicts.length > 0 || plan.cleared.length > 0) {
+        throw new Error("memory sync: internal invariant violated — a baseline-stub peer produced pull/deleteLocal/conflict/cleared legs");
+    }
+    const request = {
+        peer,
+        baseRevs,
+        entries: plan.push,
+        deletes: plan.deleteRemote.map((d) => d.id),
+    };
+    // ③ One RTT. The transport runs BEFORE any local write: a throw here has zero local side effects.
+    const resp = parseMemorySyncResponse(await transport(memorySyncPath(scope), request), scope, peer);
+    // ④ Land the pull half. sync.ts header: the CALLER owns inbound screening (a sync channel
+    // bypasses the harvest gate by construction) — rev honesty first (a lying rev breaks the
+    // identical-revs convergence judgment; the server runs the same check on our push), then the
+    // shared gate rule set. A rejected entry is a per-id conflict, never a silent drop.
+    const conflicts = resp.conflicts.map((c) => ({ side: "server", ...c }));
+    const rejected = new Set();
+    // E-02 first line of defense (before the backend guard): a snapshot of the ids we hold locally
+    // RIGHT NOW. A serverEntry whose id is NOT in our baseline but IS already on the local plane is a
+    // concurrent local create the server never saw (an RTT race). Report it here — earlier and clearer
+    // than the backend's `add_guard_absent_conflict` — and never let it fall through to a blind add.
+    const localIds = new Set(local.map((e) => e.id));
+    // E-01: an id may not appear in BOTH the pull-entries leg and the delete leg of one response — the
+    // server would be telling us to write and unwrite the same id in one round. Refuse both sides.
+    const serverEntryIds = new Set(resp.serverEntries.map((e) => e.id));
+    for (const e of resp.serverEntries) {
+        const computed = computeEntryRev(e);
+        if (computed !== e.rev) {
+            rejected.add(e.id);
+            conflicts.push({
+                side: "local",
+                id: e.id,
+                reason: `rev_mismatch: server claimed ${JSON.stringify(e.rev)} but the content hashes to ${JSON.stringify(computed)} (rev is core's computeEntryRev content-hash contract)`,
+                ...(baseRevs[e.id] !== undefined ? { baseRev: baseRevs[e.id] } : {}),
+            });
+            continue;
+        }
+        // E-02 sync-layer guard: the server offers this id as a pull-add (no baseline for it), but we
+        // ALREADY hold an id of that name locally — a create the server had not seen when it answered.
+        // A blind add would clobber our RTT-window creation; report and hold instead (the backend
+        // add_guard_absent_conflict is the belt-and-braces second line, but this one names the cause).
+        if (baseRevs[e.id] === undefined && localIds.has(e.id)) {
+            rejected.add(e.id);
+            conflicts.push({
+                side: "local",
+                id: e.id,
+                reason: `untracked_local_exists: server offers ${JSON.stringify(e.id)} as a first-round add, but an entry with that id already exists locally (concurrent create the server had not observed) — not overwritten`,
+            });
+        }
+    }
+    for (const f of screenInboundEntries(resp.serverEntries.filter((e) => !rejected.has(e.id)))) {
+        rejected.add(f.id);
+        conflicts.push({
+            side: "local",
+            id: f.id,
+            reason: `inbound_gate: ${f.findings.map((x) => `${x.code}: ${x.reason}`).join("; ")}`,
+            ...(baseRevs[f.id] !== undefined ? { baseRev: baseRevs[f.id] } : {}),
+        });
+    }
+    // E-01: every serverDelete must be CAS'd against OUR input baseline, not the server's word. If the
+    // id is absent from baseRevs (never synced here ⇒ possibly a brand-new LOCAL create the server has
+    // no business deleting), or its baseRev disagrees with our cursor, refuse the delete, hold the
+    // cursor, and never emit the patch. Also refuse an id the server put in BOTH legs of one response.
+    const deletePatches = [];
+    for (const d of resp.serverDeletes) {
+        if (serverEntryIds.has(d.id)) {
+            rejected.add(d.id);
+            conflicts.push({
+                side: "local",
+                id: d.id,
+                reason: `server_delete_and_entry: ${JSON.stringify(d.id)} appears in both serverEntries and serverDeletes of one response — the server cannot both push and delete it in one round`,
+                baseRev: d.baseRev,
+            });
+            continue;
+        }
+        const base = baseRevs[d.id];
+        if (base === undefined) {
+            rejected.add(d.id);
+            conflicts.push({
+                side: "local",
+                id: d.id,
+                reason: `server_delete_not_in_baseline: server asked to delete ${JSON.stringify(d.id)} but it is absent from our input baseline (never synced here — a delete may not cross onto an id the server has never seen from us)`,
+                baseRev: d.baseRev,
+            });
+            continue;
+        }
+        if (base !== d.baseRev) {
+            rejected.add(d.id);
+            conflicts.push({
+                side: "local",
+                id: d.id,
+                reason: `server_delete_baserev_mismatch: server delete claims baseRev ${JSON.stringify(d.baseRev)} but our baseline holds ${JSON.stringify(base)} — refused (concurrent local change since the baseline)`,
+                baseRev: base,
+                currentRev: d.baseRev,
+            });
+            continue;
+        }
+        deletePatches.push({ op: "delete", id: d.id, baseRev: base });
+    }
+    const patches = [
+        ...resp.serverEntries
+            .filter((e) => !rejected.has(e.id))
+            .map((e) => {
+            const base = baseRevs[e.id];
+            // The MemorySyncPlan CAS discipline verbatim: baseline present ⇒ conditional update; absent
+            // from the baseline ⇒ add-if-absent (E-02: `guard: "absent"` — a concurrent local create
+            // racing in during the RTT is a REPORTED conflict at the backend, never a blind overwrite;
+            // the plain-add idempotent-overwrite semantics are reserved for non-guarded callers).
+            return base !== undefined
+                ? { op: "update", id: e.id, entry: e, baseRev: base }
+                : { op: "add", id: e.id, entry: e, guard: "absent" };
+        }),
+        ...deletePatches,
+    ];
+    const report = patches.length > 0 ? await backend.applyPatches(patches) : { applied: [], conflicts: [] };
+    for (const c of report.conflicts) {
+        conflicts.push({
+            side: "local",
+            id: c.id,
+            reason: c.reason,
+            ...(c.baseRev !== undefined ? { baseRev: c.baseRev } : {}),
+            ...(c.currentRev !== undefined ? { currentRev: c.currentRev } : {}),
+        });
+    }
+    // ⑤ Cursor retention discipline: advance ONLY when the ENTIRE pull half landed (server side
+    // already retained pull-half ids at the old baseline inside resp.cursor; the client-side gate
+    // adds "we actually applied it"). A held-back cursor converges with zero rollback: applied ids
+    // go identical-revs no-op next round; unapplied ones get a clean re-push/re-delete.
+    const cursorAdvanced = rejected.size === 0 && report.conflicts.length === 0;
+    const nextCursor = cursorAdvanced
+        ? { scope, peer, baseRevs: { ...resp.cursor.baseRevs }, updatedAtMs: now() }
+        : cursor;
+    return {
+        ok: cursorAdvanced && conflicts.length === 0,
+        pushed: { entries: request.entries.map((e) => e.id), deletes: [...request.deletes] },
+        serverApplied: resp.applied,
+        localApplied: report.applied,
+        conflicts,
+        cursorAdvanced,
+        cursor: nextCursor,
+    };
+}
+//# sourceMappingURL=sync-client.js.map

package/dist/core/memory-engine/sync-client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync-client.js","sourceRoot":"","sources":["../../../src/core/memory-engine/sync-client.ts"],"names":[],"mappings":"AAAA,8FAA8F;AAC9F,kGAAkG;AAClG,+FAA+F;AAC/F,oDAAoD;AACpD,EAAE;AACF,8FAA8F;AAC9F,6EAA6E;AAC7E,sFAAsF;AACtF,2FAA2F;AAC3F,2DAA2D;AAC3D,EAAE;AACF,oFAAoF;AACpF,4FAA4F;AAC5F,gGAAgG;AAChG,yDAAyD;AACzD,2FAA2F;AAC3F,mGAAmG;AACnG,+FAA+F;AAC/F,gGAAgG;AAChG,oEAAoE;AACpE,gGAAgG;AAChG,6FAA6F;AAC7F,gGAAgG;AAChG,iGAAiG;AACjG,uFAAuF;AACvF,mGAAmG;AACnG,+CAA+C;AAC/C,mGAAmG;AACnG,gGAAgG;AAChG,mGAAmG;AACnG,+FAA+F;AAC/F,EAAE;AACF,kGAAkG;AAClG,8DAA8D;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,sBAAsB,EAAyB,MAAM,WAAW,CAAC;AAqF1E;0EAC0E;AAC1E,SAAS,cAAc,CAAC,KAAa;IACnC,OAAO,mBAAmB,kBAAkB,CAAC,KAAK,CAAC,EAAE,CAAC;AACxD,CAAC;AAED;;;iFAGiF;AACjF,SAAS,YAAY,CAAC,EAAU,EAAE,GAAW,EAAE,KAAa;IAC1D,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,sBAAsB,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACzF,CAAC;AAED,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAgC,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACxH,MAAM,gBAAgB,GAAG,CAAC,CAAU,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AAE5F;;uGAEuG;AACvG,SAAS,uBAAuB,CAAC,GAAY,EAAE,KAAa,EAAE,IAAY;IACxE,MAAM,IAAI,GAAG,CAAC,GAAW,EAAS,EAAE;QAClC,MAAM,IAAI,KAAK,CAAC,iEAAiE,GAAG,GAAG,CAAC,CAAC;IAC3F,CAAC,CAAC;IACF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,IAAI,CAAC,yFAAyF,CAAC,CAAC;IACpH,MAAM,CAAC,GAAG,GAA8B,CAAC;IACzC,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAAE,IAAI,CAAC,0BAA0B,CAAC,CAAC;IACnE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAc,EAAE,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACtH,IAAI,CAAC,yDAAyD,CAAC,CAAC;QAClE,CAAC;QACD,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAoB,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAW,EAAE,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC/I,CAAC;IACD,MAAM,SAAS,GAAwC,EAAE,CAAC;IAC1D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;QAAE,IAAI,CAAC,4BAA4B,CAAC,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,CAAc,EAAE,CAAC;QAC5C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,QAAQ;YAAE,IAAI,CAAC,sCAAsC,CAAC,CAAC;QAChI,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,SAAS,CAAC,IAAI,CAAC;YACb,EAAE,EAAE,GAAG,CAAC,IAAI,CAAW;YACvB,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAW;YAC/B,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxE,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAClF,CAAC,CAAC;IACL,CAAC;IACD,MAAM,aAAa,GAAkB,EAAE,CAAC;IACxC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;QAAE,IAAI,CAAC,gCAAgC,CAAC,CAAC;IAC/E,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,eAAe,CAAc,EAAE,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,iFAAiF,CAAC,CAAC;QAC7G,MAAM,CAAC,GAAG,IAA+B,CAAC;QAC1C,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC/H,IAAI,CAAC,sEAAsE,CAAC,CAAC;QAC/E,CAAC;QACD,+FAA+F;QAC/F,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,KAAK;YAAE,IAAI,CAAC,gBAAgB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,cAAc,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,gCAAgC,CAAC,CAAC;QAChJ,MAAM,KAAK,GAAG,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,qCAAqC,CAAC,CAAC;QAClE,MAAM,EAAE,GAAG,KAAgC,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,MAAM,CAAU,EAAE,CAAC;YACzD,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;gBAAE,IAAI,CAAC,qBAAqB,CAAC,gCAAgC,CAAC,CAAC;QACrH,CAAC;QACD,IAAI,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS,IAAI,OAAO,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS;YAAE,IAAI,CAAC,0DAA0D,CAAC,CAAC;QACxI,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,IAAK,EAAE,CAAC,OAAO,CAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,EAAE,CAAC;YACjI,IAAI,CAAC,kEAAkE,CAAC,CAAC;QAC3E,CAAC;QACD,aAAa,CAAC,IAAI,CAAC;YACjB,EAAE,EAAE,CAAC,CAAC,IAAI,CAAW;YACrB,IAAI,EAAE,CAAC,CAAC,MAAM,CAAW;YACzB,IAAI,EAAE,CAAC,CAAC,MAAM,CAAW;YACzB,GAAG,EAAE,CAAC,CAAC,KAAK,CAAW;YACvB,KAAK;YACL,WAAW,EAAE;gBACX,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,CAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnE,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,EAAE,CAAC,aAAa,CAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxF,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,MAAM,CAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnE,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,SAAS,CAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7E,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAI,EAAE,CAAC,OAAO,CAAc,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChF;SACF,CAAC,CAAC;IACL,CAAC;IACD,MAAM,aAAa,GAA4C,EAAE,CAAC;IAClE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;QAAE,IAAI,CAAC,gCAAgC,CAAC,CAAC;IAC/E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,eAAe,CAAc,EAAE,CAAC;QAChD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAAE,IAAI,CAAC,4CAA4C,CAAC,CAAC;QACtI,MAAM,GAAG,GAAG,CAA4B,CAAC;QACzC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAW,EAAE,OAAO,EAAE,GAAG,CAAC,SAAS,CAAW,EAAE,CAAC,CAAC;IACrF,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,IAAI,CAAC,0DAA0D,CAAC,CAAC;IACrF,MAAM,MAAM,GAAG,GAA8B,CAAC;IAC9C,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI;QAAE,IAAI,CAAC,eAAe,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,sCAAsC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7I,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAAE,IAAI,CAAC,oDAAoD,CAAC,CAAC;IAC9F,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAA4B,CAAC,EAAE,CAAC;QACtF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,mBAAmB,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,kCAAkC,CAAC,CAAC;QAC1G,QAAQ,CAAC,EAAE,CAAC,GAAG,GAAa,CAAC;IAC/B,CAAC;IACD,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC;IAC1C,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC;QAAE,IAAI,CAAC,4CAA4C,CAAC,CAAC;IACzH,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAqB,EAAE,EAAE,CAAC;AAC9H,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAA4B;IAChE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACnD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;IAC/F,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,MAAM,EAAE,IAAI,IAAI,SAAS,CAAC;IACpD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;IACjC,+FAA+F;IAC/F,kFAAkF;IAClF,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;QACnD,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACpH,CAAC;IACD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjH,CAAC;IACD,MAAM,QAAQ,GAA2B,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAC;IAEzE,+FAA+F;IAC/F,MAAM,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;IACtF,MAAM,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;IACpG,+FAA+F;IAC/F,oGAAoG;IACpG,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC;IAEpE,wFAAwF;IACxF,8FAA8F;IAC9F,iGAAiG;IACjG,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IACxF,MAAM,IAAI,GAAG,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC5D,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChH,MAAM,IAAI,KAAK,CAAC,iHAAiH,CAAC,CAAC;IACrI,CAAC;IACD,MAAM,OAAO,GAA0B;QACrC,IAAI;QACJ,QAAQ;QACR,OAAO,EAAE,IAAI,CAAC,IAAI;QAClB,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC5C,CAAC;IAEF,kGAAkG;IAClG,MAAM,IAAI,GAAG,uBAAuB,CAAC,MAAM,SAAS,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAEnG,0FAA0F;IAC1F,yFAAyF;IACzF,6FAA6F;IAC7F,oFAAoF;IACpF,MAAM,SAAS,GAA+B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACpG,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,+FAA+F;IAC/F,kGAAkG;IAClG,mGAAmG;IACnG,iGAAiG;IACjG,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,mGAAmG;IACnG,+FAA+F;IAC/F,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,QAAQ,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;YACvB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,gCAAgC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,8BAA8B,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,wDAAwD;gBAC3K,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aACrE,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,8FAA8F;QAC9F,+FAA+F;QAC/F,0FAA0F;QAC1F,+FAA+F;QAC/F,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACvD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,yCAAyC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,2IAA2I;aACjN,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,oBAAoB,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5F,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnB,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,OAAO;YACb,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,iBAAiB,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACrF,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrE,CAAC,CAAC;IACL,CAAC;IACD,mGAAmG;IACnG,mGAAmG;IACnG,+FAA+F;IAC/F,mGAAmG;IACnG,MAAM,aAAa,GAAgB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACnC,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,4BAA4B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,2HAA2H;gBACnL,OAAO,EAAE,CAAC,CAAC,OAAO;aACnB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,yDAAyD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,qIAAqI;gBAC1N,OAAO,EAAE,CAAC,CAAC,OAAO;aACnB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACvB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,SAAS,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,OAAO;gBACb,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,MAAM,EAAE,gEAAgE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,2BAA2B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,yDAAyD;gBACzM,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,CAAC,CAAC,OAAO;aACtB,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,OAAO,GAAgB;QAC3B,GAAG,IAAI,CAAC,aAAa;aAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aAClC,GAAG,CAAC,CAAC,CAAC,EAAa,EAAE;YACpB,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC5B,4FAA4F;YAC5F,yFAAyF;YACzF,2FAA2F;YAC3F,sFAAsF;YACtF,OAAO,IAAI,KAAK,SAAS;gBACvB,CAAC,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;gBACrD,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;QACzD,CAAC,CAAC;QACJ,GAAG,aAAa;KACjB,CAAC;IACF,MAAM,MAAM,GAAgB,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IACtH,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACjC,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,OAAO;YACb,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,GAAG,CAAC,CAAC,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,GAAG,CAAC,CAAC,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACpE,CAAC,CAAC;IACL,CAAC;IAED,4FAA4F;IAC5F,8FAA8F;IAC9F,+FAA+F;IAC/F,oFAAoF;IACpF,MAAM,cAAc,GAAG,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAiC,cAAc;QAC7D,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,EAAE;QAC5E,CAAC,CAAC,MAAM,CAAC;IACX,OAAO;QACL,EAAE,EAAE,cAAc,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAC5C,MAAM,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,EAAE;QACpF,aAAa,EAAE,IAAI,CAAC,OAAO;QAC3B,YAAY,EAAE,MAAM,CAAC,OAAO;QAC5B,SAAS;QACT,cAAc;QACd,MAAM,EAAE,UAAU;KACnB,CAAC;AACJ,CAAC"}

package/dist/core/memory-engine/sync.d.ts

@@ -0,0 +1,97 @@
+import type { MemoryEntry, ScoredMemoryEntry } from "./types.js";
+/**
+ * design/142 §3 — the per-replica per-scope sync cursor: the COMMON BASELINE a reconciliation run
+ * judges divergence against (`id → rev` as of the last completed sync round). This is a NEW
+ * persistence face — deliberately NOT revs.json (that is the local disk-vs-committed ledger): File
+ * plane = a control-plane sidecar, DB plane = a service-owned table (PG+TiDB, [628] dual-dialect).
+ * Serializable by construction.
+ */
+export interface MemorySyncCursor {
+    scope: string;
+    /** The PEER this cursor tracks (e.g. "central", a repo remote name) — one cursor per peer. */
+    peer: string;
+    /** id → rev at the last completed sync round with this peer. */
+    baseRevs: Record<string, string>;
+    /** Caller-injected clock (never Date.now inside the engine — clock-injection precedent). */
+    updatedAtMs: number;
+}
+export interface MemorySyncConflict {
+    id: string;
+    /** Present when the side still has the entry (absent = deleted on that side). */
+    local?: MemoryEntry;
+    remote?: MemoryEntry;
+    baseRev?: string;
+}
+export interface MemorySyncPlan {
+    /** Entries the LOCAL side should send to the peer (new here or changed-here-only). 独立轨 F8 —
+     *  CAS discipline for the peer write: a push item exists ONLY when the peer is still at the
+     *  baseline, so the peer-side conditional write uses `baseRevs[id]` as its baseRev (absent from
+     *  the baseline ⇒ the peer has no such entry ⇒ plain add). Never write the peer unconditionally. */
+    push: MemoryEntry[];
+    /** Entries the LOCAL side should adopt from the peer (new there or changed-there-only). Same CAS
+     *  discipline as {@link push}, mirrored: local conditional write with `baseRevs[id]`. */
+    pull: MemoryEntry[];
+    /** codex 复审 B4 — DELETE propagation (without these the removal never crosses and every round
+     *  re-plans the same state = livelock): the peer removed an entry the local side left UNCHANGED
+     *  since baseline ⇒ delete locally (CAS on baseRev — a local edit racing in makes the delete a
+     *  conflict on the next round instead of silent loss). */
+    deleteLocal: Array<{
+        id: string;
+        baseRev: string;
+    }>;
+    /** Symmetric: locally removed, peer unchanged since baseline ⇒ delete on the peer. */
+    deleteRemote: Array<{
+        id: string;
+        baseRev: string;
+    }>;
+    /** Both sides diverged from the baseline (or delete-vs-edit races): the caller resolves via the
+     *  §3 ladder — winner by the caller's policy, LOSER MINTED AS A SIBLING entry (never dropped),
+     *  the pair recorded so a three-way exchange cannot rebuild the same conflict forever. */
+    conflicts: MemorySyncConflict[];
+    /** Ids deleted on BOTH sides since the baseline (pure cursor cleanup, no data movement). */
+    cleared: string[];
+}
+/**
+ * Pure three-way set reconciliation over one scope. `baseRevs` = the persisted common baseline
+ * (empty object = first sync round: everything present is "new" on its side; identical revs on
+ * both sides collapse to no-op).
+ *
+ * Judgment per id (rev lineage, mtime never consulted):
+ *  - both sides at baseline rev → no-op;  identical revs (any lineage) → no-op + baseline advance;
+ *  - changed on exactly ONE side → push/pull;
+ *  - changed on BOTH sides, or delete-on-one × edit-on-the-other → conflict (caller's ladder);
+ *  - deleted on one side × UNCHANGED on the other → the delete propagates (deleteLocal/deleteRemote,
+ *    CAS on baseRev — codex B4: without this leg removals never cross and the plan livelocks);
+ *  - present only on one side with NO baseline → new entry → propagate;
+ *  - absent on both but present in baseline → cleared (cursor cleanup).
+ */
+export declare function reconcileMemoryEntries(baseRevs: Readonly<Record<string, string>>, local: readonly MemoryEntry[], remote: readonly MemoryEntry[]): MemorySyncPlan;
+/** The baseline to persist AFTER a sync round completes: every id both sides now agree on. The
+ *  caller passes the POST-round entry sets (after applying push/pull and resolving conflicts). */
+export declare function nextSyncBaseline(local: readonly MemoryEntry[], remote: readonly MemoryEntry[]): Record<string, string>;
+/**
+ * A third-party semantic recall side-channel (Mem0/Zep/Cognee/… adapters — research 2026-07-12:
+ * all five surveyed engines fit THIS seat; none fits the authority seat). STRICTLY READ-ONLY by
+ * construction: a RecallSource feeds candidate hits into injection-time recall; it never sees the
+ * write path, never participates in harvest, and the system runs identically without it.
+ *
+ * Score contract: DISTANCE in [0, 2] (0 = identical, 2 = orthogonal — the vector-rung convention);
+ * adapters normalize their similarity/relevance scores into this scale. Returned entries may be
+ * the third party's RE-STATEMENTS (extractive engines rewrite) — that is acceptable HERE precisely
+ * because the seat is advisory: the authoritative body is re-read from the real backend by id/slug
+ * when a hit is followed. Mount point: a deployment composes its RecallSource(s) inside its recall
+ * select hook (the design/65 selective-recall trust seat) or pre-queries before prepare; core adds
+ * no RunnerDeps seat until a real integration signals the need (YAGNI, [622]③ two-lane ruling).
+ */
+export interface RecallSource {
+    /** Stable adapter name (diagnostics/attribution: hits are labeled, never silently mixed). */
+    name: string;
+    search(query: string, scopes: readonly string[], opts?: {
+        limit?: number;
+    }): Promise<ScoredMemoryEntry[]>;
+}
+/** Merge recall hits from multiple sources with the authority backend's own results: id-deduped
+ *  (FIRST occurrence wins — callers order sources by trust, authority first), ascending by score
+ *  (distance), capped at `limit`. Pure — no I/O, no source calls. */
+export declare function mergeRecallHits(hitLists: ReadonlyArray<readonly ScoredMemoryEntry[]>, limit: number): ScoredMemoryEntry[];
+//# sourceMappingURL=sync.d.ts.map

package/dist/core/memory-engine/sync.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync.d.ts","sourceRoot":"","sources":["../../../src/core/memory-engine/sync.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAEjE;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,8FAA8F;IAC9F,IAAI,EAAE,MAAM,CAAC;IACb,gEAAgE;IAChE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,4FAA4F;IAC5F,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,iFAAiF;IACjF,KAAK,CAAC,EAAE,WAAW,CAAC;IACpB,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,cAAc;IAC7B;;;wGAGoG;IACpG,IAAI,EAAE,WAAW,EAAE,CAAC;IACpB;6FACyF;IACzF,IAAI,EAAE,WAAW,EAAE,CAAC;IACpB;;;8DAG0D;IAC1D,WAAW,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpD,sFAAsF;IACtF,YAAY,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACrD;;8FAE0F;IAC1F,SAAS,EAAE,kBAAkB,EAAE,CAAC;IAChC,4FAA4F;IAC5F,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAC1C,KAAK,EAAE,SAAS,WAAW,EAAE,EAC7B,MAAM,EAAE,SAAS,WAAW,EAAE,GAC7B,cAAc,CAqChB;AAED;kGACkG;AAClG,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,WAAW,EAAE,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAOtH;AAMD;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,YAAY;IAC3B,6FAA6F;IAC7F,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC;CAC3G;AAED;;qEAEqE;AACrE,wBAAgB,eAAe,CAAC,QAAQ,EAAE,aAAa,CAAC,SAAS,iBAAiB,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,iBAAiB,EAAE,CAYzH"}

package/dist/core/memory-engine/sync.js

@@ -0,0 +1,91 @@
+/**
+ * Pure three-way set reconciliation over one scope. `baseRevs` = the persisted common baseline
+ * (empty object = first sync round: everything present is "new" on its side; identical revs on
+ * both sides collapse to no-op).
+ *
+ * Judgment per id (rev lineage, mtime never consulted):
+ *  - both sides at baseline rev → no-op;  identical revs (any lineage) → no-op + baseline advance;
+ *  - changed on exactly ONE side → push/pull;
+ *  - changed on BOTH sides, or delete-on-one × edit-on-the-other → conflict (caller's ladder);
+ *  - deleted on one side × UNCHANGED on the other → the delete propagates (deleteLocal/deleteRemote,
+ *    CAS on baseRev — codex B4: without this leg removals never cross and the plan livelocks);
+ *  - present only on one side with NO baseline → new entry → propagate;
+ *  - absent on both but present in baseline → cleared (cursor cleanup).
+ */
+export function reconcileMemoryEntries(baseRevs, local, remote) {
+    const plan = { push: [], pull: [], deleteLocal: [], deleteRemote: [], conflicts: [], cleared: [] };
+    const localById = new Map(local.map((e) => [e.id, e]));
+    const remoteById = new Map(remote.map((e) => [e.id, e]));
+    const ids = new Set([...localById.keys(), ...remoteById.keys(), ...Object.keys(baseRevs)]);
+    for (const id of ids) {
+        const l = localById.get(id);
+        const r = remoteById.get(id);
+        const base = baseRevs[id];
+        if (l !== undefined && r !== undefined) {
+            if (l.rev === r.rev)
+                continue; // converged (baseline advances to this rev)
+            const localChanged = base === undefined || l.rev !== base;
+            const remoteChanged = base === undefined || r.rev !== base;
+            if (localChanged && remoteChanged)
+                plan.conflicts.push({ id, local: l, remote: r, ...(base !== undefined ? { baseRev: base } : {}) });
+            else if (localChanged)
+                plan.push.push(l);
+            else
+                plan.pull.push(r);
+            continue;
+        }
+        if (l !== undefined) {
+            // remote absent: new here (no baseline) → push; peer deleted + we edited → conflict
+            // (delete×edit race, caller's sibling ladder); peer deleted + we did NOT change → the delete
+            // PROPAGATES here (codex B4 — without this leg a removal never crosses and the plan replays
+            // the same state every round).
+            if (base === undefined)
+                plan.push.push(l);
+            else if (l.rev !== base)
+                plan.conflicts.push({ id, local: l, baseRev: base });
+            else
+                plan.deleteLocal.push({ id, baseRev: base });
+            continue;
+        }
+        if (r !== undefined) {
+            if (base === undefined)
+                plan.pull.push(r);
+            else if (r.rev !== base)
+                plan.conflicts.push({ id, remote: r, baseRev: base });
+            else
+                plan.deleteRemote.push({ id, baseRev: base });
+            continue;
+        }
+        plan.cleared.push(id); // in baseline, gone on both sides
+    }
+    return plan;
+}
+/** The baseline to persist AFTER a sync round completes: every id both sides now agree on. The
+ *  caller passes the POST-round entry sets (after applying push/pull and resolving conflicts). */
+export function nextSyncBaseline(local, remote) {
+    const remoteById = new Map(remote.map((e) => [e.id, e.rev]));
+    const base = {};
+    for (const e of local) {
+        if (remoteById.get(e.id) === e.rev)
+            base[e.id] = e.rev;
+    }
+    return base;
+}
+/** Merge recall hits from multiple sources with the authority backend's own results: id-deduped
+ *  (FIRST occurrence wins — callers order sources by trust, authority first), ascending by score
+ *  (distance), capped at `limit`. Pure — no I/O, no source calls. */
+export function mergeRecallHits(hitLists, limit) {
+    const seen = new Set();
+    const merged = [];
+    for (const list of hitLists) {
+        for (const h of list) {
+            if (seen.has(h.id))
+                continue;
+            seen.add(h.id);
+            merged.push(h);
+        }
+    }
+    merged.sort((a, b) => a.score - b.score || a.id.localeCompare(b.id));
+    return merged.slice(0, Math.max(0, limit));
+}
+//# sourceMappingURL=sync.js.map

package/dist/core/memory-engine/sync.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync.js","sourceRoot":"","sources":["../../../src/core/memory-engine/sync.ts"],"names":[],"mappings":"AA6DA;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,sBAAsB,CACpC,QAA0C,EAC1C,KAA6B,EAC7B,MAA8B;IAE9B,MAAM,IAAI,GAAmB,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IACnH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACnG,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;gBAAE,SAAS,CAAC,4CAA4C;YAC3E,MAAM,YAAY,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC;YAC1D,MAAM,aAAa,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC;YAC3D,IAAI,YAAY,IAAI,aAAa;gBAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;iBACjI,IAAI,YAAY;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,oFAAoF;YACpF,6FAA6F;YAC7F,4FAA4F;YAC5F,+BAA+B;YAC/B,IAAI,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBACrC,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI;gBAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;;gBACzE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YAClD,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBACrC,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI;gBAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;;gBAC1E,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YACnD,SAAS;QACX,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,kCAAkC;IAC3D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;kGACkG;AAClG,MAAM,UAAU,gBAAgB,CAAC,KAA6B,EAAE,MAA8B;IAC5F,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG;YAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;IACzD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AA0BD;;qEAEqE;AACrE,MAAM,UAAU,eAAe,CAAC,QAAqD,EAAE,KAAa;IAClG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAC7C,CAAC"}