@graphrefly/ts 0.0.1 → 0.0.3

package/dist/adapters/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/adapters/index.ts","../../src/batch/boundary.ts","../../src/batch/batch.ts","../../src/protocol/messages.ts","../../src/ctx/types.ts","../../src/dispatcher/index.ts","../../src/node/core.ts","../../src/graph/environment.ts","../../src/json/codec.ts","../../src/node/versioning.ts","../../src/node/node.ts","../../src/graph/checkpoint.ts","../../src/graph/operators.ts","../../src/graph/graph.ts","../../src/patterns/semantic-memory.ts","../../src/solutions/agentic-memory.ts","../../src/adapters/agentic-memory-storage.ts","../../src/graph/resilience.ts","../../src/adapters/bridge.ts","../../src/adapters/environment.ts","../../src/adapters/nestjs.ts","../../src/graph/data-structures/core.ts","../../src/graph/data-structures/reactive-index.ts","../../src/graph/policies/collection.ts","../../src/graph/data-structures/reactive-list.ts","../../src/graph/data-structures/reactive-log.ts","../../src/graph/sources.ts","../../src/graph/data-structures/reactive-map.ts","../../src/data-structures/persistence.ts","../../src/storage/reactive-collection.ts","../../src/adapters/reactive-collection-storage.ts","../../src/adapters/store.ts"],"sourcesContent":["/**\n * Graph/framework/environment adapter namespace.\n *\n * Use focused adapter subpaths for graph-bound bridges such as\n * `@graphrefly/ts/adapters/observe-storage`.\n */\n\nexport * from \"./agentic-memory-storage.js\";\nexport * from \"./bridge.js\";\nexport * from \"./environment.js\";\nexport * from \"./nestjs.js\";\nexport * from \"./reactive-collection-storage.js\";\nexport * from \"./store.js\";\n","/**\n * The wave-owner boundary + deferred self-rewire drain (R-rewire-deferred / D47).\n *\n * `ctx.rewireNext` defers a node's OWN dep-set mutation to the COMMITTED wave boundary.\n * The substrate has no such boundary on the raw call stack, so this module establishes one:\n * a module-global re-entrant DEPTH counter — the TS analogue of the Rust `WaveScope` /\n * `with_wave_owner` (graphrefly-rs B25, flagged forward-load-bearing for exactly this). JS is\n * single-threaded and waves are synchronous, so one cascade is on the stack at a time (same\n * rationale as `batch.ts`'s module-global `active`).\n *\n * Every EXTERNAL wave origin brackets its synchronous cascade with {@link enterWave} /\n * {@link exitWave}: `Node.subscribe`/`Node.down`/`Node.up` (activation, state.set, control),\n * the async-pool `ctx.down`/`ctx.up` re-entry (which enters via the stashed ctx, NOT the public\n * method), and `batch()` (so the drain fires AFTER commit). Re-entrant (nested) calls just\n * inc/dec the counter; only the OUTERMOST exit (depth → 0) DRAINS the deferred-rewire queue.\n *\n * B49 migration: the deferred thunks now live on the graph-local NodeCore, not in this module.\n * This module keeps only the JS call-stack wave-owner depth plus a small FIFO of cores that\n * have work to drain. Per D22, a graph is the supported single-thread domain; cross-domain\n * coordination is the async wire bridge (D32), so the queued work for one legal synchronous cascade\n * belongs to one graph-local core. Standalone nodes keep their private core. Within a core, FIFO\n * issue order still gives the R-rewire-deferred drain order, and the scheduler records one core\n * token per queued task so mixed-core legal batches keep their enqueue order. Each queued mutation\n * runs as a fresh wave whose own `ctx.rewireNext` calls re-enqueue and drain in the same loop.\n *\n * C-25 / D110: queued boundary work is tagged with the batch frame that caused it (when any)\n * plus an owner-readiness predicate. The drain applies only committed, unpaused tasks; rollback\n * drops the batch's tasks, and paused owners re-schedule their core on final RESUME.\n * Zero behavior change when no `ctx.rewireNext`/`ctx.upNext` is ever called: the drain is one\n * empty-queue check per outermost wave (F-PERF).\n */\n\nimport type { NodeCore } from \"../node/core.js\";\n\nlet depth = 0;\nconst pendingCores: NodeCore[] = [];\nlet pendingHead = 0;\n\n/** Enter a wave cascade (re-entrant). Pair with {@link exitWave} in a try/finally. */\nexport function enterWave(): void {\n\tdepth++;\n}\n\n/** Exit a wave cascade; the OUTERMOST exit (depth → 0) drains the deferred-rewire queue. */\nexport function exitWave(): void {\n\tdepth--;\n\tif (depth === 0 && pendingHead < pendingCores.length) drain();\n}\n\nexport interface DeferredBoundaryOptions {\n\treadonly batchToken?: object;\n\treadonly isReady?: () => boolean;\n}\n\n/**\n * Queue a deferred self-rewire application, drained at the committed boundary\n * (R-rewire-deferred). The thunk applies one queued mutation to its owning node.\n */\nexport function deferRewire(\n\tcore: NodeCore,\n\tapply: () => void,\n\toptions: DeferredBoundaryOptions = {},\n): void {\n\tcore.enqueueBoundaryTask({ apply, batchToken: options.batchToken, isReady: options.isReady });\n\tpendingCores.push(core);\n}\n\n/** Re-schedule an existing core queue, used when a final RESUME opens a paused boundary gate. */\nexport function scheduleBoundaryDrain(core: NodeCore): void {\n\tfor (let i = 0; i < core.boundaryTaskCount(); i++) pendingCores.push(core);\n\tif (depth === 0 && pendingHead < pendingCores.length) drain();\n}\n\n/** D110: an uncommitted batch cannot leak queued boundary effects. */\nexport function dropBoundaryTasksForBatch(batchToken: object): void {\n\tconst seen = new Set<NodeCore>();\n\tfor (let i = pendingHead; i < pendingCores.length; i++) {\n\t\tconst core = pendingCores[i] as NodeCore;\n\t\tif (seen.has(core)) continue;\n\t\tseen.add(core);\n\t\tcore.dropBoundaryTasksForBatch(batchToken);\n\t}\n}\n\nfunction drain(): void {\n\t// Each applied rewire runs a fresh wave (its own depth-bracketed cascade) which may itself\n\t// enqueue more rewireNext requests — appended and drained by this same FIFO loop\n\t// (DrainExactlyOnce). The depth++ around apply() prevents the fresh wave's own outermost\n\t// exit from re-entering drain (this loop owns the draining). A net-changing op re-issued\n\t// every boundary (oscillation) is a user-level runaway, like an infinite producer — NOT a\n\t// substrate-detected error (D47).\n\t//\n\t// Per-thunk isolation: a thunk whose application throws (e.g. its _applyRewireNext error-route\n\t// reaches a throwing external sink) must NOT abandon the rest of the queue — otherwise the\n\t// stranded thunks would linger in this module-global queue and drain at an unrelated LATER\n\t// wave boundary (a stale, misattributed rewire). Drain every thunk; re-surface the FIRST\n\t// escape once the queue is empty so the error stays visible without corrupting the queue.\n\tlet escaped: { e: unknown } | null = null;\n\twhile (pendingHead < pendingCores.length) {\n\t\tconst core = pendingCores[pendingHead++] as NodeCore;\n\t\tconst task = core.shiftBoundaryTask();\n\t\tif (task === undefined) continue;\n\t\tif (task.batchToken !== undefined) {\n\t\t\t// A stale token means the batch never reached the committed boundary (D110). Rollback\n\t\t\t// normally removes these before drain; this guard covers commit failures before the\n\t\t\t// batch frame marks itself committed.\n\t\t\tconst committed = (task.batchToken as { committed?: boolean }).committed === true;\n\t\t\tif (!committed) continue;\n\t\t}\n\t\tif (task.isReady !== undefined && !task.isReady()) {\n\t\t\tcore.unshiftBoundaryTask(task);\n\t\t\tcontinue;\n\t\t}\n\t\tdepth++;\n\t\ttry {\n\t\t\ttask.apply();\n\t\t} catch (e) {\n\t\t\tif (escaped === null) escaped = { e };\n\t\t} finally {\n\t\t\tdepth--;\n\t\t}\n\t}\n\tpendingCores.length = 0;\n\tpendingHead = 0;\n\tif (escaped !== null) throw escaped.e;\n}\n","/**\n * Declarative batch (R-batch-coalesce / D12).\n *\n * Inside a batch, DIRTY propagates immediately but the tier-3 settle slice\n * (DATA/RESOLVED/INVALIDATE) is deferred to commit, so a shared downstream\n * recomputes ONCE after all batched sources settle. Success -> commit; a thrown\n * error -> rollback; `bctx.rollback()` is the explicit escape hatch.\n *\n * Coalescing note: this kernel coalesces multiple emits to the SAME node within\n * one batch to the latest tier-3 wave (last-value-wins). Full per-item batch-array\n * delivery (downstream fn receiving [v1..vK]) is a documented refinement — the\n * dominant use (coalescing a diamond join to one recompute) is exact here.\n */\n\nimport type { Wave } from \"../protocol/messages.js\";\nimport { dropBoundaryTasksForBatch, enterWave, exitWave } from \"./boundary.js\";\n\n/** A node target the batch can commit/rollback against (structural, avoids an import cycle). */\nexport interface BatchTarget {\n\t__commitBatchedWave(wave: Wave): void;\n\t__rollbackBatched(): void;\n\t__deferBoundary(fn: () => void, batchToken?: object): void;\n}\n\nexport interface BatchCtx {\n\t/** Discard all deferred emissions in this batch instead of committing. */\n\trollback(): void;\n}\n\ninterface ActiveBatch {\n\torder: BatchTarget[];\n\tdeferred: Map<BatchTarget, Wave>;\n\tcommitted: boolean;\n\trolledBack: boolean;\n}\n\nlet active: ActiveBatch | null = null;\nlet boundaryOwner: ActiveBatch | null = null;\n\nexport function currentBatch(): boolean {\n\treturn active !== null;\n}\n\nexport function currentBoundaryBatchToken(): object | undefined {\n\treturn active ?? boundaryOwner ?? undefined;\n}\n\n/**\n * Defer a node's tier-3 settle slice into the active batch. Returns true if a batch\n * captured it; false if there is no active batch (caller emits normally).\n */\nexport function deferToBatch(target: BatchTarget, tier3Wave: Wave): boolean {\n\tif (active === null) return false;\n\tif (!active.deferred.has(target)) active.order.push(target);\n\tactive.deferred.set(target, tier3Wave); // last-value coalescing\n\treturn true;\n}\n\n/**\n * Defer a topology mutation until after the active batch has committed/rolled back,\n * but only when this target has an uncommitted settle slice in the current batch.\n */\nexport function deferAfterBatchForTarget(target: BatchTarget, fn: () => void): boolean {\n\tif (active === null || !active.deferred.has(target)) return false;\n\tconst owner = active;\n\ttarget.__deferBoundary(() => {\n\t\tif (owner.committed) fn();\n\t}, owner);\n\treturn true;\n}\n\nfunction commit(b: ActiveBatch): void {\n\tconst prev = boundaryOwner;\n\tboundaryOwner = b;\n\ttry {\n\t\tfor (const target of b.order) {\n\t\t\tconst wave = b.deferred.get(target);\n\t\t\tif (wave) target.__commitBatchedWave(wave);\n\t\t}\n\t\tb.committed = true;\n\t} catch (e) {\n\t\tdropBoundaryTasksForBatch(b);\n\t\tthrow e;\n\t} finally {\n\t\tboundaryOwner = prev;\n\t}\n}\n\nfunction rollback(b: ActiveBatch): void {\n\tdropBoundaryTasksForBatch(b);\n\tfor (const target of b.order) target.__rollbackBatched();\n}\n\n/** Run `fn` as a batch (D12). DATA deferred to commit; throw/rollback discards. */\nexport function batch<R>(fn: (bctx: BatchCtx) => R): R {\n\t// Wave-owner boundary (R-rewire-deferred / D47): bracket the whole batch (fn + commit) so a\n\t// ctx.rewireNext issued by a fn that runs during COMMIT drains AFTER the commit, never on the\n\t// un-committed view. Inner waves (state.set, commit cascade) nest under this owner.\n\tenterWave();\n\ttry {\n\t\tif (active !== null) {\n\t\t\t// Nested batch joins the outer frame (one commit at the outermost exit).\n\t\t\tconst outer = active;\n\t\t\treturn fn({\n\t\t\t\trollback: () => {\n\t\t\t\t\touter.rolledBack = true;\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t\tconst b: ActiveBatch = { order: [], deferred: new Map(), committed: false, rolledBack: false };\n\t\tactive = b;\n\t\tconst bctx: BatchCtx = {\n\t\t\trollback: () => {\n\t\t\t\tb.rolledBack = true;\n\t\t\t},\n\t\t};\n\t\tlet result: R;\n\t\ttry {\n\t\t\tresult = fn(bctx);\n\t\t} catch (e) {\n\t\t\tactive = null;\n\t\t\trollback(b);\n\t\t\tthrow e;\n\t\t}\n\t\tactive = null;\n\t\tif (b.rolledBack) rollback(b);\n\t\telse {\n\t\t\tcommit(b);\n\t\t}\n\t\treturn result;\n\t} finally {\n\t\texitWave();\n\t}\n}\n","/**\n * Wave-protocol message types and the tier const table.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-msg-format, R-msg-closed-set, R-tier (D34), R-data-payload, R-sentinel.\n */\n\n/** Opaque pause-lock / pull identifier (R-pause-lockset, R-pull). */\nexport type LockId = string | symbol;\n\n/** Explicit pull demand payload (D269/D272). Params are holder-visible context, never DATA-up. */\nexport interface PullDemand {\n\treadonly pullId: LockId;\n\treadonly params?: unknown;\n}\n\n/**\n * The CLOSED set of 11 message types (R-msg-closed-set / D9 + D269 + START handshake).\n * No open set, no user-defined custom types. Adding a type is a spec change.\n */\nexport type Message =\n\t| readonly [\"START\"]\n\t| readonly [\"DIRTY\"]\n\t| readonly [\"DATA\", unknown]\n\t| readonly [\"RESOLVED\"]\n\t| readonly [\"INVALIDATE\"]\n\t| readonly [\"COMPLETE\"]\n\t| readonly [\"ERROR\", unknown]\n\t| readonly [\"TEARDOWN\"]\n\t| readonly [\"PAUSE\", LockId]\n\t| readonly [\"RESUME\", LockId]\n\t| readonly [\"PULL\", PullDemand];\n\n/** One array of messages delivered in one call = one Wave (R-wave-boundary). */\nexport type Wave = readonly Message[];\n\n/** The message-type tag (the first tuple element). */\nexport type MessageType = Message[0];\n\n/**\n * SENTINEL = absence-of-DATA (R-sentinel / D16). TS representation is `undefined`.\n * Never a valid DATA payload; `null` IS a valid DATA value (domain-level absence).\n */\nexport const SENTINEL = undefined;\n\n/** R-data-payload: ERROR payloads must not collide with terminal metadata shorthand. */\nexport function isInvalidErrorPayload(v: unknown): boolean {\n\treturn v === SENTINEL || typeof v === \"boolean\";\n}\n\n/** R-data-payload / D78: host-language failures that collide with ctx.terminal shorthand become diagnostics. */\nexport function errorPayload(reason: unknown, fallback = \"error without a valid payload\"): unknown {\n\treturn isInvalidErrorPayload(reason) ? new Error(fallback) : reason;\n}\n\nexport const TIER_START = 0;\nexport const TIER_CONTROL = 1;\nexport const TIER_NOTIFICATION = 2;\nexport const TIER_VALUE = 3;\nexport const TIER_SETTLE = 4;\nexport const TIER_TERMINAL = 5;\nexport const TIER_TEARDOWN = 6;\n\n/**\n * Tier const table (R-tier / D34). Tiers below value dispatch immediately; value\n * and above are batch-deferred. This is a compile-time const table (D18), not runtime config.\n */\nconst TIER: Record<MessageType, number> = {\n\tSTART: TIER_START,\n\tPAUSE: TIER_CONTROL,\n\tRESUME: TIER_CONTROL,\n\tPULL: TIER_CONTROL,\n\tDIRTY: TIER_NOTIFICATION,\n\tDATA: TIER_VALUE,\n\tRESOLVED: TIER_VALUE,\n\tINVALIDATE: TIER_SETTLE,\n\tCOMPLETE: TIER_TERMINAL,\n\tERROR: TIER_TERMINAL,\n\tTEARDOWN: TIER_TEARDOWN,\n};\n\nexport function messageTier(t: MessageType): number {\n\treturn TIER[t];\n}\n\n/** Value and above are deferred inside a batch (DATA/RESOLVED/INVALIDATE/terminal/teardown). */\nexport function isDeferredTier(t: MessageType): boolean {\n\treturn TIER[t] >= TIER_VALUE;\n}\n\n/** Value-tier messages (DATA/RESOLVED) occupy the tier-3 slot. */\nexport function isValueTier(t: MessageType): boolean {\n\treturn TIER[t] === TIER_VALUE;\n}\n\n/** The pause buffer holds the settle slice only: value-tier DATA/RESOLVED plus INVALIDATE. */\nexport function isPauseBufferedTier(t: MessageType): boolean {\n\tconst tier = TIER[t];\n\treturn tier === TIER_VALUE || tier === TIER_SETTLE;\n}\n\n/**\n * A TERMINAL message = tier 5 (COMPLETE | ERROR), R-tier / D34. Detected via the CENTRAL tier\n * table, NOT a per-variant `=== \"COMPLETE\" || === \"ERROR\"` check — so terminal routing stays\n * driven by the one const table (feedback_use_tier_for_signal_routing); discriminate COMPLETE vs\n * ERROR within the tier by the message type only where the handling actually differs.\n */\nexport function isTerminal(t: MessageType): boolean {\n\treturn TIER[t] === TIER_TERMINAL;\n}\n\n/**\n * ctx.up carries control/demand tiers only (R-ctx-up / D269): DIRTY, PAUSE, RESUME, PULL,\n * INVALIDATE, TEARDOWN. DATA/RESOLVED (tier 3) and COMPLETE/ERROR (tier 5) are\n * down-only.\n */\nexport function isUpAllowed(t: MessageType): boolean {\n\tconst tier = TIER[t];\n\treturn tier !== TIER_VALUE && tier !== TIER_TERMINAL;\n}\n","/**\n * The fn-invocation context and per-dep input shapes.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-fn-contract (D8/D27), R-ctx-state (D23/D29), R-cleanup-hooks (D28), R-ctx-up.\n */\n\nimport type { Dispatcher } from \"../dispatcher/index.js\";\nimport type { EnvironmentDrivers } from \"../graph/environment.js\";\nimport type { Node } from \"../node/node.js\";\nimport { type Message, type PullDemand, SENTINEL, type Wave } from \"../protocol/messages.js\";\n\n/** A downstream sink callback (the only way to connect to a node's output). */\nexport type Sink = (msg: Message, delivery?: DeliveryMeta) => void;\n\n/** Internal delivery metadata used to preserve the upstream `ctx.down(msgs)` wave boundary. */\nexport interface DeliveryMeta {\n\treadonly wave: object;\n\treadonly last: boolean;\n}\n\n/**\n * Internal current-value reader. It is deliberately a symbol-backed implementation detail:\n * raw ctx exposes `waveData` + `terminal`; helpers below derive from that plus this dep cache.\n */\nexport const CTX_DEP_CACHE: unique symbol = Symbol(\"graphrefly.ctx.depCache\");\n\nexport interface CtxDepCache {\n\treadonly latest: readonly unknown[];\n}\n\n/** Internal node-construction binding for graph-local helper-created deps. */\nexport const CTX_NODE_BINDING: unique symbol = Symbol(\"graphrefly.ctx.nodeBinding\");\n\nexport interface CtxNodeBinding {\n\treadonly dispatcher: Dispatcher;\n\tcreate<T>(factory: () => Node<T>): Node<T>;\n}\n\n/** Per-dep wave projections: dep -> waves -> values/SENTINEL markers. */\nexport type WaveData = readonly (readonly (readonly unknown[])[])[];\n\n/** Terminal metadata parallel to `waveData`: false = none, true = COMPLETE, otherwise ERROR payload. */\nexport type TerminalData = readonly unknown[];\n\nexport function isTerminalNone(t: unknown): boolean {\n\treturn t === false || t === undefined;\n}\n\nexport function isTerminalComplete(t: unknown): t is true {\n\treturn t === true;\n}\n\nexport function isTerminalError(t: unknown): boolean {\n\treturn !isTerminalNone(t) && !isTerminalComplete(t);\n}\n\nexport function terminalErrorValue(t: unknown): unknown {\n\treturn isTerminalError(t) ? t : undefined;\n}\n\n/**\n * Per-node private cross-wave state (R-ctx-state / D23,D29). Default fresh-lifecycle\n * wipe; `persist(true)` keeps it across lifecycle transitions.\n */\nexport interface CtxState {\n\tget<S = unknown>(): S | undefined;\n\tset<S = unknown>(v: S): void;\n\tpersist(on?: boolean): void;\n}\n\n/**\n * Deferred SELF-rewire (R-rewire-deferred / D47). A node fn may, DURING its run, request a\n * mutation of its OWN dep set; the request is QUEUED and applied at the committed wave boundary\n * (after the current wave settles / batch commit / final-lock RESUME) as a fresh wave, reusing\n * R-rewire surgical/Option-C semantics (D42). This is the ONLY legal self-triggered rewire — an\n * IMMEDIATE in-fn `node.subscribeDep/unsubscribeDep/replaceDeps` is the D37 mid-fn feedback-cycle ERROR. An\n * added cached dep pushes `[DIRTY,DATA]` on the boundary wave (R-push-subscribe); a removed dep\n * is drained and, if it loses its last subscriber, `_deactivate`s + fires `onDeactivation`\n * (input-side teardown — the basis for higher-order operator cancellation / abortInFlight).\n */\nexport interface RewireNext {\n\t/** Defer subscribing to a dep (paired with the re-supplied fn — positional fn-deps lock, SD-1). */\n\tsubscribeDep(dep: Node<unknown>, fn: NodeFn): void;\n\t/** Defer unsubscribing from a dep (its source is torn down if it loses its last subscriber). */\n\tunsubscribeDep(dep: Node<unknown>, fn: NodeFn): void;\n\t/** Defer replacing the whole dep set (surgical: kept deps untouched, removed drained, added fresh-subscribe). */\n\treplaceDeps(deps: Node<unknown>[], fn: NodeFn): void;\n}\n\n/**\n * The single argument to a node fn: `(ctx) => void` (R-fn-contract / D8). All emission\n * is explicit via `ctx.down`; there is no return-value framing.\n */\nexport interface Ctx {\n\t/**\n\t * Emit upstream toward deps — control tiers only (R-ctx-up). IMMEDIATE. `towardDep` (a dep index)\n\t * routes the wave up ONE declared edge (R-up-routing directed-up); omitted = broadcast up all deps.\n\t * A pull DEMAND is `up([[PULL, { pullId, params }]])` — but for a SELF-demand (demanding a dep\n\t * this fn also reads) use {@link Ctx.upNext} instead, since an immediate demand whose delivery loops back\n\t * re-enters this fn mid-wave (D37 / R-reentrancy).\n\t */\n\tup(msgs: Wave, towardDep?: number): void;\n\t/** Emit downstream toward sinks. */\n\tdown(msgs: Wave): void;\n\t/**\n\t * The single raw dep-value input surface (R-ctx-wave-data / D77): dep -> upstream waves ->\n\t * per-wave DATA payloads and INVALIDATE/SENTINEL markers. `waveData[i] = []` means dep i\n\t * delivered no wave to this invocation; `waveData[i] = [[]]` means RESOLVED-only.\n\t */\n\twaveData: WaveData;\n\t/** Terminal metadata for the same invocation; terminal values never enter `waveData`. */\n\tterminal: TerminalData;\n\tstate: CtxState;\n\t/** Release external resources on deactivation (R-cleanup-hooks). */\n\tonDeactivation(fn: () => void): void;\n\t/** Flush on INVALIDATE (R-cleanup-hooks). */\n\tonInvalidate(fn: () => void): void;\n\t/** Graph-owned environment drivers for source/adapter boundaries (D130/D131). */\n\tenvironment(): EnvironmentDrivers;\n\t/** Holder-visible context for a PULL-caused invocation (D272); absent for ordinary waves. */\n\treadonly pull?: PullDemand;\n\t/**\n\t * Deferred SELF-rewire (R-rewire-deferred / D47) — the substrate affordance higher-order\n\t * operators (switchMap/mergeMap/concatMap/exhaustMap/flatMap) use to grow/shrink their own\n\t * inner-source dep set in response to their own data. Always present; see {@link RewireNext}.\n\t */\n\trewireNext: RewireNext;\n\t/**\n\t * Deferred up — the boundary-deferred form of {@link Ctx.up} (R-up-routing / R-pull / D59). Routes\n\t * `msgs` up from this node at the COMMITTED wave boundary (broadcast, or up the single `towardDep`\n\t * edge), riding the same R-rewire-deferred (D47) drain as {@link RewireNext}. This is the\n\t * SELF-DEMAND path: a consumer issues `ctx.upNext([[PULL, { pullId, params }]])` to demand a pull\n\t * dep it ALSO reads — the cone-routed PULL reaches the pullId-holder, whose delivery loops back as a\n\t * FRESH wave (not a mid-fn re-entry → no D37). The consumer accepts one-wave latency (the\n\t * HTTP-request model). No node reference needed: the author writes the pullId verbatim.\n\t */\n\tupNext(msgs: Wave, towardDep?: number): void;\n\t/**\n\t * Read a dep's latest value by index (dynamicNode only, R-dynamic-node / D35).\n\t * Present only on dynamicNode fns; all declared deps still participate in wave\n\t * tracking. Under D49/R-resolved-undirty an unread dep's change still fires the fn,\n\t * which re-emits its (unchanged) output as a DATA occurrence — there is NO equals-\n\t * absorption; pair with distinctUntilChanged to suppress unchanged re-emits (opt-in).\n\t */\n\ttrack?(depIndex: number): unknown;\n\t[CTX_DEP_CACHE]?: CtxDepCache;\n\t[CTX_NODE_BINDING]?: CtxNodeBinding;\n}\n\n/** A node fn (R-fn-contract). Registered in a dispatcher pool, indexed by Handle. */\nexport type NodeFn = (ctx: Ctx) => void;\n\n/** Number of declared dep slots visible in this invocation. */\nexport function depCount(ctx: Ctx): number {\n\treturn ctx.waveData.length;\n}\n\n/** DATA/SENTINEL projection batches delivered by one dep in this invocation. */\nexport function depWaves(ctx: Ctx, depIndex: number): readonly (readonly unknown[])[] {\n\treturn ctx.waveData[depIndex] ?? [];\n}\n\n/** Flattened DATA projection for old event-counting operator bodies; null = no wave. */\nexport function depBatch(ctx: Ctx, depIndex: number): readonly unknown[] | null {\n\tconst waves = depWaves(ctx, depIndex);\n\tif (waves.length === 0) return null;\n\tconst flattened = waves.flat().filter((v) => v !== SENTINEL);\n\treturn flattened.length === 0 ? [] : flattened;\n}\n\n/** Latest cached DATA for a dep, derived from implementation-owned dep cache. */\nexport function depLatest(ctx: Ctx, depIndex: number): unknown {\n\treturn ctx[CTX_DEP_CACHE]?.latest[depIndex];\n}\n\n/** Terminal metadata for one dep: false = none, true = COMPLETE, otherwise ERROR payload. */\nexport function depTerminal(ctx: Ctx, depIndex: number): unknown {\n\tconst t = ctx.terminal[depIndex];\n\treturn t === undefined ? false : t;\n}\n","/**\n * Dispatcher, pools, and the pure-data Handle.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-handle (D7), R-dispatch-all (D21), R-sync-core (D20/D21).\n *\n * Lifted from the validated handle-dispatch PoC (packages/pure-ts r8-poc, R8/R9):\n * fn lives in an external pool, indexed by handle; `dispatcher.invoke` is uniformly\n * SYNC void — async/remote behavior lives in the fn body (it kicks off async work\n * and emits later via `ctx.down`), not in a different call mechanism.\n */\n\nimport type { Ctx, NodeFn } from \"../ctx/types.js\";\n\n/** A pool kind label. LocalSync + LocalAsync ship in 1.0 (D20). */\nexport type PoolKind = \"sync\" | \"async\";\n\n/**\n * Handle = pure data `(poolId, handleId)`, NO methods (R-handle / D7). A serializable\n * index into a pool's dispatch table. node != handle.\n */\nexport interface Handle {\n\treadonly poolId: number;\n\treadonly handleId: number;\n}\n\n/** A dispatch pool: a flat fn table + an array-indexed sync invoke. */\nexport interface Pool {\n\treadonly kind: PoolKind;\n\tregister(fn: NodeFn): number;\n\t/** Free a handle's slot so its fn closure is GC'd and the id is reused (B15). */\n\tunregister(handleId: number): void;\n\tinvoke(handleId: number, ctx: Ctx): void;\n}\n\n/**\n * Array-indexed fn table with a free-list (B15). `register` reuses a freed slot before\n * growing the array, so a rewire-heavy graph (fn-swap on every replaceDeps/subscribeDep/unsubscribeDep,\n * e.g. CSP-2.7 higher-order *Map operators) keeps the table bounded to its peak live size\n * instead of leaking a slot + closure per swap. `unregister` tombstones the slot (drops the\n * closure reference for GC) and offers the id for reuse. handleId reuse is safe: the graph is\n * a single causal domain (D22) and D37 forbids a fn rewiring its own handle mid-run, so a\n * freed id is never re-registered while an invoke of it is in flight. The hot path stays a\n * raw array index (F-PERF).\n */\nclass PoolTable implements Pool {\n\tconstructor(readonly kind: PoolKind) {}\n\tprivate fns: (NodeFn | undefined)[] = [];\n\tprivate free: number[] = [];\n\tregister(fn: NodeFn): number {\n\t\tconst reused = this.free.pop();\n\t\tif (reused !== undefined) {\n\t\t\tthis.fns[reused] = fn;\n\t\t\treturn reused;\n\t\t}\n\t\tconst id = this.fns.length;\n\t\tthis.fns.push(fn);\n\t\treturn id;\n\t}\n\tunregister(handleId: number): void {\n\t\tif (this.fns[handleId] === undefined) return; // already free → idempotent\n\t\tthis.fns[handleId] = undefined; // drop the closure (GC)\n\t\tthis.free.push(handleId); // offer the slot for reuse (bounded growth)\n\t}\n\tinvoke(handleId: number, ctx: Ctx): void {\n\t\t// A live handle always resolves to a fn; a dead/unregistered id throws (TypeError —\n\t\t// invoking an unregistered handle is a bug, surfaced loudly). Cast keeps the hot path\n\t\t// a raw index with no extra branch (F-PERF).\n\t\t(this.fns[handleId] as NodeFn)(ctx);\n\t}\n}\n\n/**\n * First-class dispatcher (D21). Owns pools; graph binds to one (default = process-global,\n * D26 — the only global singleton). Pool trait is pluggable for WorkerPool/RemotePool (D20).\n */\n/** Per-handle profiling counters (D39 / R-profile). Lives on the dispatcher — the invoke\n * funnel (F-DISPATCH-ALL) — NEVER on the thin node (R-node-thin). */\nexport interface HandleStat {\n\tinvokes: number;\n\ttotalDurationNs: number;\n\tlastDurationNs: number;\n}\n\nconst statKey = (h: Handle): string => `${h.poolId}:${h.handleId}`;\n\nexport class Dispatcher {\n\tprivate pools: Pool[] = [];\n\treadonly syncPoolId: number;\n\treadonly asyncPoolId: number;\n\n\t// opt-in profile recorder (default OFF → zero overhead, F-PERF).\n\tprivate _recording = false;\n\tprivate _stats = new Map<string, HandleStat>();\n\tprivate _totalInvokes = 0;\n\n\tconstructor() {\n\t\tthis.syncPoolId = this.addPool(new PoolTable(\"sync\"));\n\t\tthis.asyncPoolId = this.addPool(new PoolTable(\"async\"));\n\t}\n\n\t/** Turn the profile recorder on/off (D39). Off = zero overhead on invoke. */\n\tsetRecording(on: boolean): void {\n\t\tthis._recording = on;\n\t}\n\t/** Reset accumulated profiling counters. */\n\tclearStats(): void {\n\t\tthis._stats.clear();\n\t\tthis._totalInvokes = 0;\n\t}\n\t/** Read a handle's accumulated counters (undefined if it never ran while recording). */\n\tstatFor(handle: Handle): HandleStat | undefined {\n\t\treturn this._stats.get(statKey(handle));\n\t}\n\t/** Total fn invocations recorded across the dispatcher. */\n\tget totalInvokes(): number {\n\t\treturn this._totalInvokes;\n\t}\n\n\taddPool(pool: Pool): number {\n\t\tconst id = this.pools.length;\n\t\tthis.pools.push(pool);\n\t\treturn id;\n\t}\n\n\t/** Register a fn in a pool, returning its Handle. Default pool = sync (R-sync-core). */\n\tregister(fn: NodeFn, pool: PoolKind | number = \"sync\"): Handle {\n\t\tconst poolId = pool === \"sync\" ? this.syncPoolId : pool === \"async\" ? this.asyncPoolId : pool;\n\t\tconst handleId = this.pools[poolId].register(fn);\n\t\treturn { poolId, handleId };\n\t}\n\n\t/**\n\t * Release a handle (B15): frees the pool slot (closure GC'd, id reusable) and drops any\n\t * accumulated profile stat so a reused id never inherits the previous tenant's counters.\n\t * Called on rewire fn-swap (node._rewire) — the old handle is dropped before the node\n\t * adopts the new one. Idempotent. NOT called on deactivate (a node's handle survives\n\t * activate↔deactivate and is reused on reactivation; only a rewire swaps it).\n\t */\n\tunregister(handle: Handle): void {\n\t\tthis.pools[handle.poolId].unregister(handle.handleId);\n\t\t// Drop the stat UNCONDITIONALLY (QA F2.1), not only while recording: if recording was\n\t\t// OFF at unregister time the key would linger, and a later register reusing this id (the\n\t\t// free-list) would inherit the prior tenant's counters once recording resumes. delete of\n\t\t// an absent key is a cheap no-op; unregister is off the hot invoke path (F-PERF intact).\n\t\tthis._stats.delete(statKey(handle));\n\t}\n\n\t/** Uniform sync-void invoke (R-sync-core / R-dispatch-all). */\n\tinvoke(handle: Handle, ctx: Ctx): void {\n\t\tif (!this._recording) {\n\t\t\tthis.pools[handle.poolId].invoke(handle.handleId, ctx);\n\t\t\treturn;\n\t\t}\n\t\tthis._totalInvokes++;\n\t\tconst t0 = performance.now();\n\t\ttry {\n\t\t\tthis.pools[handle.poolId].invoke(handle.handleId, ctx);\n\t\t} finally {\n\t\t\tconst dur = (performance.now() - t0) * 1e6; // ms → ns\n\t\t\tconst key = statKey(handle);\n\t\t\tconst s = this._stats.get(key) ?? {\n\t\t\t\tinvokes: 0,\n\t\t\t\ttotalDurationNs: 0,\n\t\t\t\tlastDurationNs: 0,\n\t\t\t};\n\t\t\ts.invokes++;\n\t\t\ts.lastDurationNs = dur;\n\t\t\ts.totalDurationNs += dur;\n\t\t\tthis._stats.set(key, s);\n\t\t}\n\t}\n\n\tpoolKind(poolId: number): PoolKind {\n\t\treturn this.pools[poolId].kind;\n\t}\n}\n\n/** The only global singleton (D26). Overridable by passing an explicit dispatcher. */\nexport const defaultDispatcher = new Dispatcher();\n","import type { Ctx, Sink } from \"../ctx/types.js\";\nimport type { Dispatcher, Handle } from \"../dispatcher/index.js\";\nimport type { EnvironmentDrivers } from \"../graph/environment.js\";\nimport { type LockId, type PullDemand, SENTINEL, type Wave } from \"../protocol/messages.js\";\nimport type { Node, Status } from \"./node.js\";\nimport type { NodeVersion, ResolvedNodeVersioningPolicy } from \"./versioning.js\";\n\nexport type NodeId = number & { readonly __nodeId: unique symbol };\n\nexport interface DepBookkeeping {\n\tbatch: Array<unknown[] | null>;\n\twaveData: unknown[][][];\n\twaveTokens: Array<object | undefined>;\n\tprev: unknown[];\n\thasData: boolean[];\n\tdirty: boolean[];\n\ttier: number[];\n\tterminal: Array<true | unknown | undefined>;\n\tterminalInput: Array<true | unknown | undefined>;\n\tunsubs: Array<() => void>;\n\tidxBoxes: Array<{ v: number }>;\n}\n\nexport interface ValueState<T> {\n\tcache: T | undefined;\n\thasData: boolean;\n\tstatus: Status;\n\tterminal: true | unknown | undefined;\n\thasTorndown: boolean;\n\treplayRing: T[];\n}\n\nexport interface VersionState {\n\tpolicy: ResolvedNodeVersioningPolicy;\n\tvalue: NodeVersion | undefined;\n}\n\nexport interface WaveState {\n\tpending: number;\n\thasCalledFnOnce: boolean;\n\temittedDirtyThisWave: boolean;\n\temittedSettleThisWave: boolean;\n\tinsideRunWave: boolean;\n\tinDepMutation: boolean;\n\trewireRunPending: boolean;\n\tbatchDirtyOwed: boolean;\n}\n\nexport interface ControlState {\n\tpauseLockset: Set<unknown>;\n\tpausedDepWaveOccurred: boolean;\n\tpauseBuffer: Wave[];\n\tdemandOwed: PullDemand | undefined;\n\tactivePull: PullDemand | undefined;\n\tpullDirtyOwed: boolean;\n\tinDeliverDemand: boolean;\n}\n\nexport interface PrivateState {\n\tvalue: unknown;\n\tpersist: boolean;\n}\n\nexport interface CleanupHooks {\n\tonDeactivation: Array<() => void>;\n\tonInvalidate: Array<() => void>;\n}\n\nexport interface SyncCtxState {\n\tvalue: Ctx | null;\n}\n\nexport interface LifecycleState {\n\tsubscribers: Set<Sink>;\n\tactivated: boolean;\n}\n\nexport interface BoundaryTask {\n\tapply: () => void;\n\tbatchToken?: object;\n\tisReady?: () => boolean;\n}\n\nexport interface BoundaryState {\n\tqueue: BoundaryTask[];\n\thead: number;\n}\n\nexport interface NodeSlot<_T> {\n\tid: NodeId;\n\tdeps: Node<unknown>[];\n\thandle: Handle | null;\n\tpool: \"sync\" | \"async\";\n\tdispatcher: Dispatcher;\n\tenvironment: EnvironmentDrivers;\n\tpartial: boolean;\n\tterminalAsRealInput: boolean;\n\tcompleteWhenDepsComplete: boolean;\n\terrorWhenDepsError: boolean;\n\tresubscribable: boolean;\n\tresetOnTeardown: boolean;\n\tpausable: boolean | \"resumeAll\";\n\tpull: boolean;\n\tpullLock: LockId | undefined;\n\treplayN: number;\n\tdynamic: boolean;\n\tname?: string;\n\tfactory?: string;\n}\n\nexport interface NodeState<T> {\n\tdep: DepBookkeeping;\n\tlifecycle: LifecycleState;\n\tvalue: ValueState<T>;\n\tversion: VersionState;\n\twave: WaveState;\n\tcontrol: ControlState;\n\tprivateState: PrivateState;\n\thooks: CleanupHooks;\n\tsyncCtx: SyncCtxState;\n}\n\nexport class NodeCore {\n\tprivate nextId = 0;\n\tprivate readonly slots: Array<NodeSlot<unknown> | undefined> = [];\n\tprivate readonly values: Array<ValueState<unknown> | undefined> = [];\n\tprivate readonly waves: Array<WaveState | undefined> = [];\n\tprivate readonly controls: Array<ControlState | undefined> = [];\n\tprivate readonly lifecycles: Array<LifecycleState | undefined> = [];\n\tprivate readonly depStates: Array<DepBookkeeping | undefined> = [];\n\tprivate readonly privateStates: Array<PrivateState | undefined> = [];\n\tprivate readonly hooks: Array<CleanupHooks | undefined> = [];\n\tprivate readonly syncCtxs: Array<SyncCtxState | undefined> = [];\n\tprivate readonly versionStates: Array<VersionState | undefined> = [];\n\tprivate readonly boundary: BoundaryState = { queue: [], head: 0 };\n\n\tcreateSlot<T>(\n\t\tslot: Omit<NodeSlot<T>, \"id\">,\n\t\tstate: NodeState<T>,\n\t): { id: NodeId; slot: NodeSlot<T> } {\n\t\tconst id = this.nextId++ as NodeId;\n\t\tconst full = { ...slot, id };\n\t\tthis.slots[id] = full as NodeSlot<unknown>;\n\t\tthis.depStates[id] = state.dep;\n\t\tthis.lifecycles[id] = state.lifecycle;\n\t\tthis.values[id] = state.value as ValueState<unknown>;\n\t\tthis.waves[id] = state.wave;\n\t\tthis.controls[id] = state.control;\n\t\tthis.privateStates[id] = state.privateState;\n\t\tthis.hooks[id] = state.hooks;\n\t\tthis.syncCtxs[id] = state.syncCtx;\n\t\tthis.versionStates[id] = state.version;\n\t\treturn { id, slot: full };\n\t}\n\n\tget<T>(id: NodeId): NodeSlot<T> {\n\t\tconst slot = this.slots[id];\n\t\tif (slot === undefined) throw new Error(\"NodeCore: unknown node slot\");\n\t\treturn slot as NodeSlot<T>;\n\t}\n\n\tgetValue<T>(id: NodeId): ValueState<T> {\n\t\tconst value = this.values[id];\n\t\tif (value === undefined) throw new Error(\"NodeCore: unknown node value state\");\n\t\treturn value as ValueState<T>;\n\t}\n\n\tgetWave(id: NodeId): WaveState {\n\t\tconst wave = this.waves[id];\n\t\tif (wave === undefined) throw new Error(\"NodeCore: unknown node wave state\");\n\t\treturn wave;\n\t}\n\n\tgetControl(id: NodeId): ControlState {\n\t\tconst control = this.controls[id];\n\t\tif (control === undefined) throw new Error(\"NodeCore: unknown node control state\");\n\t\treturn control;\n\t}\n\n\tgetLifecycle(id: NodeId): LifecycleState {\n\t\tconst lifecycle = this.lifecycles[id];\n\t\tif (lifecycle === undefined) throw new Error(\"NodeCore: unknown node lifecycle state\");\n\t\treturn lifecycle;\n\t}\n\n\tgetDep(id: NodeId): DepBookkeeping {\n\t\tconst dep = this.depStates[id];\n\t\tif (dep === undefined) throw new Error(\"NodeCore: unknown node dep state\");\n\t\treturn dep;\n\t}\n\n\tgetPrivateState(id: NodeId): PrivateState {\n\t\tconst state = this.privateStates[id];\n\t\tif (state === undefined) throw new Error(\"NodeCore: unknown node private state\");\n\t\treturn state;\n\t}\n\n\tgetHooks(id: NodeId): CleanupHooks {\n\t\tconst hooks = this.hooks[id];\n\t\tif (hooks === undefined) throw new Error(\"NodeCore: unknown node cleanup hooks\");\n\t\treturn hooks;\n\t}\n\n\tgetSyncCtx(id: NodeId): SyncCtxState {\n\t\tconst state = this.syncCtxs[id];\n\t\tif (state === undefined) throw new Error(\"NodeCore: unknown node ctx state\");\n\t\treturn state;\n\t}\n\n\tgetVersion(id: NodeId): VersionState {\n\t\tconst state = this.versionStates[id];\n\t\tif (state === undefined) throw new Error(\"NodeCore: unknown node version state\");\n\t\treturn state;\n\t}\n\n\t/** @internal D122: release graph-owned ephemeral node runtime state from core retention. */\n\treleaseSlot(id: NodeId): void {\n\t\tthis.slots[id] = undefined;\n\t\tthis.depStates[id] = undefined;\n\t\tthis.lifecycles[id] = undefined;\n\t\tthis.values[id] = undefined;\n\t\tthis.waves[id] = undefined;\n\t\tthis.controls[id] = undefined;\n\t\tthis.privateStates[id] = undefined;\n\t\tthis.hooks[id] = undefined;\n\t\tthis.syncCtxs[id] = undefined;\n\t\tthis.versionStates[id] = undefined;\n\t}\n\n\t/** @internal B49: graph-local deferred-boundary queue (rewireNext/upNext/batch-after-commit). */\n\tenqueueBoundaryTask(task: BoundaryTask): void {\n\t\tthis.boundary.queue.push(task);\n\t}\n\n\t/** @internal */\n\thasBoundaryTasks(): boolean {\n\t\treturn this.boundary.head < this.boundary.queue.length;\n\t}\n\n\t/** @internal */\n\tboundaryTaskCount(): number {\n\t\treturn this.boundary.queue.length - this.boundary.head;\n\t}\n\n\t/** @internal */\n\tshiftBoundaryTask(): BoundaryTask | undefined {\n\t\tif (!this.hasBoundaryTasks()) {\n\t\t\tthis.boundary.queue = [];\n\t\t\tthis.boundary.head = 0;\n\t\t\treturn undefined;\n\t\t}\n\t\tconst task = this.boundary.queue[this.boundary.head++];\n\t\tif (!this.hasBoundaryTasks()) {\n\t\t\tthis.boundary.queue = [];\n\t\t\tthis.boundary.head = 0;\n\t\t}\n\t\treturn task;\n\t}\n\n\t/** @internal Put a not-yet-ready task back at this core's FIFO head. */\n\tunshiftBoundaryTask(task: BoundaryTask): void {\n\t\tconst remaining = this.boundary.queue.slice(this.boundary.head);\n\t\tthis.boundary.queue = [task, ...remaining];\n\t\tthis.boundary.head = 0;\n\t}\n\n\t/** @internal D110: discard all pending tasks caused by an uncommitted batch. */\n\tdropBoundaryTasksForBatch(batchToken: object): void {\n\t\tconst remaining = this.boundary.queue\n\t\t\t.slice(this.boundary.head)\n\t\t\t.filter((task) => task.batchToken !== batchToken);\n\t\tthis.boundary.queue = remaining;\n\t\tthis.boundary.head = 0;\n\t}\n}\n\nexport function makeDepBookkeeping(depCount: number): DepBookkeeping {\n\treturn {\n\t\tbatch: new Array(depCount).fill(null),\n\t\twaveData: Array.from({ length: depCount }, () => []),\n\t\twaveTokens: new Array(depCount).fill(undefined),\n\t\tprev: new Array(depCount).fill(SENTINEL),\n\t\thasData: new Array(depCount).fill(false),\n\t\tdirty: new Array(depCount).fill(false),\n\t\ttier: new Array(depCount).fill(0),\n\t\tterminal: new Array(depCount).fill(undefined),\n\t\tterminalInput: new Array(depCount).fill(undefined),\n\t\tunsubs: [],\n\t\tidxBoxes: [],\n\t};\n}\n","/**\n * Graph-owned environment driver bag (D130/D131).\n *\n * Drivers host process/network/messaging/runtime boundary work outside the synchronous wave core.\n * The bag is graph-local and is read from ctx by source/adapter bodies.\n */\n\nexport type DriverCancel = () => void;\n\nexport type DriverResult<T> =\n\t| { readonly ok: true; readonly value: T }\n\t| { readonly ok: false; readonly error: unknown };\n\nexport interface ProcessCommand {\n\treadonly program: string;\n\treadonly args: readonly string[];\n\treadonly cwd?: string;\n\treadonly env?: readonly (readonly [string, string])[];\n}\n\nexport interface ProcessResult {\n\treadonly stdout: string;\n\treadonly stderr: string;\n\treadonly exitCode: number | null;\n\treadonly signal: string | null;\n}\n\nexport interface HttpRequest {\n\treadonly method: string;\n\treadonly url: string;\n\treadonly headers?: readonly (readonly [string, string])[];\n\treadonly body?: Uint8Array | string;\n}\n\nexport interface HttpResponse {\n\treadonly status: number;\n\treadonly headers: readonly (readonly [string, string])[];\n\treadonly body: Uint8Array;\n}\n\nexport interface SseRequest {\n\treadonly url: string;\n\treadonly headers?: readonly (readonly [string, string])[];\n}\n\nexport interface SseEvent {\n\treadonly event?: string;\n\treadonly data: string;\n\treadonly id?: string;\n\treadonly retryMs?: number;\n}\n\nexport type SseDriverEvent =\n\t| { readonly kind: \"event\"; readonly event: SseEvent }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"complete\" };\n\nexport interface WebSocketRequest {\n\treadonly url: string;\n\treadonly headers?: readonly (readonly [string, string])[];\n}\n\nexport type WebSocketEvent =\n\t| { readonly kind: \"open\" }\n\t| { readonly kind: \"text\"; readonly data: string }\n\t| { readonly kind: \"binary\"; readonly data: Uint8Array }\n\t| { readonly kind: \"close\"; readonly code?: number; readonly reason?: string };\n\nexport interface WebSocketSend {\n\treadonly data: string | Uint8Array;\n}\n\nexport interface WebSocketSendResult {\n\treadonly sent: true;\n}\n\n/** Live WebSocket session handle for D133 SessionBundle adapters. */\nexport interface WebSocketSessionHandle {\n\tsend(\n\t\tmessage: WebSocketSend,\n\t\tcallback: (result: DriverResult<WebSocketSendResult>) => void,\n\t): DriverCancel;\n\tclose(code?: number, reason?: string): void;\n\tcancel(): void;\n}\n\nexport type WebSocketDriverEvent =\n\t| { readonly kind: \"event\"; readonly event: WebSocketEvent }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"complete\" };\n\nexport interface WebhookRegistration {\n\treadonly id: string;\n\treadonly method?: string;\n\treadonly path?: string;\n}\n\nexport interface WebhookEvent {\n\treadonly registrationId: string;\n\treadonly method: string;\n\treadonly path: string;\n\treadonly headers: readonly (readonly [string, string])[];\n\treadonly query: readonly (readonly [string, string])[];\n\treadonly body: Uint8Array;\n}\n\nexport type WebhookDriverEvent =\n\t| { readonly kind: \"event\"; readonly event: WebhookEvent }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"complete\" };\n\nexport interface LocalProcessDriver {\n\trun(\n\t\tcommand: ProcessCommand,\n\t\tcallback: (result: DriverResult<ProcessResult>) => void,\n\t): DriverCancel;\n}\n\nexport interface LocalHttpDriver {\n\trequest(\n\t\trequest: HttpRequest,\n\t\tcallback: (result: DriverResult<HttpResponse>) => void,\n\t): DriverCancel;\n}\n\nexport interface LocalSseDriver {\n\tconnect(request: SseRequest, callback: (event: SseDriverEvent) => void): DriverCancel;\n}\n\nexport interface LocalWebSocketDriver {\n\tconnect(request: WebSocketRequest, callback: (event: WebSocketDriverEvent) => void): DriverCancel;\n\tsend?(\n\t\trequest: WebSocketRequest,\n\t\tmessage: WebSocketSend,\n\t\tcallback: (result: DriverResult<WebSocketSendResult>) => void,\n\t): DriverCancel;\n\t/** Open a live bidirectional session; unlike send(), outbound messages use this same connection. */\n\tconnectSession?(\n\t\trequest: WebSocketRequest,\n\t\tcallback: (event: WebSocketDriverEvent) => void,\n\t): WebSocketSessionHandle;\n}\n\nexport interface LocalWebhookDriver {\n\tregister(\n\t\tregistration: WebhookRegistration,\n\t\tcallback: (event: WebhookDriverEvent) => void,\n\t): DriverCancel;\n}\n\nexport interface FetchResponseLike {\n\treadonly status: number;\n\treadonly headers?: { forEach?(fn: (value: string, key: string) => void): void };\n\tarrayBuffer(): PromiseLike<ArrayBuffer>;\n}\n\nexport type FetchLike = (\n\turl: string,\n\tinit?: {\n\t\treadonly method?: string;\n\t\treadonly headers?: readonly (readonly [string, string])[];\n\t\treadonly body?: Uint8Array | string;\n\t\treadonly signal?: AbortSignal;\n\t},\n) => PromiseLike<FetchResponseLike>;\n\nexport interface WebSocketLike {\n\tsend(data: string | Uint8Array): void;\n\tclose(code?: number, reason?: string): void;\n\taddEventListener(\n\t\ttype: \"open\" | \"message\" | \"error\" | \"close\",\n\t\tlistener: (event: unknown) => void,\n\t): void;\n\tremoveEventListener(\n\t\ttype: \"open\" | \"message\" | \"error\" | \"close\",\n\t\tlistener: (event: unknown) => void,\n\t): void;\n}\n\nexport type WebSocketConstructorLike = new (url: string) => WebSocketLike;\n\nexport interface EnvironmentDriversInit {\n\treadonly process?: LocalProcessDriver;\n\treadonly http?: LocalHttpDriver;\n\treadonly sse?: LocalSseDriver;\n\treadonly websocket?: LocalWebSocketDriver;\n\treadonly webhook?: LocalWebhookDriver;\n}\n\nexport class EnvironmentDrivers {\n\treadonly process?: LocalProcessDriver;\n\treadonly http?: LocalHttpDriver;\n\treadonly sse?: LocalSseDriver;\n\treadonly websocket?: LocalWebSocketDriver;\n\treadonly webhook?: LocalWebhookDriver;\n\n\tconstructor(init: EnvironmentDriversInit = {}) {\n\t\tthis.process = init.process;\n\t\tthis.http = init.http;\n\t\tthis.sse = init.sse;\n\t\tthis.websocket = init.websocket;\n\t\tthis.webhook = init.webhook;\n\t\tObject.freeze(this);\n\t}\n\n\tstatic empty(): EnvironmentDrivers {\n\t\treturn EMPTY_ENVIRONMENT;\n\t}\n\n\twithProcess(driver: LocalProcessDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, process: driver });\n\t}\n\n\twithHttp(driver: LocalHttpDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, http: driver });\n\t}\n\n\twithSse(driver: LocalSseDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, sse: driver });\n\t}\n\n\twithWebSocket(driver: LocalWebSocketDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, websocket: driver });\n\t}\n\n\twithWebhook(driver: LocalWebhookDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, webhook: driver });\n\t}\n\n\tprocessDriver(): LocalProcessDriver | undefined {\n\t\treturn this.process;\n\t}\n\n\thttpDriver(): LocalHttpDriver | undefined {\n\t\treturn this.http;\n\t}\n\n\tsseDriver(): LocalSseDriver | undefined {\n\t\treturn this.sse;\n\t}\n\n\twebSocketDriver(): LocalWebSocketDriver | undefined {\n\t\treturn this.websocket;\n\t}\n\n\twebhookDriver(): LocalWebhookDriver | undefined {\n\t\treturn this.webhook;\n\t}\n}\n\nconst EMPTY_ENVIRONMENT = new EnvironmentDrivers();\n\nexport function fetchHttpDriver(fetchFn: FetchLike = requireGlobalFetch()): LocalHttpDriver {\n\treturn {\n\t\trequest(request, callback) {\n\t\t\tconst controller = new AbortController();\n\t\t\tvoid Promise.resolve(\n\t\t\t\tfetchFn(request.url, {\n\t\t\t\t\tmethod: request.method,\n\t\t\t\t\theaders: request.headers,\n\t\t\t\t\tbody: request.body,\n\t\t\t\t\tsignal: controller.signal,\n\t\t\t\t}),\n\t\t\t).then(\n\t\t\t\tasync (response) => {\n\t\t\t\t\tconst headers: Array<readonly [string, string]> = [];\n\t\t\t\t\tresponse.headers?.forEach?.((value, key) => {\n\t\t\t\t\t\theaders.push([key, value]);\n\t\t\t\t\t});\n\t\t\t\t\tconst body = new Uint8Array(await response.arrayBuffer());\n\t\t\t\t\tcallback({ ok: true, value: { status: response.status, headers, body } });\n\t\t\t\t},\n\t\t\t\t(error) => callback({ ok: false, error }),\n\t\t\t);\n\t\t\treturn () => controller.abort();\n\t\t},\n\t};\n}\n\nexport function domWebSocketDriver(\n\tWebSocketCtor: WebSocketConstructorLike = requireGlobalWebSocket(),\n): LocalWebSocketDriver {\n\treturn {\n\t\tconnect(request, callback) {\n\t\t\tconst socket = new WebSocketCtor(request.url);\n\t\t\tconst onOpen = () => callback({ kind: \"event\", event: { kind: \"open\" } });\n\t\t\tconst onMessage = (event: unknown) => {\n\t\t\t\tconst data = (event as { data?: unknown }).data;\n\t\t\t\tif (typeof data === \"string\") callback({ kind: \"event\", event: { kind: \"text\", data } });\n\t\t\t\telse if (data instanceof Uint8Array) {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"binary\", data } });\n\t\t\t\t} else {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"text\", data: String(data ?? \"\") } });\n\t\t\t\t}\n\t\t\t};\n\t\t\tconst onError = (event: unknown) => callback({ kind: \"error\", error: event });\n\t\t\tconst onClose = (event: unknown) => {\n\t\t\t\tconst close = event as { code?: number; reason?: string };\n\t\t\t\tcallback({\n\t\t\t\t\tkind: \"event\",\n\t\t\t\t\tevent: { kind: \"close\", code: close.code, reason: close.reason },\n\t\t\t\t});\n\t\t\t\tcallback({ kind: \"complete\" });\n\t\t\t};\n\t\t\tsocket.addEventListener(\"open\", onOpen);\n\t\t\tsocket.addEventListener(\"message\", onMessage);\n\t\t\tsocket.addEventListener(\"error\", onError);\n\t\t\tsocket.addEventListener(\"close\", onClose);\n\t\t\treturn () => {\n\t\t\t\tsocket.removeEventListener(\"open\", onOpen);\n\t\t\t\tsocket.removeEventListener(\"message\", onMessage);\n\t\t\t\tsocket.removeEventListener(\"error\", onError);\n\t\t\t\tsocket.removeEventListener(\"close\", onClose);\n\t\t\t\tsocket.close();\n\t\t\t};\n\t\t},\n\t\tsend(request, message, callback) {\n\t\t\tconst socket = new WebSocketCtor(request.url);\n\t\t\tlet settled = false;\n\t\t\tconst finish = (result: DriverResult<WebSocketSendResult>) => {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\tcallback(result);\n\t\t\t\tsocket.close();\n\t\t\t};\n\t\t\tconst onOpen = () => {\n\t\t\t\ttry {\n\t\t\t\t\tsocket.send(message.data);\n\t\t\t\t\tfinish({ ok: true, value: { sent: true } });\n\t\t\t\t} catch (error) {\n\t\t\t\t\tfinish({ ok: false, error });\n\t\t\t\t}\n\t\t\t};\n\t\t\tconst onError = (event: unknown) => finish({ ok: false, error: event });\n\t\t\tsocket.addEventListener(\"open\", onOpen);\n\t\t\tsocket.addEventListener(\"error\", onError);\n\t\t\treturn () => {\n\t\t\t\tsettled = true;\n\t\t\t\tsocket.removeEventListener(\"open\", onOpen);\n\t\t\t\tsocket.removeEventListener(\"error\", onError);\n\t\t\t\tsocket.close();\n\t\t\t};\n\t\t},\n\t\tconnectSession(request, callback) {\n\t\t\tconst socket = new WebSocketCtor(request.url);\n\t\t\tlet active = true;\n\t\t\tconst onOpen = () => callback({ kind: \"event\", event: { kind: \"open\" } });\n\t\t\tconst onMessage = (event: unknown) => {\n\t\t\t\tconst data = (event as { data?: unknown }).data;\n\t\t\t\tif (typeof data === \"string\") callback({ kind: \"event\", event: { kind: \"text\", data } });\n\t\t\t\telse if (data instanceof Uint8Array) {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"binary\", data } });\n\t\t\t\t} else {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"text\", data: String(data ?? \"\") } });\n\t\t\t\t}\n\t\t\t};\n\t\t\tconst onError = (event: unknown) => callback({ kind: \"error\", error: event });\n\t\t\tconst onClose = (event: unknown) => {\n\t\t\t\tconst close = event as { code?: number; reason?: string };\n\t\t\t\tcallback({\n\t\t\t\t\tkind: \"event\",\n\t\t\t\t\tevent: { kind: \"close\", code: close.code, reason: close.reason },\n\t\t\t\t});\n\t\t\t\tcallback({ kind: \"complete\" });\n\t\t\t};\n\t\t\tconst removeListeners = () => {\n\t\t\t\tsocket.removeEventListener(\"open\", onOpen);\n\t\t\t\tsocket.removeEventListener(\"message\", onMessage);\n\t\t\t\tsocket.removeEventListener(\"error\", onError);\n\t\t\t\tsocket.removeEventListener(\"close\", onClose);\n\t\t\t};\n\t\t\tsocket.addEventListener(\"open\", onOpen);\n\t\t\tsocket.addEventListener(\"message\", onMessage);\n\t\t\tsocket.addEventListener(\"error\", onError);\n\t\t\tsocket.addEventListener(\"close\", onClose);\n\t\t\treturn {\n\t\t\t\tsend(message, sendCallback) {\n\t\t\t\t\tlet canceled = false;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tsocket.send(message.data);\n\t\t\t\t\t\tif (!canceled) sendCallback({ ok: true, value: { sent: true } });\n\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\tif (!canceled) sendCallback({ ok: false, error });\n\t\t\t\t\t}\n\t\t\t\t\treturn () => {\n\t\t\t\t\t\tcanceled = true;\n\t\t\t\t\t};\n\t\t\t\t},\n\t\t\t\tclose(code, reason) {\n\t\t\t\t\tif (!active) return;\n\t\t\t\t\tsocket.close(code, reason);\n\t\t\t\t},\n\t\t\t\tcancel() {\n\t\t\t\t\tif (!active) return;\n\t\t\t\t\tactive = false;\n\t\t\t\t\tremoveListeners();\n\t\t\t\t\tsocket.close();\n\t\t\t\t},\n\t\t\t};\n\t\t},\n\t};\n}\n\nfunction requireGlobalFetch(): FetchLike {\n\tconst fetchFn = (globalThis as { fetch?: FetchLike }).fetch;\n\tif (fetchFn === undefined) throw new Error(\"fetchHttpDriver: global fetch is not available\");\n\treturn fetchFn;\n}\n\nfunction requireGlobalWebSocket(): WebSocketConstructorLike {\n\tconst ctor = (globalThis as { WebSocket?: WebSocketConstructorLike }).WebSocket;\n\tif (ctor === undefined) throw new Error(\"domWebSocketDriver: global WebSocket is not available\");\n\treturn ctor;\n}\n","/**\n * Neutral JSON/encoding utilities (D96).\n *\n * Shared by graph checkpoints and storage bindings; neither layer owns the strict JSON\n * scanner/canonicalization contract.\n */\n\n/** Typed byte codec for D82 storage binding helpers and D96 shared JSON surfaces. */\nexport interface Codec<T> {\n\tencode(value: T): Uint8Array;\n\tdecode(bytes: Uint8Array): T;\n}\n\nexport type StrictJsonScalar = null | boolean | number | string;\nexport type StrictJsonValue =\n\t| StrictJsonScalar\n\t| readonly StrictJsonValue[]\n\t| { readonly [key: string]: StrictJsonValue };\nexport type StrictJsonObject = Readonly<Record<string, StrictJsonValue>>;\n\ntype JsonValue = StrictJsonValue;\n\nconst JS_MIN_NORMAL_NUMBER = 2 ** -1022;\n\nfunction assertStableJsonNumber(value: number, path: string): void {\n\tif (!Number.isFinite(value)) {\n\t\tthrow new TypeError(`stableJsonString: non-finite number at ${path}`);\n\t}\n}\n\nfunction assertStrictJsonNumber(value: number, path: string): void {\n\tassertStableJsonNumber(value, path);\n\tif (Object.is(value, -0)) {\n\t\tthrow new TypeError(`stableJsonString: non-canonical number at ${path}`);\n\t}\n\tconst abs = Math.abs(value);\n\tif (abs > 0 && abs < JS_MIN_NORMAL_NUMBER) {\n\t\tthrow new TypeError(`stableJsonString: subnormal number at ${path}`);\n\t}\n\tif (Number.isInteger(value) && !Number.isSafeInteger(value)) {\n\t\tthrow new TypeError(`stableJsonString: integer outside safe range at ${path}`);\n\t}\n}\n\nfunction sortedJsonValue(\n\tvalue: unknown,\n\tseen = new Set<object>(),\n\tpath = \"$\",\n\tstrictNumbers = false,\n): JsonValue {\n\tif (value === null) return null;\n\tif (typeof value === \"string\" || typeof value === \"boolean\") return value;\n\tif (typeof value === \"number\") {\n\t\tif (strictNumbers) assertStrictJsonNumber(value, path);\n\t\telse assertStableJsonNumber(value, path);\n\t\treturn value;\n\t}\n\tif (typeof value !== \"object\") {\n\t\tthrow new TypeError(`stableJsonString: value at ${path} is not JSON-encodable`);\n\t}\n\tif (seen.has(value)) throw new TypeError(`stableJsonString: circular reference at ${path}`);\n\tconst proto = Object.getPrototypeOf(value);\n\tif (!Array.isArray(value) && proto !== Object.prototype && proto !== null) {\n\t\tthrow new TypeError(`stableJsonString: non-plain object at ${path}`);\n\t}\n\tseen.add(value);\n\ttry {\n\t\tif (Array.isArray(value)) {\n\t\t\tif (Object.getOwnPropertySymbols(value).length > 0) {\n\t\t\t\tthrow new TypeError(`stableJsonString: symbol-keyed properties at ${path}`);\n\t\t\t}\n\t\t\tfor (const key of Object.getOwnPropertyNames(value)) {\n\t\t\t\tconst isIndex =\n\t\t\t\t\t/^(0|[1-9]\\d*)$/.test(key) &&\n\t\t\t\t\tNumber.isSafeInteger(Number(key)) &&\n\t\t\t\t\tNumber(key) < value.length;\n\t\t\t\tif (key !== \"length\" && !isIndex) {\n\t\t\t\t\tthrow new TypeError(`stableJsonString: non-index array property at ${path}.${key}`);\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst out: JsonValue[] = [];\n\t\t\tfor (let i = 0; i < value.length; i += 1) {\n\t\t\t\tif (!(i in value)) {\n\t\t\t\t\tthrow new TypeError(`stableJsonString: sparse array hole at ${path}[${i}]`);\n\t\t\t\t}\n\t\t\t\tout.push(sortedJsonValue(value[i], seen, `${path}[${i}]`, strictNumbers));\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\tif (Object.getOwnPropertySymbols(value).length > 0) {\n\t\t\tthrow new TypeError(`stableJsonString: symbol-keyed properties at ${path}`);\n\t\t}\n\t\tconst out: Record<string, JsonValue> = Object.create(null);\n\t\tfor (const key of Object.keys(value as Record<string, unknown>).sort()) {\n\t\t\tout[key] = sortedJsonValue(\n\t\t\t\t(value as Record<string, unknown>)[key],\n\t\t\t\tseen,\n\t\t\t\t`${path}.${key}`,\n\t\t\t\tstrictNumbers,\n\t\t\t);\n\t\t}\n\t\treturn out;\n\t} finally {\n\t\tseen.delete(value);\n\t}\n}\n\n/** Stable JSON string: object keys sort by code-unit order for deterministic storage/checkpoint bytes. */\nexport function stableJsonString(value: unknown): string {\n\treturn JSON.stringify(sortedJsonValue(value));\n}\n\nfunction strictStableJsonString(value: unknown): string {\n\treturn JSON.stringify(sortedJsonValue(value, new Set<object>(), \"$\", true));\n}\n\n/** Build a JSON codec using stable object-key ordering. */\nexport function jsonCodecFor<T>(): Codec<T> {\n\tconst encoder = new TextEncoder();\n\tconst decoder = new TextDecoder();\n\treturn {\n\t\tencode(value: T): Uint8Array {\n\t\t\treturn encoder.encode(stableJsonString(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): T {\n\t\t\treturn JSON.parse(decoder.decode(bytes)) as T;\n\t\t},\n\t};\n}\n\n/** Default stable JSON codec for unknown values. */\nexport const jsonCodec: Codec<unknown> = jsonCodecFor<unknown>();\n\nfunction bytesEqual(a: Uint8Array, b: Uint8Array): boolean {\n\tif (a.byteLength !== b.byteLength) return false;\n\tfor (let i = 0; i < a.byteLength; i += 1) {\n\t\tif (a[i] !== b[i]) return false;\n\t}\n\treturn true;\n}\n\nfunction hasUnpairedSurrogate(value: string): boolean {\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tconst code = value.charCodeAt(i);\n\t\tif (code >= 0xd800 && code <= 0xdbff) {\n\t\t\tconst next = value.charCodeAt(i + 1);\n\t\t\tif (next >= 0xdc00 && next <= 0xdfff) {\n\t\t\t\ti += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tif (code >= 0xdc00 && code <= 0xdfff) return true;\n\t}\n\treturn false;\n}\n\nfunction assertNoUnpairedSurrogates(value: unknown, seen = new Set<object>(), path = \"$\"): void {\n\tif (typeof value === \"string\") {\n\t\tif (hasUnpairedSurrogate(value)) {\n\t\t\tthrow new TypeError(`strictJsonCodec: unpaired surrogate at ${path}`);\n\t\t}\n\t\treturn;\n\t}\n\tif (value === null || typeof value !== \"object\") return;\n\tif (seen.has(value)) return;\n\tseen.add(value);\n\ttry {\n\t\tif (Array.isArray(value)) {\n\t\t\tfor (let i = 0; i < value.length; i += 1) {\n\t\t\t\tassertNoUnpairedSurrogates(value[i], seen, `${path}[${i}]`);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tfor (const key of Object.keys(value as Record<string, unknown>)) {\n\t\t\tif (hasUnpairedSurrogate(key)) {\n\t\t\t\tthrow new TypeError(`strictJsonCodec: unpaired surrogate at ${path}.${key}`);\n\t\t\t}\n\t\t\tassertNoUnpairedSurrogates((value as Record<string, unknown>)[key], seen, `${path}.${key}`);\n\t\t}\n\t} finally {\n\t\tseen.delete(value);\n\t}\n}\n\nfunction assertNoDuplicateJsonObjectKeys(text: string): void {\n\tlet index = 0;\n\n\tfunction fail(message: string): never {\n\t\tthrow new TypeError(`strictJsonCodec: ${message}`);\n\t}\n\n\tfunction skipWhitespace(): void {\n\t\twhile (/\\s/.test(text[index] ?? \"\")) index += 1;\n\t}\n\n\tfunction readJsonString(): string {\n\t\tconst start = index;\n\t\tindex += 1;\n\t\twhile (index < text.length) {\n\t\t\tconst ch = text[index];\n\t\t\tif (ch === '\"') {\n\t\t\t\tindex += 1;\n\t\t\t\ttry {\n\t\t\t\t\treturn JSON.parse(text.slice(start, index)) as string;\n\t\t\t\t} catch {\n\t\t\t\t\tfail(\"malformed JSON string\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ch === \"\\\\\") {\n\t\t\t\tindex += 2;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tindex += 1;\n\t\t}\n\t\tfail(\"unterminated JSON string\");\n\t}\n\n\tfunction consumeLiteral(literal: string): void {\n\t\tif (text.slice(index, index + literal.length) !== literal) {\n\t\t\tfail(`malformed JSON near byte ${index}`);\n\t\t}\n\t\tindex += literal.length;\n\t}\n\n\tfunction consumeNumber(): void {\n\t\tconst match = /^-?(0|[1-9]\\d*)(\\.\\d+)?([eE][+-]?\\d+)?/.exec(text.slice(index));\n\t\tif (!match) fail(`malformed JSON number near byte ${index}`);\n\t\tindex += match[0].length;\n\t}\n\n\tfunction parseValue(path: string): void {\n\t\tskipWhitespace();\n\t\tconst ch = text[index];\n\t\tif (ch === \"{\") {\n\t\t\tparseObject(path);\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"[\") {\n\t\t\tparseArray(path);\n\t\t\treturn;\n\t\t}\n\t\tif (ch === '\"') {\n\t\t\treadJsonString();\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"t\") {\n\t\t\tconsumeLiteral(\"true\");\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"f\") {\n\t\t\tconsumeLiteral(\"false\");\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"n\") {\n\t\t\tconsumeLiteral(\"null\");\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"-\" || (ch !== undefined && ch >= \"0\" && ch <= \"9\")) {\n\t\t\tconsumeNumber();\n\t\t\treturn;\n\t\t}\n\t\tfail(`malformed JSON near byte ${index}`);\n\t}\n\n\tfunction parseObject(path: string): void {\n\t\tconst keys = new Set<string>();\n\t\tindex += 1;\n\t\tskipWhitespace();\n\t\tif (text[index] === \"}\") {\n\t\t\tindex += 1;\n\t\t\treturn;\n\t\t}\n\t\twhile (index < text.length) {\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] !== '\"') fail(`expected object key near byte ${index}`);\n\t\t\tconst key = readJsonString();\n\t\t\tif (keys.has(key)) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t`strictJsonCodec: duplicate object key ${JSON.stringify(key)} at ${path}`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tkeys.add(key);\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] !== \":\") fail(`expected ':' after object key near byte ${index}`);\n\t\t\tindex += 1;\n\t\t\tparseValue(`${path}.${key}`);\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] === \",\") {\n\t\t\t\tindex += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (text[index] === \"}\") {\n\t\t\t\tindex += 1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfail(`expected ',' or '}' near byte ${index}`);\n\t\t}\n\t\tfail(\"unterminated JSON object\");\n\t}\n\n\tfunction parseArray(path: string): void {\n\t\tindex += 1;\n\t\tskipWhitespace();\n\t\tif (text[index] === \"]\") {\n\t\t\tindex += 1;\n\t\t\treturn;\n\t\t}\n\t\tlet item = 0;\n\t\twhile (index < text.length) {\n\t\t\tparseValue(`${path}[${item}]`);\n\t\t\titem += 1;\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] === \",\") {\n\t\t\t\tindex += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (text[index] === \"]\") {\n\t\t\t\tindex += 1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfail(`expected ',' or ']' near byte ${index}`);\n\t\t}\n\t\tfail(\"unterminated JSON array\");\n\t}\n\n\tparseValue(\"$\");\n\tskipWhitespace();\n\tif (index !== text.length) fail(`trailing JSON token near byte ${index}`);\n}\n\n/**\n * Build a strict canonical JSON codec (D84/D87/D96).\n * The strict surface rejects malformed UTF-8, duplicate object keys, non-canonical bytes,\n * unpaired surrogates, and values that cannot round-trip through stable JSON.\n */\nexport function strictJsonCodecFor<T>(): Codec<T> {\n\tconst encoder = new TextEncoder();\n\tconst decoder = new TextDecoder(\"utf-8\", { fatal: true });\n\treturn {\n\t\tencode(value: T): Uint8Array {\n\t\t\tassertNoUnpairedSurrogates(value);\n\t\t\treturn encoder.encode(strictStableJsonString(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): T {\n\t\t\tconst text = decoder.decode(bytes);\n\t\t\tassertNoDuplicateJsonObjectKeys(text);\n\t\t\tconst decoded = JSON.parse(text) as unknown;\n\t\t\tassertNoUnpairedSurrogates(decoded);\n\t\t\tconst canonical = encoder.encode(strictStableJsonString(decoded));\n\t\t\tif (!bytesEqual(bytes, canonical)) {\n\t\t\t\tthrow new TypeError(\"strictJsonCodec: bytes are not canonical stable JSON\");\n\t\t\t}\n\t\t\treturn decoded as T;\n\t\t},\n\t};\n}\n\n/** Default strict canonical JSON codec for unknown values. */\nexport const strictJsonCodec: Codec<unknown> = strictJsonCodecFor<unknown>();\n\n/** D113 neutral helper for strict canonical JSON UTF-8 bytes. */\nexport function strictCanonicalJsonBytes(value: unknown): Uint8Array {\n\treturn strictJsonCodec.encode(value);\n}\n\n/** Validate and normalize a host value into strict canonical JSON data. */\nexport function assertStrictJsonValue(value: unknown, label = \"strictJsonValue\"): StrictJsonValue {\n\ttry {\n\t\treturn strictJsonCodec.decode(strictJsonCodec.encode(value)) as StrictJsonValue;\n\t} catch (cause) {\n\t\tconst message = cause instanceof Error ? cause.message : String(cause);\n\t\tthrow new TypeError(`${label}: value is not strict JSON compatible: ${message}`, { cause });\n\t}\n}\n\n/** Validate and normalize a host value into a strict canonical JSON object. */\nexport function assertStrictJsonObject(\n\tvalue: unknown,\n\tlabel = \"strictJsonObject\",\n): StrictJsonObject {\n\tconst normalized = assertStrictJsonValue(value, label);\n\tif (normalized === null || typeof normalized !== \"object\" || Array.isArray(normalized)) {\n\t\tthrow new TypeError(`${label}: value must be a strict JSON object`);\n\t}\n\treturn normalized as StrictJsonObject;\n}\n","import { strictCanonicalJsonBytes, strictJsonCodec } from \"../json/codec.js\";\n\nexport type NodeVersioningLevel = 0 | 1;\n\n/**\n * D112 V1 node-version hash callback.\n *\n * The callback receives strict canonical JSON UTF-8 DATA bytes, not the raw host value.\n * Runtime V1 versioning encodes DATA with `strictCanonicalJsonBytes(value)` before calling hash.\n */\nexport type NodeVersionHashFn = (bytes: Uint8Array) => string;\n\nexport type NodeVersioningPolicy =\n\t| false\n\t| 0\n\t| 1\n\t| {\n\t\t\tlevel: NodeVersioningLevel;\n\t\t\thash?: NodeVersionHashFn;\n\t  };\n\nexport type ResolvedNodeVersioningPolicy =\n\t| { readonly enabled: false }\n\t| { readonly enabled: true; readonly level: 0 }\n\t| { readonly enabled: true; readonly level: 1; readonly hash: NodeVersionHashFn };\n\nexport type NodeVersionV0 = {\n\treadonly level: 0;\n\treadonly counter: number;\n};\n\nexport type NodeVersionV1 = {\n\treadonly level: 1;\n\treadonly counter: number;\n\treadonly cid: string;\n\treadonly prev: string | null;\n};\n\nexport type NodeVersion = NodeVersionV0 | NodeVersionV1;\n\nexport type NodeVersionJson = NodeVersion;\n\nconst ABSENT_V1_SEED = Object.freeze({\n\t\"@graphrefly/node-version\": \"v1-absent\",\n});\n\nfunction fnv1a64(input: Uint8Array): string {\n\tlet hash = 0xcbf29ce484222325n;\n\tconst prime = 0x100000001b3n;\n\tfor (const byte of input) {\n\t\thash ^= BigInt(byte);\n\t\thash = BigInt.asUintN(64, hash * prime);\n\t}\n\treturn hash.toString(16).padStart(16, \"0\");\n}\n\n/**\n * Default synchronous D112 V1 node-version hash over strict canonical JSON UTF-8 bytes.\n *\n * When hashing a host value directly, encode first:\n * `defaultNodeVersionHash(strictCanonicalJsonBytes(value))`.\n */\nexport function defaultNodeVersionHash(bytes: Uint8Array): string {\n\treturn `fnv1a64:${fnv1a64(bytes)}`;\n}\n\nfunction computeV1Cid(\n\tpolicy: Extract<ResolvedNodeVersioningPolicy, { enabled: true; level: 1 }>,\n\tvalue: unknown,\n): string {\n\treturn policy.hash(strictCanonicalJsonBytes(value));\n}\n\nexport function assertNodeVersionDataCompatible(\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tvalue: unknown,\n): void {\n\tif (!policy.enabled || policy.level === 0) return;\n\tstrictCanonicalJsonBytes(value);\n}\n\nexport function snapshotNodeVersionData(\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tvalue: unknown,\n): unknown {\n\tif (!policy.enabled || policy.level === 0) return value;\n\tconst bytes = strictCanonicalJsonBytes(value);\n\treturn strictJsonCodec.decode(bytes);\n}\n\nexport function resolveNodeVersioningPolicy(\n\tpolicy: NodeVersioningPolicy | undefined,\n): ResolvedNodeVersioningPolicy {\n\tif (policy === false) return { enabled: false };\n\tif (policy === undefined || policy === 0) return { enabled: true, level: 0 };\n\tif (policy === 1) return { enabled: true, level: 1, hash: defaultNodeVersionHash };\n\tif (typeof policy === \"object\" && policy !== null) {\n\t\tif (policy.level === 0) return { enabled: true, level: 0 };\n\t\tif (policy.level === 1) {\n\t\t\treturn { enabled: true, level: 1, hash: policy.hash ?? defaultNodeVersionHash };\n\t\t}\n\t}\n\tthrow new Error(\"node: versioning level must be 0 or 1; V2/V3 are not locked yet (D109)\");\n}\n\nexport function createNodeVersion(\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tinitialValue: unknown = ABSENT_V1_SEED,\n): NodeVersion | undefined {\n\tif (!policy.enabled) return undefined;\n\tif (policy.level === 0) return Object.freeze({ level: 0, counter: 0 });\n\treturn Object.freeze({\n\t\tlevel: 1,\n\t\tcounter: 0,\n\t\tcid: computeV1Cid(policy, initialValue),\n\t\tprev: null,\n\t});\n}\n\nexport function advanceNodeVersion(\n\tcurrent: NodeVersion | undefined,\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tvalue: unknown,\n): NodeVersion | undefined {\n\tif (!policy.enabled) return undefined;\n\tif (current === undefined) return createNodeVersion(policy, value);\n\tif (policy.level === 0) {\n\t\treturn Object.freeze({ level: 0, counter: current.counter + 1 });\n\t}\n\tconst previous = current.level === 1 ? current.cid : null;\n\treturn Object.freeze({\n\t\tlevel: 1,\n\t\tcounter: current.counter + 1,\n\t\tcid: computeV1Cid(policy, value),\n\t\tprev: previous,\n\t});\n}\n\nexport function cloneNodeVersion(version: NodeVersion | undefined): NodeVersion | undefined {\n\tif (version === undefined) return undefined;\n\tif (version.level === 0) return Object.freeze({ level: 0, counter: version.counter });\n\treturn Object.freeze({\n\t\tlevel: 1,\n\t\tcounter: version.counter,\n\t\tcid: version.cid,\n\t\tprev: version.prev,\n\t});\n}\n\nexport function restoredV1Cid(\n\tpolicy: Extract<ResolvedNodeVersioningPolicy, { enabled: true; level: 1 }>,\n\thasData: boolean,\n\tcache: unknown,\n): string {\n\treturn computeV1Cid(policy, hasData ? cache : ABSENT_V1_SEED);\n}\n\nexport function validateNodeVersionJson(value: unknown, path: string): NodeVersionJson {\n\tif (typeof value !== \"object\" || value === null) {\n\t\tthrow new Error(`restoreGraph: ${path} must be an object`);\n\t}\n\tconst record = value as Record<string, unknown>;\n\tif (record.level === 0) {\n\t\tif (!Number.isSafeInteger(record.counter) || (record.counter as number) < 0) {\n\t\t\tthrow new Error(`restoreGraph: ${path}.counter must be a non-negative safe integer`);\n\t\t}\n\t\treturn Object.freeze({ level: 0, counter: record.counter as number });\n\t}\n\tif (record.level === 1) {\n\t\tif (!Number.isSafeInteger(record.counter) || (record.counter as number) < 0) {\n\t\t\tthrow new Error(`restoreGraph: ${path}.counter must be a non-negative safe integer`);\n\t\t}\n\t\tif (typeof record.cid !== \"string\") {\n\t\t\tthrow new Error(`restoreGraph: ${path}.cid must be a string`);\n\t\t}\n\t\tif (record.prev !== null && typeof record.prev !== \"string\") {\n\t\t\tthrow new Error(`restoreGraph: ${path}.prev must be a string or null`);\n\t\t}\n\t\tif ((record.counter as number) === 0 && record.prev !== null) {\n\t\t\tthrow new Error(`restoreGraph: ${path}.prev must be null when counter is 0`);\n\t\t}\n\t\tif ((record.counter as number) > 0 && typeof record.prev !== \"string\") {\n\t\t\tthrow new Error(`restoreGraph: ${path}.prev must be a string when counter is > 0`);\n\t\t}\n\t\treturn Object.freeze({\n\t\t\tlevel: 1,\n\t\t\tcounter: record.counter as number,\n\t\t\tcid: record.cid,\n\t\t\tprev: record.prev,\n\t\t});\n\t}\n\tthrow new Error(`restoreGraph: ${path}.level must be 0 or 1`);\n}\n","/**\n * The node primitive — the thinnest substrate object (R-node-thin / D5).\n *\n * Holds a fn handle + deps + the wave state machine; ZERO inspection cruft\n * (naming/find/describe are the graph layer, CSP-2). Canonical authority:\n * ~/src/graphrefly/spec/rules.jsonl (R-node-*, R-two-phase, R-diamond, R-resolved-undirty,\n * R-first-run-gate, R-push-subscribe, R-rom-ram, R-fn-contract, R-initial, R-ctx-up).\n *\n * Slice 1 = core wave: state node, compute node, two-phase DIRTY->DATA, diamond\n * pending-counter join, first-run gate, substrate-synthesized undirty RESOLVED\n * (R-resolved-undirty / D49 — no equals-substitution; every occurrence is DATA),\n * push-on-subscribe, lazy activation, ROM/RAM. Lifecycle (terminal/INVALIDATE/cleanup),\n * control (PAUSE/async), batch, and dynamicNode land in later slices.\n */\n\nimport {\n\tcurrentBatch,\n\tcurrentBoundaryBatchToken,\n\tdeferAfterBatchForTarget,\n\tdeferToBatch,\n} from \"../batch/batch.js\";\nimport { deferRewire, enterWave, exitWave, scheduleBoundaryDrain } from \"../batch/boundary.js\";\nimport {\n\tCTX_DEP_CACHE,\n\tCTX_NODE_BINDING,\n\ttype Ctx,\n\ttype CtxState,\n\ttype DeliveryMeta,\n\ttype NodeFn,\n\ttype Sink,\n\ttype TerminalData,\n\ttype WaveData,\n} from \"../ctx/types.js\";\nimport { type Dispatcher, defaultDispatcher, type Handle } from \"../dispatcher/index.js\";\nimport { EnvironmentDrivers } from \"../graph/environment.js\";\nimport {\n\terrorPayload,\n\tisDeferredTier,\n\tisInvalidErrorPayload,\n\tisPauseBufferedTier,\n\tisTerminal,\n\tisUpAllowed,\n\tisValueTier,\n\ttype LockId,\n\ttype Message,\n\tmessageTier,\n\ttype PullDemand,\n\tSENTINEL,\n\ttype Wave,\n} from \"../protocol/messages.js\";\nimport {\n\ttype CleanupHooks,\n\ttype ControlState,\n\ttype DepBookkeeping,\n\ttype LifecycleState,\n\tmakeDepBookkeeping,\n\tNodeCore,\n\ttype NodeId,\n\ttype NodeSlot,\n\ttype PrivateState,\n\ttype SyncCtxState,\n\ttype ValueState,\n\ttype VersionState,\n\ttype WaveState,\n} from \"./core.js\";\nimport {\n\tadvanceNodeVersion,\n\tassertNodeVersionDataCompatible,\n\tcloneNodeVersion,\n\tcreateNodeVersion,\n\ttype NodeVersion,\n\ttype NodeVersioningPolicy,\n\tresolveNodeVersioningPolicy,\n\trestoredV1Cid,\n\tsnapshotNodeVersionData,\n} from \"./versioning.js\";\n\nexport type Status =\n\t| \"sentinel\"\n\t| \"pending\"\n\t| \"dirty\"\n\t| \"settled\"\n\t| \"resolved\"\n\t| \"completed\"\n\t| \"errored\";\n\nexport interface NodeOptions<T = unknown> {\n\t/** Pre-populate cache; source pushes [DATA, initial] on subscribe (R-initial). `null` is valid. */\n\tinitial?: T | null;\n\t/** First-run gate off when true; fn body must guard SENTINEL per dep (R-first-run-gate). */\n\tpartial?: boolean;\n\t/** A dep terminal also settles the first-run gate (Reduce-class, R-first-run-gate). */\n\tterminalAsRealInput?: boolean;\n\t/** Auto-emit COMPLETE when ALL deps complete (R-deps-terminal). Default true. */\n\tcompleteWhenDepsComplete?: boolean;\n\t/** Auto-emit ERROR when any dep errors (R-deps-terminal). Default true. */\n\terrorWhenDepsError?: boolean;\n\t/** Allow re-activation after terminal; late subscribe resets the lifecycle (R-terminal). Default false. */\n\tresubscribable?: boolean;\n\t/** Clear cached value on TEARDOWN. Default false. */\n\tresetOnTeardown?: boolean;\n\t/** PAUSE/RESUME behavior (R-pause-modes). Default true. */\n\tpausable?: boolean | \"resumeAll\";\n\t/**\n\t * Pull-mode node (R-pull / D269): a quiet-until-demanded source, identified by this\n\t * author-supplied `pullId` (a unique LockId — a `Symbol` recommended; NOT the node name, NOT a\n\t * bare string if callers may also use strings as pause locks). QUIET by default: it ABSORBS\n\t * an upstream DIRTY WITHOUT relaying it downstream\n\t * (the wedge fix) and does NOT push-on-subscribe its cached value (START only). A DEMAND =\n\t * cone-routed `PULL({pullId, params?})`: a downstream consumer issues\n\t * `ctx.up([[\"PULL\", { pullId, params }]])` (broadcast up the declared cone) or\n\t * `ctx.up(msgs, towardDep)` (directed) WITHOUT holding this node's reference; the PULL travels\n\t * up to the pullId-holder, which fires EXACTLY ONE delivery (DIRTY-before-DATA when it emits)\n\t * then RE-QUIETS (1:1). Delivery content =\n\t * the orthogonal `pausable` mode: `true` → coalesced LATEST (one DATA); `'resumeAll'` → buffered\n\t * BACKLOG. `pullId` + `pausable:false` is REJECTED at construction. A SELF-triggered demand (a\n\t * consumer demanding a dep it ALSO reads) must defer via {@link Ctx.upNext} (R-rewire-deferred /\n\t * D37). Author the pullId as a shared module const used at both this node and the demander's fn.\n\t */\n\tpullId?: LockId;\n\t/** Buffer the last N outgoing DATA for late subscribers (R-replay-buffer). */\n\treplayBuffer?: number;\n\t/**\n\t * D109 node runtime versioning policy. Default is nodev0 (`{level:0,counter}`); `false`\n\t * disables runtime version metadata for this node.\n\t */\n\tversioning?: NodeVersioningPolicy;\n\t/** Mark this as a dynamicNode — fn gets ctx.track(i) for read-selection (R-dynamic-node / D35). */\n\tdynamic?: boolean;\n\t/** Dispatch pool for the fn (R-sync-core). Default sync. */\n\tpool?: \"sync\" | \"async\";\n\t/** Dispatcher to register/invoke against. Default = process-global (D26). */\n\tdispatcher?: Dispatcher;\n\t/** Optional debug name (graph layer owns real naming/inspection). */\n\tname?: string;\n\t/**\n\t * Real operator/source factory name for a STANDALONE graph-less node (D43-reserved; D51).\n\t * The graph index (`_entries`) carries the factory for g.*-registered nodes, so this is only\n\t * read for a node NOT in any graph index — a runtime *Map inner (bare `fromAny`/`initNode`\n\t * node) auto-discovered by `describe` (R-describe / R-edges-derived / D51). Off the canonical\n\t * wave path (R-node-thin intact — a pure annotation, never touched by the wave machinery).\n\t */\n\tfactory?: string;\n}\n\nexport interface NodeCheckpointState {\n\treadonly cache: unknown;\n\treadonly hasData: boolean;\n\treadonly terminal: true | unknown | undefined;\n\treadonly activated: boolean;\n\treadonly hasCalledFnOnce: boolean;\n\treadonly ctxState: { readonly value: unknown; readonly persist: boolean };\n\treadonly version: NodeVersion | undefined;\n\treadonly handle: Handle | null;\n}\n\nexport interface NodeRestoreState {\n\treadonly cache: unknown;\n\treadonly hasData: boolean;\n\treadonly status: Status;\n\treadonly terminal: true | unknown | undefined;\n\treadonly hasCalledFnOnce: boolean;\n\treadonly ctxState: { readonly value: unknown; readonly persist: boolean };\n\treadonly version: NodeVersion | false;\n}\n\ntype TopologyDepsChangedObserver = (\n\tnode: Node<unknown>,\n\tprevDeps: readonly Node<unknown>[],\n\tdeps: readonly Node<unknown>[],\n) => void;\n\nlet constructingCore: NodeCore | undefined;\nlet constructingEnvironment: EnvironmentDrivers | undefined;\nconst ownerTokens = new WeakMap<Node<unknown>, unknown>();\nconst topologyDepsChangedObservers = new WeakMap<Node<unknown>, TopologyDepsChangedObserver>();\nconst checkpointReaders = new WeakMap<Node<unknown>, () => NodeCheckpointState>();\nconst restoreWriters = new WeakMap<Node<unknown>, (state: NodeRestoreState) => void>();\nconst runtimeReleasers = new WeakMap<Node<unknown>, () => void>();\nconst runtimeQuiescenceReaders = new WeakMap<Node<unknown>, () => boolean>();\nconst subscriberCountReaders = new WeakMap<Node<unknown>, () => number>();\nconst activationReaders = new WeakMap<Node<unknown>, () => boolean>();\nconst releasedNodes = new WeakSet<Node<unknown>>();\n\n/** @internal Run a Node/StateNode constructor against a graph-local core without widening the public constructor. */\nexport function withNodeCore<TNode extends Node<unknown>>(\n\tcore: NodeCore,\n\tcreate: () => TNode,\n): TNode {\n\tconst prev = constructingCore;\n\tconstructingCore = core;\n\ttry {\n\t\treturn create();\n\t} finally {\n\t\tconstructingCore = prev;\n\t}\n}\n\n/** @internal Run a Node/StateNode constructor with graph-owned environment drivers (D130/D131). */\nexport function withEnvironmentDrivers<TNode extends Node<unknown>>(\n\tenvironment: EnvironmentDrivers,\n\tcreate: () => TNode,\n): TNode {\n\tconst prev = constructingEnvironment;\n\tconstructingEnvironment = environment;\n\ttry {\n\t\treturn create();\n\t} finally {\n\t\tconstructingEnvironment = prev;\n\t}\n}\n\n/** @internal Graph-domain ownership token for D22 intra-graph guards. */\nexport function getNodeOwner(n: Node<unknown>): unknown {\n\treturn ownerTokens.get(n);\n}\n\n/** @internal Assign graph-domain ownership after graph registration. */\nexport function setNodeOwner(n: Node<unknown>, owner: unknown): void {\n\townerTokens.set(n, owner);\n}\n\n/** @internal Graph-layer D145 topology egress hook. */\nexport function setNodeTopologyDepsChangedObserver(\n\tn: Node<unknown>,\n\tobserver: TopologyDepsChangedObserver,\n): void {\n\ttopologyDepsChangedObservers.set(n, observer);\n}\n\nfunction notifyTopologyDepsChanged(\n\tnode: Node<unknown>,\n\tprevDeps: readonly Node<unknown>[],\n\tdeps: readonly Node<unknown>[],\n): void {\n\ttopologyDepsChangedObservers.get(node)?.(node, prevDeps, deps);\n}\n\n/** @internal Graph checkpoint inspection, kept as a module helper so Node stays method-thin. */\nexport function checkpointStateOfNode(n: Node<unknown>): NodeCheckpointState {\n\tconst read = checkpointReaders.get(n);\n\tif (read === undefined) throw new Error(\"checkpoint: unknown node state\");\n\treturn read();\n}\n\n/** @internal D94 restore commit: install runtime state without a protocol wave or subscription. */\nexport function restoreStateOfNode(n: Node<unknown>, state: NodeRestoreState): void {\n\tconst write = restoreWriters.get(n);\n\tif (write === undefined) throw new Error(\"restoreGraph: unknown node state\");\n\twrite(state);\n}\n\n/** @internal D122 graph-owned ephemeral lifecycle release. */\nexport function releaseRuntimeOfNode(n: Node<unknown>): void {\n\truntimeReleasers.get(n)?.();\n}\n\n/** @internal D124 guard for graph-owned ephemeral lifecycle release. */\nexport function isNodeRuntimeQuiescentForRelease(n: Node<unknown>): boolean {\n\treturn runtimeQuiescenceReaders.get(n)?.() ?? false;\n}\n\n/** @internal D124 graph-owned release subscriber accounting. */\nexport function subscriberCountOfNode(n: Node<unknown>): number {\n\treturn subscriberCountReaders.get(n)?.() ?? 0;\n}\n\n/** @internal D124 graph-owned release internal-subscriber accounting. */\nexport function isNodeActiveForRelease(n: Node<unknown>): boolean {\n\treturn activationReaders.get(n)?.() ?? false;\n}\n\n/** @internal D122 guard for graph-owned ephemeral lifecycle release. */\nexport function isNodeRuntimeReleased(n: Node<unknown>): boolean {\n\treturn releasedNodes.has(n);\n}\n\nfunction terminalView(t: unknown): unknown {\n\treturn t === undefined ? false : t;\n}\n\nfunction normalizePullDemand(demand: PullDemand): PullDemand {\n\tif (typeof demand !== \"object\" || demand === null || Array.isArray(demand)) {\n\t\tthrow new Error(\"ctx.up: PULL requires { pullId, params? } demand payload (D269)\");\n\t}\n\tconst pullId = (demand as { pullId?: unknown }).pullId;\n\tif (typeof pullId !== \"string\" && typeof pullId !== \"symbol\") {\n\t\tthrow new Error(\"ctx.up: PULL demand requires a string or symbol pullId (D269)\");\n\t}\n\tconst params = (demand as { params?: unknown }).params;\n\treturn params === undefined ? { pullId } : { pullId, params };\n}\n\nfunction validateDownPayloads(msgs: Wave): void {\n\tfor (const m of msgs) {\n\t\tif (m[0] === \"DATA\" && m[1] === undefined) {\n\t\t\tthrow new Error(\"down: DATA requires a non-SENTINEL payload (R-data-payload)\");\n\t\t}\n\t\tif (m[0] === \"ERROR\" && isInvalidErrorPayload(m[1])) {\n\t\t\tthrow new Error(\"down: ERROR requires a non-SENTINEL, non-boolean payload (R-data-payload)\");\n\t\t}\n\t}\n}\n\n/** A queued deferred self-rewire op (R-rewire-deferred / D47), drained at the wave boundary. */\ntype RewireOp =\n\t| { kind: \"add\"; dep: Node<unknown>; fn: NodeFn }\n\t| { kind: \"remove\"; dep: Node<unknown>; fn: NodeFn }\n\t| { kind: \"set\"; deps: Node<unknown>[]; fn: NodeFn };\n\n/** Internal routing state for one up-going control wave. */\ntype UpRouteState = {\n\tdemandFired: Map<LockId, Set<Node<unknown>>>;\n};\n\nexport class Node<T = unknown> {\n\tprivate readonly _core: NodeCore;\n\tprivate readonly _id: NodeId;\n\tprivate readonly _slot: NodeSlot<T>;\n\tprivate readonly _dep: DepBookkeeping;\n\tprivate readonly _value: ValueState<T>;\n\tprivate readonly _wave: WaveState;\n\tprivate readonly _control: ControlState;\n\tprivate readonly _lifecycle: LifecycleState;\n\tprivate readonly _privateState: PrivateState;\n\tprivate readonly _hooks: CleanupHooks;\n\tprivate readonly _syncCtxState: SyncCtxState;\n\tprivate readonly _version: VersionState;\n\tprivate _restoredActivationPending = false;\n\tprivate _released = false;\n\n\tprivate get _syncCtx(): Ctx | null {\n\t\treturn this._syncCtxState.value;\n\t}\n\n\tprivate set _syncCtx(ctx: Ctx | null) {\n\t\tthis._syncCtxState.value = ctx;\n\t}\n\n\tconstructor(\n\t\tdeps: Node<unknown>[],\n\t\thandleOrFn: Handle | NodeFn | null,\n\t\topts: NodeOptions<T> = {},\n\t) {\n\t\tconst core = constructingCore;\n\t\tconstructingCore = undefined;\n\t\tconst dispatcher = opts.dispatcher ?? defaultDispatcher;\n\t\tconst environment = constructingEnvironment ?? EnvironmentDrivers.empty();\n\t\tconstructingEnvironment = undefined;\n\t\tconst pool = opts.pool ?? \"sync\";\n\t\tconst pausable = opts.pausable ?? true;\n\t\tconst pullLock = opts.pullId;\n\t\tconst pull = opts.pullId !== undefined;\n\t\t// R-pull (D269): pull-mode is keyed by an author-supplied pullId (its quiet latch).\n\t\t// R-pull (D55, pin 3): pull still uses the pausable delivery-content axis; pausable:false\n\t\t// ignores PAUSE/RESUME buffering and contradicts quiet pull delivery. Reject at construction.\n\t\tif (pull && pausable === false)\n\t\t\tthrow new Error(\n\t\t\t\t\"node: pullId is incompatible with pausable:false — a pull node uses the pausable delivery-content axis (R-pull / R-pause-modes / D55,D269)\",\n\t\t\t);\n\n\t\tlet handle: Handle | null;\n\t\tif (handleOrFn === null) handle = null;\n\t\telse if (typeof handleOrFn === \"function\") handle = dispatcher.register(handleOrFn, pool);\n\t\telse handle = handleOrFn;\n\n\t\tconst n = deps.length;\n\t\tconst dep = makeDepBookkeeping(n);\n\t\tconst versioning = resolveNodeVersioningPolicy(opts.versioning);\n\t\tconst value = {\n\t\t\tcache: SENTINEL as T | undefined,\n\t\t\thasData: false,\n\t\t\tstatus: \"sentinel\" as Status,\n\t\t\tterminal: undefined,\n\t\t\thasTorndown: false,\n\t\t\treplayRing: [] as T[],\n\t\t};\n\t\tif (opts.initial !== undefined) {\n\t\t\tvalue.cache = opts.initial as T;\n\t\t\tvalue.hasData = true;\n\t\t\tvalue.status = \"settled\";\n\t\t}\n\t\tconst pauseLockset = new Set<unknown>();\n\t\tthis._core = core ?? new NodeCore();\n\t\tconst created = this._core.createSlot<T>(\n\t\t\t{\n\t\t\t\tdeps,\n\t\t\t\thandle,\n\t\t\t\tpool,\n\t\t\t\tdispatcher,\n\t\t\t\tenvironment,\n\t\t\t\tpartial: opts.partial ?? false,\n\t\t\t\tterminalAsRealInput: opts.terminalAsRealInput ?? false,\n\t\t\t\tcompleteWhenDepsComplete: opts.completeWhenDepsComplete ?? true,\n\t\t\t\terrorWhenDepsError: opts.errorWhenDepsError ?? true,\n\t\t\t\tresubscribable: opts.resubscribable ?? false,\n\t\t\t\tresetOnTeardown: opts.resetOnTeardown ?? false,\n\t\t\t\tpausable,\n\t\t\t\tpull,\n\t\t\t\tpullLock,\n\t\t\t\treplayN: opts.replayBuffer ?? 0,\n\t\t\t\tdynamic: opts.dynamic ?? false,\n\t\t\t\tname: opts.name,\n\t\t\t\tfactory: opts.factory,\n\t\t\t},\n\t\t\t{\n\t\t\t\tdep,\n\t\t\t\tlifecycle: { subscribers: new Set<Sink>(), activated: false },\n\t\t\t\tvalue,\n\t\t\t\twave: {\n\t\t\t\t\tpending: 0,\n\t\t\t\t\thasCalledFnOnce: false,\n\t\t\t\t\temittedDirtyThisWave: false,\n\t\t\t\t\temittedSettleThisWave: false,\n\t\t\t\t\tinsideRunWave: false,\n\t\t\t\t\tinDepMutation: false,\n\t\t\t\t\trewireRunPending: false,\n\t\t\t\t\tbatchDirtyOwed: false,\n\t\t\t\t},\n\t\t\t\tcontrol: {\n\t\t\t\t\tpauseLockset,\n\t\t\t\t\tpausedDepWaveOccurred: false,\n\t\t\t\t\tpauseBuffer: [],\n\t\t\t\t\tdemandOwed: undefined,\n\t\t\t\t\tactivePull: undefined,\n\t\t\t\t\tpullDirtyOwed: false,\n\t\t\t\t\tinDeliverDemand: false,\n\t\t\t\t},\n\t\t\t\tprivateState: { value: SENTINEL, persist: false },\n\t\t\t\thooks: { onDeactivation: [], onInvalidate: [] },\n\t\t\t\tsyncCtx: { value: null },\n\t\t\t\tversion: {\n\t\t\t\t\tpolicy: versioning,\n\t\t\t\t\tvalue: createNodeVersion(\n\t\t\t\t\t\tversioning,\n\t\t\t\t\t\topts.initial !== undefined ? opts.initial : undefined,\n\t\t\t\t\t),\n\t\t\t\t},\n\t\t\t},\n\t\t);\n\t\tthis._id = created.id;\n\t\tthis._slot = this._core.get<T>(this._id);\n\t\tthis._dep = this._core.getDep(this._id);\n\t\tthis._value = this._core.getValue<T>(this._id);\n\t\tthis._wave = this._core.getWave(this._id);\n\t\tthis._control = this._core.getControl(this._id);\n\t\tthis._lifecycle = this._core.getLifecycle(this._id);\n\t\tthis._privateState = this._core.getPrivateState(this._id);\n\t\tthis._hooks = this._core.getHooks(this._id);\n\t\tthis._syncCtxState = this._core.getSyncCtx(this._id);\n\t\tthis._version = this._core.getVersion(this._id);\n\t\tcheckpointReaders.set(this as Node<unknown>, () => ({\n\t\t\tcache: this._value.cache,\n\t\t\thasData: this._value.hasData,\n\t\t\tterminal: this._value.terminal,\n\t\t\tactivated: this._lifecycle.activated,\n\t\t\thasCalledFnOnce: this._wave.hasCalledFnOnce,\n\t\t\tctxState: {\n\t\t\t\tvalue: this._privateState.value,\n\t\t\t\tpersist: this._privateState.persist,\n\t\t\t},\n\t\t\tversion: cloneNodeVersion(this._version.value),\n\t\t\thandle: this._slot.handle,\n\t\t}));\n\t\trestoreWriters.set(this as Node<unknown>, (state) => {\n\t\t\tthis._assertNotReleased(\"restoreGraph\");\n\t\t\tthis._value.cache = state.cache as T;\n\t\t\tthis._value.hasData = state.hasData;\n\t\t\tthis._value.status = state.status;\n\t\t\tthis._value.terminal = state.terminal;\n\t\t\tthis._value.hasTorndown = false;\n\t\t\tthis._value.replayRing = [];\n\t\t\tthis._wave.hasCalledFnOnce = state.hasCalledFnOnce;\n\t\t\tthis._wave.emittedDirtyThisWave = false;\n\t\t\tthis._wave.emittedSettleThisWave = false;\n\t\t\tthis._wave.pending = 0;\n\t\t\tthis._wave.insideRunWave = false;\n\t\t\tthis._wave.inDepMutation = false;\n\t\t\tthis._wave.rewireRunPending = false;\n\t\t\tthis._wave.batchDirtyOwed = false;\n\t\t\tthis._control.pauseBuffer = [];\n\t\t\tthis._control.pausedDepWaveOccurred = false;\n\t\t\tthis._control.demandOwed = undefined;\n\t\t\tthis._control.activePull = undefined;\n\t\t\tthis._control.pullDirtyOwed = false;\n\t\t\tthis._control.inDeliverDemand = false;\n\t\t\tthis._control.pauseLockset.clear();\n\t\t\tthis._privateState.value = state.ctxState.value;\n\t\t\tthis._privateState.persist = state.ctxState.persist;\n\t\t\tif (state.version === false) {\n\t\t\t\tthis._version.policy = { enabled: false };\n\t\t\t\tthis._version.value = undefined;\n\t\t\t} else if (state.version.level === 0) {\n\t\t\t\tthis._version.policy = { enabled: true, level: 0 };\n\t\t\t\tthis._version.value = cloneNodeVersion(state.version);\n\t\t\t} else {\n\t\t\t\tif (!this._version.policy.enabled || this._version.policy.level !== 1) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t`restoreGraph: checkpoint node version level ${state.version.level} requires matching node versioning policy`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\t// D109: V1 restore must match the selected hash lane. After DATA then\n\t\t\t\t// INVALIDATE/resetOnTeardown, cache is absent while cid remains the last DATA cid;\n\t\t\t\t// without the DATA value, restore cannot verify the lane, so fail honestly.\n\t\t\t\tif (!state.hasData && state.version.counter > 0) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"restoreGraph: checkpoint node version cid cannot be verified without current DATA under V1 versioning (D109)\",\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tconst expectedCid = restoredV1Cid(this._version.policy, state.hasData, state.cache);\n\t\t\t\tif (expectedCid !== state.version.cid) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"restoreGraph: checkpoint node version cid does not match the selected node versioning hash policy (D109)\",\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tthis._version.value = cloneNodeVersion(state.version);\n\t\t\t}\n\t\t\tthis._syncCtx = null;\n\t\t\tthis._resetDepState();\n\t\t\t// A fresh restored graph has no subscribers before return. Keep activation closed so the\n\t\t\t// first real subscriber wires deps normally; D94's preserved lifecycle bit is the first-run\n\t\t\t// gate (`hasCalledFnOnce`), not a hidden subscription graph.\n\t\t\tthis._lifecycle.activated = false;\n\t\t\tthis._lifecycle.subscribers.clear();\n\t\t\tthis._restoredActivationPending = true;\n\t\t});\n\t\truntimeReleasers.set(this as Node<unknown>, () => this._releaseRuntime());\n\t\truntimeQuiescenceReaders.set(this as Node<unknown>, () => this._isRuntimeQuiescentForRelease());\n\t\tsubscriberCountReaders.set(this as Node<unknown>, () => this._subscriberCount());\n\t\tactivationReaders.set(this as Node<unknown>, () => this._lifecycle.activated);\n\t}\n\n\t/** R-pull (D55/D272): true while a pull node is not serving a PULL demand pulse. */\n\tprivate _isPullQuiet(): boolean {\n\t\treturn this._slot.pull && this._control.activePull === undefined;\n\t}\n\n\t/**\n\t * R-pull (D269/D272): this pull node's pullId (pure data, like {@link cache}/{@link handle} —\n\t * never triggers computation). A consumer demands one delivery by cone-routing PULL of it (no\n\t * node reference): `ctx.up([[\"PULL\", { pullId }]])` (immediate; loops back → D37 for a self-read\n\t * dep) or `ctx.upNext([[\"PULL\", { pullId }]])` (boundary-deferred self-demand). Undefined for a\n\t * non-pull node. The author writes the pullId verbatim; routing matches by identity.\n\t */\n\tget pullId(): LockId | undefined {\n\t\treturn this._slot.pullLock;\n\t}\n\n\tget cache(): T | undefined {\n\t\treturn this._value.cache;\n\t}\n\n\tget status(): Status {\n\t\treturn this._value.status;\n\t}\n\n\tget version(): NodeVersion | undefined {\n\t\treturn cloneNodeVersion(this._version.value);\n\t}\n\n\tget name(): string | undefined {\n\t\treturn this._slot.name;\n\t}\n\n\t/** R-describe/D51: real factory name for a standalone graph-less node (a runtime *Map inner). */\n\tget factory(): string | undefined {\n\t\treturn this._slot.factory;\n\t}\n\n\t/**\n\t * The node's CURRENT/LIVE deps (R-describe / R-edges-derived / D51) — readonly view of the\n\t * live `_deps`, which a rewire (C-8 / C-11) mutates. The graph's describe() reads this (NOT a\n\t * construction-time snapshot) so every edge corresponds to a real current subscription (D3).\n\t * Inspection-only, like cache/status; never triggers computation.\n\t */\n\tget deps(): readonly Node<unknown>[] {\n\t\treturn this._slot.deps;\n\t}\n\n\t/**\n\t * The fn handle (pure data `(poolId, handleId)`, D7) or null for state/passthrough\n\t * nodes. Inspection-only (L1.6 handle is referenceable/inspectable) — lets the graph\n\t * layer key a dispatcher-backed profile recorder WITHOUT putting counters on the node\n\t * (R-node-thin / D39).\n\t */\n\tget handle(): Handle | null {\n\t\treturn this._slot.handle;\n\t}\n\n\t/** R-push-subscribe: a new sink receives START, then cached DATA (or DIRTY if dirty). */\n\tsubscribe(sink: Sink): () => void {\n\t\tthis._assertNotReleased(\"subscribe\");\n\t\t// Wave-owner boundary (R-rewire-deferred / D47): the activation cascade can run fns that\n\t\t// issue ctx.rewireNext; the OUTERMOST exit drains them. Nested subscribes (dep wiring)\n\t\t// just inc/dec the depth.\n\t\tenterWave();\n\t\ttry {\n\t\t\t// R-terminal: late subscribe to a terminal node either resets (resubscribable)\n\t\t\t// or is rejected (non-resubscribable, R2.2.7.b).\n\t\t\tif (this._value.terminal !== undefined) {\n\t\t\t\tif (this._slot.resubscribable) {\n\t\t\t\t\tthis._restoredActivationPending = false;\n\t\t\t\t\tthis._resetLifecycle();\n\t\t\t\t} else\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"subscribe: node is non-resubscribable and has terminated; the stream is permanently over (R-terminal / R2.2.7.b)\",\n\t\t\t\t\t);\n\t\t\t}\n\n\t\t\tthis._lifecycle.subscribers.add(sink);\n\t\t\tsink([\"START\"]);\n\t\t\tif (this._slot.replayN > 0 && this._value.replayRing.length > 0) {\n\t\t\t\t// R-replay-buffer: late subscriber gets the last N DATA after START.\n\t\t\t\tfor (const v of this._value.replayRing) sink([\"DATA\", v]);\n\t\t\t} else if (this._value.hasData && !this._slot.pull) {\n\t\t\t\t// R-pull (D55): a pull node NEVER push-on-subscribes its cached value — quiet by\n\t\t\t\t// default, it stays silent until demanded (START only). QA-B4: gated on `_pull`, not\n\t\t\t\t// activePull, so a REACTIVATED pull node still does not leak its cache.\n\t\t\t\tsink([\"DATA\", this._value.cache]);\n\t\t\t} else if (this._value.status === \"dirty\" && !this._slot.pull) {\n\t\t\t\tsink([\"DIRTY\"]);\n\t\t\t}\n\n\t\t\tif (!this._lifecycle.activated) this._activate();\n\n\t\t\treturn () => {\n\t\t\t\tif (!this._lifecycle.subscribers.delete(sink)) return;\n\t\t\t\tif (this._lifecycle.subscribers.size === 0) this._deactivate();\n\t\t\t};\n\t\t} finally {\n\t\t\texitWave();\n\t\t}\n\t}\n\n\t/** External emission toward sinks (state-node push, or async late-emit). One call = one wave. */\n\tdown(msgs: Wave): void {\n\t\tthis._assertNotReleased(\"down\");\n\t\t// Wave-owner boundary (D47): a state.set / external push that drives a fn issuing\n\t\t// ctx.rewireNext drains at this outermost exit.\n\t\tenterWave();\n\t\ttry {\n\t\t\tthis._down(msgs);\n\t\t} finally {\n\t\t\texitWave();\n\t\t}\n\t}\n\n\t/**\n\t * Emit upstream toward deps — control tiers only (R-ctx-up). `towardDep` (a dep index) routes up\n\t * ONE declared edge (R-up-routing directed-up); omitted = broadcast up all deps.\n\t */\n\tup(msgs: Wave, towardDep?: number): void {\n\t\tthis._assertNotReleased(\"up\");\n\t\t// Wave-owner boundary (D47). Internal dep-forwarding calls dep.up() nest under this.\n\t\tenterWave();\n\t\ttry {\n\t\t\tthis._up(msgs, towardDep);\n\t\t} finally {\n\t\t\texitWave();\n\t\t}\n\t}\n\n\t// ── deferred self-rewire (R-rewire-deferred / D47): ctx.rewireNext drain support ──\n\n\t/**\n\t * Enqueue a deferred self-rewire op (issued from this node's fn via `ctx.rewireNext`).\n\t * Applied at the committed wave boundary (boundary.ts drain), never in place — the in-fn\n\t * immediate path (`subscribeDep`/`replaceDeps`/`unsubscribeDep`) still throws mid-run (D37/R-reentrancy).\n\t */\n\tprivate _requestRewireNext(op: RewireOp): void {\n\t\tdeferRewire(this._core, () => this._applyRewireNext(op), {\n\t\t\tbatchToken: currentBoundaryBatchToken(),\n\t\t\tisReady: () => !this._hasBoundaryPauseLock(),\n\t\t});\n\t}\n\n\t/**\n\t * Enqueue a deferred up-going control/demand wave (R-up-routing / R-pull / D269): at the committed wave\n\t * boundary, route `msgs` up from THIS node (broadcast, or up the single `towardDep` edge). The\n\t * deferred form of `ctx.up` — the SELF-demand path: a consumer issues `ctx.upNext([[PULL,\n\t * { pullId }]])` to demand a dep it ALSO reads; the demand applies at the boundary (not mid-fn), so\n\t * the pull node's delivery loops back as a FRESH wave rather than re-entering the consumer (D37 /\n\t * R-reentrancy). Rides the same R-rewire-deferred (D47) drain as ctx.rewireNext.\n\t */\n\tprivate _requestUpNext(msgs: Wave, towardDep?: number): void {\n\t\tdeferRewire(\n\t\t\tthis._core,\n\t\t\t() => {\n\t\t\t\tif (!this._released) this._up(msgs, towardDep);\n\t\t\t},\n\t\t\t{\n\t\t\t\tbatchToken: currentBoundaryBatchToken(),\n\t\t\t\tisReady: () => !this._hasBoundaryPauseLock(),\n\t\t\t},\n\t\t);\n\t}\n\n\t/** Apply one queued self-rewire at the boundary (drain thunk). */\n\tprivate _applyRewireNext(op: RewireOp): void {\n\t\tif (this._released) return;\n\t\ttry {\n\t\t\t// D62 / R-rewire-deferred: terminal seals output but does NOT cancel queued topology.\n\t\t\t// Public/immediate rewire of a terminal node still rejects; the exception is only for\n\t\t\t// self-triggered ops already issued before terminal and now draining at the boundary.\n\t\t\tif (op.kind === \"add\") {\n\t\t\t\tconst next = this._slot.deps.includes(op.dep)\n\t\t\t\t\t? [...this._slot.deps]\n\t\t\t\t\t: [...this._slot.deps, op.dep];\n\t\t\t\tthis._rewire(next, op.fn, { allowTerminalOwner: true });\n\t\t\t} else if (op.kind === \"remove\") {\n\t\t\t\tthis._rewire(\n\t\t\t\t\tthis._slot.deps.filter((d) => d !== op.dep),\n\t\t\t\t\top.fn,\n\t\t\t\t\t{ allowTerminalOwner: true },\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\tthis._rewire(this._dedupDeps(op.deps), op.fn, { allowTerminalOwner: true });\n\t\t\t}\n\t\t} catch (e) {\n\t\t\t// An invalid deferred op (cycle / self / non-resubscribable terminal dep) surfaces as\n\t\t\t// an ERROR on this node (D30-consistent) rather than stranding the rest of the drain\n\t\t\t// queue. Reachable only on misuse — higher-order operator inners are fresh, acyclic\n\t\t\t// leaf sources. Coerce a SENTINEL reason (a rewire fn that `throw undefined`s) to a real\n\t\t\t// Error so _down's R-data-payload guard does not itself throw out of the drain.\n\t\t\tthis._down([[\"ERROR\", errorPayload(e, \"rewireNext op failed\")]]);\n\t\t}\n\t}\n\n\t// ── rewire (R-rewire / D42): intra-graph runtime topology mutation ──\n\n\t/**\n\t * Replace this node's deps atomically (surgical, Option-C). Requires an explicit\n\t * `fn` (SD-1 fn-deps pairing — user fns read dep input positionally). Kept deps\n\t * keep their subscription + per-dep state; only removed deps unsubscribe and only\n\t * added deps fresh-subscribe (push-on-subscribe for an added cached dep). The\n\t * first-run gate and cache are PRESERVED (R-rewire Q2/Q7). Intra-graph only (D22).\n\t */\n\treplaceDeps(newDeps: Node<unknown>[], fn: NodeFn): void {\n\t\tthis._assertNotReleased(\"replaceDeps\");\n\t\tthis._rewire(this._dedupDeps(newDeps), fn);\n\t}\n\n\t/** Subscribe to one dep (special case of replaceDeps); returns its index. fn required (SD-1). */\n\tsubscribeDep(depNode: Node<unknown>, fn: NodeFn): number {\n\t\tthis._assertNotReleased(\"subscribeDep\");\n\t\tconst next = this._slot.deps.includes(depNode)\n\t\t\t? [...this._slot.deps]\n\t\t\t: [...this._slot.deps, depNode];\n\t\tconst deferred = this._rewire(next, fn);\n\t\treturn deferred ? next.indexOf(depNode) : this._slot.deps.indexOf(depNode);\n\t}\n\n\t/** Unsubscribe from one dep (special case of replaceDeps); idempotent if absent (fn swap still applies). */\n\tunsubscribeDep(depNode: Node<unknown>, fn: NodeFn): void {\n\t\tthis._assertNotReleased(\"unsubscribeDep\");\n\t\tthis._rewire(\n\t\t\tthis._slot.deps.filter((d) => d !== depNode),\n\t\t\tfn,\n\t\t);\n\t}\n\n\tprivate _dedupDeps(deps: Node<unknown>[]): Node<unknown>[] {\n\t\tconst seen = new Set<Node<unknown>>();\n\t\tconst out: Node<unknown>[] = [];\n\t\tfor (const d of deps)\n\t\t\tif (!seen.has(d)) {\n\t\t\t\tseen.add(d);\n\t\t\t\tout.push(d);\n\t\t\t}\n\t\treturn out;\n\t}\n\n\t/** Is `target` reachable upstream from `from` (following deps)? Cycle-prevention DFS. */\n\tprivate _reachableUpstream(from: Node<unknown>, target: Node<unknown>): boolean {\n\t\tconst seen = new Set<Node<unknown>>();\n\t\tconst stack: Node<unknown>[] = [from];\n\t\twhile (stack.length > 0) {\n\t\t\tconst n = stack.pop();\n\t\t\tif (n === undefined) continue;\n\t\t\tif (n === target) return true;\n\t\t\tif (seen.has(n)) continue;\n\t\t\tseen.add(n);\n\t\t\tfor (const d of n._slot.deps) stack.push(d);\n\t\t}\n\t\treturn false;\n\t}\n\n\tprivate _assertRewireDepOwner(dep: Node<unknown>): void {\n\t\tconst selfOwner = getNodeOwner(this as unknown as Node<unknown>);\n\t\tconst depOwner = getNodeOwner(dep);\n\t\tif (selfOwner !== undefined && depOwner !== undefined && selfOwner !== depOwner) {\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: dep belongs to a different graph; cross-graph deps require a wire bridge (D22 / R-graph-domain)\",\n\t\t\t);\n\t\t}\n\t}\n\n\tprivate _rewire(\n\t\tnewDeps: Node<unknown>[],\n\t\tfn: NodeFn,\n\t\topts: { allowTerminalOwner?: boolean } = {},\n\t): boolean {\n\t\t// ── rejects (R-rewire / D42) ──\n\t\tif (this._value.terminal !== undefined && !opts.allowTerminalOwner)\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: node is terminal (completed/errored) — cannot rewire (R-rewire / D42)\",\n\t\t\t);\n\t\tif (this._wave.insideRunWave)\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: mid-fn topology mutation — a fn mutating its own deps mid-wave is the feedback cycle (R-rewire / D37)\",\n\t\t\t);\n\t\tif (this._wave.inDepMutation)\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: reentrant dep mutation — another replaceDeps/subscribeDep/unsubscribeDep is in flight (R-rewire)\",\n\t\t\t);\n\t\tif (newDeps.includes(this as unknown as Node<unknown>))\n\t\t\tthrow new Error(\"rewire: self-dependency rejected (R-rewire / D42)\");\n\t\tconst oldDeps = this._slot.deps;\n\t\tconst added = newDeps.filter((d) => !oldDeps.includes(d));\n\t\tfor (const d of added) {\n\t\t\tif (this._reachableUpstream(d, this as unknown as Node<unknown>))\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"rewire: would create a cycle — dep already transitively depends on this node (R-rewire / D42)\",\n\t\t\t\t);\n\t\t\tif (d._value.terminal !== undefined && !d._slot.resubscribable)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"rewire: cannot add a non-resubscribable terminal dep — would wedge (R-rewire / D42)\",\n\t\t\t\t);\n\t\t\tthis._assertRewireDepOwner(d);\n\t\t}\n\n\t\tif (\n\t\t\tdeferAfterBatchForTarget(this, () => {\n\t\t\t\tthis._rewire(newDeps, fn, { ...opts, allowTerminalOwner: true });\n\t\t\t})\n\t\t) {\n\t\t\treturn true;\n\t\t}\n\t\tif (!this._lifecycle.activated) this._restoredActivationPending = false;\n\n\t\tthis._wave.inDepMutation = true;\n\t\tthis._wave.rewireRunPending = false;\n\t\tlet zeroDepUnDirty = false;\n\t\ttry {\n\t\t\t// fn swap (SD-1): re-register against the same pool, then release the old handle\n\t\t\t// (B15) so the rewired-away fn closure is GC'd and its dispatcher slot is reused —\n\t\t\t// a rewire-heavy graph (CSP-2.7 *Map) no longer leaks a handle per swap. Register\n\t\t\t// first, then unregister the old: this._slot.handle never points at a freed slot, and a\n\t\t\t// null old handle (a passthrough/state node gaining a fn) has nothing to free.\n\t\t\tconst oldHandle = this._slot.handle;\n\t\t\tthis._slot.handle = this._slot.dispatcher.register(fn, this._slot.pool);\n\t\t\tif (oldHandle !== null) this._slot.dispatcher.unregister(oldHandle);\n\n\t\t\tconst removed = oldDeps.filter((d) => !newDeps.includes(d));\n\t\t\tlet removedDirtyContributor = false;\n\t\t\tfor (const d of removed) {\n\t\t\t\tconst oldIdx = oldDeps.indexOf(d);\n\t\t\t\tif (this._dep.dirty[oldIdx]) {\n\t\t\t\t\tremovedDirtyContributor = true;\n\t\t\t\t\tthis._wave.pending--;\n\t\t\t\t}\n\t\t\t\tif (this._lifecycle.activated) {\n\t\t\t\t\tconst box = this._dep.idxBoxes[oldIdx];\n\t\t\t\t\tif (box) box.v = -1; // drain: any stale in-flight callback drops\n\t\t\t\t\tconst unsub = this._dep.unsubs[oldIdx];\n\t\t\t\t\tif (unsub) unsub(); // stops the removed dep's edge — no further delivery\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Rebuild per-dep parallel arrays in newDeps order; kept deps carry their state\n\t\t\t// + subscription, added deps start fresh (R-rewire Q1/Q4).\n\t\t\tconst n = newDeps.length;\n\t\t\tconst newBatch: Array<unknown[] | null> = new Array(n).fill(null);\n\t\t\tconst newPrev: unknown[] = new Array(n).fill(SENTINEL);\n\t\t\tconst newHasData: boolean[] = new Array(n).fill(false);\n\t\t\tconst newDirty: boolean[] = new Array(n).fill(false);\n\t\t\tconst newTier: number[] = new Array(n).fill(0);\n\t\t\tconst newTerminal: Array<true | unknown | undefined> = new Array(n).fill(undefined);\n\t\t\tconst newTerminalInput: Array<true | unknown | undefined> = new Array(n).fill(undefined);\n\t\t\tconst newUnsubs: Array<() => void> = new Array(n);\n\t\t\tconst newBoxes: Array<{ v: number }> = new Array(n);\n\t\t\tfor (let j = 0; j < n; j++) {\n\t\t\t\tconst oldIdx = oldDeps.indexOf(newDeps[j]);\n\t\t\t\tif (oldIdx !== -1) {\n\t\t\t\t\tnewBatch[j] = this._dep.batch[oldIdx];\n\t\t\t\t\tnewPrev[j] = this._dep.prev[oldIdx];\n\t\t\t\t\tnewHasData[j] = this._dep.hasData[oldIdx];\n\t\t\t\t\tnewDirty[j] = this._dep.dirty[oldIdx];\n\t\t\t\t\tnewTier[j] = this._dep.tier[oldIdx];\n\t\t\t\t\tnewTerminal[j] = this._dep.terminal[oldIdx];\n\t\t\t\t\tnewUnsubs[j] = this._dep.unsubs[oldIdx];\n\t\t\t\t\t// carry the kept dep's subscription box and point it at the new index (O(1) reroute)\n\t\t\t\t\tconst box = this._dep.idxBoxes[oldIdx];\n\t\t\t\t\tif (box) box.v = j;\n\t\t\t\t\tnewBoxes[j] = box;\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis._slot.deps = newDeps;\n\t\t\tthis._dep.batch = newBatch;\n\t\t\tthis._dep.prev = newPrev;\n\t\t\tthis._dep.hasData = newHasData;\n\t\t\tthis._dep.dirty = newDirty;\n\t\t\tthis._dep.tier = newTier;\n\t\t\tthis._dep.terminal = newTerminal;\n\t\t\tthis._dep.terminalInput = newTerminalInput;\n\t\t\tthis._dep.unsubs = newUnsubs;\n\t\t\tthis._dep.idxBoxes = newBoxes;\n\t\t\tthis._dep.waveData = newDeps.map(() => []);\n\t\t\tthis._dep.waveTokens = new Array(newDeps.length).fill(undefined);\n\t\t\tthis._syncCtx = null;\n\n\t\t\t// Subscribe added deps — push-on-subscribe (R-push-subscribe) delivers a cached\n\t\t\t// dep's DATA here, which drives _maybeRun; a SENTINEL dep delivers START only.\n\t\t\tif (this._lifecycle.activated) {\n\t\t\t\tfor (const d of added) this._subscribeDepAt(d);\n\t\t\t}\n\t\t\tnotifyTopologyDepsChanged(this as unknown as Node<unknown>, oldDeps, newDeps);\n\n\t\t\t// Q6 auto-settle: removing the sole dirty contributor closes the wave. With deps\n\t\t\t// remaining, request the atomic settle (recompute → DATA for a value; a no-emit fn\n\t\t\t// gets a substrate-synthesized undirty RESOLVED per R-resolved-undirty/D49 — NOT\n\t\t\t// equals-absorption, which is gone). With zero deps the node is inert (degenerate\n\t\t\t// fn-no-deps) — just un-dirty downstream. Cache is preserved either way (Q7).\n\t\t\tif (removedDirtyContributor && this._wave.pending === 0 && this._value.status === \"dirty\") {\n\t\t\t\tif (newDeps.length > 0) this._wave.rewireRunPending = true;\n\t\t\t\telse zeroDepUnDirty = true;\n\t\t\t}\n\t\t} finally {\n\t\t\tthis._wave.inDepMutation = false;\n\t\t}\n\n\t\t// Atomic post-mutation settle (outside the reentrancy guard so a fresh wave runs\n\t\t// normally): ONE two-phase DIRTY→DATA recompute if any added dep delivered data or a\n\t\t// sole-dirty dep was removed; else the zero-dep un-dirty via _down (pause/batch-safe).\n\t\tif (this._wave.rewireRunPending) {\n\t\t\tthis._wave.rewireRunPending = false;\n\t\t\tthis._settleRewire();\n\t\t} else if (zeroDepUnDirty) {\n\t\t\tif (this._wave.emittedDirtyThisWave) this._down([[\"RESOLVED\"]]);\n\t\t\telse this._value.status = this._value.hasData ? \"settled\" : \"sentinel\";\n\t\t}\n\t\treturn false;\n\t}\n\n\t// ── activation / deactivation (lazy; R-rom-ram) ──\n\n\tprivate _activate(): void {\n\t\tthis._lifecycle.activated = true;\n\t\tconst seedRestoredDeps = this._restoredActivationPending;\n\t\tthis._restoredActivationPending = false;\n\t\t// R-pull (D55/D272): activePull is undefined before wiring deps, so each dep's\n\t\t// push-on-subscribe DIRTY/DATA is absorbed quietly, not relayed downstream.\n\t\tthis._dep.unsubs = new Array(this._slot.deps.length);\n\t\tthis._dep.idxBoxes = new Array(this._slot.deps.length);\n\t\tfor (const dep of this._slot.deps)\n\t\t\tthis._subscribeDepAt(dep, { seedRestored: seedRestoredDeps });\n\t\t// Depless producer (fn, no deps): run once on activation.\n\t\tif (this._slot.deps.length === 0 && this._slot.handle !== null && !this._wave.hasCalledFnOnce) {\n\t\t\tthis._runWave();\n\t\t}\n\t}\n\n\t/**\n\t * Subscribe to a dep. The dispatch callback reads the dep's CURRENT index from a\n\t * mutable box (O(1)); a surgical rewire that reorders kept deps just updates the box\n\t * (R-rewire Option-C / D42) — no re-subscribe, no per-message indexOf scan. A removed\n\t * dep's box is set to -1 so any stale in-flight callback drops (drain).\n\t */\n\tprivate _subscribeDepAt(depNode: Node<unknown>, opts: { seedRestored?: boolean } = {}): void {\n\t\tconst idx0 = this._slot.deps.indexOf(depNode);\n\t\tconst box = { v: idx0 };\n\t\tlet ignoreInitialPush = opts.seedRestored === true;\n\t\tif (ignoreInitialPush && idx0 !== -1) {\n\t\t\tthis._seedRestoredDepAt(idx0, depNode);\n\t\t\tif (depNode._value.terminal !== undefined && !depNode._slot.resubscribable) {\n\t\t\t\tthis._dep.unsubs[idx0] = () => {};\n\t\t\t\tthis._dep.idxBoxes[idx0] = box;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tconst unsub = depNode.subscribe((msg, delivery) => {\n\t\t\tif (ignoreInitialPush && delivery === undefined) return;\n\t\t\tif (ignoreInitialPush) ignoreInitialPush = false;\n\t\t\tif (box.v === -1) return; // dep removed — stale callback, drop (drain)\n\t\t\tthis._receiveFromDep(box.v, msg, delivery);\n\t\t});\n\t\tif (ignoreInitialPush && idx0 !== -1 && box.v !== -1) this._seedRestoredDepAt(idx0, depNode);\n\t\tignoreInitialPush = false;\n\t\tif (idx0 !== -1) {\n\t\t\tthis._dep.unsubs[idx0] = unsub;\n\t\t\tthis._dep.idxBoxes[idx0] = box;\n\t\t}\n\t}\n\n\tprivate _seedRestoredDepAt(idx: number, depNode: Node<unknown>): void {\n\t\tconst seedData = depNode._value.hasData && !depNode._slot.pull;\n\t\tthis._dep.batch[idx] = null;\n\t\tthis._dep.waveData[idx] = [];\n\t\tthis._dep.waveTokens[idx] = undefined;\n\t\tthis._dep.prev[idx] = seedData ? depNode._value.cache : SENTINEL;\n\t\tthis._dep.hasData[idx] = seedData;\n\t\tthis._dep.dirty[idx] = false;\n\t\tthis._dep.tier[idx] = seedData ? 3 : 0;\n\t\tthis._dep.terminal[idx] = depNode._value.terminal;\n\t\tthis._dep.terminalInput[idx] = undefined;\n\t}\n\n\tprivate _deactivate(): void {\n\t\tthis._lifecycle.activated = false;\n\t\tfor (const u of this._dep.unsubs) if (u) u();\n\t\tthis._dep.unsubs = [];\n\t\tthis._dep.idxBoxes = [];\n\t\tfor (const fn of this._hooks.onDeactivation) fn();\n\t\tthis._hooks.onDeactivation = [];\n\t\tthis._hooks.onInvalidate = [];\n\n\t\tconst isCompute = this._slot.handle !== null || this._slot.deps.length > 0;\n\t\tif (isCompute) {\n\t\t\t// RAM: compute nodes clear cache; reconnect re-runs fn fresh.\n\t\t\tthis._value.cache = SENTINEL;\n\t\t\tthis._value.hasData = false;\n\t\t\tthis._value.status = \"sentinel\";\n\t\t}\n\t\tthis._resetDepState();\n\t\tthis._wave.hasCalledFnOnce = false;\n\t\tthis._control.pauseLockset.clear();\n\t\tthis._control.pauseBuffer = [];\n\t\tthis._control.pausedDepWaveOccurred = false;\n\t\tthis._control.demandOwed = undefined; // R-pull (D269): drop any deferred demand\n\t\tthis._control.activePull = undefined;\n\t\tthis._control.pullDirtyOwed = false;\n\t\tthis._value.replayRing = []; // BH6: don't replay stale values to a post-reactivation subscriber\n\t\tif (!this._privateState.persist) this._privateState.value = SENTINEL;\n\t}\n\n\tprivate _assertNotReleased(op: string): void {\n\t\tif (this._released)\n\t\t\tthrow new Error(`${op}: node has been released from its graph lifecycle (D122)`);\n\t}\n\n\tprivate _subscriberCount(): number {\n\t\treturn this._lifecycle.subscribers.size;\n\t}\n\n\tprivate _isRuntimeQuiescentForRelease(): boolean {\n\t\treturn (\n\t\t\t!this._released &&\n\t\t\tthis._value.status !== \"dirty\" &&\n\t\t\tthis._value.status !== \"pending\" &&\n\t\t\tthis._wave.pending === 0 &&\n\t\t\t!this._wave.insideRunWave &&\n\t\t\t!this._wave.inDepMutation &&\n\t\t\t!this._wave.rewireRunPending &&\n\t\t\t!this._wave.batchDirtyOwed &&\n\t\t\tthis._dep.dirty.every((dirty) => !dirty) &&\n\t\t\tthis._control.pauseBuffer.length === 0 &&\n\t\t\t!this._control.pausedDepWaveOccurred &&\n\t\t\tthis._control.demandOwed === undefined &&\n\t\t\tthis._control.activePull === undefined &&\n\t\t\t!this._control.inDeliverDemand &&\n\t\t\tthis._control.pauseLockset.size === 0\n\t\t);\n\t}\n\n\tprivate _releaseRuntime(): void {\n\t\tif (this._released) return;\n\t\tthis._released = true;\n\t\treleasedNodes.add(this as Node<unknown>);\n\t\tlet releaseError: unknown;\n\t\tconst recordReleaseError = (error: unknown): void => {\n\t\t\tif (releaseError === undefined) releaseError = error;\n\t\t};\n\t\tthis._lifecycle.activated = false;\n\t\tfor (const u of this._dep.unsubs) {\n\t\t\ttry {\n\t\t\t\tu();\n\t\t\t} catch (error) {\n\t\t\t\trecordReleaseError(error);\n\t\t\t\t// D124 release is graph-owned and atomic; user cleanup must not split commit.\n\t\t\t}\n\t\t}\n\t\tfor (const fn of this._hooks.onDeactivation) {\n\t\t\ttry {\n\t\t\t\tfn();\n\t\t\t} catch (error) {\n\t\t\t\trecordReleaseError(error);\n\t\t\t\t// D124 release cleans runtime without synthesizing protocol ERROR/COMPLETE.\n\t\t\t}\n\t\t}\n\t\tthis._dep.unsubs = [];\n\t\tthis._dep.idxBoxes = [];\n\t\tthis._lifecycle.subscribers.clear();\n\t\tif (this._slot.handle !== null) {\n\t\t\tthis._slot.dispatcher.unregister(this._slot.handle);\n\t\t\tthis._slot.handle = null;\n\t\t}\n\t\tthis._slot.deps = [];\n\t\tthis._dep.batch = [];\n\t\tthis._dep.waveData = [];\n\t\tthis._dep.waveTokens = [];\n\t\tthis._dep.prev = [];\n\t\tthis._dep.hasData = [];\n\t\tthis._dep.dirty = [];\n\t\tthis._dep.tier = [];\n\t\tthis._dep.terminal = [];\n\t\tthis._dep.terminalInput = [];\n\t\tthis._value.cache = SENTINEL;\n\t\tthis._value.hasData = false;\n\t\tthis._value.status = \"sentinel\";\n\t\tthis._value.terminal = undefined;\n\t\tthis._value.replayRing = [];\n\t\tthis._privateState.value = SENTINEL;\n\t\tthis._privateState.persist = false;\n\t\tthis._syncCtx = null;\n\t\tthis._resetDepState();\n\t\tthis._hooks.onDeactivation = [];\n\t\tthis._hooks.onInvalidate = [];\n\t\tthis._control.pauseLockset.clear();\n\t\tthis._control.pauseBuffer = [];\n\t\tthis._control.pausedDepWaveOccurred = false;\n\t\tthis._control.demandOwed = undefined;\n\t\tthis._control.activePull = undefined;\n\t\tthis._control.pullDirtyOwed = false;\n\t\tthis._restoredActivationPending = false;\n\t\tcheckpointReaders.delete(this as Node<unknown>);\n\t\trestoreWriters.delete(this as Node<unknown>);\n\t\truntimeReleasers.delete(this as Node<unknown>);\n\t\truntimeQuiescenceReaders.delete(this as Node<unknown>);\n\t\tsubscriberCountReaders.delete(this as Node<unknown>);\n\t\tactivationReaders.delete(this as Node<unknown>);\n\t\townerTokens.delete(this as Node<unknown>);\n\t\ttopologyDepsChangedObservers.delete(this as Node<unknown>);\n\t\tthis._core.releaseSlot(this._id);\n\t\tif (releaseError !== undefined) throw releaseError;\n\t}\n\n\tprivate _resetDepState(): void {\n\t\tconst n = this._slot.deps.length;\n\t\tfor (let i = 0; i < n; i++) {\n\t\t\tthis._dep.batch[i] = null;\n\t\t\tthis._dep.waveData[i] = [];\n\t\t\tthis._dep.waveTokens[i] = undefined;\n\t\t\tthis._dep.prev[i] = SENTINEL;\n\t\t\tthis._dep.hasData[i] = false;\n\t\t\tthis._dep.dirty[i] = false;\n\t\t\tthis._dep.tier[i] = 0;\n\t\t\tthis._dep.terminal[i] = undefined;\n\t\t\tthis._dep.terminalInput[i] = undefined;\n\t\t}\n\t\tthis._wave.pending = 0;\n\t\tthis._wave.emittedDirtyThisWave = false;\n\t}\n\n\t// ── upstream wave receive (two-phase + diamond) ──\n\n\tprivate _recordDepProjection(idx: number, delivery: DeliveryMeta | undefined): unknown[] {\n\t\tconst token = delivery?.wave ?? {};\n\t\tif (this._dep.waveTokens[idx] !== token) {\n\t\t\tthis._dep.waveData[idx].push([]);\n\t\t\tthis._dep.waveTokens[idx] = token;\n\t\t}\n\t\treturn this._dep.waveData[idx][this._dep.waveData[idx].length - 1];\n\t}\n\n\tprivate _depProjectionHasData(idx: number): boolean {\n\t\tconst projection = this._dep.waveData[idx][this._dep.waveData[idx].length - 1];\n\t\treturn projection?.some((v) => v !== SENTINEL) ?? false;\n\t}\n\n\tprivate _receiveFromDep(idx: number, msg: Message, delivery?: DeliveryMeta): void {\n\t\tif (this._released) return;\n\t\tconst t = msg[0];\n\t\tif (t === \"START\") return;\n\t\tconst isLastInDeliveredWave = delivery?.last ?? true;\n\t\t// Terminal-is-forever, except terminal intermediates still relay upstream TEARDOWN\n\t\t// downstream for lifecycle unwire (R-teardown-terminal-relay / D65).\n\t\tif (this._value.terminal !== undefined) {\n\t\t\tif (t === \"TEARDOWN\") this._down([[\"TEARDOWN\"]]);\n\t\t\treturn;\n\t\t}\n\n\t\tif (t === \"INVALIDATE\") {\n\t\t\tconst projection = this._recordDepProjection(idx, delivery);\n\t\t\tprojection.push(SENTINEL);\n\t\t\tif (projection.some((v) => v !== SENTINEL) && isLastInDeliveredWave) this._maybeRun();\n\t\t\t// The dep's value is gone — drop our cached latest view to SENTINEL so the\n\t\t\t// never-emitted detector reads correctly, C-3) and cascade (idempotent).\n\t\t\tthis._dep.prev[idx] = SENTINEL;\n\t\t\tthis._dep.hasData[idx] = false;\n\t\t\tthis._dep.batch[idx] = null;\n\t\t\t// EC3: un-wedge the dirty bookkeeping if this dep had gone DIRTY first, so an\n\t\t\t// INVALIDATE-before-DATA doesn't strand _pending / downstream forever\n\t\t\t// (R-invalidate-idempotent — exists to prevent the wedged-DIRTY deadlock).\n\t\t\tif (this._dep.dirty[idx]) {\n\t\t\t\tthis._dep.dirty[idx] = false;\n\t\t\t\tthis._wave.pending--;\n\t\t\t}\n\t\t\t// D50 / R-paused-invalidate: this INVALIDATE SUPERSEDES the dep's buffered\n\t\t\t// paused dep-wave (_depBatch[idx] just cleared). Re-derive the paused-recompute\n\t\t\t// flag — if no dep still carries a buffered DATA, CANCEL the paused recompute\n\t\t\t// (attributed cancellation; the node has settled to SENTINEL via its own\n\t\t\t// INVALIDATE, so a RESUME must not recompute against a now-SENTINEL dep). A\n\t\t\t// surviving dep keeps it set; a later DATA re-arms it ([DATA,INVALIDATE,DATA2]).\n\t\t\tif (this._control.pausedDepWaveOccurred && this._dep.batch.every((b) => b === null)) {\n\t\t\t\tthis._control.pausedDepWaveOccurred = false;\n\t\t\t}\n\t\t\tconst hadData = this._value.hasData;\n\t\t\tthis._invalidate(); // cascades INVALIDATE iff populated; no-op otherwise\n\t\t\t// If we broadcast DIRTY this wave but _invalidate produced no settle (the node\n\t\t\t// was never populated, so the cascade is suppressed per the rule), un-dirty\n\t\t\t// downstream with a RESOLVED once all deps have settled.\n\t\t\tif (this._wave.pending === 0 && this._wave.emittedDirtyThisWave) {\n\t\t\t\tif (!hadData) this._down([[\"RESOLVED\"]]);\n\t\t\t\telse this._wave.emittedDirtyThisWave = false;\n\t\t\t}\n\t\t\tthis._fireOwedDemandIfReady(); // R-pull (D59/B1/F6): an INVALIDATE settle can drain _pending → fire a deferred demand\n\t\t\treturn;\n\t\t}\n\n\t\tif (isTerminal(t)) {\n\t\t\t// Tier 5 (R-tier / D34): COMPLETE | ERROR — ONE branch routed by the CENTRAL tier table,\n\t\t\t// not a per-variant string check (feedback_use_tier_for_signal_routing). The shared terminal\n\t\t\t// bookkeeping (record the terminal + release the in-wave DIRTY) runs for ANY tier-5 message;\n\t\t\t// only the COMPLETE-vs-ERROR cascade differs, so discriminate by the type within the tier.\n\t\t\tconst isError = t === \"ERROR\";\n\t\t\tconst errPayload = isError ? (msg as readonly [\"ERROR\", unknown])[1] : undefined;\n\t\t\tthis._dep.terminal[idx] = isError ? errPayload : true;\n\t\t\tthis._dep.terminalInput[idx] = isError ? errPayload : true;\n\t\t\t// R-terminal-settles-dirty (B35): a terminal RELEASES this dep's outstanding in-wave DIRTY\n\t\t\t// contribution (the exactly-one-settle invariant) — exactly as DATA/RESOLVED/INVALIDATE do\n\t\t\t// (a dirty-then-terminal-without-DATA dep would otherwise strand _pending and wedge the node,\n\t\t\t// the deadlock R-invalidate-idempotent prevents for INVALIDATE).\n\t\t\tthis._releaseDepDirty(idx);\n\t\t\tconst ranValueBeforeTerminal = this._depProjectionHasData(idx) && isLastInDeliveredWave;\n\t\t\tif (ranValueBeforeTerminal) this._maybeRun();\n\t\t\tif (isError && this._slot.errorWhenDepsError) {\n\t\t\t\tthis._down([[\"ERROR\", errPayload]]); // auto-cascade ERROR → node itself terminal\n\t\t\t} else if (this._slot.terminalAsRealInput) {\n\t\t\t\tif (ranValueBeforeTerminal) {\n\t\t\t\t\tthis._fireOwedDemandIfReady();\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tthis._maybeRun(); // rescue/reduce/catch/*Map: the fn reads depTerminal(ctx, idx)\n\t\t\t} else if (this._slot.completeWhenDepsComplete && this._allDepsTerminal()) {\n\t\t\t\t// R-deps-terminal auto-COMPLETE + B42: COMPLETE once ALL deps are TERMINAL (each COMPLETE\n\t\t\t\t// or an absorbed ERROR) — so an absorbed-error dep terminating LAST still fires the\n\t\t\t\t// cascade. terminalAsRealInput is checked FIRST so a rescue recovers via _maybeRun rather\n\t\t\t\t// than being preempted (no operator sets both completeWhenDepsComplete:true + tari:true).\n\t\t\t\tthis._down([[\"COMPLETE\"]]);\n\t\t\t} else {\n\t\t\t\t// absorbed terminal, NOT an input + not auto-completing: the dep's signalled change did\n\t\t\t\t// not materialise (no DATA) → un-dirty downstream, keep cache (R-resolved-undirty balance).\n\t\t\t\tthis._settleAfterAbsorbedTerminal();\n\t\t\t}\n\t\t\tthis._fireOwedDemandIfReady(); // R-pull (D59/B1/F6): a dep terminal can drain _pending → fire a deferred demand (no-op if this node went terminal)\n\t\t\treturn;\n\t\t}\n\n\t\tif (t === \"TEARDOWN\") {\n\t\t\tthis._down([[\"TEARDOWN\"]]);\n\t\t\treturn;\n\t\t}\n\n\t\tif (t === \"DIRTY\") {\n\t\t\tif (!this._dep.dirty[idx]) {\n\t\t\t\tthis._dep.dirty[idx] = true;\n\t\t\t\tthis._wave.pending++;\n\t\t\t\tthis._dep.tier[idx] = 2;\n\t\t\t\tthis._markDirty();\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\n\t\tif (t === \"DATA\") {\n\t\t\tconst v = msg[1];\n\t\t\tthis._recordDepProjection(idx, delivery).push(v);\n\t\t\tconst b = this._dep.batch[idx];\n\t\t\tif (b === null) this._dep.batch[idx] = [v];\n\t\t\telse b.push(v);\n\t\t\tthis._dep.prev[idx] = v;\n\t\t\tthis._dep.hasData[idx] = true;\n\t\t\tthis._dep.tier[idx] = 3;\n\t\t\tif (this._dep.dirty[idx]) {\n\t\t\t\tthis._dep.dirty[idx] = false;\n\t\t\t\tthis._wave.pending--;\n\t\t\t}\n\t\t\tif (isLastInDeliveredWave) this._maybeRun();\n\t\t\tthis._fireOwedDemandIfReady(); // R-pull pin 5: settle-ready now → fire a deferred demand\n\t\t\treturn;\n\t\t}\n\n\t\tif (t === \"RESOLVED\") {\n\t\t\tthis._recordDepProjection(idx, delivery);\n\t\t\tthis._dep.tier[idx] = 3;\n\t\t\tif (this._dep.dirty[idx]) {\n\t\t\t\tthis._dep.dirty[idx] = false;\n\t\t\t\tthis._wave.pending--;\n\t\t\t}\n\t\t\tif (isLastInDeliveredWave) this._maybeRun();\n\t\t\tthis._fireOwedDemandIfReady(); // R-pull pin 5: settle-ready now → fire a deferred demand\n\t\t\treturn;\n\t\t}\n\t\t// PAUSE / RESUME are not delivered downstream to a dep-subscriber; a node is\n\t\t// paused via its own up() (lockset), not by an upstream dep.\n\t}\n\n\t/**\n\t * R-terminal-settles-dirty (B35): release a dep's outstanding in-wave DIRTY contribution.\n\t * A settle-class event for that dep (DATA/RESOLVED inline above, INVALIDATE, and now\n\t * COMPLETE/ERROR) clears its dirty flag + decrements _pending. No-op if the dep already\n\t * settled this wave (DATA/RESOLVED ran first) — so the normal DATA-then-COMPLETE flow is\n\t * unaffected. This makes the exactly-one-settle invariant a single, shared step.\n\t */\n\tprivate _releaseDepDirty(idx: number): void {\n\t\tif (this._dep.dirty[idx]) {\n\t\t\tthis._dep.dirty[idx] = false;\n\t\t\tthis._wave.pending--;\n\t\t}\n\t}\n\n\t/**\n\t * R-terminal-settles-dirty (B35): settle a node whose dirtied dep was released by an ABSORBED\n\t * terminal that is NOT a real input (a plain derived/effect — the common default-node case when\n\t * one of several deps completes while others stay live). Runs only when the release drained\n\t * _pending while the node still owes a downstream settle (it broadcast DIRTY this wave):\n\t *   - if some OTHER dep delivered real DATA this wave (a value occurred) → recompute (→ DATA);\n\t *   - else the terminal's signalled change did not materialise (no value) → one undirty RESOLVED\n\t *     (R-resolved-undirty), keeping the cache (a terminal, unlike INVALIDATE, leaves the value).\n\t * A terminalAsRealInput node instead recomputes unconditionally (its fn reads the terminal).\n\t */\n\tprivate _settleAfterAbsorbedTerminal(): void {\n\t\tif (this._wave.pending !== 0 || !this._wave.emittedDirtyThisWave) return;\n\t\t// A real value occurred this wave (some OTHER dep delivered DATA) → recompute. _maybeRun\n\t\t// runs the fn ONLY if it's not gated (first-run gate open, not paused); it may emit DATA, a\n\t\t// fn-synthesized undirty RESOLVED, or nothing (gated / gate still holds).\n\t\tconst sawData = this._dep.batch.some((b) => b !== null && b.length > 0);\n\t\tif (sawData) this._maybeRun();\n\t\t// If after that the node STILL owes a downstream settle (no DATA occurred, OR the recompute\n\t\t// was gated — e.g. the first-run gate holds because the terminated dep never delivered and\n\t\t// terminalAsRealInput is false), balance the broadcast DIRTY with one undirty RESOLVED\n\t\t// (R-resolved-undirty), keeping the cache (a terminal, unlike INVALIDATE, leaves the value).\n\t\t// Without this fallback a DIRTY-then-terminal-without-DATA dep on a pre-first-run multi-dep\n\t\t// node would strand the DIRTY → downstream wedged (the B35 class, in the gate-holds corner).\n\t\tif (this._wave.emittedDirtyThisWave) this._down([[\"RESOLVED\"]]);\n\t}\n\n\tprivate _markDirty(): void {\n\t\tthis._value.status = \"dirty\";\n\t\t// SPIKE (protocol-pull): while quiet, ABSORB the upstream DIRTY — do NOT relay it downstream.\n\t\t// This is the P0b wedge fix: a quiet pull node that relayed DIRTY but withheld the settle\n\t\t// (coalesced by pause) wedged every downstream's two-phase _pending. The downstream learns of\n\t\t// changes via the push STREAM port, not the silent snapshot port; on demand the pull node\n\t\t// emits a fresh wave. Internal dep dirty-accounting (the DIRTY-branch _pending++) is untouched.\n\t\tif (this._isPullQuiet()) return;\n\t\tif (!this._wave.emittedDirtyThisWave) {\n\t\t\tthis._wave.emittedDirtyThisWave = true;\n\t\t\tthis._emitToSubs([\"DIRTY\"]);\n\t\t}\n\t}\n\n\tprivate _maybeRun(): void {\n\t\t// R-rewire: an added cached dep's push-on-subscribe lands here mid-mutation. Defer\n\t\t// the fn-run to ONE atomic two-phase settle after every added dep is wired, so the\n\t\t// fn never fires on a partially-populated added-dep view (multi-add) — _settleRewire\n\t\t// drains this flag.\n\t\tif (this._wave.inDepMutation) {\n\t\t\tthis._wave.rewireRunPending = true;\n\t\t\treturn;\n\t\t}\n\t\t// R-pause-modes + R-pull: while externally paused or pull-quiet, default pull mode\n\t\t// coalesces. `resumeAll` still runs so its outgoing settle slice can enter pauseBuffer.\n\t\tif (this._slot.pausable === true && (this._isPaused() || this._isPullQuiet())) {\n\t\t\tthis._control.pausedDepWaveOccurred = true;\n\t\t\treturn;\n\t\t}\n\t\tthis._tryRun();\n\t}\n\n\t/**\n\t * R-rewire atomic settle (after a rewire that warrants a recompute): emit a proper\n\t * two-phase DIRTY→DATA wave (R-dirty-before-data — a rewire-triggered settle is a wave),\n\t * once, with every added dep already wired. Mirrors _maybeRun/_tryRun's pause + gate +\n\t * pending guards, then injects the phase-1 DIRTY the added dep's [START,DATA] handshake\n\t * did not carry.\n\t */\n\tprivate _settleRewire(): void {\n\t\tif (this._slot.pausable === true && this._isPaused()) {\n\t\t\tthis._control.pausedDepWaveOccurred = true;\n\t\t\treturn;\n\t\t}\n\t\tif (this._wave.pending > 0) return;\n\t\tif (this._slot.handle === null) {\n\t\t\tthis._passthroughEmit();\n\t\t\treturn;\n\t\t}\n\t\tif (!this._wave.hasCalledFnOnce && !(this._slot.partial || this._allDepsSettled())) return;\n\t\tthis._markDirty(); // phase 1 (no-op if already dirty, e.g. unsubscribeDep auto-settle)\n\t\tthis._runWave(); // phase 2: fn → DATA/RESOLVED\n\t}\n\n\tprivate _tryRun(): void {\n\t\tif (this._wave.pending > 0) return;\n\t\tif (this._slot.handle === null) {\n\t\t\t// Passthrough wire (deps, no fn): forward the latest dep DATA downstream.\n\t\t\tthis._passthroughEmit();\n\t\t\treturn;\n\t\t}\n\t\tif (!this._wave.hasCalledFnOnce) {\n\t\t\tif (this._slot.partial || this._allDepsSettled()) this._runWave();\n\t\t\t// else: first-run gate holds fn until every dep has settled (R-first-run-gate).\n\t\t\treturn;\n\t\t}\n\t\tthis._runWave();\n\t}\n\n\tprivate _allDepsSettled(): boolean {\n\t\tfor (let i = 0; i < this._slot.deps.length; i++) {\n\t\t\tif (this._dep.hasData[i]) continue;\n\t\t\tif (this._slot.terminalAsRealInput && this._dep.terminal[i] !== undefined) continue;\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}\n\n\tprivate _passthroughEmit(): void {\n\t\t// Single-dep wire: relay dep 0's latest batch value as DATA.\n\t\tconst b = this._dep.batch[0];\n\t\tif (b !== null && b.length > 0) {\n\t\t\tthis._down([[\"DATA\", b[b.length - 1]]]);\n\t\t} else if (this._wave.emittedDirtyThisWave) {\n\t\t\t// R-resolved-undirty (D49): the dep settled via an undirty RESOLVED (no DATA in the\n\t\t\t// batch), but this wire already broadcast DIRTY downstream this wave — balance it with\n\t\t\t// a RESOLVED so downstream un-dirties instead of wedging. Routed through _down (NOT a\n\t\t\t// bare _emitToSubs) so the balance respects batch-defer (D12) + pause-buffer, matching\n\t\t\t// the zero-dep un-dirty path. Without this, a passthrough over a filter-reject /\n\t\t\t// distinctUntilChanged-dup leaves a dangling DIRTY (the wedge D49 made common).\n\t\t\tthis._down([[\"RESOLVED\"]]);\n\t\t}\n\t\tthis._dep.batch[0] = null;\n\t\tthis._wave.emittedDirtyThisWave = false;\n\t}\n\n\tprivate _runWave(): void {\n\t\t// R-reentrancy (D37): a fn that re-drives its own dep mid-wave re-enters here while\n\t\t// _insideRunWave is still set — a synchronous feedback cycle. Reject (throw); the graph\n\t\t// layer catches it and converts to [[ERROR, e]] (D30). The try/finally resets the flag\n\t\t// on every frame as the throw unwinds, leaving the graph clean for the catch. Detection\n\t\t// is node-local and free — it reuses the existing _insideRunWave flag (no new structure,\n\t\t// dispatcher stays a pure funnel).\n\t\tif (this._wave.insideRunWave)\n\t\t\tthrow new Error(\n\t\t\t\t\"synchronous feedback cycle: node fn re-entered its own wave (R-reentrancy / D37)\",\n\t\t\t);\n\t\tthis._wave.hasCalledFnOnce = true;\n\t\t// R-cleanup-hooks per-run lifecycle (D28 clarification): clear BOTH hook lists\n\t\t// before the fn runs; the fn body re-registers the current run's hooks. Only the\n\t\t// latest run's registrations are live — a re-run supersedes the prior run's hooks,\n\t\t// discarded WITHOUT firing (no fire-on-rerun; onRerun stays cut). Fixes the push-only\n\t\t// accumulation (K stale hooks fired after K runs). C-14.\n\t\tthis._hooks.onInvalidate = [];\n\t\tthis._hooks.onDeactivation = [];\n\t\tconst ctx = this._buildCtx();\n\t\tconst wasDirty = this._wave.emittedDirtyThisWave;\n\t\tthis._wave.emittedSettleThisWave = false;\n\t\tthis._wave.insideRunWave = true;\n\t\ttry {\n\t\t\tthis._slot.dispatcher.invoke(this._slot.handle as Handle, ctx);\n\t\t} finally {\n\t\t\tthis._wave.insideRunWave = false;\n\t\t}\n\n\t\t// R-resolved-undirty (D49): a SYNC fn DIRTY'd in phase 1 that produced NO tier-3 value\n\t\t// this wave (filter-reject / distinctUntilChanged-dup / any no-emit fn) gets a substrate-\n\t\t// SYNTHESIZED undirty RESOLVED to clear the downstream dirty — operator bodies stay\n\t\t// protocol-clean (R-primary-api-clean). Status reflects cache freshness: a carried value\n\t\t// -> resolved, never-valued -> sentinel. EXEMPT: terminal/INVALIDATE waves (they set\n\t\t// _emittedSettleThisWave and balance their own dirty), and ASYNC-pool nodes — an async fn\n\t\t// that returns without emitting has DEFERRED its result (it emits later via the stashed\n\t\t// ctx), NOT rejected; synthesizing here would prematurely settle a still-pending diamond\n\t\t// leg (R-async-paused / C-4). The eventual async ctx.down carries its own DIRTY balance.\n\t\tif (\n\t\t\twasDirty &&\n\t\t\t!this._wave.emittedSettleThisWave &&\n\t\t\tthis._value.terminal === undefined &&\n\t\t\t!this._isAsyncPool()\n\t\t) {\n\t\t\tthis._down([[\"RESOLVED\"]]);\n\t\t}\n\n\t\t// roll wave-local state forward\n\t\tfor (let i = 0; i < this._dep.batch.length; i++) {\n\t\t\tthis._dep.batch[i] = null;\n\t\t\tthis._dep.waveData[i] = [];\n\t\t\tthis._dep.waveTokens[i] = undefined;\n\t\t\tthis._dep.terminalInput[i] = undefined;\n\t\t}\n\t\tthis._wave.emittedDirtyThisWave = false;\n\t}\n\n\t// ── ctx construction (L3-Q5: sync = node-stable reused ctx; async = per-invocation) ──\n\n\tprivate _buildCtx(): Ctx {\n\t\tconst kind = this._slot.handle\n\t\t\t? this._slot.dispatcher.poolKind(this._slot.handle.poolId)\n\t\t\t: \"sync\";\n\t\tif (kind === \"sync\") {\n\t\t\tif (this._syncCtx === null) this._syncCtx = this._makeCtx();\n\t\t\tthis._refreshCtx(this._syncCtx);\n\t\t\treturn this._syncCtx;\n\t\t}\n\t\t// async: snapshot dep inputs so a deferred late-emit reads this wave's view.\n\t\treturn this._makeCtx({\n\t\t\twaveData: this._dep.waveData.map((waves) => waves.map((w) => [...w])),\n\t\t\tterminal: this._dep.terminalInput.map(terminalView),\n\t\t\tlatest: [...this._dep.prev],\n\t\t});\n\t}\n\n\tprivate _makeCtx(snapshot?: {\n\t\twaveData: unknown[][][];\n\t\tterminal: unknown[];\n\t\tlatest: unknown[];\n\t}): Ctx {\n\t\tconst ctx: Ctx = {\n\t\t\t// Wave-owner boundary (D47): a SYNC fn's emit nests under the public entry that drove\n\t\t\t// it (cheap inc/dec, no early drain); an ASYNC-pool fn re-enters here from its stashed\n\t\t\t// ctx at depth 0, so this is the boundary that drains any rewireNext it issued.\n\t\t\tup: (msgs, towardDep) => {\n\t\t\t\tif (this._released) return;\n\t\t\t\tenterWave();\n\t\t\t\ttry {\n\t\t\t\t\tthis._up(msgs, towardDep);\n\t\t\t\t} finally {\n\t\t\t\t\texitWave();\n\t\t\t\t}\n\t\t\t},\n\t\t\tdown: (msgs) => {\n\t\t\t\tif (this._released) return;\n\t\t\t\tenterWave();\n\t\t\t\ttry {\n\t\t\t\t\tthis._down(msgs);\n\t\t\t\t} finally {\n\t\t\t\t\texitWave();\n\t\t\t\t}\n\t\t\t},\n\t\t\twaveData: snapshot?.waveData ?? this._dep.waveData,\n\t\t\tterminal: snapshot?.terminal ?? this._dep.terminalInput.map(terminalView),\n\t\t\tstate: this._makeState(),\n\t\t\tonDeactivation: (fn) => {\n\t\t\t\tif (this._released) return;\n\t\t\t\tthis._hooks.onDeactivation.push(fn);\n\t\t\t},\n\t\t\tonInvalidate: (fn) => {\n\t\t\t\tif (this._released) return;\n\t\t\t\tthis._hooks.onInvalidate.push(fn);\n\t\t\t},\n\t\t\tenvironment: () => this._slot.environment,\n\t\t\t// R-rewire-deferred (D47): defer a self-dep-set mutation to the committed boundary.\n\t\t\trewireNext: {\n\t\t\t\tsubscribeDep: (dep, fn) => this._requestRewireNext({ kind: \"add\", dep, fn }),\n\t\t\t\tunsubscribeDep: (dep, fn) => this._requestRewireNext({ kind: \"remove\", dep, fn }),\n\t\t\t\treplaceDeps: (deps, fn) => this._requestRewireNext({ kind: \"set\", deps, fn }),\n\t\t\t},\n\t\t\t// R-up-routing / R-pull (D269): deferred up — route a control/demand wave (e.g. PULL)\n\t\t\t// up the declared cone at the committed boundary. The SELF-demand path: an\n\t\t\t// immediate ctx.up whose delivery loops back re-enters this fn (D37 / R-reentrancy).\n\t\t\tupNext: (msgs, towardDep) => this._requestUpNext(msgs, towardDep),\n\t\t\t...(this._control.activePull === undefined ? {} : { pull: this._control.activePull }),\n\t\t\t[CTX_DEP_CACHE]: { latest: snapshot?.latest ?? this._dep.prev },\n\t\t\t[CTX_NODE_BINDING]: {\n\t\t\t\tdispatcher: this._slot.dispatcher,\n\t\t\t\tcreate: <U>(factory: () => Node<U>) =>\n\t\t\t\t\twithEnvironmentDrivers(this._slot.environment, () => withNodeCore(this._core, factory)),\n\t\t\t},\n\t\t};\n\t\tif (this._slot.dynamic) {\n\t\t\t// R-dynamic-node: read a dep's latest by index. Untracked deps still drive waves and\n\t\t\t// re-run the fn; under D49 (no equals-substitution) the fn re-emits its current value\n\t\t\t// as DATA — to suppress redundant downstream propagation, pair with distinctUntilChanged.\n\t\t\tctx.track = (i: number) => ctx[CTX_DEP_CACHE]?.latest[i];\n\t\t}\n\t\treturn ctx;\n\t}\n\n\tprivate _refreshCtx(ctx: Ctx): void {\n\t\t(ctx as { waveData: WaveData }).waveData = this._dep.waveData;\n\t\t(ctx as { terminal: TerminalData }).terminal = this._dep.terminalInput.map(terminalView);\n\t\tif (this._control.activePull === undefined) {\n\t\t\tdelete (ctx as { pull?: PullDemand }).pull;\n\t\t} else {\n\t\t\t(ctx as { pull?: PullDemand }).pull = this._control.activePull;\n\t\t}\n\t\tctx[CTX_DEP_CACHE] = { latest: this._dep.prev };\n\t}\n\n\tprivate _makeState(): CtxState {\n\t\treturn {\n\t\t\tget: <S>() => this._privateState.value as S | undefined,\n\t\t\tset: <S>(v: S) => {\n\t\t\t\tthis._privateState.value = v;\n\t\t\t},\n\t\t\tpersist: (on = true) => {\n\t\t\t\tthis._privateState.persist = on;\n\t\t\t},\n\t\t};\n\t}\n\n\t// ── downstream emission pipeline (the unified waist) ──\n\n\tprivate _down(msgs: Wave): void {\n\t\tif (this._released) return;\n\t\tvalidateDownPayloads(msgs);\n\t\tconst deliveryWave = {};\n\t\tconst assertVersionDataCompatible = (wave: readonly Message[]) => {\n\t\t\tfor (const m of wave) {\n\t\t\t\tif (m[0] === \"DATA\") assertNodeVersionDataCompatible(this._version.policy, m[1]);\n\t\t\t}\n\t\t};\n\t\tconst snapshotVersionData = (wave: readonly Message[]): Message[] =>\n\t\t\twave.map((m) =>\n\t\t\t\tm[0] === \"DATA\"\n\t\t\t\t\t? ([\"DATA\", snapshotNodeVersionData(this._version.policy, m[1])] as Message)\n\t\t\t\t\t: m,\n\t\t\t);\n\t\tassertVersionDataCompatible(msgs);\n\t\t// Terminal-is-forever (R-terminal / D17 / B30): once COMPLETE/ERROR has been emitted the\n\t\t// node is final — a self-emit (state.set / ctx.down) in a LATER wave is a no-op, never\n\t\t// resurrecting the cache or re-emitting. The COMPLETE/ERROR arms below also self-guard\n\t\t// against a double terminal, but DATA/RESOLVED/INVALIDATE had no entry guard, so a\n\t\t// post-terminal set() would overwrite cache + emit DATA. R-teardown-terminal-relay / D65\n\t\t// carves out the only post-terminal exception: TEARDOWN still relays downstream for unwire\n\t\t// without reopening value output. A single wave that goes terminal mid-loop (e.g.\n\t\t// [COMPLETE, TEARDOWN]) is unaffected: _terminal is still undefined at entry.\n\t\t// Resubscribable reset clears _terminal before any re-emit.\n\t\tif (this._value.terminal !== undefined) {\n\t\t\tif (!msgs.some((m) => m[0] === \"TEARDOWN\")) return;\n\t\t\tthis._value.hasTorndown = true;\n\t\t\tif (this._slot.resetOnTeardown) {\n\t\t\t\tthis._value.cache = SENTINEL;\n\t\t\t\tthis._value.hasData = false;\n\t\t\t}\n\t\t\tthis._emitToSubs([\"TEARDOWN\"], { wave: deliveryWave, last: true });\n\t\t\treturn;\n\t\t}\n\t\tlet sorted: Message[] = [...msgs].sort((a, b) => messageTier(a[0]) - messageTier(b[0]));\n\t\t// R-same-wave-merge: collapse repeated INVALIDATE in one wave (Q9) so the\n\t\t// cleanup hook + downstream broadcast fire at most once.\n\t\tconst firstInvalidate = sorted.findIndex((m) => m[0] === \"INVALIDATE\");\n\t\tif (firstInvalidate !== -1) {\n\t\t\tsorted = sorted.filter((m, i) => m[0] !== \"INVALIDATE\" || i === firstInvalidate);\n\t\t}\n\t\t// R-teardown-complete: a TEARDOWN reaching a non-terminal node synthesizes a\n\t\t// COMPLETE prefix (so firstValueFrom-style bridges resolve), unless the wave\n\t\t// already carries a terminal or the node already tore down.\n\t\tconst hasTeardown = sorted.some((m) => m[0] === \"TEARDOWN\");\n\t\tconst hasTerminal = sorted.some((m) => m[0] === \"COMPLETE\" || m[0] === \"ERROR\");\n\t\tif (\n\t\t\thasTeardown &&\n\t\t\t!hasTerminal &&\n\t\t\tthis._value.terminal === undefined &&\n\t\t\t!this._value.hasTorndown\n\t\t) {\n\t\t\tsorted = [[\"COMPLETE\"], ...sorted];\n\t\t}\n\t\t// R-batch-coalesce (D12): inside a batch, emit DIRTY immediately but defer the\n\t\t// tier-3 settle slice to commit so a shared downstream recomputes once. Only\n\t\t// external emits defer (fn emits during commit run normally).\n\t\tif (!this._wave.insideRunWave && currentBatch()) {\n\t\t\tconst deferred = snapshotVersionData(sorted.filter((m) => isDeferredTier(m[0])));\n\t\t\tif (deferred.length > 0) {\n\t\t\t\tif (!this._wave.emittedDirtyThisWave) {\n\t\t\t\t\tthis._wave.emittedDirtyThisWave = true;\n\t\t\t\t\tthis._value.status = \"dirty\";\n\t\t\t\t\tthis._emitToSubs([\"DIRTY\"], { wave: deliveryWave, last: false });\n\t\t\t\t}\n\t\t\t\tthis._wave.batchDirtyOwed = true; // BH1: owe a balancing RESOLVED on rollback\n\t\t\t\tdeferToBatch(this, deferred);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\t// R-pause-modes / R-async-paused: defer the settle slice (tier 3/4) into the\n\t\t// pause buffer while paused; tier 0-2 (DIRTY/PAUSE/RESUME), tier 5 (terminal),\n\t\t// tier 6 (TEARDOWN) bypass so end-of-stream + control always reach observers.\n\t\tif (this._shouldBufferOnPause()) {\n\t\t\tconst buffered = snapshotVersionData(sorted.filter((m) => isPauseBufferedTier(m[0])));\n\t\t\tif (buffered.length > 0) {\n\t\t\t\t// B36 / R-resolved-undirty: buffering a settle slice still means this fn wave\n\t\t\t\t// produced a settle. Without this, _runWave sees \"dirty + no settle\" and\n\t\t\t\t// synthesizes a RESOLVED that pierces the pause while the DATA waits in the buffer.\n\t\t\t\tthis._wave.emittedSettleThisWave = true;\n\t\t\t\tthis._control.pauseBuffer.push(buffered);\n\t\t\t}\n\t\t\tsorted = sorted.filter((m) => !isPauseBufferedTier(m[0]));\n\t\t\tif (sorted.length === 0) return;\n\t\t}\n\t\tlet dataCount = 0;\n\t\tlet hasTier3 = false;\n\t\tlet hasResolved = false;\n\t\tfor (const m of sorted) {\n\t\t\tif (m[0] === \"DATA\") dataCount++;\n\t\t\tif (m[0] === \"RESOLVED\") hasResolved = true;\n\t\t\tif (isValueTier(m[0])) hasTier3 = true;\n\t\t}\n\t\t// EC2 / R-resolved-undirty tier-3 exclusivity: a wave's tier-3 slot is >=1 DATA\n\t\t// (occurrence) XOR exactly 1 RESOLVED (undirty) — never mixed. Reject fail-fast.\n\t\tif (dataCount >= 1 && hasResolved) {\n\t\t\tthrow new Error(\n\t\t\t\t\"down: a wave cannot mix DATA and RESOLVED (tier-3 exclusivity, R-resolved-undirty)\",\n\t\t\t);\n\t\t}\n\t\tconst plannedVersions: Array<NodeVersion | undefined> = new Array(sorted.length);\n\t\tif (dataCount > 0) {\n\t\t\tlet plannedVersion = this._version.value;\n\t\t\tfor (let i = 0; i < sorted.length; i++) {\n\t\t\t\tconst m = sorted[i];\n\t\t\t\tif (m[0] !== \"DATA\") continue;\n\t\t\t\tplannedVersion = advanceNodeVersion(plannedVersion, this._version.policy, m[1]);\n\t\t\t\tplannedVersions[i] = plannedVersion;\n\t\t\t}\n\t\t}\n\n\t\t// Synthesize a leading DIRTY for an EXTERNAL tier-3 emit (R-dirty-before-data), and for\n\t\t// PULL demand fns only when they actually emit tier-3. A no-op pull helper must stay silent.\n\t\tif (\n\t\t\thasTier3 &&\n\t\t\t(!this._wave.insideRunWave || this._control.pullDirtyOwed) &&\n\t\t\t!this._wave.emittedDirtyThisWave\n\t\t) {\n\t\t\tthis._wave.emittedDirtyThisWave = true;\n\t\t\tthis._value.status = \"dirty\";\n\t\t\tthis._emitToSubs([\"DIRTY\"], { wave: deliveryWave, last: false });\n\t\t}\n\n\t\tfor (let i = 0; i < sorted.length; i++) {\n\t\t\tconst m = sorted[i];\n\t\t\tconst delivery = { wave: deliveryWave, last: i === sorted.length - 1 };\n\t\t\t// R-resolved-undirty (D49): a tier-3+ emit this wave means the fn produced a settle,\n\t\t\t// so no synthesized undirty RESOLVED is owed (see _runWave).\n\t\t\tif (isDeferredTier(m[0])) this._wave.emittedSettleThisWave = true;\n\t\t\tif (m[0] === \"DIRTY\") {\n\t\t\t\tif (!this._wave.emittedDirtyThisWave) {\n\t\t\t\t\tthis._wave.emittedDirtyThisWave = true;\n\t\t\t\t\tthis._value.status = \"dirty\";\n\t\t\t\t\tthis._emitToSubs([\"DIRTY\"], delivery);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (m[0] === \"DATA\") {\n\t\t\t\tconst v = m[1] as T;\n\t\t\t\t// R-resolved-undirty (D49): every value-occurrence is emitted as DATA — the\n\t\t\t\t// substrate never substitutes DATA->RESOLVED on value-equality. Dedup is opt-in\n\t\t\t\t// at the operator layer (distinctUntilChanged), never a substrate behavior.\n\t\t\t\tthis._value.cache = v;\n\t\t\t\tthis._value.hasData = true;\n\t\t\t\tthis._value.status = \"settled\";\n\t\t\t\tthis._version.value = plannedVersions[i];\n\t\t\t\tif (this._slot.replayN > 0) {\n\t\t\t\t\tthis._value.replayRing.push(v);\n\t\t\t\t\tif (this._value.replayRing.length > this._slot.replayN) this._value.replayRing.shift();\n\t\t\t\t}\n\t\t\t\tthis._emitToSubs([\"DATA\", v], delivery);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (m[0] === \"RESOLVED\") {\n\t\t\t\tthis._value.status = this._value.hasData ? \"resolved\" : \"sentinel\";\n\t\t\t\tthis._emitToSubs([\"RESOLVED\"], delivery);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (m[0] === \"INVALIDATE\") {\n\t\t\t\tthis._invalidate(delivery);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (m[0] === \"COMPLETE\") {\n\t\t\t\tif (this._value.terminal !== undefined) continue;\n\t\t\t\tthis._value.terminal = true;\n\t\t\t\tthis._control.pauseBuffer = []; // BH3: terminal discards buffered settle slices\n\t\t\t\tthis._value.status = \"completed\";\n\t\t\t\tthis._emitToSubs([\"COMPLETE\"], delivery);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (m[0] === \"ERROR\") {\n\t\t\t\tif (this._value.terminal !== undefined) continue;\n\t\t\t\tthis._value.terminal = m[1];\n\t\t\t\tthis._control.pauseBuffer = []; // BH3: terminal discards buffered settle slices\n\t\t\t\tthis._value.status = \"errored\";\n\t\t\t\tthis._emitToSubs([\"ERROR\", m[1]], delivery);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (m[0] === \"TEARDOWN\") {\n\t\t\t\tthis._value.hasTorndown = true;\n\t\t\t\tif (this._slot.resetOnTeardown) {\n\t\t\t\t\tthis._value.cache = SENTINEL;\n\t\t\t\t\tthis._value.hasData = false;\n\t\t\t\t}\n\t\t\t\tthis._emitToSubs([\"TEARDOWN\"], delivery);\n\t\t\t}\n\t\t\t// PAUSE / RESUME — control slice.\n\t\t}\n\n\t\tif (!this._wave.insideRunWave) this._wave.emittedDirtyThisWave = false;\n\t}\n\n\tprivate _up(msgs: Wave, towardDep?: number, route?: UpRouteState): void {\n\t\tif (this._released) return;\n\t\tconst routeState = route ?? { demandFired: new Map() };\n\t\tfor (const m of msgs) {\n\t\t\tif (!isUpAllowed(m[0])) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`ctx.up: ${m[0]} is down-only (tier ${messageTier(m[0])}); up carries control tiers only (R-ctx-up)`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tfor (const m of msgs) {\n\t\t\tif (m[0] === \"PAUSE\") {\n\t\t\t\t// PAUSE is NODE-TARGETED (R-up-routing): it ACQUIRES a lock, so there is no\n\t\t\t\t// pre-existing holder to route to — a controller targets the node directly.\n\t\t\t\tthis._pauseAcquire(m[1]);\n\t\t\t} else if (m[0] === \"RESUME\") {\n\t\t\t\t// R-up-routing (D269): RESUME is pause-lock release only.\n\t\t\t\tif (this._control.pauseLockset.has(m[1])) {\n\t\t\t\t\t// a pause lock held HERE → release LOCALLY (normal pause/resume, R-pause-lockset).\n\t\t\t\t\tthis._pauseRelease(m[1]);\n\t\t\t\t} else {\n\t\t\t\t\t// not held here → forward UP the declared cone to find the holder.\n\t\t\t\t\tthis._forwardUp(m, towardDep, routeState);\n\t\t\t\t}\n\t\t\t} else if (m[0] === \"PULL\") {\n\t\t\t\t// R-up-routing / R-pull (D269/D272): DEMAND-IF-PULL-HOLDER-ELSE-FORWARD-UP.\n\t\t\t\tconst demand = normalizePullDemand(m[1]);\n\t\t\t\tif (this._slot.pull && demand.pullId === this._slot.pullLock) {\n\t\t\t\t\tif (!this._markDemandRouted(demand.pullId, routeState)) this._onDemand(demand);\n\t\t\t\t} else {\n\t\t\t\t\tthis._forwardUp([\"PULL\", demand], towardDep, routeState);\n\t\t\t\t}\n\t\t\t} else if (this._slot.deps.length === 0) {\n\t\t\t\t// R-up-at-source (D38): a depless source is the terminus of upstream control.\n\t\t\t\t// INVALIDATE → HONOR the invalidate-request. Routed through _down (NOT a direct\n\t\t\t\t// _invalidate call, QA A-2) so the invalidate-request respects batch-defer (D12)\n\t\t\t\t// and pause-buffer exactly like a downstream-originated INVALIDATE; _down's\n\t\t\t\t// INVALIDATE branch calls _invalidate() (clear cache → SENTINEL, fire onInvalidate,\n\t\t\t\t// broadcast downstream). Outside batch/pause it is identical to a direct call.\n\t\t\t\t// DIRTY / TEARDOWN → DROP (no coherent terminus action; self-dirty would wedge\n\t\t\t\t// downstream awaiting a settle that never comes; source lifecycle is source-owned).\n\t\t\t\tif (m[0] === \"INVALIDATE\") this._down([[\"INVALIDATE\"]]);\n\t\t\t} else {\n\t\t\t\t// dep-bearing intermediate: forward DIRTY/INVALIDATE/TEARDOWN up toward deps.\n\t\t\t\tthis._forwardUp(m, towardDep, routeState);\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate _markDemandRouted(lockId: LockId, route: UpRouteState): boolean {\n\t\tlet holders = route.demandFired.get(lockId);\n\t\tif (holders === undefined) {\n\t\t\tholders = new Set();\n\t\t\troute.demandFired.set(lockId, holders);\n\t\t}\n\t\tif (holders.has(this as unknown as Node<unknown>)) return true;\n\t\tholders.add(this as unknown as Node<unknown>);\n\t\treturn false;\n\t}\n\n\t/**\n\t * Forward one up-going control message toward deps (R-up-routing): up the single declared edge\n\t * `towardDep` (directed — prunes other branches; only meaningful on the issuer's FIRST hop) or\n\t * broadcast up ALL deps. A depless source has no deps → the message DROPS here (the terminus —\n\t * e.g. a cone-routed PULL whose pullId no node up this cone holds, R-up-at-source). Recursive\n\t * forwarding carries the same per-wave route state and no `towardDep` → broadcast beyond the\n\t * first hop.\n\t */\n\tprivate _forwardUp(m: Message, towardDep: number | undefined, route: UpRouteState): void {\n\t\tif (this._slot.deps.length === 0) return; // depless source terminus → drop\n\t\tif (towardDep !== undefined) {\n\t\t\tconst d = this._slot.deps[towardDep];\n\t\t\tif (d !== undefined) d._up([m], undefined, route);\n\t\t} else {\n\t\t\tfor (const dep of this._slot.deps) dep._up([m], undefined, route);\n\t\t}\n\t}\n\n\t// ── PAUSE/RESUME lockset (R-pause-lockset) + modes (R-pause-modes) ──\n\n\tprivate _isPaused(): boolean {\n\t\treturn this._control.pauseLockset.size > 0;\n\t}\n\n\tprivate _hasBoundaryPauseLock(): boolean {\n\t\tif (this._slot.pausable === false) return false;\n\t\treturn this._control.pauseLockset.size > 0;\n\t}\n\n\tprivate _isAsyncPool(): boolean {\n\t\treturn (\n\t\t\tthis._slot.handle !== null &&\n\t\t\tthis._slot.dispatcher.poolKind(this._slot.handle.poolId) === \"async\"\n\t\t);\n\t}\n\n\tprivate _pauseAcquire(lockId: unknown): void {\n\t\tthis._control.pauseLockset.add(lockId); // Set => same-id repeat PAUSE is idempotent\n\t}\n\n\tprivate _pauseRelease(lockId: unknown): void {\n\t\tif (!this._control.pauseLockset.has(lockId)) return; // unknown id => no-op\n\t\tthis._control.pauseLockset.delete(lockId);\n\t\t// R-pull (D59 / D272): releasing an EXTERNAL pause lock can unblock an owed demand.\n\t\t// Pull quiet is activePull-derived and never stored in pauseLockset.\n\t\tif (this._slot.pull && this._control.demandOwed !== undefined) this._fireOwedDemandIfReady();\n\t\tif (this._hasBoundaryPauseLock()) return; // another external lock still held => stay paused\n\t\tscheduleBoundaryDrain(this._core);\n\t\tif (this._slot.pull) return; // pull nodes stay quiet until PULL, even after external resume\n\t\tthis._onResume();\n\t}\n\n\tprivate _onResume(): void {\n\t\t// BH3: a node that terminated while paused discards its buffer and never\n\t\t// replays/recomputes (terminal-is-forever).\n\t\tif (this._value.terminal !== undefined) {\n\t\t\tthis._control.pauseBuffer = [];\n\t\t\tthis._control.pausedDepWaveOccurred = false;\n\t\t\tthis._control.demandOwed = undefined;\n\t\t\tthis._control.activePull = undefined;\n\t\t\tthis._control.pullDirtyOwed = false;\n\t\t\treturn;\n\t\t}\n\t\t// Non-pull pause/resume (R-pause-modes): drain buffered settle slices (resumeAll /\n\t\t// async-at-paused, R-async-paused), then fire a coalesced dep-wave once (default mode).\n\t\t// A PULL node does not resume by draining here; its demand fires through _onDemand.\n\t\tif (this._control.pauseBuffer.length > 0) {\n\t\t\tconst buf = this._control.pauseBuffer;\n\t\t\tthis._control.pauseBuffer = [];\n\t\t\tfor (const wave of buf) this._down(wave);\n\t\t}\n\t\tif (this._control.pausedDepWaveOccurred) {\n\t\t\tthis._control.pausedDepWaveOccurred = false;\n\t\t\tthis._tryRun();\n\t\t}\n\t}\n\n\t/**\n\t * R-pull (D269): can this pull node fire a demand NOW? — not terminal, settle-ready (_pending===0),\n\t * and no OTHER (non-pullId) lock holds it paused. The gate that decides fire-now vs OWE.\n\t */\n\tprivate _canFireDemand(): boolean {\n\t\tif (this._value.terminal !== undefined || this._wave.pending > 0) return false;\n\t\treturn this._control.pauseLockset.size === 0;\n\t}\n\n\t/**\n\t * R-pull (D269/D272): deliver ONE demand pulse — install activePull so the demand wave may\n\t * emit, fire it, then clear activePull so the node is quiet again (1:1).\n\t */\n\tprivate _deliverPullDemand(demand: PullDemand): void {\n\t\tthis._control.demandOwed = undefined;\n\t\tthis._control.activePull = demand;\n\t\tthis._control.inDeliverDemand = true;\n\t\ttry {\n\t\t\tthis._firePullDemand();\n\t\t} finally {\n\t\t\tthis._control.activePull = undefined;\n\t\t\tthis._control.inDeliverDemand = false;\n\t\t}\n\t}\n\n\t/**\n\t * R-pull (D269): a cone-routed PULL of THIS node's pullId arrived (R-up-routing) = a DEMAND.\n\t * Fire immediately if able; else OWE it — pin-5 (a dep DIRTY in flight, _pending>0) or F4/F5 (an\n\t * external PAUSE lock co-holds the node) — and fire when the node next becomes able. A demand\n\t * arriving WHILE a delivery is in flight (synchronous re-entry) is DROPPED (1:1, QA guard).\n\t */\n\tprivate _onDemand(demand: PullDemand): void {\n\t\tif (this._control.inDeliverDemand) return; // re-entrant demand during an active delivery → drop (1:1)\n\t\tif (this._canFireDemand()) this._deliverPullDemand(demand);\n\t\telse this._control.demandOwed = demand; // latest owed params wins (D269/D272)\n\t}\n\n\t/**\n\t * R-pull (D55): service ONE demand. Delivery content = the orthogonal pausable mode:\n\t *   - 'resumeAll' → drain the buffered BACKLOG (each `_down` re-synthesizes a leading DIRTY, so\n\t *     the per-entry replay is DIRTY-before-DATA — R-pause-modes per-entry arrival order);\n\t *   - true → deliver the coalesced LATEST as ONE DIRTY-before-DATA wave (pin 2: the quiet absorb\n\t *     suppressed the dep's original DIRTY, so the demand wave restores it before the value).\n\t * Neither branch fires when nothing changed since the last demand → the demand is SILENT.\n\t * Called by `_deliverPullDemand` only when settle-ready; the caller has released the pullId, so\n\t * `_markDirty` relays the leading DIRTY (not absorbed).\n\t */\n\tprivate _firePullDemand(): void {\n\t\tlet drainedBuffer = false;\n\t\tif (this._control.pauseBuffer.length > 0) {\n\t\t\tconst buf = this._control.pauseBuffer;\n\t\t\tthis._control.pauseBuffer = [];\n\t\t\tfor (const wave of buf) this._down(wave);\n\t\t\tdrainedBuffer = true;\n\t\t}\n\t\tif (drainedBuffer) return;\n\t\tif (this._control.pausedDepWaveOccurred) {\n\t\t\t// QA-B2: only deliver if the fn can actually run this wave (settle-ready + first-run gate\n\t\t\t// open). A gated run emits no DATA, so emitting the leading DIRTY would STRAND downstream\n\t\t\t// — the exact wedge this feature exists to prevent (NoWedgeWhileQuiet). When gated, stay\n\t\t\t// SILENT and KEEP _pausedDepWaveOccurred so a later demand (once every dep has settled)\n\t\t\t// delivers. Mirrors _settleRewire's pre-_markDirty gate.\n\t\t\tconst gated =\n\t\t\t\tthis._slot.handle !== null &&\n\t\t\t\t!this._wave.hasCalledFnOnce &&\n\t\t\t\t!(this._slot.partial || this._allDepsSettled());\n\t\t\tif (this._wave.pending > 0 || gated) return;\n\t\t\tthis._control.pausedDepWaveOccurred = false;\n\t\t\tthis._wave.emittedDirtyThisWave = false;\n\t\t\tthis._control.pullDirtyOwed = true;\n\t\t\ttry {\n\t\t\t\tthis._tryRun(); // fn DATA triggers DIRTY-before-DATA; no DATA means no output.\n\t\t\t} finally {\n\t\t\t\tthis._control.pullDirtyOwed = false;\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tif (this._slot.handle !== null) {\n\t\t\tif (!this._wave.hasCalledFnOnce && !(this._slot.partial || this._allDepsSettled())) return;\n\t\t\tthis._wave.emittedDirtyThisWave = false;\n\t\t\tthis._control.pullDirtyOwed = true;\n\t\t\ttry {\n\t\t\t\tthis._runWave();\n\t\t\t} finally {\n\t\t\t\tthis._control.pullDirtyOwed = false;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * R-pull (D269): fire a demand that was OWED (deferred at demand time) once the node becomes\n\t * able — called from the dep-settle arms (DATA/RESOLVED/INVALIDATE/terminal drain _pending, pin-5\n\t * + B1/F6) and from `_pauseRelease` (an external PAUSE lock releases, F4/F5).\n\t */\n\tprivate _fireOwedDemandIfReady(): void {\n\t\tif (this._control.inDeliverDemand) return; // don't re-enter during an active delivery (1:1, QA guard)\n\t\tif (this._slot.pull && this._control.demandOwed !== undefined && this._canFireDemand()) {\n\t\t\tthis._deliverPullDemand(this._control.demandOwed);\n\t\t}\n\t}\n\n\t/** Should an outgoing settle slice be deferred into the pause buffer? */\n\tprivate _shouldBufferOnPause(): boolean {\n\t\t// D44: pausable mode is the OUTER gate over R-async-paused buffering.\n\t\t// false: ignore PAUSE/RESUME ENTIRELY — never buffer, keep producing (R-pause-modes; resolves B20).\n\t\tif (this._slot.pausable === false) return false;\n\t\tif (!this._isPaused() && !this._isPullQuiet()) return false;\n\t\t// resumeAll: production-gating — buffer the node's own (sync/async) settle slice too.\n\t\tif (this._slot.pausable === \"resumeAll\") return true;\n\t\t// true (default): PAUSE gates recomputation/propagation, NOT a leaf source's own production.\n\t\t// An async COMPUTE node's (deps>0) in-flight result buffers (R-async-paused / C-2); a depless\n\t\t// async leaf source's own production delivers immediately (R-pause-modes / C-10).\n\t\tif (!this._wave.insideRunWave && this._isAsyncPool() && this._slot.deps.length > 0) return true;\n\t\treturn false;\n\t}\n\n\t/** R-invalidate-idempotent: clear cache + flush + cascade; no-op if nothing cached. */\n\tprivate _invalidate(delivery?: DeliveryMeta): void {\n\t\tif (!this._value.hasData) return; // never-populated or already-reset → no-op\n\t\tthis._value.cache = SENTINEL;\n\t\tthis._value.hasData = false;\n\t\tthis._value.status = \"sentinel\";\n\t\tthis._value.replayRing = []; // BH6: invalidated values are stale — don't replay them\n\t\tfor (const fn of this._hooks.onInvalidate) fn();\n\t\tthis._emitToSubs([\"INVALIDATE\"], delivery);\n\t}\n\n\t// B42 (R-deps-terminal): ALL deps TERMINAL = every dep has reached COMPLETE *or* an ABSORBED\n\t// ERROR. Block only on a LIVE dep (_depTerminal[i] === undefined); an errored dep (terminal = the\n\t// error payload, which R-data-payload guarantees is !== undefined and non-boolean) COUNTS as\n\t// terminal-done. Was\n\t// `tm !== true`, which wedged a node whose errorWhenDepsError:false dep ERRORed (it never\n\t// auto-completed even after every other dep completed). Drives the completeWhenDepsComplete cascade.\n\tprivate _allDepsTerminal(): boolean {\n\t\tif (this._slot.deps.length === 0) return false;\n\t\tfor (const tm of this._dep.terminal) if (tm === undefined) return false;\n\t\treturn true;\n\t}\n\n\t/** R-terminal: resubscribable reset clears terminal + dep state + re-arms the gate. */\n\tprivate _resetLifecycle(): void {\n\t\tfor (const u of this._dep.unsubs) if (u) u();\n\t\tthis._dep.unsubs = [];\n\t\tthis._dep.idxBoxes = [];\n\t\tthis._lifecycle.subscribers.clear();\n\t\tthis._lifecycle.activated = false;\n\t\tthis._value.terminal = undefined;\n\t\tthis._value.hasTorndown = false;\n\t\tthis._wave.hasCalledFnOnce = false;\n\t\tthis._resetDepState();\n\t\tthis._control.pauseLockset.clear();\n\t\tthis._control.pauseBuffer = [];\n\t\tthis._control.pausedDepWaveOccurred = false;\n\t\tthis._control.demandOwed = undefined; // R-pull (D269): drop any deferred demand\n\t\tthis._control.activePull = undefined;\n\t\tthis._control.pullDirtyOwed = false;\n\t\tthis._value.replayRing = []; // BH6\n\t\tconst isCompute = this._slot.handle !== null || this._slot.deps.length > 0;\n\t\tif (isCompute) {\n\t\t\tthis._value.cache = SENTINEL;\n\t\t\tthis._value.hasData = false;\n\t\t\tthis._value.status = \"sentinel\";\n\t\t} else {\n\t\t\tthis._value.status = this._value.hasData ? \"settled\" : \"sentinel\";\n\t\t}\n\t\tif (!this._privateState.persist) this._privateState.value = SENTINEL;\n\t}\n\n\tprivate _emitToSubs(msg: Message, delivery?: DeliveryMeta): void {\n\t\tif (this._released) return;\n\t\t// Copy guards against subscribe/unsubscribe during iteration.\n\t\tconst subs = [...this._lifecycle.subscribers];\n\t\tfor (const sink of subs) sink(msg, delivery);\n\t}\n\n\t/** Batch commit (R-batch-coalesce): deliver the deferred tier-3 wave now. */\n\t__commitBatchedWave(wave: Wave): void {\n\t\tthis._wave.batchDirtyOwed = false; // commit delivers the real settle (BH1)\n\t\tthis._down(wave); // batch is inactive at commit -> processes normally\n\t}\n\n\t/** Batch rollback: balance the immediate DIRTY with a RESOLVED so downstream un-dirties. */\n\t__rollbackBatched(): void {\n\t\t// BH1: keyed on _batchDirtyOwed (not _emittedDirtyThisWave, which a fn wave between\n\t\t// defer and rollback would have reset) so the balancing RESOLVED is never skipped.\n\t\tif (this._wave.batchDirtyOwed) {\n\t\t\tthis._wave.batchDirtyOwed = false;\n\t\t\tthis._wave.emittedDirtyThisWave = false;\n\t\t\tthis._value.status = this._value.hasData ? \"settled\" : \"sentinel\";\n\t\t\tthis._emitToSubs([\"RESOLVED\"]);\n\t\t}\n\t}\n\n\t/** B49: enqueue a committed-boundary task on this node's graph-local core. */\n\t__deferBoundary(fn: () => void, batchToken?: object): void {\n\t\tdeferRewire(this._core, fn, {\n\t\t\tbatchToken,\n\t\t\tisReady: () => !this._hasBoundaryPauseLock(),\n\t\t});\n\t}\n}\n\n/**\n * Construct a node (R-node-iface / D5 / L1.9 deps-first).\n *   node([], null, { initial })       — state node (manual source; emit via .down)\n *   node([], fn)                        — producer (runs on activation)\n *   node([a, b], fn)                    — compute / derived\n *   node([dep])                         — passthrough wire\n */\nexport function node<T = unknown>(\n\tdeps: Node<unknown>[] = [],\n\thandleOrFn: Handle | NodeFn | null = null,\n\topts: NodeOptions<T> = {},\n): Node<T> {\n\treturn new Node<T>(deps, handleOrFn, opts);\n}\n\n/**\n * Construct a dynamicNode (R-dynamic-node / D35) — a node variant whose fn reads a\n * subset of a fixed superset of deps per invocation via `ctx.track(i)`. All declared\n * deps participate in wave tracking; an unread dep's change re-runs the fn, which re-emits\n * its current value as DATA (D49 removed equals-absorption — dedup is opt-in via\n * distinctUntilChanged). Intra-graph only (D22).\n */\nexport function dynamicNode<T = unknown>(\n\tdeps: Node<unknown>[],\n\tfn: NodeFn,\n\topts: NodeOptions<T> = {},\n): Node<T> {\n\treturn new Node<T>(deps, fn, { ...opts, dynamic: true });\n}\n","/**\n * Graph checkpoint public data shape (D83/D86/D90/D116).\n *\n * Checkpoint is a graph lifecycle snapshot: strict-JSON-compatible data, no storage I/O,\n * no observe-log replay, and no restore runtime in this first TS slice.\n */\n\nimport { type StrictJsonValue, strictJsonCodec } from \"../json/codec.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { NodeVersionJson } from \"../node/versioning.js\";\nimport { SENTINEL } from \"../protocol/messages.js\";\n\nexport const GRAPH_CHECKPOINT_VERSION = \"graphrefly.checkpoint.v1\" as const;\n\nexport type GraphCheckpointVersion = typeof GRAPH_CHECKPOINT_VERSION;\n\nexport type GraphCheckpointJson = StrictJsonValue;\n\nexport type GraphCheckpointValue =\n\t| { kind: \"SENTINEL\" }\n\t| { kind: \"DATA\"; data: GraphCheckpointJson };\n\nexport type GraphCheckpointTerminal =\n\t| { kind: \"none\" }\n\t| { kind: \"COMPLETE\" }\n\t| { kind: \"ERROR\"; error: GraphCheckpointJson };\n\nexport type GraphCheckpointFactory =\n\t| {\n\t\t\tkind: \"registry-ref\";\n\t\t\tref: string;\n\t\t\tconfig?: GraphCheckpointJson;\n\t\t\tconfigVersion?: GraphCheckpointJson;\n\t  }\n\t| { kind: \"local-only\"; name: string; reason: string };\n\nexport interface GraphCheckpointNode {\n\tid: string;\n\tname?: string;\n\tfactory: GraphCheckpointFactory;\n\tstatus: string;\n\tdeps: string[];\n\tvalue: GraphCheckpointValue;\n\tbackendState?: GraphCheckpointJson;\n\tversion?: NodeVersionJson;\n\tterminal: GraphCheckpointTerminal;\n\tlifecycle: { activated: boolean; hasCalledFnOnce: boolean };\n\tctxState: { persist: boolean; value: GraphCheckpointValue };\n\tmeta?: { [key: string]: GraphCheckpointJson };\n}\n\nexport interface GraphCheckpointEdge {\n\tfrom: string;\n\tto: string;\n}\n\nexport interface GraphCheckpointMount {\n\tat: string;\n\tcheckpoint: GraphCheckpoint;\n}\n\nexport interface GraphCheckpoint {\n\tversion: GraphCheckpointVersion;\n\tname?: string;\n\tnodes: GraphCheckpointNode[];\n\tedges: GraphCheckpointEdge[];\n\tmounts?: GraphCheckpointMount[];\n}\n\nexport function toCheckpointJson(value: unknown, path = \"$\"): GraphCheckpointJson {\n\ttry {\n\t\treturn strictJsonCodec.decode(strictJsonCodec.encode(value)) as GraphCheckpointJson;\n\t} catch (cause) {\n\t\tthrow new TypeError(`checkpoint: value at ${path} is not strict JSON compatible`, {\n\t\t\tcause,\n\t\t});\n\t}\n}\n\nexport function checkpointValue(\n\tvalue: unknown,\n\thasData: boolean,\n\tpath: string,\n): GraphCheckpointValue {\n\tif (!hasData || value === SENTINEL) return { kind: \"SENTINEL\" };\n\treturn { kind: \"DATA\", data: toCheckpointJson(value, path) };\n}\n\nexport function checkpointTerminal(value: unknown, path: string): GraphCheckpointTerminal {\n\tif (value === undefined) return { kind: \"none\" };\n\tif (value === true) return { kind: \"COMPLETE\" };\n\treturn { kind: \"ERROR\", error: toCheckpointJson(value, path) };\n}\n\ntype BackendStateContributor = () => unknown;\n\nconst backendStateContributors = new WeakMap<Node<unknown>, BackendStateContributor>();\n\n/** @internal D160: collection-owned backend checkpoint contributor for graph checkpoint. */\nexport function registerBackendStateContributor(\n\tnode: Node<unknown>,\n\tcontributor: BackendStateContributor,\n): void {\n\tbackendStateContributors.set(node, contributor);\n}\n\n/** @internal D160: capture a node's collection backend state when it has a contributor. */\nexport function checkpointBackendStateOfNode(\n\tnode: Node<unknown>,\n\tpath: string,\n): GraphCheckpointJson | undefined {\n\tconst contributor = backendStateContributors.get(node);\n\tif (contributor === undefined) return undefined;\n\treturn toCheckpointJson(contributor(), path);\n}\n","/**\n * Operators as free-standing factory definitions (D43 / D6 / D40 Catalog-first).\n *\n * Operators are `node` sugar (D6), NOT verbs (D4) and NEVER in parity (D24). Each is a\n * pure {@link Operator} spec — `{factory, body, opts}` — built on the bare `node` primitive\n * (NOT the `derived` verb): `body` reads ctx dep slots positionally and emits via\n * `ctx.down`. Two ways to instantiate:\n *\n *   - {@link initNode}(op, deps, opts?) — bare, no Graph; returns a working `Node<T>`.\n *   - `g.initNode(op, deps, opts?)` — graph-bound; the SAME call, plus inspection registration\n *     (the real factory name lands in the graph's `_entries`, so describe/observe/profile\n *     show it — D6/R-describe — while the node stays thin, R-node-thin).\n *\n * The D30 throw→ERROR boundary lives once, in the free {@link initNode} (which `g.initNode`\n * funnels through). The pure-ts `operatorOpts/partialOperatorOpts/gatedOperatorOpts` trio is\n * NOT ported: its sole job (`describeKind:\"derived\"`) is dead under D6/D39 (factory = the\n * REAL operator name); only the `partial`/`terminalAsRealInput` flags survive, carried\n * per-operator in `op.opts`.\n *\n * Config is folded into the factory (`map(fn)`, `scan(reducer, seed)`, `take(n)`, `merge()`),\n * so fn params are annotated where the source type can't be inferred (RxJS-pipe cost);\n * dep-type safety is recovered by the typed `g.initNode` overloads.\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepCount,\n\tdepLatest,\n\tdepTerminal,\n\tisTerminalComplete,\n\tisTerminalError,\n\ttype NodeFn,\n\tterminalErrorValue,\n} from \"../ctx/types.js\";\nimport type { NodeCore } from \"../node/core.js\";\nimport { Node, type NodeOptions, withNodeCore } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport { type GraphCheckpointJson, toCheckpointJson } from \"./checkpoint.js\";\nimport type { GraphRestoreDefinition, GraphRestoreEntry, GraphRestoreRegistry } from \"./restore.js\";\n\n/**\n * A free-standing operator definition (D43). `TIn` = the element type each dep delivers\n * (the operator reads `depLatest(ctx, i) as TIn`); `TOut` = the emitted value type.\n * `__in`/`__out` are phantom-only (never assigned) — they let `g.initNode` infer + check the\n * dep tuple against the operator without an explicit type argument.\n */\nexport interface Operator<TIn = unknown, TOut = unknown> {\n\t/** Real operator name shown in describe (D6/L1.5) — recorded at `_add` by `g.initNode`. */\n\treadonly factory: string;\n\t/** The ctx-body: reads ctx dep slots positionally, emits via `ctx.down`. */\n\treadonly body: (ctx: Ctx) => void;\n\t/** Behavioral node options the operator needs (e.g. `partial:true` for combine-family). */\n\treadonly opts?: Partial<NodeOptions<TOut>>;\n\t/**\n\t * D97/D100 restore metadata derived from a named definition or static built-in config.\n\t * This is semantic metadata only; dispatcher handles stay graph-local runtime state.\n\t */\n\treadonly restore?: {\n\t\tref: string;\n\t\tconfig?: GraphCheckpointJson;\n\t\tconfigVersion?: GraphCheckpointJson;\n\t};\n\t/** @internal phantom — never set; carries the dep element type for `g.initNode` inference. */\n\treadonly __in?: TIn;\n\t/** @internal phantom — never set; carries the output value type. */\n\treadonly __out?: TOut;\n}\n\ntype MutableRestoreRegistry = Map<string, GraphRestoreEntry> | Record<string, GraphRestoreEntry>;\n\nexport type RestoreRegistryEntry = GraphRestoreEntry;\n\nexport interface Definition<S = unknown, T = unknown> extends GraphRestoreDefinition<S, T> {\n\treadonly ref: string;\n\treadonly fn: (v: S) => T;\n}\n\nexport interface DefineOpts {\n\tregistry?: MutableRestoreRegistry;\n}\n\nfunction registryHas(registry: MutableRestoreRegistry, ref: string): boolean {\n\treturn registry instanceof Map ? registry.has(ref) : Object.hasOwn(registry, ref);\n}\n\nfunction registrySet(\n\tregistry: MutableRestoreRegistry,\n\tref: string,\n\tentry: GraphRestoreEntry,\n): void {\n\tif (registryHas(registry, ref)) {\n\t\tthrow new Error(`restoreRegistry: duplicate ref '${ref}'`);\n\t}\n\tif (registry instanceof Map) registry.set(ref, entry);\n\telse registry[ref] = entry;\n}\n\nexport function addToRestoreRegistry(\n\tregistry: MutableRestoreRegistry,\n\tentry: GraphRestoreEntry,\n): void {\n\tregistrySet(registry, entry.ref, entry);\n}\n\nexport function restoreRegistry(\n\tentries: readonly GraphRestoreEntry[] = [],\n\tbase?: GraphRestoreRegistry,\n): Map<string, GraphRestoreEntry> {\n\tconst out = new Map<string, GraphRestoreEntry>();\n\tif (base instanceof Map) {\n\t\tfor (const [ref, entry] of base) registrySet(out, ref, entry);\n\t} else if (base !== undefined) {\n\t\tfor (const [ref, entry] of Object.entries(base)) registrySet(out, ref, entry);\n\t}\n\tfor (const entry of entries) addToRestoreRegistry(out, entry);\n\treturn out;\n}\n\nfunction isDefinition<S, T>(fn: ((v: S) => T) | Definition<S, T>): fn is Definition<S, T> {\n\treturn typeof fn === \"object\" && fn !== null && (fn as Definition<S, T>).kind === \"definition\";\n}\n\nexport function define<S, T>(\n\tref: string,\n\tfn: (v: S) => T,\n\topts: DefineOpts = {},\n): Definition<S, T> {\n\tconst jsonRef = toCheckpointJson(ref, \"define.ref\");\n\tif (typeof jsonRef !== \"string\") throw new TypeError(\"define: ref must be a string\");\n\tconst definition: Definition<S, T> = {\n\t\tkind: \"definition\",\n\t\tref: jsonRef,\n\t\tfn,\n\t};\n\tif (opts.registry !== undefined) addToRestoreRegistry(opts.registry, definition);\n\treturn definition;\n}\n\n/**\n * Instantiate an operator as a bare `Node<T>` — NO Graph required (D43 bare-node path).\n * Wraps `op.body` in the D30 value-throw→ERROR boundary; merges `op.opts` with caller `opts`\n * (caller wins, so `partial`/`pool`/`dispatcher` overrides take effect). The\n * dispatcher defaults to the process-global (D26) unless `opts.dispatcher` is passed.\n *\n * `g.initNode` is the same call PLUS graph registration; graph inspection\n * (describe/observe/profile) requires that path — a node built bare here is not registered in\n * any graph's index.\n */\nexport function initNode<TIn, TOut>(\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut> = {},\n): Node<TOut> {\n\treturn makeInitNode(op, deps, opts);\n}\n\n/** @internal Graph-bound operator instantiation into a graph-local B49 core. */\nexport function initNodeWithCore<TIn, TOut>(\n\tcore: NodeCore,\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut> = {},\n): Node<TOut> {\n\treturn withNodeCore(core, () => makeInitNode(op, deps, opts));\n}\n\nfunction makeInitNode<TIn, TOut>(\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut>,\n): Node<TOut> {\n\tconst body = operatorNodeFn(op);\n\t// D43-reserved / D51: stamp the operator's real factory onto the bare node so a runtime *Map\n\t// inner (created here via fromAny, NOT registered in any graph) is named in describe's\n\t// auto-discovery. A graph-bound g.initNode also records it in `_entries` (entry.factory wins\n\t// there); this field is only read for a node absent from the graph index. Caller opts win.\n\treturn new Node<TOut>([...deps], body, { factory: op.factory, ...op.opts, ...opts });\n}\n\n/** @internal Build the dispatcher body for an Operator spec. */\nexport function operatorNodeFn<TIn, TOut>(op: Operator<TIn, TOut>): NodeFn {\n\treturn (ctx) => {\n\t\ttry {\n\t\t\top.body(ctx);\n\t\t} catch (e) {\n\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"operator threw without a valid error payload\")]]); // D30: value-level throw → ERROR\n\t\t}\n\t};\n}\n\n// ── Slice 1 — single-dep map / take / control (CSP-2.7 catalog re-derive, D40) ──\n// All read dep 0 positionally + emit via ctx.down. Under D49 every occurrence is DATA (no\n// equals-absorption); a body that returns WITHOUT emitting gets a substrate-synthesized undirty\n// RESOLVED (R-resolved-undirty) — so a \"skip this wave\" is a bare `return`. Terminal-emitting\n// operators (reduce/last/find/elementAt) read `depTerminal(ctx, 0)` via the\n// `completeWhenDepsComplete:false + terminalAsRealInput:true` flags (R-deps-terminal): the fn fires\n// on the source's COMPLETE and emits its final value. NOT 1:1 pure-ts ports — the frozen reference\n// (D41) uses a producer + internal `subscribeOr`, the D45-banned describe island; these are\n// declared-dep nodes whose single edge `describe` shows truthfully.\n\n/** map: emit fn(value). A named {@link define} makes the map restorable via the map descriptor (D101). */\nexport function map<S, T>(fn: ((v: S) => T) | Definition<S, T>): Operator<S, T> {\n\tif (isDefinition(fn)) {\n\t\treturn mapFromFunction(fn.fn, {\n\t\t\tref: \"map\",\n\t\t\tconfig: { fn: toCheckpointJson(fn.ref, `map.fn`) },\n\t\t});\n\t}\n\treturn mapFromFunction(fn);\n}\n\nfunction mapFromFunction<S, T>(\n\tfn: (v: S) => T,\n\trestore?: {\n\t\tref: string;\n\t\tconfig?: GraphCheckpointJson;\n\t\tconfigVersion?: GraphCheckpointJson;\n\t},\n): Operator<S, T> {\n\treturn {\n\t\tfactory: \"map\",\n\t\t...(restore ? { restore } : {}),\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b) ctx.down([[\"DATA\", fn(v as S)]]);\n\t\t},\n\t};\n}\n\n/** filter: emit value only when pred(value) (else skip the wave). */\nexport function filter<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"filter\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b) if (pred(v as S)) ctx.down([[\"DATA\", v]]);\n\t\t},\n\t};\n}\n\n/** scan: stateful accumulator over the upstream (acc seeded once, kept in ctx.state). */\nexport function scan<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T> {\n\treturn {\n\t\tfactory: \"scan\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet acc = ctx.state.get<T>() ?? seed;\n\t\t\tfor (const v of b) {\n\t\t\t\tacc = reducer(acc, v as S);\n\t\t\t\tctx.down([[\"DATA\", acc]]);\n\t\t\t}\n\t\t\tctx.state.set(acc);\n\t\t},\n\t};\n}\n\n/** take: emit the first n values, then COMPLETE (terminal-is-forever). */\nexport function take<S>(n: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"take\",\n\t\trestore: { ref: \"take\", config: { n: toCheckpointJson(n, \"take.n\") } },\n\t\tbody: (ctx) => {\n\t\t\tif (n <= 0) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tif (count >= n) return; // already satisfied\n\t\t\tfor (const v of b) {\n\t\t\t\tif (count >= n) break;\n\t\t\t\tcount += 1;\n\t\t\t\tctx.down(count >= n ? [[\"DATA\", v], [\"COMPLETE\"]] : [[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(count);\n\t\t},\n\t};\n}\n\n/** distinctUntilChanged: emit only when the value differs from the previous emit. */\nexport function distinctUntilChanged<S>(eq: (a: S, b: S) => boolean = Object.is): Operator<S, S> {\n\treturn {\n\t\tfactory: \"distinctUntilChanged\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tconst prev = ctx.state.get<{ v: S }>();\n\t\t\tlet last = prev?.v;\n\t\t\tlet hasLast = prev !== undefined;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (hasLast && eq(last as S, v)) continue;\n\t\t\t\tlast = v;\n\t\t\t\thasLast = true;\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tif (hasLast) ctx.state.set({ v: last as S });\n\t\t},\n\t};\n}\n\n/**\n * merge: interleave several sources — emit each DATA from whichever dep fired. `partial:true`\n * (combine-family): fires on any single dep, not gated on all deps settling.\n */\nexport function merge<T>(): Operator<T, T> {\n\treturn {\n\t\tfactory: \"merge\",\n\t\topts: { partial: true },\n\t\tbody: (ctx) => {\n\t\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\tif (b && b.length > 0) {\n\t\t\t\t\tfor (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * reduce: accumulate over the whole source, emit ONE final value on the source's COMPLETE\n * (RxJS `reduce`). Unlike {@link scan} (which emits every step), reduce stays quiet until the\n * source terminates. `completeWhenDepsComplete:false + terminalAsRealInput:true`: the fn fires on\n * the source COMPLETE (reading `terminal===true`) and emits the accumulator + COMPLETE. An empty\n * source emits the seed (RxJS parity). A source ERROR auto-forwards (errorWhenDepsError default).\n */\nexport function reduce<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T> {\n\treturn {\n\t\tfactory: \"reduce\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet acc = ctx.state.get<T>() ?? seed;\n\t\t\tif (b) for (const v of b) acc = reducer(acc, v as S);\n\t\t\tctx.state.set(acc);\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"DATA\", acc], [\"COMPLETE\"]]);\n\t\t\t// else (live DATA wave): no emit → substrate-synthesized undirty RESOLVED (D49).\n\t\t},\n\t};\n}\n\n/**\n * pairwise: emit `[previous, current]` for each consecutive pair; the very first value produces no\n * pair (quiet → undirty RESOLVED). Previous value is kept in `ctx.state`.\n */\nexport function pairwise<S>(): Operator<S, readonly [S, S]> {\n\treturn {\n\t\tfactory: \"pairwise\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tconst st = ctx.state.get<{ prev: S }>();\n\t\t\tlet prev = st?.prev;\n\t\t\tlet hasPrev = st !== undefined;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (hasPrev) ctx.down([[\"DATA\", [prev as S, v] as const]]);\n\t\t\t\tprev = v;\n\t\t\t\thasPrev = true;\n\t\t\t}\n\t\t\tif (hasPrev) ctx.state.set({ prev: prev as S });\n\t\t},\n\t};\n}\n\n/** skip: drop the first `n` DATA values, then pass the rest through. */\nexport function skip<S>(n: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"skip\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tfor (const v of b) {\n\t\t\t\tif (count < n) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(count);\n\t\t},\n\t};\n}\n\n/**\n * takeWhile: emit values while `pred` holds; on the first value that fails `pred`, COMPLETE\n * WITHOUT emitting it (RxJS default, non-inclusive). Terminal-is-forever once it completes.\n */\nexport function takeWhile<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"takeWhile\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (pred(v)) ctx.down([[\"DATA\", v]]);\n\t\t\t\telse {\n\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * first: emit the first value matching `pred` (or simply the first value), then COMPLETE. EDGE\n * (RxJS divergence, flagged — same class as last/find/elementAt): if the source COMPLETEs with no\n * matching value, the substrate auto-cascades a bare COMPLETE (no value); RxJS `first()` throws\n * EmptyError. Could align to `[[ERROR, EmptyError]]` (expressible) if strict RxJS parity is wanted.\n */\nexport function first<S>(pred?: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"first\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (!pred || pred(v)) {\n\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// no match in this wave → undirty RESOLVED (await next match)\n\t\t},\n\t};\n}\n\n/**\n * last: emit the last value matching `pred` (or the last value) on the source's COMPLETE.\n * `completeWhenDepsComplete:false + terminalAsRealInput:true`. EDGE (RxJS divergence, flagged):\n * RxJS `last()` throws EmptyError when no value matched; we COMPLETE without a value (no throw) —\n * the clean-slate substrate has no \"complete-or-throw\" terminal and SENTINEL forbids emitting a\n * placeholder.\n */\nexport function last<S>(pred?: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"last\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b) for (const v of b) if (!pred || pred(v as S)) ctx.state.set({ v });\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) {\n\t\t\t\tconst st = ctx.state.get<{ v: S }>();\n\t\t\t\tctx.down(st ? [[\"DATA\", st.v], [\"COMPLETE\"]] : [[\"COMPLETE\"]]);\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * find: emit the first value matching `pred`, then COMPLETE. EDGE (RxJS divergence, flagged): RxJS\n * `find` emits `undefined` then COMPLETE when nothing matched — but `undefined` IS the SENTINEL\n * (R-sentinel), so a not-found source COMPLETE here emits a bare COMPLETE (no value).\n */\nexport function find<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"find\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tif (pred(v as S)) {\n\t\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]); // not found → bare COMPLETE\n\t\t},\n\t};\n}\n\n/**\n * elementAt: emit the value at zero-based `index`, then COMPLETE. EDGE (RxJS divergence, flagged):\n * RxJS throws ArgumentOutOfRangeError if the source completes before `index`; we COMPLETE without\n * a value (no throw), consistent with last/find.\n */\nexport function elementAt<S>(index: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"elementAt\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tif (count === index) {\n\t\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tctx.state.set(count);\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]); // index out of range → bare COMPLETE\n\t\t},\n\t};\n}\n\n/** Observer object for {@link tap} — lifecycle-aware side effects (RxJS tap observer form). */\nexport interface TapObserver<T> {\n\tdata?: (value: T) => void;\n\terror?: (err: unknown) => void;\n\tcomplete?: () => void;\n}\n\n/**\n * tap: invoke a side effect on each DATA (function form) or on data/error/complete (observer form);\n * values pass through unchanged. The observer form reads source terminals\n * (`completeWhenDepsComplete:false + errorWhenDepsError:false + terminalAsRealInput:true`) so it can\n * call `error`/`complete` then forward the terminal; the function form lets the substrate\n * auto-cascade terminals.\n */\nexport function tap<S>(fnOrObserver: ((v: S) => void) | TapObserver<S>): Operator<S, S> {\n\tif (typeof fnOrObserver === \"function\") {\n\t\tconst fn = fnOrObserver;\n\t\treturn {\n\t\t\tfactory: \"tap\",\n\t\t\tbody: (ctx) => {\n\t\t\t\tconst b = depBatch(ctx, 0);\n\t\t\t\tif (b)\n\t\t\t\t\tfor (const v of b) {\n\t\t\t\t\t\tfn(v as S);\n\t\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t\t}\n\t\t\t},\n\t\t};\n\t}\n\tconst obs = fnOrObserver;\n\treturn {\n\t\tfactory: \"tap\",\n\t\topts: {\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx) => {\n\t\t\tconst terminal = depTerminal(ctx, 0);\n\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\tobs.complete?.();\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(terminal)) {\n\t\t\t\tconst err = terminalErrorValue(terminal);\n\t\t\t\tobs.error?.(err);\n\t\t\t\tctx.down([[\"ERROR\", err]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b)\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tobs.data?.(v as S);\n\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * onFirstData (alias `tapFirst`): invoke `fn` exactly once on the first qualifying value (default\n * `where: v => v != null` — null/undefined pass through without counting as \"first\"), then pass all\n * values through unchanged. The one-shot guard is per-node `ctx.state` (NOT a factory closure, so a\n * second instantiation of the same factory re-arms — R-ctx-state).\n */\nexport function onFirstData<S>(\n\tfn: (v: S) => void,\n\topts?: { where?: (v: S) => boolean },\n): Operator<S, S> {\n\tconst where = opts?.where ?? ((v: S) => v != null);\n\treturn {\n\t\tfactory: \"onFirstData\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet fired = ctx.state.get<boolean>() ?? false;\n\t\t\tfor (const v of b) {\n\t\t\t\tif (!fired && where(v as S)) {\n\t\t\t\t\tfired = true;\n\t\t\t\t\tfn(v as S);\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(fired);\n\t\t},\n\t};\n}\n\n/** tapFirst: alias of {@link onFirstData} (the one-shot companion to {@link tap}). */\nexport const tapFirst = onFirstData;\n\n/** Options for {@link settle}. */\nexport interface SettleOpts<S> {\n\t/** Consecutive no-change waves before declaring convergence + COMPLETE. */\n\tquietWaves: number;\n\t/** Optional hard cap on total waves before forced COMPLETE. */\n\tmaxWaves?: number;\n\t/** Optional comparator; a DATA equal to the previous one does NOT reset the quiet counter. */\n\tequals?: (a: S, b: S) => boolean;\n}\n\n/** Internal settle accumulator state (per-node, R-ctx-state). */\ninterface SettleState<S> {\n\tlast: S | undefined;\n\thasValue: boolean;\n\tquiet: number;\n\twaves: number;\n\tdone: boolean;\n}\n\n/**\n * settle: forward each DATA unchanged, watch for convergence, COMPLETE once the source has been\n * quiet for `quietWaves` consecutive waves (or `maxWaves` elapsed). \"Wave\" = one fn invocation\n * (a DATA batch OR a bare undirty RESOLVED end-of-wave). No polling (R-no-polling) — the counter\n * advances only on real upstream waves. `settle`'s own `equals` is a body comparator, NOT the\n * removed substrate `equals` (D49).\n */\nexport function settle<S>(opts: SettleOpts<S>): Operator<S, S> {\n\tconst { quietWaves, maxWaves, equals } = opts;\n\tif (!Number.isInteger(quietWaves) || quietWaves < 1) {\n\t\tthrow new RangeError(`settle: quietWaves must be a positive integer (got ${quietWaves})`);\n\t}\n\tif (maxWaves != null && (!Number.isInteger(maxWaves) || maxWaves < 1)) {\n\t\tthrow new RangeError(`settle: maxWaves must be a positive integer when set (got ${maxWaves})`);\n\t}\n\treturn {\n\t\tfactory: \"settle\",\n\t\tbody: (ctx) => {\n\t\t\tconst st: SettleState<S> = ctx.state.get<SettleState<S>>() ?? {\n\t\t\t\tlast: undefined,\n\t\t\t\thasValue: false,\n\t\t\t\tquiet: 0,\n\t\t\t\twaves: 0,\n\t\t\t\tdone: false,\n\t\t\t};\n\t\t\tif (st.done) return;\n\t\t\tst.waves++;\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet sawChange = false;\n\t\t\tif (b && b.length > 0) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tconst next = v as S;\n\t\t\t\t\tconst isChange = !st.hasValue || equals == null || !equals(st.last as S, next);\n\t\t\t\t\tif (isChange) sawChange = true;\n\t\t\t\t\tst.last = next;\n\t\t\t\t\tst.hasValue = true;\n\t\t\t\t\tctx.down([[\"DATA\", next]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tst.quiet = sawChange ? 0 : st.quiet + 1;\n\t\t\tconst settled = st.hasValue && st.quiet >= quietWaves;\n\t\t\tconst exhausted = maxWaves != null && st.waves >= maxWaves;\n\t\t\tif (settled || exhausted) {\n\t\t\t\tst.done = true;\n\t\t\t\tctx.state.set(st);\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t\t// A no-DATA wave that didn't converge → bare undirty RESOLVED is synthesized by the\n\t\t\t// substrate (D49); nothing to emit here.\n\t\t},\n\t};\n}\n\n// ── Slice 3 — error-handling control (CSP-2.7, D40) ──\n// rescue/catchError ABSORB the source ERROR (errorWhenDepsError:false) and read the error payload\n// from `depTerminal(ctx, 0)` (R-deps-terminal). They set completeWhenDepsComplete:false so a\n// normal source COMPLETE is forwarded explicitly — which ALSO sidesteps B40 (the\n// completeWhenDepsComplete:true × absorbed-errored-dep auto-complete gap): there is no auto-complete\n// to block. valve is a [source, control] gate (state-verb-legitimate control input).\n\n/**\n * rescue (alias `catchError`): replace an upstream ERROR with a recovered value. On source DATA →\n * forward; on source ERROR → emit `recover(err)` as DATA (if `recover` throws, forward THAT as\n * ERROR); on source COMPLETE → COMPLETE. After recovery the source is terminal-errored (dead) so no\n * further values flow — the recovered value is the final cached value (matches the frozen pure-ts\n * reference; it does NOT auto-COMPLETE, RxJS-`catchError(()=>of(x))` divergence, flagged).\n */\nexport function rescue<S>(recover: (err: unknown) => S): Operator<S, S> {\n\treturn {\n\t\tfactory: \"rescue\",\n\t\topts: {\n\t\t\terrorWhenDepsError: false,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tconst terminal = depTerminal(ctx, 0);\n\t\t\tif (b) for (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t} else if (isTerminalError(terminal)) {\n\t\t\t\t// ERROR payload absorbed → recover.\n\t\t\t\ttry {\n\t\t\t\t\tctx.down([[\"DATA\", recover(terminalErrorValue(terminal))]]);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"rescue threw without a valid error payload\")]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/** catchError: RxJS-named alias of {@link rescue}. */\nexport const catchError = rescue;\n\n/** Options for {@link valve}. */\nexport interface ValveOpts {\n\t/**\n\t * Optional AbortController (or a `() => AbortController | undefined` factory): on the control's\n\t * truthy→falsy edge, `valve` calls `controller.abort()` — cancel an in-flight async boundary\n\t * (LLM/fetch) the caller threaded `controller.signal` into. An external-resource cleanup (like\n\t * `ctx.onDeactivation`), NOT an imperative reactive trigger (R-no-imperative).\n\t */\n\tabortInFlight?: AbortController | (() => AbortController | undefined);\n}\n\n/**\n * valve: forward the source's DATA only while `control` (dep 1) is truthy; when closed, stay quiet\n * (undirty RESOLVED). `[source, control]` declared deps + `partial:true` (the control wave can fire\n * before the source ever delivers). `completeWhenDepsComplete:false` — closing the gate (control\n * terminating) does NOT complete the valve; only the SOURCE's terminal (read via\n * `terminalAsRealInput`) is forwarded. The `state`-verb control input is a legitimate external\n * boundary (D4 / D54), not a forbidden imperative trigger.\n */\nexport function valve<S>(opts?: ValveOpts): Operator<S, S> {\n\tconst abortInFlight = opts?.abortInFlight;\n\treturn {\n\t\tfactory: \"valve\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst srcBatch = depBatch(ctx, 0);\n\t\t\tconst ctlBatch = depBatch(ctx, 1);\n\t\t\tconst srcTerminal = depTerminal(ctx, 0);\n\t\t\tconst controlValue = depLatest(ctx, 1) as boolean | undefined;\n\n\t\t\tif (abortInFlight != null) {\n\t\t\t\t// Fire abort on the truthy→falsy edge only (never on activation / no prior state).\n\t\t\t\tconst prev = ctx.state.get<{ ctl: boolean | undefined }>();\n\t\t\t\tif (prev?.ctl === true && !controlValue) {\n\t\t\t\t\tconst c = typeof abortInFlight === \"function\" ? abortInFlight() : abortInFlight;\n\t\t\t\t\tc?.abort();\n\t\t\t\t}\n\t\t\t\tctx.state.set({\n\t\t\t\t\tctl: controlValue === true ? true : controlValue == null ? undefined : false,\n\t\t\t\t});\n\t\t\t}\n\n\t\t\t// Source terminal forwarding (control terminal is absorbed by completeWhenDepsComplete:false).\n\t\t\tif (isTerminalComplete(srcTerminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(srcTerminal)) {\n\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(srcTerminal)]]);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (!controlValue) return; // gate closed → quiet (undirty RESOLVED)\n\n\t\t\tif (srcBatch && srcBatch.length > 0) {\n\t\t\t\tfor (const v of srcBatch) ctx.down([[\"DATA\", v]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Gate just opened this wave (control fired, source didn't): re-emit the last source value.\n\t\t\tconst srcLatest = depLatest(ctx, 0);\n\t\t\tif (ctlBatch && ctlBatch.length > 0 && srcLatest !== undefined) {\n\t\t\t\tctx.down([[\"DATA\", srcLatest as S]]);\n\t\t\t}\n\t\t},\n\t};\n}\n","/**\n * The Graph layer (CSP-2): convenience + inspection entry (D5 / R-graph-role).\n *\n * g.* sugar desugars to dispatcher.register + Node and auto-registers into the graph\n * inspection index (D27: sugar→ctx-fn conversion lives strictly here; the substrate node\n * only ever sees `(ctx)=>void`). The Graph owns naming, describe, mount, and the D30\n * value-level throw→ERROR boundary. The bare node()/dispatcher stay inspection-free\n * (R-node-thin).\n *\n * Canonical authority: ~/src/graphrefly — D3/D5/D27/D30/D36/D37/D39, R-graph-role,\n * R-describe, R-fn-contract, R-edges-derived, R-meta-presentation.\n */\n\nimport { type BatchCtx, batch as batchRun } from \"../batch/batch.js\";\nimport { type Ctx, depCount, depLatest, type NodeFn } from \"../ctx/types.js\";\nimport { type Dispatcher, defaultDispatcher } from \"../dispatcher/index.js\";\nimport { NodeCore } from \"../node/core.js\";\nimport {\n\tcheckpointStateOfNode,\n\tgetNodeOwner,\n\tisNodeActiveForRelease,\n\tisNodeRuntimeQuiescentForRelease,\n\tisNodeRuntimeReleased,\n\tNode,\n\ttype NodeOptions,\n\treleaseRuntimeOfNode,\n\tsetNodeOwner,\n\tsetNodeTopologyDepsChangedObserver,\n\tsubscriberCountOfNode,\n\twithEnvironmentDrivers,\n\twithNodeCore,\n} from \"../node/node.js\";\nimport type { NodeVersioningPolicy } from \"../node/versioning.js\";\nimport { errorPayload, messageTier, SENTINEL } from \"../protocol/messages.js\";\nimport {\n\tGRAPH_BLUEPRINT_VERSION,\n\ttype GraphBlueprint,\n\ttype GraphBlueprintOptions,\n\tgraphBlueprintDiagnostics,\n\tnormalizeTopology,\n\tnormalizeTopologyMeta,\n} from \"./blueprint.js\";\nimport {\n\tcheckpointBackendStateOfNode,\n\tcheckpointTerminal,\n\tcheckpointValue,\n\tGRAPH_CHECKPOINT_VERSION,\n\ttype GraphCheckpoint,\n\ttype GraphCheckpointFactory,\n\ttype GraphCheckpointJson,\n\ttype GraphCheckpointNode,\n\ttoCheckpointJson,\n} from \"./checkpoint.js\";\nimport {\n\ttype DescribeEdge,\n\ttype DescribeNode,\n\ttype DescribeOpts,\n\ttype DescribeSnapshot,\n\ttype GraphTopologySnapshot,\n\ttopologyFromDescribe,\n} from \"./describe.js\";\nimport { EnvironmentDrivers } from \"./environment.js\";\nimport type {\n\tNodeProfile,\n\tObserveStream,\n\tProfile,\n\tTopologyEvent,\n\tTopologyStream,\n} from \"./inspect.js\";\nimport { initNodeWithCore, type Operator } from \"./operators.js\";\n\n/** Map a tuple of Nodes to the tuple of their value types (typed value-level fn args). */\ntype DepValues<D extends readonly Node<unknown>[]> = {\n\t[K in keyof D]: D[K] extends Node<infer V> ? V : never;\n};\n\n/** Value-level derived fn: receives dep values, returns the next value (undefined = no emit). */\nexport type DerivedFn<D extends readonly Node<unknown>[], T> = (\n\t...values: DepValues<D>\n) => T | undefined;\n\n/** Value-level effect fn: receives dep values, optionally returns a deactivation cleanup. */\nexport type EffectFn<D extends readonly Node<unknown>[]> = (\n\t...values: DepValues<D>\n\t// biome-ignore lint/suspicious/noConfusingVoidType: effect returns void OR a cleanup fn — the void arm keeps `(v) => { sideEffect(v) }` ergonomic (React EffectCallback idiom); dropping it would force an explicit `return undefined`.\n) => void | (() => void);\n\n/** Sugar options — node options minus graph-owned dispatcher plus naming/meta. */\nexport interface SugarOpts<T = unknown> extends Omit<NodeOptions<T>, \"dispatcher\"> {\n\tname?: string;\n\tmeta?: Record<string, unknown>;\n\t/**\n\t * D95: explicit restorable factory metadata. Static JSON-compatible config may live here;\n\t * reactive options must remain graph deps. Without this, function-backed nodes are local-only.\n\t */\n\trestore?: { ref: string; config?: unknown; configVersion?: unknown };\n}\n\nexport interface GraphOptions {\n\tname?: string;\n\t/** Bind to a dispatcher (default = process-global, D26). */\n\tdispatcher?: Dispatcher;\n\t/** D109 default node runtime versioning policy for graph-owned nodes. Default is nodev0. */\n\tversioning?: NodeVersioningPolicy;\n\t/** Graph-owned environment drivers for source/adapter boundaries (D130/D131). */\n\tenvironment?: EnvironmentDrivers;\n\t/**\n\t * Turn on the dispatcher profile recorder (D39 / F-PERF default off). NOTE: this\n\t * switches recording on for the WHOLE bound dispatcher (the default is process-global,\n\t * D26) — every graph sharing it then pays the recorder cost. For isolated profiling\n\t * use a dedicated dispatcher: `graph({ dispatcher: new Dispatcher(), profile: true })`.\n\t */\n\tprofile?: boolean;\n}\n\ninterface Entry {\n\tnode: Node<unknown>;\n\tid: string;\n\tname?: string;\n\tfactory: string;\n\tdeps: readonly Node<unknown>[];\n\tmeta?: Record<string, unknown>;\n\trestore?: { ref: string; config?: unknown; configVersion?: unknown };\n}\n\ninterface TopologyObserver {\n\tpath?: string;\n\tsink(event: TopologyEvent): void;\n}\n\ninterface MountedGraph {\n\tat: string;\n\tgraph: Graph;\n\ttopologyUnsub?: () => void;\n}\n\ninterface GraphRestoreRegistrar {\n\tstateNode<T>(id: string, opts?: SugarOpts<T>): StateNode<T>;\n\tnode<T>(\n\t\tid: string,\n\t\tfactory: string,\n\t\tdeps: readonly Node<unknown>[],\n\t\tfn: NodeFn | null,\n\t\topts?: SugarOpts<T>,\n\t): Node<T>;\n}\n\nconst restoreRegistrars = new WeakMap<Graph, GraphRestoreRegistrar>();\n\ninterface GraphLifecycleRegistrar {\n\tassertRegisteredNode(node: Node<unknown>, label: string): void;\n\treleaseNodes(nodes: readonly Node<unknown>[], opts?: { reason?: string }): void;\n}\n\nconst lifecycleRegistrars = new WeakMap<Graph, GraphLifecycleRegistrar>();\n\nfunction nodeOwner(n: Node<unknown>): Graph | undefined {\n\treturn getNodeOwner(n) as Graph | undefined;\n}\n\nexport function assertGraphLocalNode(owner: Graph, n: Node<unknown>, label: string): void {\n\tif (isNodeRuntimeReleased(n)) {\n\t\tthrow new Error(`${label} has been released from its graph lifecycle (D122)`);\n\t}\n\tconst existing = nodeOwner(n);\n\tif (existing !== undefined && existing !== owner) {\n\t\tthrow new Error(\n\t\t\t`${label} belongs to a different graph; cross-graph deps require a wire bridge`,\n\t\t);\n\t}\n}\n\n/**\n * A state node (L4-Q1): a manual source whose `.set(v)` is `node.down([[DATA, v]])` sugar.\n * Extends the substrate Node so it is usable as a dep AND carries the graph-layer `.set`.\n */\nexport class StateNode<T> extends Node<T> {\n\tset(v: T): void {\n\t\tthis.down([[\"DATA\", v]]);\n\t}\n}\n\nexport interface TopologyGroupOptions {\n\t/** Optional inspection/release reason label for this graph-owned topology group. */\n\tname?: string;\n}\n\nexport interface TopologyGroupReleaseOptions {\n\t/** Optional diagnostic reason. No protocol/control messages are synthesized. */\n\treason?: string;\n}\n\n/**\n * Graph-owned D152 release group: a label over ordinary graph-registered nodes.\n * The graph registry remains the source of truth; helper-local membership is only\n * a memo for atomic quiescent release.\n */\nexport interface TopologyGroup {\n\treadonly name?: string;\n\treadonly released: boolean;\n\tadd<T extends Node<unknown>>(node: T): T;\n\tnode<T = unknown>(\n\t\tdeps?: readonly Node<unknown>[],\n\t\tfn?: NodeFn | null,\n\t\topts?: SugarOpts<T>,\n\t): Node<T>;\n\tstate<T>(initial: T, opts?: SugarOpts<T>): StateNode<T>;\n\tproducer<T = unknown>(fn: NodeFn, opts?: SugarOpts<T>): Node<T>;\n\tderived<const D extends readonly Node<unknown>[], T>(\n\t\tdeps: D,\n\t\tfn: DerivedFn<D, T>,\n\t\topts?: SugarOpts<T>,\n\t): Node<T>;\n\teffect<const D extends readonly Node<unknown>[]>(\n\t\tdeps: D,\n\t\tfn: EffectFn<D>,\n\t\topts?: SugarOpts<void>,\n\t): Node<void>;\n\tinitNode<TIn, TOut>(\n\t\top: Operator<TIn, TOut>,\n\t\tdeps: readonly Node<TIn>[],\n\t\topts?: SugarOpts<TOut>,\n\t): Node<TOut>;\n\trelease(opts?: TopologyGroupReleaseOptions): void;\n}\n\nclass GraphTopologyGroup implements TopologyGroup {\n\treadonly name?: string;\n\tprivate readonly _graph: Graph;\n\tprivate readonly _members: Node<unknown>[] = [];\n\tprivate _released = false;\n\n\tconstructor(graph: Graph, opts: TopologyGroupOptions = {}) {\n\t\tthis._graph = graph;\n\t\tthis.name = opts.name;\n\t}\n\n\tget released(): boolean {\n\t\treturn this._released;\n\t}\n\n\tadd<T extends Node<unknown>>(node: T): T {\n\t\tthis._assertLive();\n\t\tconst lifecycle = lifecycleRegistrars.get(this._graph);\n\t\tif (lifecycle === undefined) throw new Error(\"topologyGroup: graph lifecycle unavailable\");\n\t\tlifecycle.assertRegisteredNode(node, `topology group '${this.name ?? \"group\"}' member`);\n\t\tif (!this._members.includes(node)) this._members.push(node);\n\t\treturn node;\n\t}\n\n\tnode<T = unknown>(\n\t\tdeps: readonly Node<unknown>[] = [],\n\t\tfn: NodeFn | null = null,\n\t\topts: SugarOpts<T> = {},\n\t): Node<T> {\n\t\tthis._assertLive();\n\t\treturn this.add(this._graph.node(deps, fn, opts));\n\t}\n\n\tstate<T>(initial: T, opts: SugarOpts<T> = {}): StateNode<T> {\n\t\tthis._assertLive();\n\t\treturn this.add(this._graph.state(initial, opts));\n\t}\n\n\tproducer<T = unknown>(fn: NodeFn, opts: SugarOpts<T> = {}): Node<T> {\n\t\tthis._assertLive();\n\t\treturn this.add(this._graph.producer(fn, opts));\n\t}\n\n\tderived<const D extends readonly Node<unknown>[], T>(\n\t\tdeps: D,\n\t\tfn: DerivedFn<D, T>,\n\t\topts: SugarOpts<T> = {},\n\t): Node<T> {\n\t\tthis._assertLive();\n\t\treturn this.add(this._graph.derived(deps, fn, opts));\n\t}\n\n\teffect<const D extends readonly Node<unknown>[]>(\n\t\tdeps: D,\n\t\tfn: EffectFn<D>,\n\t\topts: SugarOpts<void> = {},\n\t): Node<void> {\n\t\tthis._assertLive();\n\t\treturn this.add(this._graph.effect(deps, fn, opts));\n\t}\n\n\tinitNode<TIn, TOut>(\n\t\top: Operator<TIn, TOut>,\n\t\tdeps: readonly Node<TIn>[],\n\t\topts: SugarOpts<TOut> = {},\n\t): Node<TOut> {\n\t\tthis._assertLive();\n\t\treturn this.add(this._graph.initNode(op, deps, opts));\n\t}\n\n\trelease(opts: TopologyGroupReleaseOptions = {}): void {\n\t\tif (this._released) return;\n\t\tconst lifecycle = lifecycleRegistrars.get(this._graph);\n\t\tif (lifecycle === undefined) throw new Error(\"topologyGroup: graph lifecycle unavailable\");\n\t\tlifecycle.releaseNodes([...this._members], {\n\t\t\treason: opts.reason ?? this.name,\n\t\t});\n\t\tthis._members.length = 0;\n\t\tthis._released = true;\n\t}\n\n\tprivate _assertLive(): void {\n\t\tif (this._released) {\n\t\t\tthrow new Error(`topology group '${this.name ?? \"group\"}' has been released (D152)`);\n\t\t}\n\t}\n}\n\nexport class Graph {\n\treadonly name?: string;\n\tprivate readonly _dispatcher: Dispatcher;\n\tprivate readonly _versioning: NodeVersioningPolicy | undefined;\n\tprivate readonly _environment: EnvironmentDrivers;\n\tprivate readonly _core = new NodeCore();\n\tprivate readonly _entries = new Map<Node<unknown>, Entry>();\n\tprivate readonly _byId = new Map<string, Node<unknown>>();\n\tprivate readonly _retiredIds = new Set<string>();\n\tprivate readonly _mounts: MountedGraph[] = [];\n\tprivate _seq = 0;\n\tprivate _clock = 0; // graph-local monotonic clock for observe seq (D26)\n\tprivate _topologyObserverSeq = 0;\n\tprivate readonly _topologyObservers = new Map<number, TopologyObserver>();\n\tprivate _topologyDelivering = false;\n\tprivate readonly _topologyQueue: TopologyEvent[] = [];\n\t// D51: stable synthetic ids for unregistered live deps (runtime *Map inners) auto-discovered by\n\t// describe(). WeakMap-cached so successive describes agree + the inner's id is freed when it is.\n\t// A dedicated counter (NOT _seq) so a describe() call never perturbs registered-node id numbering.\n\tprivate _synthSeq = 0;\n\tprivate readonly _synthIds = new WeakMap<Node<unknown>, string>();\n\n\tconstructor(opts: GraphOptions = {}) {\n\t\tthis.name = opts.name;\n\t\tthis._dispatcher = opts.dispatcher ?? defaultDispatcher;\n\t\tthis._versioning = opts.versioning;\n\t\tthis._environment = opts.environment ?? EnvironmentDrivers.empty();\n\t\tif (opts.profile) this._dispatcher.setRecording(true);\n\t\trestoreRegistrars.set(this, {\n\t\t\tstateNode: <T = unknown>(id: string, stateOpts: SugarOpts<T> = {}) => {\n\t\t\t\tconst n = this._construct(() => new StateNode<T>([], null, this._nodeOpts(stateOpts)));\n\t\t\t\tthis._addWithId(n, \"state\", [], stateOpts, id);\n\t\t\t\treturn n;\n\t\t\t},\n\t\t\tnode: <T = unknown>(\n\t\t\t\tid: string,\n\t\t\t\tfactory: string,\n\t\t\t\tdeps: readonly Node<unknown>[],\n\t\t\t\tfn: NodeFn | null,\n\t\t\t\tnodeOpts: SugarOpts<T> = {},\n\t\t\t) => {\n\t\t\t\tthis._assertDepsLocal(deps, `dep of restored '${id}'`);\n\t\t\t\tconst n = this._construct(() => new Node<T>([...deps], fn, this._nodeOpts(nodeOpts)));\n\t\t\t\tthis._addWithId(n, factory, deps, nodeOpts, id);\n\t\t\t\treturn n;\n\t\t\t},\n\t\t});\n\t\tlifecycleRegistrars.set(this, {\n\t\t\tassertRegisteredNode: (node, label) => this._assertRegisteredNode(node, label),\n\t\t\treleaseNodes: (nodes, releaseOpts) => this._releaseNodes(nodes, releaseOpts),\n\t\t});\n\t}\n\n\t// ── registration / inspection index ──\n\n\tprivate _add<T>(\n\t\tn: Node<T>,\n\t\tfactory: string,\n\t\tdeps: readonly Node<unknown>[],\n\t\topts: SugarOpts<T>,\n\t): Node<T> {\n\t\tconst id = opts.name ?? `${factory}#${this._seq++}`;\n\t\treturn this._addWithId(n, factory, deps, opts, id);\n\t}\n\n\tprivate _addWithId<T>(\n\t\tn: Node<T>,\n\t\tfactory: string,\n\t\tdeps: readonly Node<unknown>[],\n\t\topts: SugarOpts<T>,\n\t\tid: string,\n\t): Node<T> {\n\t\tassertGraphLocalNode(this, n as Node<unknown>, `graph node '${opts.name ?? factory}'`);\n\t\tfor (const dep of deps) assertGraphLocalNode(this, dep, `dep of '${opts.name ?? factory}'`);\n\t\tif (this._byId.has(id)) {\n\t\t\tthrow new Error(`graph: duplicate node id '${id}' (checkpoint/describe ids must be unique)`);\n\t\t}\n\t\tif (this._retiredIds.has(id)) {\n\t\t\tthrow new Error(`graph: node id '${id}' was released and cannot be reused (D152/D153)`);\n\t\t}\n\t\tconst meta =\n\t\t\topts.meta === undefined\n\t\t\t\t? undefined\n\t\t\t\t: (normalizeTopologyMeta(opts.meta, `graph node '${id}' meta`) as Record<string, unknown>);\n\t\tthis._entries.set(n as Node<unknown>, {\n\t\t\tnode: n as Node<unknown>,\n\t\t\tid,\n\t\t\tname: opts.name,\n\t\t\tfactory,\n\t\t\tdeps,\n\t\t\tmeta,\n\t\t\trestore: opts.restore,\n\t\t});\n\t\tsetNodeOwner(n as Node<unknown>, this);\n\t\tthis._byId.set(id, n as Node<unknown>);\n\t\tsetNodeTopologyDepsChangedObserver(n as Node<unknown>, (_node, prevDeps, nextDeps) => {\n\t\t\tthis._emitTopologyDepsChanged(n as Node<unknown>, prevDeps, nextDeps);\n\t\t});\n\t\tconst seqMatch = /#(\\d+)$/.exec(id);\n\t\tif (seqMatch) this._seq = Math.max(this._seq, Number(seqMatch[1]) + 1);\n\t\tthis._emitTopologyNodeRegistered(n as Node<unknown>);\n\t\treturn n;\n\t}\n\n\tprivate _assertDepsLocal(deps: readonly Node<unknown>[], label: string): void {\n\t\tfor (const dep of deps) assertGraphLocalNode(this, dep, label);\n\t}\n\n\tprivate _assertRegisteredNode(node: Node<unknown>, label: string): void {\n\t\tassertGraphLocalNode(this, node, label);\n\t\tif (!this._entries.has(node)) {\n\t\t\tthrow new Error(`${label} is not a registered graph node (D152)`);\n\t\t}\n\t}\n\n\tprivate _nodeOpts<T>(opts: SugarOpts<T>): NodeOptions<T> {\n\t\tif (opts.meta !== undefined) {\n\t\t\tnormalizeTopologyMeta(opts.meta, `graph node '${opts.name ?? opts.factory ?? \"node\"}' meta`);\n\t\t}\n\t\t// strip graph-only fields; inject the bound dispatcher\n\t\tconst { name: _n, meta: _m, restore: _r, ...rest } = opts;\n\t\treturn {\n\t\t\t...rest,\n\t\t\tversioning: rest.versioning ?? this._versioning,\n\t\t\tdispatcher: this._dispatcher,\n\t\t};\n\t}\n\n\tprivate _construct<TNode extends Node<unknown>>(create: () => TNode): TNode {\n\t\treturn withEnvironmentDrivers(this._environment, () => withNodeCore(this._core, create));\n\t}\n\n\t/** Look up a registered node by its id. */\n\tfind(id: string): Node<unknown> | undefined {\n\t\tconst local = this._byId.get(id);\n\t\tif (local !== undefined) return local;\n\t\tconst separator = id.indexOf(\"::\");\n\t\tif (separator < 0) return undefined;\n\t\tconst mountPath = id.slice(0, separator);\n\t\tconst childPath = id.slice(separator + 2);\n\t\treturn this._mounts.find((mount) => mount.at === mountPath)?.graph.find(childPath);\n\t}\n\n\tprivate _releaseNodes(nodes: readonly Node<unknown>[], _opts: { reason?: string } = {}): void {\n\t\tconst seen = new Set<Node<unknown>>();\n\t\tconst entries: Array<{ node: Node<unknown>; entry: Entry }> = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (seen.has(node)) continue;\n\t\t\tseen.add(node);\n\t\t\tconst entry = this._entries.get(node);\n\t\t\tif (entry === undefined) continue;\n\t\t\tentries.push({ node, entry });\n\t\t}\n\t\tconst releaseSet = new Set(entries.map(({ node }) => node));\n\t\tconst releaseIds = new Map(entries.map(({ node, entry }) => [node, entry.id] as const));\n\t\tfor (const entry of this._entries.values()) {\n\t\t\tif (releaseSet.has(entry.node)) continue;\n\t\t\tfor (const dep of entry.node.deps) {\n\t\t\t\tif (!releaseSet.has(dep)) continue;\n\t\t\t\tconst depId = releaseIds.get(dep) ?? dep.name ?? dep.factory ?? \"released node\";\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`graph: cannot release node group; '${entry.id}' still depends on '${depId}' (D122)`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tfor (const { node, entry } of entries) {\n\t\t\tif (!isNodeRuntimeQuiescentForRelease(node)) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`graph: cannot release node group; '${entry.id}' is not runtime-quiescent (D124)`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tlet internalSubscribers = 0;\n\t\t\tfor (const { node: dependent } of entries) {\n\t\t\t\tif (dependent === node || !isNodeActiveForRelease(dependent)) continue;\n\t\t\t\tfor (const dep of dependent.deps) {\n\t\t\t\t\tif (dep === node) internalSubscribers += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (subscriberCountOfNode(node) > internalSubscribers) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`graph: cannot release node group; '${entry.id}' still has live subscribers (D124)`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tconst releasedEvents =\n\t\t\tthis._topologyObservers.size === 0\n\t\t\t\t? []\n\t\t\t\t: entries.map(({ node, entry }) => ({\n\t\t\t\t\t\tpath: entry.id,\n\t\t\t\t\t\tfactory: entry.factory,\n\t\t\t\t\t\tdeps: this._topologyDeps(node.deps),\n\t\t\t\t\t}));\n\t\tfor (const { node, entry } of entries) {\n\t\t\tthis._entries.delete(node);\n\t\t\tthis._byId.delete(entry.id);\n\t\t\tthis._retiredIds.add(entry.id);\n\t\t}\n\t\tlet releaseError: unknown;\n\t\tfor (const { node } of entries) {\n\t\t\ttry {\n\t\t\t\treleaseRuntimeOfNode(node);\n\t\t\t} catch (error) {\n\t\t\t\tif (releaseError === undefined) releaseError = error;\n\t\t\t}\n\t\t}\n\t\tfor (const event of releasedEvents) this._emitTopologyNodeReleased(event);\n\t\tif (releaseError !== undefined) throw releaseError;\n\t}\n\n\t// ── 8 verbs (core: node/state/batch + sugar: producer/derived/effect/mount) ──\n\n\t/** ctx-level power surface: a raw `(ctx)=>void` fn (or a passthrough/state when null). */\n\tnode<T = unknown>(\n\t\tdeps: readonly Node<unknown>[] = [],\n\t\tfn: NodeFn | null = null,\n\t\topts: SugarOpts<T> = {},\n\t): Node<T> {\n\t\tthis._assertDepsLocal(deps, `dep of '${opts.name ?? \"node\"}'`);\n\t\tconst n = this._construct(() => new Node<T>(deps as Node<unknown>[], fn, this._nodeOpts(opts)));\n\t\treturn this._add(n, opts.factory ?? \"node\", deps, opts);\n\t}\n\n\t/** A manual source with `.set(v)` (L4-Q1). */\n\tstate<T>(initial: T, opts: SugarOpts<T> = {}): StateNode<T> {\n\t\tconst n = this._construct(\n\t\t\t() => new StateNode<T>([], null, { ...this._nodeOpts(opts), initial }),\n\t\t);\n\t\tthis._add(n, \"state\", [], opts);\n\t\treturn n;\n\t}\n\n\t/** ctx-level depless source; its fn runs on activation (R-rom-ram). */\n\tproducer<T = unknown>(fn: NodeFn, opts: SugarOpts<T> = {}): Node<T> {\n\t\tconst n = this._construct(() => new Node<T>([], fn, this._nodeOpts(opts)));\n\t\treturn this._add(n, \"producer\", [], opts);\n\t}\n\n\t/** value-level pure transform: deps → value (D27 wrapped; D30 throw→ERROR). */\n\tderived<const D extends readonly Node<unknown>[], T>(\n\t\tdeps: D,\n\t\tfn: DerivedFn<D, T>,\n\t\topts: SugarOpts<T> = {},\n\t): Node<T> {\n\t\tthis._assertDepsLocal(deps, `dep of '${opts.name ?? \"derived\"}'`);\n\t\tconst ctxFn: NodeFn = (ctx: Ctx) => {\n\t\t\ttry {\n\t\t\t\tconst args = Array.from({ length: depCount(ctx) }, (_, i) =>\n\t\t\t\t\tdepLatest(ctx, i),\n\t\t\t\t) as DepValues<D>;\n\t\t\t\tconst result = fn(...args);\n\t\t\t\tif (result !== undefined) ctx.down([[\"DATA\", result]]);\n\t\t\t} catch (e) {\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"derived threw without a valid error payload\")]]); // D30: value-level throw → graph-layer ERROR\n\t\t\t}\n\t\t};\n\t\tconst n = this._construct(() => new Node<T>([...deps], ctxFn, this._nodeOpts(opts)));\n\t\treturn this._add(n, \"derived\", deps, opts);\n\t}\n\n\t/** value-level sink: deps → effect; return value (a fn) becomes onDeactivation (D28). */\n\teffect<const D extends readonly Node<unknown>[]>(\n\t\tdeps: D,\n\t\tfn: EffectFn<D>,\n\t\topts: SugarOpts<void> = {},\n\t): Node<void> {\n\t\tthis._assertDepsLocal(deps, `dep of '${opts.name ?? \"effect\"}'`);\n\t\t// effect cleanup = deactivation-only (D28 / Flag 3): the LATEST returned cleanup\n\t\t// fires ONCE when the effect deactivates (not between re-runs — onRerun was cut).\n\t\t// R-cleanup-hooks per-run lifecycle (D28 clarification / C-14): the substrate clears\n\t\t// the hook list before EACH fn run, so the effect re-registers its returned cleanup\n\t\t// every run — only the latest run's registration is live (or none, if the latest run\n\t\t// returned void). No st.registered/ctx.state bookkeeping; re-registering every run is\n\t\t// safe (the per-run clear prevents accumulation).\n\t\tconst ctxFn: NodeFn = (ctx: Ctx) => {\n\t\t\ttry {\n\t\t\t\tconst args = Array.from({ length: depCount(ctx) }, (_, i) =>\n\t\t\t\t\tdepLatest(ctx, i),\n\t\t\t\t) as DepValues<D>;\n\t\t\t\tconst cleanup = fn(...args);\n\t\t\t\tif (typeof cleanup === \"function\") ctx.onDeactivation(cleanup);\n\t\t\t} catch (e) {\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"effect threw without a valid error payload\")]]);\n\t\t\t}\n\t\t};\n\t\tconst n = this._construct(() => new Node<void>([...deps], ctxFn, this._nodeOpts(opts)));\n\t\treturn this._add(n, \"effect\", deps, opts);\n\t}\n\n\t/** Declarative batch (D12): one wave, success→commit / throw→rollback. */\n\tbatch<T>(fn: (bctx: BatchCtx) => T): T {\n\t\treturn batchRun(fn);\n\t}\n\n\t/** Embed a child graph addressable under `at` (R-mount; mount has no deps). */\n\tmount(child: Graph, opts: { at: string }): void {\n\t\tconst mount = { at: opts.at, graph: child };\n\t\tthis._mounts.push(mount);\n\t\tif (this._topologyObservers.size > 0) this._ensureMountedTopologyForwarders();\n\t\tthis._emitTopologyMountChanged(opts.at);\n\t}\n\n\t// ── operator funnel (D43): instantiate any free-standing Operator (node sugar, D6/L1.5) ──\n\t// g.initNode is the single graph-bound entry for the whole operator/source catalog (D40):\n\t// it delegates to the FREE initNode (graph/operators.ts — the D30 throw→ERROR boundary +\n\t// dispatcher binding live there) and records the operator's REAL factory name in the\n\t// inspection index (_add) so describe shows it (D6/R-describe) while the node stays thin\n\t// (R-node-thin). Operators are free-standing factory definitions (graph/operators.ts,\n\t// graph/sources.ts) usable bare via the free initNode(); this funnel is the inspectable\n\t// path. Replaces the per-operator methods.\n\n\t/**\n\t * Instantiate an operator (or source) factory as a registered graph node. `deps` are\n\t * type-checked against the operator's input element type; the output type flows from the\n\t * operator. A source is a depless operator — pass `[]`. Caller `opts` (name/meta/behavioral\n\t * overrides) win over the operator's baked-in `opts`.\n\t */\n\tinitNode<TIn, TOut>(\n\t\top: Operator<TIn, TOut>,\n\t\tdeps: readonly Node<TIn>[],\n\t\topts: SugarOpts<TOut> = {},\n\t): Node<TOut> {\n\t\tconst entryOpts =\n\t\t\top.restore !== undefined && !(\"restore\" in opts) ? { ...opts, restore: op.restore } : opts;\n\t\tfor (const dep of deps as readonly Node<unknown>[])\n\t\t\tassertGraphLocalNode(this, dep, `dep of '${entryOpts.name ?? op.factory}'`);\n\t\t// Node<T> is invariant (T appears in NodeOptions.initial); widen the typed deps to the\n\t\t// erased Node surface the free initNode / _add accept (same cast the old methods used).\n\t\tconst erased = deps as readonly Node<unknown>[];\n\t\tconst n = withEnvironmentDrivers(this._environment, () =>\n\t\t\tinitNodeWithCore(this._core, op, erased, this._nodeOpts(entryOpts)),\n\t\t);\n\t\treturn this._add(n, op.factory, erased, entryOpts);\n\t}\n\n\t/**\n\t * Graph-owned activation root for internal helper nodes. This is the sanctioned keepalive shape:\n\t * a graph, not a helper closure, owns the subscription and returns the release handle.\n\t */\n\tretain<T>(node: Node<T>, opts: { reason?: string } = {}): () => void {\n\t\tassertGraphLocalNode(this, node as Node<unknown>, opts.reason ?? \"retained node\");\n\t\treturn node.subscribe(() => {});\n\t}\n\n\t/**\n\t * D152 graph-owned topology/release group. Members are ordinary registered graph nodes;\n\t * release is quiescent-only and removes ids atomically without synthesizing protocol messages.\n\t */\n\ttopologyGroup(opts: TopologyGroupOptions = {}): TopologyGroup {\n\t\treturn new GraphTopologyGroup(this, opts);\n\t}\n\n\t// ── inspection: describe / observe / profile (D39) ──\n\n\t/** Live point-in-time structure snapshot (R-describe / D39 / D51). `_prefix` carries the mount path. */\n\tdescribe(opts: DescribeOpts = {}, _prefix = \"\"): DescribeSnapshot {\n\t\t// D51: edges derive from each node's CURRENT/LIVE deps (entry.node.deps, NOT the\n\t\t// construction-time entry.deps), so a rewire (C-8 immediate / C-11 *Map deferred) is\n\t\t// reflected and every edge is a real current subscription (D3). A live dep absent from this\n\t\t// graph's index (a runtime *Map inner / bare fromAny node) is AUTO-DISCOVERED as a snapshot\n\t\t// node with a synthesized stable id (B2). B38 extends this to transitive live-reachability:\n\t\t// discovered unregistered nodes are recursively expanded through their own live deps.\n\t\tconst discovered = new Map<Node<unknown>, string>(); // unregistered live dep → synth local id\n\t\tconst localId = (n: Node<unknown>): string => {\n\t\t\tconst e = this._entries.get(n);\n\t\t\tif (e) return `${_prefix}${e.id}`;\n\t\t\t// unregistered: a stable synthetic id, cached so successive describes + both call sites\n\t\t\t// agree; the `~` prefix can't collide with a registered name or `factory#seq`.\n\t\t\tlet sid = this._synthIds.get(n);\n\t\t\tif (sid === undefined) {\n\t\t\t\t// the `~` prefix avoids the registered `name`/`factory#seq` space; guard the\n\t\t\t\t// pathological case of a user node literally named `~factory#n` (bump until free).\n\t\t\t\tdo {\n\t\t\t\t\tsid = `~${n.factory ?? \"?\"}#${this._synthSeq++}`;\n\t\t\t\t} while (this._byId.has(sid));\n\t\t\t\tthis._synthIds.set(n, sid);\n\t\t\t}\n\t\t\tdiscovered.set(n, sid);\n\t\t\treturn `${_prefix}${sid}`;\n\t\t};\n\t\tconst nodes: DescribeNode[] = [];\n\t\tconst edges: DescribeEdge[] = [];\n\t\t// pass 1: registered nodes, reading LIVE deps (localId records any unregistered inner).\n\t\tfor (const entry of this._entries.values()) {\n\t\t\tconst id = `${_prefix}${entry.id}`;\n\t\t\tconst liveIds = entry.node.deps.map(localId);\n\t\t\tconst dnode: DescribeNode = {\n\t\t\t\tid,\n\t\t\t\tfactory: entry.factory,\n\t\t\t\tstatus: entry.node.status,\n\t\t\t\tdeps: liveIds,\n\t\t\t};\n\t\t\tif (entry.name !== undefined) dnode.name = entry.name;\n\t\t\tif (entry.node.cache !== undefined) dnode.value = entry.node.cache; // absent = SENTINEL\n\t\t\tif (entry.node.version !== undefined) dnode.version = entry.node.version;\n\t\t\tif (entry.meta !== undefined) dnode.meta = entry.meta;\n\t\t\tnodes.push(dnode);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: id });\n\t\t}\n\t\t// pass 2: recursively emit auto-discovered unregistered nodes (D51+B38). localId() may add\n\t\t// further unregistered deps to `discovered` while this loop runs; a visited set keeps each\n\t\t// discovered node emitted once (stable ids via _synthIds).\n\t\tconst visited = new Set<Node<unknown>>();\n\t\tconst queue: Node<unknown>[] = [...discovered.keys()];\n\t\tfor (let i = 0; i < queue.length; i += 1) {\n\t\t\tconst inner = queue[i];\n\t\t\tif (visited.has(inner)) continue;\n\t\t\tvisited.add(inner);\n\t\t\tconst sid = discovered.get(inner);\n\t\t\tif (sid === undefined) continue;\n\t\t\tconst liveIds = inner.deps.map(localId);\n\t\t\tfor (const dep of inner.deps) {\n\t\t\t\tif (!this._entries.has(dep) && !visited.has(dep)) queue.push(dep);\n\t\t\t}\n\t\t\tconst dnode: DescribeNode = {\n\t\t\t\tid: `${_prefix}${sid}`,\n\t\t\t\tfactory: inner.factory ?? \"?\",\n\t\t\t\tstatus: inner.status,\n\t\t\t\tdeps: liveIds,\n\t\t\t};\n\t\t\tif (inner.cache !== undefined) dnode.value = inner.cache;\n\t\t\tif (inner.version !== undefined) dnode.version = inner.version;\n\t\t\tnodes.push(dnode);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: dnode.id });\n\t\t}\n\t\tconst snap: DescribeSnapshot = { nodes, edges };\n\t\tif (this.name !== undefined) snap.name = this.name;\n\t\tif (this._mounts.length > 0) {\n\t\t\tsnap.subgraphs = this._mounts.map((m) => m.graph.describe({}, `${_prefix}${m.at}::`));\n\t\t}\n\t\treturn opts.explain ? explainSubset(snap, opts.explain) : snap;\n\t}\n\n\t/**\n\t * D173 pure-structure topology snapshot over the same live truth source as describe().\n\t * Runtime status/value/version remain on describe(); blueprint metadata is a later envelope.\n\t */\n\ttopology(): GraphTopologySnapshot {\n\t\treturn topologyFromDescribe(this.describe());\n\t}\n\n\t/**\n\t * D177 synchronous audit/collaboration envelope over the pure topology snapshot.\n\t * Hashing and environment provenance enrichment stay in pure helpers outside Graph core.\n\t */\n\tblueprint(opts: GraphBlueprintOptions = {}): GraphBlueprint {\n\t\tconst topology = normalizeTopology(this.topology());\n\t\tconst out: GraphBlueprint = {\n\t\t\tversion: GRAPH_BLUEPRINT_VERSION,\n\t\t\ttopology,\n\t\t};\n\t\tif (opts.diagnostics) {\n\t\t\t(out as { diagnostics?: ReturnType<typeof graphBlueprintDiagnostics> }).diagnostics =\n\t\t\t\tgraphBlueprintDiagnostics(topology);\n\t\t}\n\t\tif (opts.provenance !== undefined) {\n\t\t\t(out as { provenance?: GraphBlueprint[\"provenance\"] }).provenance = normalizeTopologyMeta(\n\t\t\t\topts.provenance,\n\t\t\t\t\"graph blueprint provenance\",\n\t\t\t\t\"provenance\",\n\t\t\t);\n\t\t}\n\t\treturn out;\n\t}\n\n\tprivate _observeTargets(path?: string): Array<[string, Node<unknown>]> {\n\t\tconst all: Array<[string, Node<unknown>]> = [...this._entries.values()].map((e) => [\n\t\t\te.id,\n\t\t\te.node,\n\t\t]);\n\t\tif (path === undefined) return all; // whole graph\n\t\tconst exact = this._byId.get(path);\n\t\tif (exact) return [[path, exact]]; // single node\n\t\treturn all.filter(([id]) => id.startsWith(`${path}::`)); // subtree (mount-aware :: boundary, QA A-1)\n\t}\n\n\t/**\n\t * observe(path?) = read-only enveloped EGRESS (R-observe / D39). NOT a graph node — it\n\t * taps the target node(s) via subscribe and forwards each Message as an ObserveEvent.\n\t * No path = whole graph; an exact id = a single node; otherwise a `::`-prefix subtree.\n\t */\n\t// NOTE (R-observe/D19): observe is a real, lazily-ACTIVATING subscriber — observing a\n\t// cold node runs its fn (and activates upstream); whole-graph observe() activates the\n\t// graph. \"Read-only\" means it never emits/mutates node state, NOT that it avoids\n\t// activation. Use it knowing inspection of a cold graph wakes it.\n\tobserve(path?: string): ObserveStream {\n\t\tconst targets = this._observeTargets(path);\n\t\treturn {\n\t\t\tsubscribe: (sink) => {\n\t\t\t\tconst unsubs = targets.map(([id, n]) =>\n\t\t\t\t\tn.subscribe((msg) => {\n\t\t\t\t\t\tsink({ path: id, msg, tier: messageTier(msg[0]), seq: this._clock++ });\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\treturn () => {\n\t\t\t\t\tfor (const u of unsubs) u();\n\t\t\t\t};\n\t\t\t},\n\t\t};\n\t}\n\n\t/**\n\t * D145 observeTopology(path?) = read-only graph lifecycle egress over the existing\n\t * graph registry. It is not a graph node, does not subscribe to nodes, and emits no DATA.\n\t */\n\tobserveTopology(path?: string): TopologyStream {\n\t\treturn {\n\t\t\tsubscribe: (sink) => {\n\t\t\t\tconst id = this._topologyObserverSeq++;\n\t\t\t\tthis._topologyObservers.set(id, { path, sink });\n\t\t\t\tthis._ensureMountedTopologyForwarders();\n\t\t\t\treturn () => {\n\t\t\t\t\tthis._topologyObservers.delete(id);\n\t\t\t\t\tif (this._topologyObservers.size === 0) this._releaseMountedTopologyForwarders();\n\t\t\t\t};\n\t\t\t},\n\t\t};\n\t}\n\n\tprivate _idForTopologyNode(n: Node<unknown>): string {\n\t\tconst e = this._entries.get(n);\n\t\tif (e) return e.id;\n\t\tlet sid = this._synthIds.get(n);\n\t\tif (sid === undefined) {\n\t\t\tdo {\n\t\t\t\tsid = `~${n.factory ?? \"?\"}#${this._synthSeq++}`;\n\t\t\t} while (this._byId.has(sid));\n\t\t\tthis._synthIds.set(n, sid);\n\t\t}\n\t\treturn sid;\n\t}\n\n\tprivate _topologyDeps(deps: readonly Node<unknown>[]): string[] {\n\t\treturn deps.map((dep) => this._idForTopologyNode(dep));\n\t}\n\n\tprivate _emitTopologyNodeRegistered(node: Node<unknown>): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tconst entry = this._entries.get(node);\n\t\tif (entry === undefined) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"node-registered\",\n\t\t\tpath: entry.id,\n\t\t\tfactory: entry.factory,\n\t\t\tdeps: this._topologyDeps(node.deps),\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyDepsChanged(\n\t\tnode: Node<unknown>,\n\t\tprevDeps: readonly Node<unknown>[],\n\t\tnextDeps: readonly Node<unknown>[],\n\t): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tconst entry = this._entries.get(node);\n\t\tif (entry === undefined) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"deps-changed\",\n\t\t\tpath: entry.id,\n\t\t\tprevDeps: this._topologyDeps(prevDeps),\n\t\t\tdeps: this._topologyDeps(nextDeps),\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyNodeReleased(event: {\n\t\tpath: string;\n\t\tfactory: string;\n\t\tdeps: readonly string[];\n\t}): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"node-released\",\n\t\t\tpath: event.path,\n\t\t\tfactory: event.factory,\n\t\t\tdeps: [...event.deps],\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyMountChanged(path: string): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"mount-changed\",\n\t\t\tpath,\n\t\t\tfactory: \"mount\",\n\t\t\tdeps: [],\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _ensureMountedTopologyForwarders(): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tfor (const mount of this._mounts) {\n\t\t\tif (mount.topologyUnsub !== undefined) continue;\n\t\t\tconst mountPath = mount.at;\n\t\t\tmount.topologyUnsub = mount.graph.observeTopology().subscribe((event) => {\n\t\t\t\tthis._emitMountedTopologyEvent(mountPath, event);\n\t\t\t});\n\t\t}\n\t}\n\n\tprivate _releaseMountedTopologyForwarders(): void {\n\t\tfor (const mount of this._mounts) {\n\t\t\tmount.topologyUnsub?.();\n\t\t\tmount.topologyUnsub = undefined;\n\t\t}\n\t}\n\n\tprivate _emitMountedTopologyEvent(mountPath: string, event: TopologyEvent): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: event.kind,\n\t\t\tpath: prefixTopologyPath(mountPath, event.path),\n\t\t\tdeps: event.deps.map((dep) => prefixTopologyPath(mountPath, dep)),\n\t\t\t...(event.prevDeps !== undefined\n\t\t\t\t? { prevDeps: event.prevDeps.map((dep) => prefixTopologyPath(mountPath, dep)) }\n\t\t\t\t: {}),\n\t\t\t...(event.factory !== undefined ? { factory: event.factory } : {}),\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyEvent(event: TopologyEvent): void {\n\t\tif (this._topologyDelivering) {\n\t\t\tthis._topologyQueue.push(event);\n\t\t\treturn;\n\t\t}\n\t\tthis._topologyDelivering = true;\n\t\ttry {\n\t\t\tlet current: TopologyEvent | undefined = event;\n\t\t\twhile (current !== undefined) {\n\t\t\t\tconst observers = [...this._topologyObservers.entries()];\n\t\t\t\tfor (const [id, observer] of observers) {\n\t\t\t\t\tif (this._topologyObservers.get(id) !== observer) continue;\n\t\t\t\t\tif (observer.path !== undefined && !topologyPathMatches(current.path, observer.path))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tobserver.sink(cloneTopologyEvent(current));\n\t\t\t\t\t} catch {\n\t\t\t\t\t\t// D145 egress is read-only inspection; observer failure must not veto a\n\t\t\t\t\t\t// graph registry/rewire mutation that already committed.\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcurrent = this._topologyQueue.shift();\n\t\t\t}\n\t\t} finally {\n\t\t\tthis._topologyDelivering = false;\n\t\t}\n\t}\n\n\t/**\n\t * profile() = accumulated-counter snapshot (R-profile / D39). invokes + duration are\n\t * dispatcher-backed (the invoke funnel, F-DISPATCH-ALL) — counters never live on the\n\t * thin node (R-node-thin). Requires `graph({ profile: true })` (opt-in, F-PERF).\n\t */\n\tprofile(): Profile {\n\t\tconst nodes: Record<string, NodeProfile> = {};\n\t\tlet totalInvokes = 0;\n\t\tfor (const e of this._entries.values()) {\n\t\t\tconst h = e.node.handle;\n\t\t\tconst stat = h ? this._dispatcher.statFor(h) : undefined;\n\t\t\tconst invokes = stat?.invokes ?? 0;\n\t\t\tnodes[e.id] = {\n\t\t\t\tinvokes,\n\t\t\t\ttotalDurationNs: stat?.totalDurationNs ?? 0,\n\t\t\t\tlastDurationNs: stat?.lastDurationNs ?? 0,\n\t\t\t\tstatus: e.node.status,\n\t\t\t};\n\t\t\t// graph-scoped (QA D-2): sum THIS graph's nodes, NOT the dispatcher-global\n\t\t\t// counter (which would leak invokes from other graphs sharing the dispatcher).\n\t\t\ttotalInvokes += invokes;\n\t\t}\n\t\treturn { totalInvokes, nodes };\n\t}\n\n\t/** Versioned graph lifecycle checkpoint (R-snapshot / D83 / D90). Pure capture, no storage I/O. */\n\tcheckpoint(): GraphCheckpoint {\n\t\treturn this._checkpoint(\"\", new WeakSet());\n\t}\n\n\tprivate _checkpoint(_prefix: string, stack: WeakSet<Graph>): GraphCheckpoint {\n\t\tif (stack.has(this)) {\n\t\t\tthrow new Error(\"checkpoint: cyclic graph mount detected\");\n\t\t}\n\t\tstack.add(this);\n\t\tconst discovered = new Map<Node<unknown>, string>();\n\t\tconst localId = (n: Node<unknown>): string => {\n\t\t\tconst e = this._entries.get(n);\n\t\t\tif (e) return `${_prefix}${e.id}`;\n\t\t\tlet sid = this._synthIds.get(n);\n\t\t\tif (sid === undefined) {\n\t\t\t\tdo {\n\t\t\t\t\tsid = `~${n.factory ?? \"?\"}#${this._synthSeq++}`;\n\t\t\t\t} while (this._byId.has(sid));\n\t\t\t\tthis._synthIds.set(n, sid);\n\t\t\t}\n\t\t\tdiscovered.set(n, sid);\n\t\t\treturn `${_prefix}${sid}`;\n\t\t};\n\t\tconst nodes: GraphCheckpointNode[] = [];\n\t\tconst edges: DescribeEdge[] = [];\n\t\tfor (const entry of this._entries.values()) {\n\t\t\tconst id = `${_prefix}${entry.id}`;\n\t\t\tconst liveIds = entry.node.deps.map(localId);\n\t\t\tnodes.push(\n\t\t\t\tthis._checkpointNode(entry.node, id, {\n\t\t\t\t\tname: entry.name,\n\t\t\t\t\tfactory: checkpointFactory(entry.factory, entry.node, false, entry.restore, entry.meta),\n\t\t\t\t\tdeps: liveIds,\n\t\t\t\t\tmeta: entry.meta,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: id });\n\t\t}\n\t\tconst visited = new Set<Node<unknown>>();\n\t\tconst queue: Node<unknown>[] = [...discovered.keys()];\n\t\tfor (let i = 0; i < queue.length; i += 1) {\n\t\t\tconst inner = queue[i];\n\t\t\tif (visited.has(inner)) continue;\n\t\t\tvisited.add(inner);\n\t\t\tconst sid = discovered.get(inner);\n\t\t\tif (sid === undefined) continue;\n\t\t\tconst liveIds = inner.deps.map(localId);\n\t\t\tfor (const dep of inner.deps) {\n\t\t\t\tif (!this._entries.has(dep) && !visited.has(dep)) queue.push(dep);\n\t\t\t}\n\t\t\tconst id = `${_prefix}${sid}`;\n\t\t\tnodes.push(\n\t\t\t\tthis._checkpointNode(inner, id, {\n\t\t\t\t\tfactory: checkpointFactory(inner.factory ?? \"?\", inner, true),\n\t\t\t\t\tdeps: liveIds,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: id });\n\t\t}\n\t\tconst checkpoint: GraphCheckpoint = {\n\t\t\tversion: GRAPH_CHECKPOINT_VERSION,\n\t\t\tnodes,\n\t\t\tedges,\n\t\t};\n\t\tif (this.name !== undefined) checkpoint.name = this.name;\n\t\tif (this._mounts.length > 0) {\n\t\t\tcheckpoint.mounts = this._mounts.map((m) => ({\n\t\t\t\tat: m.at,\n\t\t\t\tcheckpoint: m.graph._checkpoint(\"\", stack),\n\t\t\t}));\n\t\t}\n\t\tstack.delete(this);\n\t\treturn toCheckpointJson(checkpoint, \"checkpoint\") as unknown as GraphCheckpoint;\n\t}\n\n\tprivate _checkpointNode(\n\t\tnode: Node<unknown>,\n\t\tid: string,\n\t\topts: {\n\t\t\tname?: string;\n\t\t\tfactory: GraphCheckpointFactory;\n\t\t\tdeps: string[];\n\t\t\tmeta?: Record<string, unknown>;\n\t\t},\n\t): GraphCheckpointNode {\n\t\tconst state = checkpointStateOfNode(node);\n\t\tassertCheckpointQuiescentStatus(node.status, id, \"checkpoint\");\n\t\tconst nonAuthoritativeCollectionHelper = isNonAuthoritativeCollectionHelperMeta(opts.meta);\n\t\tconst out: GraphCheckpointNode = {\n\t\t\tid,\n\t\t\tfactory: opts.factory,\n\t\t\tstatus: node.status,\n\t\t\tdeps: opts.deps,\n\t\t\tvalue: nonAuthoritativeCollectionHelper\n\t\t\t\t? { kind: \"SENTINEL\" }\n\t\t\t\t: checkpointValue(state.cache, state.hasData, `${id}.value`),\n\t\t\tterminal: checkpointTerminal(state.terminal, `${id}.terminal`),\n\t\t\tlifecycle: { activated: state.activated, hasCalledFnOnce: state.hasCalledFnOnce },\n\t\t\tctxState: {\n\t\t\t\tpersist: state.ctxState.persist,\n\t\t\t\tvalue: nonAuthoritativeCollectionHelper\n\t\t\t\t\t? { kind: \"SENTINEL\" }\n\t\t\t\t\t: checkpointValue(\n\t\t\t\t\t\t\tstate.ctxState.value,\n\t\t\t\t\t\t\tstate.ctxState.value !== SENTINEL,\n\t\t\t\t\t\t\t`${id}.ctxState`,\n\t\t\t\t\t\t),\n\t\t\t},\n\t\t};\n\t\tif (opts.name !== undefined) out.name = opts.name;\n\t\tconst backendState = checkpointBackendStateOfNode(node, `${id}.backendState`);\n\t\tif (backendState !== undefined) out.backendState = backendState;\n\t\tif (state.version !== undefined) out.version = state.version;\n\t\tif (opts.meta !== undefined)\n\t\t\tout.meta = toCheckpointJson(opts.meta, `${id}.meta`) as {\n\t\t\t\t[key: string]: GraphCheckpointJson;\n\t\t\t};\n\t\treturn out;\n\t}\n}\n\nfunction isNonAuthoritativeCollectionHelperMeta(\n\tmeta: Record<string, unknown> | undefined,\n): boolean {\n\treturn (\n\t\tmeta?.kind === \"collection_delta\" ||\n\t\tmeta?.kind === \"collection_intent\" ||\n\t\tmeta?.kind === \"collection_policy_apply\" ||\n\t\tmeta?.kind === \"collection_snapshot\" ||\n\t\tmeta?.kind === \"collection_snapshot_prep\"\n\t);\n}\n\nfunction assertCheckpointQuiescentStatus(status: string, id: string, op: string): void {\n\tif (status === \"pending\" || status === \"dirty\") {\n\t\tthrow new Error(\n\t\t\t`${op}: node '${id}' has non-quiescent status '${status}' that cannot be checkpoint-restored yet`,\n\t\t);\n\t}\n}\n\nfunction topologyPathMatches(eventPath: string, path: string): boolean {\n\treturn eventPath === path || eventPath.startsWith(`${path}::`);\n}\n\nfunction prefixTopologyPath(prefix: string, path: string): string {\n\treturn `${prefix}::${path}`;\n}\n\nfunction cloneTopologyEvent(event: TopologyEvent): TopologyEvent {\n\tconst deps = Object.freeze([...event.deps]);\n\tconst prevDeps = event.prevDeps === undefined ? undefined : Object.freeze([...event.prevDeps]);\n\treturn Object.freeze({\n\t\tkind: event.kind,\n\t\tpath: event.path,\n\t\tdeps,\n\t\t...(prevDeps !== undefined ? { prevDeps } : {}),\n\t\t...(event.factory !== undefined ? { factory: event.factory } : {}),\n\t\tseq: event.seq,\n\t});\n}\n\nfunction checkpointFactory(\n\tname: string,\n\tnode: Node<unknown>,\n\tunregistered: boolean,\n\trestore?: { ref: string; config?: unknown; configVersion?: unknown },\n\tmeta?: Record<string, unknown>,\n): GraphCheckpointFactory {\n\tconst state = checkpointStateOfNode(node);\n\tif (unregistered) {\n\t\treturn {\n\t\t\tkind: \"local-only\",\n\t\t\tname,\n\t\t\treason: \"node is an unregistered live dependency auto-discovered from topology\",\n\t\t};\n\t}\n\tif (\n\t\trestore === undefined &&\n\t\ttypeof meta?.kind === \"string\" &&\n\t\tmeta.kind.startsWith(\"collection_\")\n\t) {\n\t\treturn {\n\t\t\tkind: \"local-only\",\n\t\t\tname,\n\t\t\treason: \"collection helper node has no backend checkpoint restore metadata\",\n\t\t};\n\t}\n\tif (restore !== undefined) {\n\t\tconst out: GraphCheckpointFactory = {\n\t\t\tkind: \"registry-ref\",\n\t\t\tref: toCheckpointJson(restore.ref, `${name}.factory.ref`) as string,\n\t\t};\n\t\tif (restore.config !== undefined)\n\t\t\tout.config = toCheckpointJson(restore.config, `${name}.factory.config`);\n\t\tif (restore.configVersion !== undefined)\n\t\t\tout.configVersion = toCheckpointJson(restore.configVersion, `${name}.factory.configVersion`);\n\t\treturn out;\n\t}\n\tif (state.handle !== null) {\n\t\treturn {\n\t\t\tkind: \"local-only\",\n\t\t\tname,\n\t\t\treason: \"node uses a function body; first-cut checkpoints do not serialize local functions\",\n\t\t};\n\t}\n\treturn { kind: \"registry-ref\", ref: name };\n}\n\n/** Filter a snapshot to the causal chain from→to (forward-reachable(from) ∩ back-reachable(to)). */\nfunction explainSubset(\n\tsnap: DescribeSnapshot,\n\tchain: { from: string; to: string },\n): DescribeSnapshot {\n\tconst fwd = new Map<string, string[]>();\n\tconst rev = new Map<string, string[]>();\n\tconst push = (map: Map<string, string[]>, k: string, v: string): void => {\n\t\tconst a = map.get(k);\n\t\tif (a) a.push(v);\n\t\telse map.set(k, [v]);\n\t};\n\tfor (const e of snap.edges) {\n\t\tpush(fwd, e.from, e.to);\n\t\tpush(rev, e.to, e.from);\n\t}\n\tconst reach = (start: string, adj: Map<string, string[]>): Set<string> => {\n\t\tconst seen = new Set<string>([start]);\n\t\tconst stack = [start];\n\t\twhile (stack.length > 0) {\n\t\t\tconst cur = stack.pop() as string;\n\t\t\tfor (const nxt of adj.get(cur) ?? []) {\n\t\t\t\tif (!seen.has(nxt)) {\n\t\t\t\t\tseen.add(nxt);\n\t\t\t\t\tstack.push(nxt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn seen;\n\t};\n\tconst onPath = new Set([...reach(chain.from, fwd)].filter((id) => reach(chain.to, rev).has(id)));\n\treturn {\n\t\t...(snap.name !== undefined ? { name: snap.name } : {}),\n\t\tnodes: snap.nodes.filter((n) => onPath.has(n.id)),\n\t\tedges: snap.edges.filter((e) => onPath.has(e.from) && onPath.has(e.to)),\n\t};\n}\n\n/** Construct a Graph (default global dispatcher; L4-Q4). */\nexport function graph(opts: GraphOptions = {}): Graph {\n\treturn new Graph(opts);\n}\n\n/** @internal D122 graph-owned ephemeral node-group release. */\nexport function releaseGraphNodes(\n\tgraph: Graph,\n\tnodes: readonly Node<unknown>[],\n\topts: { reason?: string } = {},\n): void {\n\tconst registrar = lifecycleRegistrars.get(graph);\n\tif (registrar === undefined) throw new Error(\"graph: unknown lifecycle registrar\");\n\tregistrar.releaseNodes(nodes, opts);\n}\n\n/** @internal D94 descriptor path: register a restored state node without widening Graph. */\nexport function restoreStateNodeInGraph<T = unknown>(\n\tgraph: Graph,\n\tid: string,\n\topts: SugarOpts<T> = {},\n): StateNode<T> {\n\tconst registrar = restoreRegistrars.get(graph);\n\tif (registrar === undefined) throw new Error(\"restoreGraph: unknown graph restore registrar\");\n\treturn registrar.stateNode(id, opts);\n}\n\n/** @internal D94 descriptor path: register a restored ctx-level node without widening Graph. */\nexport function restoreNodeInGraph<T = unknown>(\n\tgraph: Graph,\n\tid: string,\n\tfactory: string,\n\tdeps: readonly Node<unknown>[],\n\tfn: NodeFn | null,\n\topts: SugarOpts<T> = {},\n): Node<T> {\n\tconst registrar = restoreRegistrars.get(graph);\n\tif (registrar === undefined) throw new Error(\"restoreGraph: unknown graph restore registrar\");\n\treturn registrar.node(id, factory, deps, fn, opts);\n}\n","/**\n * Passive semantic-memory vocabulary and deterministic helpers.\n *\n * D158 splits semantic memory into horizontal patterns and vertical solutions.\n * This module intentionally owns no graph nodes, storage restore, timers,\n * subscriptions, vector indexes, knowledge graphs, or agentic runtime.\n */\n\nimport type { StrictJsonValue } from \"../json/codec.js\";\n\n/** Stable identity for a semantic-memory fact. */\nexport type FactId = string;\n\n/** Shard partition key used by passive sharding helpers. */\nexport type ShardKey = string | number;\n\n/**\n * A single semantic-memory fact. Pattern convention only: this is not a\n * protocol message, storage record owner, restore contract, or graph runtime.\n */\nexport interface MemoryFragment<T = unknown> {\n\treadonly id: FactId;\n\treadonly payload: T;\n\t/** Transaction time, typically monotonic nanoseconds. */\n\treadonly tNs: bigint;\n\t/** Valid-time start. Undefined means unbounded past. */\n\treadonly validFrom?: bigint;\n\t/** Valid-time end. Undefined means currently valid. */\n\treadonly validTo?: bigint;\n\t/** Confidence score in the closed interval [0, 1]. */\n\treadonly confidence: number;\n\treadonly tags: readonly string[];\n\t/** Fact ids this fragment derives from or depends on. */\n\treadonly sources: readonly FactId[];\n\treadonly embedding?: readonly number[];\n\treadonly parentFragmentId?: FactId;\n\treadonly provenance?: string;\n}\n\n/** Columnar passive store vocabulary for callers that keep memory facts outside GraphReFly. */\nexport interface FactStore<T = unknown> {\n\treadonly byId: ReadonlyMap<FactId, MemoryFragment<T>>;\n}\n\n/** Read-only projection passed to scoring policies; it exposes no mutation surface. */\nexport interface StoreReadHandle<T = unknown> {\n\tget(id: FactId): MemoryFragment<T> | undefined;\n\thas(id: FactId): boolean;\n\treadonly size: number;\n\tvalues(): IterableIterator<MemoryFragment<T>>;\n}\n\nexport type ScoringPolicy<T = unknown> = (\n\tfragment: MemoryFragment<T>,\n\tstore: StoreReadHandle<T>,\n) => number;\nexport type DecayPolicy = (confidence: number, ageNs: bigint) => number;\nexport type AdmissionFilter<T = unknown> = (fragment: MemoryFragment<T>) => boolean;\n\n/** Outcome signal for policy learning. This is an application fact, not a protocol event. */\nexport interface OutcomeSignal {\n\treadonly factId: FactId;\n\treadonly reward: number;\n}\n\n/** Passive structured query over semantic-memory facts. */\nexport interface MemoryQuery {\n\treadonly tags?: readonly string[];\n\treadonly asOf?: bigint;\n\treadonly minConfidence?: number;\n\treadonly limit?: number;\n}\n\nexport interface MemoryAnswer<T = unknown> {\n\treadonly query: MemoryQuery;\n\treadonly results: readonly MemoryFragment<T>[];\n}\n\nexport type KnowledgeAssertionStrictJsonValue = StrictJsonValue;\n\n/** Passive KG endpoint vocabulary. Entity ids are DATA keys, not graph node ids. */\nexport interface KnowledgeAssertionSubject {\n\treadonly id: FactId;\n\treadonly type?: string;\n}\n\n/** Passive KG object/value vocabulary. */\nexport type KnowledgeAssertionObject =\n\t| {\n\t\t\treadonly kind: \"entity\";\n\t\t\treadonly id: FactId;\n\t\t\treadonly type?: string;\n\t  }\n\t| {\n\t\t\treadonly kind: \"value\";\n\t\t\treadonly value: KnowledgeAssertionStrictJsonValue;\n\t\t\treadonly valueType?: string;\n\t  };\n\n/** Passive KG assertion fact consumed by lower semantic-memory graph patterns. */\nexport interface KnowledgeAssertion {\n\treadonly id: FactId;\n\treadonly recordId?: FactId;\n\treadonly fragmentId?: FactId;\n\treadonly subject: KnowledgeAssertionSubject;\n\treadonly predicate: string;\n\treadonly object: KnowledgeAssertionObject;\n\treadonly confidence?: number;\n\treadonly sources?: readonly FactId[];\n\treadonly provenance?: string;\n}\n\n/** Entry vocabulary for ranked collection-like memory views. */\nexport interface CollectionEntry<T = unknown> {\n\treadonly id: string;\n\treadonly value: T;\n\treadonly createdAtNs: bigint;\n\treadonly lastAccessNs: bigint;\n\treadonly baseScore: number;\n}\n\nexport type RankedCollectionEntry<T = unknown> = CollectionEntry<T> & {\n\treadonly score: number;\n};\n\nexport type CollectionScoreFn<T = unknown> = (value: T) => number;\n\n/** Query shape shared by passive retrieval/ranking helpers. */\nexport interface RetrievalQuery {\n\treadonly text?: string;\n\treadonly vector?: readonly number[];\n\treadonly entityIds?: readonly string[];\n\treadonly context?: readonly string[];\n}\n\nexport interface VectorSearchResult<TMeta = unknown> {\n\treadonly id: string;\n\treadonly score: number;\n\treadonly meta?: TMeta;\n}\n\nexport interface RetrievalEntry<TMem = unknown> {\n\treadonly key: string;\n\treadonly value: TMem;\n\treadonly score: number;\n\treadonly sources: ReadonlyArray<\"vector\" | \"graph\" | \"store\">;\n\treadonly context?: readonly string[];\n}\n\nexport interface RetrievalTrace<TMem = unknown> {\n\treadonly vectorCandidates: ReadonlyArray<VectorSearchResult<TMem>>;\n\treadonly graphExpanded: ReadonlyArray<string>;\n\treadonly ranked: ReadonlyArray<RetrievalEntry<TMem>>;\n\treadonly packed: ReadonlyArray<RetrievalEntry<TMem>>;\n}\n\n/** Generic per-dimension thresholds. Any configured dimension below threshold is rejected. */\nexport type AdmissionThresholds<Dims extends string> = Partial<Record<Dims, number>>;\n\nexport interface AdmissionScoredOptions<Dims extends string, TRaw = unknown> {\n\treadonly scoreFn: (raw: TRaw) => Readonly<Record<Dims, number>>;\n\treadonly thresholds?: AdmissionThresholds<Dims>;\n}\n\nexport interface AdmissionScores {\n\treadonly persistence: number;\n\treadonly structure: number;\n\treadonly personalValue: number;\n}\n\nexport interface AdmissionScore3DOptions {\n\treadonly scoreFn: (raw: unknown) => AdmissionScores;\n\treadonly persistenceThreshold?: number;\n\treadonly personalValueThreshold?: number;\n\treadonly requireStructured?: boolean;\n}\n\nexport interface ShardByTenantOptions {\n\treadonly tenants?: readonly string[];\n\treadonly shardCount?: number;\n}\n\nexport interface ShardByTenantConfig<T = unknown> {\n\treadonly shardBy: (fragment: MemoryFragment<T>) => ShardKey;\n\treadonly shardCount: number;\n}\n\nexport interface MemoryFragmentValidation {\n\treadonly ok: boolean;\n\treadonly errors: readonly string[];\n}\n\n/** Cosine similarity over zero-padded vectors. Non-finite results normalize to 0. */\nexport function cosineSimilarity(a: readonly number[], b: readonly number[]): number {\n\tconst n = Math.max(a.length, b.length);\n\tlet dot = 0;\n\tlet na = 0;\n\tlet nb = 0;\n\tfor (let i = 0; i < n; i += 1) {\n\t\tconst av = a[i] ?? 0;\n\t\tconst bv = b[i] ?? 0;\n\t\tdot += av * bv;\n\t\tna += av * av;\n\t\tnb += bv * bv;\n\t}\n\tif (na === 0 || nb === 0) return 0;\n\tconst score = dot / Math.sqrt(na * nb);\n\treturn Number.isFinite(score) ? score : 0;\n}\n\n/**\n * Returns true when a fragment is valid at `asOf`.\n *\n * Omitted `asOf` has no clock to compare against, so it admits only fragments\n * that are live and not valid-time delayed.\n */\nexport function memoryFragmentValidAt(fragment: MemoryFragment, asOf?: bigint): boolean {\n\tif (asOf === undefined) return fragment.validTo === undefined && fragment.validFrom === undefined;\n\tif (fragment.validFrom !== undefined && fragment.validFrom > asOf) return false;\n\tif (fragment.validTo !== undefined && fragment.validTo <= asOf) return false;\n\treturn true;\n}\n\n/** Pure structured-query predicate over a single fragment. */\nexport function memoryFragmentMatchesQuery(\n\tfragment: MemoryFragment,\n\tquery: MemoryQuery = {},\n): boolean {\n\tif (!memoryFragmentValidAt(fragment, query.asOf)) return false;\n\tif (query.minConfidence !== undefined && fragment.confidence < query.minConfidence) return false;\n\tif (\n\t\tquery.tags &&\n\t\tquery.tags.length > 0 &&\n\t\t!query.tags.some((tag) => fragment.tags.includes(tag))\n\t) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\n/** Filter and rank fragments by confidence desc, then transaction time desc. */\nexport function filterMemoryFragments<T>(\n\tfragments: Iterable<MemoryFragment<T>>,\n\tquery: MemoryQuery = {},\n): readonly MemoryFragment<T>[] {\n\tconst results = [...fragments].filter((fragment) => memoryFragmentMatchesQuery(fragment, query));\n\tresults.sort((a, b) => b.confidence - a.confidence || compareBigIntDesc(a.tNs, b.tNs));\n\treturn query.limit === undefined ? results : results.slice(0, Math.max(0, query.limit));\n}\n\n/** Validate the passive MemoryFragment shape without throwing. */\nexport function validateMemoryFragment(value: unknown): MemoryFragmentValidation {\n\tconst errors: string[] = [];\n\tif (typeof value !== \"object\" || value === null) {\n\t\treturn { ok: false, errors: [\"fragment must be an object\"] };\n\t}\n\tconst fragment = value as Partial<MemoryFragment>;\n\tif (typeof fragment.id !== \"string\" || fragment.id.length === 0) {\n\t\terrors.push(\"id must be a non-empty string\");\n\t}\n\tif (!Object.hasOwn(fragment, \"payload\")) {\n\t\terrors.push(\"payload must be present\");\n\t}\n\tif (typeof fragment.tNs !== \"bigint\") {\n\t\terrors.push(\"tNs must be a bigint\");\n\t}\n\tconst confidence = fragment.confidence;\n\tif (\n\t\t!Number.isFinite(confidence) ||\n\t\tconfidence === undefined ||\n\t\tconfidence < 0 ||\n\t\tconfidence > 1\n\t) {\n\t\terrors.push(\"confidence must be a finite number in [0, 1]\");\n\t}\n\tif (!isDenseArrayOf(fragment.tags, (tag): tag is string => typeof tag === \"string\")) {\n\t\terrors.push(\"tags must be a readonly string array\");\n\t}\n\tif (!isDenseArrayOf(fragment.sources, (source): source is string => typeof source === \"string\")) {\n\t\terrors.push(\"sources must be a readonly string array\");\n\t}\n\tif (fragment.validFrom !== undefined && typeof fragment.validFrom !== \"bigint\") {\n\t\terrors.push(\"validFrom must be a bigint when present\");\n\t}\n\tif (fragment.validTo !== undefined && typeof fragment.validTo !== \"bigint\") {\n\t\terrors.push(\"validTo must be a bigint when present\");\n\t}\n\tif (\n\t\ttypeof fragment.validFrom === \"bigint\" &&\n\t\ttypeof fragment.validTo === \"bigint\" &&\n\t\tfragment.validFrom >= fragment.validTo\n\t) {\n\t\terrors.push(\"validFrom must be earlier than validTo\");\n\t}\n\tif (\n\t\tfragment.embedding !== undefined &&\n\t\t!isDenseArrayOf(fragment.embedding, (component): component is number =>\n\t\t\tNumber.isFinite(component),\n\t\t)\n\t) {\n\t\terrors.push(\"embedding must be a finite number array when present\");\n\t}\n\tif (fragment.parentFragmentId !== undefined && typeof fragment.parentFragmentId !== \"string\") {\n\t\terrors.push(\"parentFragmentId must be a string when present\");\n\t}\n\tif (fragment.provenance !== undefined && typeof fragment.provenance !== \"string\") {\n\t\terrors.push(\"provenance must be a string when present\");\n\t}\n\treturn { ok: errors.length === 0, errors };\n}\n\nexport function isMemoryFragment(value: unknown): value is MemoryFragment {\n\treturn validateMemoryFragment(value).ok;\n}\n\n/**\n * Generic N-dimension admission filter. Missing or non-finite thresholded scores reject.\n */\nexport function admissionScored<Dims extends string, TRaw = unknown>(\n\topts: AdmissionScoredOptions<Dims, TRaw>,\n): (raw: TRaw) => boolean {\n\tconst thresholds = opts.thresholds ?? ({} as AdmissionThresholds<Dims>);\n\treturn (raw: TRaw): boolean => {\n\t\tconst scores = opts.scoreFn(raw);\n\t\tfor (const dim of Object.keys(thresholds) as Dims[]) {\n\t\t\tconst min = thresholds[dim];\n\t\t\tif (min === undefined) continue;\n\t\t\tconst score = scores[dim];\n\t\t\tconst safe = Number.isFinite(score) ? (score as number) : Number.NEGATIVE_INFINITY;\n\t\t\tif (safe < min) return false;\n\t\t}\n\t\treturn true;\n\t};\n}\n\n/** Three-axis admission sugar for persistence / structure / personal-value scoring. */\nexport function admissionFilter3D(opts: AdmissionScore3DOptions): (raw: unknown) => boolean {\n\treturn (raw: unknown): boolean => {\n\t\tconst scores = opts.scoreFn(raw);\n\t\tif (!scoreAtLeast(scores.persistence, opts.persistenceThreshold ?? 0.3)) return false;\n\t\tif (!scoreAtLeast(scores.personalValue, opts.personalValueThreshold ?? 0.3)) return false;\n\t\tif (!opts.requireStructured) return true;\n\t\treturn scoreAtLeast(scores.structure, Number.MIN_VALUE);\n\t};\n}\n\n/** Build a passive `{ shardBy, shardCount }` pair for tenant-isolated sharding. */\nexport function shardByTenant<T>(\n\ttenantOf: (fragment: MemoryFragment<T>) => string,\n\topts: ShardByTenantOptions = {},\n): ShardByTenantConfig<T> {\n\tif (opts.tenants && opts.tenants.length > 0) {\n\t\tconst tenants = [...new Set(opts.tenants)];\n\t\tconst index = new Map(tenants.map((tenant, i) => [tenant, i] as const));\n\t\tconst overflow = tenants.length;\n\t\treturn {\n\t\t\tshardBy: (fragment) => index.get(tenantOf(fragment)) ?? overflow,\n\t\t\tshardCount: tenants.length + 1,\n\t\t};\n\t}\n\tconst configuredShardCount = opts.shardCount ?? 4;\n\tconst shardCount = Number.isSafeInteger(configuredShardCount)\n\t\t? Math.max(1, configuredShardCount)\n\t\t: 4;\n\treturn { shardBy: (fragment) => tenantOf(fragment), shardCount };\n}\n\nfunction compareBigIntDesc(a: bigint, b: bigint): number {\n\tif (a === b) return 0;\n\treturn a > b ? -1 : 1;\n}\n\nfunction isDenseArrayOf<T>(value: unknown, predicate: (item: unknown) => item is T): value is T[] {\n\tif (!Array.isArray(value)) return false;\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i) || !predicate(value[i])) return false;\n\t}\n\treturn true;\n}\n\nfunction scoreAtLeast(score: number, min: number): boolean {\n\treturn Number.isFinite(score) && score >= min;\n}\n","/**\n * Thin agentic-memory solution surface.\n *\n * D125 places vertical application kits under solutions, while D158 keeps\n * semantic-memory retrieval/ranking in horizontal patterns. This v0 bundle\n * composes those lower layers into graph-visible facts only: no agent runtime,\n * hidden scheduler, storage restore/hydration, LLM loop, or protocol behavior.\n */\n\nimport { depBatch, depLatest } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport {\n\ttype Codec,\n\ttype StrictJsonValue as SharedStrictJsonValue,\n\tstrictJsonCodec,\n} from \"../json/codec.js\";\nimport type { Node } from \"../node/node.js\";\nimport {\n\ttype FactId,\n\ttype KnowledgeAssertion,\n\ttype KnowledgeAssertionObject,\n\ttype KnowledgeAssertionSubject,\n\ttype MemoryAnswer,\n\ttype MemoryFragment,\n\tvalidateMemoryFragment,\n} from \"../patterns/semantic-memory.js\";\nimport {\n\ttype MemoryRetrievalBundle,\n\ttype MemoryRetrievalCursor,\n\ttype MemoryRetrievalError,\n\ttype MemoryRetrievalIndex,\n\ttype MemoryRetrievalQuery,\n\ttype MemoryRetrievalSnapshot,\n\ttype MemoryRetrievalStatus,\n\tmemoryRetrievalBundle,\n} from \"../patterns/semantic-memory-graph.js\";\n\nexport type AgenticMemoryStrictJsonValue = SharedStrictJsonValue;\n\ntype StrictJsonValue = SharedStrictJsonValue;\n\nexport type {\n\tKnowledgeAssertion,\n\tKnowledgeAssertionObject,\n\tKnowledgeAssertionSubject,\n} from \"../patterns/semantic-memory.js\";\n\n/** Agent-facing memory category. D164 keeps this separate from durability and artifact kind. */\nexport type AgenticMemoryKind = \"working\" | \"episodic\" | \"semantic\" | \"procedural\" | \"profile\";\n\n/** Semantic durability/retention policy metadata. This is not a storage tier handle. */\nexport type AgenticMemoryPersistenceLevel =\n\t| \"turn\"\n\t| \"session\"\n\t| \"project\"\n\t| \"longTerm\"\n\t| \"permanent\"\n\t| \"archived\";\n\n/** Whether the record is raw evidence or a derived artifact. */\nexport type AgenticMemoryArtifactKind = \"raw\" | \"insight\" | \"profile\" | \"procedure\";\n\n/** Optional solution-facing scope metadata. Scope ids are ordinary DATA facts. */\nexport interface AgenticMemoryScope {\n\treadonly sessionId?: string;\n\treadonly projectId?: string;\n\treadonly userId?: string;\n\treadonly tenantId?: string;\n}\n\n/**\n * D164 solution envelope over a lower-layer MemoryFragment.\n *\n * The envelope carries agentic-memory metadata only. It intentionally owns no\n * storage tiers/keys/adapters, restore/hydration behavior, timers, schedulers,\n * LLM/tool/runner handles, or protocol semantics.\n */\nexport interface AgenticMemoryRecord<T = unknown> {\n\treadonly id: FactId;\n\treadonly kind: AgenticMemoryKind;\n\treadonly persistenceLevel: AgenticMemoryPersistenceLevel;\n\treadonly artifactKind: AgenticMemoryArtifactKind;\n\treadonly scope?: AgenticMemoryScope;\n\treadonly fragment: MemoryFragment<T>;\n}\n\nexport interface AgenticMemoryRecordMetadata {\n\treadonly recordId: FactId;\n\treadonly kind: AgenticMemoryKind;\n\treadonly persistenceLevel: AgenticMemoryPersistenceLevel;\n\treadonly artifactKind: AgenticMemoryArtifactKind;\n\treadonly scope?: AgenticMemoryScope;\n}\n\nexport interface AgenticMemoryProjectionCursor {\n\treadonly evaluation: number;\n\treadonly validRecords: number;\n\treadonly invalidRecords: number;\n\treadonly projectedFragments: number;\n}\n\nexport type AgenticMemoryStatusState = \"ready\" | \"empty\" | \"partial\" | \"error\";\n\nexport interface AgenticMemoryStatus {\n\treadonly state: AgenticMemoryStatusState;\n\treadonly cursor: AgenticMemoryProjectionCursor;\n}\n\nexport type AgenticMemoryErrorCode =\n\t| \"duplicate-record-id\"\n\t| \"duplicate-fragment-id\"\n\t| \"invalid-records-input\"\n\t| \"invalid-record\"\n\t| \"invalid-record-kind\"\n\t| \"invalid-persistence-level\"\n\t| \"invalid-artifact-kind\"\n\t| \"invalid-scope\"\n\t| \"invalid-fragment\";\n\nexport interface AgenticMemoryError {\n\treadonly code: AgenticMemoryErrorCode;\n\treadonly message: string;\n\treadonly index?: number;\n\treadonly recordId?: FactId;\n\treadonly fragmentId?: FactId;\n\treadonly record?: unknown;\n\treadonly validationErrors?: readonly string[];\n\treadonly cursor: AgenticMemoryProjectionCursor;\n}\n\nexport interface AgenticMemoryProjectionSnapshot<T = unknown> {\n\treadonly records: readonly AgenticMemoryRecord<T>[];\n\treadonly fragments: readonly MemoryFragment<T>[];\n\treadonly metadataByFragmentId: Readonly<Record<FactId, AgenticMemoryRecordMetadata>>;\n\treadonly status: AgenticMemoryStatus;\n\treadonly errors: readonly AgenticMemoryError[];\n\treadonly cursor: AgenticMemoryProjectionCursor;\n}\n\n/** Source/provenance projection for a valid memory fragment. */\nexport interface AgenticMemorySourceProjection {\n\treadonly fragmentId: FactId;\n\treadonly record?: AgenticMemoryRecordMetadata;\n\treadonly sources: readonly FactId[];\n\treadonly parentFragmentId?: FactId;\n\treadonly provenance?: string;\n}\n\n/** A context-ready item derived from ranked memory retrieval results. */\nexport interface AgenticMemoryContextEntry<T = unknown> {\n\treadonly fragmentId: FactId;\n\treadonly payload: T;\n\treadonly confidence: number;\n\treadonly tags: readonly string[];\n\treadonly sources: readonly FactId[];\n\treadonly record?: AgenticMemoryRecordMetadata;\n\treadonly fragment: MemoryFragment<T>;\n}\n\nexport type AgenticMemoryContextState = \"ready\" | \"empty\" | \"partial\" | \"error\";\n\n/**\n * Context-ready ranked memory output for callers such as prompt builders.\n *\n * This is still only a DATA fact. It does not extract, summarize, reflect, run\n * tools, or choose an autonomous action.\n */\nexport interface AgenticMemoryContext<T = unknown> {\n\treadonly state: AgenticMemoryContextState;\n\treadonly query: MemoryRetrievalQuery;\n\treadonly entries: readonly AgenticMemoryContextEntry<T>[];\n\treadonly cursor: MemoryRetrievalCursor;\n\treadonly errors: readonly AgenticMemoryError[];\n\treadonly retrievalErrors: readonly MemoryRetrievalError[];\n\treadonly contextReady: boolean;\n}\n\n/** Explicit KG assertion draft fact; extraction/LLM work happens outside this bundle. */\nexport interface AgenticMemoryKgAssertionDraft {\n\treadonly id: FactId;\n\treadonly recordId: FactId;\n\treadonly fragmentId: FactId;\n\treadonly subject: KnowledgeAssertionSubject;\n\treadonly predicate: string;\n\treadonly object: KnowledgeAssertionObject;\n\treadonly confidence?: number;\n\treadonly sources?: readonly FactId[];\n\treadonly provenance?: string;\n}\n\nexport interface AgenticMemoryKgProjectionCursor {\n\treadonly evaluation: number;\n\treadonly validRecords: number;\n\treadonly validDrafts: number;\n\treadonly invalidDrafts: number;\n\treadonly projectedAssertions: number;\n}\n\nexport type AgenticMemoryKgProjectionStatusState = AgenticMemoryStatusState;\n\nexport interface AgenticMemoryKgProjectionStatus {\n\treadonly state: AgenticMemoryKgProjectionStatusState;\n\treadonly cursor: AgenticMemoryKgProjectionCursor;\n}\n\nexport type AgenticMemoryKgProjectionErrorCode =\n\t| AgenticMemoryErrorCode\n\t| \"invalid-drafts-input\"\n\t| \"invalid-draft\"\n\t| \"duplicate-assertion-id\"\n\t| \"missing-record-ref\"\n\t| \"missing-fragment-ref\"\n\t| \"fragment-record-mismatch\"\n\t| \"invalid-assertion-shape\";\n\nexport interface AgenticMemoryKgProjectionError {\n\treadonly code: AgenticMemoryKgProjectionErrorCode;\n\treadonly message: string;\n\treadonly index?: number;\n\treadonly assertionId?: FactId;\n\treadonly recordId?: FactId;\n\treadonly fragmentId?: FactId;\n\treadonly draft?: unknown;\n\treadonly record?: unknown;\n\treadonly validationErrors?: readonly string[];\n\treadonly cursor: AgenticMemoryKgProjectionCursor;\n}\n\nexport interface AgenticMemoryKgProjectionSnapshot {\n\treadonly assertions: readonly KnowledgeAssertion[];\n\treadonly status: AgenticMemoryKgProjectionStatus;\n\treadonly errors: readonly AgenticMemoryKgProjectionError[];\n\treadonly cursor: AgenticMemoryKgProjectionCursor;\n}\n\nexport interface AgenticMemoryKgProjectionBundle {\n\treadonly input: {\n\t\treadonly records: Node<readonly AgenticMemoryRecord[]>;\n\t\treadonly drafts: Node<readonly AgenticMemoryKgAssertionDraft[]>;\n\t};\n\treadonly projection: Node<AgenticMemoryKgProjectionSnapshot>;\n\treadonly assertions: Node<readonly KnowledgeAssertion[]>;\n\treadonly status: Node<AgenticMemoryKgProjectionStatus>;\n\treadonly errors: Node<readonly AgenticMemoryKgProjectionError[]>;\n\treadonly cursor: Node<AgenticMemoryKgProjectionCursor>;\n}\n\nexport interface AgenticMemoryKgProjectionBundleOptions {\n\treadonly name?: string;\n\treadonly records: Node<readonly AgenticMemoryRecord[]>;\n\treadonly drafts: Node<readonly AgenticMemoryKgAssertionDraft[]>;\n}\n\nexport const AGENTIC_MEMORY_RECORD_FRAME_FORMAT = \"graphrefly.agenticMemoryRecord\";\nexport const AGENTIC_MEMORY_RECORD_FRAME_VERSION = 1;\n\nexport interface AgenticMemoryFragmentFrame<TJson extends StrictJsonValue = StrictJsonValue> {\n\treadonly id: FactId;\n\treadonly payload: TJson;\n\treadonly tNs: string;\n\treadonly validFrom?: string;\n\treadonly validTo?: string;\n\treadonly confidence: number;\n\treadonly tags: readonly string[];\n\treadonly sources: readonly FactId[];\n\treadonly embedding?: readonly number[];\n\treadonly parentFragmentId?: FactId;\n\treadonly provenance?: string;\n}\n\nexport interface AgenticMemoryRecordFrame<TJson extends StrictJsonValue = StrictJsonValue> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_FRAME_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_FRAME_VERSION;\n\treadonly record: {\n\t\treadonly id: FactId;\n\t\treadonly kind: AgenticMemoryKind;\n\t\treadonly persistenceLevel: AgenticMemoryPersistenceLevel;\n\t\treadonly artifactKind: AgenticMemoryArtifactKind;\n\t\treadonly scope?: AgenticMemoryScope;\n\t\treadonly fragment: AgenticMemoryFragmentFrame<TJson>;\n\t};\n}\n\nexport type AgenticMemoryRetentionCommand =\n\t| {\n\t\t\treadonly id: FactId;\n\t\t\treadonly kind: \"archive\";\n\t\t\treadonly recordId: FactId;\n\t\t\treadonly reason?: string;\n\t  }\n\t| {\n\t\t\treadonly id: FactId;\n\t\t\treadonly kind: \"restore\";\n\t\t\treadonly recordId: FactId;\n\t\t\treadonly persistenceLevel?: Exclude<AgenticMemoryPersistenceLevel, \"archived\">;\n\t\t\treadonly reason?: string;\n\t  }\n\t| {\n\t\t\treadonly id: FactId;\n\t\t\treadonly kind: \"setPersistenceLevel\";\n\t\t\treadonly recordId: FactId;\n\t\t\treadonly persistenceLevel: AgenticMemoryPersistenceLevel;\n\t\t\treadonly reason?: string;\n\t  }\n\t| {\n\t\t\treadonly id: FactId;\n\t\t\treadonly kind: \"requestConsolidation\";\n\t\t\treadonly recordIds: readonly FactId[];\n\t\t\treadonly requestId?: FactId;\n\t\t\treadonly reason?: string;\n\t  };\n\nexport interface AgenticMemoryConsolidationRequest {\n\treadonly id: FactId;\n\treadonly commandId: FactId;\n\treadonly recordIds: readonly FactId[];\n\treadonly reason?: string;\n}\n\nexport interface AgenticMemoryRetentionCursor {\n\treadonly evaluation: number;\n\treadonly validRecords: number;\n\treadonly validCommands: number;\n\treadonly invalidCommands: number;\n\treadonly activeRecords: number;\n\treadonly archivedRecords: number;\n\treadonly consolidationRequests: number;\n}\n\nexport interface AgenticMemoryRetentionStatus {\n\treadonly state: AgenticMemoryStatusState;\n\treadonly cursor: AgenticMemoryRetentionCursor;\n}\n\nexport type AgenticMemoryRetentionErrorCode =\n\t| AgenticMemoryErrorCode\n\t| \"invalid-commands-input\"\n\t| \"invalid-command\"\n\t| \"duplicate-command-id\"\n\t| \"missing-record-ref\";\n\nexport interface AgenticMemoryRetentionError {\n\treadonly code: AgenticMemoryRetentionErrorCode;\n\treadonly message: string;\n\treadonly index?: number;\n\treadonly commandId?: FactId;\n\treadonly recordId?: FactId;\n\treadonly recordIds?: readonly FactId[];\n\treadonly command?: unknown;\n\treadonly record?: unknown;\n\treadonly validationErrors?: readonly string[];\n\treadonly cursor: AgenticMemoryRetentionCursor;\n}\n\nexport interface AgenticMemoryRetentionSnapshot<T = unknown> {\n\treadonly activeRecords: readonly AgenticMemoryRecord<T>[];\n\treadonly archivedRecords: readonly AgenticMemoryRecord<T>[];\n\treadonly consolidationRequests: readonly AgenticMemoryConsolidationRequest[];\n\treadonly status: AgenticMemoryRetentionStatus;\n\treadonly errors: readonly AgenticMemoryRetentionError[];\n\treadonly cursor: AgenticMemoryRetentionCursor;\n}\n\nexport interface AgenticMemoryRetentionBundle<T = unknown> {\n\treadonly input: {\n\t\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\t\treadonly commands: Node<readonly AgenticMemoryRetentionCommand[]>;\n\t};\n\treadonly projection: Node<AgenticMemoryRetentionSnapshot<T>>;\n\treadonly activeRecords: Node<readonly AgenticMemoryRecord<T>[]>;\n\treadonly archivedRecords: Node<readonly AgenticMemoryRecord<T>[]>;\n\treadonly consolidationRequests: Node<readonly AgenticMemoryConsolidationRequest[]>;\n\treadonly status: Node<AgenticMemoryRetentionStatus>;\n\treadonly errors: Node<readonly AgenticMemoryRetentionError[]>;\n\treadonly cursor: Node<AgenticMemoryRetentionCursor>;\n}\n\nexport interface AgenticMemoryRetentionBundleOptions<T = unknown> {\n\treadonly name?: string;\n\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\treadonly commands: Node<readonly AgenticMemoryRetentionCommand[]>;\n}\n\nexport type AgenticMemoryConsolidationOutcome<T = unknown> =\n\t| {\n\t\t\treadonly id: FactId;\n\t\t\treadonly requestId: FactId;\n\t\t\treadonly kind: \"proposedRecords\";\n\t\t\treadonly records: readonly AgenticMemoryRecord<T>[];\n\t\t\treadonly provenance?: string;\n\t  }\n\t| {\n\t\t\treadonly id: FactId;\n\t\t\treadonly requestId: FactId;\n\t\t\treadonly kind: \"failed\";\n\t\t\treadonly message: string;\n\t\t\treadonly provenance?: string;\n\t  };\n\nexport interface AgenticMemoryConsolidationRecordDraft<T = unknown> {\n\treadonly id: FactId;\n\treadonly requestId: FactId;\n\treadonly outcomeId: FactId;\n\treadonly record: AgenticMemoryRecord<T>;\n}\n\nexport interface AgenticMemoryConsolidationCommand {\n\treadonly id: FactId;\n\treadonly kind: \"proposeRecords\" | \"markFailed\";\n\treadonly requestId: FactId;\n\treadonly outcomeId: FactId;\n\treadonly draftIds?: readonly FactId[];\n\treadonly message?: string;\n}\n\nexport interface AgenticMemoryConsolidationResult {\n\treadonly id: FactId;\n\treadonly requestId: FactId;\n\treadonly outcomeId: FactId;\n\treadonly state: \"proposed\" | \"failed\";\n\treadonly sourceRecordIds: readonly FactId[];\n\treadonly proposedRecordIds: readonly FactId[];\n\treadonly message?: string;\n\treadonly provenance?: string;\n}\n\nexport interface AgenticMemoryConsolidationCursor {\n\treadonly evaluation: number;\n\treadonly validRequests: number;\n\treadonly validOutcomes: number;\n\treadonly invalidOutcomes: number;\n\treadonly results: number;\n\treadonly proposedRecordDrafts: number;\n}\n\nexport interface AgenticMemoryConsolidationStatus {\n\treadonly state: AgenticMemoryStatusState;\n\treadonly cursor: AgenticMemoryConsolidationCursor;\n}\n\nexport type AgenticMemoryConsolidationErrorCode =\n\t| AgenticMemoryRetentionErrorCode\n\t| \"invalid-outcomes-input\"\n\t| \"invalid-outcome\"\n\t| \"duplicate-outcome-id\"\n\t| \"missing-request-ref\"\n\t| \"invalid-proposed-record\";\n\nexport interface AgenticMemoryConsolidationError {\n\treadonly code: AgenticMemoryConsolidationErrorCode;\n\treadonly message: string;\n\treadonly index?: number;\n\treadonly outcomeId?: FactId;\n\treadonly requestId?: FactId;\n\treadonly recordId?: FactId;\n\treadonly outcome?: unknown;\n\treadonly validationErrors?: readonly string[];\n\treadonly cursor: AgenticMemoryConsolidationCursor;\n}\n\nexport interface AgenticMemoryConsolidationSnapshot<T = unknown> {\n\treadonly results: readonly AgenticMemoryConsolidationResult[];\n\treadonly proposedRecordDrafts: readonly AgenticMemoryConsolidationRecordDraft<T>[];\n\treadonly commands: readonly AgenticMemoryConsolidationCommand[];\n\treadonly status: AgenticMemoryConsolidationStatus;\n\treadonly errors: readonly AgenticMemoryConsolidationError[];\n\treadonly cursor: AgenticMemoryConsolidationCursor;\n}\n\nexport interface AgenticMemoryConsolidationBundle<T = unknown> {\n\treadonly input: {\n\t\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\t\treadonly requests: Node<readonly AgenticMemoryConsolidationRequest[]>;\n\t\treadonly outcomes: Node<readonly AgenticMemoryConsolidationOutcome<T>[]>;\n\t};\n\treadonly projection: Node<AgenticMemoryConsolidationSnapshot<T>>;\n\treadonly results: Node<readonly AgenticMemoryConsolidationResult[]>;\n\treadonly proposedRecordDrafts: Node<readonly AgenticMemoryConsolidationRecordDraft<T>[]>;\n\treadonly commands: Node<readonly AgenticMemoryConsolidationCommand[]>;\n\treadonly status: Node<AgenticMemoryConsolidationStatus>;\n\treadonly errors: Node<readonly AgenticMemoryConsolidationError[]>;\n\treadonly cursor: Node<AgenticMemoryConsolidationCursor>;\n}\n\nexport interface AgenticMemoryConsolidationBundleOptions<T = unknown> {\n\treadonly name?: string;\n\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\treadonly requests: Node<readonly AgenticMemoryConsolidationRequest[]>;\n\treadonly outcomes: Node<readonly AgenticMemoryConsolidationOutcome<T>[]>;\n}\n\nexport interface AgenticMemoryContextText {\n\treadonly fragmentId: FactId;\n\treadonly text: string;\n\treadonly cost?: number;\n\treadonly metadata?: Readonly<Record<string, StrictJsonValue>>;\n}\n\nexport interface AgenticMemoryContextPackingPolicy {\n\treadonly maxEntries?: number;\n\treadonly maxChars?: number;\n\treadonly maxCost?: number;\n\treadonly includeMetadata?: boolean;\n}\n\nexport interface AgenticMemoryPackedContextEntry {\n\treadonly fragmentId: FactId;\n\treadonly text: string;\n\treadonly cost: number;\n\treadonly chars: number;\n\treadonly record?: AgenticMemoryRecordMetadata;\n\treadonly metadata?: Readonly<Record<string, StrictJsonValue>>;\n}\n\nexport interface AgenticMemoryPackedContext {\n\treadonly entries: readonly AgenticMemoryPackedContextEntry[];\n\treadonly text: string;\n\treadonly totalChars: number;\n\treadonly totalCost: number;\n\treadonly truncated: boolean;\n}\n\nexport interface AgenticMemoryContextPackingCursor {\n\treadonly evaluation: number;\n\treadonly inputEntries: number;\n\treadonly packedEntries: number;\n\treadonly omittedEntries: number;\n\treadonly totalChars: number;\n\treadonly totalCost: number;\n}\n\nexport interface AgenticMemoryContextPackingStatus {\n\treadonly state: AgenticMemoryStatusState;\n\treadonly cursor: AgenticMemoryContextPackingCursor;\n}\n\nexport type AgenticMemoryContextPackingErrorCode =\n\t| \"invalid-context\"\n\t| \"invalid-texts-input\"\n\t| \"invalid-text\"\n\t| \"duplicate-text-fragment-id\"\n\t| \"missing-text\"\n\t| \"invalid-policy\";\n\nexport interface AgenticMemoryContextPackingError {\n\treadonly code: AgenticMemoryContextPackingErrorCode;\n\treadonly message: string;\n\treadonly index?: number;\n\treadonly fragmentId?: FactId;\n\treadonly value?: unknown;\n\treadonly validationErrors?: readonly string[];\n\treadonly cursor: AgenticMemoryContextPackingCursor;\n}\n\nexport interface AgenticMemoryContextPackingSnapshot {\n\treadonly packedContext: AgenticMemoryPackedContext;\n\treadonly status: AgenticMemoryContextPackingStatus;\n\treadonly errors: readonly AgenticMemoryContextPackingError[];\n\treadonly cursor: AgenticMemoryContextPackingCursor;\n}\n\nexport interface AgenticMemoryContextPackingBundle<T = unknown> {\n\treadonly input: {\n\t\treadonly context: Node<AgenticMemoryContext<T>>;\n\t\treadonly texts: Node<readonly AgenticMemoryContextText[]>;\n\t\treadonly policy: Node<AgenticMemoryContextPackingPolicy>;\n\t};\n\treadonly projection: Node<AgenticMemoryContextPackingSnapshot>;\n\treadonly packedContext: Node<AgenticMemoryPackedContext>;\n\treadonly status: Node<AgenticMemoryContextPackingStatus>;\n\treadonly errors: Node<readonly AgenticMemoryContextPackingError[]>;\n\treadonly cursor: Node<AgenticMemoryContextPackingCursor>;\n}\n\nexport interface AgenticMemoryContextPackingBundleOptions<T = unknown> {\n\treadonly name?: string;\n\treadonly context: Node<AgenticMemoryContext<T>>;\n\treadonly texts: Node<readonly AgenticMemoryContextText[]>;\n\treadonly policy: Node<AgenticMemoryContextPackingPolicy>;\n}\n\ninterface ValidatedPackingContext {\n\treadonly entries: readonly AgenticMemoryContextEntry[];\n}\n\nexport interface AgenticMemoryBundle<T = unknown> {\n\treadonly input: {\n\t\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\t\treadonly query: Node<MemoryRetrievalQuery>;\n\t};\n\treadonly projection: Node<AgenticMemoryProjectionSnapshot<T>>;\n\treadonly retrieval: MemoryRetrievalBundle<T>;\n\treadonly retrievalSnapshot: Node<MemoryRetrievalSnapshot<T>>;\n\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\treadonly fragments: Node<readonly MemoryFragment<T>[]>;\n\treadonly sources: Node<readonly AgenticMemorySourceProjection[]>;\n\treadonly indexed: Node<MemoryRetrievalIndex<T>>;\n\treadonly ranked: Node<MemoryAnswer<T>>;\n\treadonly context: Node<AgenticMemoryContext<T>>;\n\treadonly status: Node<AgenticMemoryStatus>;\n\treadonly errors: Node<readonly AgenticMemoryError[]>;\n\treadonly retrievalStatus: Node<MemoryRetrievalStatus>;\n\treadonly retrievalErrors: Node<readonly MemoryRetrievalError[]>;\n\treadonly cursor: Node<MemoryRetrievalCursor>;\n}\n\nexport interface AgenticMemoryBundleOptions<T = unknown> {\n\treadonly name?: string;\n\t/** Explicit record-envelope input. Persistence, if needed, composes D161 outside this bundle. */\n\treadonly records: Node<readonly AgenticMemoryRecord<T>[]>;\n\t/** Explicit retrieval query input. */\n\treadonly query: Node<MemoryRetrievalQuery>;\n}\n\n/**\n * Compose graph-visible semantic-memory retrieval into an agentic-memory v0 bundle.\n *\n * The returned nodes are ordinary graph nodes with declared deps and DATA facts.\n * Invalid record envelopes and duplicate record ids stay graph-visible through\n * solution-level status/errors DATA facts. The lower retrieval bundle remains\n * visible and receives only projected MemoryFragment values.\n */\nexport function agenticMemoryBundle<T = unknown>(\n\tgraph: Graph,\n\topts: AgenticMemoryBundleOptions<T>,\n): AgenticMemoryBundle<T> {\n\tconst name = opts.name ?? \"agenticMemory\";\n\tconst projection = agenticMemoryRecordProjection<T>(graph, opts.records, `${name}/projection`);\n\tconst projectedRecords = agenticMemoryProjection(\n\t\tgraph,\n\t\tprojection,\n\t\t`${name}/records`,\n\t\t\"agenticMemoryRecords\",\n\t\t(fact) => fact.records,\n\t);\n\tconst projectedFragments = agenticMemoryProjection(\n\t\tgraph,\n\t\tprojection,\n\t\t`${name}/fragments`,\n\t\t\"agenticMemoryFragments\",\n\t\t(fact) => fact.fragments,\n\t);\n\tconst status = agenticMemoryProjection(\n\t\tgraph,\n\t\tprojection,\n\t\t`${name}/status`,\n\t\t\"agenticMemoryStatus\",\n\t\t(fact) => fact.status,\n\t);\n\tconst errors = agenticMemoryProjection(\n\t\tgraph,\n\t\tprojection,\n\t\t`${name}/errors`,\n\t\t\"agenticMemoryErrors\",\n\t\t(fact) => fact.errors,\n\t);\n\tconst retrieval = memoryRetrievalBundle<T>(graph, {\n\t\tname: `${name}/retrieval`,\n\t\tfragments: projectedFragments,\n\t\tquery: opts.query,\n\t});\n\tconst sources = agenticMemoryProjection(\n\t\tgraph,\n\t\tprojection,\n\t\t`${name}/sources`,\n\t\t\"agenticMemorySources\",\n\t\t(fact) =>\n\t\t\tObject.freeze(\n\t\t\t\tfact.fragments.map((fragment) =>\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\tfragmentId: fragment.id,\n\t\t\t\t\t\t...(fact.metadataByFragmentId[fragment.id] === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { record: fact.metadataByFragmentId[fragment.id] }),\n\t\t\t\t\t\tsources: Object.freeze([...fragment.sources]),\n\t\t\t\t\t\t...(fragment.parentFragmentId === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { parentFragmentId: fragment.parentFragmentId }),\n\t\t\t\t\t\t...(fragment.provenance === undefined ? {} : { provenance: fragment.provenance }),\n\t\t\t\t\t}),\n\t\t\t\t),\n\t\t\t),\n\t);\n\tconst context = agenticMemoryContextProjection(\n\t\tgraph,\n\t\tprojection,\n\t\tretrieval.snapshot,\n\t\t`${name}/context`,\n\t);\n\n\treturn {\n\t\tinput: { records: opts.records, query: opts.query },\n\t\tprojection,\n\t\tretrieval,\n\t\tretrievalSnapshot: retrieval.snapshot,\n\t\trecords: projectedRecords,\n\t\tfragments: projectedFragments,\n\t\tsources,\n\t\tindexed: retrieval.indexed,\n\t\tranked: retrieval.ranked,\n\t\tcontext,\n\t\tstatus,\n\t\terrors,\n\t\tretrievalStatus: retrieval.status,\n\t\tretrievalErrors: retrieval.errors,\n\t\tcursor: retrieval.cursor,\n\t};\n}\n\n/**\n * D165 solution-level KG assertion projection.\n *\n * Records and explicit assertion drafts stay visible as declared deps. This\n * bundle validates references and shape, then emits DATA facts only; it does\n * not extract assertions, call LLMs, read/write storage, or mutate topology.\n */\nexport function agenticMemoryKgProjectionBundle(\n\tgraph: Graph,\n\topts: AgenticMemoryKgProjectionBundleOptions,\n): AgenticMemoryKgProjectionBundle {\n\tconst name = opts.name ?? \"agenticMemoryKgProjection\";\n\tconst projection = graph.node<AgenticMemoryKgProjectionSnapshot>(\n\t\t[opts.records, opts.drafts],\n\t\t(ctx) => {\n\t\t\tconst state =\n\t\t\t\tctx.state.get<{ evaluation: number }>() ??\n\t\t\t\t({ evaluation: 0 } satisfies { evaluation: number });\n\t\t\tstate.evaluation += 1;\n\t\t\tconst recordProjection = validateAndProjectRecords(depLatest(ctx, 0));\n\t\t\tconst draftProjection = validateAndProjectKgDrafts(\n\t\t\t\tdepLatest(ctx, 1),\n\t\t\t\trecordProjection.records,\n\t\t\t);\n\t\t\tconst cursor: AgenticMemoryKgProjectionCursor = Object.freeze({\n\t\t\t\tevaluation: state.evaluation,\n\t\t\t\tvalidRecords: recordProjection.records.length,\n\t\t\t\tvalidDrafts: draftProjection.assertions.length,\n\t\t\t\tinvalidDrafts: draftProjection.invalidDrafts,\n\t\t\t\tprojectedAssertions: draftProjection.assertions.length,\n\t\t\t});\n\t\t\tconst errors = Object.freeze(\n\t\t\t\t[...recordProjection.errors.map(kgErrorFromRecordError), ...draftProjection.errors].map(\n\t\t\t\t\t(error) => freezeError({ ...error, cursor }),\n\t\t\t\t),\n\t\t\t);\n\t\t\tconst status: AgenticMemoryKgProjectionStatus = Object.freeze({\n\t\t\t\tstate: agenticStatusState(errors.length, draftProjection.assertions.length),\n\t\t\t\tcursor,\n\t\t\t});\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\tassertions: Object.freeze(draftProjection.assertions),\n\t\t\t\t\t\tstatus,\n\t\t\t\t\t\terrors,\n\t\t\t\t\t\tcursor,\n\t\t\t\t\t}),\n\t\t\t\t],\n\t\t\t]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/projection`,\n\t\t\tfactory: \"agenticMemoryKgProjection\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\treturn {\n\t\tinput: { records: opts.records, drafts: opts.drafts },\n\t\tprojection,\n\t\tassertions: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/assertions`,\n\t\t\t\"agenticMemoryKgAssertions\",\n\t\t\t(fact) => fact.assertions,\n\t\t),\n\t\tstatus: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/status`,\n\t\t\t\"agenticMemoryKgStatus\",\n\t\t\t(fact) => fact.status,\n\t\t),\n\t\terrors: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/errors`,\n\t\t\t\"agenticMemoryKgErrors\",\n\t\t\t(fact) => fact.errors,\n\t\t),\n\t\tcursor: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/cursor`,\n\t\t\t\"agenticMemoryKgCursor\",\n\t\t\t(fact) => fact.cursor,\n\t\t),\n\t};\n}\n\n/** Build a D166 strict-JSON frame from an in-memory AgenticMemoryRecord. */\nexport function agenticMemoryRecordFrame<TJson extends StrictJsonValue>(\n\trecord: AgenticMemoryRecord<TJson>,\n): AgenticMemoryRecordFrame<TJson> {\n\tconst result = validateAndSnapshotRecord<TJson>(record, 0);\n\tif (result.errors.length > 0 || result.record === undefined) {\n\t\tthrow new TypeError(\n\t\t\t`agenticMemoryRecordFrame: invalid record: ${result.errors\n\t\t\t\t.flatMap((error) => error.validationErrors ?? [error.message])\n\t\t\t\t.join(\"; \")}`,\n\t\t);\n\t}\n\tassertAgenticMemoryRecordCodecShape(record);\n\tassertStrictJsonValue(result.record.fragment.payload, \"record.fragment.payload\");\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_FRAME_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_FRAME_VERSION,\n\t\trecord: Object.freeze({\n\t\t\tid: result.record.id,\n\t\t\tkind: result.record.kind,\n\t\t\tpersistenceLevel: result.record.persistenceLevel,\n\t\t\tartifactKind: result.record.artifactKind,\n\t\t\t...(result.record.scope === undefined ? {} : { scope: result.record.scope }),\n\t\t\tfragment: fragmentFrame(result.record.fragment as MemoryFragment<TJson>),\n\t\t}),\n\t});\n}\n\n/** Assert and snapshot a decoded D166 record frame. Unknown fields fail honestly. */\nexport function assertAgenticMemoryRecordFrame<TJson extends StrictJsonValue = StrictJsonValue>(\n\tvalue: unknown,\n): AgenticMemoryRecordFrame<TJson> {\n\tif (!isPlainRecord(value))\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: frame must be an object\");\n\tassertStrictJsonValue(value, \"agenticMemoryRecordFrame\");\n\tassertExactKeys(value, [\"format\", \"record\", \"version\"], \"agenticMemoryRecordFrame\");\n\tif (value.format !== AGENTIC_MEMORY_RECORD_FRAME_FORMAT) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid version\");\n\t}\n\tconst rawRecord = value.record;\n\tif (!isPlainRecord(rawRecord)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: record must be an object\");\n\t}\n\tassertExactKeys(\n\t\trawRecord,\n\t\trawRecord.scope === undefined\n\t\t\t? [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\"]\n\t\t\t: [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\", \"scope\"],\n\t\t\"agenticMemoryRecordFrame.record\",\n\t);\n\tconst rawFragment = rawRecord.fragment;\n\tif (!isPlainRecord(rawFragment)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: fragment must be an object\");\n\t}\n\tassertExactKeys(\n\t\trawFragment,\n\t\t[\n\t\t\t\"id\",\n\t\t\t\"payload\",\n\t\t\t\"tNs\",\n\t\t\t...(rawFragment.validFrom === undefined ? [] : [\"validFrom\"]),\n\t\t\t...(rawFragment.validTo === undefined ? [] : [\"validTo\"]),\n\t\t\t\"confidence\",\n\t\t\t\"tags\",\n\t\t\t\"sources\",\n\t\t\t...(rawFragment.embedding === undefined ? [] : [\"embedding\"]),\n\t\t\t...(rawFragment.parentFragmentId === undefined ? [] : [\"parentFragmentId\"]),\n\t\t\t...(rawFragment.provenance === undefined ? [] : [\"provenance\"]),\n\t\t],\n\t\t\"agenticMemoryRecordFrame.record.fragment\",\n\t);\n\tif (rawRecord.scope !== undefined) assertScopeFrame(rawRecord.scope);\n\tconst frame = value as unknown as AgenticMemoryRecordFrame<TJson>;\n\tconst decoded = recordFromFrame(frame);\n\tconst roundtrip = agenticMemoryRecordFrame(decoded);\n\treturn roundtrip as AgenticMemoryRecordFrame<TJson>;\n}\n\n/** Strict canonical JSON codec for D166 AgenticMemoryRecordFrame values. */\nexport function agenticMemoryRecordFrameCodec<\n\tTJson extends StrictJsonValue = StrictJsonValue,\n>(): Codec<AgenticMemoryRecordFrame<TJson>> {\n\treturn {\n\t\tencode(value: AgenticMemoryRecordFrame<TJson>): Uint8Array {\n\t\t\treturn strictJsonCodec.encode(assertAgenticMemoryRecordFrame<TJson>(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): AgenticMemoryRecordFrame<TJson> {\n\t\t\treturn assertAgenticMemoryRecordFrame<TJson>(strictJsonCodec.decode(bytes));\n\t\t},\n\t};\n}\n\n/** Strict canonical JSON codec that persists records and decodes bigint fields back to bigint. */\nexport function agenticMemoryRecordCodec<TJson extends StrictJsonValue = StrictJsonValue>(): Codec<\n\tAgenticMemoryRecord<TJson>\n> {\n\tconst frameCodec = agenticMemoryRecordFrameCodec<TJson>();\n\treturn {\n\t\tencode(value: AgenticMemoryRecord<TJson>): Uint8Array {\n\t\t\treturn frameCodec.encode(agenticMemoryRecordFrame(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): AgenticMemoryRecord<TJson> {\n\t\t\treturn recordFromFrame(frameCodec.decode(bytes));\n\t\t},\n\t};\n}\n\n/**\n * D167 solution-level retention command projection.\n *\n * Archive/restore/setPersistenceLevel are derived views over current records;\n * requestConsolidation emits request facts only.\n */\nexport function agenticMemoryRetentionBundle<T = unknown>(\n\tgraph: Graph,\n\topts: AgenticMemoryRetentionBundleOptions<T>,\n): AgenticMemoryRetentionBundle<T> {\n\tconst name = opts.name ?? \"agenticMemoryRetention\";\n\tconst projection = graph.node<AgenticMemoryRetentionSnapshot<T>>(\n\t\t[opts.records, opts.commands],\n\t\t(ctx) => {\n\t\t\tconst state =\n\t\t\t\tctx.state.get<{ evaluation: number }>() ??\n\t\t\t\t({ evaluation: 0 } satisfies { evaluation: number });\n\t\t\tstate.evaluation += 1;\n\t\t\tconst recordProjection = validateAndProjectRecords<T>(depLatest(ctx, 0));\n\t\t\tconst retention = projectRetention<T>(depLatest(ctx, 1), recordProjection.records);\n\t\t\tconst cursor: AgenticMemoryRetentionCursor = Object.freeze({\n\t\t\t\tevaluation: state.evaluation,\n\t\t\t\tvalidRecords: recordProjection.records.length,\n\t\t\t\tvalidCommands: retention.validCommands,\n\t\t\t\tinvalidCommands: retention.invalidCommands,\n\t\t\t\tactiveRecords: retention.activeRecords.length,\n\t\t\t\tarchivedRecords: retention.archivedRecords.length,\n\t\t\t\tconsolidationRequests: retention.consolidationRequests.length,\n\t\t\t});\n\t\t\tconst errors = Object.freeze(\n\t\t\t\t[...recordProjection.errors.map(retentionErrorFromRecordError), ...retention.errors].map(\n\t\t\t\t\t(error) => freezeError({ ...error, cursor }),\n\t\t\t\t),\n\t\t\t);\n\t\t\tconst status: AgenticMemoryRetentionStatus = Object.freeze({\n\t\t\t\tstate: agenticStatusState(errors.length, recordProjection.records.length),\n\t\t\t\tcursor,\n\t\t\t});\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\tactiveRecords: Object.freeze(retention.activeRecords),\n\t\t\t\t\t\tarchivedRecords: Object.freeze(retention.archivedRecords),\n\t\t\t\t\t\tconsolidationRequests: Object.freeze(retention.consolidationRequests),\n\t\t\t\t\t\tstatus,\n\t\t\t\t\t\terrors,\n\t\t\t\t\t\tcursor,\n\t\t\t\t\t}),\n\t\t\t\t],\n\t\t\t]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/projection`,\n\t\t\tfactory: \"agenticMemoryRetention\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\treturn {\n\t\tinput: { records: opts.records, commands: opts.commands },\n\t\tprojection,\n\t\tactiveRecords: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/activeRecords`,\n\t\t\t\"agenticMemoryRetentionActiveRecords\",\n\t\t\t(fact) => fact.activeRecords,\n\t\t),\n\t\tarchivedRecords: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/archivedRecords`,\n\t\t\t\"agenticMemoryRetentionArchivedRecords\",\n\t\t\t(fact) => fact.archivedRecords,\n\t\t),\n\t\tconsolidationRequests: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/consolidationRequests`,\n\t\t\t\"agenticMemoryRetentionConsolidationRequests\",\n\t\t\t(fact) => fact.consolidationRequests,\n\t\t),\n\t\tstatus: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/status`,\n\t\t\t\"agenticMemoryRetentionStatus\",\n\t\t\t(fact) => fact.status,\n\t\t),\n\t\terrors: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/errors`,\n\t\t\t\"agenticMemoryRetentionErrors\",\n\t\t\t(fact) => fact.errors,\n\t\t),\n\t\tcursor: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/cursor`,\n\t\t\t\"agenticMemoryRetentionCursor\",\n\t\t\t(fact) => fact.cursor,\n\t\t),\n\t};\n}\n\n/**\n * D171 consolidation outcome projection.\n *\n * The bundle does not execute consolidation. External adapters may publish\n * outcome facts, and this projection turns them into visible result/proposal\n * facts for downstream record-creation policy.\n */\nexport function agenticMemoryConsolidationBundle<T = unknown>(\n\tgraph: Graph,\n\topts: AgenticMemoryConsolidationBundleOptions<T>,\n): AgenticMemoryConsolidationBundle<T> {\n\tconst name = opts.name ?? \"agenticMemoryConsolidation\";\n\tconst projection = graph.node<AgenticMemoryConsolidationSnapshot<T>>(\n\t\t[opts.records, opts.requests, opts.outcomes],\n\t\t(ctx) => {\n\t\t\tconst state =\n\t\t\t\tctx.state.get<{ evaluation: number }>() ??\n\t\t\t\t({ evaluation: 0 } satisfies { evaluation: number });\n\t\t\tstate.evaluation += 1;\n\t\t\tconst recordProjection = validateAndProjectRecords<T>(depLatest(ctx, 0));\n\t\t\tconst requests = validateConsolidationRequests(depLatest(ctx, 1), recordProjection.records);\n\t\t\tconst outcomes = projectConsolidationOutcomes<T>(\n\t\t\t\tdepLatest(ctx, 2),\n\t\t\t\trequests.requests,\n\t\t\t\tstate.evaluation,\n\t\t\t);\n\t\t\tconst cursor: AgenticMemoryConsolidationCursor = Object.freeze({\n\t\t\t\tevaluation: state.evaluation,\n\t\t\t\tvalidRequests: requests.requests.length,\n\t\t\t\tvalidOutcomes: outcomes.validOutcomes,\n\t\t\t\tinvalidOutcomes: outcomes.invalidOutcomes,\n\t\t\t\tresults: outcomes.results.length,\n\t\t\t\tproposedRecordDrafts: outcomes.proposedRecordDrafts.length,\n\t\t\t});\n\t\t\tconst errors = Object.freeze(\n\t\t\t\t[\n\t\t\t\t\t...recordProjection.errors.map(consolidationErrorFromRecordError),\n\t\t\t\t\t...requests.errors.map(consolidationErrorFromRetentionError),\n\t\t\t\t\t...outcomes.errors,\n\t\t\t\t].map((error) => freezeError({ ...error, cursor })),\n\t\t\t);\n\t\t\tconst status: AgenticMemoryConsolidationStatus = Object.freeze({\n\t\t\t\tstate: agenticStatusState(errors.length, outcomes.results.length),\n\t\t\t\tcursor,\n\t\t\t});\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\tresults: Object.freeze(outcomes.results),\n\t\t\t\t\t\tproposedRecordDrafts: Object.freeze(outcomes.proposedRecordDrafts),\n\t\t\t\t\t\tcommands: Object.freeze(outcomes.commands),\n\t\t\t\t\t\tstatus,\n\t\t\t\t\t\terrors,\n\t\t\t\t\t\tcursor,\n\t\t\t\t\t}),\n\t\t\t\t],\n\t\t\t]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/projection`,\n\t\t\tfactory: \"agenticMemoryConsolidation\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\treturn {\n\t\tinput: { records: opts.records, requests: opts.requests, outcomes: opts.outcomes },\n\t\tprojection,\n\t\tresults: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/results`,\n\t\t\t\"agenticMemoryConsolidationResults\",\n\t\t\t(fact) => fact.results,\n\t\t),\n\t\tproposedRecordDrafts: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/proposedRecordDrafts`,\n\t\t\t\"agenticMemoryConsolidationRecordDrafts\",\n\t\t\t(fact) => fact.proposedRecordDrafts,\n\t\t),\n\t\tcommands: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/commands`,\n\t\t\t\"agenticMemoryConsolidationCommands\",\n\t\t\t(fact) => fact.commands,\n\t\t),\n\t\tstatus: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/status`,\n\t\t\t\"agenticMemoryConsolidationStatus\",\n\t\t\t(fact) => fact.status,\n\t\t),\n\t\terrors: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/errors`,\n\t\t\t\"agenticMemoryConsolidationErrors\",\n\t\t\t(fact) => fact.errors,\n\t\t),\n\t\tcursor: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/cursor`,\n\t\t\t\"agenticMemoryConsolidationCursor\",\n\t\t\t(fact) => fact.cursor,\n\t\t),\n\t};\n}\n\n/** D168 deterministic context-packing bundle over explicit context text facts. */\nexport function agenticMemoryContextPackingBundle<T = unknown>(\n\tgraph: Graph,\n\topts: AgenticMemoryContextPackingBundleOptions<T>,\n): AgenticMemoryContextPackingBundle<T> {\n\tconst name = opts.name ?? \"agenticMemoryContextPacking\";\n\tconst projection = graph.node<AgenticMemoryContextPackingSnapshot>(\n\t\t[opts.context, opts.texts, opts.policy],\n\t\t(ctx) => {\n\t\t\tconst state =\n\t\t\t\tctx.state.get<{ evaluation: number }>() ??\n\t\t\t\t({ evaluation: 0 } satisfies { evaluation: number });\n\t\t\tstate.evaluation += 1;\n\t\t\tconst packed = packContext(\n\t\t\t\tdepLatest(ctx, 0),\n\t\t\t\tdepLatest(ctx, 1),\n\t\t\t\tdepLatest(ctx, 2),\n\t\t\t\tstate.evaluation,\n\t\t\t);\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([[\"DATA\", packed]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/projection`,\n\t\t\tfactory: \"agenticMemoryContextPacking\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\treturn {\n\t\tinput: { context: opts.context, texts: opts.texts, policy: opts.policy },\n\t\tprojection,\n\t\tpackedContext: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/packedContext`,\n\t\t\t\"agenticMemoryPackedContext\",\n\t\t\t(fact) => fact.packedContext,\n\t\t),\n\t\tstatus: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/status`,\n\t\t\t\"agenticMemoryContextPackingStatus\",\n\t\t\t(fact) => fact.status,\n\t\t),\n\t\terrors: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/errors`,\n\t\t\t\"agenticMemoryContextPackingErrors\",\n\t\t\t(fact) => fact.errors,\n\t\t),\n\t\tcursor: solutionProjection(\n\t\t\tgraph,\n\t\t\tprojection,\n\t\t\t`${name}/cursor`,\n\t\t\t\"agenticMemoryContextPackingCursor\",\n\t\t\t(fact) => fact.cursor,\n\t\t),\n\t};\n}\n\nfunction solutionProjection<TFact, TSnapshot>(\n\tgraph: Graph,\n\tsnapshot: Node<TSnapshot>,\n\tname: string,\n\tfactory: string,\n\tselect: (fact: TSnapshot) => TFact,\n): Node<TFact> {\n\treturn graph.node<TFact>(\n\t\t[snapshot],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", select(raw as TSnapshot)]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname,\n\t\t\tfactory,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction agenticMemoryProjection<TFact, T>(\n\tgraph: Graph,\n\tsnapshot: Node<AgenticMemoryProjectionSnapshot<T>>,\n\tname: string,\n\tfactory: string,\n\tselect: (fact: AgenticMemoryProjectionSnapshot<T>) => TFact,\n): Node<TFact> {\n\treturn graph.node<TFact>(\n\t\t[snapshot],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", select(raw as AgenticMemoryProjectionSnapshot<T>)]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname,\n\t\t\tfactory,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction agenticMemoryContextProjection<T>(\n\tgraph: Graph,\n\tprojection: Node<AgenticMemoryProjectionSnapshot<T>>,\n\tretrieval: Node<MemoryRetrievalSnapshot<T>>,\n\tname: string,\n): Node<AgenticMemoryContext<T>> {\n\treturn graph.node<AgenticMemoryContext<T>>(\n\t\t[projection, retrieval],\n\t\t(ctx) => {\n\t\t\tconst projectionFact = depLatest(ctx, 0) as AgenticMemoryProjectionSnapshot<T> | undefined;\n\t\t\tconst retrievalFacts = depBatch(ctx, 1) ?? [];\n\t\t\tif (projectionFact === undefined || retrievalFacts.length === 0) return;\n\t\t\tfor (const raw of retrievalFacts) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", contextFromSnapshot(projectionFact, raw as MemoryRetrievalSnapshot<T>)],\n\t\t\t\t]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname,\n\t\t\tfactory: \"agenticMemoryContext\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction contextFromSnapshot<T>(\n\tprojection: AgenticMemoryProjectionSnapshot<T>,\n\tretrieval: MemoryRetrievalSnapshot<T>,\n): AgenticMemoryContext<T> {\n\tconst entries = retrieval.ranked.results.map((fragment) =>\n\t\tObject.freeze({\n\t\t\tfragmentId: fragment.id,\n\t\t\tpayload: fragment.payload,\n\t\t\tconfidence: fragment.confidence,\n\t\t\ttags: fragment.tags,\n\t\t\tsources: fragment.sources,\n\t\t\t...(projection.metadataByFragmentId[fragment.id] === undefined\n\t\t\t\t? {}\n\t\t\t\t: { record: projection.metadataByFragmentId[fragment.id] }),\n\t\t\tfragment,\n\t\t}),\n\t);\n\tconst hasContext = entries.length > 0;\n\tconst state = contextState(projection.status.state, retrieval.status.state);\n\treturn Object.freeze({\n\t\tstate,\n\t\tquery: retrieval.ranked.query,\n\t\tentries: Object.freeze(entries),\n\t\tcursor: retrieval.cursor,\n\t\terrors: projection.errors,\n\t\tretrievalErrors: retrieval.errors,\n\t\tcontextReady: hasContext && (state === \"ready\" || state === \"partial\"),\n\t});\n}\n\nfunction agenticMemoryRecordProjection<T>(\n\tgraph: Graph,\n\trecords: Node<readonly AgenticMemoryRecord<T>[]>,\n\tname: string,\n): Node<AgenticMemoryProjectionSnapshot<T>> {\n\treturn graph.node<AgenticMemoryProjectionSnapshot<T>>(\n\t\t[records],\n\t\t(ctx) => {\n\t\t\tconst state =\n\t\t\t\tctx.state.get<{ evaluation: number }>() ??\n\t\t\t\t({ evaluation: 0 } satisfies { evaluation: number });\n\t\t\tstate.evaluation += 1;\n\t\t\tconst rawRecords = (depBatch(ctx, 0) ?? []).at(-1);\n\t\t\tconst projected = validateAndProjectRecords<T>(rawRecords);\n\t\t\tconst cursor: AgenticMemoryProjectionCursor = Object.freeze({\n\t\t\t\tevaluation: state.evaluation,\n\t\t\t\tvalidRecords: projected.records.length,\n\t\t\t\tinvalidRecords: projected.invalidRecordIndexes.size,\n\t\t\t\tprojectedFragments: projected.fragments.length,\n\t\t\t});\n\t\t\tconst status: AgenticMemoryStatus = Object.freeze({\n\t\t\t\tstate: agenticStatusState(projected.errors.length, projected.records.length),\n\t\t\t\tcursor,\n\t\t\t});\n\t\t\tconst errors = Object.freeze(\n\t\t\t\tprojected.errors.map((error) =>\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\t...error,\n\t\t\t\t\t\t...(error.validationErrors === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { validationErrors: Object.freeze([...error.validationErrors]) }),\n\t\t\t\t\t\tcursor,\n\t\t\t\t\t}),\n\t\t\t\t),\n\t\t\t);\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\tObject.freeze({\n\t\t\t\t\t\trecords: Object.freeze(projected.records),\n\t\t\t\t\t\tfragments: Object.freeze(projected.fragments),\n\t\t\t\t\t\tmetadataByFragmentId: Object.freeze(projected.metadataByFragmentId),\n\t\t\t\t\t\tstatus,\n\t\t\t\t\t\terrors,\n\t\t\t\t\t\tcursor,\n\t\t\t\t\t}),\n\t\t\t\t],\n\t\t\t]);\n\t\t},\n\t\t{\n\t\t\tname,\n\t\t\tfactory: \"agenticMemoryProjection\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction validateAndProjectKgDrafts(\n\tvalue: unknown,\n\trecords: readonly AgenticMemoryRecord[],\n): {\n\treadonly assertions: KnowledgeAssertion[];\n\treadonly errors: Omit<AgenticMemoryKgProjectionError, \"cursor\">[];\n\treadonly invalidDrafts: number;\n} {\n\tconst assertions: KnowledgeAssertion[] = [];\n\tconst errors: Omit<AgenticMemoryKgProjectionError, \"cursor\">[] = [];\n\tlet invalidDrafts = 0;\n\tif (!Array.isArray(value)) {\n\t\treturn {\n\t\t\tassertions,\n\t\t\tinvalidDrafts: 1,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-drafts-input\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: drafts input must be an array\",\n\t\t\t\t\tdraft: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\treturn {\n\t\t\tassertions,\n\t\t\tinvalidDrafts: 1,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-drafts-input\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: drafts input length could not be read\",\n\t\t\t\t\tdraft: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst recordById = new Map(records.map((record) => [record.id, record]));\n\tconst fragmentToRecord = new Map(records.map((record) => [record.fragment.id, record.id]));\n\tconst seenAssertions = new Set<FactId>();\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\ttry {\n\t\t\traw = value[i];\n\t\t\tconst result = validateKgDraft(raw, i);\n\t\t\tif (result.errors.length > 0 || result.draft === undefined) {\n\t\t\t\tinvalidDrafts += 1;\n\t\t\t\terrors.push(...result.errors);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst draft = result.draft;\n\t\t\tif (seenAssertions.has(draft.id)) {\n\t\t\t\tinvalidDrafts += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"duplicate-assertion-id\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: duplicate assertion id\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tassertionId: draft.id,\n\t\t\t\t\trecordId: draft.recordId,\n\t\t\t\t\tfragmentId: draft.fragmentId,\n\t\t\t\t\tdraft: raw,\n\t\t\t\t\tvalidationErrors: [`duplicate assertion id '${draft.id}'`],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst record = recordById.get(draft.recordId);\n\t\t\tif (record === undefined) {\n\t\t\t\tinvalidDrafts += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"missing-record-ref\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: draft references a missing record\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tassertionId: draft.id,\n\t\t\t\t\trecordId: draft.recordId,\n\t\t\t\t\tfragmentId: draft.fragmentId,\n\t\t\t\t\tdraft: raw,\n\t\t\t\t\tvalidationErrors: [`record '${draft.recordId}' is not projected`],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst owner = fragmentToRecord.get(draft.fragmentId);\n\t\t\tif (owner === undefined) {\n\t\t\t\tinvalidDrafts += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"missing-fragment-ref\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: draft references a missing fragment\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tassertionId: draft.id,\n\t\t\t\t\trecordId: draft.recordId,\n\t\t\t\t\tfragmentId: draft.fragmentId,\n\t\t\t\t\tdraft: raw,\n\t\t\t\t\tvalidationErrors: [`fragment '${draft.fragmentId}' is not projected`],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (owner !== draft.recordId || record.fragment.id !== draft.fragmentId) {\n\t\t\t\tinvalidDrafts += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"fragment-record-mismatch\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: draft record and fragment refs disagree\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tassertionId: draft.id,\n\t\t\t\t\trecordId: draft.recordId,\n\t\t\t\t\tfragmentId: draft.fragmentId,\n\t\t\t\t\tdraft: raw,\n\t\t\t\t\tvalidationErrors: [\n\t\t\t\t\t\t`fragment '${draft.fragmentId}' belongs to record '${owner}', not '${draft.recordId}'`,\n\t\t\t\t\t],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tseenAssertions.add(draft.id);\n\t\t\tassertions.push(\n\t\t\t\tObject.freeze({\n\t\t\t\t\tid: draft.id,\n\t\t\t\t\trecordId: draft.recordId,\n\t\t\t\t\tfragmentId: draft.fragmentId,\n\t\t\t\t\tsubject: draft.subject,\n\t\t\t\t\tpredicate: draft.predicate,\n\t\t\t\t\tobject: draft.object,\n\t\t\t\t\t...(draft.confidence === undefined ? {} : { confidence: draft.confidence }),\n\t\t\t\t\tsources: Object.freeze(draft.sources ?? [draft.fragmentId]),\n\t\t\t\t\t...(draft.provenance === undefined ? {} : { provenance: draft.provenance }),\n\t\t\t\t}),\n\t\t\t);\n\t\t} catch (error) {\n\t\t\tinvalidDrafts += 1;\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-draft\",\n\t\t\t\tmessage: `agenticMemoryKgProjectionBundle: draft access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tdraft: raw,\n\t\t\t\tvalidationErrors: [\"draft access failed\"],\n\t\t\t});\n\t\t}\n\t}\n\treturn { assertions, errors, invalidDrafts };\n}\n\nfunction validateKgDraft(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly draft?: AgenticMemoryKgAssertionDraft;\n\treadonly errors: Omit<AgenticMemoryKgProjectionError, \"cursor\">[];\n} {\n\tconst errors: Omit<AgenticMemoryKgProjectionError, \"cursor\">[] = [];\n\tif (!isPlainRecord(value)) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-draft\",\n\t\t\t\t\tmessage: \"agenticMemoryKgProjectionBundle: draft must be an object\",\n\t\t\t\t\tindex,\n\t\t\t\t\tdraft: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst raw = value as Partial<AgenticMemoryKgAssertionDraft>;\n\tconst id = typeof raw.id === \"string\" && raw.id.length > 0 ? raw.id : undefined;\n\tconst recordId =\n\t\ttypeof raw.recordId === \"string\" && raw.recordId.length > 0 ? raw.recordId : undefined;\n\tconst fragmentId =\n\t\ttypeof raw.fragmentId === \"string\" && raw.fragmentId.length > 0 ? raw.fragmentId : undefined;\n\tconst subject = validateAssertionSubject(raw.subject);\n\tconst object = validateAssertionObject(raw.object);\n\tconst shapeErrors: string[] = [];\n\tif (id === undefined) shapeErrors.push(\"draft.id must be a non-empty string\");\n\tif (recordId === undefined) {\n\t\tshapeErrors.push(\"draft.recordId must be a non-empty string\");\n\t}\n\tif (fragmentId === undefined) {\n\t\tshapeErrors.push(\"draft.fragmentId must be a non-empty string\");\n\t}\n\tshapeErrors.push(...subject.errors);\n\tif (typeof raw.predicate !== \"string\" || raw.predicate.length === 0) {\n\t\tshapeErrors.push(\"draft.predicate must be a non-empty string\");\n\t}\n\tshapeErrors.push(...object.errors);\n\tif (\n\t\traw.confidence !== undefined &&\n\t\t(!Number.isFinite(raw.confidence) || raw.confidence < 0 || raw.confidence > 1)\n\t) {\n\t\tshapeErrors.push(\"draft.confidence must be a finite number in [0, 1]\");\n\t}\n\tif (raw.sources !== undefined && !isDenseArrayOf(raw.sources, isNonEmptyString)) {\n\t\tshapeErrors.push(\"draft.sources must be a readonly string array\");\n\t}\n\tif (raw.provenance !== undefined && typeof raw.provenance !== \"string\") {\n\t\tshapeErrors.push(\"draft.provenance must be a string when present\");\n\t}\n\tif (shapeErrors.length > 0) errors.push(kgShapeError(index, value, ...shapeErrors));\n\tif (errors.length > 0 || id === undefined || recordId === undefined || fragmentId === undefined) {\n\t\treturn { errors };\n\t}\n\treturn {\n\t\tdraft: Object.freeze({\n\t\t\tid,\n\t\t\trecordId,\n\t\t\tfragmentId,\n\t\t\tsubject: subject.subject as KnowledgeAssertionSubject,\n\t\t\tpredicate: raw.predicate as string,\n\t\t\tobject: object.object as KnowledgeAssertionObject,\n\t\t\t...(raw.confidence === undefined ? {} : { confidence: raw.confidence }),\n\t\t\t...(raw.sources === undefined ? {} : { sources: Object.freeze([...raw.sources]) }),\n\t\t\t...(raw.provenance === undefined ? {} : { provenance: raw.provenance }),\n\t\t}),\n\t\terrors,\n\t};\n}\n\nfunction validateAssertionSubject(value: unknown): {\n\treadonly subject?: KnowledgeAssertionSubject;\n\treadonly errors: readonly string[];\n} {\n\tif (!isPlainRecord(value)) return { errors: [\"subject must be an object\"] };\n\tconst id = value.id;\n\tconst type = value.type;\n\tconst errors: string[] = [];\n\tif (typeof id !== \"string\" || id.length === 0) errors.push(\"subject.id must be non-empty\");\n\tif (type !== undefined && (typeof type !== \"string\" || type.length === 0)) {\n\t\terrors.push(\"subject.type must be a non-empty string when present\");\n\t}\n\tif (errors.length > 0) return { errors };\n\treturn {\n\t\tsubject: Object.freeze({\n\t\t\tid: id as string,\n\t\t\t...(type === undefined ? {} : { type: type as string }),\n\t\t}),\n\t\terrors,\n\t};\n}\n\nfunction validateAssertionObject(value: unknown): {\n\treadonly object?: KnowledgeAssertionObject;\n\treadonly errors: readonly string[];\n} {\n\tif (!isPlainRecord(value)) return { errors: [\"object must be an object\"] };\n\tconst kind = value.kind;\n\tconst errors: string[] = [];\n\tif (kind === \"entity\") {\n\t\tif (typeof value.id !== \"string\" || value.id.length === 0) {\n\t\t\terrors.push(\"object.id must be non-empty for entity objects\");\n\t\t}\n\t\tif (value.type !== undefined && (typeof value.type !== \"string\" || value.type.length === 0)) {\n\t\t\terrors.push(\"object.type must be a non-empty string when present\");\n\t\t}\n\t\tif (Object.hasOwn(value, \"value\")) errors.push(\"entity object must not include value\");\n\t\tif (errors.length > 0) return { errors };\n\t\treturn {\n\t\t\tobject: Object.freeze({\n\t\t\t\tkind: \"entity\",\n\t\t\t\tid: value.id as string,\n\t\t\t\t...(value.type === undefined ? {} : { type: value.type as string }),\n\t\t\t}),\n\t\t\terrors,\n\t\t};\n\t}\n\tif (kind === \"value\") {\n\t\tif (!Object.hasOwn(value, \"value\")) errors.push(\"value object must include value\");\n\t\telse {\n\t\t\ttry {\n\t\t\t\tassertStrictJsonValue(value.value, \"object.value\");\n\t\t\t} catch (error) {\n\t\t\t\terrors.push(errorMessage(error));\n\t\t\t}\n\t\t}\n\t\tif (\n\t\t\tvalue.valueType !== undefined &&\n\t\t\t(typeof value.valueType !== \"string\" || value.valueType.length === 0)\n\t\t) {\n\t\t\terrors.push(\"object.valueType must be a non-empty string when present\");\n\t\t}\n\t\tif (Object.hasOwn(value, \"id\")) errors.push(\"value object must not include id\");\n\t\tif (errors.length > 0) return { errors };\n\t\treturn {\n\t\t\tobject: Object.freeze({\n\t\t\t\tkind: \"value\",\n\t\t\t\tvalue: value.value as StrictJsonValue,\n\t\t\t\t...(value.valueType === undefined ? {} : { valueType: value.valueType as string }),\n\t\t\t}),\n\t\t\terrors,\n\t\t};\n\t}\n\treturn { errors: [\"object.kind must be entity or value\"] };\n}\n\nfunction kgShapeError(\n\tindex: number,\n\tdraft: unknown,\n\t...validationErrors: readonly string[]\n): Omit<AgenticMemoryKgProjectionError, \"cursor\"> {\n\treturn {\n\t\tcode: \"invalid-assertion-shape\",\n\t\tmessage: \"agenticMemoryKgProjectionBundle: draft assertion shape is invalid\",\n\t\tindex,\n\t\tdraft,\n\t\tvalidationErrors: Object.freeze([...validationErrors]),\n\t};\n}\n\nfunction kgErrorFromRecordError(\n\terror: Omit<AgenticMemoryError, \"cursor\">,\n): Omit<AgenticMemoryKgProjectionError, \"cursor\"> {\n\treturn {\n\t\t...error,\n\t\tcode: error.code,\n\t};\n}\n\nfunction fragmentFrame<TJson extends StrictJsonValue>(\n\tfragment: MemoryFragment<TJson>,\n): AgenticMemoryFragmentFrame<TJson> {\n\treturn Object.freeze({\n\t\tid: fragment.id,\n\t\tpayload: fragment.payload,\n\t\ttNs: decimalBigIntString(fragment.tNs, \"fragment.tNs\"),\n\t\t...(fragment.validFrom === undefined\n\t\t\t? {}\n\t\t\t: { validFrom: decimalBigIntString(fragment.validFrom, \"fragment.validFrom\") }),\n\t\t...(fragment.validTo === undefined\n\t\t\t? {}\n\t\t\t: { validTo: decimalBigIntString(fragment.validTo, \"fragment.validTo\") }),\n\t\tconfidence: fragment.confidence,\n\t\ttags: Object.freeze([...fragment.tags]),\n\t\tsources: Object.freeze([...fragment.sources]),\n\t\t...(fragment.embedding === undefined\n\t\t\t? {}\n\t\t\t: { embedding: Object.freeze([...fragment.embedding]) }),\n\t\t...(fragment.parentFragmentId === undefined\n\t\t\t? {}\n\t\t\t: { parentFragmentId: fragment.parentFragmentId }),\n\t\t...(fragment.provenance === undefined ? {} : { provenance: fragment.provenance }),\n\t});\n}\n\nfunction recordFromFrame<TJson extends StrictJsonValue>(\n\tframe: AgenticMemoryRecordFrame<TJson>,\n): AgenticMemoryRecord<TJson> {\n\tconst fragment = frame.record.fragment;\n\tconst record: AgenticMemoryRecord<TJson> = {\n\t\tid: assertNonEmptyString(frame.record.id, \"record.id\"),\n\t\tkind: assertKindValue(frame.record.kind),\n\t\tpersistenceLevel: assertPersistenceLevelValue(frame.record.persistenceLevel),\n\t\tartifactKind: assertArtifactKindValue(frame.record.artifactKind),\n\t\t...(frame.record.scope === undefined ? {} : { scope: assertScopeFrame(frame.record.scope) }),\n\t\tfragment: {\n\t\t\tid: assertNonEmptyString(fragment.id, \"fragment.id\"),\n\t\t\tpayload: assertStrictJsonValue(fragment.payload, \"fragment.payload\") as TJson,\n\t\t\ttNs: parseDecimalBigInt(fragment.tNs, \"fragment.tNs\"),\n\t\t\t...(fragment.validFrom === undefined\n\t\t\t\t? {}\n\t\t\t\t: { validFrom: parseDecimalBigInt(fragment.validFrom, \"fragment.validFrom\") }),\n\t\t\t...(fragment.validTo === undefined\n\t\t\t\t? {}\n\t\t\t\t: { validTo: parseDecimalBigInt(fragment.validTo, \"fragment.validTo\") }),\n\t\t\tconfidence: assertConfidence(fragment.confidence, \"fragment.confidence\"),\n\t\t\ttags: assertStringArray(fragment.tags, \"fragment.tags\"),\n\t\t\tsources: assertStringArray(fragment.sources, \"fragment.sources\"),\n\t\t\t...(fragment.embedding === undefined\n\t\t\t\t? {}\n\t\t\t\t: { embedding: assertFiniteNumberArray(fragment.embedding, \"fragment.embedding\") }),\n\t\t\t...(fragment.parentFragmentId === undefined\n\t\t\t\t? {}\n\t\t\t\t: {\n\t\t\t\t\t\tparentFragmentId: assertNonEmptyString(fragment.parentFragmentId, \"parentFragmentId\"),\n\t\t\t\t\t}),\n\t\t\t...(fragment.provenance === undefined\n\t\t\t\t? {}\n\t\t\t\t: { provenance: assertString(fragment.provenance, \"provenance\") }),\n\t\t},\n\t};\n\tconst result = validateAndSnapshotRecord<TJson>(record, 0);\n\tif (result.errors.length > 0 || result.record === undefined) {\n\t\tthrow new TypeError(\n\t\t\t`agenticMemoryRecordFrame: decoded record is invalid: ${result.errors\n\t\t\t\t.flatMap((error) => error.validationErrors ?? [error.message])\n\t\t\t\t.join(\"; \")}`,\n\t\t);\n\t}\n\treturn result.record;\n}\n\nfunction projectRetention<T>(\n\tvalue: unknown,\n\trecords: readonly AgenticMemoryRecord<T>[],\n): {\n\treadonly activeRecords: AgenticMemoryRecord<T>[];\n\treadonly archivedRecords: AgenticMemoryRecord<T>[];\n\treadonly consolidationRequests: AgenticMemoryConsolidationRequest[];\n\treadonly errors: Omit<AgenticMemoryRetentionError, \"cursor\">[];\n\treadonly validCommands: number;\n\treadonly invalidCommands: number;\n} {\n\tconst byId = new Map(records.map((record) => [record.id, record]));\n\tconst view = new Map(records.map((record) => [record.id, record]));\n\tconst requests: AgenticMemoryConsolidationRequest[] = [];\n\tconst errors: Omit<AgenticMemoryRetentionError, \"cursor\">[] = [];\n\tlet validCommands = 0;\n\tlet invalidCommands = 0;\n\tif (!Array.isArray(value)) {\n\t\treturn {\n\t\t\tactiveRecords: records.filter((record) => record.persistenceLevel !== \"archived\"),\n\t\t\tarchivedRecords: records.filter((record) => record.persistenceLevel === \"archived\"),\n\t\t\tconsolidationRequests: requests,\n\t\t\tvalidCommands,\n\t\t\tinvalidCommands: 1,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-commands-input\",\n\t\t\t\t\tmessage: \"agenticMemoryRetentionBundle: commands input must be an array\",\n\t\t\t\t\tcommand: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\treturn {\n\t\t\tactiveRecords: records.filter((record) => record.persistenceLevel !== \"archived\"),\n\t\t\tarchivedRecords: records.filter((record) => record.persistenceLevel === \"archived\"),\n\t\t\tconsolidationRequests: requests,\n\t\t\tvalidCommands,\n\t\t\tinvalidCommands: 1,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-commands-input\",\n\t\t\t\t\tmessage: \"agenticMemoryRetentionBundle: commands input length could not be read\",\n\t\t\t\t\tcommand: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst seenCommands = new Set<FactId>();\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\ttry {\n\t\t\traw = value[i];\n\t\t\tconst result = validateRetentionCommand(raw, i);\n\t\t\tif (result.errors.length > 0 || result.command === undefined) {\n\t\t\t\tinvalidCommands += 1;\n\t\t\t\terrors.push(...result.errors);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst command = result.command;\n\t\t\tif (seenCommands.has(command.id)) {\n\t\t\t\tinvalidCommands += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"duplicate-command-id\",\n\t\t\t\t\tmessage: \"agenticMemoryRetentionBundle: duplicate command id\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tcommandId: command.id,\n\t\t\t\t\tcommand: raw,\n\t\t\t\t\tvalidationErrors: [`duplicate command id '${command.id}'`],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst missing = retentionMissingRecords(command, byId);\n\t\t\tif (missing.length > 0) {\n\t\t\t\tinvalidCommands += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"missing-record-ref\",\n\t\t\t\t\tmessage: \"agenticMemoryRetentionBundle: command references missing records\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tcommandId: command.id,\n\t\t\t\t\trecordId: \"recordId\" in command ? command.recordId : undefined,\n\t\t\t\t\trecordIds: Object.freeze(missing),\n\t\t\t\t\tcommand: raw,\n\t\t\t\t\tvalidationErrors: Object.freeze(missing.map((id) => `record '${id}' is not projected`)),\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tseenCommands.add(command.id);\n\t\t\tvalidCommands += 1;\n\t\t\tapplyRetentionCommand(command, byId, view, requests);\n\t\t} catch (error) {\n\t\t\tinvalidCommands += 1;\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-command\",\n\t\t\t\tmessage: `agenticMemoryRetentionBundle: command access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tcommand: raw,\n\t\t\t\tvalidationErrors: [\"command access failed\"],\n\t\t\t});\n\t\t}\n\t}\n\tconst projected = records.map((record) => view.get(record.id) ?? record);\n\treturn {\n\t\tactiveRecords: projected.filter((record) => record.persistenceLevel !== \"archived\"),\n\t\tarchivedRecords: projected.filter((record) => record.persistenceLevel === \"archived\"),\n\t\tconsolidationRequests: requests,\n\t\terrors,\n\t\tvalidCommands,\n\t\tinvalidCommands,\n\t};\n}\n\nfunction validateRetentionCommand(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly command?: AgenticMemoryRetentionCommand;\n\treadonly errors: Omit<AgenticMemoryRetentionError, \"cursor\">[];\n} {\n\tif (!isPlainRecord(value)) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-command\",\n\t\t\t\t\tmessage: \"agenticMemoryRetentionBundle: command must be an object\",\n\t\t\t\t\tindex,\n\t\t\t\t\tcommand: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst id = typeof value.id === \"string\" && value.id.length > 0 ? value.id : undefined;\n\tconst kind = value.kind;\n\tconst errors: string[] = [];\n\tif (id === undefined) errors.push(\"command.id must be a non-empty string\");\n\tif (\n\t\tkind !== \"archive\" &&\n\t\tkind !== \"restore\" &&\n\t\tkind !== \"setPersistenceLevel\" &&\n\t\tkind !== \"requestConsolidation\"\n\t) {\n\t\terrors.push(\"command.kind is invalid\");\n\t}\n\tif (value.reason !== undefined && typeof value.reason !== \"string\") {\n\t\terrors.push(\"command.reason must be a string when present\");\n\t}\n\tif (kind === \"archive\") {\n\t\tif (!isNonEmptyString(value.recordId)) errors.push(\"command.recordId must be non-empty\");\n\t} else if (kind === \"restore\") {\n\t\tif (!isNonEmptyString(value.recordId)) errors.push(\"command.recordId must be non-empty\");\n\t\tif (\n\t\t\tvalue.persistenceLevel !== undefined &&\n\t\t\t(!isAgenticMemoryPersistenceLevel(value.persistenceLevel) ||\n\t\t\t\tvalue.persistenceLevel === \"archived\")\n\t\t) {\n\t\t\terrors.push(\"restore.persistenceLevel must be a non-archived persistence level when present\");\n\t\t}\n\t} else if (kind === \"setPersistenceLevel\") {\n\t\tif (!isNonEmptyString(value.recordId)) errors.push(\"command.recordId must be non-empty\");\n\t\tif (!isAgenticMemoryPersistenceLevel(value.persistenceLevel)) {\n\t\t\terrors.push(\"setPersistenceLevel.persistenceLevel is invalid\");\n\t\t}\n\t} else if (kind === \"requestConsolidation\") {\n\t\tif (!isDenseArrayOf(value.recordIds, isNonEmptyString) || value.recordIds.length === 0) {\n\t\t\terrors.push(\"requestConsolidation.recordIds must be a non-empty string array\");\n\t\t}\n\t\tif (\n\t\t\tvalue.requestId !== undefined &&\n\t\t\t(typeof value.requestId !== \"string\" || value.requestId.length === 0)\n\t\t) {\n\t\t\terrors.push(\"requestConsolidation.requestId must be non-empty when present\");\n\t\t}\n\t}\n\tif (errors.length > 0 || id === undefined) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-command\",\n\t\t\t\t\tmessage: \"agenticMemoryRetentionBundle: command is invalid\",\n\t\t\t\t\tindex,\n\t\t\t\t\tcommandId: id,\n\t\t\t\t\tcommand: value,\n\t\t\t\t\tvalidationErrors: Object.freeze(errors),\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst base = { id, reason: value.reason as string | undefined };\n\tif (kind === \"archive\") {\n\t\treturn {\n\t\t\tcommand: Object.freeze({\n\t\t\t\t...base,\n\t\t\t\tkind,\n\t\t\t\trecordId: value.recordId as string,\n\t\t\t\t...(base.reason === undefined ? {} : { reason: base.reason }),\n\t\t\t}),\n\t\t\terrors: [],\n\t\t};\n\t}\n\tif (kind === \"restore\") {\n\t\treturn {\n\t\t\tcommand: Object.freeze({\n\t\t\t\t...base,\n\t\t\t\tkind,\n\t\t\t\trecordId: value.recordId as string,\n\t\t\t\t...(value.persistenceLevel === undefined\n\t\t\t\t\t? {}\n\t\t\t\t\t: {\n\t\t\t\t\t\t\tpersistenceLevel: value.persistenceLevel as Exclude<\n\t\t\t\t\t\t\t\tAgenticMemoryPersistenceLevel,\n\t\t\t\t\t\t\t\t\"archived\"\n\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t}),\n\t\t\t\t...(base.reason === undefined ? {} : { reason: base.reason }),\n\t\t\t}),\n\t\t\terrors: [],\n\t\t};\n\t}\n\tif (kind === \"setPersistenceLevel\") {\n\t\treturn {\n\t\t\tcommand: Object.freeze({\n\t\t\t\t...base,\n\t\t\t\tkind,\n\t\t\t\trecordId: value.recordId as string,\n\t\t\t\tpersistenceLevel: value.persistenceLevel as AgenticMemoryPersistenceLevel,\n\t\t\t\t...(base.reason === undefined ? {} : { reason: base.reason }),\n\t\t\t}),\n\t\t\terrors: [],\n\t\t};\n\t}\n\treturn {\n\t\tcommand: Object.freeze({\n\t\t\t...base,\n\t\t\tkind: \"requestConsolidation\",\n\t\t\trecordIds: Object.freeze([...(value.recordIds as readonly string[])]),\n\t\t\t...(value.requestId === undefined ? {} : { requestId: value.requestId as string }),\n\t\t\t...(base.reason === undefined ? {} : { reason: base.reason }),\n\t\t}),\n\t\terrors: [],\n\t};\n}\n\nfunction retentionMissingRecords(\n\tcommand: AgenticMemoryRetentionCommand,\n\trecords: ReadonlyMap<FactId, AgenticMemoryRecord>,\n): readonly FactId[] {\n\tif (\"recordId\" in command) return records.has(command.recordId) ? [] : [command.recordId];\n\treturn command.recordIds.filter((recordId) => !records.has(recordId));\n}\n\nfunction applyRetentionCommand<T>(\n\tcommand: AgenticMemoryRetentionCommand,\n\tsource: ReadonlyMap<FactId, AgenticMemoryRecord<T>>,\n\tview: Map<FactId, AgenticMemoryRecord<T>>,\n\trequests: AgenticMemoryConsolidationRequest[],\n): void {\n\tif (command.kind === \"requestConsolidation\") {\n\t\trequests.push(\n\t\t\tObject.freeze({\n\t\t\t\tid: command.requestId ?? command.id,\n\t\t\t\tcommandId: command.id,\n\t\t\t\trecordIds: Object.freeze([...command.recordIds]),\n\t\t\t\t...(command.reason === undefined ? {} : { reason: command.reason }),\n\t\t\t}),\n\t\t);\n\t\treturn;\n\t}\n\tconst record = view.get(command.recordId) ?? source.get(command.recordId);\n\tif (record === undefined) return;\n\tconst persistenceLevel =\n\t\tcommand.kind === \"archive\"\n\t\t\t? \"archived\"\n\t\t\t: command.kind === \"restore\"\n\t\t\t\t? (command.persistenceLevel ?? nonArchivedLevel(source.get(command.recordId) ?? record))\n\t\t\t\t: command.persistenceLevel;\n\tview.set(command.recordId, withPersistenceLevel(record, persistenceLevel));\n}\n\nfunction nonArchivedLevel(\n\trecord: AgenticMemoryRecord,\n): Exclude<AgenticMemoryPersistenceLevel, \"archived\"> {\n\treturn record.persistenceLevel === \"archived\" ? \"session\" : record.persistenceLevel;\n}\n\nfunction withPersistenceLevel<T>(\n\trecord: AgenticMemoryRecord<T>,\n\tpersistenceLevel: AgenticMemoryPersistenceLevel,\n): AgenticMemoryRecord<T> {\n\treturn Object.freeze({\n\t\t...record,\n\t\tpersistenceLevel,\n\t});\n}\n\nfunction retentionErrorFromRecordError(\n\terror: Omit<AgenticMemoryError, \"cursor\">,\n): Omit<AgenticMemoryRetentionError, \"cursor\"> {\n\treturn {\n\t\t...error,\n\t\tcode: error.code,\n\t};\n}\n\nfunction validateConsolidationRequests<T>(\n\tvalue: unknown,\n\trecords: readonly AgenticMemoryRecord<T>[],\n): {\n\treadonly requests: readonly AgenticMemoryConsolidationRequest[];\n\treadonly errors: readonly Omit<AgenticMemoryRetentionError, \"cursor\">[];\n} {\n\tconst byId = new Map(records.map((record) => [record.id, record]));\n\tconst requests: AgenticMemoryConsolidationRequest[] = [];\n\tconst errors: Omit<AgenticMemoryRetentionError, \"cursor\">[] = [];\n\tif (!Array.isArray(value)) {\n\t\treturn {\n\t\t\trequests,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-commands-input\",\n\t\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: requests input must be an array\",\n\t\t\t\t\tcommand: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\treturn {\n\t\t\trequests,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-commands-input\",\n\t\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: requests input length could not be read\",\n\t\t\t\t\tcommand: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst seen = new Set<FactId>();\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\ttry {\n\t\t\tif (!Object.hasOwn(value, i)) {\n\t\t\t\tthrow new TypeError(\"request array must be dense\");\n\t\t\t}\n\t\t\traw = value[i];\n\t\t} catch (error) {\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-command\",\n\t\t\t\tmessage: `agenticMemoryConsolidationBundle: request access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tvalidationErrors: Object.freeze([\"request access failed\"]),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tif (!isPlainRecord(raw)) {\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-command\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: request must be an object\",\n\t\t\t\tindex: i,\n\t\t\t\tcommand: raw,\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tconst id = isNonEmptyString(raw.id) ? raw.id : undefined;\n\t\tconst commandId = isNonEmptyString(raw.commandId) ? raw.commandId : undefined;\n\t\tconst recordIds = isDenseArrayOf(raw.recordIds, isNonEmptyString)\n\t\t\t? Object.freeze([...raw.recordIds])\n\t\t\t: undefined;\n\t\tconst validationErrors: string[] = [];\n\t\tif (id === undefined) validationErrors.push(\"request.id must be a non-empty string\");\n\t\tif (commandId === undefined) {\n\t\t\tvalidationErrors.push(\"request.commandId must be a non-empty string\");\n\t\t}\n\t\tif (recordIds === undefined || recordIds.length === 0) {\n\t\t\tvalidationErrors.push(\"request.recordIds must be a non-empty string array\");\n\t\t}\n\t\tif (raw.reason !== undefined && typeof raw.reason !== \"string\") {\n\t\t\tvalidationErrors.push(\"request.reason must be a string when present\");\n\t\t}\n\t\tif (id !== undefined && seen.has(id)) {\n\t\t\tvalidationErrors.push(`duplicate request id '${id}'`);\n\t\t}\n\t\tconst missing = (recordIds ?? []).filter((recordId) => !byId.has(recordId));\n\t\tif (missing.length > 0) {\n\t\t\terrors.push({\n\t\t\t\tcode: \"missing-record-ref\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: request references missing records\",\n\t\t\t\tindex: i,\n\t\t\t\tcommandId,\n\t\t\t\trecordIds: Object.freeze(missing),\n\t\t\t\tcommand: raw,\n\t\t\t\tvalidationErrors: Object.freeze(\n\t\t\t\t\tmissing.map((recordId) => `record '${recordId}' is not projected`),\n\t\t\t\t),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tif (\n\t\t\tvalidationErrors.length > 0 ||\n\t\t\tid === undefined ||\n\t\t\tcommandId === undefined ||\n\t\t\trecordIds === undefined\n\t\t) {\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-command\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: request is invalid\",\n\t\t\t\tindex: i,\n\t\t\t\tcommandId,\n\t\t\t\trecordIds,\n\t\t\t\tcommand: raw,\n\t\t\t\tvalidationErrors: Object.freeze(validationErrors),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tseen.add(id);\n\t\trequests.push(\n\t\t\tObject.freeze({\n\t\t\t\tid,\n\t\t\t\tcommandId,\n\t\t\t\trecordIds,\n\t\t\t\t...(raw.reason === undefined ? {} : { reason: raw.reason as string }),\n\t\t\t}),\n\t\t);\n\t}\n\treturn { requests: Object.freeze(requests), errors };\n}\n\nfunction projectConsolidationOutcomes<T>(\n\tvalue: unknown,\n\trequests: readonly AgenticMemoryConsolidationRequest[],\n\tevaluation: number,\n): {\n\treadonly results: readonly AgenticMemoryConsolidationResult[];\n\treadonly proposedRecordDrafts: readonly AgenticMemoryConsolidationRecordDraft<T>[];\n\treadonly commands: readonly AgenticMemoryConsolidationCommand[];\n\treadonly errors: readonly Omit<AgenticMemoryConsolidationError, \"cursor\">[];\n\treadonly validOutcomes: number;\n\treadonly invalidOutcomes: number;\n} {\n\tconst byRequest = new Map(requests.map((request) => [request.id, request]));\n\tconst results: AgenticMemoryConsolidationResult[] = [];\n\tconst proposedRecordDrafts: AgenticMemoryConsolidationRecordDraft<T>[] = [];\n\tconst commands: AgenticMemoryConsolidationCommand[] = [];\n\tconst errors: Omit<AgenticMemoryConsolidationError, \"cursor\">[] = [];\n\tlet validOutcomes = 0;\n\tlet invalidOutcomes = 0;\n\tif (!Array.isArray(value)) {\n\t\treturn {\n\t\t\tresults,\n\t\t\tproposedRecordDrafts,\n\t\t\tcommands,\n\t\t\tvalidOutcomes,\n\t\t\tinvalidOutcomes: 1,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-outcomes-input\",\n\t\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: outcomes input must be an array\",\n\t\t\t\t\toutcome: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\treturn {\n\t\t\tresults,\n\t\t\tproposedRecordDrafts,\n\t\t\tcommands,\n\t\t\tvalidOutcomes,\n\t\t\tinvalidOutcomes: 1,\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-outcomes-input\",\n\t\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: outcomes input length could not be read\",\n\t\t\t\t\toutcome: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst seenOutcomes = new Set<FactId>();\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\tlet outcome: {\n\t\t\treadonly outcome?: AgenticMemoryConsolidationOutcome<T>;\n\t\t\treadonly error?: Omit<AgenticMemoryConsolidationError, \"cursor\">;\n\t\t};\n\t\ttry {\n\t\t\tif (!Object.hasOwn(value, i)) {\n\t\t\t\tthrow new TypeError(\"outcome array must be dense\");\n\t\t\t}\n\t\t\traw = value[i];\n\t\t\toutcome = validateConsolidationOutcome<T>(raw, i);\n\t\t} catch (error) {\n\t\t\tinvalidOutcomes += 1;\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-outcome\",\n\t\t\t\tmessage: `agenticMemoryConsolidationBundle: outcome access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\toutcome: raw,\n\t\t\t\tvalidationErrors: Object.freeze([\"outcome access failed\"]),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tif (outcome.error !== undefined || outcome.outcome === undefined) {\n\t\t\tinvalidOutcomes += 1;\n\t\t\tif (outcome.error !== undefined) errors.push(outcome.error);\n\t\t\tcontinue;\n\t\t}\n\t\tconst validOutcome = outcome.outcome;\n\t\tif (seenOutcomes.has(validOutcome.id)) {\n\t\t\tinvalidOutcomes += 1;\n\t\t\terrors.push({\n\t\t\t\tcode: \"duplicate-outcome-id\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: duplicate outcome id\",\n\t\t\t\tindex: i,\n\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\toutcome: raw,\n\t\t\t\tvalidationErrors: Object.freeze([`duplicate outcome id '${validOutcome.id}'`]),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tconst request = byRequest.get(validOutcome.requestId);\n\t\tif (request === undefined) {\n\t\t\tinvalidOutcomes += 1;\n\t\t\terrors.push({\n\t\t\t\tcode: \"missing-request-ref\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: outcome references missing request\",\n\t\t\t\tindex: i,\n\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\toutcome: raw,\n\t\t\t\tvalidationErrors: Object.freeze([`request '${validOutcome.requestId}' is not projected`]),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tseenOutcomes.add(validOutcome.id);\n\t\tvalidOutcomes += 1;\n\t\tif (validOutcome.kind === \"failed\") {\n\t\t\tconst resultId = `${validOutcome.requestId}:${validOutcome.id}`;\n\t\t\tresults.push(\n\t\t\t\tObject.freeze({\n\t\t\t\t\tid: resultId,\n\t\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\t\tstate: \"failed\",\n\t\t\t\t\tsourceRecordIds: request.recordIds,\n\t\t\t\t\tproposedRecordIds: Object.freeze([]),\n\t\t\t\t\tmessage: validOutcome.message,\n\t\t\t\t\t...(validOutcome.provenance === undefined ? {} : { provenance: validOutcome.provenance }),\n\t\t\t\t}),\n\t\t\t);\n\t\t\tcommands.push(\n\t\t\t\tObject.freeze({\n\t\t\t\t\tid: `${resultId}:markFailed`,\n\t\t\t\t\tkind: \"markFailed\",\n\t\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\t\tmessage: validOutcome.message,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tcontinue;\n\t\t}\n\t\tconst draftIds = validOutcome.records.map(\n\t\t\t(record) => `${validOutcome.requestId}:${validOutcome.id}:${record.id}`,\n\t\t);\n\t\tfor (let recordIndex = 0; recordIndex < validOutcome.records.length; recordIndex += 1) {\n\t\t\tproposedRecordDrafts.push(\n\t\t\t\tObject.freeze({\n\t\t\t\t\tid: draftIds[recordIndex] as FactId,\n\t\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\t\trecord: validOutcome.records[recordIndex] as AgenticMemoryRecord<T>,\n\t\t\t\t}),\n\t\t\t);\n\t\t}\n\t\tconst resultId = `${validOutcome.requestId}:${validOutcome.id}`;\n\t\tresults.push(\n\t\t\tObject.freeze({\n\t\t\t\tid: resultId,\n\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\tstate: \"proposed\",\n\t\t\t\tsourceRecordIds: request.recordIds,\n\t\t\t\tproposedRecordIds: Object.freeze(validOutcome.records.map((record) => record.id)),\n\t\t\t\t...(validOutcome.provenance === undefined ? {} : { provenance: validOutcome.provenance }),\n\t\t\t}),\n\t\t);\n\t\tcommands.push(\n\t\t\tObject.freeze({\n\t\t\t\tid: `${resultId}:proposeRecords`,\n\t\t\t\tkind: \"proposeRecords\",\n\t\t\t\trequestId: validOutcome.requestId,\n\t\t\t\toutcomeId: validOutcome.id,\n\t\t\t\tdraftIds: Object.freeze(draftIds),\n\t\t\t}),\n\t\t);\n\t}\n\tvoid evaluation;\n\treturn {\n\t\tresults: Object.freeze(results),\n\t\tproposedRecordDrafts: Object.freeze(proposedRecordDrafts),\n\t\tcommands: Object.freeze(commands),\n\t\terrors,\n\t\tvalidOutcomes,\n\t\tinvalidOutcomes,\n\t};\n}\n\nfunction validateConsolidationOutcome<T>(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly outcome?: AgenticMemoryConsolidationOutcome<T>;\n\treadonly error?: Omit<AgenticMemoryConsolidationError, \"cursor\">;\n} {\n\tif (!isPlainRecord(value)) {\n\t\treturn {\n\t\t\terror: {\n\t\t\t\tcode: \"invalid-outcome\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: outcome must be an object\",\n\t\t\t\tindex,\n\t\t\t\toutcome: value,\n\t\t\t},\n\t\t};\n\t}\n\tconst errors: string[] = [];\n\tconst id = isNonEmptyString(value.id) ? value.id : undefined;\n\tconst requestId = isNonEmptyString(value.requestId) ? value.requestId : undefined;\n\tif (id === undefined) errors.push(\"outcome.id must be a non-empty string\");\n\tif (requestId === undefined) errors.push(\"outcome.requestId must be a non-empty string\");\n\tif (value.kind !== \"proposedRecords\" && value.kind !== \"failed\") {\n\t\terrors.push(\"outcome.kind must be proposedRecords or failed\");\n\t}\n\tif (value.provenance !== undefined && typeof value.provenance !== \"string\") {\n\t\terrors.push(\"outcome.provenance must be a string when present\");\n\t}\n\tif (value.kind === \"failed\" && !isNonEmptyString(value.message)) {\n\t\terrors.push(\"failed outcome.message must be a non-empty string\");\n\t}\n\tconst records: AgenticMemoryRecord<T>[] = [];\n\tif (value.kind === \"proposedRecords\") {\n\t\tif (!Array.isArray(value.records)) {\n\t\t\terrors.push(\"proposedRecords.records must be a non-empty array\");\n\t\t} else {\n\t\t\tconst recordsLength = safeArrayLength(value.records);\n\t\t\tconst seenRecordIds = new Set<FactId>();\n\t\t\tif (recordsLength === undefined || recordsLength === 0) {\n\t\t\t\terrors.push(\"proposedRecords.records must be a non-empty array\");\n\t\t\t}\n\t\t\tfor (let i = 0; i < (recordsLength ?? 0); i += 1) {\n\t\t\t\tlet result: {\n\t\t\t\t\treadonly record?: AgenticMemoryRecord<T>;\n\t\t\t\t\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n\t\t\t\t};\n\t\t\t\ttry {\n\t\t\t\t\tif (!Object.hasOwn(value.records, i)) {\n\t\t\t\t\t\tthrow new TypeError(\"proposedRecords.records must be dense\");\n\t\t\t\t\t}\n\t\t\t\t\tresult = validateAndSnapshotRecord<T>(value.records[i], i);\n\t\t\t\t} catch (error) {\n\t\t\t\t\terrors.push(`records[${i}]: record access failed: ${errorMessage(error)}`);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (result.record === undefined || result.errors.length > 0) {\n\t\t\t\t\terrors.push(\n\t\t\t\t\t\t...result.errors\n\t\t\t\t\t\t\t.flatMap((error) => error.validationErrors ?? [error.message])\n\t\t\t\t\t\t\t.map((error) => `records[${i}]: ${error}`),\n\t\t\t\t\t);\n\t\t\t\t} else if (seenRecordIds.has(result.record.id)) {\n\t\t\t\t\terrors.push(`records[${i}]: duplicate proposed record id '${result.record.id}'`);\n\t\t\t\t} else {\n\t\t\t\t\tseenRecordIds.add(result.record.id);\n\t\t\t\t\trecords.push(result.record);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (errors.length > 0 || id === undefined || requestId === undefined) {\n\t\treturn {\n\t\t\terror: {\n\t\t\t\tcode: value.kind === \"proposedRecords\" ? \"invalid-proposed-record\" : \"invalid-outcome\",\n\t\t\t\tmessage: \"agenticMemoryConsolidationBundle: outcome is invalid\",\n\t\t\t\tindex,\n\t\t\t\toutcomeId: id,\n\t\t\t\trequestId,\n\t\t\t\toutcome: value,\n\t\t\t\tvalidationErrors: Object.freeze(errors),\n\t\t\t},\n\t\t};\n\t}\n\tif (value.kind === \"failed\") {\n\t\treturn {\n\t\t\toutcome: Object.freeze({\n\t\t\t\tid,\n\t\t\t\trequestId,\n\t\t\t\tkind: \"failed\",\n\t\t\t\tmessage: value.message as string,\n\t\t\t\t...(value.provenance === undefined ? {} : { provenance: value.provenance as string }),\n\t\t\t}),\n\t\t};\n\t}\n\treturn {\n\t\toutcome: Object.freeze({\n\t\t\tid,\n\t\t\trequestId,\n\t\t\tkind: \"proposedRecords\",\n\t\t\trecords: Object.freeze(records),\n\t\t\t...(value.provenance === undefined ? {} : { provenance: value.provenance as string }),\n\t\t}),\n\t};\n}\n\nfunction consolidationErrorFromRecordError(\n\terror: Omit<AgenticMemoryError, \"cursor\">,\n): Omit<AgenticMemoryConsolidationError, \"cursor\"> {\n\treturn {\n\t\t...error,\n\t\tcode: error.code,\n\t};\n}\n\nfunction consolidationErrorFromRetentionError(\n\terror: Omit<AgenticMemoryRetentionError, \"cursor\">,\n): Omit<AgenticMemoryConsolidationError, \"cursor\"> {\n\treturn {\n\t\t...error,\n\t\tcode: error.code,\n\t};\n}\n\nfunction packContext(\n\tcontextValue: unknown,\n\ttextsValue: unknown,\n\tpolicyValue: unknown,\n\tevaluation: number,\n): AgenticMemoryContextPackingSnapshot {\n\tconst errors: Omit<AgenticMemoryContextPackingError, \"cursor\">[] = [];\n\tconst context = validatePackingContext(contextValue, errors);\n\tconst texts = validateContextTexts(textsValue, errors);\n\tconst policy = validatePackingPolicy(policyValue, errors);\n\tconst packedEntries: AgenticMemoryPackedContextEntry[] = [];\n\tlet omittedEntries = 0;\n\tlet totalChars = 0;\n\tlet totalCost = 0;\n\tif (context !== undefined && policy !== undefined) {\n\t\tfor (const entry of context.entries) {\n\t\t\tconst textFact = texts.get(entry.fragmentId);\n\t\t\tif (textFact === undefined) {\n\t\t\t\tomittedEntries += 1;\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"missing-text\",\n\t\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: missing text projection for context entry\",\n\t\t\t\t\tfragmentId: entry.fragmentId,\n\t\t\t\t\tvalidationErrors: [`missing text for fragment '${entry.fragmentId}'`],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst cost = textFact.cost ?? textFact.text.length;\n\t\t\tconst nextEntries = packedEntries.length + 1;\n\t\t\tconst separatorChars = packedEntries.length === 0 ? 0 : 2;\n\t\t\tconst nextChars = totalChars + separatorChars + textFact.text.length;\n\t\t\tconst nextCost = totalCost + cost;\n\t\t\tconst exceeds =\n\t\t\t\t(policy.maxEntries !== undefined && nextEntries > policy.maxEntries) ||\n\t\t\t\t(policy.maxChars !== undefined && nextChars > policy.maxChars) ||\n\t\t\t\t(policy.maxCost !== undefined && nextCost > policy.maxCost);\n\t\t\tif (exceeds) {\n\t\t\t\tomittedEntries += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst packedEntry: AgenticMemoryPackedContextEntry = Object.freeze({\n\t\t\t\tfragmentId: entry.fragmentId,\n\t\t\t\ttext: textFact.text,\n\t\t\t\tcost,\n\t\t\t\tchars: textFact.text.length,\n\t\t\t\t...(entry.record === undefined ? {} : { record: entry.record }),\n\t\t\t\t...(policy.includeMetadata && textFact.metadata !== undefined\n\t\t\t\t\t? { metadata: textFact.metadata }\n\t\t\t\t\t: {}),\n\t\t\t});\n\t\t\tpackedEntries.push(packedEntry);\n\t\t\ttotalChars = nextChars;\n\t\t\ttotalCost = nextCost;\n\t\t}\n\t}\n\tconst cursor: AgenticMemoryContextPackingCursor = Object.freeze({\n\t\tevaluation,\n\t\tinputEntries: context?.entries.length ?? 0,\n\t\tpackedEntries: packedEntries.length,\n\t\tomittedEntries,\n\t\ttotalChars,\n\t\ttotalCost,\n\t});\n\tconst errorFacts = Object.freeze(\n\t\terrors.map((error) =>\n\t\t\tfreezeError({\n\t\t\t\t...error,\n\t\t\t\tcursor,\n\t\t\t}),\n\t\t),\n\t);\n\tconst packedContext: AgenticMemoryPackedContext = Object.freeze({\n\t\tentries: Object.freeze(packedEntries),\n\t\ttext: packedEntries.map((entry) => entry.text).join(\"\\n\\n\"),\n\t\ttotalChars,\n\t\ttotalCost,\n\t\ttruncated: omittedEntries > 0,\n\t});\n\tconst status: AgenticMemoryContextPackingStatus = Object.freeze({\n\t\tstate: agenticStatusState(errorFacts.length, packedEntries.length),\n\t\tcursor,\n\t});\n\treturn Object.freeze({\n\t\tpackedContext,\n\t\tstatus,\n\t\terrors: errorFacts,\n\t\tcursor,\n\t});\n}\n\nfunction validatePackingContext(\n\tvalue: unknown,\n\terrors: Omit<AgenticMemoryContextPackingError, \"cursor\">[],\n): ValidatedPackingContext | undefined {\n\tif (!isPlainRecord(value)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-context\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: context must be an AgenticMemoryContext fact\",\n\t\t\tvalue,\n\t\t});\n\t\treturn undefined;\n\t}\n\tlet entriesValue: unknown;\n\ttry {\n\t\tentriesValue = value.entries;\n\t} catch (error) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-context\",\n\t\t\tmessage: `agenticMemoryContextPackingBundle: context entries access failed: ${errorMessage(error)}`,\n\t\t\tvalue,\n\t\t\tvalidationErrors: [\"context entries access failed\"],\n\t\t});\n\t\treturn undefined;\n\t}\n\tif (!Array.isArray(entriesValue)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-context\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: context must be an AgenticMemoryContext fact\",\n\t\t\tvalue,\n\t\t\tvalidationErrors: [\"context.entries must be an array\"],\n\t\t});\n\t\treturn undefined;\n\t}\n\tconst length = safeArrayLength(entriesValue);\n\tif (length === undefined) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-context\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: context entries length could not be read\",\n\t\t\tvalue,\n\t\t\tvalidationErrors: [\"context.entries length could not be read\"],\n\t\t});\n\t\treturn undefined;\n\t}\n\tconst entries: AgenticMemoryContextEntry[] = [];\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\ttry {\n\t\t\traw = entriesValue[i];\n\t\t\tif (!isPlainRecord(raw) || !isNonEmptyString(raw.fragmentId)) {\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"invalid-context\",\n\t\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: context entry is invalid\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tvalue: raw,\n\t\t\t\t\tvalidationErrors: [\"context entry fragmentId must be a non-empty string\"],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst record = validateRecordMetadata(raw.record);\n\t\t\tif (!record.ok) {\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"invalid-context\",\n\t\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: context entry record metadata is invalid\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tfragmentId: raw.fragmentId,\n\t\t\t\t\tvalue: raw,\n\t\t\t\t\tvalidationErrors: Object.freeze(record.errors),\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tentries.push(\n\t\t\t\tObject.freeze({\n\t\t\t\t\tfragmentId: raw.fragmentId,\n\t\t\t\t\t...(record.metadata === undefined ? {} : { record: record.metadata }),\n\t\t\t\t}) as AgenticMemoryContextEntry,\n\t\t\t);\n\t\t} catch (error) {\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-context\",\n\t\t\t\tmessage: `agenticMemoryContextPackingBundle: context entry access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tvalue: raw,\n\t\t\t\tvalidationErrors: [\"context entry access failed\"],\n\t\t\t});\n\t\t}\n\t}\n\treturn Object.freeze({\n\t\tentries: Object.freeze(entries),\n\t});\n}\n\nfunction validateContextTexts(\n\tvalue: unknown,\n\terrors: Omit<AgenticMemoryContextPackingError, \"cursor\">[],\n): Map<FactId, AgenticMemoryContextText> {\n\tconst out = new Map<FactId, AgenticMemoryContextText>();\n\tif (!Array.isArray(value)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-texts-input\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: texts input must be an array\",\n\t\t\tvalue,\n\t\t});\n\t\treturn out;\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-texts-input\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: texts input length could not be read\",\n\t\t\tvalue,\n\t\t});\n\t\treturn out;\n\t}\n\tfor (let i = 0; i < length; i += 1) {\n\t\ttry {\n\t\t\tconst raw = value[i];\n\t\t\tconst result = validateContextText(raw, i);\n\t\t\tif (result.error !== undefined) {\n\t\t\t\terrors.push(result.error);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (result.text === undefined) {\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"invalid-text\",\n\t\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: text fact is invalid\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tvalue: raw,\n\t\t\t\t\tvalidationErrors: [\"text validation returned no fact\"],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (out.has(result.text.fragmentId)) {\n\t\t\t\terrors.push({\n\t\t\t\t\tcode: \"duplicate-text-fragment-id\",\n\t\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: duplicate text fragment id\",\n\t\t\t\t\tindex: i,\n\t\t\t\t\tfragmentId: result.text.fragmentId,\n\t\t\t\t\tvalue: raw,\n\t\t\t\t\tvalidationErrors: [`duplicate text fragment id '${result.text.fragmentId}'`],\n\t\t\t\t});\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tout.set(result.text.fragmentId, result.text);\n\t\t} catch (error) {\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-text\",\n\t\t\t\tmessage: `agenticMemoryContextPackingBundle: text access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tvalidationErrors: [\"text access failed\"],\n\t\t\t});\n\t\t}\n\t}\n\treturn out;\n}\n\nfunction validateContextText(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly text?: AgenticMemoryContextText;\n\treadonly error?: Omit<AgenticMemoryContextPackingError, \"cursor\">;\n} {\n\tif (!isPlainRecord(value)) {\n\t\treturn {\n\t\t\terror: {\n\t\t\t\tcode: \"invalid-text\",\n\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: text fact must be an object\",\n\t\t\t\tindex,\n\t\t\t\tvalue,\n\t\t\t},\n\t\t};\n\t}\n\tconst errors: string[] = [];\n\tif (!isNonEmptyString(value.fragmentId)) errors.push(\"fragmentId must be a non-empty string\");\n\tif (typeof value.text !== \"string\") errors.push(\"text must be a string\");\n\tif (\n\t\tvalue.cost !== undefined &&\n\t\t(typeof value.cost !== \"number\" || !Number.isFinite(value.cost) || value.cost < 0)\n\t) {\n\t\terrors.push(\"cost must be a finite number >= 0\");\n\t}\n\tif (value.metadata !== undefined) {\n\t\ttry {\n\t\t\tif (!isPlainRecord(value.metadata)) {\n\t\t\t\tthrow new TypeError(\"metadata must be a plain object when present\");\n\t\t\t}\n\t\t\tassertStrictJsonValue(value.metadata, \"metadata\");\n\t\t} catch (error) {\n\t\t\terrors.push(errorMessage(error));\n\t\t}\n\t}\n\tif (errors.length > 0) {\n\t\treturn {\n\t\t\terror: {\n\t\t\t\tcode: \"invalid-text\",\n\t\t\t\tmessage: \"agenticMemoryContextPackingBundle: text fact is invalid\",\n\t\t\t\tindex,\n\t\t\t\tfragmentId: typeof value.fragmentId === \"string\" ? value.fragmentId : undefined,\n\t\t\t\tvalue,\n\t\t\t\tvalidationErrors: Object.freeze(errors),\n\t\t\t},\n\t\t};\n\t}\n\treturn {\n\t\ttext: Object.freeze({\n\t\t\tfragmentId: value.fragmentId as string,\n\t\t\ttext: value.text as string,\n\t\t\t...(value.cost === undefined ? {} : { cost: value.cost as number }),\n\t\t\t...(value.metadata === undefined\n\t\t\t\t? {}\n\t\t\t\t: { metadata: Object.freeze({ ...(value.metadata as Record<string, StrictJsonValue>) }) }),\n\t\t}),\n\t};\n}\n\nfunction validatePackingPolicy(\n\tvalue: unknown,\n\terrors: Omit<AgenticMemoryContextPackingError, \"cursor\">[],\n): AgenticMemoryContextPackingPolicy | undefined {\n\tif (!isPlainRecord(value)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-policy\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: policy must be an object\",\n\t\t\tvalue,\n\t\t});\n\t\treturn undefined;\n\t}\n\tconst validation: string[] = [];\n\tlet maxEntries: unknown;\n\tlet maxChars: unknown;\n\tlet maxCost: unknown;\n\tlet includeMetadata: unknown;\n\ttry {\n\t\tmaxEntries = value.maxEntries;\n\t\tmaxChars = value.maxChars;\n\t\tmaxCost = value.maxCost;\n\t\tincludeMetadata = value.includeMetadata;\n\t} catch (error) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-policy\",\n\t\t\tmessage: `agenticMemoryContextPackingBundle: policy access failed: ${errorMessage(error)}`,\n\t\t\tvalue,\n\t\t\tvalidationErrors: [\"policy access failed\"],\n\t\t});\n\t\treturn undefined;\n\t}\n\tif (\n\t\tmaxEntries !== undefined &&\n\t\t(typeof maxEntries !== \"number\" || !Number.isSafeInteger(maxEntries) || maxEntries < 0)\n\t) {\n\t\tvalidation.push(\"maxEntries must be a safe integer >= 0\");\n\t}\n\tif (\n\t\tmaxChars !== undefined &&\n\t\t(typeof maxChars !== \"number\" || !Number.isSafeInteger(maxChars) || maxChars < 0)\n\t) {\n\t\tvalidation.push(\"maxChars must be a safe integer >= 0\");\n\t}\n\tif (\n\t\tmaxCost !== undefined &&\n\t\t(typeof maxCost !== \"number\" || !Number.isFinite(maxCost) || maxCost < 0)\n\t) {\n\t\tvalidation.push(\"maxCost must be a finite number >= 0\");\n\t}\n\tif (includeMetadata !== undefined && typeof includeMetadata !== \"boolean\") {\n\t\tvalidation.push(\"includeMetadata must be a boolean when present\");\n\t}\n\tif (validation.length > 0) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-policy\",\n\t\t\tmessage: \"agenticMemoryContextPackingBundle: policy is invalid\",\n\t\t\tvalue,\n\t\t\tvalidationErrors: Object.freeze(validation),\n\t\t});\n\t\treturn undefined;\n\t}\n\treturn Object.freeze({\n\t\t...(maxEntries === undefined ? {} : { maxEntries: maxEntries as number }),\n\t\t...(maxChars === undefined ? {} : { maxChars: maxChars as number }),\n\t\t...(maxCost === undefined ? {} : { maxCost: maxCost as number }),\n\t\t...(includeMetadata === undefined ? {} : { includeMetadata: includeMetadata as boolean }),\n\t});\n}\n\nfunction validateAndProjectRecords<T>(value: unknown): {\n\treadonly records: AgenticMemoryRecord<T>[];\n\treadonly fragments: MemoryFragment<T>[];\n\treadonly metadataByFragmentId: Record<FactId, AgenticMemoryRecordMetadata>;\n\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n\treadonly invalidRecordIndexes: Set<number>;\n} {\n\tconst records: AgenticMemoryRecord<T>[] = [];\n\tconst fragments: MemoryFragment<T>[] = [];\n\tconst metadataByFragmentId = Object.create(null) as Record<FactId, AgenticMemoryRecordMetadata>;\n\tconst errors: Omit<AgenticMemoryError, \"cursor\">[] = [];\n\tconst invalidRecordIndexes = new Set<number>();\n\tconst seenRecordIds = new Set<FactId>();\n\tconst seenFragmentIds = new Set<FactId>();\n\tif (!Array.isArray(value)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-records-input\",\n\t\t\tmessage: \"agenticMemoryBundle: records input must be an array\",\n\t\t\trecord: value,\n\t\t});\n\t\treturn { records, fragments, metadataByFragmentId, errors, invalidRecordIndexes };\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-records-input\",\n\t\t\tmessage: \"agenticMemoryBundle: records input length could not be read\",\n\t\t\trecord: value,\n\t\t});\n\t\treturn { records, fragments, metadataByFragmentId, errors, invalidRecordIndexes };\n\t}\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\ttry {\n\t\t\traw = value[i];\n\t\t} catch (error) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-record\",\n\t\t\t\tmessage: `agenticMemoryBundle: record access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tvalidationErrors: Object.freeze([\"record access failed\"]),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tconst result = validateAndSnapshotRecord<T>(raw, i);\n\t\tif (result.errors.length > 0) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push(...result.errors);\n\t\t\tcontinue;\n\t\t}\n\t\tif (result.record === undefined) continue;\n\t\tif (seenRecordIds.has(result.record.id)) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push({\n\t\t\t\tcode: \"duplicate-record-id\",\n\t\t\t\tmessage: \"agenticMemoryBundle: duplicate record id\",\n\t\t\t\tindex: i,\n\t\t\t\trecordId: result.record.id,\n\t\t\t\trecord: raw,\n\t\t\t\tvalidationErrors: [`duplicate record id '${result.record.id}'`],\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tif (seenFragmentIds.has(result.record.fragment.id)) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push({\n\t\t\t\tcode: \"duplicate-fragment-id\",\n\t\t\t\tmessage: \"agenticMemoryBundle: duplicate fragment id\",\n\t\t\t\tindex: i,\n\t\t\t\trecordId: result.record.id,\n\t\t\t\tfragmentId: result.record.fragment.id,\n\t\t\t\trecord: raw,\n\t\t\t\tvalidationErrors: [`duplicate fragment id '${result.record.fragment.id}'`],\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tseenRecordIds.add(result.record.id);\n\t\tseenFragmentIds.add(result.record.fragment.id);\n\t\trecords.push(result.record);\n\t\tfragments.push(result.record.fragment);\n\t\tmetadataByFragmentId[result.record.fragment.id] = recordMetadata(result.record);\n\t}\n\treturn { records, fragments, metadataByFragmentId, errors, invalidRecordIndexes };\n}\n\nfunction validateAndSnapshotRecord<T>(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly record?: AgenticMemoryRecord<T>;\n\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n} {\n\ttry {\n\t\treturn validateAndSnapshotRecordInner<T>(value, index);\n\t} catch (error) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-record\",\n\t\t\t\t\tmessage: `agenticMemoryBundle: record access failed: ${errorMessage(error)}`,\n\t\t\t\t\tindex,\n\t\t\t\t\trecord: value,\n\t\t\t\t\tvalidationErrors: Object.freeze([\"record access failed\"]),\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n}\n\nfunction validateAndSnapshotRecordInner<T>(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly record?: AgenticMemoryRecord<T>;\n\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n} {\n\tconst errors: Omit<AgenticMemoryError, \"cursor\">[] = [];\n\tif (typeof value !== \"object\" || value === null || Array.isArray(value)) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-record\",\n\t\t\t\t\tmessage: \"agenticMemoryBundle: record must be an object\",\n\t\t\t\t\tindex,\n\t\t\t\t\trecord: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst record = value as Partial<AgenticMemoryRecord<T>> & Record<string, unknown>;\n\tconst recordId = typeof record.id === \"string\" ? record.id : undefined;\n\tif (recordId === undefined || recordId.length === 0) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-record\",\n\t\t\tmessage: \"agenticMemoryBundle: record.id must be a non-empty string\",\n\t\t\tindex,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\"record.id must be a non-empty string\"],\n\t\t});\n\t}\n\tif (!isAgenticMemoryKind(record.kind)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-record-kind\",\n\t\t\tmessage: \"agenticMemoryBundle: record.kind is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\"kind must be one of working, episodic, semantic, procedural, profile\"],\n\t\t});\n\t}\n\tif (!isAgenticMemoryPersistenceLevel(record.persistenceLevel)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-persistence-level\",\n\t\t\tmessage: \"agenticMemoryBundle: record.persistenceLevel is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\n\t\t\t\t\"persistenceLevel must be one of turn, session, project, longTerm, permanent, archived\",\n\t\t\t],\n\t\t});\n\t}\n\tif (!isAgenticMemoryArtifactKind(record.artifactKind)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-artifact-kind\",\n\t\t\tmessage: \"agenticMemoryBundle: record.artifactKind is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\"artifactKind must be one of raw, insight, profile, procedure\"],\n\t\t});\n\t}\n\tconst scopeValidation = validateScope(record.scope);\n\tif (!scopeValidation.ok) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-scope\",\n\t\t\tmessage: \"agenticMemoryBundle: record.scope is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: Object.freeze(scopeValidation.errors),\n\t\t});\n\t}\n\tconst fragmentValidation = validateMemoryFragment(record.fragment);\n\tif (!fragmentValidation.ok) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-fragment\",\n\t\t\tmessage: \"agenticMemoryBundle: record.fragment is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\tfragmentId:\n\t\t\t\ttypeof record.fragment === \"object\" &&\n\t\t\t\trecord.fragment !== null &&\n\t\t\t\ttypeof (record.fragment as Partial<MemoryFragment>).id === \"string\"\n\t\t\t\t\t? (record.fragment as Partial<MemoryFragment>).id\n\t\t\t\t\t: undefined,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: Object.freeze([...fragmentValidation.errors]),\n\t\t});\n\t}\n\tconst forbiddenFields = [\n\t\t\"storageTier\",\n\t\t\"storageKey\",\n\t\t\"adapter\",\n\t\t\"collection\",\n\t\t\"collections\",\n\t\t\"ttl\",\n\t\t\"ttlMs\",\n\t\t\"ttlNs\",\n\t\t\"expiresAt\",\n\t\t\"timer\",\n\t\t\"scheduler\",\n\t\t\"schedule\",\n\t\t\"retentionTimer\",\n\t\t\"consolidationSchedule\",\n\t\t\"reflectionSchedule\",\n\t\t\"llm\",\n\t\t\"llmHandle\",\n\t\t\"tool\",\n\t\t\"toolHandle\",\n\t\t\"runner\",\n\t\t\"runnerHandle\",\n\t\t\"restore\",\n\t\t\"hydrate\",\n\t\t\"hydration\",\n\t\t\"graphMutation\",\n\t\t\"protocol\",\n\t] as const;\n\tconst presentForbidden = forbiddenFields.filter((field) => Object.hasOwn(record, field));\n\tif (presentForbidden.length > 0) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-record\",\n\t\t\tmessage: \"agenticMemoryBundle: record contains forbidden runtime/persistence fields\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: Object.freeze(\n\t\t\t\tpresentForbidden.map((field) => `${field} is not part of AgenticMemoryRecord`),\n\t\t\t),\n\t\t});\n\t}\n\tif (errors.length > 0) return { errors };\n\tconst scope = scopeValidation.scope;\n\tconst fragment = snapshotFragment(record.fragment as MemoryFragment<T>);\n\treturn {\n\t\trecord: Object.freeze({\n\t\t\tid: recordId as FactId,\n\t\t\tkind: record.kind as AgenticMemoryKind,\n\t\t\tpersistenceLevel: record.persistenceLevel as AgenticMemoryPersistenceLevel,\n\t\t\tartifactKind: record.artifactKind as AgenticMemoryArtifactKind,\n\t\t\t...(scope === undefined ? {} : { scope }),\n\t\t\tfragment,\n\t\t}),\n\t\terrors,\n\t};\n}\n\nfunction snapshotFragment<T>(fragment: MemoryFragment<T>): MemoryFragment<T> {\n\treturn Object.freeze({\n\t\tid: fragment.id,\n\t\tpayload: fragment.payload,\n\t\ttNs: fragment.tNs,\n\t\t...(fragment.validFrom === undefined ? {} : { validFrom: fragment.validFrom }),\n\t\t...(fragment.validTo === undefined ? {} : { validTo: fragment.validTo }),\n\t\tconfidence: fragment.confidence,\n\t\ttags: Object.freeze([...fragment.tags]),\n\t\tsources: Object.freeze([...fragment.sources]),\n\t\t...(fragment.embedding === undefined\n\t\t\t? {}\n\t\t\t: { embedding: Object.freeze([...fragment.embedding]) }),\n\t\t...(fragment.parentFragmentId === undefined\n\t\t\t? {}\n\t\t\t: { parentFragmentId: fragment.parentFragmentId }),\n\t\t...(fragment.provenance === undefined ? {} : { provenance: fragment.provenance }),\n\t});\n}\n\nfunction recordMetadata(record: AgenticMemoryRecord): AgenticMemoryRecordMetadata {\n\treturn Object.freeze({\n\t\trecordId: record.id,\n\t\tkind: record.kind,\n\t\tpersistenceLevel: record.persistenceLevel,\n\t\tartifactKind: record.artifactKind,\n\t\t...(record.scope === undefined ? {} : { scope: record.scope }),\n\t});\n}\n\nfunction validateRecordMetadata(value: unknown): {\n\treadonly ok: boolean;\n\treadonly metadata?: AgenticMemoryRecordMetadata;\n\treadonly errors: readonly string[];\n} {\n\tif (value === undefined) return { ok: true, errors: [] };\n\tif (!isPlainRecord(value)) {\n\t\treturn { ok: false, errors: [\"record metadata must be an object when present\"] };\n\t}\n\tconst errors: string[] = [];\n\tfor (const key of Object.keys(value)) {\n\t\tif (\n\t\t\tkey !== \"recordId\" &&\n\t\t\tkey !== \"kind\" &&\n\t\t\tkey !== \"persistenceLevel\" &&\n\t\t\tkey !== \"artifactKind\" &&\n\t\t\tkey !== \"scope\"\n\t\t) {\n\t\t\terrors.push(`record.${key} is not part of AgenticMemoryRecordMetadata`);\n\t\t}\n\t}\n\tif (!isNonEmptyString(value.recordId)) {\n\t\terrors.push(\"record.recordId must be a non-empty string\");\n\t}\n\tif (!isAgenticMemoryKind(value.kind)) {\n\t\terrors.push(\"record.kind is invalid\");\n\t}\n\tif (!isAgenticMemoryPersistenceLevel(value.persistenceLevel)) {\n\t\terrors.push(\"record.persistenceLevel is invalid\");\n\t}\n\tif (!isAgenticMemoryArtifactKind(value.artifactKind)) {\n\t\terrors.push(\"record.artifactKind is invalid\");\n\t}\n\tconst scopeValidation = validateScope(value.scope);\n\tif (!scopeValidation.ok) {\n\t\terrors.push(...scopeValidation.errors.map((error) => `record.${error}`));\n\t}\n\tif (errors.length > 0) return { ok: false, errors };\n\treturn {\n\t\tok: true,\n\t\terrors,\n\t\tmetadata: Object.freeze({\n\t\t\trecordId: value.recordId as FactId,\n\t\t\tkind: value.kind as AgenticMemoryKind,\n\t\t\tpersistenceLevel: value.persistenceLevel as AgenticMemoryPersistenceLevel,\n\t\t\tartifactKind: value.artifactKind as AgenticMemoryArtifactKind,\n\t\t\t...(scopeValidation.scope === undefined ? {} : { scope: scopeValidation.scope }),\n\t\t}),\n\t};\n}\n\nfunction contextState(\n\tprojection: AgenticMemoryStatusState,\n\tretrieval: MemoryRetrievalStatus[\"state\"],\n): AgenticMemoryContextState {\n\tif (projection === \"error\" || retrieval === \"error\") return \"error\";\n\tif (projection === \"partial\" || retrieval === \"partial\") return \"partial\";\n\treturn retrieval;\n}\n\nfunction agenticStatusState(errorCount: number, validRecords: number): AgenticMemoryStatusState {\n\tif (errorCount > 0 && validRecords === 0) return \"error\";\n\tif (errorCount > 0) return \"partial\";\n\treturn validRecords > 0 ? \"ready\" : \"empty\";\n}\n\nfunction isAgenticMemoryKind(value: unknown): value is AgenticMemoryKind {\n\treturn (\n\t\tvalue === \"working\" ||\n\t\tvalue === \"episodic\" ||\n\t\tvalue === \"semantic\" ||\n\t\tvalue === \"procedural\" ||\n\t\tvalue === \"profile\"\n\t);\n}\n\nfunction isAgenticMemoryPersistenceLevel(value: unknown): value is AgenticMemoryPersistenceLevel {\n\treturn (\n\t\tvalue === \"turn\" ||\n\t\tvalue === \"session\" ||\n\t\tvalue === \"project\" ||\n\t\tvalue === \"longTerm\" ||\n\t\tvalue === \"permanent\" ||\n\t\tvalue === \"archived\"\n\t);\n}\n\nfunction isAgenticMemoryArtifactKind(value: unknown): value is AgenticMemoryArtifactKind {\n\treturn value === \"raw\" || value === \"insight\" || value === \"profile\" || value === \"procedure\";\n}\n\nfunction validateScope(value: unknown): {\n\treadonly ok: boolean;\n\treadonly scope?: AgenticMemoryScope;\n\treadonly errors: readonly string[];\n} {\n\tif (value === undefined) return { ok: true, errors: [] };\n\tif (typeof value !== \"object\" || value === null || Array.isArray(value)) {\n\t\treturn { ok: false, errors: [\"scope must be an object when present\"] };\n\t}\n\tconst scope = value as Record<string, unknown>;\n\tconst errors: string[] = [];\n\tconst allowed = new Set([\"sessionId\", \"projectId\", \"userId\", \"tenantId\"]);\n\tfor (const key of Object.keys(scope)) {\n\t\tif (!allowed.has(key)) errors.push(`scope.${key} is not part of AgenticMemoryScope`);\n\t}\n\tfor (const key of allowed) {\n\t\tif (scope[key] !== undefined && (typeof scope[key] !== \"string\" || scope[key].length === 0)) {\n\t\t\terrors.push(`scope.${key} must be a non-empty string when present`);\n\t\t}\n\t}\n\tif (errors.length > 0) return { ok: false, errors };\n\treturn {\n\t\tok: true,\n\t\terrors,\n\t\tscope: Object.freeze({\n\t\t\t...(scope.sessionId === undefined ? {} : { sessionId: scope.sessionId as string }),\n\t\t\t...(scope.projectId === undefined ? {} : { projectId: scope.projectId as string }),\n\t\t\t...(scope.userId === undefined ? {} : { userId: scope.userId as string }),\n\t\t\t...(scope.tenantId === undefined ? {} : { tenantId: scope.tenantId as string }),\n\t\t}),\n\t};\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction ownKeys(value: Record<string, unknown>): readonly string[] {\n\treturn Object.keys(value).sort();\n}\n\nfunction assertExactKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = ownKeys(value);\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected fields ${actual.join(\",\")}`);\n\t}\n}\n\nfunction assertAgenticMemoryRecordCodecShape(value: unknown): void {\n\tif (!isPlainRecord(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: record must be an object\");\n\t}\n\tassertNoSymbolKeys(value, \"agenticMemoryRecordFrame.record\");\n\tassertExactKeys(\n\t\tvalue,\n\t\tvalue.scope === undefined\n\t\t\t? [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\"]\n\t\t\t: [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\", \"scope\"],\n\t\t\"agenticMemoryRecordFrame.record\",\n\t);\n\tconst fragment = value.fragment;\n\tif (!isPlainRecord(fragment)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: fragment must be an object\");\n\t}\n\tassertNoSymbolKeys(fragment, \"agenticMemoryRecordFrame.record.fragment\");\n\tassertExactKeys(\n\t\tfragment,\n\t\t[\n\t\t\t\"id\",\n\t\t\t\"payload\",\n\t\t\t\"tNs\",\n\t\t\t...(fragment.validFrom === undefined ? [] : [\"validFrom\"]),\n\t\t\t...(fragment.validTo === undefined ? [] : [\"validTo\"]),\n\t\t\t\"confidence\",\n\t\t\t\"tags\",\n\t\t\t\"sources\",\n\t\t\t...(fragment.embedding === undefined ? [] : [\"embedding\"]),\n\t\t\t...(fragment.parentFragmentId === undefined ? [] : [\"parentFragmentId\"]),\n\t\t\t...(fragment.provenance === undefined ? [] : [\"provenance\"]),\n\t\t],\n\t\t\"agenticMemoryRecordFrame.record.fragment\",\n\t);\n\tassertStrictJsonValue(fragment.tags, \"record.fragment.tags\");\n\tassertStrictJsonValue(fragment.sources, \"record.fragment.sources\");\n\tif (fragment.embedding !== undefined) {\n\t\tassertStrictJsonValue(fragment.embedding, \"record.fragment.embedding\");\n\t}\n\tif (value.scope !== undefined) assertScopeFrame(value.scope);\n}\n\nfunction assertNoSymbolKeys(value: object, label: string): void {\n\tif (Object.getOwnPropertySymbols(value).length > 0) {\n\t\tthrow new TypeError(`${label}: unexpected symbol fields`);\n\t}\n}\n\nfunction decimalBigIntString(value: bigint, label: string): string {\n\tconst out = value.toString(10);\n\tif (!/^-?(0|[1-9]\\d*)$/.test(out)) {\n\t\tthrow new TypeError(`${label} must encode as a canonical decimal bigint string`);\n\t}\n\treturn out;\n}\n\nfunction parseDecimalBigInt(value: unknown, label: string): bigint {\n\tif (typeof value !== \"string\" || !/^(0|-?[1-9]\\d*)$/.test(value)) {\n\t\tthrow new TypeError(`${label} must be a canonical decimal bigint string`);\n\t}\n\treturn BigInt(value);\n}\n\nfunction assertStrictJsonValue(value: unknown, label: string): StrictJsonValue {\n\ttry {\n\t\tstrictJsonCodec.encode(value);\n\t\treturn value as StrictJsonValue;\n\t} catch (error) {\n\t\tthrow new TypeError(`${label} must be strict JSON: ${errorMessage(error)}`);\n\t}\n}\n\nfunction assertScopeFrame(value: unknown): AgenticMemoryScope {\n\tif (!isPlainRecord(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: scope must be an object when present\");\n\t}\n\tassertStrictJsonValue(value, \"record.scope\");\n\tconst validation = validateScope(value);\n\tif (!validation.ok || validation.scope === undefined) {\n\t\tthrow new TypeError(`agenticMemoryRecordFrame: invalid scope: ${validation.errors.join(\"; \")}`);\n\t}\n\tassertExactKeys(\n\t\tvalue as Record<string, unknown>,\n\t\t[\n\t\t\t...((value as Record<string, unknown>).sessionId === undefined ? [] : [\"sessionId\"]),\n\t\t\t...((value as Record<string, unknown>).projectId === undefined ? [] : [\"projectId\"]),\n\t\t\t...((value as Record<string, unknown>).userId === undefined ? [] : [\"userId\"]),\n\t\t\t...((value as Record<string, unknown>).tenantId === undefined ? [] : [\"tenantId\"]),\n\t\t],\n\t\t\"agenticMemoryRecordFrame.record.scope\",\n\t);\n\treturn validation.scope;\n}\n\nfunction assertKindValue(value: unknown): AgenticMemoryKind {\n\tif (!isAgenticMemoryKind(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid memory kind\");\n\t}\n\treturn value;\n}\n\nfunction assertPersistenceLevelValue(value: unknown): AgenticMemoryPersistenceLevel {\n\tif (!isAgenticMemoryPersistenceLevel(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid persistence level\");\n\t}\n\treturn value;\n}\n\nfunction assertArtifactKindValue(value: unknown): AgenticMemoryArtifactKind {\n\tif (!isAgenticMemoryArtifactKind(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid artifact kind\");\n\t}\n\treturn value;\n}\n\nfunction assertNonEmptyString(value: unknown, label: string): string {\n\tif (!isNonEmptyString(value)) throw new TypeError(`${label} must be a non-empty string`);\n\treturn value;\n}\n\nfunction assertString(value: unknown, label: string): string {\n\tif (typeof value !== \"string\") throw new TypeError(`${label} must be a string`);\n\treturn value;\n}\n\nfunction assertConfidence(value: unknown, label: string): number {\n\tif (!Number.isFinite(value) || (value as number) < 0 || (value as number) > 1) {\n\t\tthrow new TypeError(`${label} must be a finite number in [0, 1]`);\n\t}\n\treturn value as number;\n}\n\nfunction assertStringArray(value: unknown, label: string): readonly string[] {\n\tif (!isDenseArrayOf(value, (item): item is string => typeof item === \"string\")) {\n\t\tthrow new TypeError(`${label} must be a readonly string array`);\n\t}\n\treturn Object.freeze([...value]);\n}\n\nfunction assertFiniteNumberArray(value: unknown, label: string): readonly number[] {\n\tif (!isDenseArrayOf(value, (item): item is number => Number.isFinite(item))) {\n\t\tthrow new TypeError(`${label} must be a finite number array`);\n\t}\n\treturn Object.freeze([...value]);\n}\n\nfunction isNonEmptyString(value: unknown): value is string {\n\treturn typeof value === \"string\" && value.length > 0;\n}\n\nfunction isDenseArrayOf<T>(value: unknown, predicate: (item: unknown) => item is T): value is T[] {\n\tif (!Array.isArray(value)) return false;\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i) || !predicate(value[i])) return false;\n\t}\n\treturn true;\n}\n\nfunction freezeError<T extends { readonly validationErrors?: readonly string[] }>(error: T): T {\n\treturn Object.freeze({\n\t\t...error,\n\t\t...(error.validationErrors === undefined\n\t\t\t? {}\n\t\t\t: { validationErrors: Object.freeze([...error.validationErrors]) }),\n\t}) as T;\n}\n\nfunction safeArrayLength(value: readonly unknown[]): number | undefined {\n\ttry {\n\t\treturn value.length;\n\t} catch {\n\t\treturn undefined;\n\t}\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","import type { DeliveryMeta } from \"../ctx/types.js\";\nimport { assertGraphLocalNode, type Graph, type StateNode } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport {\n\ttype AgenticMemoryRecord,\n\ttype AgenticMemoryRecordFrame,\n\ttype AgenticMemoryStrictJsonValue,\n\tagenticMemoryRecordCodec,\n\tagenticMemoryRecordFrame,\n\tagenticMemoryRecordFrameCodec,\n\tassertAgenticMemoryRecordFrame,\n} from \"../solutions/index.js\";\nimport type { AppendLogEntry, AppendLogStorageTier, KvStorageTier } from \"../storage/index.js\";\n\nexport const AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT =\n\t\"graphrefly.agenticMemory.records.snapshot\" as const;\nexport const AGENTIC_MEMORY_RECORD_CHANGE_FORMAT =\n\t\"graphrefly.agenticMemory.records.change\" as const;\nexport const AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION = 1 as const;\n\nexport interface AgenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION;\n\treadonly changeCursor: number;\n\treadonly records: readonly AgenticMemoryRecordFrame<TJson>[];\n}\n\nexport interface AgenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_CHANGE_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION;\n\treadonly change: {\n\t\treadonly kind: \"replaceAll\";\n\t\treadonly records: readonly AgenticMemoryRecordFrame<TJson>[];\n\t};\n}\n\nexport interface AgenticMemoryRecordsRestoreState<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly records: readonly AgenticMemoryRecord<TJson>[];\n\treadonly source: \"empty\" | \"changes\" | \"snapshot\" | \"snapshot+changes\";\n\treadonly snapshot: { readonly found: boolean; readonly changeCursor: number };\n\treadonly changes: { readonly applied: number; readonly cursor: number };\n}\n\nexport interface LoadAgenticMemoryRecordsStateOptions {\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n}\n\nexport interface AgenticMemoryRecordsPersistenceCursor {\n\treadonly kind: \"persistence.cursor\";\n\treadonly changeSeq: number;\n\treadonly snapshotWrites: number;\n\treadonly changeWrites: number;\n}\n\nexport interface AgenticMemoryRecordsPersistenceStatus {\n\treadonly state: \"starting\" | \"ready\" | \"flushing\" | \"errored\" | \"disposed\";\n\treadonly pending: number;\n\treadonly writes: number;\n\treadonly errors: number;\n\treadonly cursor: AgenticMemoryRecordsPersistenceCursor;\n}\n\nexport interface AgenticMemoryRecordsPersistenceError {\n\treadonly phase: \"snapshot\" | \"change\";\n\treadonly message: string;\n\treadonly cursor: AgenticMemoryRecordsPersistenceCursor;\n}\n\nexport interface PersistAgenticMemoryRecordsOptions {\n\treadonly name?: string;\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n\treadonly initialChangeCursor?: number;\n\treadonly snapshotOnAttach?: boolean;\n\treadonly snapshotEveryChanges?: number;\n}\n\nexport interface AgenticMemoryRecordsPersistenceHandle {\n\treadonly ready: StateNode<boolean>;\n\treadonly status: StateNode<AgenticMemoryRecordsPersistenceStatus>;\n\treadonly error: StateNode<AgenticMemoryRecordsPersistenceError | null>;\n\treadonly cursor: StateNode<AgenticMemoryRecordsPersistenceCursor>;\n\tflush(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n\tsnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n\tdispose(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n}\n\nexport interface OpenPersistentAgenticMemoryRecordsOptions<\n\tTJson extends AgenticMemoryStrictJsonValue,\n> extends LoadAgenticMemoryRecordsStateOptions,\n\t\tOmit<\n\t\t\tPersistAgenticMemoryRecordsOptions,\n\t\t\t\"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly AgenticMemoryRecord<TJson>[];\n}\n\nexport interface PersistentAgenticMemoryRecords<TJson extends AgenticMemoryStrictJsonValue> {\n\treadonly records: StateNode<readonly AgenticMemoryRecord<TJson>[]>;\n\treadonly persistence: AgenticMemoryRecordsPersistenceHandle;\n\treadonly loaded: AgenticMemoryRecordsRestoreState<TJson>;\n}\n\ninterface QueueItem {\n\treadonly phase: \"snapshot\" | \"change\" | \"flush\" | \"dispose\";\n\treadonly done?: (status: AgenticMemoryRecordsPersistenceStatus) => void;\n\trun(): void | PromiseLike<void>;\n}\n\nexport function agenticMemoryRecordsSnapshotKey(storagePrefix = \"agentic-memory\"): string {\n\tif (storagePrefix.length === 0) throw new TypeError(\"storagePrefix must be non-empty\");\n\treturn `${storagePrefix}/records.snapshot`;\n}\n\nexport function agenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\trecords: readonly AgenticMemoryRecord<TJson>[],\n\topts: { readonly changeCursor?: number } = {},\n): AgenticMemoryRecordSnapshotFrame<TJson> {\n\tconst changeCursor = validateChangeCursor(opts.changeCursor ?? -1);\n\treturn assertAgenticMemoryRecordSnapshotFrame({\n\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchangeCursor,\n\t\trecords: records.map((record) => agenticMemoryRecordFrame(record)),\n\t});\n}\n\nexport function agenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(records: readonly AgenticMemoryRecord<TJson>[]): AgenticMemoryRecordChangeFrame<TJson> {\n\treturn assertAgenticMemoryRecordChangeFrame({\n\t\tformat: AGENTIC_MEMORY_RECORD_CHANGE_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchange: {\n\t\t\tkind: \"replaceAll\",\n\t\t\trecords: records.map((record) => agenticMemoryRecordFrame(record)),\n\t\t},\n\t});\n}\n\nexport function assertAgenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(value: unknown): AgenticMemoryRecordSnapshotFrame<TJson> {\n\tif (!isPlainRecord(value)) throw new TypeError(\"agentic memory snapshot frame must be an object\");\n\tassertKeys(\n\t\tvalue,\n\t\t[\"changeCursor\", \"format\", \"records\", \"version\"],\n\t\t\"agentic memory snapshot frame\",\n\t);\n\tif (value.format !== AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: invalid version\");\n\t}\n\tconst changeCursor = validateChangeCursor(value.changeCursor);\n\tif (!Array.isArray(value.records)) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: records must be an array\");\n\t}\n\tconst records = assertDenseRecordFrames<TJson>(\n\t\tvalue.records,\n\t\t\"agentic memory snapshot frame records\",\n\t);\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchangeCursor,\n\t\trecords: Object.freeze(records),\n\t});\n}\n\nexport function assertAgenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(value: unknown): AgenticMemoryRecordChangeFrame<TJson> {\n\tif (!isPlainRecord(value)) throw new TypeError(\"agentic memory change frame must be an object\");\n\tassertKeys(value, [\"change\", \"format\", \"version\"], \"agentic memory change frame\");\n\tif (value.format !== AGENTIC_MEMORY_RECORD_CHANGE_FORMAT) {\n\t\tthrow new TypeError(\"agentic memory change frame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agentic memory change frame: invalid version\");\n\t}\n\tif (!isPlainRecord(value.change)) {\n\t\tthrow new TypeError(\"agentic memory change frame: change must be an object\");\n\t}\n\tassertKeys(value.change, [\"kind\", \"records\"], \"agentic memory change frame change\");\n\tif (value.change.kind !== \"replaceAll\") {\n\t\tthrow new TypeError(\"agentic memory change frame: change.kind must be replaceAll\");\n\t}\n\tif (!Array.isArray(value.change.records)) {\n\t\tthrow new TypeError(\"agentic memory change frame: change.records must be an array\");\n\t}\n\tconst records = assertDenseRecordFrames<TJson>(\n\t\tvalue.change.records,\n\t\t\"agentic memory change frame records\",\n\t);\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_CHANGE_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchange: Object.freeze({\n\t\t\tkind: \"replaceAll\",\n\t\t\trecords: Object.freeze(records),\n\t\t}),\n\t});\n}\n\nexport function loadAgenticMemoryRecordsState<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(opts: LoadAgenticMemoryRecordsStateOptions): Promise<AgenticMemoryRecordsRestoreState<TJson>> {\n\tconst storagePrefix = opts.storagePrefix ?? \"agentic-memory\";\n\tconst snapshotKey = opts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(storagePrefix);\n\treturn opts.snapshotStore.get(snapshotKey).then((rawSnapshot) => {\n\t\tlet records: readonly AgenticMemoryRecord<TJson>[] = [];\n\t\tlet source: AgenticMemoryRecordsRestoreState<TJson>[\"source\"] = \"empty\";\n\t\tlet changeCursor = -1;\n\t\tif (rawSnapshot !== undefined) {\n\t\t\tconst snapshot = assertAgenticMemoryRecordSnapshotFrame<TJson>(rawSnapshot);\n\t\t\trecords = snapshot.records.map(recordFromFrame);\n\t\t\tchangeCursor = snapshot.changeCursor;\n\t\t\tsource = \"snapshot\";\n\t\t}\n\t\tif (opts.changeLog === undefined) {\n\t\t\treturn {\n\t\t\t\trecords,\n\t\t\t\tsource,\n\t\t\t\tsnapshot: { found: rawSnapshot !== undefined, changeCursor },\n\t\t\t\tchanges: { applied: 0, cursor: changeCursor },\n\t\t\t};\n\t\t}\n\t\treturn opts.changeLog.read({ after: changeCursor }).then((entries) => {\n\t\t\tlet applied = 0;\n\t\t\tlet cursor = changeCursor;\n\t\t\tfor (const entry of entries) {\n\t\t\t\tif (entry.seq !== cursor + 1) {\n\t\t\t\t\tthrow new Error(\"agentic memory records change log is non-contiguous\");\n\t\t\t\t}\n\t\t\t\tconst change = assertAgenticMemoryRecordChangeFrame<TJson>(entry.value);\n\t\t\t\trecords = change.change.records.map(recordFromFrame);\n\t\t\t\tcursor = entry.seq;\n\t\t\t\tapplied += 1;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\trecords,\n\t\t\t\tsource:\n\t\t\t\t\trawSnapshot !== undefined && applied > 0\n\t\t\t\t\t\t? \"snapshot+changes\"\n\t\t\t\t\t\t: rawSnapshot !== undefined\n\t\t\t\t\t\t\t? \"snapshot\"\n\t\t\t\t\t\t\t: applied > 0\n\t\t\t\t\t\t\t\t? \"changes\"\n\t\t\t\t\t\t\t\t: \"empty\",\n\t\t\t\tsnapshot: { found: rawSnapshot !== undefined, changeCursor },\n\t\t\t\tchanges: { applied, cursor },\n\t\t\t};\n\t\t});\n\t});\n}\n\nexport function persistAgenticMemoryRecords<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\tgraph: Graph,\n\trecords: Node<readonly AgenticMemoryRecord<TJson>[]>,\n\topts: PersistAgenticMemoryRecordsOptions,\n): AgenticMemoryRecordsPersistenceHandle {\n\tconst name = opts.name ?? \"agenticMemoryRecords.persistence\";\n\tconst snapshotKey =\n\t\topts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(opts.storagePrefix ?? name);\n\tconst snapshotEveryChanges = validateSnapshotEveryChanges(opts.snapshotEveryChanges);\n\tassertGraphLocalNode(graph, records as Node<unknown>, `${name}.records`);\n\tlet cursorValue: AgenticMemoryRecordsPersistenceCursor = {\n\t\tkind: \"persistence.cursor\",\n\t\tchangeSeq: validateChangeCursor(opts.initialChangeCursor ?? -1),\n\t\tsnapshotWrites: 0,\n\t\tchangeWrites: 0,\n\t};\n\tlet statusValue = statusOf(\"starting\", 0, 0, 0, cursorValue);\n\tlet errorCount = 0;\n\tlet writes = 0;\n\tlet running = false;\n\tlet disposed = false;\n\tlet disposeRequested = false;\n\tlet subscribing = true;\n\tlet observedChangesSinceSnapshot = 0;\n\tlet latestRecords: readonly AgenticMemoryRecord<TJson>[] = records.cache ?? [];\n\tlet stop: (() => void) | undefined;\n\tconst queue: QueueItem[] = [];\n\tconst ready = graph.state(false, { name: `${name}/ready` });\n\tconst status = graph.state<AgenticMemoryRecordsPersistenceStatus>(statusValue, {\n\t\tname: `${name}/status`,\n\t});\n\tconst error = graph.state<AgenticMemoryRecordsPersistenceError | null>(null, {\n\t\tname: `${name}/error`,\n\t});\n\tconst cursor = graph.state<AgenticMemoryRecordsPersistenceCursor>(cursorValue, {\n\t\tname: `${name}/cursor`,\n\t});\n\n\tfunction publish(state: AgenticMemoryRecordsPersistenceStatus[\"state\"]): void {\n\t\tconst nextState = statusValue.state === \"errored\" && state !== \"disposed\" ? \"errored\" : state;\n\t\tstatusValue = statusOf(\n\t\t\tnextState,\n\t\t\tqueue.length + (running ? 1 : 0),\n\t\t\twrites,\n\t\t\terrorCount,\n\t\t\tcursorValue,\n\t\t);\n\t\tcursor.set(cursorValue);\n\t\tstatus.set(statusValue);\n\t\tif (nextState === \"ready\") ready.set(true);\n\t\tif (nextState === \"errored\" || nextState === \"disposed\") ready.set(false);\n\t}\n\n\tfunction report(phase: \"snapshot\" | \"change\", caught: unknown): void {\n\t\terrorCount += 1;\n\t\terror.set({ phase, message: errorMessage(caught), cursor: cursorValue });\n\t}\n\n\tfunction callDone(done: QueueItem[\"done\"]): void {\n\t\ttry {\n\t\t\tdone?.(statusValue);\n\t\t} catch {\n\t\t\t// Done callbacks are advisory controls and must not wedge the adapter queue.\n\t\t}\n\t}\n\n\tfunction finish(item: QueueItem): void {\n\t\tif (item.phase === \"dispose\") {\n\t\t\tdisposed = true;\n\t\t\trunning = false;\n\t\t\tpublish(\"disposed\");\n\t\t} else if (statusValue.state !== \"errored\") {\n\t\t\trunning = false;\n\t\t\tpublish(\"ready\");\n\t\t} else {\n\t\t\trunning = false;\n\t\t\tpublish(\"errored\");\n\t\t}\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction fail(item: QueueItem, caught: unknown): void {\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") report(item.phase, caught);\n\t\trunning = false;\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") publish(\"errored\");\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction chainThenable(item: QueueItem, value: unknown): boolean {\n\t\tif ((typeof value !== \"object\" && typeof value !== \"function\") || value === null) return false;\n\t\tconst then = (value as { then?: unknown }).then;\n\t\tif (typeof then !== \"function\") return false;\n\t\tlet settled = false;\n\t\tconst settle = (next: () => void) => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tnext();\n\t\t};\n\t\ttry {\n\t\t\t(then as (onFulfilled: () => void, onRejected: (error: unknown) => void) => unknown).call(\n\t\t\t\tvalue,\n\t\t\t\t() => settle(() => finish(item)),\n\t\t\t\t(caught) => settle(() => fail(item, caught)),\n\t\t\t);\n\t\t} catch (caught) {\n\t\t\tsettle(() => fail(item, caught));\n\t\t}\n\t\treturn true;\n\t}\n\n\tfunction enqueue(item: QueueItem): void {\n\t\tif (disposed || (disposeRequested && item.phase !== \"dispose\" && item.phase !== \"flush\")) {\n\t\t\tcallDone(item.done);\n\t\t\treturn;\n\t\t}\n\t\tqueue.push(item);\n\t\tdrain();\n\t}\n\n\tfunction drain(): void {\n\t\tif (running) return;\n\t\tconst item = queue.shift();\n\t\tif (item === undefined) return;\n\t\trunning = true;\n\t\tpublish(\n\t\t\titem.phase === \"flush\" ? \"flushing\" : statusValue.state === \"starting\" ? \"starting\" : \"ready\",\n\t\t);\n\t\tlet result: void | PromiseLike<void>;\n\t\ttry {\n\t\t\tresult = item.run();\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn;\n\t\t}\n\t\tif (chainThenable(item, result)) return;\n\t\tfinish(item);\n\t}\n\n\tfunction enqueueSnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\tconst snapshotRecords = latestRecords;\n\t\tobservedChangesSinceSnapshot = 0;\n\t\tenqueue({\n\t\t\tphase: \"snapshot\",\n\t\t\tdone,\n\t\t\trun() {\n\t\t\t\tconst records = Object.freeze(\n\t\t\t\t\tsnapshotRecords.map((record) => agenticMemoryRecordFrame(record)),\n\t\t\t\t);\n\t\t\t\tconst frame = assertAgenticMemoryRecordSnapshotFrame<TJson>({\n\t\t\t\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\t\t\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\t\t\t\tchangeCursor: cursorValue.changeSeq,\n\t\t\t\t\trecords,\n\t\t\t\t});\n\t\t\t\treturn opts.snapshotStore.set(snapshotKey, frame).then(() => {\n\t\t\t\t\tcursorValue = { ...cursorValue, snapshotWrites: cursorValue.snapshotWrites + 1 };\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction enqueueChange(nextRecords: readonly AgenticMemoryRecord<TJson>[]): void {\n\t\tconst changeLog = opts.changeLog;\n\t\tif (changeLog === undefined) return;\n\t\tenqueue({\n\t\t\tphase: \"change\",\n\t\t\trun() {\n\t\t\t\tconst frame = agenticMemoryRecordChangeFrame(nextRecords);\n\t\t\t\treturn changeLog.append(frame).then((written) => {\n\t\t\t\t\tconst entry = written as AppendLogEntry<AgenticMemoryRecordChangeFrame<TJson>>;\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tchangeSeq: entry.seq,\n\t\t\t\t\t\tchangeWrites: cursorValue.changeWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction cancelQueuedForDispose(): void {\n\t\tconst pending = queue.splice(0);\n\t\tfor (const item of pending) callDone(item.done);\n\t}\n\n\tstop = records.subscribe((msg: Message, delivery?: DeliveryMeta) => {\n\t\tif (disposeRequested) return;\n\t\tconst nextRecords = dataOf<readonly AgenticMemoryRecord<TJson>[]>(msg);\n\t\tif (nextRecords === undefined) return;\n\t\tlatestRecords = nextRecords;\n\t\tif (subscribing && delivery === undefined) return;\n\t\tobservedChangesSinceSnapshot += 1;\n\t\tenqueueChange(nextRecords);\n\t\tif (\n\t\t\tsnapshotEveryChanges !== undefined &&\n\t\t\tobservedChangesSinceSnapshot >= snapshotEveryChanges\n\t\t) {\n\t\t\tenqueueSnapshot();\n\t\t}\n\t});\n\tsubscribing = false;\n\tif (opts.snapshotOnAttach !== false) enqueueSnapshot();\n\telse publish(\"ready\");\n\n\treturn {\n\t\tready,\n\t\tstatus,\n\t\terror,\n\t\tcursor,\n\t\tflush(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueue({ phase: \"flush\", done, run: () => undefined });\n\t\t},\n\t\tsnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed || disposeRequested) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueueSnapshot(done);\n\t\t},\n\t\tdispose(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdisposeRequested = true;\n\t\t\tstop?.();\n\t\t\tcancelQueuedForDispose();\n\t\t\tenqueue({ phase: \"dispose\", done, run: () => undefined });\n\t\t},\n\t};\n}\n\nexport function openPersistentAgenticMemoryRecords<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\topts: OpenPersistentAgenticMemoryRecordsOptions<TJson>,\n): Promise<PersistentAgenticMemoryRecords<TJson>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"agentic-memory\";\n\tconst snapshotKey = opts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(storagePrefix);\n\treturn loadAgenticMemoryRecordsState<TJson>({ ...opts, snapshotKey, storagePrefix }).then(\n\t\t(loaded) => {\n\t\t\tconst records =\n\t\t\t\tloaded.source === \"empty\" && opts.initial !== undefined ? opts.initial : loaded.records;\n\t\t\tconst node = opts.graph.state<readonly AgenticMemoryRecord<TJson>[]>(records, {\n\t\t\t\tname: opts.name,\n\t\t\t});\n\t\t\tconst persistence = persistAgenticMemoryRecords(opts.graph, node, {\n\t\t\t\t...opts,\n\t\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\t\tsnapshotKey,\n\t\t\t\tstoragePrefix,\n\t\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t\t});\n\t\t\treturn { records: node, persistence, loaded };\n\t\t},\n\t);\n}\n\nfunction recordFromFrame<TJson extends AgenticMemoryStrictJsonValue>(\n\tframe: AgenticMemoryRecordFrame<TJson>,\n): AgenticMemoryRecord<TJson> {\n\treturn agenticMemoryRecordCodec<TJson>().decode(\n\t\tagenticMemoryRecordFrameCodec<TJson>().encode(frame),\n\t);\n}\n\nfunction statusOf(\n\tstate: AgenticMemoryRecordsPersistenceStatus[\"state\"],\n\tpending: number,\n\twrites: number,\n\terrors: number,\n\tcursor: AgenticMemoryRecordsPersistenceCursor,\n): AgenticMemoryRecordsPersistenceStatus {\n\treturn { state, pending, writes, errors, cursor };\n}\n\nfunction dataOf<C>(msg: Message): C | undefined {\n\treturn msg[0] === \"DATA\" ? (msg[1] as C) : undefined;\n}\n\nfunction validateChangeCursor(value: unknown): number {\n\tif (typeof value !== \"number\" || !Number.isSafeInteger(value) || value < -1) {\n\t\tthrow new RangeError(\"changeCursor must be a safe integer >= -1\");\n\t}\n\treturn value;\n}\n\nfunction validateSnapshotEveryChanges(value: number | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tif (!Number.isSafeInteger(value) || value < 1) {\n\t\tthrow new RangeError(\"snapshotEveryChanges must be a positive safe integer\");\n\t}\n\treturn value;\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction assertKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = Object.keys(value).sort();\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected frame fields ${actual.join(\",\")}`);\n\t}\n}\n\nfunction assertDenseRecordFrames<TJson extends AgenticMemoryStrictJsonValue>(\n\tvalue: readonly unknown[],\n\tlabel: string,\n): readonly AgenticMemoryRecordFrame<TJson>[] {\n\tconst records: AgenticMemoryRecordFrame<TJson>[] = [];\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i)) {\n\t\t\tthrow new TypeError(`${label}: sparse array hole at ${i}`);\n\t\t}\n\t\trecords.push(assertAgenticMemoryRecordFrame<TJson>(value[i]));\n\t}\n\treturn Object.freeze(records);\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","/**\n * Passive resilience policy helpers for graph-visible adapters (D130/D132).\n *\n * These helpers never schedule work and never own graph state. Drivers/adapters\n * consume them, while graph-visible bundles expose attempts/status/errors.\n */\n\nexport type BackoffPolicy =\n\t| { readonly kind: \"none\" }\n\t| { readonly kind: \"constant\"; readonly delayMs: number }\n\t| {\n\t\t\treadonly kind: \"linear\";\n\t\t\treadonly initialMs: number;\n\t\t\treadonly stepMs: number;\n\t\t\treadonly maxMs?: number;\n\t  }\n\t| {\n\t\t\treadonly kind: \"exponential\";\n\t\t\treadonly initialMs: number;\n\t\t\treadonly factor: number;\n\t\t\treadonly maxMs?: number;\n\t  }\n\t| { readonly kind: \"fibonacci\"; readonly unitMs: number; readonly maxMs?: number };\n\nexport interface RetryPolicy {\n\t/** Total attempts including the first try. */\n\treadonly maxAttempts: number;\n\treadonly backoff: BackoffPolicy;\n}\n\nexport type RetryState = \"idle\" | \"running\" | \"waiting\" | \"succeeded\" | \"failed\" | \"exhausted\";\n\nexport interface RetryStatus {\n\treadonly attempt: number;\n\treadonly maxAttempts: number;\n\treadonly delayMs?: number;\n\treadonly state: RetryState;\n}\n\nexport const noBackoff: BackoffPolicy = Object.freeze({ kind: \"none\" });\n\nexport function retryPolicy(maxAttempts = 1, backoff: BackoffPolicy = noBackoff): RetryPolicy {\n\tif (!Number.isInteger(maxAttempts) || maxAttempts <= 0) {\n\t\tthrow new RangeError(\"retryPolicy: maxAttempts must be a positive integer\");\n\t}\n\treturn Object.freeze({ maxAttempts, backoff });\n}\n\nexport function shouldRetry(policy: RetryPolicy, failedAttempt: number): boolean {\n\treturn failedAttempt < policy.maxAttempts;\n}\n\nexport function nextRetryDelayMs(policy: RetryPolicy, nextAttempt: number): number | undefined {\n\tif (!Number.isInteger(nextAttempt) || nextAttempt <= 0 || nextAttempt > policy.maxAttempts) {\n\t\treturn undefined;\n\t}\n\treturn backoffDelayMs(policy.backoff, nextAttempt);\n}\n\nexport function backoffDelayMs(policy: BackoffPolicy, attempt: number): number {\n\tconst safeAttempt = Math.max(1, Math.trunc(attempt));\n\tswitch (policy.kind) {\n\t\tcase \"none\":\n\t\t\treturn 0;\n\t\tcase \"constant\":\n\t\t\treturn nonNegative(policy.delayMs);\n\t\tcase \"linear\":\n\t\t\treturn cap(\n\t\t\t\tnonNegative(policy.initialMs) + nonNegative(policy.stepMs) * (safeAttempt - 1),\n\t\t\t\tpolicy.maxMs,\n\t\t\t);\n\t\tcase \"exponential\": {\n\t\t\tconst factor = Math.max(1, Math.trunc(policy.factor));\n\t\t\treturn cap(nonNegative(policy.initialMs) * factor ** (safeAttempt - 1), policy.maxMs);\n\t\t}\n\t\tcase \"fibonacci\":\n\t\t\treturn cap(nonNegative(policy.unitMs) * fibonacci(safeAttempt), policy.maxMs);\n\t}\n}\n\nfunction cap(value: number, max: number | undefined): number {\n\tif (max === undefined) return value;\n\treturn Math.min(value, nonNegative(max));\n}\n\nfunction nonNegative(value: number): number {\n\tif (!Number.isFinite(value)) return 0;\n\treturn Math.max(0, value);\n}\n\nfunction fibonacci(n: number): number {\n\tif (n <= 1) return 1;\n\tlet prev = 1;\n\tlet curr = 1;\n\tfor (let i = 2; i <= n; i += 1) {\n\t\tconst next = prev + curr;\n\t\tprev = curr;\n\t\tcurr = next;\n\t}\n\treturn curr;\n}\n","/**\n * Graph-visible wire bridge envelope helpers (D134).\n *\n * This first slice is transport-free: commands become outbound envelope facts,\n * remote receipts enter only through the inbound fact node, and retry/ack timeout\n * state is surfaced through graph-visible attempts/status/errors nodes.\n */\n\nimport { type Ctx, depBatch } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport {\n\tnextRetryDelayMs,\n\ttype RetryPolicy,\n\tretryPolicy,\n\tshouldRetry,\n} from \"../graph/resilience.js\";\nimport type { Node } from \"../node/node.js\";\nimport { errorPayload, type Wave } from \"../protocol/messages.js\";\n\nexport type WireBridgeEnvelopeType =\n\t| \"start\"\n\t| \"data\"\n\t| \"ack\"\n\t| \"nack\"\n\t| \"status\"\n\t| \"error\"\n\t| \"close\";\n\nexport interface WireBridgeMetadata {\n\t/** Monotonic envelope sequence within the bridge session. */\n\treadonly seq: number;\n\t/** Monotonic accepted inbound cursor observed by the sending side. */\n\treadonly cursor: number;\n\t/** D151: correlation/idempotency metadata, not an authoritative duplicate lookup key. */\n\treadonly idempotencyKey: string;\n\treadonly attempt: number;\n\treadonly maxAttempts: number;\n\treadonly timestampMs?: number;\n\t/** D151 ack/nack correlation target; receipt duplicate recognition still uses seq/cursor. */\n\treadonly ackForSeq?: number;\n\treadonly requestId?: string;\n}\n\nexport type WireBridgePayload<TData = unknown> =\n\t| { readonly kind: \"data\"; readonly value: TData }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"status\"; readonly status: unknown }\n\t| { readonly kind: \"close\"; readonly reason?: unknown };\n\nexport interface WireBridgeEnvelope<TData = unknown> {\n\treadonly sessionId: string;\n\treadonly type: WireBridgeEnvelopeType;\n\treadonly payload?: WireBridgePayload<TData>;\n\treadonly metadata: WireBridgeMetadata;\n}\n\nexport type WireBridgeCommand<TData = unknown> =\n\t| { readonly kind: \"start\"; readonly idempotencyKey?: string; readonly requestId?: string }\n\t| {\n\t\t\treadonly kind: \"send\";\n\t\t\treadonly payload: TData;\n\t\t\treadonly idempotencyKey?: string;\n\t\t\treadonly requestId?: string;\n\t  }\n\t| {\n\t\t\treadonly kind: \"ack\";\n\t\t\treadonly ackForSeq: number;\n\t\t\treadonly idempotencyKey?: string;\n\t\t\treadonly requestId?: string;\n\t  }\n\t| {\n\t\t\treadonly kind: \"nack\";\n\t\t\treadonly ackForSeq: number;\n\t\t\treadonly error: unknown;\n\t\t\treadonly idempotencyKey?: string;\n\t\t\treadonly requestId?: string;\n\t  }\n\t| { readonly kind: \"close\"; readonly reason?: unknown; readonly idempotencyKey?: string };\n\nexport type WireBridgeEvent<TOutbound = unknown, TInbound = unknown> =\n\t| {\n\t\t\treadonly kind: \"outbound\";\n\t\t\treadonly envelope: WireBridgeEnvelope<TOutbound>;\n\t  }\n\t| {\n\t\t\treadonly kind: \"inbound\";\n\t\t\treadonly envelope: WireBridgeEnvelope<TInbound>;\n\t  }\n\t| {\n\t\t\treadonly kind: \"ack\";\n\t\t\treadonly ackForSeq: number;\n\t\t\treadonly envelope: WireBridgeEnvelope<TInbound>;\n\t\t\treadonly outbound: WireBridgeEnvelope<TOutbound>;\n\t  }\n\t| {\n\t\t\treadonly kind: \"nack\";\n\t\t\treadonly ackForSeq: number;\n\t\t\treadonly envelope: WireBridgeEnvelope<TInbound>;\n\t\t\treadonly outbound: WireBridgeEnvelope<TOutbound>;\n\t\t\treadonly error: unknown;\n\t  }\n\t| { readonly kind: \"timeout\"; readonly seq: number; readonly attempt: number }\n\t| {\n\t\t\treadonly kind: \"retry\";\n\t\t\treadonly seq: number;\n\t\t\treadonly attempt: number;\n\t\t\treadonly delayMs: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| {\n\t\t\treadonly kind: \"exhausted\";\n\t\t\treadonly seq: number;\n\t\t\treadonly attempt: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| { readonly kind: \"cursor\"; readonly cursor: number }\n\t| { readonly kind: \"duplicate\"; readonly seq: number; readonly cursor: number }\n\t| { readonly kind: \"out-of-order\"; readonly seq: number; readonly expected: number }\n\t| { readonly kind: \"session-mismatch\"; readonly expected: string; readonly actual: string }\n\t| { readonly kind: \"late-receipt\"; readonly receipt: \"ack\" | \"nack\"; readonly ackForSeq: number }\n\t| { readonly kind: \"invalid\"; readonly error: string };\n\nexport interface WireBridgeAck {\n\treadonly ackForSeq: number;\n\treadonly envelope: WireBridgeEnvelope;\n}\n\nexport interface WireBridgeNack {\n\treadonly ackForSeq: number;\n\treadonly envelope: WireBridgeEnvelope;\n\treadonly error: unknown;\n}\n\nexport interface WireBridgeAttempt {\n\treadonly seq: number;\n\treadonly attempt: number;\n\treadonly maxAttempts: number;\n}\n\nexport interface WireBridgeStatus {\n\treadonly sessionId: string;\n\treadonly state: \"idle\" | \"started\" | \"open\" | \"waiting\" | \"closed\" | \"errored\" | \"exhausted\";\n\treadonly cursor: number;\n\treadonly nextSeq: number;\n\treadonly pending: number;\n\treadonly attempts: number;\n\treadonly acked: number;\n\treadonly nacked: number;\n\treadonly errors: number;\n\treadonly lastSeq?: number;\n\treadonly lastDelayMs?: number;\n}\n\nexport interface WireBridgeOptions {\n\treadonly name?: string;\n\treadonly sessionId: string;\n\treadonly retry?: RetryPolicy;\n\t/** Finite D134 ack timeout. Defaults to 30s so pending ack tracking is bounded. */\n\treadonly ackTimeoutMs?: number;\n\treadonly now?: () => number;\n}\n\nexport interface WireBridgeBundle<TOutbound = unknown, TInbound = unknown> {\n\treadonly sessionId: string;\n\treadonly command: Node<WireBridgeCommand<TOutbound>>;\n\treadonly outbound: Node<WireBridgeEnvelope<TOutbound>>;\n\treadonly inbound: Node<WireBridgeEnvelope<TInbound>>;\n\treadonly events: Node<WireBridgeEvent<TOutbound, TInbound>>;\n\treadonly acks: Node<WireBridgeAck>;\n\treadonly nacks: Node<WireBridgeNack>;\n\treadonly status: Node<WireBridgeStatus>;\n\treadonly errors: Node<unknown>;\n\treadonly cursor: Node<number>;\n\treadonly attempts: Node<WireBridgeAttempt>;\n\tstart(): void;\n\tsend(payload: TOutbound, opts?: { idempotencyKey?: string; requestId?: string }): void;\n\tack(ackForSeq: number, opts?: { idempotencyKey?: string; requestId?: string }): void;\n\tnack(\n\t\tackForSeq: number,\n\t\terror: unknown,\n\t\topts?: { idempotencyKey?: string; requestId?: string },\n\t): void;\n\tclose(reason?: unknown, opts?: { idempotencyKey?: string }): void;\n}\n\nexport interface RemoteCallRequest<T = unknown> {\n\treadonly operation: string;\n\treadonly requestId: string;\n\treadonly payload: T;\n}\n\nexport type RemoteCallResponse<T = unknown> =\n\t| {\n\t\t\treadonly kind: \"result\";\n\t\t\treadonly operation: string;\n\t\t\treadonly requestId: string;\n\t\t\treadonly payload: T;\n\t  }\n\t| {\n\t\t\treadonly kind: \"error\";\n\t\t\treadonly operation: string;\n\t\t\treadonly requestId: string;\n\t\t\treadonly error: string;\n\t  }\n\t| {\n\t\t\treadonly kind: \"status\";\n\t\t\treadonly operation: string;\n\t\t\treadonly requestId: string;\n\t\t\treadonly status: string;\n\t  };\n\nexport interface RemoteCallResult<T = unknown> {\n\treadonly operation: string;\n\treadonly requestId: string;\n\treadonly payload: T;\n}\n\nexport type RemoteCallStatusState =\n\t| \"idle\"\n\t| \"requested\"\n\t| \"responded\"\n\t| \"errored\"\n\t| \"timed-out\"\n\t| \"bridge-errored\";\n\nexport interface RemoteCallStatus {\n\treadonly state: RemoteCallStatusState;\n\treadonly operation?: string;\n\treadonly requestId?: string;\n\treadonly pending: number;\n\treadonly completed: number;\n\treadonly errors: number;\n\treadonly timeouts: number;\n}\n\nexport interface RemoteCallError {\n\treadonly operation?: string;\n\treadonly requestId?: string;\n\treadonly error: string;\n}\n\nexport interface RemoteCallTimeout {\n\treadonly operation?: string;\n\treadonly requestId: string;\n\treadonly error: string;\n}\n\nexport interface RemoteCallOptions {\n\treadonly name?: string;\n}\n\nexport interface RemoteCallBundle<TRequest = unknown, TResponse = unknown> {\n\treadonly responses: Node<RemoteCallResponse<TResponse>>;\n\treadonly results: Node<RemoteCallResult<TResponse>>;\n\treadonly status: Node<RemoteCallStatus>;\n\treadonly errors: Node<RemoteCallError>;\n\treadonly timeouts: Node<RemoteCallTimeout>;\n\tcall(\n\t\toperation: string,\n\t\trequestId: string,\n\t\tpayload: TRequest,\n\t\topts?: { readonly idempotencyKey?: string },\n\t): RemoteCallRequest<TRequest>;\n\ttimeout(requestId: string, operation: string | undefined, error: string): RemoteCallTimeout;\n}\n\nexport type RemoteResponderHandler<TRequest = unknown, TResponse = unknown> = (\n\trequest: RemoteCallRequest<TRequest>,\n) => TResponse;\n\nexport interface RemoteResponderHandlerDefinition<TRequest = unknown, TResponse = unknown> {\n\treadonly operation: string;\n\treadonly handle: RemoteResponderHandler<TRequest, TResponse>;\n}\n\nexport type RemoteResponderEvent<TRequest = unknown, TResponse = unknown> =\n\t| {\n\t\t\treadonly kind: \"request\";\n\t\t\treadonly request: RemoteCallRequest<TRequest>;\n\t\t\treadonly seq: number;\n\t  }\n\t| {\n\t\t\treadonly kind: \"response\";\n\t\t\treadonly requestId: string;\n\t\t\treadonly operation: string;\n\t\t\treadonly command: WireBridgeCommand<RemoteCallResponse<TResponse>>;\n\t  }\n\t| {\n\t\t\treadonly kind: \"rejected\";\n\t\t\treadonly requestId?: string;\n\t\t\treadonly operation?: string;\n\t\t\treadonly error: string;\n\t\t\treadonly command?: WireBridgeCommand<RemoteCallResponse<TResponse>>;\n\t  }\n\t| { readonly kind: \"invalid\"; readonly error: string };\n\nexport type RemoteResponderStatusState = \"idle\" | \"responded\" | \"rejected\" | \"errored\";\n\nexport interface RemoteResponderStatus {\n\treadonly state: RemoteResponderStatusState;\n\treadonly operation?: string;\n\treadonly requestId?: string;\n\treadonly handled: number;\n\treadonly rejected: number;\n\treadonly errors: number;\n}\n\nexport interface RemoteResponderOptions<TRequest = unknown, TResponse = unknown> {\n\treadonly name?: string;\n\treadonly handlers?: readonly RemoteResponderHandlerDefinition<TRequest, TResponse>[];\n\t/** Default false: non-owned operations are ignored so multiple responders may share one bridge. */\n\treadonly rejectUnknown?: boolean;\n}\n\nexport interface RemoteResponderBundle<TRequest = unknown, TResponse = unknown> {\n\treadonly events: Node<RemoteResponderEvent<TRequest, TResponse>>;\n\treadonly responseCommands: Node<WireBridgeCommand<RemoteCallResponse<TResponse>>>;\n\treadonly requests: Node<RemoteCallRequest<TRequest>>;\n\treadonly status: Node<RemoteResponderStatus>;\n\treadonly errors: Node<RemoteCallError>;\n\trelease(): void;\n}\n\ninterface PendingEnvelope<TData> {\n\tenvelope: WireBridgeEnvelope<TData>;\n\ttimer?: ReturnType<typeof setTimeout>;\n}\n\ninterface BridgeState<TData> {\n\tactive: boolean;\n\tcleanupInstalled: boolean;\n\tnextSeq: number;\n\tcursor: number;\n\tremoteCursor: number;\n\tterminalReported: boolean;\n\tpending: Map<number, PendingEnvelope<TData>>;\n}\n\ninterface AttachedCommandSources<TOutbound> {\n\tsources: Node<WireBridgeCommand<TOutbound>>[];\n}\n\ninterface WireBridgeInvalidIngress {\n\treadonly __wireBridgeInvalidIngress: true;\n\treadonly error: string;\n}\n\nconst envelopeTypes = new Set<WireBridgeEnvelopeType>([\n\t\"start\",\n\t\"data\",\n\t\"ack\",\n\t\"nack\",\n\t\"status\",\n\t\"error\",\n\t\"close\",\n]);\n\nconst defaultAckTimeoutMs = 30_000;\nconst bridgeCommandSources = new WeakMap<\n\tWireBridgeBundle<unknown, unknown>,\n\tAttachedCommandSources<unknown>\n>();\nconst bridgeInboundTargets = new WeakMap<\n\tWireBridgeBundle<unknown, unknown>,\n\tNode<WireBridgeEnvelope<unknown> | WireBridgeInvalidIngress>\n>();\n\n/** Stable D134 idempotency key helper scoped to one bridge session and sequence. */\nexport function wireBridgeIdempotencyKey(sessionId: string, seq: number): string {\n\treturn `${sessionId}:${seq}`;\n}\n\n/** Create a D134 wire bridge envelope with ordered metadata. */\nexport function wireBridgeEnvelope<TData = unknown>(input: {\n\treadonly sessionId: string;\n\treadonly type: WireBridgeEnvelopeType;\n\treadonly seq: number;\n\treadonly cursor?: number;\n\treadonly payload?: WireBridgePayload<TData>;\n\treadonly idempotencyKey?: string;\n\treadonly attempt?: number;\n\treadonly maxAttempts?: number;\n\treadonly timestampMs?: number;\n\treadonly ackForSeq?: number;\n\treadonly requestId?: string;\n}): WireBridgeEnvelope<TData> {\n\tif (typeof input.sessionId !== \"string\" || input.sessionId.length === 0) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: sessionId must be a non-empty string\");\n\t}\n\tif (!envelopeTypes.has(input.type)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: type is not recognized\");\n\t}\n\tif (!isSafePositiveInteger(input.seq)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: seq must be a positive integer\");\n\t}\n\tconst cursor = input.cursor ?? 0;\n\tif (!isSafeNonNegativeInteger(cursor)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: cursor must be a non-negative integer\");\n\t}\n\tconst attempt = input.attempt ?? 1;\n\tif (!isSafePositiveInteger(attempt)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: attempt must be a positive integer\");\n\t}\n\tconst maxAttempts = input.maxAttempts ?? attempt;\n\tif (!isSafePositiveInteger(maxAttempts) || maxAttempts < attempt) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: maxAttempts must be >= attempt\");\n\t}\n\tif (input.ackForSeq !== undefined && !isSafePositiveInteger(input.ackForSeq)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: ackForSeq must be a positive integer\");\n\t}\n\tif ((input.type === \"ack\" || input.type === \"nack\") && input.ackForSeq === undefined) {\n\t\tthrow new RangeError(`wireBridgeEnvelope: ${input.type} envelope requires ackForSeq`);\n\t}\n\tif (input.idempotencyKey !== undefined && input.idempotencyKey.length === 0) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: idempotencyKey must be a non-empty string\");\n\t}\n\tconst payloadError = validatePayloadForType(input.type, input.payload, \"wireBridgeEnvelope\");\n\tif (payloadError !== undefined) {\n\t\tthrow new RangeError(payloadError);\n\t}\n\treturn {\n\t\tsessionId: input.sessionId,\n\t\ttype: input.type,\n\t\tpayload: input.payload,\n\t\tmetadata: {\n\t\t\tseq: input.seq,\n\t\t\tcursor,\n\t\t\tidempotencyKey: input.idempotencyKey ?? wireBridgeIdempotencyKey(input.sessionId, input.seq),\n\t\t\tattempt,\n\t\t\tmaxAttempts,\n\t\t\ttimestampMs: input.timestampMs,\n\t\t\tackForSeq: input.ackForSeq,\n\t\t\trequestId: input.requestId,\n\t\t},\n\t};\n}\n\nexport function wireBridge<TOutbound = unknown, TInbound = unknown>(\n\tgraph: Graph,\n\topts: WireBridgeOptions,\n): WireBridgeBundle<TOutbound, TInbound> {\n\tconst name = opts.name ?? \"wireBridge\";\n\tconst policy = opts.retry ?? retryPolicy();\n\tconst command = graph.node<WireBridgeCommand<TOutbound>>([], null, {\n\t\tname: `${name}/command`,\n\t\tfactory: \"wireBridgeCommand\",\n\t});\n\tconst inboundCore = graph.node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>(\n\t\t[],\n\t\tnull,\n\t\t{\n\t\t\tname: `${name}/inbound`,\n\t\t\tfactory: \"wireBridgeInbound\",\n\t\t},\n\t);\n\tconst inbound = guardedInboundNode(inboundCore, opts.sessionId);\n\tconst events = wireBridgeEventsNode<TOutbound, TInbound>(\n\t\tgraph,\n\t\tcommand,\n\t\tinboundCore,\n\t\tname,\n\t\topts,\n\t\tpolicy,\n\t);\n\tconst outbound = projectOutbound(graph, events, name);\n\tconst acks = projectAcks(graph, events, name);\n\tconst nacks = projectNacks(graph, events, name);\n\tconst status = projectStatus(graph, events, name, opts.sessionId);\n\tconst errors = projectErrors(graph, events, name);\n\tconst cursor = projectCursor(graph, events, name);\n\tconst attempts = projectAttempts(graph, events, name);\n\tconst bundle: WireBridgeBundle<TOutbound, TInbound> = {\n\t\tsessionId: opts.sessionId,\n\t\tcommand,\n\t\toutbound,\n\t\tinbound,\n\t\tevents,\n\t\tacks,\n\t\tnacks,\n\t\tstatus,\n\t\terrors,\n\t\tcursor,\n\t\tattempts,\n\t\tstart: () => command.down([[\"DATA\", { kind: \"start\" }]]),\n\t\tsend: (payload, sendOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"send\",\n\t\t\t\t\t\tpayload,\n\t\t\t\t\t\tidempotencyKey: sendOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId: sendOpts?.requestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tack: (ackForSeq, ackOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"ack\",\n\t\t\t\t\t\tackForSeq,\n\t\t\t\t\t\tidempotencyKey: ackOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId: ackOpts?.requestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tnack: (ackForSeq, error, nackOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"nack\",\n\t\t\t\t\t\tackForSeq,\n\t\t\t\t\t\terror,\n\t\t\t\t\t\tidempotencyKey: nackOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId: nackOpts?.requestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tclose: (reason, closeOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\"DATA\", { kind: \"close\", reason, idempotencyKey: closeOpts?.idempotencyKey }],\n\t\t\t]),\n\t};\n\tbridgeCommandSources.set(bundle as WireBridgeBundle<unknown, unknown>, { sources: [] });\n\tbridgeInboundTargets.set(bundle as WireBridgeBundle<unknown, unknown>, inboundCore);\n\treturn bundle;\n}\n\n/** D147 remote dispatcher call helper over explicit wireBridge request/response facts. */\nexport function remoteCall<TRequest = unknown, TResponse = unknown>(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>,\n\topts: RemoteCallOptions = {},\n): RemoteCallBundle<TRequest, TResponse> {\n\tconst name = opts.name ?? \"remoteCall\";\n\tconst timeouts = graph.node<RemoteCallTimeout>([], null, {\n\t\tname: `${name}/timeouts`,\n\t\tfactory: \"remoteCallTimeouts\",\n\t\tcompleteWhenDepsComplete: false,\n\t\terrorWhenDepsError: false,\n\t});\n\tconst responses = remoteCallResponsesNode(graph, bridge.events, timeouts, name);\n\tconst results = remoteCallResultsNode(graph, responses, name);\n\tconst status = remoteCallStatusNode(graph, bridge.events, responses, timeouts, name);\n\tconst errors = remoteCallErrorsNode(graph, responses, timeouts, bridge.events, name);\n\treturn {\n\t\tresponses,\n\t\tresults,\n\t\tstatus,\n\t\terrors,\n\t\ttimeouts,\n\t\tcall(operation, requestId, payload, callOpts) {\n\t\t\tconst request = remoteCallRequest(operation, requestId, payload);\n\t\t\tbridge.command.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"send\",\n\t\t\t\t\t\tpayload: request,\n\t\t\t\t\t\tidempotencyKey: callOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]);\n\t\t\treturn request;\n\t\t},\n\t\ttimeout(requestId, operation, error) {\n\t\t\tconst timeout = remoteCallTimeout(requestId, operation, error);\n\t\t\ttimeouts.down([[\"DATA\", timeout]]);\n\t\t\treturn timeout;\n\t\t},\n\t};\n}\n\nexport function remoteResponderHandler<TRequest = unknown, TResponse = unknown>(\n\toperation: string,\n\thandle: RemoteResponderHandler<TRequest, TResponse>,\n): RemoteResponderHandlerDefinition<TRequest, TResponse> {\n\tif (operation.length === 0) {\n\t\tthrow new RangeError(\"remoteResponderHandler: operation must be non-empty\");\n\t}\n\tif (typeof handle !== \"function\") {\n\t\tthrow new TypeError(\"remoteResponderHandler: handle must be a function\");\n\t}\n\treturn { operation, handle };\n}\n\n/** D147 remote responder over inbound wireBridge request facts and outbound command facts. */\nexport function remoteResponder<TRequest = unknown, TResponse = unknown>(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<RemoteCallResponse<TResponse>, RemoteCallRequest<TRequest>>,\n\topts: RemoteResponderOptions<TRequest, TResponse> = {},\n): RemoteResponderBundle<TRequest, TResponse> {\n\tconst name = opts.name ?? \"remoteResponder\";\n\tconst handlers = normalizeRemoteHandlers(opts.handlers ?? []);\n\tconst topology = graph.topologyGroup({ name: `${name}.remoteResponder` });\n\tconst events = topology.add(\n\t\tremoteResponderEventsNode(\n\t\t\tgraph,\n\t\t\twireBridgeInboundTarget(bridge),\n\t\t\tname,\n\t\t\tbridge.sessionId,\n\t\t\thandlers,\n\t\t\topts.rejectUnknown === true,\n\t\t),\n\t);\n\tconst responseCommands = topology.add(remoteResponderResponseCommandsNode(graph, events, name));\n\tconst requests = topology.add(remoteResponderRequestsNode(graph, events, name));\n\tconst status = topology.add(remoteResponderStatusNode(graph, events, name));\n\tconst errors = topology.add(remoteResponderErrorsNode(graph, events, name));\n\ttry {\n\t\tattachWireBridgeCommandSource(bridge, responseCommands);\n\t} catch (error) {\n\t\ttopology.release({ reason: `${name}.remoteResponder.failedAttach` });\n\t\tthrow error;\n\t}\n\tlet released = false;\n\treturn {\n\t\tevents,\n\t\tresponseCommands,\n\t\trequests,\n\t\tstatus,\n\t\terrors,\n\t\trelease() {\n\t\t\tif (released) return;\n\t\t\tdetachWireBridgeCommandSource(bridge, responseCommands);\n\t\t\ttry {\n\t\t\t\ttopology.release({ reason: `${name}.remoteResponder.release` });\n\t\t\t\treleased = true;\n\t\t\t} catch (error) {\n\t\t\t\tattachWireBridgeCommandSource(bridge, responseCommands);\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t},\n\t};\n}\n\nfunction wireBridgeEventsNode<TOutbound, TInbound>(\n\tgraph: Graph,\n\tcommand: Node<WireBridgeCommand<TOutbound>>,\n\tinbound: Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>,\n\tname: string,\n\topts: WireBridgeOptions,\n\tpolicy: RetryPolicy,\n): Node<WireBridgeEvent<TOutbound, TInbound>> {\n\tconst now = opts.now ?? Date.now;\n\treturn graph.node<WireBridgeEvent<TOutbound, TInbound>>(\n\t\t[command, inbound],\n\t\t(ctx) => {\n\t\t\tconst state = initBridgeState<TOutbound>(ctx);\n\n\t\t\tconst emitOutbound = (\n\t\t\t\ttype: WireBridgeEnvelopeType,\n\t\t\t\tpayload: WireBridgePayload<TOutbound> | undefined,\n\t\t\t\tcommandOpts: { idempotencyKey?: string; requestId?: string; ackForSeq?: number } = {},\n\t\t\t\tbeforeEmit?: () => void,\n\t\t\t) => {\n\t\t\t\tif (!isSafePositiveInteger(state.nextSeq)) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"invalid\",\n\t\t\t\t\t\t\t\terror: `${opts.sessionId}: next outbound seq exceeded Number.MAX_SAFE_INTEGER`,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst seq = state.nextSeq;\n\t\t\t\tlet envelope: WireBridgeEnvelope<TOutbound>;\n\t\t\t\ttry {\n\t\t\t\t\tenvelope = wireBridgeEnvelope<TOutbound>({\n\t\t\t\t\t\tsessionId: opts.sessionId,\n\t\t\t\t\t\ttype,\n\t\t\t\t\t\tseq,\n\t\t\t\t\t\tcursor: state.cursor,\n\t\t\t\t\t\tpayload,\n\t\t\t\t\t\tidempotencyKey: commandOpts.idempotencyKey,\n\t\t\t\t\t\tattempt: 1,\n\t\t\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\t\t\ttimestampMs: now(),\n\t\t\t\t\t\tackForSeq: commandOpts.ackForSeq,\n\t\t\t\t\t\trequestId: commandOpts.requestId,\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"invalid\",\n\t\t\t\t\t\t\t\terror: error instanceof Error ? error.message : String(error),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tstate.nextSeq++;\n\t\t\t\tbeforeEmit?.();\n\t\t\t\tctx.down([[\"DATA\", { kind: \"outbound\", envelope }]]);\n\t\t\t\tif (shouldTrackAck(type)) armAckTimeout(ctx, state, envelope, opts, policy, now);\n\t\t\t};\n\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tprocessInbound(ctx, state, raw, opts.sessionId);\n\t\t\t}\n\t\t\tconst inboundTerminal = ctx.terminal[1];\n\t\t\tif (inboundTerminal !== false && inboundTerminal !== undefined && !state.terminalReported) {\n\t\t\t\tstate.terminalReported = true;\n\t\t\t\tconst error =\n\t\t\t\t\tinboundTerminal === true\n\t\t\t\t\t\t? `${opts.sessionId}: inbound protocol COMPLETE is local misuse; remote completion must arrive as a DATA envelope fact`\n\t\t\t\t\t\t: `${opts.sessionId}: inbound protocol ERROR ${String(\n\t\t\t\t\t\t\t\terrorPayload(inboundTerminal),\n\t\t\t\t\t\t\t)} is local misuse; remote errors must arrive as DATA envelope facts`;\n\t\t\t\tctx.down([[\"DATA\", { kind: \"invalid\", error }]]);\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst invalid = validateCommand(raw);\n\t\t\t\tif (invalid !== undefined) {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: invalid }]]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst commandValue = raw as WireBridgeCommand<TOutbound>;\n\t\t\t\tswitch (commandValue.kind) {\n\t\t\t\t\tcase \"start\":\n\t\t\t\t\t\temitOutbound(\"start\", undefined, commandValue);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"send\":\n\t\t\t\t\t\temitOutbound(\"data\", { kind: \"data\", value: commandValue.payload }, commandValue);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"ack\":\n\t\t\t\t\t\temitOutbound(\"ack\", undefined, {\n\t\t\t\t\t\t\tidempotencyKey: commandValue.idempotencyKey,\n\t\t\t\t\t\t\trequestId: commandValue.requestId,\n\t\t\t\t\t\t\tackForSeq: commandValue.ackForSeq,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"nack\":\n\t\t\t\t\t\temitOutbound(\n\t\t\t\t\t\t\t\"nack\",\n\t\t\t\t\t\t\t{ kind: \"error\", error: errorPayload(commandValue.error) },\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tidempotencyKey: commandValue.idempotencyKey,\n\t\t\t\t\t\t\t\trequestId: commandValue.requestId,\n\t\t\t\t\t\t\t\tackForSeq: commandValue.ackForSeq,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"close\":\n\t\t\t\t\t\temitOutbound(\n\t\t\t\t\t\t\t\"close\",\n\t\t\t\t\t\t\t{ kind: \"close\", reason: commandValue.reason },\n\t\t\t\t\t\t\tcommandValue,\n\t\t\t\t\t\t\t() => {\n\t\t\t\t\t\t\t\tfor (const pending of state.pending.values()) {\n\t\t\t\t\t\t\t\t\tif (pending.timer !== undefined) clearTimeout(pending.timer);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tstate.pending.clear();\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/events`,\n\t\t\tfactory: \"wireBridgeEvents\",\n\t\t\tpartial: true,\n\t\t\terrorWhenDepsError: false,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t);\n}\n\nfunction initBridgeState<TPayload>(ctx: Ctx): BridgeState<TPayload> {\n\tlet state = ctx.state.get<BridgeState<TPayload>>();\n\tif (state === undefined) {\n\t\tstate = {\n\t\t\tactive: true,\n\t\t\tcleanupInstalled: false,\n\t\t\tnextSeq: 1,\n\t\t\tcursor: 0,\n\t\t\tremoteCursor: 0,\n\t\t\tterminalReported: false,\n\t\t\tpending: new Map(),\n\t\t};\n\t\tctx.state.set(state);\n\t}\n\tstate.active = true;\n\tif (!state.cleanupInstalled) {\n\t\tstate.cleanupInstalled = true;\n\t\tctx.onDeactivation(() => {\n\t\t\tstate.active = false;\n\t\t\tstate.cleanupInstalled = false;\n\t\t\tfor (const pending of state.pending.values()) {\n\t\t\t\tif (pending.timer !== undefined) clearTimeout(pending.timer);\n\t\t\t}\n\t\t\tstate.pending.clear();\n\t\t});\n\t}\n\treturn state;\n}\n\nfunction attachWireBridgeCommandSource<TOutbound, TInbound>(\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\tsource: Node<WireBridgeCommand<TOutbound>>,\n): void {\n\tconst attached = bridgeCommandSources.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (attached === undefined) {\n\t\tthrow new Error(\"remoteResponder: bridge command source registry missing\");\n\t}\n\tconst sources = attached.sources as Node<WireBridgeCommand<TOutbound>>[];\n\tconst previousSources = [...sources];\n\tif (!sources.includes(source)) sources.push(source);\n\ttry {\n\t\tbridge.command.replaceDeps([...sources], wireBridgeCommandSourceFn(sources.length));\n\t} catch (error) {\n\t\tsources.splice(0, sources.length, ...previousSources);\n\t\tbridge.command.replaceDeps(\n\t\t\t[...previousSources],\n\t\t\twireBridgeCommandSourceFn(previousSources.length),\n\t\t);\n\t\tthrow error;\n\t}\n}\n\nfunction detachWireBridgeCommandSource<TOutbound, TInbound>(\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\tsource: Node<WireBridgeCommand<TOutbound>>,\n): void {\n\tconst attached = bridgeCommandSources.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (attached === undefined) {\n\t\tthrow new Error(\"remoteResponder: bridge command source registry missing\");\n\t}\n\tconst sources = attached.sources as Node<WireBridgeCommand<TOutbound>>[];\n\tif (!sources.includes(source)) return;\n\tconst previousSources = [...sources];\n\tconst nextSources = sources.filter((candidate) => candidate !== source);\n\tsources.splice(0, sources.length, ...nextSources);\n\ttry {\n\t\tbridge.command.replaceDeps([...nextSources], wireBridgeCommandSourceFn(nextSources.length));\n\t} catch (error) {\n\t\tsources.splice(0, sources.length, ...previousSources);\n\t\tbridge.command.replaceDeps(\n\t\t\t[...previousSources],\n\t\t\twireBridgeCommandSourceFn(previousSources.length),\n\t\t);\n\t\tthrow error;\n\t}\n}\n\nfunction wireBridgeInboundTarget<TInbound>(\n\tbridge: WireBridgeBundle<unknown, TInbound>,\n): Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress> {\n\tconst target = bridgeInboundTargets.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (target === undefined) {\n\t\tthrow new Error(\"remoteResponder: bridge inbound target registry missing\");\n\t}\n\treturn target as Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>;\n}\n\nfunction wireBridgeCommandSourceFn<TOutbound>(sourceCount: number): (ctx: Ctx) => void {\n\treturn (ctx) => {\n\t\tfor (let i = 0; i < sourceCount; i += 1) {\n\t\t\tfor (const command of depBatch(ctx, i) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", command as WireBridgeCommand<TOutbound>]]);\n\t\t\t}\n\t\t}\n\t};\n}\n\nfunction remoteCallRequest<TRequest>(\n\toperation: string,\n\trequestId: string,\n\tpayload: TRequest,\n): RemoteCallRequest<TRequest> {\n\tif (operation.length === 0) throw new RangeError(\"remoteCall: operation must be non-empty\");\n\tif (requestId.length === 0) throw new RangeError(\"remoteCall: requestId must be non-empty\");\n\treturn { operation, requestId, payload };\n}\n\nfunction remoteCallTimeout(\n\trequestId: string,\n\toperation: string | undefined,\n\terror: string,\n): RemoteCallTimeout {\n\tif (requestId.length === 0)\n\t\tthrow new RangeError(\"remoteCall: timeout requestId must be non-empty\");\n\tif (error.length === 0) throw new RangeError(\"remoteCall: timeout error must be non-empty\");\n\treturn { ...(operation === undefined ? {} : { operation }), requestId, error };\n}\n\ninterface RemotePendingRequest {\n\toperation: string;\n\trequestId: string;\n\tseq: number;\n}\n\ninterface RemotePendingState {\n\trequestIds: Set<string>;\n\tbySeq: Map<number, RemotePendingRequest>;\n}\n\nfunction remotePendingState(): RemotePendingState {\n\treturn { requestIds: new Set(), bySeq: new Map() };\n}\n\nfunction remotePendingContains(state: RemotePendingState, requestId: string): boolean {\n\treturn state.requestIds.has(requestId);\n}\n\nfunction remotePendingDuplicate(state: RemotePendingState, request: RemotePendingRequest): boolean {\n\tconst current = remotePendingTakeBySeqPreview(state, request.seq);\n\treturn current?.requestId !== request.requestId && state.requestIds.has(request.requestId);\n}\n\nfunction remotePendingTakeBySeqPreview(\n\tstate: RemotePendingState,\n\tseq: number,\n): RemotePendingRequest | undefined {\n\treturn state.bySeq.get(seq);\n}\n\nfunction remotePendingInsert(state: RemotePendingState, request: RemotePendingRequest): void {\n\tconst existingBySeq = state.bySeq.get(request.seq);\n\tif (existingBySeq !== undefined) {\n\t\tstate.requestIds.delete(existingBySeq.requestId);\n\t}\n\tfor (const [seq, pending] of state.bySeq) {\n\t\tif (pending.requestId === request.requestId && seq !== request.seq) {\n\t\t\tstate.bySeq.delete(seq);\n\t\t\tbreak;\n\t\t}\n\t}\n\tstate.requestIds.add(request.requestId);\n\tstate.bySeq.set(request.seq, request);\n}\n\nfunction remotePendingTakeByRequestId(\n\tstate: RemotePendingState,\n\trequestId: string,\n): RemotePendingRequest | undefined {\n\tif (!state.requestIds.delete(requestId)) return undefined;\n\tlet seq: number | undefined;\n\tlet found: RemotePendingRequest | undefined;\n\tfor (const [candidateSeq, request] of state.bySeq) {\n\t\tif (request.requestId === requestId) {\n\t\t\tseq = candidateSeq;\n\t\t\tfound = request;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (seq !== undefined) state.bySeq.delete(seq);\n\treturn found;\n}\n\nfunction remotePendingTakeBySeq(\n\tstate: RemotePendingState,\n\tseq: number,\n): RemotePendingRequest | undefined {\n\tconst request = state.bySeq.get(seq);\n\tif (request === undefined) return undefined;\n\tstate.bySeq.delete(seq);\n\tstate.requestIds.delete(request.requestId);\n\treturn request;\n}\n\nfunction remotePendingFromReceipt<T>(\n\tstate: RemotePendingState,\n\tenvelope: WireBridgeEnvelope<RemoteCallRequest<T>>,\n): RemotePendingRequest | undefined {\n\tconst bySeq = remotePendingTakeBySeq(state, envelope.metadata.seq);\n\tif (bySeq !== undefined) return bySeq;\n\tconst fallback = pendingRequestFromEnvelope(envelope);\n\tif (fallback === undefined || remotePendingContains(state, fallback.requestId)) {\n\t\treturn undefined;\n\t}\n\treturn fallback;\n}\n\nfunction pendingRequestFromEnvelope<T>(\n\tenvelope: WireBridgeEnvelope<RemoteCallRequest<T>>,\n): RemotePendingRequest | undefined {\n\tif (envelope.payload?.kind !== \"data\") return undefined;\n\tconst request = validateRemoteCallRequest(envelope.payload.value);\n\tif (request === undefined) return undefined;\n\treturn {\n\t\toperation: request.operation,\n\t\trequestId: request.requestId,\n\t\tseq: envelope.metadata.seq,\n\t};\n}\n\nfunction validateRemoteCallRequest<T>(value: unknown): RemoteCallRequest<T> | undefined {\n\tif (!isRecord(value)) return undefined;\n\tif (typeof value.operation !== \"string\" || value.operation.length === 0) return undefined;\n\tif (typeof value.requestId !== \"string\" || value.requestId.length === 0) return undefined;\n\tif (!(\"payload\" in value)) return undefined;\n\treturn {\n\t\toperation: value.operation,\n\t\trequestId: value.requestId,\n\t\tpayload: value.payload as T,\n\t};\n}\n\nfunction validateRemoteCallResponse<T>(value: unknown): RemoteCallResponse<T> | undefined {\n\tif (!isRecord(value)) return undefined;\n\tif (typeof value.operation !== \"string\" || value.operation.length === 0) return undefined;\n\tif (typeof value.requestId !== \"string\" || value.requestId.length === 0) return undefined;\n\tif (value.kind === \"result\" && \"payload\" in value) {\n\t\treturn {\n\t\t\tkind: \"result\",\n\t\t\toperation: value.operation,\n\t\t\trequestId: value.requestId,\n\t\t\tpayload: value.payload as T,\n\t\t};\n\t}\n\tif (value.kind === \"error\" && typeof value.error === \"string\" && value.error.length > 0) {\n\t\treturn {\n\t\t\tkind: \"error\",\n\t\t\toperation: value.operation,\n\t\t\trequestId: value.requestId,\n\t\t\terror: value.error,\n\t\t};\n\t}\n\tif (value.kind === \"status\" && typeof value.status === \"string\" && value.status.length > 0) {\n\t\treturn {\n\t\t\tkind: \"status\",\n\t\t\toperation: value.operation,\n\t\t\trequestId: value.requestId,\n\t\t\tstatus: value.status,\n\t\t};\n\t}\n\treturn undefined;\n}\n\nfunction remoteMalformedResponseRequestId(value: unknown): string | undefined {\n\tif (!isRecord(value)) return undefined;\n\treturn typeof value.requestId === \"string\" && value.requestId.length > 0\n\t\t? value.requestId\n\t\t: undefined;\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null;\n}\n\nfunction isThenable(value: unknown): boolean {\n\treturn isRecord(value) && typeof value.then === \"function\";\n}\n\nfunction remoteCallResponseRequestId<T>(response: RemoteCallResponse<T>): string {\n\treturn response.requestId;\n}\n\nfunction remoteCallResponseIsTerminal<T>(response: RemoteCallResponse<T>): boolean {\n\treturn response.kind === \"result\" || response.kind === \"error\";\n}\n\nfunction remoteCallResponsesNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>>,\n\ttimeouts: Node<RemoteCallTimeout>,\n\tname: string,\n): Node<RemoteCallResponse<TResponse>> {\n\treturn graph.node<RemoteCallResponse<TResponse>>(\n\t\t[events, timeouts],\n\t\t(ctx) => {\n\t\t\ttype State = {\n\t\t\t\tpending: RemotePendingState;\n\t\t\t};\n\t\t\tconst state = ctx.state.get<State>() ?? {\n\t\t\t\tpending: remotePendingState(),\n\t\t\t};\n\t\t\tconst ready: RemoteCallResponse<TResponse>[] = [];\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst request = pendingRequestFromEnvelope(event.envelope);\n\t\t\t\t\tif (request === undefined) continue;\n\t\t\t\t\tif (remotePendingDuplicate(state.pending, request)) continue;\n\t\t\t\t\tremotePendingInsert(state.pending, request);\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.payload?.kind === \"data\") {\n\t\t\t\t\tconst response = validateRemoteCallResponse<TResponse>(event.envelope.payload.value);\n\t\t\t\t\tif (response === undefined) {\n\t\t\t\t\t\tconst requestId = remoteMalformedResponseRequestId(event.envelope.payload.value);\n\t\t\t\t\t\tif (requestId !== undefined && remotePendingContains(state.pending, requestId)) {\n\t\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, requestId);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tconst requestId = remoteCallResponseRequestId(response);\n\t\t\t\t\tif (remotePendingContains(state.pending, requestId)) {\n\t\t\t\t\t\tif (remoteCallResponseIsTerminal(response)) {\n\t\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, requestId);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tready.push(response);\n\t\t\t\t\t}\n\t\t\t\t} else if (event.kind === \"nack\") {\n\t\t\t\t\tremotePendingFromReceipt(state.pending, event.outbound);\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tremotePendingTakeBySeq(state.pending, event.seq);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst timeout = raw as RemoteCallTimeout;\n\t\t\t\tremotePendingTakeByRequestId(state.pending, timeout.requestId);\n\t\t\t}\n\t\t\tctx.state.set(state);\n\t\t\tfor (const response of ready) ctx.down([[\"DATA\", response]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/responses`,\n\t\t\tfactory: \"remoteCallResponses\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallResultsNode<TResponse>(\n\tgraph: Graph,\n\tresponses: Node<RemoteCallResponse<TResponse>>,\n\tname: string,\n): Node<RemoteCallResult<TResponse>> {\n\treturn graph.node<RemoteCallResult<TResponse>>(\n\t\t[responses],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst response = raw as RemoteCallResponse<TResponse>;\n\t\t\t\tif (response.kind === \"result\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\t\tpayload: response.payload,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/results`, factory: \"remoteCallResults\", completeWhenDepsComplete: false },\n\t);\n}\n\nfunction remoteCallStatusNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>>,\n\tresponses: Node<RemoteCallResponse<TResponse>>,\n\ttimeouts: Node<RemoteCallTimeout>,\n\tname: string,\n): Node<RemoteCallStatus> {\n\treturn graph.node<RemoteCallStatus>(\n\t\t[events, responses, timeouts],\n\t\t(ctx) => {\n\t\t\ttype State = { status: RemoteCallStatus; pending: RemotePendingState };\n\t\t\tconst state =\n\t\t\t\tctx.state.get<State>() ??\n\t\t\t\t({\n\t\t\t\t\tstatus: { state: \"idle\", pending: 0, completed: 0, errors: 0, timeouts: 0 },\n\t\t\t\t\tpending: remotePendingState(),\n\t\t\t\t} satisfies State);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst request = pendingRequestFromEnvelope(event.envelope);\n\t\t\t\t\tif (request !== undefined) {\n\t\t\t\t\t\tif (remotePendingDuplicate(state.pending, request)) {\n\t\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tremotePendingInsert(state.pending, request);\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"requested\",\n\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t} else if (\n\t\t\t\t\tevent.kind === \"invalid\" ||\n\t\t\t\t\tevent.kind === \"session-mismatch\" ||\n\t\t\t\t\tevent.kind === \"out-of-order\" ||\n\t\t\t\t\tevent.kind === \"late-receipt\"\n\t\t\t\t) {\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"bridge-errored\",\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"nack\") {\n\t\t\t\t\tconst request = remotePendingFromReceipt(state.pending, event.outbound);\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"bridge-errored\",\n\t\t\t\t\t\t...(request === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { operation: request.operation, requestId: request.requestId }),\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tconst request = remotePendingTakeBySeq(state.pending, event.seq);\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"bridge-errored\",\n\t\t\t\t\t\t...(request === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { operation: request.operation, requestId: request.requestId }),\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.payload?.kind === \"data\") {\n\t\t\t\t\tconst response = validateRemoteCallResponse<TResponse>(event.envelope.payload.value);\n\t\t\t\t\tif (response === undefined) {\n\t\t\t\t\t\tconst requestId = remoteMalformedResponseRequestId(event.envelope.payload.value);\n\t\t\t\t\t\tif (requestId !== undefined) {\n\t\t\t\t\t\t\tconst request = remotePendingTakeByRequestId(state.pending, requestId);\n\t\t\t\t\t\t\tif (request !== undefined) {\n\t\t\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\t\trequestId,\n\t\t\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst response = raw as RemoteCallResponse<TResponse>;\n\t\t\t\tif (response.kind === \"result\") {\n\t\t\t\t\tremotePendingTakeByRequestId(state.pending, response.requestId);\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"responded\",\n\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\tcompleted: state.status.completed + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (response.kind === \"error\") {\n\t\t\t\t\tremotePendingTakeByRequestId(state.pending, response.requestId);\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else {\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 2) ?? []) {\n\t\t\t\tconst timeout = raw as RemoteCallTimeout;\n\t\t\t\tremotePendingTakeByRequestId(state.pending, timeout.requestId);\n\t\t\t\tstate.status = {\n\t\t\t\t\t...state.status,\n\t\t\t\t\tstate: \"timed-out\",\n\t\t\t\t\toperation: timeout.operation,\n\t\t\t\t\trequestId: timeout.requestId,\n\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\ttimeouts: state.status.timeouts + 1,\n\t\t\t\t};\n\t\t\t}\n\t\t\tstate.status = { ...state.status, pending: state.pending.requestIds.size };\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([[\"DATA\", state.status]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/status`,\n\t\t\tfactory: \"remoteCallStatus\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallErrorsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tresponses: Node<RemoteCallResponse<TResponse>>,\n\ttimeouts: Node<RemoteCallTimeout>,\n\tevents: Node<WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>>,\n\tname: string,\n): Node<RemoteCallError> {\n\treturn graph.node<RemoteCallError>(\n\t\t[responses, timeouts, events],\n\t\t(ctx) => {\n\t\t\tconst pending = ctx.state.get<RemotePendingState>() ?? remotePendingState();\n\t\t\tfor (const raw of depBatch(ctx, 2) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst request = pendingRequestFromEnvelope(event.envelope);\n\t\t\t\t\tif (request !== undefined) {\n\t\t\t\t\t\tif (remotePendingDuplicate(pending, request)) {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\t\t\terror: `remoteCall: duplicate in-flight requestId '${request.requestId}'`,\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tremotePendingInsert(pending, request);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst response = raw as RemoteCallResponse<TResponse>;\n\t\t\t\tif (response.kind === \"error\") {\n\t\t\t\t\tremotePendingTakeByRequestId(pending, response.requestId);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\t\terror: response.error,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (response.kind === \"result\") {\n\t\t\t\t\tremotePendingTakeByRequestId(pending, response.requestId);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst timeout = raw as RemoteCallTimeout;\n\t\t\t\tremotePendingTakeByRequestId(pending, timeout.requestId);\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{ operation: timeout.operation, requestId: timeout.requestId, error: timeout.error },\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 2) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"inbound\" && event.envelope.payload?.kind === \"data\") {\n\t\t\t\t\tconst response = validateRemoteCallResponse<TResponse>(event.envelope.payload.value);\n\t\t\t\t\tif (response === undefined) {\n\t\t\t\t\t\tconst requestId = remoteMalformedResponseRequestId(event.envelope.payload.value);\n\t\t\t\t\t\tconst request =\n\t\t\t\t\t\t\trequestId === undefined\n\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t: remotePendingTakeByRequestId(pending, requestId);\n\t\t\t\t\t\tif (request === undefined) continue;\n\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\t\terror: \"remoteCall: response payload is malformed\",\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t]);\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (event.kind === \"nack\") {\n\t\t\t\t\tconst request = remotePendingFromReceipt(pending, event.outbound);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: request?.operation,\n\t\t\t\t\t\t\t\trequestId: request?.requestId,\n\t\t\t\t\t\t\t\terror: String(event.error),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tconst request = remotePendingTakeBySeq(pending, event.seq);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: request?.operation,\n\t\t\t\t\t\t\t\trequestId: request?.requestId,\n\t\t\t\t\t\t\t\terror: String(event.error),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", { error: event.error }]]);\n\t\t\t\t} else if (\n\t\t\t\t\tevent.kind === \"session-mismatch\" ||\n\t\t\t\t\tevent.kind === \"out-of-order\" ||\n\t\t\t\t\tevent.kind === \"late-receipt\"\n\t\t\t\t) {\n\t\t\t\t\tctx.down([[\"DATA\", { error: remoteCallBridgeErrorMessage(event) }]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(pending);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/errors`,\n\t\t\tfactory: \"remoteCallErrors\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallBridgeErrorMessage<TRequest, TResponse>(\n\tevent: WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>,\n): string {\n\tif (event.kind === \"session-mismatch\") {\n\t\treturn `remoteCall: inbound session ${event.actual} did not match expected ${event.expected}`;\n\t}\n\tif (event.kind === \"out-of-order\") {\n\t\treturn `remoteCall: inbound seq ${event.seq} arrived before expected seq ${event.expected}`;\n\t}\n\tif (event.kind === \"late-receipt\") {\n\t\treturn `remoteCall: late ${event.receipt} for unknown or completed ackForSeq ${event.ackForSeq}`;\n\t}\n\treturn \"remoteCall: bridge error\";\n}\n\nfunction normalizeRemoteHandlers<TRequest, TResponse>(\n\thandlers: readonly RemoteResponderHandlerDefinition<TRequest, TResponse>[],\n): Map<string, RemoteResponderHandler<TRequest, TResponse>> {\n\tconst out = new Map<string, RemoteResponderHandler<TRequest, TResponse>>();\n\tfor (const handler of handlers) {\n\t\tif (handler.operation.length === 0) {\n\t\t\tthrow new RangeError(\"remoteResponder: operation must be non-empty\");\n\t\t}\n\t\tif (out.has(handler.operation)) {\n\t\t\tthrow new RangeError(`remoteResponder: duplicate operation '${handler.operation}'`);\n\t\t}\n\t\tout.set(handler.operation, handler.handle);\n\t}\n\treturn out;\n}\n\ninterface RemoteResponderCursor {\n\tcursor: number;\n\tremoteCursor: number;\n}\n\ntype RemoteResponderInbound<T> =\n\t| { readonly kind: \"request\"; readonly request: RemoteCallRequest<T>; readonly seq: number }\n\t| { readonly kind: \"consumed\" }\n\t| { readonly kind: \"invalid\"; readonly error: string };\n\nfunction reduceRemoteResponderInbound<T>(\n\tcursor: RemoteResponderCursor,\n\tenvelope: WireBridgeEnvelope<RemoteCallRequest<T>>,\n\texpectedSessionId: string,\n): RemoteResponderInbound<T> {\n\tconst envelopeError = validateInboundEnvelope(envelope);\n\tif (envelopeError !== undefined) {\n\t\treturn { kind: \"invalid\", error: envelopeError };\n\t}\n\tif (envelope.sessionId !== expectedSessionId) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `remoteResponder: inbound session ${envelope.sessionId} did not match expected ${expectedSessionId}`,\n\t\t};\n\t}\n\tconst seq = envelope.metadata.seq;\n\tconst expected = cursor.cursor + 1;\n\tif (seq <= cursor.cursor) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `remoteResponder: duplicate request seq ${seq} at cursor ${cursor.cursor}`,\n\t\t};\n\t}\n\tif (seq > expected) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `remoteResponder: out-of-order request seq ${seq}, expected ${expected}`,\n\t\t};\n\t}\n\tif (envelope.metadata.cursor < cursor.remoteCursor) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `${envelope.sessionId}: remoteResponder inbound cursor ${envelope.metadata.cursor} regressed below ${cursor.remoteCursor}`,\n\t\t};\n\t}\n\tcursor.cursor = seq;\n\tcursor.remoteCursor = envelope.metadata.cursor;\n\tif (envelope.type !== \"data\") return { kind: \"consumed\" };\n\tif (envelope.payload?.kind !== \"data\") {\n\t\treturn { kind: \"invalid\", error: \"remoteResponder: request envelope must carry request DATA\" };\n\t}\n\tconst request = validateRemoteCallRequest<T>(envelope.payload.value);\n\tif (request === undefined) {\n\t\treturn { kind: \"invalid\", error: \"remoteResponder: request payload is malformed\" };\n\t}\n\treturn { kind: \"request\", request, seq };\n}\n\nfunction remoteResponderEventsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tinbound: Node<WireBridgeEnvelope<RemoteCallRequest<TRequest>> | WireBridgeInvalidIngress>,\n\tname: string,\n\texpectedSessionId: string,\n\thandlers: Map<string, RemoteResponderHandler<TRequest, TResponse>>,\n\trejectUnknown: boolean,\n): Node<RemoteResponderEvent<TRequest, TResponse>> {\n\treturn graph.node<RemoteResponderEvent<TRequest, TResponse>>(\n\t\t[inbound],\n\t\t(ctx) => {\n\t\t\tconst cursor = ctx.state.get<RemoteResponderCursor>() ?? { cursor: 0, remoteCursor: 0 };\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst envelope = raw as WireBridgeEnvelope<RemoteCallRequest<TRequest>>;\n\t\t\t\tconst received = reduceRemoteResponderInbound(cursor, envelope, expectedSessionId);\n\t\t\t\tif (received.kind === \"consumed\") continue;\n\t\t\t\tif (received.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: received.error }]]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst { request, seq } = received;\n\t\t\t\tctx.down([[\"DATA\", { kind: \"request\", request, seq }]]);\n\t\t\t\tconst handler = handlers.get(request.operation);\n\t\t\t\tif (handler === undefined) {\n\t\t\t\t\tif (!rejectUnknown) continue;\n\t\t\t\t\tconst error = `remoteResponder: unknown operation '${request.operation}'`;\n\t\t\t\t\tconst response = remoteCallErrorResponse(request, error);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\terror,\n\t\t\t\t\t\t\t\tcommand: { kind: \"send\", payload: response, requestId: request.requestId },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\tconst payload = handler(request);\n\t\t\t\t\tif (isThenable(payload)) {\n\t\t\t\t\t\tthrow new Error(\"remoteResponder: async handler results require a later adapter shape\");\n\t\t\t\t\t}\n\t\t\t\t\tconst response = {\n\t\t\t\t\t\tkind: \"result\",\n\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\tpayload,\n\t\t\t\t\t} satisfies RemoteCallResponse<TResponse>;\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"response\",\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\tcommand: { kind: \"send\", payload: response, requestId: request.requestId },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} catch (error) {\n\t\t\t\t\trethrowGraphRuntimeInvariant(error);\n\t\t\t\t\tconst message = errorMessage(error);\n\t\t\t\t\tconst response = remoteCallErrorResponse(request, message);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\terror: message,\n\t\t\t\t\t\t\t\tcommand: { kind: \"send\", payload: response, requestId: request.requestId },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(cursor);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/events`,\n\t\t\tfactory: \"remoteResponderEvents\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallErrorResponse<TRequest, TResponse>(\n\trequest: RemoteCallRequest<TRequest>,\n\terror: string,\n): RemoteCallResponse<TResponse> {\n\treturn {\n\t\tkind: \"error\",\n\t\toperation: request.operation,\n\t\trequestId: request.requestId,\n\t\terror,\n\t};\n}\n\nfunction remoteResponderResponseCommandsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<WireBridgeCommand<RemoteCallResponse<TResponse>>> {\n\treturn graph.node<WireBridgeCommand<RemoteCallResponse<TResponse>>>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (\n\t\t\t\t\t(event.kind === \"response\" || event.kind === \"rejected\") &&\n\t\t\t\t\tevent.command !== undefined\n\t\t\t\t) {\n\t\t\t\t\tctx.down([[\"DATA\", event.command]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/responseCommands`,\n\t\t\tfactory: \"remoteResponderResponseCommands\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteResponderRequestsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<RemoteCallRequest<TRequest>> {\n\treturn graph.node<RemoteCallRequest<TRequest>>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (event.kind === \"request\") ctx.down([[\"DATA\", event.request]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/requests`,\n\t\t\tfactory: \"remoteResponderRequests\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\nfunction remoteResponderStatusNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<RemoteResponderStatus> {\n\treturn graph.node<RemoteResponderStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet status =\n\t\t\t\tctx.state.get<RemoteResponderStatus>() ??\n\t\t\t\t({ state: \"idle\", handled: 0, rejected: 0, errors: 0 } satisfies RemoteResponderStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (event.kind === \"response\") {\n\t\t\t\t\tstatus = {\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tstate: \"responded\",\n\t\t\t\t\t\toperation: event.operation,\n\t\t\t\t\t\trequestId: event.requestId,\n\t\t\t\t\t\thandled: status.handled + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"rejected\") {\n\t\t\t\t\tstatus = {\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tstate: \"rejected\",\n\t\t\t\t\t\toperation: event.operation,\n\t\t\t\t\t\trequestId: event.requestId,\n\t\t\t\t\t\trejected: status.rejected + 1,\n\t\t\t\t\t\terrors: status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tstatus = { ...status, state: \"errored\", errors: status.errors + 1 };\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(status);\n\t\t\tctx.down([[\"DATA\", status]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/status`,\n\t\t\tfactory: \"remoteResponderStatus\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteResponderErrorsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<RemoteCallError> {\n\treturn graph.node<RemoteCallError>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (event.kind === \"rejected\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{ operation: event.operation, requestId: event.requestId, error: event.error },\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", { error: event.error }]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"remoteResponderErrors\", completeWhenDepsComplete: false },\n\t);\n}\n\nfunction armAckTimeout<TPayload>(\n\tctx: Ctx,\n\tstate: BridgeState<TPayload>,\n\tenvelope: WireBridgeEnvelope<TPayload>,\n\topts: WireBridgeOptions,\n\tpolicy: RetryPolicy,\n\tnow: () => number,\n): void {\n\tconst timeoutMs = opts.ackTimeoutMs ?? defaultAckTimeoutMs;\n\tif (!Number.isFinite(timeoutMs) || timeoutMs < 0) {\n\t\tthrow new RangeError(\"wireBridge: ackTimeoutMs must be a non-negative finite number\");\n\t}\n\tconst pending: PendingEnvelope<TPayload> = { envelope };\n\tconst schedule = (current: WireBridgeEnvelope<TPayload>) => {\n\t\tpending.timer = setTimeout(() => {\n\t\t\tpending.timer = undefined;\n\t\t\tif (!state.active || !state.pending.has(current.metadata.seq)) return;\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"timeout\",\n\t\t\t\t\t\tseq: current.metadata.seq,\n\t\t\t\t\t\tattempt: current.metadata.attempt,\n\t\t\t\t\t} satisfies WireBridgeEvent<TPayload, unknown>,\n\t\t\t\t],\n\t\t\t]);\n\t\t\tif (!shouldRetry(policy, current.metadata.attempt)) {\n\t\t\t\tconst error = `${opts.sessionId}: ack timeout for seq ${current.metadata.seq}`;\n\t\t\t\tstate.pending.delete(current.metadata.seq);\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: \"exhausted\",\n\t\t\t\t\t\t\tseq: current.metadata.seq,\n\t\t\t\t\t\t\tattempt: current.metadata.attempt,\n\t\t\t\t\t\t\terror,\n\t\t\t\t\t\t} satisfies WireBridgeEvent<TPayload, unknown>,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst attempt = current.metadata.attempt + 1;\n\t\t\tconst delayMs = nextRetryDelayMs(policy, attempt) ?? 0;\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"retry\",\n\t\t\t\t\t\tseq: current.metadata.seq,\n\t\t\t\t\t\tattempt,\n\t\t\t\t\t\tdelayMs,\n\t\t\t\t\t\terror: `${opts.sessionId}: ack timeout for seq ${current.metadata.seq}`,\n\t\t\t\t\t} satisfies WireBridgeEvent<TPayload, unknown>,\n\t\t\t\t],\n\t\t\t]);\n\t\t\tconst retry = wireBridgeEnvelope<TPayload>({\n\t\t\t\tsessionId: current.sessionId,\n\t\t\t\ttype: current.type,\n\t\t\t\tseq: current.metadata.seq,\n\t\t\t\tcursor: state.cursor,\n\t\t\t\tpayload: current.payload,\n\t\t\t\tidempotencyKey: current.metadata.idempotencyKey,\n\t\t\t\tattempt,\n\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\ttimestampMs: now(),\n\t\t\t\trequestId: current.metadata.requestId,\n\t\t\t});\n\t\t\tpending.timer = setTimeout(() => {\n\t\t\t\tpending.timer = undefined;\n\t\t\t\tif (!state.active || !state.pending.has(current.metadata.seq)) return;\n\t\t\t\tpending.envelope = retry;\n\t\t\t\tctx.down([[\"DATA\", { kind: \"outbound\", envelope: retry }]]);\n\t\t\t\tschedule(retry);\n\t\t\t}, delayMs);\n\t\t}, timeoutMs);\n\t};\n\tstate.pending.set(envelope.metadata.seq, pending);\n\tschedule(envelope);\n}\n\nfunction processInbound<TOutbound, TInbound>(\n\tctx: Ctx,\n\tstate: BridgeState<TOutbound>,\n\tinput: unknown,\n\tsessionId: string,\n): void {\n\tif (isInvalidIngress(input)) {\n\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: input.error }]]);\n\t\treturn;\n\t}\n\tconst invalid = validateInboundEnvelope(input);\n\tif (invalid !== undefined) {\n\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: invalid }]]);\n\t\treturn;\n\t}\n\tconst envelope = input as WireBridgeEnvelope<TInbound>;\n\tif (envelope.sessionId !== sessionId) {\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"session-mismatch\",\n\t\t\t\t\texpected: sessionId,\n\t\t\t\t\tactual: envelope.sessionId,\n\t\t\t\t} satisfies WireBridgeEvent<TOutbound, TInbound>,\n\t\t\t],\n\t\t]);\n\t\treturn;\n\t}\n\tconst seq = envelope.metadata.seq;\n\tconst expected = state.cursor + 1;\n\tif (seq <= state.cursor) {\n\t\tctx.down([[\"DATA\", { kind: \"duplicate\", seq, cursor: state.cursor }]]);\n\t\treturn;\n\t}\n\tif (seq > expected) {\n\t\tctx.down([[\"DATA\", { kind: \"out-of-order\", seq, expected }]]);\n\t\treturn;\n\t}\n\tif (envelope.metadata.cursor < state.remoteCursor) {\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"invalid\",\n\t\t\t\t\terror: `${sessionId}: inbound cursor ${envelope.metadata.cursor} regressed below ${state.remoteCursor}`,\n\t\t\t\t},\n\t\t\t],\n\t\t]);\n\t\treturn;\n\t}\n\tstate.remoteCursor = envelope.metadata.cursor;\n\tstate.cursor = seq;\n\tctx.down([[\"DATA\", { kind: \"cursor\", cursor: state.cursor }]]);\n\tctx.down([[\"DATA\", { kind: \"inbound\", envelope }]]);\n\tif (envelope.type === \"ack\" && envelope.metadata.ackForSeq !== undefined) {\n\t\tconst pending = state.pending.get(envelope.metadata.ackForSeq);\n\t\tif (pending === undefined) {\n\t\t\tctx.down([\n\t\t\t\t[\"DATA\", { kind: \"late-receipt\", receipt: \"ack\", ackForSeq: envelope.metadata.ackForSeq }],\n\t\t\t]);\n\t\t\treturn;\n\t\t}\n\t\tif (pending?.timer !== undefined) clearTimeout(pending.timer);\n\t\tstate.pending.delete(envelope.metadata.ackForSeq);\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"ack\",\n\t\t\t\t\tackForSeq: envelope.metadata.ackForSeq,\n\t\t\t\t\tenvelope,\n\t\t\t\t\toutbound: pending.envelope,\n\t\t\t\t} satisfies WireBridgeEvent<TOutbound, TInbound>,\n\t\t\t],\n\t\t]);\n\t} else if (envelope.type === \"nack\" && envelope.metadata.ackForSeq !== undefined) {\n\t\tconst pending = state.pending.get(envelope.metadata.ackForSeq);\n\t\tif (pending === undefined) {\n\t\t\tctx.down([\n\t\t\t\t[\"DATA\", { kind: \"late-receipt\", receipt: \"nack\", ackForSeq: envelope.metadata.ackForSeq }],\n\t\t\t]);\n\t\t\treturn;\n\t\t}\n\t\tif (pending?.timer !== undefined) clearTimeout(pending.timer);\n\t\tstate.pending.delete(envelope.metadata.ackForSeq);\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"nack\",\n\t\t\t\t\tackForSeq: envelope.metadata.ackForSeq,\n\t\t\t\t\tenvelope,\n\t\t\t\t\toutbound: pending.envelope,\n\t\t\t\t\terror: bridgePayloadError(envelope.payload, \"remote nack\"),\n\t\t\t\t} satisfies WireBridgeEvent<TOutbound, TInbound>,\n\t\t\t],\n\t\t]);\n\t}\n}\n\nfunction validateInboundEnvelope(envelope: unknown): string | undefined {\n\tif (typeof envelope !== \"object\" || envelope === null) {\n\t\treturn \"wireBridge: inbound envelope must be an object\";\n\t}\n\tconst candidate = envelope as Partial<WireBridgeEnvelope<unknown>>;\n\tif (typeof candidate.sessionId !== \"string\" || candidate.sessionId.length === 0) {\n\t\treturn \"wireBridge: inbound envelope sessionId must be a non-empty string\";\n\t}\n\tif (\n\t\ttypeof candidate.type !== \"string\" ||\n\t\t!envelopeTypes.has(candidate.type as WireBridgeEnvelopeType)\n\t) {\n\t\treturn \"wireBridge: inbound envelope type is not recognized\";\n\t}\n\tconst metadata = candidate.metadata as Partial<WireBridgeMetadata> | undefined;\n\tif (typeof metadata !== \"object\" || metadata === null) {\n\t\treturn \"wireBridge: inbound envelope metadata must be an object\";\n\t}\n\tif (!isSafePositiveInteger(metadata.seq)) {\n\t\treturn \"wireBridge: inbound envelope seq must be a positive integer\";\n\t}\n\tif (!isSafeNonNegativeInteger(metadata.cursor)) {\n\t\treturn \"wireBridge: inbound envelope cursor must be a non-negative integer\";\n\t}\n\tif (\n\t\ttypeof metadata.idempotencyKey !== \"string\" ||\n\t\t(metadata.idempotencyKey as string).length === 0\n\t) {\n\t\treturn \"wireBridge: inbound envelope idempotencyKey must be a non-empty string\";\n\t}\n\tif (!isSafePositiveInteger(metadata.attempt)) {\n\t\treturn \"wireBridge: inbound envelope attempt must be a positive integer\";\n\t}\n\tif (\n\t\t!isSafePositiveInteger(metadata.maxAttempts) ||\n\t\t(metadata.maxAttempts as number) < (metadata.attempt as number)\n\t) {\n\t\treturn \"wireBridge: inbound envelope maxAttempts must be >= attempt\";\n\t}\n\tif (metadata.ackForSeq !== undefined && !isSafePositiveInteger(metadata.ackForSeq)) {\n\t\treturn \"wireBridge: inbound envelope ackForSeq must be a positive integer\";\n\t}\n\tif ((candidate.type === \"ack\" || candidate.type === \"nack\") && metadata.ackForSeq === undefined) {\n\t\treturn `wireBridge: inbound ${candidate.type} envelope requires ackForSeq`;\n\t}\n\tconst payloadError = validatePayloadForType(\n\t\tcandidate.type as WireBridgeEnvelopeType,\n\t\tcandidate.payload,\n\t\t\"wireBridge: inbound envelope\",\n\t);\n\tif (payloadError !== undefined) return payloadError;\n\treturn undefined;\n}\n\nfunction validateCommand(value: unknown): string | undefined {\n\tif (typeof value !== \"object\" || value === null) {\n\t\treturn \"wireBridge: command fact must be an object\";\n\t}\n\tconst kind = (value as { readonly kind?: unknown }).kind;\n\tif (\n\t\tkind !== \"start\" &&\n\t\tkind !== \"send\" &&\n\t\tkind !== \"ack\" &&\n\t\tkind !== \"nack\" &&\n\t\tkind !== \"close\"\n\t) {\n\t\treturn \"wireBridge: command kind is not recognized\";\n\t}\n\tif (\n\t\t(kind === \"ack\" || kind === \"nack\") &&\n\t\t!isSafePositiveInteger((value as { readonly ackForSeq?: unknown }).ackForSeq)\n\t) {\n\t\treturn `wireBridge: ${kind} command ackForSeq must be a positive integer`;\n\t}\n\treturn undefined;\n}\n\nfunction projectOutbound<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeEnvelope<TOutbound>> {\n\treturn graph.node<WireBridgeEnvelope<TOutbound>>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"outbound\") ctx.down([[\"DATA\", event.envelope]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/outbound`, factory: \"wireBridgeOutbound\" },\n\t);\n}\n\nfunction projectAcks<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeAck> {\n\treturn graph.node<WireBridgeAck>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"ack\") {\n\t\t\t\t\tctx.down([[\"DATA\", { ackForSeq: event.ackForSeq, envelope: event.envelope }]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/acks`, factory: \"wireBridgeAcks\" },\n\t);\n}\n\nfunction projectNacks<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeNack> {\n\treturn graph.node<WireBridgeNack>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"nack\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\"DATA\", { ackForSeq: event.ackForSeq, envelope: event.envelope, error: event.error }],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/nacks`, factory: \"wireBridgeNacks\" },\n\t);\n}\n\nfunction projectStatus<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n\tsessionId: string,\n): Node<WireBridgeStatus> {\n\treturn graph.node<WireBridgeStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet next =\n\t\t\t\tctx.state.get<WireBridgeStatus>() ??\n\t\t\t\t({\n\t\t\t\t\tsessionId,\n\t\t\t\t\tstate: \"idle\",\n\t\t\t\t\tcursor: 0,\n\t\t\t\t\tnextSeq: 1,\n\t\t\t\t\tpending: 0,\n\t\t\t\t\tattempts: 0,\n\t\t\t\t\tacked: 0,\n\t\t\t\t\tnacked: 0,\n\t\t\t\t\terrors: 0,\n\t\t\t\t} satisfies WireBridgeStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst { seq, attempt } = event.envelope.metadata;\n\t\t\t\t\tconst trackAck = shouldTrackAck(event.envelope.type);\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate:\n\t\t\t\t\t\t\tevent.envelope.type === \"start\"\n\t\t\t\t\t\t\t\t? \"started\"\n\t\t\t\t\t\t\t\t: event.envelope.type === \"close\"\n\t\t\t\t\t\t\t\t\t? \"closed\"\n\t\t\t\t\t\t\t\t\t: \"open\",\n\t\t\t\t\t\tnextSeq: Math.max(next.nextSeq, seq + 1),\n\t\t\t\t\t\tpending:\n\t\t\t\t\t\t\tevent.envelope.type === \"close\"\n\t\t\t\t\t\t\t\t? 1\n\t\t\t\t\t\t\t\t: trackAck && attempt === 1\n\t\t\t\t\t\t\t\t\t? next.pending + 1\n\t\t\t\t\t\t\t\t\t: next.pending,\n\t\t\t\t\t\tattempts: trackAck ? next.attempts + 1 : next.attempts,\n\t\t\t\t\t\tlastSeq: seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"ack\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: event.outbound.type === \"close\" ? \"closed\" : \"open\",\n\t\t\t\t\t\tpending: Math.max(0, next.pending - 1),\n\t\t\t\t\t\tacked: next.acked + 1,\n\t\t\t\t\t\tlastSeq: event.envelope.metadata.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"nack\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\tpending: Math.max(0, next.pending - 1),\n\t\t\t\t\t\tnacked: next.nacked + 1,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastSeq: event.envelope.metadata.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"retry\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"waiting\",\n\t\t\t\t\t\tlastSeq: event.seq,\n\t\t\t\t\t\tlastDelayMs: event.delayMs,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"exhausted\",\n\t\t\t\t\t\tpending: Math.max(0, next.pending - 1),\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastSeq: event.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"cursor\") {\n\t\t\t\t\tnext = { ...next, cursor: event.cursor };\n\t\t\t\t} else if (event.kind === \"out-of-order\") {\n\t\t\t\t\tnext = { ...next, state: \"errored\", errors: next.errors + 1, lastSeq: event.seq };\n\t\t\t\t} else if (event.kind === \"session-mismatch\") {\n\t\t\t\t\tnext = { ...next, state: \"errored\", errors: next.errors + 1 };\n\t\t\t\t} else if (event.kind === \"late-receipt\" || event.kind === \"invalid\") {\n\t\t\t\t\tnext = { ...next, state: \"errored\", errors: next.errors + 1 };\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.type === \"error\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastSeq: event.envelope.metadata.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.type === \"close\") {\n\t\t\t\t\tnext = { ...next, state: \"closed\", lastSeq: event.envelope.metadata.seq };\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"wireBridgeStatus\" },\n\t);\n}\n\nfunction projectErrors<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<unknown> {\n\treturn graph.node<unknown>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"nack\") ctx.down([[\"DATA\", event.error]]);\n\t\t\t\telse if (event.kind === \"exhausted\") ctx.down([[\"DATA\", event.error]]);\n\t\t\t\telse if (event.kind === \"out-of-order\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t`${name}: inbound seq ${event.seq} arrived before expected seq ${event.expected}`,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.type === \"error\") {\n\t\t\t\t\tctx.down([[\"DATA\", bridgePayloadError(event.envelope.payload, \"remote error envelope\")]]);\n\t\t\t\t} else if (event.kind === \"session-mismatch\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t`${name}: inbound session ${event.actual} did not match expected ${event.expected}`,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"late-receipt\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t`${name}: late ${event.receipt} for unknown or completed ackForSeq ${event.ackForSeq}`,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", event.error]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"wireBridgeErrors\" },\n\t);\n}\n\nfunction projectCursor<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<number> {\n\treturn graph.node<number>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"cursor\") ctx.down([[\"DATA\", event.cursor]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/cursor`, factory: \"wireBridgeCursor\" },\n\t);\n}\n\nfunction projectAttempts<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeAttempt> {\n\treturn graph.node<WireBridgeAttempt>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"outbound\" && shouldTrackAck(event.envelope.type)) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tseq: event.envelope.metadata.seq,\n\t\t\t\t\t\t\t\tattempt: event.envelope.metadata.attempt,\n\t\t\t\t\t\t\t\tmaxAttempts: event.envelope.metadata.maxAttempts,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/attempts`, factory: \"wireBridgeAttempts\" },\n\t);\n}\n\nfunction guardedInboundNode<TInbound>(\n\tnode: Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>,\n\tsessionId: string,\n): Node<WireBridgeEnvelope<TInbound>> {\n\treturn new Proxy(node, {\n\t\tget(target, property) {\n\t\t\tif (property === \"down\") {\n\t\t\t\treturn (msgs: Wave) => target.down(guardInboundWave(msgs, sessionId));\n\t\t\t}\n\t\t\tconst value = Reflect.get(target, property, target);\n\t\t\treturn typeof value === \"function\" ? value.bind(target) : value;\n\t\t},\n\t}) as Node<WireBridgeEnvelope<TInbound>>;\n}\n\nfunction guardInboundWave(msgs: Wave, sessionId: string): Wave {\n\treturn msgs.map((msg) => {\n\t\tif (msg[0] === \"DATA\") return msg;\n\t\tif (msg[0] === \"ERROR\") {\n\t\t\treturn [\n\t\t\t\t\"DATA\",\n\t\t\t\tinvalidIngress(\n\t\t\t\t\t`${sessionId}: inbound protocol ERROR ${String(\n\t\t\t\t\t\terrorPayload(msg[1]),\n\t\t\t\t\t)} is local misuse; remote errors must arrive as DATA envelope facts`,\n\t\t\t\t),\n\t\t\t];\n\t\t}\n\t\tif (msg[0] === \"COMPLETE\") {\n\t\t\treturn [\n\t\t\t\t\"DATA\",\n\t\t\t\tinvalidIngress(\n\t\t\t\t\t`${sessionId}: inbound protocol COMPLETE is local misuse; remote completion must arrive as a DATA envelope fact`,\n\t\t\t\t),\n\t\t\t];\n\t\t}\n\t\treturn [\n\t\t\t\"DATA\",\n\t\t\tinvalidIngress(\n\t\t\t\t`${sessionId}: inbound port accepts DATA envelope facts only; ${msg[0]} is local protocol traffic`,\n\t\t\t),\n\t\t];\n\t});\n}\n\nfunction invalidIngress(error: string): WireBridgeInvalidIngress {\n\treturn { __wireBridgeInvalidIngress: true, error };\n}\n\nfunction isInvalidIngress(value: unknown): value is WireBridgeInvalidIngress {\n\treturn (\n\t\ttypeof value === \"object\" &&\n\t\tvalue !== null &&\n\t\t(value as WireBridgeInvalidIngress).__wireBridgeInvalidIngress === true &&\n\t\ttypeof (value as WireBridgeInvalidIngress).error === \"string\"\n\t);\n}\n\nfunction shouldTrackAck(type: WireBridgeEnvelopeType): boolean {\n\treturn type === \"start\" || type === \"data\" || type === \"close\";\n}\n\nfunction isSafePositiveInteger(value: unknown): value is number {\n\treturn Number.isSafeInteger(value) && (value as number) > 0;\n}\n\nfunction isSafeNonNegativeInteger(value: unknown): value is number {\n\treturn Number.isSafeInteger(value) && (value as number) >= 0;\n}\n\nfunction validatePayloadForType(\n\ttype: WireBridgeEnvelopeType,\n\tpayload: unknown,\n\tprefix: string,\n): string | undefined {\n\tconst kind =\n\t\ttypeof payload === \"object\" && payload !== null\n\t\t\t? (payload as { readonly kind?: unknown }).kind\n\t\t\t: undefined;\n\tswitch (type) {\n\t\tcase \"data\":\n\t\t\treturn kind === \"data\" && (payload as { readonly value?: unknown }).value !== undefined\n\t\t\t\t? undefined\n\t\t\t\t: `${prefix}: data envelope requires data payload`;\n\t\tcase \"nack\":\n\t\tcase \"error\":\n\t\t\treturn kind === \"error\" && (payload as { readonly error?: unknown }).error !== undefined\n\t\t\t\t? undefined\n\t\t\t\t: `${prefix}: ${type} envelope requires error payload`;\n\t\tcase \"status\":\n\t\t\treturn kind === \"status\" && (payload as { readonly status?: unknown }).status !== undefined\n\t\t\t\t? undefined\n\t\t\t\t: `${prefix}: status envelope requires status payload`;\n\t\tcase \"close\":\n\t\t\treturn kind === \"close\" ? undefined : `${prefix}: close envelope requires close payload`;\n\t\tcase \"start\":\n\t\tcase \"ack\":\n\t\t\treturn payload === undefined\n\t\t\t\t? undefined\n\t\t\t\t: `${prefix}: ${type} envelope must not carry a payload`;\n\t}\n}\n\nfunction bridgePayloadError(payload: unknown, fallback: unknown): unknown {\n\tif (\n\t\ttypeof payload === \"object\" &&\n\t\tpayload !== null &&\n\t\t(payload as { readonly kind?: unknown }).kind === \"error\"\n\t) {\n\t\treturn (payload as { readonly error?: unknown }).error;\n\t}\n\treturn fallback;\n}\n\nfunction rethrowGraphRuntimeInvariant(error: unknown): void {\n\tconst message = errorMessage(error);\n\tif (\n\t\tmessage.includes(\"R-reentrancy\") ||\n\t\tmessage.includes(\"R-rewire\") ||\n\t\tmessage.includes(\"R-graph-domain\") ||\n\t\tmessage.includes(\"D37\") ||\n\t\tmessage.includes(\"D22\") ||\n\t\tmessage.includes(\"different graph\") ||\n\t\tmessage.includes(\"cross-graph\") ||\n\t\tmessage.includes(\"wire bridge\") ||\n\t\tmessage.includes(\"mid-fn topology mutation\") ||\n\t\tmessage.includes(\"reentrant dep mutation\") ||\n\t\tmessage.includes(\"feedback cycle\")\n\t) {\n\t\tthrow error;\n\t}\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","/**\n * Graph-visible outbound environment adapters (D130/D132).\n *\n * Async transport work is confined to graph-local EnvironmentDrivers. Each\n * helper returns declared nodes for events/status/attempts/errors instead of a\n * hidden sink side channel.\n */\n\nimport { type Ctx, depBatch } from \"../ctx/types.js\";\nimport type {\n\tDriverCancel,\n\tHttpRequest,\n\tHttpResponse,\n\tProcessCommand,\n\tProcessResult,\n\tWebSocketRequest,\n\tWebSocketSend,\n\tWebSocketSendResult,\n\tWebSocketSessionHandle,\n} from \"../graph/environment.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport {\n\tnextRetryDelayMs,\n\ttype RetryPolicy,\n\tretryPolicy,\n\tshouldRetry,\n} from \"../graph/resilience.js\";\nimport type { Node } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\n\nexport type OutboundEvent<TValue, TResult> =\n\t| { readonly kind: \"attempt\"; readonly value: TValue; readonly attempt: number }\n\t| {\n\t\t\treadonly kind: \"retry\";\n\t\t\treadonly value: TValue;\n\t\t\treadonly attempt: number;\n\t\t\treadonly delayMs: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| {\n\t\t\treadonly kind: \"sent\";\n\t\t\treadonly value: TValue;\n\t\t\treadonly attempt: number;\n\t\t\treadonly result: TResult;\n\t  }\n\t| {\n\t\t\treadonly kind: \"failed\";\n\t\t\treadonly value: TValue;\n\t\t\treadonly attempt: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| {\n\t\t\treadonly kind: \"exhausted\";\n\t\t\treadonly value: TValue;\n\t\t\treadonly attempt: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| { readonly kind: \"upstream-complete\" }\n\t| { readonly kind: \"upstream-error\"; readonly error: unknown };\n\nexport interface OutboundStatus {\n\treadonly state:\n\t\t| \"idle\"\n\t\t| \"running\"\n\t\t| \"waiting\"\n\t\t| \"succeeded\"\n\t\t| \"failed\"\n\t\t| \"exhausted\"\n\t\t| \"completed\";\n\treadonly inFlight: number;\n\treadonly attempt: number;\n\treadonly sent: number;\n\treadonly failed: number;\n\treadonly lastDelayMs?: number;\n}\n\nexport interface OutboundBundle<TValue, TResult> {\n\treadonly events: Node<OutboundEvent<TValue, TResult>>;\n\treadonly status: Node<OutboundStatus>;\n\treadonly attempts: Node<number>;\n\treadonly errors: Node<unknown>;\n}\n\nexport interface OutboundAdapterOptions {\n\treadonly name?: string;\n\treadonly retry?: RetryPolicy;\n}\n\nexport type HttpRequestOf<T> = (value: T) => HttpRequest;\nexport type ProcessCommandOf<T> = (value: T) => ProcessCommand;\nexport type WebSocketSendOf<T> = (value: T) => WebSocketSend;\n\n/** D133 command facts for a graph-visible WebSocket SessionBundle. */\nexport type WebSocketSessionCommand =\n\t| { readonly kind: \"start\" }\n\t| { readonly kind: \"send\"; readonly message: WebSocketSend }\n\t| { readonly kind: \"close\"; readonly code?: number; readonly reason?: string };\n\n/** Inbound facts emitted by the live WebSocket session connection. */\nexport type WebSocketSessionInbound =\n\t| { readonly kind: \"text\"; readonly data: string }\n\t| { readonly kind: \"binary\"; readonly data: Uint8Array };\n\n/** Observable lifecycle facts for bounded D133 reconnect/session progress. */\nexport type WebSocketSessionLifecycle =\n\t| { readonly kind: \"starting\"; readonly attempt: number; readonly maxAttempts: number }\n\t| { readonly kind: \"open\"; readonly attempt: number }\n\t| { readonly kind: \"sent\"; readonly message: WebSocketSend }\n\t| { readonly kind: \"closing\"; readonly code?: number; readonly reason?: string }\n\t| { readonly kind: \"closed\"; readonly code?: number; readonly reason?: string }\n\t| {\n\t\t\treadonly kind: \"retrying\";\n\t\t\treadonly attempt: number;\n\t\t\treadonly nextAttempt: number;\n\t\t\treadonly delayMs: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| { readonly kind: \"exhausted\"; readonly attempt: number; readonly error: unknown };\n\n/** D175 graph-visible outbound disposition for a WebSocket SessionBundle send. */\nexport type WebSocketSessionOutbound =\n\t| { readonly kind: \"queued\"; readonly seq: number; readonly message: WebSocketSend }\n\t| { readonly kind: \"sending\"; readonly seq: number; readonly message: WebSocketSend }\n\t| { readonly kind: \"sent\"; readonly seq: number; readonly message: WebSocketSend }\n\t| {\n\t\t\treadonly kind: \"rejected\";\n\t\t\treadonly seq: number;\n\t\t\treadonly message: WebSocketSend;\n\t\t\treadonly error: unknown;\n\t  }\n\t| {\n\t\t\treadonly kind: \"canceled\";\n\t\t\treadonly seq: number;\n\t\t\treadonly message: WebSocketSend;\n\t\t\treadonly reason: unknown;\n\t  };\n\n/** Current graph-visible WebSocket session status projection. */\nexport interface WebSocketSessionStatus {\n\treadonly state:\n\t\t| \"idle\"\n\t\t| \"connecting\"\n\t\t| \"open\"\n\t\t| \"closing\"\n\t\t| \"closed\"\n\t\t| \"waiting\"\n\t\t| \"exhausted\"\n\t\t| \"errored\";\n\treadonly attempt: number;\n\treadonly maxAttempts: number;\n\treadonly sent: number;\n\treadonly received: number;\n\treadonly errors: number;\n\treadonly lastDelayMs?: number;\n}\n\n/** D133 SessionBundle: all session commands, inbound data, attempts, status, and errors are nodes. */\nexport interface WebSocketSessionBundle {\n\treadonly command: Node<WebSocketSessionCommand>;\n\treadonly inbound: Node<WebSocketSessionInbound>;\n\treadonly lifecycle: Node<WebSocketSessionLifecycle>;\n\treadonly outbound: Node<WebSocketSessionOutbound>;\n\treadonly status: Node<WebSocketSessionStatus>;\n\treadonly errors: Node<unknown>;\n\treadonly attempts: Node<number>;\n\tstart(): void;\n\tsend(message: WebSocketSend | string | Uint8Array): void;\n\tclose(code?: number, reason?: string): void;\n}\n\nexport type WebSocketSessionSendPolicy =\n\t| { readonly kind?: \"reject\" }\n\t| { readonly kind: \"buffer\"; readonly maxPending: number };\n\n/** Options for the D133 WebSocket SessionBundle; retry is bounded unless configured otherwise. */\nexport interface WebSocketSessionOptions {\n\treadonly name?: string;\n\treadonly retry?: RetryPolicy;\n\treadonly sendPolicy?: WebSocketSessionSendPolicy;\n}\n\ntype WebSocketSessionEvent =\n\t| { readonly kind: \"attempt\"; readonly attempt: number; readonly maxAttempts: number }\n\t| { readonly kind: \"open\"; readonly attempt: number }\n\t| { readonly kind: \"message\"; readonly message: WebSocketSessionInbound }\n\t| { readonly kind: \"sent\"; readonly message: WebSocketSend }\n\t| { readonly kind: \"closing\"; readonly code?: number; readonly reason?: string }\n\t| { readonly kind: \"closed\"; readonly code?: number; readonly reason?: string }\n\t| {\n\t\t\treadonly kind: \"retry\";\n\t\t\treadonly attempt: number;\n\t\t\treadonly nextAttempt: number;\n\t\t\treadonly delayMs: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| { readonly kind: \"outbound\"; readonly fact: WebSocketSessionOutbound }\n\t| { readonly kind: \"error\"; readonly error: unknown; readonly attempt?: number }\n\t| { readonly kind: \"exhausted\"; readonly attempt: number; readonly error: unknown };\n\ninterface SendState {\n\tseq: number;\n\tcancels: Map<number, DriverCancel>;\n\ttimers: Map<number, ReturnType<typeof setTimeout>>;\n\tactive: boolean;\n\tcleanupInstalled: boolean;\n}\n\nfunction assertSourceLocal<T>(source: Node<T>): Node<T> {\n\treturn source;\n}\n\nfunction initSendState(ctx: Ctx): SendState {\n\tlet state = ctx.state.get<SendState>();\n\tif (state === undefined) {\n\t\tstate = {\n\t\t\tseq: 0,\n\t\t\tcancels: new Map(),\n\t\t\ttimers: new Map(),\n\t\t\tactive: true,\n\t\t\tcleanupInstalled: false,\n\t\t};\n\t\tctx.state.set(state);\n\t}\n\tstate.active = true;\n\tif (!state.cleanupInstalled) {\n\t\tstate.cleanupInstalled = true;\n\t\tctx.onDeactivation(() => {\n\t\t\tstate.active = false;\n\t\t\tstate.cleanupInstalled = false;\n\t\t\tfor (const cancel of state.cancels.values()) runCancel(cancel);\n\t\t\tfor (const timer of state.timers.values()) clearTimeout(timer);\n\t\t\tstate.cancels.clear();\n\t\t\tstate.timers.clear();\n\t\t});\n\t}\n\treturn state;\n}\n\nfunction runCancel(cancel: DriverCancel): void {\n\ttry {\n\t\tcancel();\n\t} catch {\n\t\t// Driver cancellation is best-effort and must not hide graph-visible outcomes.\n\t}\n}\n\nfunction outboundNodes<TValue, TResult>(\n\tgraph: Graph,\n\tevents: Node<OutboundEvent<TValue, TResult>>,\n\tname: string,\n): OutboundBundle<TValue, TResult> {\n\tconst status = graph.node<OutboundStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tconst current =\n\t\t\t\tctx.state.get<OutboundStatus>() ??\n\t\t\t\t({ state: \"idle\", inFlight: 0, attempt: 0, sent: 0, failed: 0 } satisfies OutboundStatus);\n\t\t\tlet next = current;\n\t\t\tfor (const event of depBatch(ctx, 0) ?? []) {\n\t\t\t\tnext = reduceStatus(next, event as OutboundEvent<TValue, TResult>);\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"outboundStatus\" },\n\t);\n\tconst attempts = graph.node<number>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const event of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst typed = event as OutboundEvent<TValue, TResult>;\n\t\t\t\tif (\"attempt\" in typed) ctx.down([[\"DATA\", typed.attempt]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/attempts`, factory: \"outboundAttempts\" },\n\t);\n\tconst errors = graph.node<unknown>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const event of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst typed = event as OutboundEvent<TValue, TResult>;\n\t\t\t\tif (\"error\" in typed) ctx.down([[\"DATA\", typed.error]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"outboundErrors\" },\n\t);\n\treturn { events, status, attempts, errors };\n}\n\nfunction reduceStatus<TValue, TResult>(\n\tcurrent: OutboundStatus,\n\tevent: OutboundEvent<TValue, TResult>,\n): OutboundStatus {\n\tswitch (event.kind) {\n\t\tcase \"attempt\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"running\",\n\t\t\t\tinFlight: current.inFlight + 1,\n\t\t\t\tattempt: event.attempt,\n\t\t\t};\n\t\tcase \"retry\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"waiting\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tlastDelayMs: event.delayMs,\n\t\t\t};\n\t\tcase \"sent\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"succeeded\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tsent: current.sent + 1,\n\t\t\t\tlastDelayMs: undefined,\n\t\t\t};\n\t\tcase \"failed\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"failed\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tfailed: current.failed + 1,\n\t\t\t};\n\t\tcase \"exhausted\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"exhausted\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tfailed: current.failed + 1,\n\t\t\t};\n\t\tcase \"upstream-complete\":\n\t\t\treturn { ...current, state: \"completed\" };\n\t\tcase \"upstream-error\":\n\t\t\treturn { ...current, state: \"failed\", failed: current.failed + 1 };\n\t}\n}\n\ninterface WebSocketSessionState {\n\tactive: boolean;\n\tconnected: boolean;\n\tcleanupInstalled: boolean;\n\tcurrentAttempt: number;\n\tcurrentSession: WebSocketSessionHandle | undefined;\n\tsendCancels: Map<number, DriverCancel>;\n\tliveSends: Map<number, PendingWebSocketOutbound>;\n\tpendingOutbound: PendingWebSocketOutbound[];\n\ttimers: Map<number, ReturnType<typeof setTimeout>>;\n\tseq: number;\n\toutboundSeq: number;\n}\n\ninterface PendingWebSocketOutbound {\n\treadonly seq: number;\n\treadonly message: WebSocketSend;\n}\n\nfunction initWebSocketSessionState(ctx: Ctx): WebSocketSessionState {\n\tlet state = ctx.state.get<WebSocketSessionState>();\n\tif (state === undefined) {\n\t\tstate = {\n\t\t\tactive: true,\n\t\t\tconnected: false,\n\t\t\tcleanupInstalled: false,\n\t\t\tcurrentAttempt: 0,\n\t\t\tcurrentSession: undefined,\n\t\t\tsendCancels: new Map(),\n\t\t\tliveSends: new Map(),\n\t\t\tpendingOutbound: [],\n\t\t\ttimers: new Map(),\n\t\t\tseq: 0,\n\t\t\toutboundSeq: 0,\n\t\t};\n\t\tctx.state.set(state);\n\t}\n\tstate.active = true;\n\tif (!state.cleanupInstalled) {\n\t\tstate.cleanupInstalled = true;\n\t\tctx.onDeactivation(() => {\n\t\t\tconst sendCancels = [...state.sendCancels.values()];\n\t\t\tconst timers = [...state.timers.values()];\n\t\t\tconst session = state.currentSession;\n\t\t\tstate.active = false;\n\t\t\tstate.cleanupInstalled = false;\n\t\t\tstate.connected = false;\n\t\t\tstate.currentAttempt = 0;\n\t\t\tstate.currentSession = undefined;\n\t\t\tstate.sendCancels.clear();\n\t\t\tstate.liveSends.clear();\n\t\t\tstate.pendingOutbound = [];\n\t\t\tstate.timers.clear();\n\t\t\tfor (const cancel of sendCancels) runCancel(cancel);\n\t\t\tfor (const timer of timers) clearTimeout(timer);\n\t\t\tsession?.cancel();\n\t\t});\n\t}\n\treturn state;\n}\n\nfunction closeWebSocketSessionState(\n\tstate: WebSocketSessionState,\n\tdriverAction: \"cancel\" | \"none\" = \"cancel\",\n): {\n\treadonly canceled: PendingWebSocketOutbound[];\n\treadonly session: WebSocketSessionHandle | undefined;\n} {\n\tconst session = state.currentSession;\n\tconst timers = [...state.timers.values()];\n\tconst sendCancels = [...state.sendCancels.values()];\n\tconst canceled = [...state.pendingOutbound, ...state.liveSends.values()];\n\tstate.connected = false;\n\tstate.currentAttempt = 0;\n\tstate.currentSession = undefined;\n\tstate.timers.clear();\n\tstate.sendCancels.clear();\n\tstate.pendingOutbound = [];\n\tstate.liveSends.clear();\n\tfor (const timer of timers) clearTimeout(timer);\n\tfor (const cancelSend of sendCancels) runCancel(cancelSend);\n\tif (driverAction === \"cancel\") session?.cancel();\n\treturn { canceled, session };\n}\n\nfunction cancelRetryTimers(state: WebSocketSessionState): void {\n\tfor (const timer of state.timers.values()) clearTimeout(timer);\n\tstate.timers.clear();\n}\n\nfunction cleanupWebSocketConnection(\n\tstate: WebSocketSessionState,\n\tdriverAction: \"cancel\" | \"none\" = \"cancel\",\n): PendingWebSocketOutbound[] {\n\tconst session = state.currentSession;\n\tconst sendCancels = [...state.sendCancels.values()];\n\tconst canceled = [...state.liveSends.values()];\n\tstate.connected = false;\n\tstate.currentAttempt = 0;\n\tstate.currentSession = undefined;\n\tstate.sendCancels.clear();\n\tstate.liveSends.clear();\n\tfor (const cancelSend of sendCancels) runCancel(cancelSend);\n\tif (driverAction === \"cancel\") session?.cancel();\n\treturn canceled;\n}\n\nfunction normalizeWebSocketSessionSendPolicy(\n\tpolicy: WebSocketSessionSendPolicy | undefined,\n): { readonly kind: \"reject\" } | { readonly kind: \"buffer\"; readonly maxPending: number } {\n\tif (policy?.kind !== \"buffer\") return { kind: \"reject\" };\n\tif (!Number.isFinite(policy.maxPending) || policy.maxPending < 1) {\n\t\tthrow new Error(\"webSocketSession: buffer sendPolicy requires finite maxPending >= 1\");\n\t}\n\treturn { kind: \"buffer\", maxPending: Math.floor(policy.maxPending) };\n}\n\nfunction webSocketSessionEventNode(\n\tgraph: Graph,\n\tcommand: Node<WebSocketSessionCommand>,\n\trequest: WebSocketRequest,\n\tname: string,\n\tpolicy: RetryPolicy,\n\tsendPolicy: ReturnType<typeof normalizeWebSocketSessionSendPolicy>,\n): Node<WebSocketSessionEvent> {\n\treturn graph.node<WebSocketSessionEvent>(\n\t\t[command],\n\t\t(ctx) => {\n\t\t\tconst state = initWebSocketSessionState(ctx);\n\n\t\t\tconst emitOutbound = (fact: WebSocketSessionOutbound) => {\n\t\t\t\tctx.down([[\"DATA\", { kind: \"outbound\", fact } satisfies WebSocketSessionEvent]]);\n\t\t\t};\n\n\t\t\tconst emitOutboundCanceled = (\n\t\t\t\titems: readonly PendingWebSocketOutbound[],\n\t\t\t\treason: unknown,\n\t\t\t) => {\n\t\t\t\tfor (const item of items) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"canceled\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\treason,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst emitOutboundRejected = (items: readonly PendingWebSocketOutbound[], error: unknown) => {\n\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\tfor (const item of items) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: payload,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst retryOrExhaust = (attempt: number, error: unknown) => {\n\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\tconst canceled = cleanupWebSocketConnection(state);\n\t\t\t\temitOutboundCanceled(canceled, `${name}: connection cleanup`);\n\t\t\t\tif (shouldRetry(policy, attempt)) {\n\t\t\t\t\tconst nextAttempt = attempt + 1;\n\t\t\t\t\tconst delayMs = nextRetryDelayMs(policy, nextAttempt) ?? 0;\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"retry\",\n\t\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\t\tnextAttempt,\n\t\t\t\t\t\t\t\tdelayMs,\n\t\t\t\t\t\t\t\terror: payload,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tconst timerId = state.seq++;\n\t\t\t\t\tconst timer = setTimeout(() => {\n\t\t\t\t\t\tstate.timers.delete(timerId);\n\t\t\t\t\t\tif (!state.active) return;\n\t\t\t\t\t\tstart(nextAttempt);\n\t\t\t\t\t}, delayMs);\n\t\t\t\t\tstate.timers.set(timerId, timer);\n\t\t\t\t} else {\n\t\t\t\t\temitOutboundRejected(state.pendingOutbound, payload);\n\t\t\t\t\tstate.pendingOutbound = [];\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{ kind: \"exhausted\", attempt, error: payload } satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst start = (attempt: number) => {\n\t\t\t\tif (\n\t\t\t\t\t!state.active ||\n\t\t\t\t\tstate.connected ||\n\t\t\t\t\tstate.currentAttempt !== 0 ||\n\t\t\t\t\tstate.timers.size > 0\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst driver = ctx.environment().webSocketDriver();\n\t\t\t\tstate.currentAttempt = attempt;\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: \"attempt\",\n\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t\tconst connectSession = driver?.connectSession;\n\t\t\t\tif (connectSession === undefined) {\n\t\t\t\t\tretryOrExhaust(attempt, `${name}: missing WebSocket session capability`);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet session: WebSocketSessionHandle | undefined;\n\t\t\t\ttry {\n\t\t\t\t\tsession = connectSession.call(driver, request, (event) => {\n\t\t\t\t\t\tif (!state.active || state.currentAttempt !== attempt) return;\n\t\t\t\t\t\tif (event.kind === \"event\") {\n\t\t\t\t\t\t\tconst ws = event.event;\n\t\t\t\t\t\t\tif (ws.kind === \"open\") {\n\t\t\t\t\t\t\t\tstate.connected = true;\n\t\t\t\t\t\t\t\tctx.down([[\"DATA\", { kind: \"open\", attempt } satisfies WebSocketSessionEvent]]);\n\t\t\t\t\t\t\t\tflushPending();\n\t\t\t\t\t\t\t} else if (ws.kind === \"text\" || ws.kind === \"binary\") {\n\t\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tkind: \"message\",\n\t\t\t\t\t\t\t\t\t\t\tmessage: ws satisfies WebSocketSessionInbound,\n\t\t\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\t} else if (ws.kind === \"close\") {\n\t\t\t\t\t\t\t\tconst normalClose = ws.code === 1000;\n\t\t\t\t\t\t\t\tconst canceled = cleanupWebSocketConnection(state);\n\t\t\t\t\t\t\t\temitOutboundCanceled(canceled, `${name}: session closed`);\n\t\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tkind: \"closed\",\n\t\t\t\t\t\t\t\t\t\t\tcode: ws.code,\n\t\t\t\t\t\t\t\t\t\t\treason: ws.reason,\n\t\t\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\t\tif (!normalClose) {\n\t\t\t\t\t\t\t\t\tretryOrExhaust(attempt, {\n\t\t\t\t\t\t\t\t\t\tkind: \"close\",\n\t\t\t\t\t\t\t\t\t\tcode: ws.code,\n\t\t\t\t\t\t\t\t\t\treason: ws.reason,\n\t\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else if (event.kind === \"error\") {\n\t\t\t\t\t\t\tretryOrExhaust(attempt, event.error);\n\t\t\t\t\t\t} else if (event.kind === \"complete\") {\n\t\t\t\t\t\t\tretryOrExhaust(attempt, `${name}: connection completed`);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tretryOrExhaust(attempt, error);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (session === undefined) {\n\t\t\t\t\tretryOrExhaust(attempt, `${name}: missing WebSocket session capability`);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (state.active && state.currentAttempt === attempt) {\n\t\t\t\t\tstate.currentSession = session;\n\t\t\t\t} else {\n\t\t\t\t\tsession.cancel();\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tfunction sendNow(item: PendingWebSocketOutbound): void {\n\t\t\t\tif (!state.connected) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t\t});\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst session = state.currentSession;\n\t\t\t\tif (session === undefined) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: `${name}: missing WebSocket session capability`,\n\t\t\t\t\t});\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\terror: `${name}: missing WebSocket session capability`,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst sendId = state.seq++;\n\t\t\t\tstate.liveSends.set(sendId, item);\n\t\t\t\temitOutbound({ kind: \"sending\", seq: item.seq, message: item.message });\n\t\t\t\tlet done = false;\n\t\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\t\ttry {\n\t\t\t\t\tcancel = session.send(item.message, (result) => {\n\t\t\t\t\t\tif (done || !state.active || !state.liveSends.has(sendId)) return;\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tstate.liveSends.delete(sendId);\n\t\t\t\t\t\tstate.sendCancels.delete(sendId);\n\t\t\t\t\t\tif (result.ok) {\n\t\t\t\t\t\t\temitOutbound({ kind: \"sent\", seq: item.seq, message: item.message });\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\"DATA\", { kind: \"sent\", message: item.message } satisfies WebSocketSessionEvent],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tconst payload = errorPayload(result.error);\n\t\t\t\t\t\t\temitOutbound({\n\t\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\t\t\terror: payload,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\t\t\terror: payload,\n\t\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tstate.liveSends.delete(sendId);\n\t\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: payload,\n\t\t\t\t\t});\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"error\", error: payload } satisfies WebSocketSessionEvent]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (cancel !== undefined && !done && state.active && state.liveSends.has(sendId)) {\n\t\t\t\t\tstate.sendCancels.set(sendId, cancel);\n\t\t\t\t} else if (cancel !== undefined && !state.active) runCancel(cancel);\n\t\t\t}\n\n\t\t\tfunction flushPending(): void {\n\t\t\t\tconst pending = state.pendingOutbound;\n\t\t\t\tstate.pendingOutbound = [];\n\t\t\t\tfor (let index = 0; index < pending.length; index++) {\n\t\t\t\t\tconst item = pending[index];\n\t\t\t\t\tif (!state.connected || state.currentSession === undefined) {\n\t\t\t\t\t\temitOutboundCanceled(pending.slice(index), `${name}: session closed`);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tsendNow(item);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst send = (message: WebSocketSend) => {\n\t\t\t\tconst item = { seq: state.outboundSeq++, message } satisfies PendingWebSocketOutbound;\n\t\t\t\tif (state.connected) {\n\t\t\t\t\tsendNow(item);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (sendPolicy.kind === \"buffer\") {\n\t\t\t\t\tif (state.pendingOutbound.length >= sendPolicy.maxPending) {\n\t\t\t\t\t\temitOutbound({\n\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\t\tmessage,\n\t\t\t\t\t\t\terror: `${name}: outbound buffer full`,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\t\terror: `${name}: outbound buffer full`,\n\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tstate.pendingOutbound.push(item);\n\t\t\t\t\temitOutbound({ kind: \"queued\", seq: item.seq, message });\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\temitOutbound({\n\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\tseq: item.seq,\n\t\t\t\t\tmessage,\n\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t});\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t};\n\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst commandValue = raw as WebSocketSessionCommand;\n\t\t\t\tif (commandValue.kind === \"start\") start(1);\n\t\t\t\telse if (commandValue.kind === \"send\") send(commandValue.message);\n\t\t\t\telse {\n\t\t\t\t\tcancelRetryTimers(state);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"closing\",\n\t\t\t\t\t\t\t\tcode: commandValue.code,\n\t\t\t\t\t\t\t\treason: commandValue.reason,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tconst { canceled, session } = closeWebSocketSessionState(state, \"none\");\n\t\t\t\t\temitOutboundCanceled(canceled, `${name}: session closed`);\n\t\t\t\t\tsession?.close(commandValue.code, commandValue.reason);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"closed\",\n\t\t\t\t\t\t\t\tcode: commandValue.code,\n\t\t\t\t\t\t\t\treason: commandValue.reason,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/events`, factory: \"webSocketSessionEvents\" },\n\t);\n}\n\nfunction webSocketSessionNodes(\n\tgraph: Graph,\n\tcommand: Node<WebSocketSessionCommand>,\n\tevents: Node<WebSocketSessionEvent>,\n\tname: string,\n\tpolicy: RetryPolicy,\n): WebSocketSessionBundle {\n\tconst inbound = graph.node<WebSocketSessionInbound>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"message\") ctx.down([[\"DATA\", event.message]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/inbound`, factory: \"webSocketSessionInbound\" },\n\t);\n\tconst lifecycle = graph.node<WebSocketSessionLifecycle>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"attempt\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"starting\",\n\t\t\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\t\t\tmaxAttempts: event.maxAttempts,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionLifecycle,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"open\") {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"open\", attempt: event.attempt }]]);\n\t\t\t\t} else if (event.kind === \"sent\") {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"sent\", message: event.message }]]);\n\t\t\t\t} else if (event.kind === \"closing\" || event.kind === \"closed\") {\n\t\t\t\t\tctx.down([[\"DATA\", event]]);\n\t\t\t\t} else if (event.kind === \"retry\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"retrying\",\n\t\t\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\t\t\tnextAttempt: event.nextAttempt,\n\t\t\t\t\t\t\t\tdelayMs: event.delayMs,\n\t\t\t\t\t\t\t\terror: event.error,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionLifecycle,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tctx.down([[\"DATA\", event]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/lifecycle`, factory: \"webSocketSessionLifecycle\" },\n\t);\n\tconst outbound = graph.node<WebSocketSessionOutbound>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"outbound\") ctx.down([[\"DATA\", event.fact]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/outbound`, factory: \"webSocketSessionOutbound\" },\n\t);\n\tconst status = graph.node<WebSocketSessionStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet next =\n\t\t\t\tctx.state.get<WebSocketSessionStatus>() ??\n\t\t\t\t({\n\t\t\t\t\tstate: \"idle\",\n\t\t\t\t\tattempt: 0,\n\t\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\t\tsent: 0,\n\t\t\t\t\treceived: 0,\n\t\t\t\t\terrors: 0,\n\t\t\t\t} satisfies WebSocketSessionStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"attempt\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"connecting\",\n\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\tmaxAttempts: event.maxAttempts,\n\t\t\t\t\t\tlastDelayMs: undefined,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"open\") {\n\t\t\t\t\tnext = { ...next, state: \"open\", attempt: event.attempt, lastDelayMs: undefined };\n\t\t\t\t} else if (event.kind === \"message\") {\n\t\t\t\t\tnext = { ...next, received: next.received + 1 };\n\t\t\t\t} else if (event.kind === \"sent\") {\n\t\t\t\t\tnext = { ...next, sent: next.sent + 1 };\n\t\t\t\t} else if (event.kind === \"closing\") {\n\t\t\t\t\tnext = { ...next, state: \"closing\" };\n\t\t\t\t} else if (event.kind === \"closed\") {\n\t\t\t\t\tnext = { ...next, state: \"closed\" };\n\t\t\t\t} else if (event.kind === \"retry\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"waiting\",\n\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastDelayMs: event.delayMs,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"error\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\tattempt: event.attempt ?? next.attempt,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"exhausted\",\n\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"webSocketSessionStatus\" },\n\t);\n\tconst errors = graph.node<unknown>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (\"error\" in event) ctx.down([[\"DATA\", event.error]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"webSocketSessionErrors\" },\n\t);\n\tconst attempts = graph.node<number>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"attempt\") ctx.down([[\"DATA\", event.attempt]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/attempts`, factory: \"webSocketSessionAttempts\" },\n\t);\n\treturn {\n\t\tcommand,\n\t\tinbound,\n\t\tlifecycle,\n\t\toutbound,\n\t\tstatus,\n\t\terrors,\n\t\tattempts,\n\t\tstart: () => command.down([[\"DATA\", { kind: \"start\" }]]),\n\t\tsend: (message) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"send\",\n\t\t\t\t\t\tmessage:\n\t\t\t\t\t\t\ttypeof message === \"string\" || message instanceof Uint8Array\n\t\t\t\t\t\t\t\t? { data: message }\n\t\t\t\t\t\t\t\t: message,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tclose: (code, reason) => command.down([[\"DATA\", { kind: \"close\", code, reason }]]),\n\t};\n}\n\n/**\n * Create a graph-visible D133 WebSocket SessionBundle.\n *\n * The convenience start/send/close methods publish command facts only; hidden\n * session state is driven by the command node and graph-local EnvironmentDrivers.\n */\nexport function webSocketSession(\n\tgraph: Graph,\n\trequest: WebSocketRequest,\n\topts: WebSocketSessionOptions = {},\n): WebSocketSessionBundle {\n\tconst name = opts.name ?? \"webSocketSession\";\n\tconst policy = opts.retry ?? retryPolicy();\n\tconst sendPolicy = normalizeWebSocketSessionSendPolicy(opts.sendPolicy);\n\tconst command = graph.node<WebSocketSessionCommand>([], null, {\n\t\tname: `${name}/command`,\n\t\tfactory: \"webSocketSessionCommand\",\n\t});\n\tconst events = webSocketSessionEventNode(graph, command, request, name, policy, sendPolicy);\n\treturn webSocketSessionNodes(graph, command, events, name, policy);\n}\n\nfunction outboundNode<TValue, TResult>(\n\tgraph: Graph,\n\tsource: Node<TValue>,\n\tname: string,\n\tsend: (\n\t\tctx: Ctx,\n\t\tvalue: TValue,\n\t\tcallback: (result: { ok: true; value: TResult } | { ok: false; error: unknown }) => void,\n\t) => DriverCancel | undefined,\n\topts: OutboundAdapterOptions,\n): Node<OutboundEvent<TValue, TResult>> {\n\tconst policy = opts.retry ?? retryPolicy();\n\treturn graph.node<OutboundEvent<TValue, TResult>>(\n\t\t[assertSourceLocal(source)],\n\t\t(ctx) => {\n\t\t\tconst state = initSendState(ctx);\n\t\t\tconst start = (value: TValue, attempt: number) => {\n\t\t\t\tif (!state.active) return;\n\t\t\t\tconst id = state.seq++;\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", { kind: \"attempt\", value, attempt } satisfies OutboundEvent<TValue, TResult>],\n\t\t\t\t]);\n\t\t\t\tconst failTerminal = (error: unknown) => {\n\t\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{ kind: \"exhausted\", value, attempt, error: payload } satisfies OutboundEvent<\n\t\t\t\t\t\t\t\tTValue,\n\t\t\t\t\t\t\t\tTResult\n\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tctx.down([[\"ERROR\", payload]]);\n\t\t\t\t};\n\t\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\t\tlet done = false;\n\t\t\t\ttry {\n\t\t\t\t\tcancel = send(ctx, value, (result) => {\n\t\t\t\t\t\tif (done || !state.active) return;\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tstate.cancels.delete(id);\n\t\t\t\t\t\tif (result.ok) {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{ kind: \"sent\", value, attempt, result: result.value } satisfies OutboundEvent<\n\t\t\t\t\t\t\t\t\t\tTValue,\n\t\t\t\t\t\t\t\t\t\tTResult\n\t\t\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (shouldRetry(policy, attempt)) {\n\t\t\t\t\t\t\tconst nextAttempt = attempt + 1;\n\t\t\t\t\t\t\tconst delayMs = nextRetryDelayMs(policy, nextAttempt) ?? 0;\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tkind: \"retry\",\n\t\t\t\t\t\t\t\t\t\tvalue,\n\t\t\t\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\t\t\t\tdelayMs,\n\t\t\t\t\t\t\t\t\t\terror: errorPayload(result.error),\n\t\t\t\t\t\t\t\t\t} satisfies OutboundEvent<TValue, TResult>,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\tconst timer = setTimeout(() => {\n\t\t\t\t\t\t\t\tstate.timers.delete(id);\n\t\t\t\t\t\t\t\tif (!state.active) return;\n\t\t\t\t\t\t\t\tstart(value, nextAttempt);\n\t\t\t\t\t\t\t}, delayMs);\n\t\t\t\t\t\t\tstate.timers.set(id, timer);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tkind: \"exhausted\",\n\t\t\t\t\t\t\t\t\t\tvalue,\n\t\t\t\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\t\t\t\terror: errorPayload(result.error),\n\t\t\t\t\t\t\t\t\t} satisfies OutboundEvent<TValue, TResult>,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tif (!done) {\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tstate.cancels.delete(id);\n\t\t\t\t\t\tfailTerminal(error);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (cancel === undefined) {\n\t\t\t\t\tif (!done) {\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tfailTerminal(`${name}: missing environment driver capability`);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (!done && state.active) {\n\t\t\t\t\tstate.cancels.set(id, cancel);\n\t\t\t\t} else if (!state.active) {\n\t\t\t\t\trunCancel(cancel);\n\t\t\t\t}\n\t\t\t};\n\t\t\tfor (const value of depBatch(ctx, 0) ?? []) start(value as TValue, 1);\n\t\t\tconst terminal = ctx.terminal[0];\n\t\t\tif (terminal === true) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", { kind: \"upstream-complete\" } satisfies OutboundEvent<TValue, TResult>],\n\t\t\t\t]);\n\t\t\t} else if (terminal !== false && terminal !== undefined) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{ kind: \"upstream-error\", error: terminal } satisfies OutboundEvent<TValue, TResult>,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t}\n\t\t},\n\t\t{ name, factory: name },\n\t);\n}\n\nexport function toHttp<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\trequestOf: HttpRequestOf<T>,\n\topts: OutboundAdapterOptions = {},\n): OutboundBundle<T, HttpResponse> {\n\tconst name = opts.name ?? \"toHttp\";\n\tconst events = outboundNode<T, HttpResponse>(\n\t\tgraph,\n\t\tsource,\n\t\tname,\n\t\t(ctx, value, callback) => {\n\t\t\tconst request = requestOf(value);\n\t\t\treturn ctx.environment().httpDriver()?.request(request, callback);\n\t\t},\n\t\topts,\n\t);\n\treturn outboundNodes(graph, events, name);\n}\n\nexport function toProcess<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\tcommandOf: ProcessCommandOf<T>,\n\topts: OutboundAdapterOptions = {},\n): OutboundBundle<T, ProcessResult> {\n\tconst name = opts.name ?? \"toProcess\";\n\tconst events = outboundNode<T, ProcessResult>(\n\t\tgraph,\n\t\tsource,\n\t\tname,\n\t\t(ctx, value, callback) => {\n\t\t\tconst command = commandOf(value);\n\t\t\treturn ctx.environment().processDriver()?.run(command, callback);\n\t\t},\n\t\topts,\n\t);\n\treturn outboundNodes(graph, events, name);\n}\n\nexport function toWebSocket<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\trequest: WebSocketRequest,\n\tsendOf: WebSocketSendOf<T>,\n\topts: OutboundAdapterOptions = {},\n): OutboundBundle<T, WebSocketSendResult> {\n\tconst name = opts.name ?? \"toWebSocket\";\n\tconst events = outboundNode<T, WebSocketSendResult>(\n\t\tgraph,\n\t\tsource,\n\t\tname,\n\t\t(ctx, value, callback) => {\n\t\t\tconst driver = ctx.environment().webSocketDriver();\n\t\t\treturn driver?.send?.(request, sendOf(value), callback);\n\t\t},\n\t\topts,\n\t);\n\treturn outboundNodes(graph, events, name);\n}\n","/**\n * Dependency-free NestJS adapter tokens and method metadata.\n *\n * The old compat layer imported `@nestjs/common` for DI decorators. Clean-slate keeps the\n * retainable token/metadata vocabulary here and leaves actual `Inject(...)` composition to\n * user-land NestJS code, so @graphrefly/ts keeps zero framework dependencies (D125/B61).\n */\n\n/** Injection token for a root graph singleton. */\nexport const GRAPHREFLY_ROOT_GRAPH = Symbol.for(\"graphrefly:root-graph\");\n\n/** Injection token for adapter module options. */\nexport const GRAPHREFLY_MODULE_OPTIONS = Symbol.for(\"graphrefly:module-options\");\n\n/** Injection token for a request-scoped graph. */\nexport const GRAPHREFLY_REQUEST_GRAPH = Symbol.for(\"graphrefly:request-graph\");\n\nexport type DecoratorHostConstructor = abstract new (...args: unknown[]) => unknown;\nexport type DecoratorBoundMethod = (...args: unknown[]) => unknown;\n\nexport interface OnGraphEventMeta {\n\tnodeName: string;\n\tmethodKey: string | symbol;\n}\n\nexport interface GraphIntervalMeta {\n\tms: number;\n\tmethodKey: string | symbol;\n}\n\nexport interface GraphCronMeta {\n\texpr: string;\n\tmethodKey: string | symbol;\n}\n\nexport const EVENT_HANDLERS = new Map<DecoratorHostConstructor, OnGraphEventMeta[]>();\nexport const INTERVAL_HANDLERS = new Map<DecoratorHostConstructor, GraphIntervalMeta[]>();\nexport const CRON_HANDLERS = new Map<DecoratorHostConstructor, GraphCronMeta[]>();\n\nexport type GraphMethodDecorator = MethodDecorator &\n\t((value: DecoratorBoundMethod, context: ClassMethodDecoratorContext) => void);\n\n/** Get the injection token for a named feature graph. */\nexport function getGraphToken(name: string): symbol {\n\treturn Symbol.for(`graphrefly:graph:${name}`);\n}\n\n/** Get the injection token for a node at a qualified path. */\nexport function getNodeToken(path: string): symbol {\n\treturn Symbol.for(`graphrefly:node:${path}`);\n}\n\nfunction sameMeta<T>(a: T, b: T): boolean {\n\tconst left = a as Record<string | symbol, unknown>;\n\tconst right = b as Record<string | symbol, unknown>;\n\tconst keys = Reflect.ownKeys(left);\n\tif (keys.length !== Reflect.ownKeys(right).length) return false;\n\tfor (const key of keys) {\n\t\tif (!Object.is(left[key], right[key])) return false;\n\t}\n\treturn true;\n}\n\nfunction pushUniqueMeta<T>(\n\tregistry: Map<DecoratorHostConstructor, T[]>,\n\tctor: DecoratorHostConstructor,\n\titem: T,\n): void {\n\tconst existing = registry.get(ctor) ?? [];\n\tif (existing.some((current) => sameMeta(current, item))) return;\n\tregistry.set(ctor, [...existing, item]);\n}\n\nfunction registerMeta<T>(\n\tregistry: Map<DecoratorHostConstructor, T[]>,\n\tmeta: (methodKey: string | symbol) => T,\n): GraphMethodDecorator {\n\treturn ((targetOrValue: object, contextOrKey: ClassMethodDecoratorContext | string | symbol) => {\n\t\tif (typeof contextOrKey === \"object\" && contextOrKey !== null) {\n\t\t\tconst methodKey = contextOrKey.name;\n\t\t\tcontextOrKey.addInitializer(function (this: unknown) {\n\t\t\t\tconst ctor = (this as { constructor: DecoratorHostConstructor }).constructor;\n\t\t\t\tpushUniqueMeta(registry, ctor, meta(methodKey));\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\n\t\tconst ctor = (targetOrValue as { constructor: DecoratorHostConstructor }).constructor;\n\t\tpushUniqueMeta(registry, ctor, meta(contextOrKey));\n\t}) as GraphMethodDecorator;\n}\n\n/** Register a method as a DATA-event handler for a graph observe path. */\nexport function OnGraphEvent(nodeName: string): GraphMethodDecorator {\n\treturn registerMeta(EVENT_HANDLERS, (methodKey) => ({ nodeName, methodKey }));\n}\n\n/** Register fixed-interval metadata for a user-land NestJS scheduler bridge. */\nexport function GraphInterval(ms: number): GraphMethodDecorator {\n\treturn registerMeta(INTERVAL_HANDLERS, (methodKey) => ({ ms, methodKey }));\n}\n\n/** Register cron metadata for a user-land NestJS scheduler bridge. */\nexport function GraphCron(expr: string): GraphMethodDecorator {\n\treturn registerMeta(CRON_HANDLERS, (methodKey) => ({ expr, methodKey }));\n}\n","/**\n * The shared reactiveCollection core (CSP-2.8, D60).\n *\n * Every reactive data structure (list/map/index/log) is `collectionCore(backend) + a typed method\n * surface` (D60 #5). The core owns the TWO output ports and nothing else:\n *\n *   - BACKEND — the single materialized state (D60 #1): a plain mutable object with a monotonic\n *     `version` + a `snapshot()`. It applies deltas and IS the materialized state; there is NO ACC\n *     node and NO effect bridge re-deriving it (the misdesign D60 rejected — the backend already\n *     integrates, its cost is intrinsic). The backend is a closure object, not a graph node, so its\n *     durability is structural (survives last-subscriber disconnect; node ROM/RAM is moot, D60 #1).\n *\n *   - DELTA port (D60 #2a) — an always-on bare source ({@link CollectionCore.delta}); each mutation\n *     pushes ONE change payload (O(1)/mutation). Downstream watches events anytime. It is the\n *     structure's BACKBONE: the snapshot node declares it as its dep (D60 reactiveList topology).\n *\n *   - SNAPSHOT port (D60 #2b) — a pull-mode node ({@link CollectionCore.snapshot}, R-pull/D269) that\n *     is QUIET by default and, on a cone-routed PULL demand, LAZILY reads `backend.snapshot()`\n *     (one O(n) materialization) and pushes it once, then re-quiets. The O(n) build happens ONLY on\n *     demand — never eagerly per mutation (D60 #2b: lazy is P·O(n), not M·O(n)). It has NO value of\n *     its own — its fn reads the backend on demand, so the backend stays the single source of truth\n *     (D60 #3). Coalesce-on-no-change is free: the delta-dep's DIRTY/DATA arms the pull node via\n *     R-pull's quiet-absorb accounting; a demand with no intervening delta emits no duplicate DATA.\n *\n * Demand path: a downstream consumer issues `ctx.upNext([[\"PULL\", { pullId: core.pullId }]])`\n * (boundary-deferred self-demand, R-up-routing/D269) — it needs the snapshot node upstream in its\n * declared cone, NOT its reference. Cold-start (a demand before any mutation) emits no DATA; for an\n * initial/imperative read use the structure's synchronous quick-read (the deliberately-non-reactive\n * peek, D60) — the reactive pull serves the watch-delta-then-demand pattern.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch } from \"../../ctx/types.js\";\nimport type { Dispatcher } from \"../../dispatcher/index.js\";\nimport { Node, releaseRuntimeOfNode } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport { type GraphCheckpointJson, registerBackendStateContributor } from \"../checkpoint.js\";\nimport type { Graph } from \"../graph.js\";\nimport type { Operator } from \"../operators.js\";\nimport type { ViewCachePolicy } from \"../policies/types.js\";\n\n/** The materialized-state contract a structure's backend must satisfy (D60 #1). */\nexport interface CollectionBackend<S> {\n\t/** Monotonic mutation counter; advances on every visible state change (idempotency, D49). */\n\treadonly version: number;\n\t/** A fresh defensive materialization of the current state (D60: first-cut defensive copy). */\n\tsnapshot(): S;\n}\n\nexport interface CollectionCoreOptions {\n\t/** Debug/inspection name; the delta/snapshot nodes derive `${name}.delta` / `${name}.snapshot`. */\n\tname?: string;\n\t/** Dispatcher for the core's nodes (default = process-global, D26). */\n\tdispatcher?: Dispatcher;\n\t/** Graph funnel for describe-visible input folds (D61). Required by *From/attach methods. */\n\tgraph?: Graph;\n}\n\nexport interface CollectionCore<S, C> {\n\t/** DELTA backbone (D60 #2a): a bare source; every {@link CollectionCore.emit} pushes one change. */\n\treadonly delta: Node<C>;\n\t/** SNAPSHOT pull node (D60 #2b): demand via `ctx.upNext([[\"PULL\", { pullId }]])`; lazy O(n) on demand. */\n\treadonly snapshot: Node<S>;\n\t/** The snapshot node's pullId — the author writes it verbatim into the demander's fn (D269). */\n\treadonly pullId: symbol;\n\t/** Push one delta event (the imperative path: a method mutates the backend, then calls this). */\n\temit(change: C): void;\n\t/**\n\t * D54 widening: fold an in-graph producer `src` into the backend. `apply` mutates the backend +\n\t * `emit`s the change(s). The folder is a DECLARED-dep node (describe shows `src → folder`, NOT a\n\t * D45 island); its emit is the structure's plumbing (D54-sanctioned). Returns a disposer.\n\t */\n\tbindSource<V>(src: Node<V>, apply: (value: V) => void): () => void;\n}\n\n/**\n * Public D121 collection-view surface. A view is a derived surface: `delta` is the pushed update\n * port, `snapshot` is a lazy pull node, and neither port is writable authority.\n */\nexport interface ReactiveView<C, S> {\n\t/** Derived DELTA/update stream for the view. For light views this is recomputed from the parent backend. */\n\treadonly delta: Node<C>;\n\t/** Derived SNAPSHOT pull node: demand via `pullId` to materialize the current view. */\n\treadonly snapshot: Node<S>;\n\t/** The snapshot node's pullId (R-pull/D269), minted per view instance. */\n\treadonly pullId: symbol;\n\t/** Release memoized/light-view resources owned by the parent collection. */\n\tdispose(): void;\n}\n\ninterface LightReactiveViewOptions<S> extends CollectionCoreOptions {\n\treadonly factory: string;\n\treadonly materializeSnapshot: () => S;\n\treadonly onDispose?: () => void;\n}\n\ninterface CollectionRestoreSpec {\n\treadonly deltaRef: string;\n\treadonly snapshotRef: string;\n\treadonly config?: GraphCheckpointJson;\n\treadonly backendState: () => unknown;\n}\n\nfunction validateViewCacheMaxEntries(policy: ViewCachePolicy | undefined): number | undefined {\n\tconst maxEntries = policy?.maxEntries;\n\tif (maxEntries === undefined) return undefined;\n\tif (!Number.isInteger(maxEntries) || maxEntries < 0) {\n\t\tthrow new RangeError(`viewCache.maxEntries must be a non-negative integer (got ${maxEntries})`);\n\t}\n\treturn maxEntries;\n}\n\n/**\n * Internal D80 memo manager for derived views. Eviction drops only the structure's memo lookup;\n * returned ReactiveView handles remain live until explicitly disposed or their parent releases all\n * live views.\n */\nexport class ViewMemoCache<K, V extends { dispose(): void }> {\n\tprivate readonly maxEntries: number | undefined;\n\tprivate readonly equals: (a: K, b: K) => boolean;\n\tprivate readonly memo: Array<{ key: K; value: V }> = [];\n\tprivate readonly live = new Set<V>();\n\n\tconstructor(policy: ViewCachePolicy | undefined, equals: (a: K, b: K) => boolean = Object.is) {\n\t\tthis.maxEntries = validateViewCacheMaxEntries(policy);\n\t\tthis.equals = equals;\n\t}\n\n\tget(key: K): V | undefined {\n\t\tconst index = this.memo.findIndex((entry) => this.equals(entry.key, key));\n\t\tif (index < 0) return undefined;\n\t\tconst [entry] = this.memo.splice(index, 1);\n\t\tif (entry === undefined) return undefined;\n\t\tthis.memo.push(entry);\n\t\treturn entry.value;\n\t}\n\n\tset(key: K, value: V): void {\n\t\tthis.deleteValue(value);\n\t\tthis.live.add(value);\n\t\tif (this.maxEntries === 0) return;\n\t\tthis.memo.push({ key, value });\n\t\twhile (this.maxEntries !== undefined && this.memo.length > this.maxEntries) {\n\t\t\tthis.memo.shift();\n\t\t}\n\t}\n\n\tdeleteValue(value: V): void {\n\t\tfor (let i = this.memo.length - 1; i >= 0; i -= 1) {\n\t\t\tif (this.memo[i]?.value === value) this.memo.splice(i, 1);\n\t\t}\n\t\tthis.live.delete(value);\n\t}\n\n\tdisposeAll(): void {\n\t\tfor (const view of [...this.live]) view.dispose();\n\t\tthis.memo.length = 0;\n\t\tthis.live.clear();\n\t}\n}\n\n/**\n * Build a D121 first-cut light view. The view declares `parent.delta -> view.delta ->\n * view.snapshot`; the pushed `delta` forwards parent delta events as the view's arm/update stream,\n * while `snapshot` reads the parent collection backend through the supplied materializer on demand.\n * No writable state/cache is exposed (D120).\n */\nexport function lightReactiveView<C, S>(\n\tparentDelta: Node<unknown>,\n\topts: LightReactiveViewOptions<S>,\n): ReactiveView<C, S> {\n\tconst { dispatcher, factory, graph, materializeSnapshot, name, onDispose } = opts;\n\tconst base = dispatcher ? { dispatcher } : {};\n\tconst group = graph?.topologyGroup({ name: name ?? factory });\n\tconst deltaBody = (ctx: Ctx): void => {\n\t\tfor (const change of (depBatch(ctx, 0) ?? []) as readonly C[]) {\n\t\t\tctx.down([[\"DATA\", change]]);\n\t\t}\n\t};\n\tconst delta = group\n\t\t? group.node<C>([parentDelta], deltaBody, {\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tmeta: { kind: \"collection_view_delta\", factory },\n\t\t\t\tpartial: true,\n\t\t\t})\n\t\t: new Node<C>([parentDelta], deltaBody, {\n\t\t\t\t...base,\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tpartial: true,\n\t\t\t});\n\n\tconst pullId = Symbol(name ? `${name}.snapshot` : `${factory}.snapshot`);\n\tconst snapshotBody = (ctx: Ctx): void => {\n\t\ttry {\n\t\t\tctx.down([[\"DATA\", materializeSnapshot()]]);\n\t\t} catch (e) {\n\t\t\tctx.down([[\"ERROR\", errorPayload(e, `${factory}.snapshot materializer failed`)]]);\n\t\t}\n\t};\n\tconst snapshot = group\n\t\t? group.node<S>([delta as Node<unknown>], snapshotBody, {\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tmeta: { kind: \"collection_view_snapshot\", factory },\n\t\t\t\tpartial: true,\n\t\t\t\tpullId,\n\t\t\t})\n\t\t: new Node<S>([delta as Node<unknown>], snapshotBody, {\n\t\t\t\t...base,\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tpartial: true,\n\t\t\t\tpullId,\n\t\t\t});\n\n\tlet disposed = false;\n\treturn {\n\t\tdelta,\n\t\tsnapshot,\n\t\tpullId,\n\t\tdispose(): void {\n\t\t\tif (disposed) return;\n\t\t\tif (group) {\n\t\t\t\tgroup.release({ reason: factory });\n\t\t\t} else {\n\t\t\t\treleaseRuntimeOfNode(delta as Node<unknown>);\n\t\t\t\treleaseRuntimeOfNode(snapshot as Node<unknown>);\n\t\t\t}\n\t\t\tdisposed = true;\n\t\t\tonDispose?.();\n\t\t},\n\t};\n}\n\n/**\n * Build the shared core for a reactive structure (D60). `factory` names the nodes for describe\n * (D6/D51 auto-discovery). The structure passes its `backend` (any {@link CollectionBackend}) and\n * layers a typed method surface on top.\n */\nexport function collectionCore<S, C>(\n\tbackend: CollectionBackend<S>,\n\tfactory: string,\n\topts: CollectionCoreOptions = {},\n\trestore?: CollectionRestoreSpec,\n): CollectionCore<S, C> {\n\tconst { name, dispatcher, graph } = opts;\n\tconst base: { dispatcher?: Dispatcher } = dispatcher ? { dispatcher } : {};\n\tlet bindSeq = 0;\n\n\t// DELTA backbone: a bare source (D60 #2a / review #2 — node([], null), no `initial`, so a late\n\t// subscriber gets no fake \"initial change\"; state is the snapshot port's job).\n\tconst delta = graph\n\t\t? graph.node<C>([], null, {\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tmeta: { kind: \"collection_delta\", collection: factory },\n\t\t\t\t...(restore ? { restore: { ref: restore.deltaRef, config: restore.config } } : {}),\n\t\t\t})\n\t\t: new Node<C>([], null, {\n\t\t\t\t...base,\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t});\n\n\t// SNAPSHOT pull node: dep=[delta] (the backbone arms it via quiet-absorb so coalesce is free,\n\t// D60). The fn IGNORES the delta value — it reads `backend.snapshot()` on demand (D60 #3). The\n\t// pullId is a unique Symbol (R-pull/D269: matched by identity, zero collision with pause locks).\n\t// `partial:true`: the fn does not need the delta's value, so it must not gate on \"all deps\n\t// settled\" — it fires whenever armed (a mutation since the last delivery).\n\tconst pullId = Symbol(name ? `${name}.snapshot` : `${factory}.snapshot`);\n\tlet deliveredVersion = backend.version;\n\tconst snapFn = (ctx: Ctx): void => {\n\t\tif (ctx.pull !== undefined && backend.version === deliveredVersion) return;\n\t\tdeliveredVersion = backend.version;\n\t\tctx.down([[\"DATA\", backend.snapshot()]]);\n\t};\n\tconst snapshot = graph\n\t\t? graph.node<S>([delta as Node<unknown>], snapFn, {\n\t\t\t\tpullId,\n\t\t\t\tpartial: true,\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tmeta: { kind: \"collection_snapshot\", collection: factory },\n\t\t\t\t...(restore ? { restore: { ref: restore.snapshotRef, config: restore.config } } : {}),\n\t\t\t})\n\t\t: new Node<S>([delta as Node<unknown>], snapFn, {\n\t\t\t\t...base,\n\t\t\t\tpullId,\n\t\t\t\tpartial: true,\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t});\n\n\tif (restore !== undefined) {\n\t\tregisterBackendStateContributor(delta as Node<unknown>, restore.backendState);\n\t}\n\n\tfunction emit(change: C): void {\n\t\t// External tier-3 emit → the substrate synthesizes the leading DIRTY (R-dirty-before-data),\n\t\t// which the quiet snapshot node absorbs (R-pull) and uses to arm its next demand delivery.\n\t\tdelta.down([[\"DATA\", change]]);\n\t}\n\n\tfunction bindSource<V>(src: Node<V>, apply: (value: V) => void): () => void {\n\t\tif (graph === undefined)\n\t\t\tthrow new Error(\n\t\t\t\t\"collectionCore.bindSource requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t);\n\t\t// A graph-bound declared-dep folder (effect-shaped): reads each src batch value, applies it\n\t\t// to the backend (apply mutates + emits the delta). src → folder is a real edge describe\n\t\t// shows (D54/D61), not an internal subscribe island.\n\t\tconst op: Operator<V, void> = {\n\t\t\tfactory: `${factory}.bindSource`,\n\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\tconst b = depBatch(ctx, 0);\n\t\t\t\ttry {\n\t\t\t\t\tif (b) for (const v of b) apply(v as V);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"collectionCore.bindSource failed\")]]);\n\t\t\t\t}\n\t\t\t},\n\t\t};\n\t\tconst folder = graph.initNode(op, [src], {\n\t\t\tname: name ? `${name}.bind#${bindSeq++}` : undefined,\n\t\t\tmeta: { kind: \"collection_bind_source\", collection: factory },\n\t\t});\n\t\treturn graph.retain(folder, { reason: `${factory}.bindSource` });\n\t}\n\n\treturn { delta, snapshot, pullId, emit, bindSource };\n}\n","/**\n * Reactive dual-key index (CSP-2.8, D54/D60) — unique primary key, rows sorted by (secondary, primary).\n *\n * Shape = the shared {@link collectionCore} two ports over a sorted-array + parallel-Map BACKEND\n * (D60). The SNAPSHOT port delivers the ordered `IndexRow[]`. Secondary/reverse lookup = \"Z\"\n * (review #4): `has`/`get`/`rangeByPrimary` are SYNCHRONOUS point-reads over the backend's parallel\n * Map (NOT topology, like `.cache`); `byPrimary` is an OPTIONAL reactive derived over the delta\n * backbone (a pushed primary→value map), LAZILY created on first access (no default keepalive,\n * R-rom-ram). The two coexist: the derived is the reactive reverse-lookup port; the sync reads are\n * the point query.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch, depCount, depLatest } from \"../../ctx/types.js\";\nimport { Node, node } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport type { Operator } from \"../operators.js\";\nimport type { OrderedCapacityPolicy, ReactiveOpt, ViewCachePolicy } from \"../policies/types.js\";\nimport type { IndexChange } from \"./change.js\";\nimport {\n\ttype CollectionCore,\n\ttype CollectionCoreOptions,\n\tcollectionCore,\n\tlightReactiveView,\n\ttype ReactiveView,\n\tViewMemoCache,\n} from \"./core.js\";\n\nexport type ReactiveIndexOpt<T> = ReactiveOpt<T>;\nexport type ReactiveIndexCapacityOrder = \"secondary\" | \"primary\" | \"lru\";\n\nexport interface ReactiveIndexCapacityPolicy\n\textends OrderedCapacityPolicy<ReactiveIndexCapacityOrder> {}\n\nexport interface ReactiveIndexOptions extends CollectionCoreOptions {\n\t/**\n\t * D73 explicit capacity policy: no implicit eviction default.\n\t * `order` chooses eviction semantics and `maxSize` may be static or node-valued (D68).\n\t */\n\treadonly capacity?: ReactiveIndexCapacityPolicy;\n\t/** Static D80 memo policy for D121 light views. Eviction does not dispose returned views. */\n\treadonly viewCache?: ViewCachePolicy;\n}\n\nexport interface IndexRow<K, V = unknown> {\n\treadonly primary: K;\n\treadonly secondary: unknown;\n\treadonly value: V;\n}\n\nexport interface ReactiveIndex<K, V = unknown> {\n\treadonly delta: Node<IndexChange<K, V>>;\n\t/** SNAPSHOT pull node: demand → rows sorted by (secondary, primary) (lazy O(n)). */\n\treadonly snapshot: Node<readonly IndexRow<K, V>[]>;\n\treadonly pullId: symbol;\n\t/** Row count (O(1)). Sync non-reactive read. */\n\treadonly size: number;\n\t/** O(1) primary-key existence. Sync read (Z). */\n\thas(primary: K): boolean;\n\t/** O(1) value lookup by primary key. Sync read (Z). */\n\tget(primary: K): V | undefined;\n\t/** Values whose primary sorts within `[start, end)`, ascending primary order. Sync read (Z). */\n\trangeByPrimary(start: K, end: K): V[];\n\t/**\n\t * D121 light range view over the primary axis. `delta` forwards parent index mutations, and\n\t * `snapshot` is a pull node that materializes the current range on demand.\n\t */\n\trange(start: K, end: K): ReactiveView<IndexChange<K, V>, readonly V[]>;\n\t/** Ordered rows (fresh copy). Sync non-reactive read (cold-start peek). */\n\ttoArray(): readonly IndexRow<K, V>[];\n\t/** Primary→value map (fresh copy). Sync non-reactive read. */\n\ttoPrimaryMap(): ReadonlyMap<K, V>;\n\t/**\n\t * OPTIONAL reactive reverse-lookup port (Z): a derived primary→value map, pushed on every\n\t * mutation. Lazily created on first access (no keepalive — live only while subscribed). Use the\n\t * synchronous {@link ReactiveIndex.get} for a one-shot point query.\n\t */\n\treadonly byPrimary: Node<ReadonlyMap<K, V>>;\n\t/** Insert/replace a row. Returns `true` if a NEW row was inserted (primary was absent). */\n\tupsert(primary: K, secondary: unknown, value: V): boolean;\n\t/** Bulk upsert; one delta per row. No-op if empty. */\n\tupsertMany(rows: Iterable<{ primary: K; secondary: unknown; value: V }>): void;\n\tdelete(primary: K): void;\n\t/** Bulk delete; one delta event. No-op if nothing removed. */\n\tdeleteMany(primaries: Iterable<K>): void;\n\tclear(): void;\n\t/** D54 widening: every row from `src` is upserted. Returns a disposer. */\n\tupsertFrom(src: Node<{ primary: K; secondary: unknown; value: V }>): () => void;\n\tdispose(): void;\n}\n\n// ── ordering helpers (pure; backend-internal) ──\nfunction cmpOrd(a: unknown, b: unknown): number {\n\tif (a === b) return 0;\n\tconst ta = typeof a;\n\tif (\n\t\tta === typeof b &&\n\t\t(ta === \"number\" || ta === \"string\" || ta === \"boolean\" || ta === \"bigint\")\n\t) {\n\t\tconst ax = a as number | string;\n\t\tconst bx = b as number | string;\n\t\treturn ax < bx ? -1 : ax > bx ? 1 : 0;\n\t}\n\treturn String(a).localeCompare(String(b));\n}\nfunction compareRows<K, V>(a: IndexRow<K, V>, b: IndexRow<K, V>): number {\n\tconst c = cmpOrd(a.secondary, b.secondary);\n\treturn c !== 0 ? c : cmpOrd(a.primary, b.primary);\n}\nfunction bisectLeft<K, V>(rows: readonly IndexRow<K, V>[], row: IndexRow<K, V>): number {\n\tlet lo = 0;\n\tlet hi = rows.length;\n\twhile (lo < hi) {\n\t\tconst mid = (lo + hi) >> 1;\n\t\tif (compareRows(rows[mid] as IndexRow<K, V>, row) < 0) lo = mid + 1;\n\t\telse hi = mid;\n\t}\n\treturn lo;\n}\n\n/** Default sorted-array + parallel-Map backend (D60 first-cut; B-tree/persistent backend deferred). */\nclass IndexBackend<K, V> {\n\tprivate _version = 0;\n\tprivate readonly buf: IndexRow<K, V>[] = [];\n\tprivate readonly byKey = new Map<K, IndexRow<K, V>>();\n\tprivate readonly trackLru: boolean;\n\n\tconstructor(trackLru: boolean, initialRows: readonly IndexRow<K, V>[] = []) {\n\t\tthis.trackLru = trackLru;\n\t\tfor (const row of initialRows) {\n\t\t\tthis.upsert(row.primary, row.secondary, row.value);\n\t\t}\n\t\tthis._version = 0;\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\tget size(): number {\n\t\treturn this.buf.length;\n\t}\n\thas(primary: K): boolean {\n\t\tconst row = this.byKey.get(primary);\n\t\tif (row === undefined) return false;\n\t\tthis.touchLru(row);\n\t\treturn true;\n\t}\n\tget(primary: K): V | undefined {\n\t\tconst row = this.byKey.get(primary);\n\t\tif (row === undefined) return undefined;\n\t\tthis.touchLru(row);\n\t\treturn row.value;\n\t}\n\n\tprivate touchLru(row: IndexRow<K, V>): void {\n\t\tif (!this.trackLru) return;\n\t\tthis.byKey.delete(row.primary);\n\t\tthis.byKey.set(row.primary, row);\n\t}\n\n\tprivate removeRow(row: IndexRow<K, V>): void {\n\t\tconst start = bisectLeft(this.buf, row);\n\t\tfor (\n\t\t\tlet i = start;\n\t\t\ti < this.buf.length && compareRows(this.buf[i] as IndexRow<K, V>, row) === 0;\n\t\t\ti++\n\t\t) {\n\t\t\tif (this.buf[i] === row) {\n\t\t\t\tthis.buf.splice(i, 1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tconst fallback = this.buf.indexOf(row);\n\t\tif (fallback >= 0) {\n\t\t\tthis.buf.splice(fallback, 1);\n\t\t\treturn;\n\t\t}\n\t\tthrow new Error(\"reactiveIndex: internal row index desynchronized\");\n\t}\n\n\tupsert(primary: K, secondary: unknown, value: V): boolean {\n\t\tconst existing = this.byKey.get(primary);\n\t\tconst row: IndexRow<K, V> = { primary, secondary, value };\n\t\tif (existing !== undefined) {\n\t\t\tthis.removeRow(existing);\n\t\t\tthis.byKey.delete(primary);\n\t\t}\n\t\tthis.buf.splice(bisectLeft(this.buf, row), 0, row);\n\t\tthis.byKey.set(primary, row);\n\t\tthis._version += 1;\n\t\treturn existing === undefined;\n\t}\n\n\tdelete(primary: K): boolean {\n\t\tconst existing = this.byKey.get(primary);\n\t\tif (existing === undefined) return false;\n\t\tthis.removeRow(existing);\n\t\tthis.byKey.delete(primary);\n\t\tthis._version += 1;\n\t\treturn true;\n\t}\n\n\tclear(): number {\n\t\tconst n = this.buf.length;\n\t\tif (n === 0) return 0;\n\t\tthis.buf.length = 0;\n\t\tthis.byKey.clear();\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\n\trangeByPrimary(start: K, end: K): V[] {\n\t\tif (cmpOrd(start, end) >= 0) return [];\n\t\tconst rows = [...this.byKey.entries()].filter(\n\t\t\t([p]) => cmpOrd(p, start) >= 0 && cmpOrd(p, end) < 0,\n\t\t);\n\t\trows.sort(([a], [b]) => cmpOrd(a, b));\n\t\treturn rows.map(([, r]) => r.value);\n\t}\n\n\tevictOneForCapacity(order: ReactiveIndexCapacityOrder, maxSize?: number): K | undefined {\n\t\tif (maxSize === undefined) return undefined;\n\t\tif (!Number.isInteger(maxSize) || maxSize < 1)\n\t\t\tthrow new RangeError(`reactiveIndex: maxSize must be a positive integer (got ${maxSize})`);\n\t\tconst overflow = this.buf.length - maxSize;\n\t\tif (overflow <= 0) return undefined;\n\n\t\tswitch (order) {\n\t\t\tcase \"secondary\": {\n\t\t\t\tconst row = this.buf[0] as IndexRow<K, V> | undefined;\n\t\t\t\tif (row === undefined) return undefined;\n\t\t\t\tthis.buf.shift();\n\t\t\t\tthis.byKey.delete(row.primary);\n\t\t\t\tthis._version += 1;\n\t\t\t\treturn row.primary;\n\t\t\t}\n\t\t\tcase \"primary\": {\n\t\t\t\tlet victim: K | undefined;\n\t\t\t\tfor (const key of this.byKey.keys()) {\n\t\t\t\t\tif (victim === undefined || cmpOrd(key, victim) < 0) victim = key;\n\t\t\t\t}\n\t\t\t\tif (victim === undefined) return undefined;\n\t\t\t\tconst row = this.byKey.get(victim);\n\t\t\t\tif (row !== undefined) this.removeRow(row);\n\t\t\t\tthis.byKey.delete(victim);\n\t\t\t\tthis._version += 1;\n\t\t\t\treturn victim;\n\t\t\t}\n\t\t\tcase \"lru\": {\n\t\t\t\tconst oldest = this.byKey.keys().next().value as K | undefined;\n\t\t\t\tif (oldest === undefined) return undefined;\n\t\t\t\tconst row = this.byKey.get(oldest);\n\t\t\t\tif (row !== undefined) this.removeRow(row);\n\t\t\t\tthis.byKey.delete(oldest);\n\t\t\t\tthis._version += 1;\n\t\t\t\treturn oldest;\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tthrow new Error(`reactiveIndex: unknown capacity order '${String(order)}'`);\n\t\t\t}\n\t\t}\n\t}\n\n\tsnapshot(): readonly IndexRow<K, V>[] {\n\t\treturn [...this.buf];\n\t}\n\ttoPrimaryMap(): ReadonlyMap<K, V> {\n\t\tconst m = new Map<K, V>();\n\t\tfor (const r of this.buf) m.set(r.primary, r.value);\n\t\treturn m;\n\t}\n}\n\nfunction assertCheckpointableIndexRows(rows: readonly IndexRow<unknown, unknown>[]): void {\n\tfor (const [i, row] of rows.entries()) {\n\t\tconst primary = row.primary;\n\t\tif (\n\t\t\tprimary === null ||\n\t\t\ttypeof primary === \"string\" ||\n\t\t\ttypeof primary === \"number\" ||\n\t\t\ttypeof primary === \"boolean\"\n\t\t) {\n\t\t\tcontinue;\n\t\t}\n\t\tthrow new TypeError(\n\t\t\t`reactiveIndex checkpoint backendState[${i}].primary must be a JSON primitive primary key for D160 restore`,\n\t\t);\n\t}\n}\n\n/**\n * Create a reactive dual-key index (D54/D60). DELTA + lazy pull SNAPSHOT + pullId via\n * {@link collectionCore}; this layer adds the sorted backend + Z reverse-lookup surface.\n */\nexport function reactiveIndex<K, V = unknown>(\n\toptions: ReactiveIndexOptions = {},\n): ReactiveIndex<K, V> {\n\treturn createReactiveIndex(options);\n}\n\n/** @internal D160 restore path: seed the backend without replaying public deltas. */\nexport function restoreReactiveIndexFromBackendState<K, V = unknown>(\n\tinitialRows: readonly IndexRow<K, V>[],\n\toptions: ReactiveIndexOptions = {},\n): ReactiveIndex<K, V> {\n\treturn createReactiveIndex(options, initialRows);\n}\n\nfunction createReactiveIndex<K, V = unknown>(\n\toptions: ReactiveIndexOptions = {},\n\tinitialRows: readonly IndexRow<K, V>[] = [],\n): ReactiveIndex<K, V> {\n\tconst { capacity, graph, dispatcher, name } = options;\n\tconst lruEnabled = capacity?.order === \"lru\";\n\tconst backend = new IndexBackend<K, V>(lruEnabled, initialRows);\n\tconst core: CollectionCore<readonly IndexRow<K, V>[], IndexChange<K, V>> = collectionCore(\n\t\tbackend,\n\t\t\"reactiveIndex\",\n\t\toptions,\n\t\tgraph !== undefined && name !== undefined && capacity === undefined\n\t\t\t? {\n\t\t\t\t\tdeltaRef: \"reactiveIndex.delta\",\n\t\t\t\t\tsnapshotRef: \"reactiveIndex.snapshot\",\n\t\t\t\t\tbackendState: () => {\n\t\t\t\t\t\tconst rows = backend.snapshot();\n\t\t\t\t\t\tassertCheckpointableIndexRows(rows);\n\t\t\t\t\t\treturn rows;\n\t\t\t\t\t},\n\t\t\t\t}\n\t\t\t: undefined,\n\t);\n\tconst binds: Array<() => void> = [];\n\tconst base = dispatcher ? { dispatcher } : {};\n\tconst bindDeps = new WeakSet<Node<unknown>>();\n\tconst rangeMemo = new ViewMemoCache<\n\t\treadonly [K, K],\n\t\tReactiveView<IndexChange<K, V>, readonly V[]>\n\t>(options.viewCache, ([aStart, aEnd], [bStart, bEnd]) => {\n\t\treturn cmpOrd(aStart, bStart) === 0 && cmpOrd(aEnd, bEnd) === 0;\n\t});\n\tlet bindSeq = 0;\n\tlet rangeSeq = 0;\n\tlet capacityPolicy: Node<number> | undefined;\n\tlet apply: Node<IndexChange<K, V>> | undefined;\n\tlet releaseApply = () => {};\n\n\tfunction isNodeOpt<T>(x: ReactiveIndexOpt<T>): x is Node<T> {\n\t\treturn x instanceof Node;\n\t}\n\n\tfunction validateMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 1)\n\t\t\tthrow new RangeError(`reactiveIndex: maxSize must be a positive integer (got ${v})`);\n\t\treturn v;\n\t}\n\n\tfunction enforceCapacity(): void {\n\t\tif (currentCapacityOrder === undefined) return;\n\t\tfor (;;) {\n\t\t\tconst primary = backend.evictOneForCapacity(currentCapacityOrder, currentMaxSize);\n\t\t\tif (primary === undefined) return;\n\t\t\tcore.emit({ kind: \"delete\", primary });\n\t\t}\n\t}\n\n\tconst applyBody = (ctx: Ctx): void => {\n\t\tconst deps = apply?.deps ?? [];\n\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\tconst dep = deps[i];\n\t\t\tif (dep === capacityPolicy) {\n\t\t\t\tconst latest = depLatest(ctx, i);\n\t\t\t\tif (latest !== undefined) currentMaxSize = validateMaxSize(latest as number);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (dep && bindDeps.has(dep)) {\n\t\t\t\tfor (const r of (depBatch(ctx, i) ?? []) as readonly {\n\t\t\t\t\tprimary: K;\n\t\t\t\t\tsecondary: unknown;\n\t\t\t\t\tvalue: V;\n\t\t\t\t}[]) {\n\t\t\t\t\tbackend.upsert(r.primary, r.secondary, r.value);\n\t\t\t\t\tcore.emit({ kind: \"upsert\", primary: r.primary, secondary: r.secondary, value: r.value });\n\t\t\t\t\tenforceCapacity();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tenforceCapacity();\n\t};\n\n\tfunction ensureApply(): Node<IndexChange<K, V>> {\n\t\tif (apply !== undefined) return apply;\n\t\tconst op: Operator<unknown, IndexChange<K, V>> = {\n\t\t\tfactory: \"reactiveIndex.capacityPolicy\",\n\t\t\tbody: applyBody,\n\t\t\topts: { partial: true },\n\t\t};\n\t\tconst deps = capacityPolicy ? [capacityPolicy as Node<unknown>] : [];\n\t\tapply = graph\n\t\t\t? graph.initNode(op, deps, {\n\t\t\t\t\tname: name ? `${name}.capacityPolicy` : undefined,\n\t\t\t\t\tmeta: { kind: \"collection_policy_apply\", collection: \"reactiveIndex\" },\n\t\t\t\t})\n\t\t\t: new Node<IndexChange<K, V>>(deps, op.body, {\n\t\t\t\t\t...base,\n\t\t\t\t\tfactory: \"reactiveIndex.capacityPolicy\",\n\t\t\t\t\tpartial: true,\n\t\t\t\t\tname: name ? `${name}.capacityPolicy` : undefined,\n\t\t\t\t});\n\t\treleaseApply = graph\n\t\t\t? graph.retain(apply, { reason: \"reactiveIndex.capacityPolicy\" })\n\t\t\t: apply.subscribe(() => {});\n\t\treturn apply;\n\t}\n\n\tlet currentMaxSize: number | undefined;\n\tconst currentCapacityOrder: ReactiveIndexCapacityOrder | undefined = capacity?.order;\n\tif (capacity !== undefined) {\n\t\tif (\n\t\t\tcurrentCapacityOrder !== \"secondary\" &&\n\t\t\tcurrentCapacityOrder !== \"primary\" &&\n\t\t\tcurrentCapacityOrder !== \"lru\"\n\t\t) {\n\t\t\tthrow new Error(\"reactiveIndex: capacity.order must be one of secondary|primary|lru (D73)\");\n\t\t}\n\n\t\tconst maxSize = capacity.maxSize;\n\t\tif (isNodeOpt(maxSize) && graph === undefined) {\n\t\t\tthrow new Error(\n\t\t\t\t\"reactiveIndex capacity.maxSize Node option requires options.graph so the policy edge is describe-visible (D73)\",\n\t\t\t);\n\t\t}\n\n\t\tcapacityPolicy = isNodeOpt(maxSize)\n\t\t\t? maxSize\n\t\t\t: graph\n\t\t\t\t? graph.initNode<number, number>(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfactory: \"reactiveIndex.maxSizePolicy\",\n\t\t\t\t\t\t\tbody: () => {},\n\t\t\t\t\t\t\topts: { initial: validateMaxSize(maxSize) },\n\t\t\t\t\t\t},\n\t\t\t\t\t\t[],\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tname: name ? `${name}.maxSizePolicy` : undefined,\n\t\t\t\t\t\t\tmeta: { kind: \"collection_policy\", collection: \"reactiveIndex\", policy: \"maxSize\" },\n\t\t\t\t\t\t},\n\t\t\t\t\t)\n\t\t\t\t: undefined;\n\n\t\tif (!isNodeOpt(maxSize)) currentMaxSize = validateMaxSize(maxSize);\n\n\t\tif (capacityPolicy instanceof Node) ensureApply();\n\t}\n\n\t// Lazy reactive reverse-lookup port (Z): a delta-driven pushed primary→value map. Created on\n\t// first access so an index that never uses it pays nothing (no keepalive — R-rom-ram).\n\tlet byPrimaryNode: Node<ReadonlyMap<K, V>> | undefined;\n\tfunction getByPrimary(): Node<ReadonlyMap<K, V>> {\n\t\tif (byPrimaryNode === undefined) {\n\t\t\tbyPrimaryNode = node<ReadonlyMap<K, V>>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\t// pushed reverse-lookup: re-read the backend's primary map on each delta (the\n\t\t\t\t\t// structure's own backend, D60 #1 — not a foreign .cache peek).\n\t\t\t\t\tctx.down([[\"DATA\", backend.toPrimaryMap()]]);\n\t\t\t\t},\n\t\t\t\t{ factory: \"reactiveIndex.byPrimary\", partial: true },\n\t\t\t);\n\t\t}\n\t\treturn byPrimaryNode;\n\t}\n\n\tfunction getRange(start: K, end: K): ReactiveView<IndexChange<K, V>, readonly V[]> {\n\t\tconst key = [start, end] as const;\n\t\tconst hit = rangeMemo.get(key);\n\t\tif (hit !== undefined) return hit;\n\t\tconst materialize = (): readonly V[] => backend.rangeByPrimary(start, end);\n\t\tlet view: ReactiveView<IndexChange<K, V>, readonly V[]>;\n\t\tview = lightReactiveView<IndexChange<K, V>, readonly V[]>(core.delta as Node<unknown>, {\n\t\t\t...options,\n\t\t\tfactory: \"reactiveIndex.range\",\n\t\t\tname: name ? `${name}.range#${rangeSeq++}` : undefined,\n\t\t\tmaterializeSnapshot: materialize,\n\t\t\tonDispose: () => {\n\t\t\t\trangeMemo.deleteValue(view);\n\t\t\t},\n\t\t});\n\t\trangeMemo.set(key, view);\n\t\treturn view;\n\t}\n\n\treturn {\n\t\tdelta: core.delta,\n\t\tsnapshot: core.snapshot,\n\t\tpullId: core.pullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\thas(primary: K): boolean {\n\t\t\treturn backend.has(primary);\n\t\t},\n\t\tget(primary: K): V | undefined {\n\t\t\treturn backend.get(primary);\n\t\t},\n\t\trangeByPrimary(start: K, end: K): V[] {\n\t\t\treturn backend.rangeByPrimary(start, end);\n\t\t},\n\t\trange(start: K, end: K): ReactiveView<IndexChange<K, V>, readonly V[]> {\n\t\t\treturn getRange(start, end);\n\t\t},\n\t\ttoArray(): readonly IndexRow<K, V>[] {\n\t\t\treturn backend.snapshot();\n\t\t},\n\t\ttoPrimaryMap(): ReadonlyMap<K, V> {\n\t\t\treturn backend.toPrimaryMap();\n\t\t},\n\t\tget byPrimary(): Node<ReadonlyMap<K, V>> {\n\t\t\treturn getByPrimary();\n\t\t},\n\n\t\tupsert(primary: K, secondary: unknown, value: V): boolean {\n\t\t\tconst inserted = backend.upsert(primary, secondary, value);\n\t\t\tcore.emit({ kind: \"upsert\", primary, secondary, value });\n\t\t\tenforceCapacity();\n\t\t\treturn inserted;\n\t\t},\n\t\tupsertMany(rows: Iterable<{ primary: K; secondary: unknown; value: V }>): void {\n\t\t\tfor (const r of rows) {\n\t\t\t\tbackend.upsert(r.primary, r.secondary, r.value);\n\t\t\t\tcore.emit({ kind: \"upsert\", primary: r.primary, secondary: r.secondary, value: r.value });\n\t\t\t\tenforceCapacity();\n\t\t\t}\n\t\t},\n\t\tdelete(primary: K): void {\n\t\t\tif (backend.delete(primary)) core.emit({ kind: \"delete\", primary });\n\t\t},\n\t\tdeleteMany(primaries: Iterable<K>): void {\n\t\t\tconst removed: K[] = [];\n\t\t\tfor (const p of primaries) if (backend.delete(p)) removed.push(p);\n\t\t\tif (removed.length > 0) core.emit({ kind: \"deleteMany\", primaries: removed });\n\t\t},\n\t\tclear(): void {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) core.emit({ kind: \"clear\", count });\n\t\t},\n\n\t\tupsertFrom(src: Node<{ primary: K; secondary: unknown; value: V }>): () => void {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"reactiveIndex.upsertFrom requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t\t);\n\t\t\tconst op: Operator<\n\t\t\t\t{ primary: K; secondary: unknown; value: V },\n\t\t\t\t{ primary: K; secondary: unknown; value: V }\n\t\t\t> = {\n\t\t\t\tfactory: \"reactiveIndex.bindSource\",\n\t\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfor (const r of (depBatch(ctx, 0) ?? []) as readonly {\n\t\t\t\t\t\t\tprimary: K;\n\t\t\t\t\t\t\tsecondary: unknown;\n\t\t\t\t\t\t\tvalue: V;\n\t\t\t\t\t\t}[]) {\n\t\t\t\t\t\t\tctx.down([[\"DATA\", r]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"reactiveIndex.bindSource failed\")]]);\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst folder = graph.initNode(op, [src], {\n\t\t\t\tname: name ? `${name}.bind#${bindSeq++}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_bind_source\", collection: \"reactiveIndex\" },\n\t\t\t});\n\t\t\tbindDeps.add(folder as Node<unknown>);\n\t\t\tconst applyNode = ensureApply();\n\t\t\tapplyNode.subscribeDep(folder as Node<unknown>, applyBody);\n\t\t\tlet active = true;\n\t\t\tconst dispose = () => {\n\t\t\t\tif (!active) return;\n\t\t\t\tactive = false;\n\t\t\t\tapplyNode.unsubscribeDep(folder as Node<unknown>, applyBody);\n\t\t\t};\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\treleaseApply();\n\t\t\trangeMemo.disposeAll();\n\t\t},\n\t};\n}\n","/**\n * Internal graph-layer policy helpers (D70).\n *\n * This module is deliberately NOT exported from the package index. It centralizes policy plumbing\n * shared by collection structures while each structure still owns backend mutation + delta emission\n * in its apply/mutation path (D60/D61/D68/D69).\n */\n\nimport { type Ctx, depLatest } from \"../../ctx/types.js\";\nimport type { Node } from \"../../node/node.js\";\n\nexport type PolicyOpt<T> = T | Node<T>;\n\nexport interface PolicyReader<T> {\n\treadonly index: number;\n\tread(ctx: Ctx, current: T | undefined): T | undefined;\n}\n\nexport class PolicyInputs {\n\treadonly deps: Node<unknown>[];\n\n\tconstructor(initial: readonly Node<unknown>[] = []) {\n\t\tthis.deps = [...initial];\n\t}\n\n\tadd<T>(node: Node<T> | undefined): PolicyReader<T> {\n\t\tif (node === undefined) return missingPolicyReader<T>();\n\t\tconst index = this.deps.push(node as Node<unknown>) - 1;\n\t\treturn policyReader<T>(index);\n\t}\n}\n\nfunction missingPolicyReader<T>(): PolicyReader<T> {\n\treturn {\n\t\tindex: -1,\n\t\tread: (_ctx, current) => current,\n\t};\n}\n\nfunction policyReader<T>(index: number): PolicyReader<T> {\n\treturn {\n\t\tindex,\n\t\tread(ctx, current) {\n\t\t\tconst latest = depLatest(ctx, index);\n\t\t\treturn latest === undefined ? current : (latest as T);\n\t\t},\n\t};\n}\n\nexport interface KeyOrderPolicy<K> {\n\tkeys(): Iterable<K>;\n}\n\nexport function lruKeys<K>(keys: Iterable<K>): KeyOrderPolicy<K> {\n\treturn {\n\t\tkeys: () => keys,\n\t};\n}\n\nexport interface CapacityConfig {\n\treadonly maxSize?: number;\n}\n\nexport interface SizedCapacityConfig extends CapacityConfig {\n\treadonly size: number;\n}\n\nexport function trimHeadOverflow<T>(items: T[], config: CapacityConfig): T[];\nexport function trimHeadOverflow<T>(items: Iterable<T>, config: SizedCapacityConfig): T[];\nexport function trimHeadOverflow<T>(\n\titems: T[] | Iterable<T>,\n\tconfig: CapacityConfig | SizedCapacityConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 1)\n\t\tthrow new RangeError(`maxSize must be a positive integer (got ${maxSize})`);\n\n\tconst size = \"size\" in config ? config.size : Array.isArray(items) ? items.length : undefined;\n\tif (size === undefined) throw new Error(\"trimHeadOverflow requires size for non-array iterables\");\n\tconst overflow = size - maxSize;\n\tif (overflow <= 0) return [];\n\n\tif (Array.isArray(items) && !(\"size\" in config)) return items.splice(0, overflow);\n\n\tconst victims: T[] = [];\n\tfor (const item of items) {\n\t\tvictims.push(item);\n\t\tif (victims.length === overflow) break;\n\t}\n\treturn victims;\n}\n\nexport interface DeadlineEntry<K> {\n\treadonly key: K;\n\treadonly expiresAt: number;\n}\n\nexport interface DeadlinePolicy<K> {\n\treadonly size: number;\n\tpush(item: DeadlineEntry<K>): void;\n\tpeek(): DeadlineEntry<K> | undefined;\n\tpop(): DeadlineEntry<K> | undefined;\n}\n\nexport function deadlines<K>(): DeadlinePolicy<K> {\n\treturn new MinDeadlineHeap<K>();\n}\n\nclass MinDeadlineHeap<K> implements DeadlinePolicy<K> {\n\tprivate readonly items: DeadlineEntry<K>[] = [];\n\n\tget size(): number {\n\t\treturn this.items.length;\n\t}\n\n\tpush(item: DeadlineEntry<K>): void {\n\t\tthis.items.push(item);\n\t\tthis.up(this.items.length - 1);\n\t}\n\n\tpeek(): DeadlineEntry<K> | undefined {\n\t\treturn this.items[0];\n\t}\n\n\tpop(): DeadlineEntry<K> | undefined {\n\t\tconst top = this.items[0];\n\t\tconst last = this.items.pop();\n\t\tif (top !== undefined && last !== undefined && this.items.length > 0) {\n\t\t\tthis.items[0] = last;\n\t\t\tthis.down(0);\n\t\t}\n\t\treturn top;\n\t}\n\n\tprivate up(i: number): void {\n\t\twhile (i > 0) {\n\t\t\tconst p = (i - 1) >> 1;\n\t\t\tif (\n\t\t\t\t(this.items[p] as DeadlineEntry<K>).expiresAt <=\n\t\t\t\t(this.items[i] as DeadlineEntry<K>).expiresAt\n\t\t\t)\n\t\t\t\treturn;\n\t\t\t[this.items[p], this.items[i]] = [\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t\tthis.items[p] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = p;\n\t\t}\n\t}\n\n\tprivate down(i: number): void {\n\t\tfor (;;) {\n\t\t\tconst left = i * 2 + 1;\n\t\t\tconst right = left + 1;\n\t\t\tlet smallest = i;\n\t\t\tif (left < this.items.length && this.expiresAt(left) < this.expiresAt(smallest))\n\t\t\t\tsmallest = left;\n\t\t\tif (right < this.items.length && this.expiresAt(right) < this.expiresAt(smallest))\n\t\t\t\tsmallest = right;\n\t\t\tif (smallest === i) return;\n\t\t\t[this.items[i], this.items[smallest]] = [\n\t\t\t\tthis.items[smallest] as DeadlineEntry<K>,\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = smallest;\n\t\t}\n\t}\n\n\tprivate expiresAt(i: number): number {\n\t\treturn (this.items[i] as DeadlineEntry<K>).expiresAt;\n\t}\n}\n\nexport interface ScoredEntry<T> {\n\treadonly entry: T;\n\treadonly score: number;\n}\n\nexport interface RetentionSelectionConfig {\n\treadonly maxSize?: number;\n}\n\nexport function selectRetentionVictims<T>(\n\tscoredEntries: readonly ScoredEntry<T>[],\n\tconfig: RetentionSelectionConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 0)\n\t\tthrow new RangeError(`retention maxSize must be a non-negative integer (got ${maxSize})`);\n\tconst overflow = scoredEntries.length - maxSize;\n\tif (overflow <= 0) return [];\n\n\treturn scoredEntries\n\t\t.map((item, index) => {\n\t\t\tif (!Number.isFinite(item.score))\n\t\t\t\tthrow new RangeError(`retention score must be finite (got ${item.score})`);\n\t\t\treturn { ...item, index };\n\t\t})\n\t\t.sort((a, b) => a.score - b.score || a.index - b.index)\n\t\t.slice(0, overflow)\n\t\t.map((item) => item.entry);\n}\n","/**\n * Reactive positional list (CSP-2.8, D54/D60) — the two-port collection template.\n *\n * Shape (D60 + review #2): a mutable array BACKEND (the single materialized state) + the shared\n * {@link collectionCore} two ports — a DELTA stream ({@link ReactiveList.delta}, one event per\n * mutation, O(1)) and a lazy pull SNAPSHOT ({@link ReactiveList.snapshot}, materialized only on a\n * cone-routed PULL demand). Mutation input is D54 A3 hybrid: ergonomic imperative methods (the\n * external boundary, state-verb-legitimate, D4) + `appendFrom(src)` widening (an in-graph producer\n * drives the list with zero imperative glue). Synchronous quick-reads (`at`/`size`/`toArray`) are\n * the deliberately-non-reactive peek for cold/imperative reads (D60).\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch, depCount, depLatest } from \"../../ctx/types.js\";\nimport { Node } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport type { Operator } from \"../operators.js\";\nimport { trimHeadOverflow } from \"../policies/collection.js\";\nimport type { ReactiveOpt } from \"../policies/types.js\";\nimport type { ListChange } from \"./change.js\";\nimport { type CollectionCore, type CollectionCoreOptions, collectionCore } from \"./core.js\";\n\nexport type ReactiveListOpt<T> = ReactiveOpt<T>;\n\nexport interface ReactiveListOptions extends CollectionCoreOptions {\n\t/**\n\t * Head-trim capacity policy (D72). A static number caps the list locally; a Node-valued maxSize\n\t * must be graph-bound and becomes a declared policy dep that trims on policy changes.\n\t */\n\tmaxSize?: ReactiveListOpt<number>;\n}\n\nexport interface ReactiveList<T> {\n\t/** DELTA stream: one {@link ListChange} per mutation (O(1)). Subscribe to observe events. */\n\treadonly delta: Node<ListChange<T>>;\n\t/** SNAPSHOT pull node: demand via `ctx.upNext([[\"PULL\", { pullId }]])` → one `readonly T[]` (lazy O(n)). */\n\treadonly snapshot: Node<readonly T[]>;\n\t/** The snapshot node's pullId — write it verbatim into the demander's fn (D269). */\n\treadonly pullId: symbol;\n\t/** Current entry count (O(1), synchronous non-reactive read). */\n\treadonly size: number;\n\t/** Positional access (O(1)); negative indices Python-style; `undefined` out of range. Sync read. */\n\tat(index: number): T | undefined;\n\t/** Full current contents (O(n), fresh defensive copy). Sync non-reactive read (cold-start peek). */\n\ttoArray(): readonly T[];\n\tappend(value: T): void;\n\t/** Append all values; one delta event + one snapshot-arm. No-op if `values` is empty. */\n\tappendMany(values: readonly T[]): void;\n\t/** Insert at `index` (0..size). Throws `RangeError` out of range. */\n\tinsert(index: number, value: T): void;\n\t/** Insert all at `index` as one op. No-op if `values` is empty. Throws out of range. */\n\tinsertMany(index: number, values: readonly T[]): void;\n\t/** Remove and return the value at `index` (default last; negative Python-style). Throws if empty/out of range. */\n\tpop(index?: number): T;\n\tclear(): void;\n\t/** D54 widening: every value from `src` is appended. Returns a disposer. */\n\tappendFrom(src: Node<T>): () => void;\n\t/** Release the widening subscriptions (idempotent). */\n\tdispose(): void;\n}\n\n/** Default mutable-array backend (D60 first-cut; pluggable persistent/immutable backend deferred). */\nclass ListBackend<T> {\n\tprivate _version = 0;\n\tprivate readonly buf: T[];\n\n\tconstructor(initial?: readonly T[], maxSize?: number) {\n\t\tthis.buf = initial ? [...initial] : [];\n\t\ttrimHeadOverflow(this.buf, { maxSize });\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\n\tget size(): number {\n\t\treturn this.buf.length;\n\t}\n\n\tat(index: number): T | undefined {\n\t\tif (!Number.isInteger(index)) return undefined;\n\t\tconst i = index >= 0 ? index : this.buf.length + index;\n\t\treturn i < 0 || i >= this.buf.length ? undefined : this.buf[i];\n\t}\n\n\tsnapshot(): readonly T[] {\n\t\treturn [...this.buf];\n\t}\n\n\tappend(value: T): void {\n\t\tthis.buf.push(value);\n\t\tthis._version += 1;\n\t}\n\n\tappendMany(values: readonly T[]): void {\n\t\tif (values.length === 0) return;\n\t\tfor (const v of values) this.buf.push(v);\n\t\tthis._version += 1;\n\t}\n\n\tinsert(index: number, value: T): void {\n\t\tif (!Number.isInteger(index) || index < 0 || index > this.buf.length)\n\t\t\tthrow new RangeError(`insert: index ${index} out of range [0, ${this.buf.length}]`);\n\t\tthis.buf.splice(index, 0, value);\n\t\tthis._version += 1;\n\t}\n\n\tinsertMany(index: number, values: readonly T[]): void {\n\t\tif (!Number.isInteger(index) || index < 0 || index > this.buf.length)\n\t\t\tthrow new RangeError(`insertMany: index ${index} out of range [0, ${this.buf.length}]`);\n\t\tif (values.length === 0) return;\n\t\tthis.buf.splice(index, 0, ...values);\n\t\tthis._version += 1;\n\t}\n\n\tpop(index: number): T {\n\t\tif (this.buf.length === 0) throw new RangeError(\"pop from empty list\");\n\t\tif (!Number.isInteger(index)) throw new RangeError(`pop: index ${index} must be an integer`);\n\t\tconst i = index >= 0 ? index : this.buf.length + index;\n\t\tif (i < 0 || i >= this.buf.length) throw new RangeError(`pop: index ${index} out of range`);\n\t\tconst [v] = this.buf.splice(i, 1);\n\t\tthis._version += 1;\n\t\treturn v as T;\n\t}\n\n\tclear(): number {\n\t\tconst n = this.buf.length;\n\t\tif (n === 0) return 0;\n\t\tthis.buf.length = 0;\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\n\tenforceMaxSize(maxSize?: number): number {\n\t\tconst removed = trimHeadOverflow(this.buf, { maxSize }).length;\n\t\tif (removed > 0) this._version += 1;\n\t\treturn removed;\n\t}\n}\n\n/**\n * Create a reactive list (D54/D60). The DELTA + SNAPSHOT ports + pullId come from the shared\n * {@link collectionCore}; this layer adds the typed list method surface + backend.\n *\n * @example\n * ```ts\n * const list = reactiveList<number>([1]);\n * // observe events:\n * list.delta.subscribe((m) => { if (m[0] === \"DATA\") console.log(\"Δ\", m[1]); });\n * list.append(2);                 // delta: {kind:\"append\", value:2}\n * // demand the snapshot (a downstream consumer, holding `list.snapshot` upstream, runs):\n * //   ctx.upNext([[\"PULL\", { pullId: list.pullId }]]);  → SNAPSHOT delivers [1, 2]\n * list.toArray();                 // [1, 2]   (synchronous non-reactive read)\n * ```\n */\nexport function reactiveList<T>(\n\tinitial?: readonly T[],\n\toptions: ReactiveListOptions = {},\n): ReactiveList<T> {\n\tconst { maxSize, graph, dispatcher } = options;\n\tconst base = dispatcher ? { dispatcher } : {};\n\n\tfunction isNodeOpt(x: ReactiveListOpt<number> | undefined): x is Node<number> {\n\t\treturn x instanceof Node;\n\t}\n\n\tfunction validateMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 1)\n\t\t\tthrow new RangeError(`reactiveList: maxSize must be a positive integer (got ${v})`);\n\t\treturn v;\n\t}\n\n\tconst initialMaxSize = isNodeOpt(maxSize) ? undefined : maxSize;\n\tconst backend = new ListBackend<T>(\n\t\tinitial,\n\t\tinitialMaxSize === undefined ? undefined : validateMaxSize(initialMaxSize),\n\t);\n\tconst restorable = graph !== undefined && options.name !== undefined && maxSize === undefined;\n\tconst core: CollectionCore<readonly T[], ListChange<T>> = collectionCore(\n\t\tbackend,\n\t\t\"reactiveList\",\n\t\toptions,\n\t\trestorable\n\t\t\t? {\n\t\t\t\t\tdeltaRef: \"reactiveList.delta\",\n\t\t\t\t\tsnapshotRef: \"reactiveList.snapshot\",\n\t\t\t\t\tbackendState: () => backend.snapshot(),\n\t\t\t\t}\n\t\t\t: undefined,\n\t);\n\tconst binds: Array<() => void> = [];\n\tconst bindDeps = new WeakSet<Node<unknown>>();\n\tlet bindSeq = 0;\n\tlet capacityPolicy: Node<number> | undefined;\n\tlet apply: Node<ListChange<T>> | undefined;\n\tlet releaseApply = () => {};\n\tlet currentMaxSize = initialMaxSize;\n\n\tfunction emitTrimmed(n: number): void {\n\t\tif (n > 0) core.emit({ kind: \"trimHead\", n });\n\t}\n\n\tfunction enforceCapacity(): void {\n\t\temitTrimmed(backend.enforceMaxSize(currentMaxSize));\n\t}\n\n\tconst applyBody = (ctx: Ctx): void => {\n\t\tconst deps = apply?.deps ?? [];\n\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\tconst dep = deps[i];\n\t\t\tif (dep === capacityPolicy) {\n\t\t\t\tconst latest = depLatest(ctx, i);\n\t\t\t\tif (latest !== undefined) currentMaxSize = validateMaxSize(latest as number);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (dep && bindDeps.has(dep)) {\n\t\t\t\tfor (const value of (depBatch(ctx, i) ?? []) as readonly T[]) {\n\t\t\t\t\tbackend.append(value);\n\t\t\t\t\tcore.emit({ kind: \"append\", value });\n\t\t\t\t\tenforceCapacity();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tenforceCapacity();\n\t};\n\n\tfunction ensureApply(): Node<ListChange<T>> {\n\t\tif (apply !== undefined) return apply;\n\t\tconst op: Operator<unknown, ListChange<T>> = {\n\t\t\tfactory: \"reactiveList.capacityPolicy\",\n\t\t\tbody: applyBody,\n\t\t\topts: { partial: true },\n\t\t};\n\t\tconst deps = capacityPolicy ? [capacityPolicy as Node<unknown>] : [];\n\t\tapply = graph\n\t\t\t? graph.initNode(op, deps, {\n\t\t\t\t\tname: options.name ? `${options.name}.capacityPolicy` : undefined,\n\t\t\t\t\tmeta: { kind: \"collection_policy_apply\", collection: \"reactiveList\" },\n\t\t\t\t})\n\t\t\t: new Node<ListChange<T>>(deps, op.body, {\n\t\t\t\t\t...base,\n\t\t\t\t\tfactory: \"reactiveList.capacityPolicy\",\n\t\t\t\t\tpartial: true,\n\t\t\t\t\tname: options.name ? `${options.name}.capacityPolicy` : undefined,\n\t\t\t\t});\n\t\treleaseApply = graph\n\t\t\t? graph.retain(apply, { reason: \"reactiveList.capacityPolicy\" })\n\t\t\t: apply.subscribe(() => {});\n\t\treturn apply;\n\t}\n\n\tfunction constPolicyNode(value: number): Node<number> {\n\t\tconst op: Operator<never, number> = {\n\t\t\tfactory: \"reactiveList.maxSizePolicy\",\n\t\t\tbody: () => {},\n\t\t\topts: { initial: value },\n\t\t};\n\t\tif (graph) {\n\t\t\treturn graph.initNode(op, [], {\n\t\t\t\tname: options.name ? `${options.name}.maxSizePolicy` : undefined,\n\t\t\t\tmeta: { kind: \"collection_policy\", collection: \"reactiveList\", policy: \"maxSize\" },\n\t\t\t});\n\t\t}\n\t\treturn new Node<number>([], null, {\n\t\t\t...base,\n\t\t\tinitial: value,\n\t\t\tfactory: \"reactiveList.maxSizePolicy\",\n\t\t\tname: options.name ? `${options.name}.maxSizePolicy` : undefined,\n\t\t});\n\t}\n\n\tif (maxSize !== undefined) {\n\t\tif (isNodeOpt(maxSize) && graph === undefined)\n\t\t\tthrow new Error(\n\t\t\t\t\"reactiveList maxSize Node option requires options.graph so the policy edge is describe-visible (D72)\",\n\t\t\t);\n\t\tcapacityPolicy = isNodeOpt(maxSize)\n\t\t\t? maxSize\n\t\t\t: graph\n\t\t\t\t? constPolicyNode(validateMaxSize(maxSize))\n\t\t\t\t: undefined;\n\t\tif (capacityPolicy !== undefined) ensureApply();\n\t}\n\n\treturn {\n\t\tdelta: core.delta,\n\t\tsnapshot: core.snapshot,\n\t\tpullId: core.pullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\tat(index: number): T | undefined {\n\t\t\treturn backend.at(index);\n\t\t},\n\t\ttoArray(): readonly T[] {\n\t\t\treturn backend.snapshot();\n\t\t},\n\n\t\tappend(value: T): void {\n\t\t\tbackend.append(value);\n\t\t\tcore.emit({ kind: \"append\", value });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tappendMany(values: readonly T[]): void {\n\t\t\tif (values.length === 0) return;\n\t\t\tconst copy = [...values];\n\t\t\tbackend.appendMany(copy);\n\t\t\tcore.emit({ kind: \"appendMany\", values: copy });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tinsert(index: number, value: T): void {\n\t\t\tbackend.insert(index, value);\n\t\t\tcore.emit({ kind: \"insert\", index, value });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tinsertMany(index: number, values: readonly T[]): void {\n\t\t\tif (values.length === 0) {\n\t\t\t\t// still validate the index (mirror backend) so an out-of-range empty insert throws\n\t\t\t\tbackend.insertMany(index, values);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst copy = [...values];\n\t\t\tbackend.insertMany(index, copy);\n\t\t\tcore.emit({ kind: \"insertMany\", index, values: copy });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tpop(index = -1): T {\n\t\t\tconst resolved = index < 0 ? backend.size + index : index;\n\t\t\tconst value = backend.pop(index);\n\t\t\tcore.emit({ kind: \"pop\", index: resolved, value });\n\t\t\treturn value;\n\t\t},\n\t\tclear(): void {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) core.emit({ kind: \"clear\", count });\n\t\t},\n\n\t\tappendFrom(src: Node<T>): () => void {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"reactiveList.appendFrom requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t\t);\n\t\t\tconst op: Operator<T, T> = {\n\t\t\t\tfactory: \"reactiveList.bindSource\",\n\t\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfor (const value of (depBatch(ctx, 0) ?? []) as readonly T[]) {\n\t\t\t\t\t\t\tctx.down([[\"DATA\", value]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"reactiveList.bindSource failed\")]]);\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst folder = graph.initNode(op, [src], {\n\t\t\t\tname: options.name ? `${options.name}.bind#${bindSeq++}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_bind_source\", collection: \"reactiveList\" },\n\t\t\t});\n\t\t\tbindDeps.add(folder as Node<unknown>);\n\t\t\tconst applyNode = ensureApply();\n\t\t\tapplyNode.subscribeDep(folder as Node<unknown>, applyBody);\n\t\t\tlet active = true;\n\t\t\tconst dispose = () => {\n\t\t\t\tif (!active) return;\n\t\t\t\tactive = false;\n\t\t\t\tapplyNode.unsubscribeDep(folder as Node<unknown>, applyBody);\n\t\t\t};\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\treleaseApply();\n\t\t},\n\t};\n}\n","/**\n * Reactive append-only log (CSP-2.8, D54/D60) — two-port collection with incremental views.\n *\n * Shape = the shared {@link collectionCore} two ports over an array (or ring-buffer if `maxSize`)\n * BACKEND (D60). Specializations (D60 #5 / review #5):\n *   - SNAPSHOT (the full `readonly T[]`) is the lazy pull port like the others, BUT the log's main\n *     consumption is INCREMENTAL: `tail()` / `slice()` / `scan()` re-derive on the DELTA backbone\n *     (dep=[delta]), folding each appended value as it arrives — NOT re-scanning a pushed full array.\n *   - `append(undefined)` throws: `undefined` is the substrate SENTINEL (R-data-payload / R-sentinel),\n *     not a valid value.\n *   - empty log: the snapshot is `[]` (a real empty array); a never-appended `scan` seeds its initial.\n *     There is NO `[[RESOLVED]]`-for-empty dual role (D49 narrowed RESOLVED to undirty-only, D60 #5b).\n *   - `attach(upstream)` = the D54 widening (a declared input-fold dep), NOT an imperative subscribe.\n *   - {@link mergeReactiveLogs} is a DECLARED-DEP merge (deps=[...delta streams]), NOT the old\n *     internal-subscribe island (D45 must-fix, D60 #5e).\n *   - storage persistence = D57 (binding-layer observe-sink), out of scope here.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch, depCount } from \"../../ctx/types.js\";\nimport { type Node, node } from \"../../node/node.js\";\nimport type { GraphCheckpointJson } from \"../checkpoint.js\";\nimport { trimHeadOverflow } from \"../policies/collection.js\";\nimport type { ViewCachePolicy } from \"../policies/types.js\";\nimport type { LogChange } from \"./change.js\";\nimport {\n\ttype CollectionCore,\n\ttype CollectionCoreOptions,\n\tcollectionCore,\n\tlightReactiveView,\n\ttype ReactiveView,\n\tViewMemoCache,\n} from \"./core.js\";\n\nexport interface ReactiveLogOptions extends CollectionCoreOptions {\n\t/** Ring-buffer cap: appends past `maxSize` evict the oldest (head-trim, append-only-safe). */\n\tmaxSize?: number;\n\t/** Static D80 memo policy for D121 light views. Eviction does not dispose returned views. */\n\tviewCache?: ViewCachePolicy;\n}\n\nexport interface ReactiveLog<T> {\n\treadonly delta: Node<LogChange<T>>;\n\t/** SNAPSHOT pull node: demand → full `readonly T[]` (lazy O(n)). For incremental use {@link tail}, {@link slice}, or {@link scan}. */\n\treadonly snapshot: Node<readonly T[]>;\n\treadonly pullId: symbol;\n\t/** Entry count (O(1)). Sync non-reactive read. */\n\treadonly size: number;\n\t/** Positional access (O(1)); negative Python-style; `undefined` out of range. Sync read. */\n\tat(index: number): T | undefined;\n\t/** Full contents (O(n) fresh copy). Sync non-reactive read (cold-start peek). */\n\ttoArray(): readonly T[];\n\t/** Append one value. Throws on `undefined` (substrate SENTINEL, R-data-payload). */\n\tappend(value: T): void;\n\t/** Append many; one delta event. No-op if empty. Throws if any value is `undefined`. */\n\tappendMany(values: readonly T[]): void;\n\tclear(): void;\n\t/** Remove the first `n` entries (clamped to size). */\n\ttrimHead(n: number): void;\n\t/**\n\t * Incremental tail view: a derived node emitting the last `n` entries, recomputed on each delta\n\t * (dep=[delta], D60 #5a). Memoized per `n` until {@link dispose}; use stable ranges for\n\t * long-lived logs. Subscribe to keep it live.\n\t */\n\ttail(n: number): Node<readonly T[]>;\n\t/**\n\t * Incremental positional view: a derived node emitting `toArray().slice(start, stop)`,\n\t * recomputed on each delta (dep=[delta], D60 #5a). Memoized per `[start, stop]` until\n\t * {@link dispose}; use stable ranges for long-lived logs.\n\t */\n\tslice(start: number, stop?: number): Node<readonly T[]>;\n\t/**\n\t * D121 light page view: `delta` forwards parent log mutations, and `snapshot` is a pull node\n\t * that materializes the current page on demand.\n\t */\n\tpage(offset: number, limit: number): ReactiveView<LogChange<T>, readonly T[]>;\n\t/**\n\t * Incremental running aggregate over appended values (dep=[delta], D60 #5a). O(1) per append —\n\t * folds only the new values each delta; resets on `clear`/`trimHead` (a non-append delta) via a\n\t * full re-fold. Emits the current accumulator on every mutation; seeds `initial` on an empty log.\n\t */\n\tscan<A>(initial: A, step: (acc: A, value: T) => A): Node<A>;\n\t/** D54 widening: every value from `src` is appended. Returns a disposer. */\n\tattach(src: Node<T>): () => void;\n\tdispose(): void;\n}\n\n/** Default array / ring-buffer backend (D60 first-cut; persistent backend deferred). */\nclass LogBackend<T> {\n\tprivate _version = 0;\n\tprivate buf: T[];\n\tprivate readonly maxSize?: number;\n\n\tconstructor(initial?: readonly T[], maxSize?: number) {\n\t\tif (maxSize !== undefined && maxSize < 1)\n\t\t\tthrow new RangeError(\"reactiveLog: maxSize must be >= 1\");\n\t\tthis.maxSize = maxSize;\n\t\tthis.buf = initial ? [...initial] : [];\n\t\ttrimHeadOverflow(this.buf, { maxSize });\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\tget size(): number {\n\t\treturn this.buf.length;\n\t}\n\tat(index: number): T | undefined {\n\t\tif (!Number.isInteger(index)) return undefined;\n\t\tconst i = index >= 0 ? index : this.buf.length + index;\n\t\treturn i < 0 || i >= this.buf.length ? undefined : this.buf[i];\n\t}\n\tsnapshot(): readonly T[] {\n\t\treturn [...this.buf];\n\t}\n\n\tappend(value: T): void {\n\t\tthis.buf.push(value);\n\t\ttrimHeadOverflow(this.buf, { maxSize: this.maxSize });\n\t\tthis._version += 1;\n\t}\n\tappendMany(values: readonly T[]): void {\n\t\tif (values.length === 0) return;\n\t\tfor (const v of values) this.buf.push(v);\n\t\ttrimHeadOverflow(this.buf, { maxSize: this.maxSize });\n\t\tthis._version += 1;\n\t}\n\tclear(): number {\n\t\tconst n = this.buf.length;\n\t\tif (n === 0) return 0;\n\t\tthis.buf.length = 0;\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\ttrimHead(n: number): number {\n\t\tif (!Number.isInteger(n) || n < 0)\n\t\t\tthrow new RangeError(`trimHead: n must be a non-negative integer (got ${n})`);\n\t\tif (n === 0 || this.buf.length === 0) return 0;\n\t\tconst removed = Math.min(n, this.buf.length);\n\t\tthis.buf.splice(0, removed);\n\t\tthis._version += 1;\n\t\treturn removed;\n\t}\n}\n\nfunction rejectUndefined<T>(value: T, ctx: string): void {\n\t// R-data-payload / R-sentinel (D60 #5): undefined is the substrate SENTINEL, not a valid value.\n\tif (value === undefined)\n\t\tthrow new TypeError(\n\t\t\t`${ctx}: undefined is the substrate SENTINEL, not a valid value — use null`,\n\t\t);\n}\n\n/**\n * Create an append-only reactive log (D54/D60). DELTA + lazy pull SNAPSHOT + pullId via\n * {@link collectionCore}; this layer adds the typed append surface + incremental view/scan.\n */\nexport function reactiveLog<T>(\n\tinitial?: readonly T[],\n\toptions: ReactiveLogOptions = {},\n): ReactiveLog<T> {\n\tconst { maxSize, viewCache, ...coreOpts } = options;\n\tconst base = coreOpts.dispatcher ? { dispatcher: coreOpts.dispatcher } : {};\n\tconst backend = new LogBackend<T>(initial, maxSize);\n\tconst restoreConfig =\n\t\tcoreOpts.graph !== undefined && coreOpts.name !== undefined\n\t\t\t? ({\n\t\t\t\t\t...(maxSize !== undefined ? { maxSize } : {}),\n\t\t\t\t} as GraphCheckpointJson)\n\t\t\t: undefined;\n\tconst core: CollectionCore<readonly T[], LogChange<T>> = collectionCore(\n\t\tbackend,\n\t\t\"reactiveLog\",\n\t\tcoreOpts,\n\t\trestoreConfig !== undefined\n\t\t\t? {\n\t\t\t\t\tdeltaRef: \"reactiveLog.delta\",\n\t\t\t\t\tsnapshotRef: \"reactiveLog.snapshot\",\n\t\t\t\t\tconfig: restoreConfig,\n\t\t\t\t\tbackendState: () => backend.snapshot(),\n\t\t\t\t}\n\t\t\t: undefined,\n\t);\n\tconst binds: Array<() => void> = [];\n\tconst tailMemo = new Map<number, Node<readonly T[]>>();\n\tconst sliceMemo = new Map<string, Node<readonly T[]>>();\n\tconst pageMemo = new ViewMemoCache<string, ReactiveView<LogChange<T>, readonly T[]>>(viewCache);\n\tlet pageSeq = 0;\n\n\treturn {\n\t\tdelta: core.delta,\n\t\tsnapshot: core.snapshot,\n\t\tpullId: core.pullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\tat(index: number): T | undefined {\n\t\t\treturn backend.at(index);\n\t\t},\n\t\ttoArray(): readonly T[] {\n\t\t\treturn backend.snapshot();\n\t\t},\n\n\t\tappend(value: T): void {\n\t\t\trejectUndefined(value, \"reactiveLog.append\");\n\t\t\tbackend.append(value);\n\t\t\tcore.emit({ kind: \"append\", value });\n\t\t},\n\t\tappendMany(values: readonly T[]): void {\n\t\t\tif (values.length === 0) return;\n\t\t\tfor (const v of values) rejectUndefined(v, \"reactiveLog.appendMany\");\n\t\t\tconst copy = [...values];\n\t\t\tbackend.appendMany(copy);\n\t\t\tcore.emit({ kind: \"appendMany\", values: copy });\n\t\t},\n\t\tclear(): void {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) core.emit({ kind: \"clear\", count });\n\t\t},\n\t\ttrimHead(n: number): void {\n\t\t\tconst removed = backend.trimHead(n);\n\t\t\tif (removed > 0) core.emit({ kind: \"trimHead\", n: removed });\n\t\t},\n\n\t\ttail(n: number): Node<readonly T[]> {\n\t\t\tif (!Number.isInteger(n) || n < 0)\n\t\t\t\tthrow new RangeError(`tail: n must be a non-negative integer (got ${n})`);\n\t\t\tconst hit = tailMemo.get(n);\n\t\t\tif (hit !== undefined) return hit;\n\t\t\t// Incremental on the DELTA backbone (D60 #5a): each delta re-reads the backend's current\n\t\t\t// tail (the backend is this structure's own materialized state, D60 #1 — not a foreign\n\t\t\t// .cache peek). `partial:true` — the tail does not consume the delta value, it fires on arm.\n\t\t\tconst tnode = node<readonly T[]>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\tconst all = backend.snapshot();\n\t\t\t\t\tctx.down([[\"DATA\", n === 0 ? [] : all.slice(Math.max(0, all.length - n))]]);\n\t\t\t\t},\n\t\t\t\t{ ...base, factory: \"reactiveLog.tail\", partial: true },\n\t\t\t);\n\t\t\ttailMemo.set(n, tnode);\n\t\t\treturn tnode;\n\t\t},\n\n\t\tslice(start: number, stop?: number): Node<readonly T[]> {\n\t\t\tif (!Number.isInteger(start) || start < 0) {\n\t\t\t\tthrow new RangeError(`slice: start must be a non-negative integer (got ${start})`);\n\t\t\t}\n\t\t\tif (stop !== undefined && (!Number.isInteger(stop) || stop < 0)) {\n\t\t\t\tthrow new RangeError(`slice: stop must be a non-negative integer (got ${stop})`);\n\t\t\t}\n\t\t\tconst key = `${start}:${stop ?? \"\"}`;\n\t\t\tconst hit = sliceMemo.get(key);\n\t\t\tif (hit !== undefined) return hit;\n\t\t\t// Incremental on the DELTA backbone (D60 #5a): each delta re-reads this log's own\n\t\t\t// backend slice. The backend is the single materialized state (D60), not a dep cache.\n\t\t\tconst snode = node<readonly T[]>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\tctx.down([[\"DATA\", backend.snapshot().slice(start, stop)]]);\n\t\t\t\t},\n\t\t\t\t{ ...base, factory: \"reactiveLog.slice\", partial: true },\n\t\t\t);\n\t\t\tsliceMemo.set(key, snode);\n\t\t\treturn snode;\n\t\t},\n\n\t\tpage(offset: number, limit: number): ReactiveView<LogChange<T>, readonly T[]> {\n\t\t\tif (!Number.isInteger(offset) || offset < 0) {\n\t\t\t\tthrow new RangeError(`page: offset must be a non-negative integer (got ${offset})`);\n\t\t\t}\n\t\t\tif (!Number.isInteger(limit) || limit < 0) {\n\t\t\t\tthrow new RangeError(`page: limit must be a non-negative integer (got ${limit})`);\n\t\t\t}\n\t\t\tconst key = `${offset}:${limit}`;\n\t\t\tconst hit = pageMemo.get(key);\n\t\t\tif (hit !== undefined) return hit;\n\t\t\tconst materialize = (): readonly T[] => backend.snapshot().slice(offset, offset + limit);\n\t\t\tlet view: ReactiveView<LogChange<T>, readonly T[]>;\n\t\t\tview = lightReactiveView<LogChange<T>, readonly T[]>(core.delta as Node<unknown>, {\n\t\t\t\t...coreOpts,\n\t\t\t\tfactory: \"reactiveLog.page\",\n\t\t\t\tname: coreOpts.name ? `${coreOpts.name}.page#${pageSeq++}` : undefined,\n\t\t\t\tmaterializeSnapshot: materialize,\n\t\t\t\tonDispose: () => {\n\t\t\t\t\tpageMemo.deleteValue(view);\n\t\t\t\t},\n\t\t\t});\n\t\t\tpageMemo.set(key, view);\n\t\t\treturn view;\n\t\t},\n\n\t\tscan<A>(initial: A, step: (acc: A, value: T) => A): Node<A> {\n\t\t\t// Incremental fold on the delta backbone: keep the accumulator + processed-count in\n\t\t\t// ctx.state; fold only the new tail each append; full re-fold on a shrink (clear/trimHead).\n\t\t\treturn node<A>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\tconst st = ctx.state.get<{ acc: A; processed: number }>() ?? {\n\t\t\t\t\t\tacc: initial,\n\t\t\t\t\t\tprocessed: 0,\n\t\t\t\t\t};\n\t\t\t\t\tconst all = backend.snapshot();\n\t\t\t\t\tif (all.length < st.processed || (maxSize !== undefined && all.length <= st.processed)) {\n\t\t\t\t\t\t// Shrink or ring-buffer overwrite: re-fold from the current backend snapshot.\n\t\t\t\t\t\tlet acc = initial;\n\t\t\t\t\t\tfor (const v of all) acc = step(acc, v);\n\t\t\t\t\t\tst.acc = acc;\n\t\t\t\t\t\tst.processed = all.length;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = st.processed; i < all.length; i++) st.acc = step(st.acc, all[i] as T);\n\t\t\t\t\t\tst.processed = all.length;\n\t\t\t\t\t}\n\t\t\t\t\tctx.state.set(st);\n\t\t\t\t\tctx.down([[\"DATA\", st.acc]]);\n\t\t\t\t},\n\t\t\t\t{ ...base, factory: \"reactiveLog.scan\", partial: true },\n\t\t\t);\n\t\t},\n\n\t\tattach(src: Node<T>): () => void {\n\t\t\tconst dispose = core.bindSource(src, (value: T) => {\n\t\t\t\trejectUndefined(value, \"reactiveLog.attach\");\n\t\t\t\tbackend.append(value);\n\t\t\t\tcore.emit({ kind: \"append\", value });\n\t\t\t});\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\ttailMemo.clear();\n\t\t\tsliceMemo.clear();\n\t\t\tpageMemo.disposeAll();\n\t\t},\n\t};\n}\n\n/**\n * Fan-in N reactive logs into one merged DELTA stream (D60 #5e — a DECLARED-DEP merge, NOT the old\n * internal-subscribe island). The returned node declares each log's `delta` as a dep (`partial`)\n * and re-emits every change it sees — describe shows `log[i].delta → merged` truthfully (D45).\n * For the merged SNAPSHOT, fold the merged delta with {@link ReactiveLog.scan}-style logic, or\n * demand each source's snapshot independently.\n */\nexport function mergeReactiveLogs<T>(logs: readonly ReactiveLog<T>[]): Node<LogChange<T>> {\n\tconst deps = logs.map((l) => l.delta as Node<unknown>);\n\treturn node<LogChange<T>>(\n\t\tdeps,\n\t\t(ctx: Ctx) => {\n\t\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\tif (b) for (const c of b) ctx.down([[\"DATA\", c as LogChange<T>]]);\n\t\t\t}\n\t\t},\n\t\t{ factory: \"mergeReactiveLogs\", partial: true },\n\t);\n}\n\n/**\n * Standalone incremental scan over a reactive log. Equivalent to `log.scan(initial, step)`;\n * provided for pipe-builder and helper-composition call sites.\n */\nexport function scanLog<T, A>(\n\tlog: ReactiveLog<T>,\n\tinitial: A,\n\tstep: (acc: A, value: T) => A,\n): Node<A> {\n\treturn log.scan(initial, step);\n}\n","/**\n * Async + sync sources (binding-layer sugar, D43 / D40 / feedback_async_sources_binding_layer).\n *\n * Sources are depless {@link Operator}`<never, T>` specs built on the `producer`/`node` path:\n * the body runs ONCE on activation (node `_activate`), schedules its work, and emits later via\n * the captured `ctx.down` (an external tier-3 emit → the leading DIRTY is synthesized for it,\n * R-dirty-before-data). Async lives ONLY here (R-no-raw-async / F-SYNC-CORE): `setTimeout` /\n * `Promise` / `for await` are confined to source bodies; the wave core stays sync. Cleanup is\n * `ctx.onDeactivation` (D28), NOT a returned object. Per-language (D6/D24), never in parity.\n *\n * Instantiate via `g.initNode(timer(1000), [])` (graph-bound, inspectable) or\n * {@link initNode}(timer(1000), []) (bare). Pool/pause defaults (D43): timer/interval =\n * sync + pausable:false (keep producing through PAUSE); fromPromise/fromAsyncIter = async\n * (default pausable, so a paused source buffers its late emits — R-async-paused).\n */\n\nimport type { Ctx } from \"../ctx/types.js\";\nimport type { Node, NodeOptions } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport { toCheckpointJson } from \"./checkpoint.js\";\nimport type {\n\tDriverCancel,\n\tDriverResult,\n\tHttpRequest,\n\tHttpResponse,\n\tProcessCommand,\n\tProcessResult,\n\tSseDriverEvent,\n\tSseEvent,\n\tSseRequest,\n\tWebhookDriverEvent,\n\tWebhookEvent,\n\tWebhookRegistration,\n\tWebSocketDriverEvent,\n\tWebSocketEvent,\n\tWebSocketRequest,\n} from \"./environment.js\";\nimport { initNode, type Operator } from \"./operators.js\";\n\n/**\n * Values accepted by {@link fromAny}: an existing Node, a Promise, an (a)sync iterable, or a\n * bare scalar. The universal coercion target for higher-order operators (CSP-2.7).\n */\nexport type NodeInput<T> = Node<T> | PromiseLike<T> | AsyncIterable<T> | Iterable<T> | T;\n\n/** Host-boundary options for {@link singleFromAny}. */\nexport interface SingleFromAnyOptions<K> {\n\t/**\n\t * Map a caller key to the in-flight dedupe key. Defaults to key identity; object keys dedupe only\n\t * when the same object reference is reused. Return a stable string/canonical value for structural\n\t * object-key dedupe.\n\t */\n\tkeyOf?: (key: K) => unknown;\n\t/** Treat a sync iterable result as a stream and take its first item. Defaults to scalar value. */\n\titer?: boolean;\n}\n\n/**\n * Internal: build a depless source spec. `setup` runs once on activation; its returned fn (if\n * any) is registered as the deactivation cleanup (clear timers / abort). `setup` schedules the\n * async work and emits via `ctx.down` — synchronously (sync sources) or later (async sources).\n */\nfunction source<T>(\n\tfactory: string,\n\t// biome-ignore lint/suspicious/noConfusingVoidType: setup returns a cleanup fn OR nothing — the void arm keeps no-return source bodies (e.g. `of`/`fromIter`) ergonomic, same idiom as EffectFn.\n\tsetup: (ctx: Ctx) => void | (() => void),\n\topts?: Partial<NodeOptions<T>>,\n): Operator<never, T> {\n\treturn {\n\t\tfactory,\n\t\topts,\n\t\tbody: (ctx) => {\n\t\t\tlet cleanup: undefined | (() => void);\n\t\t\tlet deactivated = false;\n\t\t\tctx.onDeactivation(() => {\n\t\t\t\tdeactivated = true;\n\t\t\t\tif (typeof cleanup === \"function\") cleanup();\n\t\t\t});\n\t\t\tconst maybeCleanup = setup(ctx);\n\t\t\tcleanup = typeof maybeCleanup === \"function\" ? maybeCleanup : undefined;\n\t\t\tif (deactivated && typeof cleanup === \"function\") cleanup();\n\t\t},\n\t};\n}\n\nfunction assertNonEmptyString(value: string, label: string): void {\n\tif (typeof value !== \"string\" || value.length === 0) {\n\t\tthrow new TypeError(`${label} must be a non-empty string`);\n\t}\n}\n\nfunction cleanupDriverWork(\n\tactive: { value: boolean },\n\tcancelSlot: { value: DriverCancel | undefined },\n): void {\n\tactive.value = false;\n\tconst cancel = cancelSlot.value;\n\tcancelSlot.value = undefined;\n\tif (cancel !== undefined) runDriverCancel(cancel);\n}\n\nfunction installDriverCancel(\n\tactive: { value: boolean },\n\tcancelSlot: { value: DriverCancel | undefined },\n\tcancel: DriverCancel,\n): void {\n\tif (active.value) cancelSlot.value = cancel;\n\telse runDriverCancel(cancel);\n}\n\nfunction runDriverCancel(cancel: DriverCancel): void {\n\ttry {\n\t\tcancel();\n\t} catch {\n\t\t// Driver cleanup is best-effort: it must not suppress graph-visible terminal delivery.\n\t}\n}\n\nfunction driverOneShotSource<T>(\n\tfactory: string,\n\tmissing: string,\n\tstart: (ctx: Ctx, callback: (result: DriverResult<T>) => void) => DriverCancel | undefined,\n): Operator<never, T> {\n\treturn source<T>(\n\t\tfactory,\n\t\t(ctx) => {\n\t\t\tconst active = { value: true };\n\t\t\tconst cancelSlot: { value: DriverCancel | undefined } = { value: undefined };\n\t\t\tconst callback = (result: DriverResult<T>) => {\n\t\t\t\tif (!active.value) return;\n\t\t\t\tcleanupDriverWork(active, cancelSlot);\n\t\t\t\tif (result.ok) ctx.down([[\"DATA\", result.value], [\"COMPLETE\"]]);\n\t\t\t\telse ctx.down([[\"ERROR\", errorPayload(result.error)]]);\n\t\t\t};\n\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\ttry {\n\t\t\t\tcancel = start(ctx, callback);\n\t\t\t} catch (e) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (cancel === undefined) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", missing]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tinstallDriverCancel(active, cancelSlot, cancel);\n\t\t\treturn () => cleanupDriverWork(active, cancelSlot);\n\t\t},\n\t\t{ pool: \"async\", pausable: false },\n\t);\n}\n\nfunction driverStreamSource<T, E extends { readonly kind: string }>(\n\tfactory: string,\n\tmissing: string,\n\tstart: (ctx: Ctx, callback: (event: E) => void) => DriverCancel | undefined,\n\tdataOf: (event: E) => T | undefined,\n\terrorOf: (event: E) => unknown,\n): Operator<never, T> {\n\treturn source<T>(\n\t\tfactory,\n\t\t(ctx) => {\n\t\t\tconst active = { value: true };\n\t\t\tconst cancelSlot: { value: DriverCancel | undefined } = { value: undefined };\n\t\t\tconst callback = (event: E) => {\n\t\t\t\tif (!active.value) return;\n\t\t\t\tif (event.kind === \"event\") {\n\t\t\t\t\tconst value = dataOf(event);\n\t\t\t\t\tif (value !== undefined) ctx.down([[\"DATA\", value]]);\n\t\t\t\t} else if (event.kind === \"error\") {\n\t\t\t\t\tcleanupDriverWork(active, cancelSlot);\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(errorOf(event))]]);\n\t\t\t\t} else if (event.kind === \"complete\") {\n\t\t\t\t\tcleanupDriverWork(active, cancelSlot);\n\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t}\n\t\t\t};\n\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\ttry {\n\t\t\t\tcancel = start(ctx, callback);\n\t\t\t} catch (e) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (cancel === undefined) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", missing]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tinstallDriverCancel(active, cancelSlot, cancel);\n\t\t\treturn () => cleanupDriverWork(active, cancelSlot);\n\t\t},\n\t\t{ pool: \"async\", pausable: false },\n\t);\n}\n\nfunction isNode(x: unknown): x is Node {\n\treturn (\n\t\tx != null &&\n\t\ttypeof x === \"object\" &&\n\t\t\"cache\" in x &&\n\t\ttypeof (x as Node).subscribe === \"function\"\n\t);\n}\n\nfunction isThenable(x: unknown): x is PromiseLike<unknown> {\n\treturn x != null && typeof (x as PromiseLike<unknown>).then === \"function\";\n}\n\nfunction isAsyncIterable<T>(x: unknown): x is AsyncIterable<T> {\n\treturn (\n\t\tx !== null &&\n\t\tx !== undefined &&\n\t\ttypeof (x as { [Symbol.asyncIterator]?: unknown })[Symbol.asyncIterator] === \"function\"\n\t);\n}\n\nfunction isIterable<T>(x: unknown): x is Iterable<T> {\n\treturn (\n\t\tx !== null &&\n\t\tx !== undefined &&\n\t\ttypeof (x as { [Symbol.iterator]?: unknown })[Symbol.iterator] === \"function\"\n\t);\n}\n\n/** Options shared by async/timer sources: an optional AbortSignal → ERROR on abort. */\nexport interface AsyncSourceOpts {\n\tsignal?: AbortSignal;\n}\n\nexport interface TimerSourceOpts extends AsyncSourceOpts {\n\tperiod?: number;\n}\n\n/** Options for {@link fromCron}. */\nexport interface FromCronOptions extends AsyncSourceOpts {\n\t/** Cron matcher polling interval in milliseconds. Default: 60_000. */\n\ttickMs?: number;\n\t/**\n\t * Emitted value shape. `timestamp_ns` is a decimal string so it cannot lose precision as a\n\t * JavaScript number; use `timestamp_ms` when numeric millisecond precision is enough.\n\t */\n\toutput?: \"date\" | \"timestamp_ms\" | \"timestamp_ns\";\n}\n\n/** Minimal five-field cron schedule: minute hour day-of-month month day-of-week. */\nexport interface CronSchedule {\n\treadonly minutes: ReadonlySet<number>;\n\treadonly hours: ReadonlySet<number>;\n\treadonly daysOfMonth: ReadonlySet<number>;\n\treadonly months: ReadonlySet<number>;\n\treadonly daysOfWeek: ReadonlySet<number>;\n}\n\n/** DOM/EventEmitter-style target accepted by {@link fromEvent}. */\nexport interface EventTargetLike {\n\taddEventListener(\n\t\ttype: string,\n\t\tlistener: (event: unknown) => void,\n\t\toptions?: EventListenerOptionsLike,\n\t): void;\n\tremoveEventListener(\n\t\ttype: string,\n\t\tlistener: (event: unknown) => void,\n\t\toptions?: EventListenerOptionsLike,\n\t): void;\n}\n\nexport interface EventListenerOptionsLike {\n\tcapture?: boolean;\n\tpassive?: boolean;\n\tonce?: boolean;\n}\n\nexport type FromEventOptions = EventListenerOptionsLike;\n\n/** Host push registration callback accepted by {@link fromPushNotification}. */\nexport type PushUnsubscribe = () => void;\nexport type PushRegister<T> = (deliver: (payload: T) => void) => PushUnsubscribe | undefined;\n\nfunction parseCronField(field: string, min: number, max: number): Set<number> {\n\tif (field.length === 0) throw new Error(\"Invalid cron field: empty\");\n\tconst out = new Set<number>();\n\tfor (const part of field.split(\",\")) {\n\t\tif (part.length === 0) throw new Error(`Invalid cron field: ${field}`);\n\t\tconst stepParts = part.split(\"/\");\n\t\tif (stepParts.length > 2) throw new Error(`Invalid cron step: ${part}`);\n\t\tconst [range, stepText] = stepParts;\n\t\tif (range == null || range.length === 0) throw new Error(`Invalid cron field: ${field}`);\n\t\tif (stepText === \"\") throw new Error(`Invalid cron step: ${part}`);\n\t\tconst step = stepText == null ? 1 : parseCronInt(stepText, `Invalid cron step: ${part}`);\n\t\tif (step < 1) throw new Error(`Invalid cron step: ${part}`);\n\n\t\tlet start: number;\n\t\tlet end: number;\n\t\tif (range === \"*\") {\n\t\t\tstart = min;\n\t\t\tend = max;\n\t\t} else if (range.includes(\"-\")) {\n\t\t\tconst [a, b, extra] = range.split(\"-\");\n\t\t\tif (extra !== undefined || a === \"\" || b === \"\")\n\t\t\t\tthrow new Error(`Invalid cron field: ${field}`);\n\t\t\tstart = parseCronInt(a, `Invalid cron field: ${field}`);\n\t\t\tend = parseCronInt(b, `Invalid cron field: ${field}`);\n\t\t} else {\n\t\t\tstart = parseCronInt(range, `Invalid cron field: ${field}`);\n\t\t\tend = start;\n\t\t}\n\n\t\tif (!Number.isInteger(start) || !Number.isInteger(end)) {\n\t\t\tthrow new Error(`Invalid cron field: ${field}`);\n\t\t}\n\t\tif (start < min || end > max) {\n\t\t\tthrow new RangeError(`Cron field out of range: ${field} (${min}-${max})`);\n\t\t}\n\t\tif (start > end) throw new Error(`Invalid cron range: ${start}-${end} in ${field}`);\n\t\tfor (let i = start; i <= end; i += step) out.add(i);\n\t}\n\treturn out;\n}\n\nfunction parseCronInt(text: string, message: string): number {\n\tif (!/^\\d+$/.test(text)) throw new Error(message);\n\tconst value = Number.parseInt(text, 10);\n\tif (!Number.isSafeInteger(value)) throw new Error(message);\n\treturn value;\n}\n\n/** Parse a standard five-field cron expression. */\nexport function parseCron(expr: string): CronSchedule {\n\tconst parts = expr.trim().split(/\\s+/);\n\tif (parts.length !== 5 || parts.some((part) => part.length === 0)) {\n\t\tthrow new Error(`Invalid cron: expected 5 fields, got ${parts.length}`);\n\t}\n\treturn {\n\t\tminutes: parseCronField(parts[0], 0, 59),\n\t\thours: parseCronField(parts[1], 0, 23),\n\t\tdaysOfMonth: parseCronField(parts[2], 1, 31),\n\t\tmonths: parseCronField(parts[3], 1, 12),\n\t\tdaysOfWeek: parseCronField(parts[4], 0, 6),\n\t};\n}\n\n/** Test whether a local Date matches a parsed cron schedule. */\nexport function matchesCron(schedule: CronSchedule, date: Date): boolean {\n\treturn (\n\t\tschedule.minutes.has(date.getMinutes()) &&\n\t\tschedule.hours.has(date.getHours()) &&\n\t\tschedule.daysOfMonth.has(date.getDate()) &&\n\t\tschedule.months.has(date.getMonth() + 1) &&\n\t\tschedule.daysOfWeek.has(date.getDay())\n\t);\n}\n\nfunction cronMinuteKey(date: Date): string {\n\treturn `${date.getFullYear()}-${date.getMonth() + 1}-${date.getDate()}-${date.getHours()}-${date.getMinutes()}`;\n}\n\nfunction dateToTimestampNs(date: Date): string {\n\treturn (BigInt(date.getTime()) * 1_000_000n).toString();\n}\n\nexport function fromCron(\n\texpr: string,\n\topts: FromCronOptions & { output: \"date\" },\n): Operator<never, Date>;\nexport function fromCron(\n\texpr: string,\n\topts: FromCronOptions & { output: \"timestamp_ms\" },\n): Operator<never, number>;\nexport function fromCron(\n\texpr: string,\n\topts?: FromCronOptions & { output?: \"timestamp_ns\" },\n): Operator<never, string>;\nexport function fromCron(\n\texpr: string,\n\topts?: FromCronOptions,\n): Operator<never, Date | number | string>;\nexport function fromCron(\n\texpr: string,\n\topts: FromCronOptions = {},\n): Operator<never, Date | number | string> {\n\tconst schedule = parseCron(expr);\n\tconst { tickMs = 60_000, output = \"timestamp_ns\", signal } = opts;\n\tif (!Number.isFinite(tickMs) || tickMs <= 0) {\n\t\tthrow new RangeError(\"fromCron: tickMs must be a positive finite number\");\n\t}\n\treturn source<Date | number | string>(\n\t\t\"fromCron\",\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tlet lastFiredKey: string | undefined;\n\t\t\tlet intervalId: ReturnType<typeof setInterval> | undefined;\n\t\t\tconst cleanup = () => {\n\t\t\t\tdone = true;\n\t\t\t\tif (intervalId !== undefined) clearInterval(intervalId);\n\t\t\t\tintervalId = undefined;\n\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t};\n\t\t\tconst onAbort = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tcleanup();\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(signal?.reason)]]);\n\t\t\t};\n\t\t\tconst emitNow = (now: Date) => {\n\t\t\t\tif (output === \"date\") ctx.down([[\"DATA\", now]]);\n\t\t\t\telse if (output === \"timestamp_ms\") ctx.down([[\"DATA\", now.getTime()]]);\n\t\t\t\telse ctx.down([[\"DATA\", dateToTimestampNs(now)]]);\n\t\t\t};\n\t\t\tconst check = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tconst now = new Date();\n\t\t\t\tconst key = cronMinuteKey(now);\n\t\t\t\tif (key !== lastFiredKey && matchesCron(schedule, now)) {\n\t\t\t\t\tlastFiredKey = key;\n\t\t\t\t\temitNow(now);\n\t\t\t\t}\n\t\t\t};\n\t\t\tif (signal?.aborted) {\n\t\t\t\tonAbort();\n\t\t\t\treturn cleanup;\n\t\t\t}\n\t\t\tsignal?.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tcheck();\n\t\t\tintervalId = setInterval(check, tickMs);\n\t\t\treturn cleanup;\n\t\t},\n\t\t{ pool: \"sync\", pausable: false },\n\t);\n}\n\nexport function runProcess(\n\tprogram: string,\n\targs: readonly string[] = [],\n): Operator<never, ProcessResult> {\n\treturn runProcessWithOptions({ program, args });\n}\n\nexport function fromProcess(\n\tprogram: string,\n\targs: readonly string[] = [],\n): Operator<never, ProcessResult> {\n\treturn processSource(\"fromProcess\", { program, args });\n}\n\nexport function runProcessWithOptions(command: ProcessCommand): Operator<never, ProcessResult> {\n\treturn processSource(\"runProcess\", command);\n}\n\nfunction processSource(factory: string, command: ProcessCommand): Operator<never, ProcessResult> {\n\tassertNonEmptyString(command.program, `${factory}: program`);\n\treturn driverOneShotSource<ProcessResult>(\n\t\tfactory,\n\t\t`${factory}: missing process driver`,\n\t\t(ctx, callback) => ctx.environment().processDriver()?.run(command, callback),\n\t);\n}\n\nexport function fromHttp(url: string): Operator<never, HttpResponse> {\n\treturn fromHttpWithOptions({ method: \"GET\", url });\n}\n\nexport function fromHttpWithOptions(request: HttpRequest): Operator<never, HttpResponse> {\n\tassertNonEmptyString(request.url, \"fromHttp: url\");\n\tassertNonEmptyString(request.method, \"fromHttp: method\");\n\treturn driverOneShotSource<HttpResponse>(\n\t\t\"fromHttp\",\n\t\t\"fromHttp: missing http driver\",\n\t\t(ctx, callback) => ctx.environment().httpDriver()?.request(request, callback),\n\t);\n}\n\nexport function fromSSE(url: string): Operator<never, SseEvent> {\n\treturn fromSSEWithOptions({ url });\n}\n\nexport function fromSSEWithOptions(request: SseRequest): Operator<never, SseEvent> {\n\tassertNonEmptyString(request.url, \"fromSSE: url\");\n\treturn driverStreamSource<SseEvent, SseDriverEvent>(\n\t\t\"fromSSE\",\n\t\t\"fromSSE: missing sse driver\",\n\t\t(ctx, callback) => ctx.environment().sseDriver()?.connect(request, callback),\n\t\t(event) => (event.kind === \"event\" ? event.event : undefined),\n\t\t(event) => (event.kind === \"error\" ? event.error : undefined),\n\t);\n}\n\nexport function fromWebSocket(url: string): Operator<never, WebSocketEvent> {\n\treturn fromWebSocketWithOptions({ url });\n}\n\nexport function fromWebSocketWithOptions(\n\trequest: WebSocketRequest,\n): Operator<never, WebSocketEvent> {\n\tassertNonEmptyString(request.url, \"fromWebSocket: url\");\n\treturn driverStreamSource<WebSocketEvent, WebSocketDriverEvent>(\n\t\t\"fromWebSocket\",\n\t\t\"fromWebSocket: missing websocket driver\",\n\t\t(ctx, callback) => ctx.environment().webSocketDriver()?.connect(request, callback),\n\t\t(event) => (event.kind === \"event\" ? event.event : undefined),\n\t\t(event) => (event.kind === \"error\" ? event.error : undefined),\n\t);\n}\n\nexport function fromWebhook(id: string): Operator<never, WebhookEvent> {\n\treturn fromWebhookWithOptions({ id });\n}\n\nexport function fromWebhookWithOptions(\n\tregistration: WebhookRegistration,\n): Operator<never, WebhookEvent> {\n\tassertNonEmptyString(registration.id, \"fromWebhook: id\");\n\treturn driverStreamSource<WebhookEvent, WebhookDriverEvent>(\n\t\t\"fromWebhook\",\n\t\t\"fromWebhook: missing webhook driver\",\n\t\t(ctx, callback) => ctx.environment().webhookDriver()?.register(registration, callback),\n\t\t(event) => (event.kind === \"event\" ? event.event : undefined),\n\t\t(event) => (event.kind === \"error\" ? event.error : undefined),\n\t);\n}\n\nfunction timerSource(factory: string, ms: number, opts?: TimerSourceOpts): Operator<never, number> {\n\tconst { period, signal } = opts ?? {};\n\tconst op = source<number>(\n\t\tfactory,\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tlet count = 0;\n\t\t\tlet t: ReturnType<typeof setTimeout> | undefined;\n\t\t\tlet iv: ReturnType<typeof setInterval> | undefined;\n\t\t\tconst cleanup = () => {\n\t\t\t\tdone = true;\n\t\t\t\tif (t !== undefined) clearTimeout(t);\n\t\t\t\tif (iv !== undefined) clearInterval(iv);\n\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t};\n\t\t\tconst onAbort = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tcleanup();\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(signal?.reason)]]);\n\t\t\t};\n\t\t\tconst finish = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tif (period != null) {\n\t\t\t\t\tctx.down([[\"DATA\", count++]]);\n\t\t\t\t\tiv = setInterval(() => {\n\t\t\t\t\t\tif (done) return;\n\t\t\t\t\t\tctx.down([[\"DATA\", count++]]);\n\t\t\t\t\t}, period);\n\t\t\t\t} else {\n\t\t\t\t\t// One-shot: DATA then COMPLETE in one wave (terminal-is-forever).\n\t\t\t\t\tdone = true;\n\t\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t\t\tctx.down([[\"DATA\", count++], [\"COMPLETE\"]]);\n\t\t\t\t}\n\t\t\t};\n\t\t\tif (signal?.aborted) {\n\t\t\t\tonAbort();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tsignal?.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tt = setTimeout(finish, ms);\n\t\t\treturn cleanup;\n\t\t},\n\t\t{ pool: \"sync\", pausable: false },\n\t);\n\tif (factory === \"timer\" && period === undefined && signal === undefined) {\n\t\treturn { ...op, restore: { ref: \"timer\", config: { ms: toCheckpointJson(ms, \"timer.ms\") } } };\n\t}\n\treturn op;\n}\n\n/**\n * Timer source: one-shot (first tick then COMPLETE) or periodic (`{period}` → 0, 1, 2, …).\n * sync pool + pausable:false (a timer keeps producing through PAUSE, R-pause-modes). Emits the\n * tick counter from 0; deactivation clears the timers.\n */\nexport function timer(ms: number, opts?: TimerSourceOpts): Operator<never, number> {\n\treturn timerSource(\"timer\", ms, opts);\n}\n\n/** Frozen pure-ts name for {@link timer}; preserves the real factory name in describe(). */\nexport function fromTimer(ms: number, opts?: TimerSourceOpts): Operator<never, number> {\n\treturn timerSource(\"fromTimer\", ms, opts);\n}\n\n/** interval: periodic ticks (0, 1, 2, …), first at `ms`, then every `ms` (RxJS semantics). */\nexport function interval(ms: number): Operator<never, number> {\n\treturn timerSource(\"interval\", ms, { period: ms });\n}\n\n/**\n * Lift a Promise (or thenable) to a single-value stream: one DATA then COMPLETE, or ERROR on\n * rejection. async pool (default pausable → a paused source buffers its late emit). Optional\n * `signal` aborts to ERROR.\n */\nexport function fromPromise<T>(\n\tp: Promise<T> | PromiseLike<T>,\n\topts?: AsyncSourceOpts,\n): Operator<never, T> {\n\tconst signal = opts?.signal;\n\treturn source<T>(\n\t\t\"fromPromise\",\n\t\t(ctx) => {\n\t\t\tlet settled = false;\n\t\t\tconst onAbort = () => {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\t// onAbort only runs from a `signal` listener / the `signal.aborted` guard → signal is defined.\n\t\t\t\tctx.down([[\"ERROR\", errorPayload((signal as AbortSignal).reason)]]);\n\t\t\t};\n\t\t\tif (signal?.aborted) {\n\t\t\t\tonAbort();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tsignal?.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tvoid Promise.resolve(p).then(\n\t\t\t\t(v) => {\n\t\t\t\t\tif (settled) return;\n\t\t\t\t\tsettled = true;\n\t\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t},\n\t\t\t\t(e) => {\n\t\t\t\t\tif (settled) return;\n\t\t\t\t\tsettled = true;\n\t\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\t},\n\t\t\t);\n\t\t\treturn () => {\n\t\t\t\tsettled = true;\n\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t};\n\t\t},\n\t\t{ pool: \"async\" },\n\t);\n}\n\n/**\n * Read an async iterable: each value → DATA; COMPLETE when done; ERROR on failure. async pool.\n * Optional `signal` aborts the pump.\n */\nexport function fromAsyncIter<T>(\n\titerable: AsyncIterable<T>,\n\topts?: AsyncSourceOpts,\n): Operator<never, T> {\n\tconst outerSignal = opts?.signal;\n\treturn source<T>(\n\t\t\"fromAsyncIter\",\n\t\t(ctx) => {\n\t\t\tconst ac = new AbortController();\n\t\t\tconst onOuterAbort = () => ac.abort(outerSignal?.reason);\n\t\t\touterSignal?.addEventListener(\"abort\", onOuterAbort, { once: true });\n\t\t\tlet done = false;\n\t\t\tconst pump = async () => {\n\t\t\t\ttry {\n\t\t\t\t\tfor await (const v of iterable) {\n\t\t\t\t\t\tif (ac.signal.aborted) break;\n\t\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t\t}\n\t\t\t\t\tif (!ac.signal.aborted) ctx.down([[\"COMPLETE\"]]);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tif (!ac.signal.aborted) ctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\t} finally {\n\t\t\t\t\tdone = true;\n\t\t\t\t}\n\t\t\t};\n\t\t\tvoid pump();\n\t\t\treturn () => {\n\t\t\t\tif (!done) ac.abort();\n\t\t\t\touterSignal?.removeEventListener(\"abort\", onOuterAbort);\n\t\t\t};\n\t\t},\n\t\t{ pool: \"async\" },\n\t);\n}\n\n/**\n * of: synchronous values — each argument as DATA, then COMPLETE. `of()` is the EMPTY source.\n */\nexport function of<T = never>(...values: T[]): Operator<never, T> {\n\treturn source<T>(\n\t\t\"of\",\n\t\t(ctx) => {\n\t\t\tfor (const value of values) ctx.down([[\"DATA\", value]]);\n\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/** fromIter: a sync iterable — each value → DATA (in order), then COMPLETE, on activation. */\nexport function fromIter<T>(iterable: Iterable<T>): Operator<never, T> {\n\treturn source<T>(\n\t\t\"fromIter\",\n\t\t(ctx) => {\n\t\t\tfor (const v of iterable) ctx.down([[\"DATA\", v]]);\n\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/** EMPTY analogue: complete immediately with no DATA. */\nexport function empty<T = never>(): Operator<never, T> {\n\treturn source<T>(\n\t\t\"empty\",\n\t\t(ctx) => {\n\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/** NEVER analogue: activate and remain silent until deactivation. */\nexport function never<T = never>(): Operator<never, T> {\n\treturn source<T>(\"never\", () => undefined, { pool: \"sync\" });\n}\n\n/** Error source: terminate with ERROR on activation, coercing invalid host-language payloads. */\nexport function throwError(err: unknown): Operator<never, never> {\n\treturn source<never>(\n\t\t\"throwError\",\n\t\t(ctx) => {\n\t\t\tctx.down([[\"ERROR\", errorPayload(err)]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Wrap a DOM-style event target. Each event becomes DATA; deactivation removes the listener.\n * External callbacks are source boundaries (D43), so no polling or operator-level async leaks in.\n */\nexport function fromEvent<T = unknown>(\n\ttarget: EventTargetLike,\n\ttype: string,\n\topts: FromEventOptions = {},\n): Operator<never, T> {\n\tif (target == null || typeof target.addEventListener !== \"function\") {\n\t\tthrow new TypeError(\"fromEvent: target must implement addEventListener\");\n\t}\n\tif (typeof target.removeEventListener !== \"function\") {\n\t\tthrow new TypeError(\"fromEvent: target must implement removeEventListener\");\n\t}\n\tif (typeof type !== \"string\" || type.length === 0) {\n\t\tthrow new TypeError(\"fromEvent: event type must be a non-empty string\");\n\t}\n\treturn source<T>(\n\t\t\"fromEvent\",\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tconst handler = (event: unknown) => {\n\t\t\t\tif (!done) ctx.down([[\"DATA\", event as T]]);\n\t\t\t};\n\t\t\ttarget.addEventListener(type, handler, opts);\n\t\t\treturn () => {\n\t\t\t\tdone = true;\n\t\t\t\ttarget.removeEventListener(type, handler, opts);\n\t\t\t};\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Wrap a host push transport. The host owns network/native setup; this factory owns reactive\n * delivery and teardown only, preserving async-at-source-boundary discipline.\n */\nexport function fromPushNotification<T = unknown>(register: PushRegister<T>): Operator<never, T> {\n\tif (typeof register !== \"function\") {\n\t\tthrow new TypeError(\"fromPushNotification: register must be a function\");\n\t}\n\treturn source<T>(\n\t\t\"fromPushNotification\",\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tconst deliver = (payload: T) => {\n\t\t\t\tif (!done) ctx.down([[\"DATA\", payload]]);\n\t\t\t};\n\t\t\tconst unsubscribe = register(deliver);\n\t\t\treturn () => {\n\t\t\t\tdone = true;\n\t\t\t\tif (typeof unsubscribe === \"function\") unsubscribe();\n\t\t\t};\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Coerce a {@link NodeInput}`<T>` to a `Node<T>` (D43 — coercion prerequisite for the CSP-2.7\n * higher-order operators). An existing Node passes through; a thenable → {@link fromPromise};\n * an async iterable → {@link fromAsyncIter}; with `{iter:true}` a sync iterable →\n * {@link fromIter}; everything else → {@link of}. Coerced nodes are bare (use\n * `opts.dispatcher` to bind one, default = process-global D26).\n */\nexport function fromAny<T>(\n\tinput: NodeInput<T>,\n\topts: NodeOptions<T> & { iter?: boolean } = {},\n): Node<T> {\n\tif (isNode(input)) return input as Node<T>;\n\tconst { iter, ...nodeOpts } = opts;\n\tif (isThenable(input)) {\n\t\treturn initNode(fromPromise(input as PromiseLike<T>), [], nodeOpts);\n\t}\n\tif (input !== null && input !== undefined) {\n\t\tconst candidate = input as {\n\t\t\t[Symbol.asyncIterator]?: unknown;\n\t\t\t[Symbol.iterator]?: unknown;\n\t\t};\n\t\tif (typeof candidate[Symbol.asyncIterator] === \"function\") {\n\t\t\treturn initNode(fromAsyncIter(input as AsyncIterable<T>), [], nodeOpts);\n\t\t}\n\t\tif (iter === true && typeof candidate[Symbol.iterator] === \"function\") {\n\t\t\treturn initNode(fromIter(input as Iterable<T>), [], nodeOpts);\n\t\t}\n\t}\n\treturn initNode(of(input as T), [], nodeOpts);\n}\n\n/**\n * Resolve the first DATA from a Node as a Promise. This is a host-boundary escape hatch, not a\n * graph operator; do not call it from reactive node bodies. ERROR rejects, and COMPLETE before DATA\n * rejects because no value exists.\n */\nexport function firstValueFrom<T>(source: Node<T>): Promise<T> {\n\treturn new Promise<T>((resolve, reject) => {\n\t\tlet settled = false;\n\t\tlet shouldUnsub = false;\n\t\tlet unsub: (() => void) | undefined;\n\t\tconst finish = (f: () => void): void => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tf();\n\t\t\tif (unsub) {\n\t\t\t\tunsub();\n\t\t\t\tunsub = undefined;\n\t\t\t} else {\n\t\t\t\tshouldUnsub = true;\n\t\t\t}\n\t\t};\n\t\tunsub = source.subscribe((msg) => {\n\t\t\tif (msg[0] === \"DATA\") {\n\t\t\t\tfinish(() => resolve(msg[1] as T));\n\t\t\t} else if (msg[0] === \"ERROR\") {\n\t\t\t\tfinish(() => reject(msg[1]));\n\t\t\t} else if (msg[0] === \"COMPLETE\") {\n\t\t\t\tfinish(() => reject(new Error(\"firstValueFrom: completed without DATA\")));\n\t\t\t} else if (msg[0] === \"TEARDOWN\") {\n\t\t\t\tfinish(() => reject(new Error(\"firstValueFrom: torn down without DATA\")));\n\t\t\t}\n\t\t});\n\t\tif (shouldUnsub) {\n\t\t\tunsub?.();\n\t\t\tunsub = undefined;\n\t\t}\n\t});\n}\n\nfunction singleFromAnyValue<T>(value: T): T {\n\tif (value === undefined) {\n\t\tthrow new TypeError(\"singleFromAny: undefined is the substrate SENTINEL\");\n\t}\n\treturn value;\n}\n\nasync function firstFromAsyncIterable<T>(input: AsyncIterable<T>): Promise<T> {\n\tconst iter = input[Symbol.asyncIterator]();\n\tconst { value, done } = await iter.next();\n\tif (done) {\n\t\tawait iter.return?.();\n\t\tthrow new Error(\"singleFromAny: factory returned empty async iterable\");\n\t}\n\ttry {\n\t\tawait iter.return?.();\n\t} catch {\n\t\t// The first value is the bridge result; close failures after that are cleanup-only.\n\t}\n\treturn value as T;\n}\n\nfunction firstFromIterable<T>(input: Iterable<T>): Promise<T> {\n\tconst iter = input[Symbol.iterator]();\n\tconst { value, done } = iter.next();\n\tif (done) {\n\t\titer.return?.();\n\t\treturn Promise.reject(new Error(\"singleFromAny: factory returned empty iterable\"));\n\t}\n\ttry {\n\t\titer.return?.();\n\t} catch {\n\t\t// The first value is the bridge result; close failures after that are cleanup-only.\n\t}\n\treturn Promise.resolve(value as T);\n}\n\nfunction nodeInputToPromise<T>(input: NodeInput<T>, opts: { iter?: boolean }): Promise<T> {\n\tif (isThenable(input)) return Promise.resolve(input as PromiseLike<T>).then(singleFromAnyValue);\n\tif (isNode(input)) return firstValueFrom(input as Node<T>).then(singleFromAnyValue);\n\tif (isAsyncIterable<T>(input)) return firstFromAsyncIterable(input).then(singleFromAnyValue);\n\tif (opts.iter === true && isIterable<T>(input)) {\n\t\treturn firstFromIterable(input).then(singleFromAnyValue);\n\t}\n\tif (input === undefined) {\n\t\treturn Promise.reject(new TypeError(\"singleFromAny: undefined is the substrate SENTINEL\"));\n\t}\n\treturn Promise.resolve(singleFromAnyValue(input as T));\n}\n\n/**\n * Keyed singleflight over {@link NodeInput}. Concurrent calls with the same key share one Promise;\n * once that input resolves/rejects, the in-flight entry is cleared and a later call re-runs the\n * factory. Host-boundary helper only; it does not create graph topology.\n */\nexport function singleFromAny<K, T>(\n\tfactory: (key: K) => NodeInput<T>,\n\topts: SingleFromAnyOptions<K> = {},\n): (key: K) => Promise<T> {\n\tconst keyOf = opts.keyOf ?? ((key: K): unknown => key);\n\tconst inFlight = new Map<unknown, Promise<T>>();\n\n\treturn (key: K): Promise<T> => {\n\t\tconst dedupeKey = keyOf(key);\n\t\tconst existing = inFlight.get(dedupeKey);\n\t\tif (existing) return existing;\n\n\t\tlet resolvePending!: (value: T) => void;\n\t\tlet rejectPending!: (reason: unknown) => void;\n\t\tlet tracked!: Promise<T>;\n\t\tconst cleanup = (): void => {\n\t\t\tif (inFlight.get(dedupeKey) === tracked) inFlight.delete(dedupeKey);\n\t\t};\n\t\tconst pending = new Promise<T>((resolve, reject) => {\n\t\t\tresolvePending = resolve;\n\t\t\trejectPending = reject;\n\t\t});\n\t\ttracked = pending.then(\n\t\t\t(value) => {\n\t\t\t\tcleanup();\n\t\t\t\treturn value;\n\t\t\t},\n\t\t\t(error) => {\n\t\t\t\tcleanup();\n\t\t\t\tthrow error;\n\t\t\t},\n\t\t);\n\t\tinFlight.set(dedupeKey, tracked);\n\t\ttry {\n\t\t\tnodeInputToPromise(factory(key), opts).then(resolvePending, rejectPending);\n\t\t} catch (e) {\n\t\t\trejectPending(e);\n\t\t}\n\t\treturn tracked;\n\t};\n}\n","/**\n * Reactive key–value map (CSP-2.8, D54/D60/D68) — two-port collection with policy opts.\n *\n * Shape = the shared {@link collectionCore} two ports over a `Map` BACKEND (D60). Specializations\n * (D60 #3 / review #3):\n *   - TTL/LRU are node-as-opt policies (D68). Static `maxSize` / `defaultTtl` values become constant\n *     policy deps; Node-valued opts are declared deps. The graph-visible `reactiveMap.apply` node is\n *     the normal backend mutation path and emits the public delta payloads it materializes.\n *   - LAZY TTL (no background timer): expiry is checked at read (`get`/`has`) + at synchronous\n *     snapshot materialization (`toMap`/`pruneExpired`). A read/prune that deletes an expired key\n *     emits the normal delta `delete{reason:\"expired\"}` (D61). Snapshot demand uses an internal pull\n *     `snapshotPrep` node: it prunes expired entries and reads the backend once, then public\n *     `snapshot` and `delta` derive from that declared prep payload. No snapshot fn drives its own\n *     dep (D37).\n *   - delete-reason enum {expired|lru-evict|archived|explicit} on the delta (D60 #3c).\n *   - LRU `maxSize`: an over-cap `set` evicts the oldest, emitting a `delete{reason:\"lru-evict\"}`.\n *     A live-key `get`/`has` touches LRU order WITHOUT a version bump (internal, D60 #3d).\n *   - retention (score-archive, D72): `retention.maxSize` is a value-or-Node numeric policy and\n *     the static scorer selects archive victims through the normal `reactiveMap.apply` path.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepCount,\n\tdepTerminal,\n\tisTerminalComplete,\n\ttype NodeFn,\n} from \"../../ctx/types.js\";\nimport { strictCanonicalJsonBytes } from \"../../json/codec.js\";\nimport { Node } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport { registerBackendStateContributor } from \"../checkpoint.js\";\nimport { initNode, type Operator } from \"../operators.js\";\nimport {\n\tdeadlines,\n\tlruKeys,\n\tPolicyInputs,\n\ttype PolicyOpt,\n\ttype ScoredEntry,\n\tselectRetentionVictims,\n\ttrimHeadOverflow,\n} from \"../policies/collection.js\";\nimport type { ReactiveOpt, RetentionPolicy, ViewCachePolicy } from \"../policies/types.js\";\nimport { timer } from \"../sources.js\";\nimport type { MapChange } from \"./change.js\";\nimport {\n\ttype CollectionCoreOptions,\n\tlightReactiveView,\n\ttype ReactiveView,\n\tViewMemoCache,\n} from \"./core.js\";\n\nexport type ReactiveMapOpt<T> = ReactiveOpt<T>;\n\nexport interface ReactiveMapRetentionEntry<K, V> {\n\treadonly key: K;\n\treadonly value: V;\n}\n\nexport interface ReactiveMapRetentionPolicy<K, V>\n\textends RetentionPolicy<ReactiveMapRetentionEntry<K, V>> {\n\t/** Archive capacity. Unlike LRU, zero is allowed and archives every live entry. */\n\treadonly maxSize?: ReactiveMapOpt<number>;\n\t/** Higher scores are retained; lowest finite scores are archived first. */\n\tscore(entry: ReactiveMapRetentionEntry<K, V>): number;\n}\n\ninterface ResolvedRetentionPolicy<K, V> {\n\treadonly maxSize?: number;\n\tscore(entry: ReactiveMapRetentionEntry<K, V>): number;\n}\n\nexport interface ReactiveMapOptions<K = unknown, V = unknown> extends CollectionCoreOptions {\n\t/**\n\t * LRU cap as a node-as-opt policy (D68). A static number is a constant policy config; a Node must\n\t * be graph-bound and becomes a declared dep of `reactiveMap.apply`.\n\t */\n\tmaxSize?: ReactiveMapOpt<number>;\n\t/**\n\t * Default TTL in milliseconds as a node-as-opt policy (D68). Per-call `set(...,{ttl})` overrides.\n\t * Lazy expiry only; no active timer in this cut.\n\t */\n\tdefaultTtl?: ReactiveMapOpt<number>;\n\t/**\n\t * Score-based retention/archive policy (D72). The scorer is static local code; only maxSize can be\n\t * a Node-valued policy, keeping graph describe data serializable while apply owns the mutation.\n\t */\n\tretention?: ReactiveMapRetentionPolicy<K, V>;\n\t/** Static D80 memo policy for D121 light views. Eviction does not dispose returned views. */\n\tviewCache?: ViewCachePolicy;\n\t/** Injectable monotonic-ish clock for TTL (default `Date.now`). Graph-local clock = follow-up (D26). */\n\tnow?: () => number;\n}\n\nexport interface ReactiveMap<K, V> {\n\treadonly delta: Node<MapChange<K, V>>;\n\treadonly snapshot: Node<ReadonlyMap<K, V>>;\n\treadonly pullId: symbol;\n\t/** Raw entry count (O(1)); may include not-yet-pruned expired entries. Sync non-reactive read. */\n\treadonly size: number;\n\t/** Get a live value (prunes the key if expired). Sync read. */\n\tget(key: K): V | undefined;\n\t/** Live-key existence (prunes if expired). Sync read. */\n\thas(key: K): boolean;\n\t/** Current live (non-expired) entries (fresh copy). Sync non-reactive read (cold-start peek). */\n\ttoMap(): ReadonlyMap<K, V>;\n\t/**\n\t * D121 light selected-map view. `delta` forwards parent map mutations, and `snapshot` is a pull\n\t * node that materializes the currently matching live entries on demand.\n\t */\n\tselect(\n\t\tpredicate: (value: V, key: K) => boolean,\n\t): ReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>;\n\tset(key: K, value: V, opts?: { ttl?: number }): void;\n\t/** Bulk set; one delta event per entry, one snapshot-arm. No-op if empty. */\n\tsetMany(entries: Iterable<readonly [K, V]>, opts?: { ttl?: number }): void;\n\tdelete(key: K): void;\n\t/** Bulk delete; one delta per removed key. No-op if none present. */\n\tdeleteMany(keys: Iterable<K>): void;\n\tclear(): void;\n\t/** Explicitly prune expired entries; every removed key emits `delete{reason:\"expired\"}` (D61). */\n\tpruneExpired(): void;\n\t/** D54 widening: every `[key, value]` from `src` is set. Returns a disposer. */\n\tsetFrom(src: Node<readonly [K, V]>): () => void;\n\tdispose(): void;\n}\n\ninterface Entry<V> {\n\tvalue: V;\n\texpiresAt?: number;\n}\n\nfunction strictJsonIdentity(value: unknown): string {\n\treturn Array.from(strictCanonicalJsonBytes(value)).join(\",\");\n}\n\ntype Lookup<V> =\n\t| { found: true; value: V }\n\t| { found: false; expired?: false }\n\t| { found: false; expired: true; previous: V };\n\ninterface SnapshotPrep<K, V> {\n\treadonly snapshot: ReadonlyMap<K, V>;\n\treadonly expired: readonly MapChange<K, V>[];\n}\n\ntype MapIntent<K, V> =\n\t| { kind: \"set\"; key: K; value: V; ttl?: number }\n\t| { kind: \"delete\"; key: K }\n\t| { kind: \"clear\" }\n\t| { kind: \"pruneExpired\" }\n\t| { kind: \"pruneKey\"; key: K };\n\n/** Default `Map`-backed store. TTL/LRU policy lives in graph-visible policy/apply nodes (D68). */\nclass MapBackend<K, V> {\n\tprivate _version = 0;\n\tprivate readonly store = new Map<K, Entry<V>>();\n\tprivate readonly now: () => number;\n\n\tconstructor(opts: { now?: () => number }) {\n\t\tthis.now = opts.now ?? Date.now;\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\n\tget size(): number {\n\t\treturn this.store.size;\n\t}\n\n\tnowMs(): number {\n\t\treturn this.now();\n\t}\n\n\texpiresAtOf(key: K): number | undefined {\n\t\treturn this.store.get(key)?.expiresAt;\n\t}\n\n\tprivate isExpired(e: Entry<V>): boolean {\n\t\treturn e.expiresAt !== undefined && this.now() >= e.expiresAt;\n\t}\n\n\tresolveExpiresAt(ttl?: number): number | undefined {\n\t\tif (ttl === undefined) return undefined;\n\t\tif (!Number.isFinite(ttl) || ttl <= 0)\n\t\t\tthrow new RangeError(`reactiveMap: ttl must be a positive finite number (got ${ttl})`);\n\t\treturn this.now() + ttl;\n\t}\n\n\tprivate deleteExpired(key: K, e: Entry<V>): Array<[K, V]> {\n\t\tthis.store.delete(key);\n\t\tthis._version += 1;\n\t\treturn [[key, e.value]];\n\t}\n\n\t/** Read without materializing expiry. Caller routes expired deletes through the apply node (D68). */\n\tlookup(key: K): Lookup<V> {\n\t\tconst e = this.store.get(key);\n\t\tif (e === undefined) return { found: false };\n\t\tif (this.isExpired(e)) return { found: false, expired: true, previous: e.value };\n\t\t// LRU touch (no version bump — internal, D60 #3d).\n\t\tthis.store.delete(key);\n\t\tthis.store.set(key, e);\n\t\treturn { found: true, value: e.value };\n\t}\n\n\t/** Set; returns the entries evicted by LRU overflow (the caller emits their delete deltas). */\n\tset(key: K, value: V, expiresAt?: number): void {\n\t\tif (this.store.has(key)) this.store.delete(key); // re-insert at LRU end\n\t\tthis.store.set(key, { value, expiresAt });\n\t\tthis._version += 1;\n\t}\n\n\tenforceLru(maxSize?: number): Array<[K, V]> {\n\t\tconst evicted: Array<[K, V]> = [];\n\t\tfor (const oldest of trimHeadOverflow(lruKeys(this.store.keys()).keys(), {\n\t\t\tmaxSize,\n\t\t\tsize: this.store.size,\n\t\t})) {\n\t\t\tconst e = this.store.get(oldest);\n\t\t\tif (e !== undefined) evicted.push([oldest, e.value]);\n\t\t\tthis.store.delete(oldest);\n\t\t}\n\t\tif (evicted.length > 0) this._version += 1;\n\t\treturn evicted;\n\t}\n\n\tenforceRetention(policy?: ResolvedRetentionPolicy<K, V>): Array<[K, V]> {\n\t\tif (policy === undefined || policy.maxSize === undefined) return [];\n\t\tconst scored: ScoredEntry<readonly [K, V]>[] = [];\n\t\tfor (const [key, entry] of this.store) {\n\t\t\tif (!this.isExpired(entry)) {\n\t\t\t\tscored.push({\n\t\t\t\t\tentry: [key, entry.value] as const,\n\t\t\t\t\tscore: policy.score({ key, value: entry.value }),\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\tconst archived = selectRetentionVictims(scored, { maxSize: policy.maxSize });\n\t\tfor (const [key] of archived) this.store.delete(key);\n\t\tif (archived.length > 0) this._version += 1;\n\t\treturn archived.map(([key, value]) => [key, value]);\n\t}\n\n\tdelete(key: K): Lookup<V> {\n\t\tconst e = this.store.get(key);\n\t\tif (e === undefined) return { found: false };\n\t\tthis.store.delete(key);\n\t\tthis._version += 1;\n\t\treturn { found: true, value: e.value };\n\t}\n\n\tclear(): number {\n\t\tconst n = this.store.size;\n\t\tif (n === 0) return 0;\n\t\tthis.store.clear();\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\n\tpruneExpired(): Array<[K, V]> {\n\t\tconst removed: Array<[K, V]> = [];\n\t\tfor (const [k, e] of this.store) {\n\t\t\tif (this.isExpired(e)) {\n\t\t\t\tthis.store.delete(k);\n\t\t\t\tremoved.push([k, e.value]);\n\t\t\t}\n\t\t}\n\t\tif (removed.length > 0) this._version += 1;\n\t\treturn removed;\n\t}\n\n\tpruneKeyIfExpired(key: K): Array<[K, V]> {\n\t\tconst e = this.store.get(key);\n\t\tif (e === undefined || !this.isExpired(e)) return [];\n\t\treturn this.deleteExpired(key, e);\n\t}\n\n\t/** Fresh snapshot of live entries. Does not prune; callers choose whether to materialize expiry. */\n\tsnapshot(): ReadonlyMap<K, V> {\n\t\tconst out = new Map<K, V>();\n\t\tfor (const [k, e] of this.store) if (!this.isExpired(e)) out.set(k, e.value);\n\t\treturn out;\n\t}\n\n\t/** D160 checkpoint payload: exact restorable map entries, excluding TTL-bearing state. */\n\tcheckpointEntries(): readonly (readonly [K, V])[] {\n\t\tconst out: Array<readonly [K, V]> = [];\n\t\tconst seen = new Set<string>();\n\t\tfor (const [key, entry] of this.store) {\n\t\t\tif (entry.expiresAt !== undefined) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t\"reactiveMap checkpoint backendState cannot preserve per-entry TTL; persist the map externally or clear TTL state before graph checkpoint (D160)\",\n\t\t\t\t);\n\t\t\t}\n\t\t\tconst stableKey = strictJsonIdentity(key);\n\t\t\tif (seen.has(stableKey)) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t\"reactiveMap checkpoint backendState contains duplicate strict-JSON keys (D160)\",\n\t\t\t\t);\n\t\t\t}\n\t\t\tseen.add(stableKey);\n\t\t\tout.push([key, entry.value] as const);\n\t\t}\n\t\treturn out;\n\t}\n}\n\n/**\n * Create a reactive map (D54/D60). DELTA stream of {@link MapChange} + lazy pull SNAPSHOT (a\n * `ReadonlyMap`) + pullId via {@link collectionCore}; this layer adds the typed map surface.\n */\nexport function reactiveMap<K, V>(options: ReactiveMapOptions<K, V> = {}): ReactiveMap<K, V> {\n\treturn createReactiveMap(options);\n}\n\n/** @internal D161 restore path: seed the backend without replaying public deltas. */\nexport function restoreReactiveMapFromBackendState<K, V>(\n\tinitialEntries: readonly (readonly [K, V])[],\n\toptions: ReactiveMapOptions<K, V> = {},\n): ReactiveMap<K, V> {\n\treturn createReactiveMap(options, initialEntries);\n}\n\nfunction createReactiveMap<K, V>(\n\toptions: ReactiveMapOptions<K, V> = {},\n\tinitialEntries: readonly (readonly [K, V])[] = [],\n): ReactiveMap<K, V> {\n\tconst { maxSize, defaultTtl, retention, viewCache, now, name, dispatcher, graph } = options;\n\tconst backend = new MapBackend<K, V>({ now });\n\tfor (const [key, value] of initialEntries) backend.set(key, value);\n\tconst base = dispatcher ? { dispatcher } : {};\n\tconst restorable =\n\t\tgraph !== undefined &&\n\t\tname !== undefined &&\n\t\tmaxSize === undefined &&\n\t\tdefaultTtl === undefined &&\n\t\tretention === undefined;\n\n\tfunction isNodeOpt<T>(x: PolicyOpt<T> | undefined): x is Node<T> {\n\t\treturn x instanceof Node;\n\t}\n\n\tfunction validateMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 1)\n\t\t\tthrow new RangeError(`reactiveMap: maxSize must be a positive integer (got ${v})`);\n\t\treturn v;\n\t}\n\n\tfunction validateTtl(v: number): number {\n\t\tif (!Number.isFinite(v) || v <= 0)\n\t\t\tthrow new RangeError(`reactiveMap: defaultTtl must be a positive finite number (got ${v})`);\n\t\treturn v;\n\t}\n\n\tfunction validateRetentionMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 0)\n\t\t\tthrow new RangeError(\n\t\t\t\t`reactiveMap: retention.maxSize must be a non-negative integer (got ${v})`,\n\t\t\t);\n\t\treturn v;\n\t}\n\n\tif (retention !== undefined && typeof retention.score !== \"function\")\n\t\tthrow new TypeError(\"reactiveMap: retention.score must be a function\");\n\n\ttype PolicyLabel = \"lruPolicy\" | \"ttlPolicy\" | \"retentionPolicy\";\n\n\tfunction constPolicyNode(label: PolicyLabel, value: number): Node<number> {\n\t\tconst op: Operator<never, number> = {\n\t\t\tfactory: `reactiveMap.${label}`,\n\t\t\tbody: () => {},\n\t\t\topts: { initial: value },\n\t\t};\n\t\tif (graph) {\n\t\t\treturn graph.initNode(op, [], {\n\t\t\t\tname: name ? `${name}.${label}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_policy\", collection: \"reactiveMap\", policy: label },\n\t\t\t});\n\t\t}\n\t\treturn new Node<number>([], null, {\n\t\t\t...base,\n\t\t\tinitial: value,\n\t\t\tfactory: `reactiveMap.${label}`,\n\t\t\tname: name ? `${name}.${label}` : undefined,\n\t\t});\n\t}\n\n\tfunction policyNode(\n\t\tlabel: PolicyLabel,\n\t\topt: PolicyOpt<number> | undefined,\n\t\tvalidate: (v: number) => number,\n\t): Node<number> | undefined {\n\t\tif (opt === undefined) return undefined;\n\t\tif (isNodeOpt(opt)) {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`reactiveMap ${label} Node option requires options.graph so the policy edge is describe-visible (${label === \"retentionPolicy\" ? \"D72\" : \"D68\"})`,\n\t\t\t\t);\n\t\t\treturn opt;\n\t\t}\n\t\treturn constPolicyNode(label, validate(opt));\n\t}\n\n\tconst intentOp: Operator<never, MapIntent<K, V>> = {\n\t\tfactory: \"reactiveMap.intent\",\n\t\tbody: () => {},\n\t};\n\tconst intent = graph\n\t\t? graph.initNode(intentOp, [], {\n\t\t\t\tname: name ? `${name}.intent` : undefined,\n\t\t\t\tmeta: { kind: \"collection_intent\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.intent\" } } : {}),\n\t\t\t})\n\t\t: new Node<MapIntent<K, V>>([], null, {\n\t\t\t\t...base,\n\t\t\t\tfactory: \"reactiveMap.intent\",\n\t\t\t\tname: name ? `${name}.intent` : undefined,\n\t\t\t});\n\tconst lruPolicy = policyNode(\"lruPolicy\", maxSize, validateMaxSize);\n\tconst ttlPolicy = policyNode(\"ttlPolicy\", defaultTtl, validateTtl);\n\tconst retentionPolicy = policyNode(\n\t\t\"retentionPolicy\",\n\t\tretention?.maxSize,\n\t\tvalidateRetentionMaxSize,\n\t);\n\n\tlet currentMaxSize = isNodeOpt(maxSize) ? undefined : maxSize;\n\tlet currentDefaultTtl = isNodeOpt(defaultTtl) ? undefined : defaultTtl;\n\tlet currentRetentionMaxSize = isNodeOpt(retention?.maxSize)\n\t\t? undefined\n\t\t: retention?.maxSize === undefined\n\t\t\t? undefined\n\t\t\t: validateRetentionMaxSize(retention.maxSize);\n\tconst ttlHeap = deadlines<K>();\n\tlet ttlTimer: Node<unknown> | null = null;\n\tlet ttlTimerDue: number | undefined;\n\tconst bindDeps = new WeakSet<Node<unknown>>();\n\tlet bindSeq = 0;\n\tlet apply: Node<MapChange<K, V>>;\n\tconst selectMemo = new ViewMemoCache<\n\t\t(value: V, key: K) => boolean,\n\t\tReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>\n\t>(viewCache);\n\tlet selectSeq = 0;\n\n\tconst policyInputs = new PolicyInputs([intent as Node<unknown>]);\n\tconst lruReader = policyInputs.add(lruPolicy);\n\tconst ttlReader = policyInputs.add(ttlPolicy);\n\tconst retentionReader = policyInputs.add(retentionPolicy);\n\n\tfunction emitExpired(ctx: Ctx, entries: Array<[K, V]>): void {\n\t\tfor (const [key, previous] of entries)\n\t\t\tctx.down([[\"DATA\", { kind: \"delete\", key, previous, reason: \"expired\" }]]);\n\t}\n\n\tfunction emitLruEvicted(ctx: Ctx, entries: Array<[K, V]>): void {\n\t\tfor (const [key, previous] of entries)\n\t\t\tctx.down([[\"DATA\", { kind: \"delete\", key, previous, reason: \"lru-evict\" }]]);\n\t}\n\n\tfunction emitArchived(ctx: Ctx, entries: Array<[K, V]>): void {\n\t\tfor (const [key, previous] of entries)\n\t\t\tctx.down([[\"DATA\", { kind: \"delete\", key, previous, reason: \"archived\" }]]);\n\t}\n\n\tfunction nextValidExpiry(): { readonly key: K; readonly expiresAt: number } | undefined {\n\t\tfor (;;) {\n\t\t\tconst top = ttlHeap.peek();\n\t\t\tif (top === undefined) return undefined;\n\t\t\tif (backend.expiresAtOf(top.key) === top.expiresAt) return top;\n\t\t\tttlHeap.pop();\n\t\t}\n\t}\n\n\tfunction scheduleTtl(ctx: Ctx, body: NodeFn): void {\n\t\tfor (;;) {\n\t\t\tconst next = nextValidExpiry();\n\t\t\tif (next === undefined) {\n\t\t\t\tif (ttlTimer) ctx.rewireNext.unsubscribeDep(ttlTimer, body);\n\t\t\t\tttlTimer = null;\n\t\t\t\tttlTimerDue = undefined;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (next.expiresAt <= backend.nowMs()) {\n\t\t\t\temitExpired(ctx, backend.pruneExpired());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (ttlTimerDue === next.expiresAt) return;\n\t\t\tif (ttlTimer) ctx.rewireNext.unsubscribeDep(ttlTimer, body);\n\t\t\tttlTimerDue = next.expiresAt;\n\t\t\tttlTimer = initNode(timer(Math.max(0, next.expiresAt - backend.nowMs())), [], base);\n\t\t\tctx.rewireNext.subscribeDep(ttlTimer, body);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tfunction applyIntent(ctx: Ctx, intentValue: MapIntent<K, V>): void {\n\t\tif (intentValue.kind === \"set\") {\n\t\t\tconst ttl = intentValue.ttl ?? currentDefaultTtl;\n\t\t\tconst expiresAt = backend.resolveExpiresAt(ttl);\n\t\t\tbackend.set(intentValue.key, intentValue.value, expiresAt);\n\t\t\tif (expiresAt !== undefined) ttlHeap.push({ key: intentValue.key, expiresAt });\n\t\t\tctx.down([[\"DATA\", { kind: \"set\", key: intentValue.key, value: intentValue.value }]]);\n\t\t\temitLruEvicted(ctx, backend.enforceLru(currentMaxSize));\n\t\t\temitArchived(\n\t\t\t\tctx,\n\t\t\t\tbackend.enforceRetention(\n\t\t\t\t\tretention ? { maxSize: currentRetentionMaxSize, score: retention.score } : undefined,\n\t\t\t\t),\n\t\t\t);\n\t\t\treturn;\n\t\t}\n\t\tif (intentValue.kind === \"delete\") {\n\t\t\tconst previous = backend.delete(intentValue.key);\n\t\t\tif (previous.found)\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{ kind: \"delete\", key: intentValue.key, previous: previous.value, reason: \"explicit\" },\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\treturn;\n\t\t}\n\t\tif (intentValue.kind === \"clear\") {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) ctx.down([[\"DATA\", { kind: \"clear\", count }]]);\n\t\t\treturn;\n\t\t}\n\t\tif (intentValue.kind === \"pruneExpired\") {\n\t\t\temitExpired(ctx, backend.pruneExpired());\n\t\t\treturn;\n\t\t}\n\t\temitExpired(ctx, backend.pruneKeyIfExpired(intentValue.key));\n\t}\n\n\tconst applyBody: NodeFn = (ctx: Ctx) => {\n\t\tconst nextMaxSize = lruReader.read(ctx, currentMaxSize);\n\t\tcurrentMaxSize = nextMaxSize === undefined ? undefined : validateMaxSize(nextMaxSize);\n\t\tconst nextTtl = ttlReader.read(ctx, currentDefaultTtl);\n\t\tcurrentDefaultTtl = nextTtl === undefined ? undefined : validateTtl(nextTtl);\n\t\tconst nextRetentionMaxSize = retentionReader.read(ctx, currentRetentionMaxSize);\n\t\tcurrentRetentionMaxSize =\n\t\t\tnextRetentionMaxSize === undefined\n\t\t\t\t? undefined\n\t\t\t\t: validateRetentionMaxSize(nextRetentionMaxSize);\n\n\t\tfor (const item of (depBatch(ctx, 0) ?? []) as readonly MapIntent<K, V>[]) {\n\t\t\tapplyIntent(ctx, item);\n\t\t}\n\t\tconst deps = apply.deps;\n\t\tfor (let i = 1; i < depCount(ctx); i++) {\n\t\t\tif (i === lruReader.index || i === ttlReader.index || i === retentionReader.index) continue;\n\t\t\tconst dep = deps[i];\n\t\t\tif (dep && bindDeps.has(dep)) {\n\t\t\t\tfor (const item of (depBatch(ctx, i) ?? []) as readonly MapIntent<K, V>[]) {\n\t\t\t\t\tapplyIntent(ctx, item);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (\n\t\t\t\tdep === ttlTimer &&\n\t\t\t\t((depBatch(ctx, i)?.length ?? 0) > 0 || isTerminalComplete(depTerminal(ctx, i)))\n\t\t\t) {\n\t\t\t\tif (ttlTimer) ctx.rewireNext.unsubscribeDep(ttlTimer, applyBody);\n\t\t\t\tttlTimer = null;\n\t\t\t\tttlTimerDue = undefined;\n\t\t\t\temitExpired(ctx, backend.pruneExpired());\n\t\t\t}\n\t\t}\n\t\t// Lowering a reactive maxSize is itself a policy-driven backend mutation (D68).\n\t\temitLruEvicted(ctx, backend.enforceLru(currentMaxSize));\n\t\temitArchived(\n\t\t\tctx,\n\t\t\tbackend.enforceRetention(\n\t\t\t\tretention ? { maxSize: currentRetentionMaxSize, score: retention.score } : undefined,\n\t\t\t),\n\t\t);\n\t\tscheduleTtl(ctx, applyBody);\n\t};\n\n\tconst applyOp: Operator<unknown, MapChange<K, V>> = {\n\t\tfactory: \"reactiveMap.apply\",\n\t\tbody: applyBody,\n\t\topts: { partial: true },\n\t};\n\tapply = graph\n\t\t? graph.initNode(applyOp, policyInputs.deps as readonly Node<unknown>[], {\n\t\t\t\tname: name ? `${name}.apply` : undefined,\n\t\t\t\tmeta: { kind: \"collection_policy_apply\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.apply\" } } : {}),\n\t\t\t})\n\t\t: initNode(applyOp, policyInputs.deps, {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.apply` : undefined,\n\t\t\t});\n\n\tconst pullId = Symbol(name ? `${name}.snapshot` : \"reactiveMap.snapshot\");\n\tconst snapshotPrepOp: Operator<unknown, SnapshotPrep<K, V>> = {\n\t\tfactory: \"reactiveMap.snapshotPrep\",\n\t\tbody: (ctx: Ctx) => {\n\t\t\tconst expired = backend.pruneExpired().map(\n\t\t\t\t([key, previous]): MapChange<K, V> => ({\n\t\t\t\t\tkind: \"delete\",\n\t\t\t\t\tkey,\n\t\t\t\t\tprevious,\n\t\t\t\t\treason: \"expired\",\n\t\t\t\t}),\n\t\t\t);\n\t\t\tctx.down([[\"DATA\", { snapshot: backend.snapshot(), expired }]]);\n\t\t},\n\t\topts: {\n\t\t\t...base,\n\t\t\tpullId,\n\t\t\tpartial: true,\n\t\t},\n\t};\n\tconst snapshotPrep = graph\n\t\t? graph.initNode(snapshotPrepOp, [apply as Node<unknown>], {\n\t\t\t\tname: name ? `${name}.snapshotPrep` : undefined,\n\t\t\t\tmeta: { kind: \"collection_snapshot_prep\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.snapshotPrep\" } } : {}),\n\t\t\t})\n\t\t: initNode(snapshotPrepOp, [apply as Node<unknown>], {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.snapshotPrep` : undefined,\n\t\t\t});\n\tconst deltaOp: Operator<unknown, MapChange<K, V>> = {\n\t\tfactory: \"reactiveMap.delta\",\n\t\tbody: (ctx: Ctx) => {\n\t\t\tfor (const change of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", change as MapChange<K, V>]]);\n\t\t\t}\n\t\t\tfor (const prep of depBatch(ctx, 1) ?? []) {\n\t\t\t\tfor (const change of (prep as SnapshotPrep<K, V>).expired) ctx.down([[\"DATA\", change]]);\n\t\t\t}\n\t\t},\n\t\topts: { partial: true },\n\t};\n\tconst delta = graph\n\t\t? graph.initNode(deltaOp, [apply as Node<unknown>, snapshotPrep as Node<unknown>], {\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tmeta: { kind: \"collection_delta\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.delta\" } } : {}),\n\t\t\t})\n\t\t: initNode(deltaOp, [apply as Node<unknown>, snapshotPrep as Node<unknown>], {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t});\n\tconst snapshotOp: Operator<unknown, ReadonlyMap<K, V>> = {\n\t\tfactory: \"reactiveMap.snapshot\",\n\t\tbody: (ctx: Ctx) => {\n\t\t\tfor (const prep of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", (prep as SnapshotPrep<K, V>).snapshot]]);\n\t\t\t}\n\t\t},\n\t\topts: { partial: true },\n\t};\n\tconst snapshot = graph\n\t\t? graph.initNode(snapshotOp, [snapshotPrep as Node<unknown>], {\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tmeta: { kind: \"collection_snapshot\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.snapshot\" } } : {}),\n\t\t\t})\n\t\t: initNode(snapshotOp, [snapshotPrep as Node<unknown>], {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t});\n\tif (restorable) {\n\t\tregisterBackendStateContributor(intent as Node<unknown>, () => backend.checkpointEntries());\n\t}\n\tconst releaseApply = graph\n\t\t? graph.retain(apply, { reason: \"reactiveMap.apply\" })\n\t\t: apply.subscribe(() => {});\n\tconst binds: Array<() => void> = [];\n\n\tfunction doSet(key: K, value: V, ttl?: number): void {\n\t\tif (ttl !== undefined) validateTtl(ttl);\n\t\tintent.down([\n\t\t\t[\"DATA\", ttl === undefined ? { kind: \"set\", key, value } : { kind: \"set\", key, value, ttl }],\n\t\t]);\n\t}\n\n\tfunction read(key: K): Lookup<V> {\n\t\tconst r = backend.lookup(key);\n\t\tif (!r.found && r.expired) intent.down([[\"DATA\", { kind: \"pruneKey\", key }]]);\n\t\treturn r;\n\t}\n\n\tfunction selectedSnapshot(predicate: (value: V, key: K) => boolean): ReadonlyMap<K, V> {\n\t\tconst out = new Map<K, V>();\n\t\tfor (const [key, value] of backend.snapshot()) {\n\t\t\tif (predicate(value, key)) out.set(key, value);\n\t\t}\n\t\treturn out;\n\t}\n\n\tfunction select(\n\t\tpredicate: (value: V, key: K) => boolean,\n\t): ReactiveView<MapChange<K, V>, ReadonlyMap<K, V>> {\n\t\tif (typeof predicate !== \"function\")\n\t\t\tthrow new TypeError(\"reactiveMap.select: predicate must be a function\");\n\t\tconst cached = selectMemo.get(predicate);\n\t\tif (cached !== undefined) return cached;\n\t\tlet view: ReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>;\n\t\tview = lightReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>(delta as Node<unknown>, {\n\t\t\tdispatcher,\n\t\t\tgraph,\n\t\t\tfactory: \"reactiveMap.select\",\n\t\t\tname: name ? `${name}.select#${selectSeq++}` : undefined,\n\t\t\tmaterializeSnapshot: () => selectedSnapshot(predicate),\n\t\t\tonDispose: () => {\n\t\t\t\tselectMemo.deleteValue(view);\n\t\t\t},\n\t\t});\n\t\tselectMemo.set(predicate, view);\n\t\treturn view;\n\t}\n\n\treturn {\n\t\tdelta,\n\t\tsnapshot,\n\t\tpullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\tget(key: K): V | undefined {\n\t\t\tconst r = read(key);\n\t\t\treturn r.found ? r.value : undefined;\n\t\t},\n\t\thas(key: K): boolean {\n\t\t\treturn read(key).found;\n\t\t},\n\t\ttoMap(): ReadonlyMap<K, V> {\n\t\t\tintent.down([[\"DATA\", { kind: \"pruneExpired\" }]]);\n\t\t\treturn backend.snapshot();\n\t\t},\n\t\tselect,\n\n\t\tset(key: K, value: V, opts?: { ttl?: number }): void {\n\t\t\tdoSet(key, value, opts?.ttl);\n\t\t},\n\t\tsetMany(entries: Iterable<readonly [K, V]>, opts?: { ttl?: number }): void {\n\t\t\tfor (const [k, v] of entries) doSet(k, v, opts?.ttl);\n\t\t},\n\t\tdelete(key: K): void {\n\t\t\tintent.down([[\"DATA\", { kind: \"delete\", key }]]);\n\t\t},\n\t\tdeleteMany(keys: Iterable<K>): void {\n\t\t\tfor (const k of keys) {\n\t\t\t\tintent.down([[\"DATA\", { kind: \"delete\", key: k }]]);\n\t\t\t}\n\t\t},\n\t\tclear(): void {\n\t\t\tintent.down([[\"DATA\", { kind: \"clear\" }]]);\n\t\t},\n\t\tpruneExpired(): void {\n\t\t\tintent.down([[\"DATA\", { kind: \"pruneExpired\" }]]);\n\t\t},\n\n\t\tsetFrom(src: Node<readonly [K, V]>): () => void {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"reactiveMap.setFrom requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t\t);\n\t\t\tconst op: Operator<readonly [K, V], MapIntent<K, V>> = {\n\t\t\t\tfactory: \"reactiveMap.bindSource\",\n\t\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfor (const [k, v] of (depBatch(ctx, 0) ?? []) as readonly (readonly [K, V])[]) {\n\t\t\t\t\t\t\tctx.down([[\"DATA\", { kind: \"set\", key: k, value: v }]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"reactiveMap.bindSource failed\")]]);\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst folder = graph.initNode(op, [src], {\n\t\t\t\tname: name ? `${name}.bind#${bindSeq++}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_bind_source\", collection: \"reactiveMap\" },\n\t\t\t});\n\t\t\tbindDeps.add(folder as Node<unknown>);\n\t\t\tapply.subscribeDep(folder as Node<unknown>, applyBody);\n\t\t\tlet active = true;\n\t\t\tconst dispose = () => {\n\t\t\t\tif (!active) return;\n\t\t\t\tactive = false;\n\t\t\t\tapply.unsubscribeDep(folder as Node<unknown>, applyBody);\n\t\t\t};\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tselectMemo.disposeAll();\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\treleaseApply();\n\t\t},\n\t};\n}\n","import type {\n\tIndexRow,\n\tReactiveIndex,\n\tReactiveIndexOptions,\n} from \"../graph/data-structures/reactive-index.js\";\nimport { restoreReactiveIndexFromBackendState } from \"../graph/data-structures/reactive-index.js\";\nimport type { ReactiveListOptions } from \"../graph/data-structures/reactive-list.js\";\nimport { type ReactiveList, reactiveList } from \"../graph/data-structures/reactive-list.js\";\nimport type { ReactiveLogOptions } from \"../graph/data-structures/reactive-log.js\";\nimport { type ReactiveLog, reactiveLog } from \"../graph/data-structures/reactive-log.js\";\nimport type { ReactiveMap, ReactiveMapOptions } from \"../graph/data-structures/reactive-map.js\";\nimport { restoreReactiveMapFromBackendState } from \"../graph/data-structures/reactive-map.js\";\nimport type {\n\tReactiveIndexRestoreState,\n\tReactiveListRestoreState,\n\tReactiveLogRestoreState,\n\tReactiveMapRestoreState,\n} from \"../storage/index.js\";\n\nfunction isListRestoreState<T>(\n\tstate: ReactiveListRestoreState<T> | readonly T[],\n): state is ReactiveListRestoreState<T> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreListValues<T>(state: ReactiveListRestoreState<T> | readonly T[]): readonly T[] {\n\tif (!isListRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveList\") throw new TypeError(\"restore state kind must be reactiveList\");\n\treturn state.state;\n}\n\nfunction isLogRestoreState<T>(\n\tstate: ReactiveLogRestoreState<T> | readonly T[],\n): state is ReactiveLogRestoreState<T> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreLogValues<T>(state: ReactiveLogRestoreState<T> | readonly T[]): readonly T[] {\n\tif (!isLogRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveLog\") throw new TypeError(\"restore state kind must be reactiveLog\");\n\treturn state.state;\n}\n\nfunction isMapRestoreState<K, V>(\n\tstate: ReactiveMapRestoreState<K, V> | readonly (readonly [K, V])[],\n): state is ReactiveMapRestoreState<K, V> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreMapEntries<K, V>(\n\tstate: ReactiveMapRestoreState<K, V> | readonly (readonly [K, V])[],\n): readonly (readonly [K, V])[] {\n\tif (!isMapRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveMap\") throw new TypeError(\"restore state kind must be reactiveMap\");\n\treturn state.state;\n}\n\nfunction isIndexRestoreState<K, V>(\n\tstate: ReactiveIndexRestoreState<K, V> | readonly IndexRow<K, V>[],\n): state is ReactiveIndexRestoreState<K, V> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreIndexRows<K, V>(\n\tstate: ReactiveIndexRestoreState<K, V> | readonly IndexRow<K, V>[],\n): readonly IndexRow<K, V>[] {\n\tif (!isIndexRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveIndex\") {\n\t\tthrow new TypeError(\"restore state kind must be reactiveIndex\");\n\t}\n\treturn state.state;\n}\n\n/** D161 synchronous collection-owned restore. This helper never reads storage. */\nexport function restoreReactiveList<T = unknown>(\n\tstate: ReactiveListRestoreState<T> | readonly T[],\n\toptions: ReactiveListOptions = {},\n): ReactiveList<T> {\n\tconst values = restoreListValues(state);\n\treturn reactiveList<T>(values, options);\n}\n\n/** D161 synchronous collection-owned restore. This helper never reads storage. */\nexport function restoreReactiveLog<T = unknown>(\n\tstate: ReactiveLogRestoreState<T> | readonly T[],\n\toptions: ReactiveLogOptions = {},\n): ReactiveLog<T> {\n\tconst values = restoreLogValues(state);\n\treturn reactiveLog<T>(values, options);\n}\n\n/** D161 synchronous collection-owned restore for map entries; policy config still comes from options. */\nexport function restoreReactiveMap<K = unknown, V = unknown>(\n\tstate: ReactiveMapRestoreState<K, V> | readonly (readonly [K, V])[],\n\toptions: ReactiveMapOptions<K, V> = {},\n): ReactiveMap<K, V> {\n\tconst entries = restoreMapEntries(state);\n\treturn restoreReactiveMapFromBackendState<K, V>(entries, options);\n}\n\n/** D161 synchronous collection-owned restore for sorted index rows; key-codec I/O stays outside. */\nexport function restoreReactiveIndex<K = unknown, V = unknown>(\n\tstate: ReactiveIndexRestoreState<K, V> | readonly IndexRow<K, V>[],\n\toptions: ReactiveIndexOptions = {},\n): ReactiveIndex<K, V> {\n\tconst rows = restoreIndexRows(state);\n\treturn restoreReactiveIndexFromBackendState<K, V>(rows, options);\n}\n","import type {\n\tIndexChange,\n\tListChange,\n\tLogChange,\n\tMapChange,\n} from \"../graph/data-structures/change.js\";\nimport type { IndexRow } from \"../graph/data-structures/reactive-index.js\";\nimport { strictCanonicalJsonBytes, strictJsonCodecFor } from \"../json/codec.js\";\nimport type { AppendLogStorageTier } from \"./append-log.js\";\nimport type { Codec } from \"./codec.js\";\nimport type { KvStorageTier } from \"./kv.js\";\n\n/** D161 strict-JSON snapshot frame format tag for reactive collection persistence. */\nexport const REACTIVE_COLLECTION_SNAPSHOT_FORMAT =\n\t\"graphrefly.reactive-collection.snapshot.v1\" as const;\n/** D161 strict-JSON change frame format tag for reactive collection persistence. */\nexport const REACTIVE_COLLECTION_CHANGE_FORMAT =\n\t\"graphrefly.reactive-collection.change.v1\" as const;\n/** D161 v1 frame version for reactive collection snapshot/change storage. */\nexport const REACTIVE_COLLECTION_FRAME_VERSION = 1 as const;\n\n/** D161 collection kinds recognized by the unified persistence frame envelope. */\nexport type ReactiveCollectionStorageKind =\n\t| \"reactiveList\"\n\t| \"reactiveLog\"\n\t| \"reactiveMap\"\n\t| \"reactiveIndex\";\n\n/** D161 durable baseline frame; storage is passive and does not own graph restore. */\nexport interface ReactiveCollectionSnapshotFrame<\n\tK extends ReactiveCollectionStorageKind = ReactiveCollectionStorageKind,\n\tS = unknown,\n> {\n\treadonly format: typeof REACTIVE_COLLECTION_SNAPSHOT_FORMAT;\n\treadonly version: typeof REACTIVE_COLLECTION_FRAME_VERSION;\n\treadonly kind: K;\n\t/** Last append-log seq reflected by this snapshot; -1 means no change-log entry. */\n\treadonly changeCursor: number;\n\treadonly snapshot: S;\n}\n\n/** D161 append-log change frame; change-log replay is collection-state folding, not graph restore. */\nexport interface ReactiveCollectionChangeFrame<\n\tK extends ReactiveCollectionStorageKind = ReactiveCollectionStorageKind,\n\tC = unknown,\n> {\n\treadonly format: typeof REACTIVE_COLLECTION_CHANGE_FORMAT;\n\treadonly version: typeof REACTIVE_COLLECTION_FRAME_VERSION;\n\treadonly kind: K;\n\treadonly change: C;\n}\n\n/** D161 passive load/fold result consumed by synchronous restoreReactive* helpers. */\nexport interface ReactiveCollectionRestoreState<\n\tK extends ReactiveCollectionStorageKind = ReactiveCollectionStorageKind,\n\tS = unknown,\n> {\n\treadonly kind: K;\n\treadonly state: S;\n\treadonly source: \"empty\" | \"changes\" | \"snapshot\" | \"snapshot+changes\";\n\treadonly snapshot: { readonly found: boolean; readonly changeCursor: number };\n\treadonly changes: { readonly applied: number; readonly cursor: number };\n}\n\n/** D161 restore state for a reactiveList materialized as a strict-JSON array snapshot. */\nexport type ReactiveListRestoreState<T = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveList\",\n\treadonly T[]\n>;\n\n/** D161 restore state for a reactiveLog materialized as a strict-JSON array snapshot. */\nexport type ReactiveLogRestoreState<T = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveLog\",\n\treadonly T[]\n>;\n\n/** D161 passive restore-state shape for reactiveMap; policy-aware restore remains deferred. */\nexport type ReactiveMapRestoreState<K = unknown, V = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveMap\",\n\treadonly (readonly [K, V])[]\n>;\n\n/** D161 passive restore-state shape for reactiveIndex; key-codec restore remains deferred. */\nexport type ReactiveIndexRestoreState<K = unknown, V = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveIndex\",\n\treadonly IndexRow<K, V>[]\n>;\n\n/** D161 passive storage inputs for collection load/fold helpers. */\nexport interface LoadReactiveCollectionStateOptions {\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction ownKeys(value: Record<string, unknown>): readonly string[] {\n\treturn Object.keys(value).sort();\n}\n\nfunction assertKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = ownKeys(value);\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected frame fields ${actual.join(\",\")}`);\n\t}\n}\n\nfunction assertSafeInteger(value: unknown, label: string, min = 0): number {\n\tif (!Number.isSafeInteger(value) || (value as number) < min) {\n\t\tthrow new TypeError(`${label} must be a safe integer >= ${min}`);\n\t}\n\treturn value as number;\n}\n\nfunction assertKind<K extends ReactiveCollectionStorageKind>(\n\tvalue: unknown,\n\texpected: K,\n\tlabel: string,\n): K {\n\tif (value !== expected) throw new TypeError(`${label}: kind must be ${expected}`);\n\treturn expected;\n}\n\nfunction assertArray<T = unknown>(value: unknown, label: string): readonly T[] {\n\tif (!Array.isArray(value)) throw new TypeError(`${label}: snapshot must be an array`);\n\treturn value as readonly T[];\n}\n\nfunction strictJsonIdentity(value: unknown): string {\n\treturn Array.from(strictCanonicalJsonBytes(value)).join(\",\");\n}\n\nfunction assertEntryArray<K = unknown, V = unknown>(\n\tvalue: unknown,\n\tlabel: string,\n): readonly (readonly [K, V])[] {\n\tconst entries = assertArray<unknown>(value, label);\n\tconst seen = new Set<string>();\n\tfor (const [i, entry] of entries.entries()) {\n\t\tif (!Array.isArray(entry) || entry.length !== 2) {\n\t\t\tthrow new TypeError(`${label}: entry ${i} must be [key,value]`);\n\t\t}\n\t\tconst key = strictJsonIdentity(entry[0]);\n\t\tif (seen.has(key)) throw new TypeError(`${label}: entry ${i} duplicates an earlier key`);\n\t\tseen.add(key);\n\t}\n\treturn entries as readonly (readonly [K, V])[];\n}\n\nfunction assertIndexRows<K = unknown, V = unknown>(\n\tvalue: unknown,\n\tlabel: string,\n): readonly IndexRow<K, V>[] {\n\tconst rows = assertArray<unknown>(value, label);\n\tconst seen = new Set<string>();\n\tfor (const [i, row] of rows.entries()) {\n\t\tif (!isRecord(row)) throw new TypeError(`${label}: row ${i} must be an object`);\n\t\tassertKeys(row, [\"primary\", \"secondary\", \"value\"], `${label} row`);\n\t\tconst primary = strictJsonIdentity(row.primary);\n\t\tif (seen.has(primary)) {\n\t\t\tthrow new TypeError(`${label}: row ${i} duplicates an earlier primary`);\n\t\t}\n\t\tseen.add(primary);\n\t}\n\treturn rows as readonly IndexRow<K, V>[];\n}\n\n/** Build the default D161 snapshot key for a storage prefix. */\nexport function collectionSnapshotKey(storagePrefix = \"reactive-collection\"): string {\n\tif (storagePrefix.length === 0) throw new TypeError(\"storagePrefix must be non-empty\");\n\treturn `${storagePrefix}/snapshot`;\n}\n\n/** Build a D161 strict-JSON snapshot frame before validation/encoding. */\nexport function reactiveCollectionSnapshotFrame<K extends ReactiveCollectionStorageKind, S>(\n\tkind: K,\n\tsnapshot: S,\n\topts: { readonly changeCursor?: number } = {},\n): ReactiveCollectionSnapshotFrame<K, S> {\n\tconst changeCursor = opts.changeCursor ?? -1;\n\tif (!Number.isSafeInteger(changeCursor) || changeCursor < -1) {\n\t\tthrow new RangeError(\"reactive collection snapshot changeCursor must be a safe integer >= -1\");\n\t}\n\treturn {\n\t\tformat: REACTIVE_COLLECTION_SNAPSHOT_FORMAT,\n\t\tversion: REACTIVE_COLLECTION_FRAME_VERSION,\n\t\tkind,\n\t\tchangeCursor,\n\t\tsnapshot,\n\t};\n}\n\n/** Build a D161 strict-JSON change frame before validation/encoding. */\nexport function reactiveCollectionChangeFrame<K extends ReactiveCollectionStorageKind, C>(\n\tkind: K,\n\tchange: C,\n): ReactiveCollectionChangeFrame<K, C> {\n\treturn {\n\t\tformat: REACTIVE_COLLECTION_CHANGE_FORMAT,\n\t\tversion: REACTIVE_COLLECTION_FRAME_VERSION,\n\t\tkind,\n\t\tchange,\n\t};\n}\n\n/** Validate a D161 snapshot frame and reject non-strict-JSON payloads honestly. */\nexport function assertReactiveCollectionSnapshotFrame<\n\tK extends ReactiveCollectionStorageKind,\n\tS = unknown,\n>(value: unknown, expectedKind: K): ReactiveCollectionSnapshotFrame<K, S> {\n\tif (!isRecord(value)) throw new TypeError(\"reactive collection snapshot frame must be an object\");\n\tassertKeys(value, [\"changeCursor\", \"format\", \"kind\", \"snapshot\", \"version\"], \"snapshot frame\");\n\tif (value.format !== REACTIVE_COLLECTION_SNAPSHOT_FORMAT) {\n\t\tthrow new TypeError(\"snapshot frame: invalid format\");\n\t}\n\tif (value.version !== REACTIVE_COLLECTION_FRAME_VERSION) {\n\t\tthrow new TypeError(\"snapshot frame: invalid version\");\n\t}\n\tassertKind(value.kind, expectedKind, \"snapshot frame\");\n\tassertSafeInteger(value.changeCursor, \"snapshot frame changeCursor\", -1);\n\tstrictJsonCodecFor<unknown>().encode(value);\n\treturn value as unknown as ReactiveCollectionSnapshotFrame<K, S>;\n}\n\n/** Validate a D161 change frame and reject non-strict-JSON payloads honestly. */\nexport function assertReactiveCollectionChangeFrame<\n\tK extends ReactiveCollectionStorageKind,\n\tC = unknown,\n>(value: unknown, expectedKind: K): ReactiveCollectionChangeFrame<K, C> {\n\tif (!isRecord(value)) throw new TypeError(\"reactive collection change frame must be an object\");\n\tassertKeys(value, [\"change\", \"format\", \"kind\", \"version\"], \"change frame\");\n\tif (value.format !== REACTIVE_COLLECTION_CHANGE_FORMAT) {\n\t\tthrow new TypeError(\"change frame: invalid format\");\n\t}\n\tif (value.version !== REACTIVE_COLLECTION_FRAME_VERSION) {\n\t\tthrow new TypeError(\"change frame: invalid version\");\n\t}\n\tassertKind(value.kind, expectedKind, \"change frame\");\n\tif (!Object.hasOwn(value, \"change\")) throw new TypeError(\"change frame: change is required\");\n\tstrictJsonCodecFor<unknown>().encode(value);\n\treturn value as unknown as ReactiveCollectionChangeFrame<K, C>;\n}\n\n/** Codec for D161 snapshot frames with strict JSON validation on both encode and decode. */\nexport function reactiveCollectionSnapshotFrameCodec<\n\tK extends ReactiveCollectionStorageKind,\n\tS = unknown,\n>(kind: K): Codec<ReactiveCollectionSnapshotFrame<K, S>> {\n\tconst codec = strictJsonCodecFor<unknown>();\n\treturn {\n\t\tencode(value) {\n\t\t\treturn codec.encode(assertReactiveCollectionSnapshotFrame<K, S>(value, kind));\n\t\t},\n\t\tdecode(bytes) {\n\t\t\treturn assertReactiveCollectionSnapshotFrame<K, S>(codec.decode(bytes), kind);\n\t\t},\n\t};\n}\n\n/** Codec for D161 change frames with strict JSON validation on both encode and decode. */\nexport function reactiveCollectionChangeFrameCodec<\n\tK extends ReactiveCollectionStorageKind,\n\tC = unknown,\n>(kind: K): Codec<ReactiveCollectionChangeFrame<K, C>> {\n\tconst codec = strictJsonCodecFor<unknown>();\n\treturn {\n\t\tencode(value) {\n\t\t\treturn codec.encode(assertReactiveCollectionChangeFrame<K, C>(value, kind));\n\t\t},\n\t\tdecode(bytes) {\n\t\t\treturn assertReactiveCollectionChangeFrame<K, C>(codec.decode(bytes), kind);\n\t\t},\n\t};\n}\n\nfunction assertListChange<T>(value: unknown): ListChange<T> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveList change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"append\":\n\t\t\tif (!Object.hasOwn(value, \"value\")) throw new TypeError(\"reactiveList append.value required\");\n\t\t\tassertKeys(value, [\"kind\", \"value\"], \"reactiveList append\");\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"appendMany\":\n\t\t\tassertKeys(value, [\"kind\", \"values\"], \"reactiveList appendMany\");\n\t\t\tassertArray<T>(value.values, \"reactiveList appendMany.values\");\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"insert\":\n\t\t\tassertKeys(value, [\"index\", \"kind\", \"value\"], \"reactiveList insert\");\n\t\t\tassertSafeInteger(value.index, \"reactiveList insert.index\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"insertMany\":\n\t\t\tassertKeys(value, [\"index\", \"kind\", \"values\"], \"reactiveList insertMany\");\n\t\t\tassertSafeInteger(value.index, \"reactiveList insertMany.index\", 0);\n\t\t\tassertArray<T>(value.values, \"reactiveList insertMany.values\");\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"pop\":\n\t\t\tassertKeys(value, [\"index\", \"kind\", \"value\"], \"reactiveList pop\");\n\t\t\tassertSafeInteger(value.index, \"reactiveList pop.index\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"trimHead\":\n\t\t\tassertKeys(value, [\"kind\", \"n\"], \"reactiveList trimHead\");\n\t\t\tassertSafeInteger(value.n, \"reactiveList trimHead.n\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveList clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveList clear.count\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveList change kind ${value.kind}`);\n\t}\n}\n\nfunction assertLogChange<T>(value: unknown): LogChange<T> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveLog change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"append\":\n\t\t\tif (!Object.hasOwn(value, \"value\")) throw new TypeError(\"reactiveLog append.value required\");\n\t\t\tassertKeys(value, [\"kind\", \"value\"], \"reactiveLog append\");\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tcase \"appendMany\":\n\t\t\tassertKeys(value, [\"kind\", \"values\"], \"reactiveLog appendMany\");\n\t\t\tassertArray<T>(value.values, \"reactiveLog appendMany.values\");\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tcase \"trimHead\":\n\t\t\tassertKeys(value, [\"kind\", \"n\"], \"reactiveLog trimHead\");\n\t\t\tassertSafeInteger(value.n, \"reactiveLog trimHead.n\", 0);\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveLog clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveLog clear.count\", 0);\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveLog change kind ${value.kind}`);\n\t}\n}\n\nfunction assertMapChange<K, V>(value: unknown): MapChange<K, V> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveMap change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"set\":\n\t\t\tif (!Object.hasOwn(value, \"key\")) throw new TypeError(\"reactiveMap set.key required\");\n\t\t\tif (!Object.hasOwn(value, \"value\")) throw new TypeError(\"reactiveMap set.value required\");\n\t\t\tassertKeys(value, [\"key\", \"kind\", \"value\"], \"reactiveMap set\");\n\t\t\treturn value as unknown as MapChange<K, V>;\n\t\tcase \"delete\":\n\t\t\tif (!Object.hasOwn(value, \"key\")) throw new TypeError(\"reactiveMap delete.key required\");\n\t\t\tif (!Object.hasOwn(value, \"previous\")) {\n\t\t\t\tthrow new TypeError(\"reactiveMap delete.previous required\");\n\t\t\t}\n\t\t\tassertKeys(value, [\"key\", \"kind\", \"previous\", \"reason\"], \"reactiveMap delete\");\n\t\t\tif (\n\t\t\t\tvalue.reason !== \"expired\" &&\n\t\t\t\tvalue.reason !== \"lru-evict\" &&\n\t\t\t\tvalue.reason !== \"archived\" &&\n\t\t\t\tvalue.reason !== \"explicit\"\n\t\t\t) {\n\t\t\t\tthrow new TypeError(\"reactiveMap delete.reason is invalid\");\n\t\t\t}\n\t\t\treturn value as unknown as MapChange<K, V>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveMap clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveMap clear.count\", 0);\n\t\t\treturn value as unknown as MapChange<K, V>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveMap change kind ${value.kind}`);\n\t}\n}\n\nfunction assertIndexChange<K, V>(value: unknown): IndexChange<K, V> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveIndex change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"upsert\":\n\t\t\tif (!Object.hasOwn(value, \"primary\")) {\n\t\t\t\tthrow new TypeError(\"reactiveIndex upsert.primary required\");\n\t\t\t}\n\t\t\tif (!Object.hasOwn(value, \"secondary\")) {\n\t\t\t\tthrow new TypeError(\"reactiveIndex upsert.secondary required\");\n\t\t\t}\n\t\t\tif (!Object.hasOwn(value, \"value\"))\n\t\t\t\tthrow new TypeError(\"reactiveIndex upsert.value required\");\n\t\t\tassertKeys(value, [\"kind\", \"primary\", \"secondary\", \"value\"], \"reactiveIndex upsert\");\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tcase \"delete\":\n\t\t\tif (!Object.hasOwn(value, \"primary\")) {\n\t\t\t\tthrow new TypeError(\"reactiveIndex delete.primary required\");\n\t\t\t}\n\t\t\tassertKeys(value, [\"kind\", \"primary\"], \"reactiveIndex delete\");\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tcase \"deleteMany\":\n\t\t\tassertKeys(value, [\"kind\", \"primaries\"], \"reactiveIndex deleteMany\");\n\t\t\tassertArray<K>(value.primaries, \"reactiveIndex deleteMany.primaries\");\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveIndex clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveIndex clear.count\", 0);\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveIndex change kind ${value.kind}`);\n\t}\n}\n\nfunction applyListChange<T>(state: T[], change: ListChange<T>): void {\n\tswitch (change.kind) {\n\t\tcase \"append\":\n\t\t\tstate.push(change.value);\n\t\t\treturn;\n\t\tcase \"appendMany\":\n\t\t\tstate.push(...change.values);\n\t\t\treturn;\n\t\tcase \"insert\":\n\t\t\tif (change.index > state.length)\n\t\t\t\tthrow new Error(\"reactiveList insert change is out of range\");\n\t\t\tstate.splice(change.index, 0, change.value);\n\t\t\treturn;\n\t\tcase \"insertMany\":\n\t\t\tif (change.index > state.length) {\n\t\t\t\tthrow new Error(\"reactiveList insertMany change is out of range\");\n\t\t\t}\n\t\t\tstate.splice(change.index, 0, ...change.values);\n\t\t\treturn;\n\t\tcase \"pop\":\n\t\t\tif (change.index >= state.length) throw new Error(\"reactiveList pop change is out of range\");\n\t\t\tif (!strictJsonEquals(state[change.index], change.value)) {\n\t\t\t\tthrow new Error(\"reactiveList pop change value does not match current state\");\n\t\t\t}\n\t\t\tstate.splice(change.index, 1);\n\t\t\treturn;\n\t\tcase \"trimHead\":\n\t\t\tif (change.n > state.length) throw new Error(\"reactiveList trimHead change is out of range\");\n\t\t\tstate.splice(0, change.n);\n\t\t\treturn;\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveList clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction strictJsonEquals(a: unknown, b: unknown): boolean {\n\tconst left = strictCanonicalJsonBytes(a);\n\tconst right = strictCanonicalJsonBytes(b);\n\tif (left.byteLength !== right.byteLength) return false;\n\tfor (let i = 0; i < left.byteLength; i += 1) if (left[i] !== right[i]) return false;\n\treturn true;\n}\n\nfunction findJsonIndex<T>(\n\tvalues: readonly T[],\n\tmatch: (value: T) => unknown,\n\tkey: unknown,\n\tlabel: string,\n): number {\n\tlet found = -1;\n\tfor (let i = 0; i < values.length; i += 1) {\n\t\tif (strictJsonEquals(match(values[i] as T), key)) {\n\t\t\tif (found !== -1) throw new Error(`${label} duplicate JSON key in restore state`);\n\t\t\tfound = i;\n\t\t}\n\t}\n\treturn found;\n}\n\nfunction cmpOrd(a: unknown, b: unknown): number {\n\tif (a === b) return 0;\n\tconst ta = typeof a;\n\tif (\n\t\tta === typeof b &&\n\t\t(ta === \"number\" || ta === \"string\" || ta === \"boolean\" || ta === \"bigint\")\n\t) {\n\t\tconst ax = a as number | string | bigint | boolean;\n\t\tconst bx = b as number | string | bigint | boolean;\n\t\treturn ax < bx ? -1 : ax > bx ? 1 : 0;\n\t}\n\treturn String(a).localeCompare(String(b));\n}\n\nfunction applyLogChange<T>(state: T[], change: LogChange<T>): void {\n\tswitch (change.kind) {\n\t\tcase \"append\":\n\t\t\tstate.push(change.value);\n\t\t\treturn;\n\t\tcase \"appendMany\":\n\t\t\tstate.push(...change.values);\n\t\t\treturn;\n\t\tcase \"trimHead\":\n\t\t\tif (change.n > state.length) throw new Error(\"reactiveLog trimHead change is out of range\");\n\t\t\tstate.splice(0, change.n);\n\t\t\treturn;\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveLog clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction applyMapChange<K, V>(state: Array<readonly [K, V]>, change: MapChange<K, V>): void {\n\tswitch (change.kind) {\n\t\tcase \"set\": {\n\t\t\tconst index = findJsonIndex(state, ([key]) => key, change.key, \"reactiveMap\");\n\t\t\tif (index === -1) state.push([change.key, change.value] as const);\n\t\t\telse state[index] = [change.key, change.value] as const;\n\t\t\treturn;\n\t\t}\n\t\tcase \"delete\": {\n\t\t\tconst index = findJsonIndex(state, ([key]) => key, change.key, \"reactiveMap\");\n\t\t\tif (index === -1) throw new Error(\"reactiveMap delete change key is missing\");\n\t\t\tif (!strictJsonEquals(state[index]?.[1], change.previous)) {\n\t\t\t\tthrow new Error(\"reactiveMap delete change previous value does not match current state\");\n\t\t\t}\n\t\t\tstate.splice(index, 1);\n\t\t\treturn;\n\t\t}\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveMap clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction sortIndexRows<K, V>(state: Array<IndexRow<K, V>>): void {\n\tstate.sort((a, b) => {\n\t\tconst bySecondary = cmpOrd(a.secondary, b.secondary);\n\t\treturn bySecondary === 0 ? cmpOrd(a.primary, b.primary) : bySecondary;\n\t});\n}\n\nfunction applyIndexChange<K, V>(state: Array<IndexRow<K, V>>, change: IndexChange<K, V>): void {\n\tswitch (change.kind) {\n\t\tcase \"upsert\": {\n\t\t\tconst index = findJsonIndex(state, (row) => row.primary, change.primary, \"reactiveIndex\");\n\t\t\tconst row: IndexRow<K, V> = {\n\t\t\t\tprimary: change.primary,\n\t\t\t\tsecondary: change.secondary,\n\t\t\t\tvalue: change.value,\n\t\t\t};\n\t\t\tif (index === -1) state.push(row);\n\t\t\telse state[index] = row;\n\t\t\tsortIndexRows(state);\n\t\t\treturn;\n\t\t}\n\t\tcase \"delete\": {\n\t\t\tconst index = findJsonIndex(state, (row) => row.primary, change.primary, \"reactiveIndex\");\n\t\t\tif (index === -1) throw new Error(\"reactiveIndex delete change primary is missing\");\n\t\t\tstate.splice(index, 1);\n\t\t\treturn;\n\t\t}\n\t\tcase \"deleteMany\": {\n\t\t\tfor (const primary of change.primaries) {\n\t\t\t\tconst index = findJsonIndex(state, (row) => row.primary, primary, \"reactiveIndex\");\n\t\t\t\tif (index === -1) {\n\t\t\t\t\tthrow new Error(\"reactiveIndex deleteMany change primary is missing\");\n\t\t\t\t}\n\t\t\t\tstate.splice(index, 1);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveIndex clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction finishState<K extends ReactiveCollectionStorageKind, T>(\n\tkind: K,\n\tstate: T[],\n\tsnapshotFound: boolean,\n\tsnapshotCursor: number,\n\tapplied: number,\n\tcursor: number,\n): ReactiveCollectionRestoreState<K, readonly T[]> {\n\treturn {\n\t\tkind,\n\t\tstate,\n\t\tsource: snapshotFound\n\t\t\t? applied > 0\n\t\t\t\t? \"snapshot+changes\"\n\t\t\t\t: \"snapshot\"\n\t\t\t: applied > 0\n\t\t\t\t? \"changes\"\n\t\t\t\t: \"empty\",\n\t\tsnapshot: { found: snapshotFound, changeCursor: snapshotCursor },\n\t\tchanges: { applied, cursor },\n\t};\n}\n\nfunction loadState<K extends ReactiveCollectionStorageKind, T, C>(\n\tkind: K,\n\topts: LoadReactiveCollectionStateOptions,\n\tassertSnapshot: (value: unknown) => readonly T[],\n\tassertChange: (value: unknown) => C,\n\tapplyChange: (state: T[], change: C) => void,\n): Promise<ReactiveCollectionRestoreState<K, readonly T[]>> {\n\tconst key = opts.snapshotKey ?? collectionSnapshotKey(opts.storagePrefix);\n\treturn opts.snapshotStore.get(key).then((snapshotValue) => {\n\t\tlet snapshotFound = false;\n\t\tlet snapshotCursor = -1;\n\t\tlet state: T[] = [];\n\n\t\tif (snapshotValue !== undefined) {\n\t\t\tconst frame = assertReactiveCollectionSnapshotFrame<K, readonly T[]>(snapshotValue, kind);\n\t\t\tstate = [...assertSnapshot(frame.snapshot)];\n\t\t\tsnapshotFound = true;\n\t\t\tsnapshotCursor = frame.changeCursor;\n\t\t}\n\n\t\tif (opts.changeLog === undefined) {\n\t\t\treturn finishState(kind, state, snapshotFound, snapshotCursor, 0, snapshotCursor);\n\t\t}\n\n\t\treturn opts.changeLog.read({ after: snapshotCursor }).then((entries) => {\n\t\t\tlet applied = 0;\n\t\t\tlet cursor = snapshotCursor;\n\t\t\tfor (const entry of entries) {\n\t\t\t\tconst expectedSeq = cursor + 1;\n\t\t\t\tif (!Number.isSafeInteger(entry.seq) || entry.seq !== expectedSeq) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t`reactive collection change log is non-contiguous: expected seq ${expectedSeq}, got ${entry.seq}`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tconst frame = assertReactiveCollectionChangeFrame<K, C>(entry.value, kind);\n\t\t\t\tconst change = assertChange(frame.change);\n\t\t\t\tapplyChange(state, change);\n\t\t\t\tapplied += 1;\n\t\t\t\tcursor = entry.seq;\n\t\t\t}\n\t\t\treturn finishState(kind, state, snapshotFound, snapshotCursor, applied, cursor);\n\t\t});\n\t});\n}\n\n/** D161 passive load/fold for reactiveList; reads storage but never mutates graph topology. */\nexport function loadReactiveListState<T = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveListRestoreState<T>> {\n\treturn loadState<\"reactiveList\", T, ListChange<T>>(\n\t\t\"reactiveList\",\n\t\topts,\n\t\t(value) => assertArray<T>(value, \"reactiveList snapshot\"),\n\t\tassertListChange,\n\t\tapplyListChange,\n\t);\n}\n\n/** D161 passive load/fold for reactiveLog; reads storage but never mutates graph topology. */\nexport function loadReactiveLogState<T = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveLogRestoreState<T>> {\n\treturn loadState<\"reactiveLog\", T, LogChange<T>>(\n\t\t\"reactiveLog\",\n\t\topts,\n\t\t(value) => assertArray<T>(value, \"reactiveLog snapshot\"),\n\t\tassertLogChange,\n\t\tapplyLogChange,\n\t);\n}\n\n/** D161 passive load/fold scaffold for reactiveMap; synchronous policy restore is deferred. */\nexport function loadReactiveMapState<K = unknown, V = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveMapRestoreState<K, V>> {\n\treturn loadState<\"reactiveMap\", readonly [K, V], MapChange<K, V>>(\n\t\t\"reactiveMap\",\n\t\topts,\n\t\t(value) => assertEntryArray<K, V>(value, \"reactiveMap snapshot\"),\n\t\tassertMapChange,\n\t\tapplyMapChange,\n\t);\n}\n\n/** D161 passive load/fold scaffold for reactiveIndex; key-codec restore is deferred. */\nexport function loadReactiveIndexState<K = unknown, V = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveIndexRestoreState<K, V>> {\n\treturn loadState<\"reactiveIndex\", IndexRow<K, V>, IndexChange<K, V>>(\n\t\t\"reactiveIndex\",\n\t\topts,\n\t\t(value) => assertIndexRows<K, V>(value, \"reactiveIndex snapshot\"),\n\t\tassertIndexChange,\n\t\tapplyIndexChange,\n\t);\n}\n","import type { DeliveryMeta } from \"../ctx/types.js\";\nimport {\n\ttype ReactiveIndex,\n\ttype ReactiveIndexOptions,\n\ttype ReactiveList,\n\ttype ReactiveListOptions,\n\ttype ReactiveLog,\n\ttype ReactiveLogOptions,\n\ttype ReactiveMap,\n\ttype ReactiveMapOptions,\n\trestoreReactiveIndex,\n\trestoreReactiveList,\n\trestoreReactiveLog,\n\trestoreReactiveMap,\n} from \"../data-structures/index.js\";\nimport type {\n\tIndexChange,\n\tListChange,\n\tLogChange,\n\tMapChange,\n} from \"../graph/data-structures/change.js\";\nimport type { IndexRow } from \"../graph/data-structures/reactive-index.js\";\nimport { assertGraphLocalNode, type Graph, type StateNode } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport type {\n\tAppendLogEntry,\n\tAppendLogStorageTier,\n\tKvStorageTier,\n\tLoadReactiveCollectionStateOptions,\n\tReactiveCollectionChangeFrame,\n\tReactiveCollectionSnapshotFrame,\n\tReactiveIndexRestoreState,\n\tReactiveListRestoreState,\n\tReactiveLogRestoreState,\n\tReactiveMapRestoreState,\n} from \"../storage/index.js\";\nimport {\n\tassertReactiveCollectionChangeFrame,\n\tassertReactiveCollectionSnapshotFrame,\n\tcollectionSnapshotKey,\n\tloadReactiveIndexState,\n\tloadReactiveListState,\n\tloadReactiveLogState,\n\tloadReactiveMapState,\n\treactiveCollectionChangeFrame,\n\treactiveCollectionSnapshotFrame,\n} from \"../storage/index.js\";\n\ntype PersistableKind = \"reactiveList\" | \"reactiveLog\" | \"reactiveMap\" | \"reactiveIndex\";\ntype PersistableChange<T, K extends PersistableKind> = K extends \"reactiveList\"\n\t? ListChange<T>\n\t: K extends \"reactiveLog\"\n\t\t? LogChange<T>\n\t\t: K extends \"reactiveMap\"\n\t\t\t? MapChange<unknown, T>\n\t\t\t: IndexChange<unknown, T>;\ntype PersistableCollection<T, K extends PersistableKind> = K extends \"reactiveList\"\n\t? ReactiveList<T>\n\t: K extends \"reactiveLog\"\n\t\t? ReactiveLog<T>\n\t\t: K extends \"reactiveMap\"\n\t\t\t? ReactiveMap<unknown, T>\n\t\t\t: ReactiveIndex<unknown, T>;\n\n/** D161 adapter write-progress cursor; this is not a domain replay or wire-bridge cursor. */\nexport interface ReactiveCollectionPersistenceCursor {\n\treadonly kind: \"persistence.cursor\";\n\treadonly collection: PersistableKind;\n\treadonly changeSeq: number;\n\treadonly snapshotWrites: number;\n\treadonly changeWrites: number;\n}\n\n/** D161 graph-visible persistence sidecar status fact. */\nexport interface ReactiveCollectionPersistenceStatus {\n\treadonly state: \"starting\" | \"ready\" | \"flushing\" | \"errored\" | \"disposed\";\n\treadonly pending: number;\n\treadonly writes: number;\n\treadonly errors: number;\n\treadonly cursor: ReactiveCollectionPersistenceCursor;\n}\n\n/** D161 graph-visible persistence sidecar error fact. */\nexport interface ReactiveCollectionPersistenceError {\n\treadonly phase: \"snapshot\" | \"change\";\n\treadonly message: string;\n\treadonly cursor: ReactiveCollectionPersistenceCursor;\n}\n\n/** Options for the D161 graph-bound persistence sidecar over a reactive collection. */\nexport interface PersistReactiveCollectionOptions<K extends PersistableKind = PersistableKind> {\n\treadonly kind: K;\n\treadonly name?: string;\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n\t/** Adapter write cursor seed for wrappers that already folded a change log. */\n\treadonly initialChangeCursor?: number;\n\t/** Default true: write one durable baseline when the adapter attaches. */\n\treadonly snapshotOnAttach?: boolean;\n\t/** Optional snapshot cadence. Manual snapshots remain available via handle.snapshot(). */\n\treadonly snapshotEveryChanges?: number;\n}\n\n/** D161 sidecar controls; flush waits for queued storage promises to settle, not fsync. */\nexport interface ReactiveCollectionPersistenceHandle {\n\treadonly ready: StateNode<boolean>;\n\treadonly status: StateNode<ReactiveCollectionPersistenceStatus>;\n\treadonly error: StateNode<ReactiveCollectionPersistenceError | null>;\n\treadonly cursor: StateNode<ReactiveCollectionPersistenceCursor>;\n\tflush(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n\tsnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n\tdispose(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n}\n\ninterface QueueItem {\n\treadonly phase: \"snapshot\" | \"change\" | \"flush\" | \"dispose\";\n\treadonly done?: (status: ReactiveCollectionPersistenceStatus) => void;\n\trun(): void | PromiseLike<void>;\n}\n\nfunction emptyCursor(collection: PersistableKind): ReactiveCollectionPersistenceCursor {\n\treturn {\n\t\tkind: \"persistence.cursor\",\n\t\tcollection,\n\t\tchangeSeq: -1,\n\t\tsnapshotWrites: 0,\n\t\tchangeWrites: 0,\n\t};\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n\nfunction validateSnapshotEveryChanges(value: number | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tif (!Number.isSafeInteger(value) || value < 1) {\n\t\tthrow new RangeError(\"snapshotEveryChanges must be a positive safe integer\");\n\t}\n\treturn value;\n}\n\nfunction validateInitialChangeCursor(value: number | undefined): number {\n\tif (value === undefined) return -1;\n\tif (!Number.isSafeInteger(value) || value < -1) {\n\t\tthrow new RangeError(\"initialChangeCursor must be a safe integer >= -1\");\n\t}\n\treturn value;\n}\n\nfunction statusOf(\n\tstate: ReactiveCollectionPersistenceStatus[\"state\"],\n\tpending: number,\n\twrites: number,\n\terrors: number,\n\tcursor: ReactiveCollectionPersistenceCursor,\n): ReactiveCollectionPersistenceStatus {\n\treturn { state, pending, writes, errors, cursor };\n}\n\nfunction dataOf<C>(msg: Message): C | undefined {\n\treturn msg[0] === \"DATA\" ? (msg[1] as C) : undefined;\n}\n\n/**\n * D161 graph-bound sidecar over an existing collection. It writes passive storage frames and\n * exposes adapter progress as graph-visible DATA facts; it never restores or mutates the collection.\n */\nexport function persistReactiveCollection<T, K extends PersistableKind>(\n\tgraph: Graph,\n\tcollection: PersistableCollection<T, K>,\n\topts: PersistReactiveCollectionOptions<K>,\n): ReactiveCollectionPersistenceHandle {\n\tconst kind = opts.kind;\n\tconst name = opts.name ?? `${kind}.persistence`;\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(opts.storagePrefix ?? name);\n\tconst snapshotEveryChanges = validateSnapshotEveryChanges(opts.snapshotEveryChanges);\n\tassertGraphLocalNode(graph, collection.delta as Node<unknown>, `${name}.collection.delta`);\n\tassertGraphLocalNode(graph, collection.snapshot as Node<unknown>, `${name}.collection.snapshot`);\n\n\tlet cursorValue = {\n\t\t...emptyCursor(kind),\n\t\tchangeSeq: validateInitialChangeCursor(opts.initialChangeCursor),\n\t};\n\tlet statusValue = statusOf(\"starting\", 0, 0, 0, cursorValue);\n\tlet errorCount = 0;\n\tlet writes = 0;\n\tlet observedChangesSinceSnapshot = 0;\n\tlet running = false;\n\tlet disposed = false;\n\tlet disposeRequested = false;\n\tlet subscribing = true;\n\tlet stop: (() => void) | undefined;\n\tconst queue: QueueItem[] = [];\n\n\tconst ready = graph.state(false, { name: `${name}/ready` });\n\tconst status = graph.state<ReactiveCollectionPersistenceStatus>(statusValue, {\n\t\tname: `${name}/status`,\n\t});\n\tconst error = graph.state<ReactiveCollectionPersistenceError | null>(null, {\n\t\tname: `${name}/error`,\n\t});\n\tconst cursor = graph.state<ReactiveCollectionPersistenceCursor>(cursorValue, {\n\t\tname: `${name}/cursor`,\n\t});\n\n\tfunction publish(state: ReactiveCollectionPersistenceStatus[\"state\"]): void {\n\t\tconst nextState = statusValue.state === \"errored\" && state !== \"disposed\" ? \"errored\" : state;\n\t\tstatusValue = statusOf(\n\t\t\tnextState,\n\t\t\tqueue.length + (running ? 1 : 0),\n\t\t\twrites,\n\t\t\terrorCount,\n\t\t\tcursorValue,\n\t\t);\n\t\tcursor.set(cursorValue);\n\t\tstatus.set(statusValue);\n\t\tif (nextState === \"ready\") ready.set(true);\n\t\tif (nextState === \"errored\" || nextState === \"disposed\") ready.set(false);\n\t}\n\n\tfunction report(phase: \"snapshot\" | \"change\", caught: unknown): void {\n\t\terrorCount += 1;\n\t\tconst fact = { phase, message: errorMessage(caught), cursor: cursorValue };\n\t\terror.set(fact);\n\t}\n\n\tfunction callDone(done: QueueItem[\"done\"]): void {\n\t\ttry {\n\t\t\tdone?.(statusValue);\n\t\t} catch {\n\t\t\t// Done callbacks are advisory barriers; user code must not wedge the adapter queue.\n\t\t}\n\t}\n\n\tfunction finish(item: QueueItem): void {\n\t\tif (item.phase === \"dispose\") {\n\t\t\tdisposed = true;\n\t\t\trunning = false;\n\t\t\tpublish(\"disposed\");\n\t\t} else if (statusValue.state !== \"errored\") {\n\t\t\trunning = false;\n\t\t\tpublish(\"ready\");\n\t\t} else {\n\t\t\trunning = false;\n\t\t\tpublish(\"errored\");\n\t\t}\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction fail(item: QueueItem, caught: unknown): void {\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") report(item.phase, caught);\n\t\trunning = false;\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") publish(\"errored\");\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction chainThenable(item: QueueItem, value: unknown): boolean {\n\t\tif ((typeof value !== \"object\" && typeof value !== \"function\") || value === null) return false;\n\t\tlet then: unknown;\n\t\ttry {\n\t\t\tthen = (value as { then?: unknown }).then;\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn true;\n\t\t}\n\t\tif (typeof then !== \"function\") return false;\n\t\tlet settled = false;\n\t\tconst settle = (next: () => void) => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tnext();\n\t\t};\n\t\ttry {\n\t\t\t(then as (onFulfilled: () => void, onRejected: (error: unknown) => void) => unknown).call(\n\t\t\t\tvalue,\n\t\t\t\t() => settle(() => finish(item)),\n\t\t\t\t(caught) => settle(() => fail(item, caught)),\n\t\t\t);\n\t\t} catch (caught) {\n\t\t\tsettle(() => fail(item, caught));\n\t\t}\n\t\treturn true;\n\t}\n\n\tfunction enqueue(item: QueueItem): void {\n\t\tif (disposed || (disposeRequested && item.phase !== \"dispose\" && item.phase !== \"flush\")) {\n\t\t\tcallDone(item.done);\n\t\t\treturn;\n\t\t}\n\t\tqueue.push(item);\n\t\tdrain();\n\t}\n\n\tfunction drain(): void {\n\t\tif (running) return;\n\t\tconst item = queue.shift();\n\t\tif (item === undefined) return;\n\t\trunning = true;\n\t\tpublish(\n\t\t\titem.phase === \"flush\" ? \"flushing\" : statusValue.state === \"starting\" ? \"starting\" : \"ready\",\n\t\t);\n\t\tlet result: void | PromiseLike<void>;\n\t\ttry {\n\t\t\tresult = item.run();\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn;\n\t\t}\n\t\tif (chainThenable(item, result)) return;\n\t\tfinish(item);\n\t}\n\n\tfunction enqueueSnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\tconst snapshot = collectionSnapshot(collection, kind);\n\t\tobservedChangesSinceSnapshot = 0;\n\t\tenqueue({\n\t\t\tphase: \"snapshot\",\n\t\t\tdone,\n\t\t\trun() {\n\t\t\t\tconst frame: ReactiveCollectionSnapshotFrame<K, readonly unknown[]> =\n\t\t\t\t\treactiveCollectionSnapshotFrame(kind, snapshot, {\n\t\t\t\t\t\tchangeCursor: cursorValue.changeSeq,\n\t\t\t\t\t});\n\t\t\t\tassertReactiveCollectionSnapshotFrame(frame, kind);\n\t\t\t\treturn opts.snapshotStore.set(snapshotKey, frame).then(() => {\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tsnapshotWrites: cursorValue.snapshotWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction enqueueChange(change: PersistableChange<T, K>): void {\n\t\tconst changeLog = opts.changeLog;\n\t\tif (changeLog === undefined) return;\n\t\tenqueue({\n\t\t\tphase: \"change\",\n\t\t\trun() {\n\t\t\t\tconst frame: ReactiveCollectionChangeFrame<\n\t\t\t\t\tPersistableKind,\n\t\t\t\t\tPersistableChange<T, K>\n\t\t\t\t> = reactiveCollectionChangeFrame(kind, change);\n\t\t\t\tassertReactiveCollectionChangeFrame(frame, kind);\n\t\t\t\treturn changeLog.append(frame).then((written) => {\n\t\t\t\t\tconst entry = written as AppendLogEntry<\n\t\t\t\t\t\tReactiveCollectionChangeFrame<PersistableKind, PersistableChange<T, K>>\n\t\t\t\t\t>;\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tchangeSeq: entry.seq,\n\t\t\t\t\t\tchangeWrites: cursorValue.changeWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction cancelQueuedForDispose(): void {\n\t\tconst pending = queue.splice(0);\n\t\tfor (const item of pending) callDone(item.done);\n\t}\n\n\tstop = (collection.delta as Node<PersistableChange<T, K>>).subscribe(\n\t\t(msg: Message, delivery?: DeliveryMeta) => {\n\t\t\tif (disposeRequested) return;\n\t\t\tconst change = dataOf<PersistableChange<T, K>>(msg);\n\t\t\tif (change === undefined) return;\n\t\t\tif (subscribing && delivery === undefined) return;\n\t\t\tobservedChangesSinceSnapshot += 1;\n\t\t\tenqueueChange(change);\n\t\t\tif (\n\t\t\t\tsnapshotEveryChanges !== undefined &&\n\t\t\t\tobservedChangesSinceSnapshot >= snapshotEveryChanges\n\t\t\t) {\n\t\t\t\tenqueueSnapshot();\n\t\t\t}\n\t\t},\n\t);\n\tsubscribing = false;\n\n\tif (opts.snapshotOnAttach !== false) enqueueSnapshot();\n\telse publish(\"ready\");\n\n\treturn {\n\t\tready,\n\t\tstatus,\n\t\terror,\n\t\tcursor,\n\t\tflush(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueue({ phase: \"flush\", done, run: () => undefined });\n\t\t},\n\t\tsnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed || disposeRequested) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueueSnapshot(done);\n\t\t},\n\t\tdispose(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdisposeRequested = true;\n\t\t\tstop?.();\n\t\t\tcancelQueuedForDispose();\n\t\t\tenqueue({ phase: \"dispose\", done, run: () => undefined });\n\t\t},\n\t};\n}\n\nfunction collectionSnapshot<T, K extends PersistableKind>(\n\tcollection: PersistableCollection<T, K>,\n\tkind: K,\n): readonly unknown[] {\n\tif (kind === \"reactiveMap\") {\n\t\treturn [...(collection as ReactiveMap<unknown, unknown>).toMap()];\n\t}\n\tif (kind === \"reactiveIndex\") {\n\t\treturn (collection as ReactiveIndex<unknown, unknown>).toArray();\n\t}\n\treturn (collection as ReactiveList<T> | ReactiveLog<T>).toArray();\n}\n\ntype CollectionOptionsWithoutGraphName<T> = Omit<T, \"graph\" | \"name\">;\n\n/** Options for D161 load -> restore -> persist composition for reactiveList. */\nexport interface OpenPersistentReactiveListOptions<T>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveList\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly T[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveListOptions>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveLog. */\nexport interface OpenPersistentReactiveLogOptions<T>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveLog\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly T[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveLogOptions>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveMap. */\nexport interface OpenPersistentReactiveMapOptions<K, V>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveMap\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly (readonly [K, V])[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveMapOptions<K, V>>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveIndex. */\nexport interface OpenPersistentReactiveIndexOptions<K, V>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveIndex\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly IndexRow<K, V>[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveIndexOptions>;\n}\n\n/** Return value for D161 persistent reactiveList composition. */\nexport interface PersistentReactiveList<T> {\n\treadonly collection: ReactiveList<T>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveListRestoreState<T>;\n}\n\n/** Return value for D161 persistent reactiveLog composition. */\nexport interface PersistentReactiveLog<T> {\n\treadonly collection: ReactiveLog<T>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveLogRestoreState<T>;\n}\n\n/** Return value for D161 persistent reactiveMap composition. */\nexport interface PersistentReactiveMap<K, V> {\n\treadonly collection: ReactiveMap<K, V>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveMapRestoreState<K, V>;\n}\n\n/** Return value for D161 persistent reactiveIndex composition. */\nexport interface PersistentReactiveIndex<K, V> {\n\treadonly collection: ReactiveIndex<K, V>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveIndexRestoreState<K, V>;\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveList, then sidecar persist. */\nexport function openPersistentReactiveList<T = unknown>(\n\topts: OpenPersistentReactiveListOptions<T>,\n): Promise<PersistentReactiveList<T>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveListState<T>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveList<T>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<T, \"reactiveList\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveList\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveLog, then sidecar persist. */\nexport function openPersistentReactiveLog<T = unknown>(\n\topts: OpenPersistentReactiveLogOptions<T>,\n): Promise<PersistentReactiveLog<T>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveLogState<T>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveLog<T>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<T, \"reactiveLog\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveLog\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveMap, then sidecar persist. */\nexport function openPersistentReactiveMap<K = unknown, V = unknown>(\n\topts: OpenPersistentReactiveMapOptions<K, V>,\n): Promise<PersistentReactiveMap<K, V>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveMapState<K, V>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveMap<K, V>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<V, \"reactiveMap\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveMap\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveIndex, then sidecar persist. */\nexport function openPersistentReactiveIndex<K = unknown, V = unknown>(\n\topts: OpenPersistentReactiveIndexOptions<K, V>,\n): Promise<PersistentReactiveIndex<K, V>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveIndexState<K, V>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveIndex<K, V>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<V, \"reactiveIndex\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveIndex\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n","/**\n * Framework-neutral store adapters.\n *\n * Focused framework bindings build on this tiny Node-facing layer without\n * importing framework packages into the dependency-free adapters barrel\n * (D125/D238).\n */\n\nimport type { DeliveryMeta, Sink } from \"../ctx/types.js\";\nimport type { Node } from \"../node/node.js\";\n\n/** A minimal readable store contract shared by Svelte/Nanostores-style adapters. */\nexport interface ReadableStore<T> {\n\tget(): T | undefined;\n\tsubscribe(run: (value: T | undefined) => void): () => void;\n}\n\n/** A minimal writable store contract over a clean-slate writable node. */\nexport interface WritableStore<T> extends ReadableStore<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\n/** React `useSyncExternalStore`-compatible shape, without importing React. */\nexport interface ExternalStore<T> {\n\tgetSnapshot(): T | undefined;\n\tgetServerSnapshot(): T | undefined;\n\tsubscribe(onStoreChange: () => void): () => void;\n}\n\n/** Object-of-nodes factory used by record subscription adapters. */\nexport type NodeRecordFactory<K extends string, R extends Record<string, unknown>> = (key: K) => {\n\t[P in keyof R]: Node<R[P]>;\n};\n\n/** Zustand-compatible store API over a caller-owned clean-slate state node. */\nexport interface ZustandStoreApi<T extends object> {\n\tgetState(): T;\n\tsetState(partial: T | Partial<T> | ((state: T) => T | Partial<T>), replace?: boolean): void;\n\tgetInitialState(): T;\n\tsubscribe(listener: (state: T, prevState: T) => void): () => void;\n\tdestroy(): void;\n}\n\n/** Jotai-style atom facade over a caller-owned node. */\nexport interface JotaiAtom<T> {\n\tget(): T | undefined;\n\tsubscribe(callback: (value: T | undefined) => void): () => void;\n\treadonly _node: Node<T>;\n}\n\n/** Writable Jotai-style atom facade over a caller-owned writable node. */\nexport interface WritableJotaiAtom<T> extends JotaiAtom<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\n/** Nanostores-style atom facade over a caller-owned node. */\nexport interface NanoAtom<T> {\n\tget(): T | undefined;\n\tsubscribe(callback: (value: T | undefined) => void): () => void;\n\tlisten(callback: (value: T | undefined) => void): () => void;\n\treadonly _node: Node<T>;\n}\n\n/** Writable Nanostores-style atom facade over a caller-owned writable node. */\nexport interface WritableNanoAtom<T> extends NanoAtom<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\n/** TC39-Signals-style facade over a caller-owned node. */\nexport interface SignalLike<T> {\n\tget(): T | undefined;\n\tsubscribe(callback: (value: T | undefined) => void): () => void;\n\treadonly _node: Node<T>;\n}\n\n/** Writable TC39-Signals-style facade over a caller-owned writable node. */\nexport interface WritableSignalLike<T> extends SignalLike<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\nexport interface SubscribeValuesOptions<T> {\n\t/** Emit the current cache snapshot immediately. `undefined` means SENTINEL/no DATA. */\n\timmediate?: boolean;\n\t/** Suppress synchronous push-on-subscribe/replay DATA. Useful for change-only store listeners. */\n\tchangesOnly?: boolean;\n\tonError?: (error: unknown) => void;\n\tonComplete?: () => void;\n\t/** Custom cache reader for wrappers that keep their own snapshot object. */\n\tgetSnapshot?: () => T | undefined;\n}\n\nexport interface WritableNode<T> extends Node<T> {\n\tset(value: T): void;\n}\n\nexport interface WritableStoreOptions<T> extends SubscribeValuesOptions<T> {\n\t/** Override writes for adapters that need a framework-owned reducer. */\n\twrite?: (node: WritableNode<T>, value: T) => void;\n}\n\n/** Read a node cache without activating it. */\nexport function nodeSnapshot<T>(node: Node<T>): T | undefined {\n\treturn node.cache as T | undefined;\n}\n\n/**\n * Subscribe to DATA values from a Node. Protocol internals stay below the adapter boundary:\n * DATA drives value listeners, ERROR/COMPLETE route to optional lifecycle callbacks.\n */\nexport function subscribeNodeValues<T>(\n\tnode: Node<T>,\n\trun: (value: T | undefined) => void,\n\topts: SubscribeValuesOptions<T> = {},\n): () => void {\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\tif (opts.immediate) run(read());\n\n\tlet subscribing = true;\n\tconst skipSynchronousHandshakeData = opts.changesOnly || opts.immediate;\n\tconst sink: Sink = (msg, delivery?: DeliveryMeta) => {\n\t\tswitch (msg[0]) {\n\t\t\tcase \"DATA\":\n\t\t\t\tif (skipSynchronousHandshakeData && subscribing && delivery === undefined) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\trun(msg[1] as T);\n\t\t\t\treturn;\n\t\t\tcase \"ERROR\":\n\t\t\t\topts.onError?.(msg[1]);\n\t\t\t\treturn;\n\t\t\tcase \"COMPLETE\":\n\t\t\t\topts.onComplete?.();\n\t\t\t\treturn;\n\t\t}\n\t};\n\tconst unsubscribe = node.subscribe(sink);\n\tsubscribing = false;\n\treturn unsubscribe;\n}\n\n/** Build a Svelte/Nanostores-style readable store from a clean-slate Node. */\nexport function readableStore<T>(\n\tnode: Node<T>,\n\topts: SubscribeValuesOptions<T> = {},\n): ReadableStore<T> {\n\treturn {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (run) => subscribeNodeValues(node, run, { immediate: true, ...opts }),\n\t};\n}\n\nfunction hasWritableSet<T>(node: Node<T>): node is WritableNode<T> {\n\treturn typeof (node as { set?: unknown }).set === \"function\";\n}\n\nfunction defaultWrite<T>(node: WritableNode<T>, value: T): void {\n\tnode.set(value);\n}\n\n/** Build a writable store over a StateNode or compatible clean-slate writable Node. */\nexport function writableStore<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableStore<T>;\nexport function writableStore<T>(\n\tnode: Node<T>,\n\topts: WritableStoreOptions<T> & { write: (node: WritableNode<T>, value: T) => void },\n): WritableStore<T>;\nexport function writableStore<T>(\n\tnode: Node<T>,\n\topts: WritableStoreOptions<T> = {},\n): WritableStore<T> {\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\tconst write = opts.write ?? (hasWritableSet(node) ? defaultWrite : undefined);\n\tif (!write) {\n\t\tthrow new TypeError(\"writableStore: node must expose set(value) or opts.write\");\n\t}\n\tconst writable = node as WritableNode<T>;\n\treturn {\n\t\tget: read,\n\t\tsubscribe: (run) => subscribeNodeValues(node, run, { immediate: true, ...opts }),\n\t\tset: (value) => write(writable, value),\n\t\tupdate: (fn) => write(writable, fn(read())),\n\t};\n}\n\n/** Build the tiny shape React's `useSyncExternalStore` expects, without importing React. */\nexport function externalStore<T>(\n\tnode: Node<T>,\n\topts: Pick<SubscribeValuesOptions<T>, \"getSnapshot\" | \"onError\" | \"onComplete\"> = {},\n): ExternalStore<T> {\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\treturn {\n\t\tgetSnapshot: read,\n\t\tgetServerSnapshot: read,\n\t\tsubscribe: (onStoreChange) =>\n\t\t\tsubscribeNodeValues(node, () => onStoreChange(), {\n\t\t\t\tchangesOnly: true,\n\t\t\t\tonError: opts.onError,\n\t\t\t\tonComplete: opts.onComplete,\n\t\t\t}),\n\t};\n}\n\n/** Build a framework-neutral keyed record store for focused framework record bindings. */\nexport function recordReadableStore<K extends string, R extends Record<string, unknown>>(\n\tkeysNode: Node<readonly K[]>,\n\tfactory: NodeRecordFactory<K, R>,\n\topts: SubscribeValuesOptions<Record<K, R>> = {},\n): ReadableStore<Record<K, R>> {\n\tconst read = () => {\n\t\tconst keys = keysNode.cache ?? [];\n\t\tconst out = {} as Record<K, R>;\n\t\tfor (const key of keys) {\n\t\t\tconst nodes = factory(key);\n\t\t\tconst values = {} as R;\n\t\t\tfor (const field of Object.keys(nodes) as Array<keyof R>) {\n\t\t\t\tvalues[field] = nodes[field].cache as R[keyof R];\n\t\t\t}\n\t\t\tout[key] = values;\n\t\t}\n\t\treturn out;\n\t};\n\n\treturn {\n\t\tget: read,\n\t\tsubscribe(run) {\n\t\t\tconst entryUnsubs: Array<() => void> = [];\n\t\t\tconst cleanupEntries = () => {\n\t\t\t\tfor (const unsub of entryUnsubs.splice(0)) unsub();\n\t\t\t};\n\t\t\tconst sync = () => {\n\t\t\t\tcleanupEntries();\n\t\t\t\tfor (const key of keysNode.cache ?? []) {\n\t\t\t\t\tconst nodes = factory(key);\n\t\t\t\t\tfor (const field of Object.keys(nodes) as Array<keyof R>) {\n\t\t\t\t\t\tentryUnsubs.push(\n\t\t\t\t\t\t\tsubscribeNodeValues(nodes[field], () => run(read()), {\n\t\t\t\t\t\t\t\tchangesOnly: true,\n\t\t\t\t\t\t\t\tonError: opts.onError,\n\t\t\t\t\t\t\t\tonComplete: opts.onComplete,\n\t\t\t\t\t\t\t}),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trun(read());\n\t\t\t};\n\t\t\tconst keysUnsub = subscribeNodeValues(keysNode, sync, {\n\t\t\t\tchangesOnly: true,\n\t\t\t\tonError: opts.onError,\n\t\t\t\tonComplete: opts.onComplete,\n\t\t\t});\n\t\t\tsync();\n\t\t\treturn () => {\n\t\t\t\tkeysUnsub();\n\t\t\t\tcleanupEntries();\n\t\t\t};\n\t\t},\n\t};\n}\n\n/** Build a Zustand-compatible StoreApi over a caller-owned clean-slate state node. */\nexport function zustandStore<T extends object>(\n\tnode: WritableNode<T>,\n\tinitialState?: T,\n\topts?: WritableStoreOptions<T>,\n): ZustandStoreApi<T>;\nexport function zustandStore<T extends object>(\n\tnode: Node<T>,\n\tinitialState: T | undefined,\n\topts: WritableStoreOptions<T> & { write: (node: WritableNode<T>, value: T) => void },\n): ZustandStoreApi<T>;\nexport function zustandStore<T extends object>(\n\tnode: Node<T>,\n\tinitialState: T = nodeSnapshot(node) as T,\n\topts: WritableStoreOptions<T> = {},\n): ZustandStoreApi<T> {\n\tconst listeners = new Set<() => void>();\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\tconst write = opts.write ?? (hasWritableSet(node) ? defaultWrite : undefined);\n\tif (!write) {\n\t\tthrow new TypeError(\"zustandStore: node must expose set(value) or opts.write\");\n\t}\n\tconst writable = node as WritableNode<T>;\n\tconst api: ZustandStoreApi<T> = {\n\t\tgetState: () => read() as T,\n\t\tsetState(partial, replace) {\n\t\t\tconst prev = api.getState();\n\t\t\tconst next = typeof partial === \"function\" ? partial(prev) : partial;\n\t\t\twrite(writable, replace ? (next as T) : ({ ...prev, ...next } as T));\n\t\t},\n\t\tgetInitialState: () => initialState,\n\t\tsubscribe(listener) {\n\t\t\tlet prev = api.getState();\n\t\t\tconst unsub = subscribeNodeValues(\n\t\t\t\tnode,\n\t\t\t\t(value) => {\n\t\t\t\t\tconst next = value as T;\n\t\t\t\t\tlistener(next, prev);\n\t\t\t\t\tprev = next;\n\t\t\t\t},\n\t\t\t\t{ changesOnly: true, onError: opts.onError, onComplete: opts.onComplete },\n\t\t\t);\n\t\t\tlisteners.add(unsub);\n\t\t\treturn () => {\n\t\t\t\tif (!listeners.delete(unsub)) return;\n\t\t\t\tunsub();\n\t\t\t};\n\t\t},\n\t\tdestroy() {\n\t\t\tfor (const unsub of [...listeners]) {\n\t\t\t\tlisteners.delete(unsub);\n\t\t\t\tunsub();\n\t\t\t}\n\t\t},\n\t};\n\treturn api;\n}\n\n/** Build a Jotai-style atom facade over a caller-owned node. */\nexport function jotaiAtom<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableJotaiAtom<T>;\nexport function jotaiAtom<T>(node: Node<T>, opts?: SubscribeValuesOptions<T>): JotaiAtom<T>;\nexport function jotaiAtom<T>(\n\tnode: Node<T> | WritableNode<T>,\n\topts: SubscribeValuesOptions<T> | WritableStoreOptions<T> = {},\n): JotaiAtom<T> | WritableJotaiAtom<T> {\n\tconst base: JotaiAtom<T> = {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (callback) => subscribeNodeValues(node, callback, { changesOnly: true, ...opts }),\n\t\t_node: node,\n\t};\n\tif (hasWritableSet(node) || typeof (opts as WritableStoreOptions<T>).write === \"function\") {\n\t\tconst writable = writableStore(\n\t\t\tnode,\n\t\t\topts as WritableStoreOptions<T> & {\n\t\t\t\twrite: (node: WritableNode<T>, value: T) => void;\n\t\t\t},\n\t\t);\n\t\treturn { ...base, set: writable.set, update: writable.update };\n\t}\n\treturn base;\n}\n\n/** Build a Nanostores-style atom facade over a caller-owned node. */\nexport function nanoAtom<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableNanoAtom<T>;\nexport function nanoAtom<T>(node: Node<T>, opts?: SubscribeValuesOptions<T>): NanoAtom<T>;\nexport function nanoAtom<T>(\n\tnode: Node<T> | WritableNode<T>,\n\topts: SubscribeValuesOptions<T> | WritableStoreOptions<T> = {},\n): NanoAtom<T> | WritableNanoAtom<T> {\n\tconst base: NanoAtom<T> = {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (callback) => subscribeNodeValues(node, callback, { immediate: true, ...opts }),\n\t\tlisten: (callback) => subscribeNodeValues(node, callback, { changesOnly: true, ...opts }),\n\t\t_node: node,\n\t};\n\tif (hasWritableSet(node) || typeof (opts as WritableStoreOptions<T>).write === \"function\") {\n\t\tconst writable = writableStore(\n\t\t\tnode,\n\t\t\topts as WritableStoreOptions<T> & {\n\t\t\t\twrite: (node: WritableNode<T>, value: T) => void;\n\t\t\t},\n\t\t);\n\t\treturn { ...base, set: writable.set, update: writable.update };\n\t}\n\treturn base;\n}\n\n/** Build a TC39-Signals-style facade over a caller-owned node. */\nexport function signalFromNode<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableSignalLike<T>;\nexport function signalFromNode<T>(node: Node<T>, opts?: SubscribeValuesOptions<T>): SignalLike<T>;\nexport function signalFromNode<T>(\n\tnode: Node<T> | WritableNode<T>,\n\topts: SubscribeValuesOptions<T> | WritableStoreOptions<T> = {},\n): SignalLike<T> | WritableSignalLike<T> {\n\tconst base: SignalLike<T> = {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (callback) => subscribeNodeValues(node, callback, { changesOnly: true, ...opts }),\n\t\t_node: node,\n\t};\n\tif (hasWritableSet(node) || typeof (opts as WritableStoreOptions<T>).write === \"function\") {\n\t\tconst writable = writableStore(\n\t\t\tnode,\n\t\t\topts as WritableStoreOptions<T> & {\n\t\t\t\twrite: (node: WritableNode<T>, value: T) => void;\n\t\t\t},\n\t\t);\n\t\treturn { ...base, set: writable.set, update: writable.update };\n\t}\n\treturn base;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACkCA,IAAI,QAAQ;AACZ,IAAM,eAA2B,CAAC;AAClC,IAAI,cAAc;AAGX,SAAS,YAAkB;AACjC;AACD;AAGO,SAAS,WAAiB;AAChC;AACA,MAAI,UAAU,KAAK,cAAc,aAAa,OAAQ,OAAM;AAC7D;AAWO,SAAS,YACf,MACA,OACA,UAAmC,CAAC,GAC7B;AACP,OAAK,oBAAoB,EAAE,OAAO,YAAY,QAAQ,YAAY,SAAS,QAAQ,QAAQ,CAAC;AAC5F,eAAa,KAAK,IAAI;AACvB;AAGO,SAAS,sBAAsB,MAAsB;AAC3D,WAAS,IAAI,GAAG,IAAI,KAAK,kBAAkB,GAAG,IAAK,cAAa,KAAK,IAAI;AACzE,MAAI,UAAU,KAAK,cAAc,aAAa,OAAQ,OAAM;AAC7D;AAaA,SAAS,QAAc;AAatB,MAAI,UAAiC;AACrC,SAAO,cAAc,aAAa,QAAQ;AACzC,UAAM,OAAO,aAAa,aAAa;AACvC,UAAM,OAAO,KAAK,kBAAkB;AACpC,QAAI,SAAS,OAAW;AACxB,QAAI,KAAK,eAAe,QAAW;AAIlC,YAAM,YAAa,KAAK,WAAuC,cAAc;AAC7E,UAAI,CAAC,UAAW;AAAA,IACjB;AACA,QAAI,KAAK,YAAY,UAAa,CAAC,KAAK,QAAQ,GAAG;AAClD,WAAK,oBAAoB,IAAI;AAC7B;AAAA,IACD;AACA;AACA,QAAI;AACH,WAAK,MAAM;AAAA,IACZ,SAAS,GAAG;AACX,UAAI,YAAY,KAAM,WAAU,EAAE,EAAE;AAAA,IACrC,UAAE;AACD;AAAA,IACD;AAAA,EACD;AACA,eAAa,SAAS;AACtB,gBAAc;AACd,MAAI,YAAY,KAAM,OAAM,QAAQ;AACrC;;;ACzFA,IAAI,SAA6B;AACjC,IAAI,gBAAoC;AAEjC,SAAS,eAAwB;AACvC,SAAO,WAAW;AACnB;AAEO,SAAS,4BAAgD;AAC/D,SAAO,UAAU,iBAAiB;AACnC;AAMO,SAAS,aAAa,QAAqB,WAA0B;AAC3E,MAAI,WAAW,KAAM,QAAO;AAC5B,MAAI,CAAC,OAAO,SAAS,IAAI,MAAM,EAAG,QAAO,MAAM,KAAK,MAAM;AAC1D,SAAO,SAAS,IAAI,QAAQ,SAAS;AACrC,SAAO;AACR;AAMO,SAAS,yBAAyB,QAAqB,IAAyB;AACtF,MAAI,WAAW,QAAQ,CAAC,OAAO,SAAS,IAAI,MAAM,EAAG,QAAO;AAC5D,QAAM,QAAQ;AACd,SAAO,gBAAgB,MAAM;AAC5B,QAAI,MAAM,UAAW,IAAG;AAAA,EACzB,GAAG,KAAK;AACR,SAAO;AACR;;;AC1BO,IAAM,WAAW;AAGjB,SAAS,sBAAsB,GAAqB;AAC1D,SAAO,MAAM,YAAY,OAAO,MAAM;AACvC;AAGO,SAAS,aAAa,QAAiB,WAAW,iCAA0C;AAClG,SAAO,sBAAsB,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI;AAC9D;AAEO,IAAM,aAAa;AACnB,IAAM,eAAe;AACrB,IAAM,oBAAoB;AAC1B,IAAM,aAAa;AACnB,IAAM,cAAc;AACpB,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AAM7B,IAAM,OAAoC;AAAA,EACzC,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,OAAO;AAAA,EACP,UAAU;AACX;AAEO,SAAS,YAAY,GAAwB;AACnD,SAAO,KAAK,CAAC;AACd;AAGO,SAAS,eAAe,GAAyB;AACvD,SAAO,KAAK,CAAC,KAAK;AACnB;AAGO,SAAS,YAAY,GAAyB;AACpD,SAAO,KAAK,CAAC,MAAM;AACpB;AAGO,SAAS,oBAAoB,GAAyB;AAC5D,QAAM,OAAO,KAAK,CAAC;AACnB,SAAO,SAAS,cAAc,SAAS;AACxC;AAQO,SAAS,WAAW,GAAyB;AACnD,SAAO,KAAK,CAAC,MAAM;AACpB;AAOO,SAAS,YAAY,GAAyB;AACpD,QAAM,OAAO,KAAK,CAAC;AACnB,SAAO,SAAS,cAAc,SAAS;AACxC;;;AC9FO,IAAM,gBAA+B,uBAAO,yBAAyB;AAOrE,IAAM,mBAAkC,uBAAO,4BAA4B;AAiB3E,SAAS,mBAAmB,GAAuB;AACzD,SAAO,MAAM;AACd;AAuGO,SAAS,SAAS,KAAkB;AAC1C,SAAO,IAAI,SAAS;AACrB;AAGO,SAAS,SAAS,KAAU,UAAmD;AACrF,SAAO,IAAI,SAAS,QAAQ,KAAK,CAAC;AACnC;AAGO,SAAS,SAAS,KAAU,UAA6C;AAC/E,QAAM,QAAQ,SAAS,KAAK,QAAQ;AACpC,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,YAAY,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,MAAM,QAAQ;AAC3D,SAAO,UAAU,WAAW,IAAI,CAAC,IAAI;AACtC;AAGO,SAAS,UAAU,KAAU,UAA2B;AAC9D,SAAO,IAAI,aAAa,GAAG,OAAO,QAAQ;AAC3C;AAGO,SAAS,YAAY,KAAU,UAA2B;AAChE,QAAM,IAAI,IAAI,SAAS,QAAQ;AAC/B,SAAO,MAAM,SAAY,QAAQ;AAClC;;;ACvIA,IAAM,YAAN,MAAgC;AAAA,EAC/B,YAAqB,MAAgB;AAAhB;AAAA,EAAiB;AAAA,EAC9B,MAA8B,CAAC;AAAA,EAC/B,OAAiB,CAAC;AAAA,EAC1B,SAAS,IAAoB;AAC5B,UAAM,SAAS,KAAK,KAAK,IAAI;AAC7B,QAAI,WAAW,QAAW;AACzB,WAAK,IAAI,MAAM,IAAI;AACnB,aAAO;AAAA,IACR;AACA,UAAM,KAAK,KAAK,IAAI;AACpB,SAAK,IAAI,KAAK,EAAE;AAChB,WAAO;AAAA,EACR;AAAA,EACA,WAAW,UAAwB;AAClC,QAAI,KAAK,IAAI,QAAQ,MAAM,OAAW;AACtC,SAAK,IAAI,QAAQ,IAAI;AACrB,SAAK,KAAK,KAAK,QAAQ;AAAA,EACxB;AAAA,EACA,OAAO,UAAkB,KAAgB;AAIxC,IAAC,KAAK,IAAI,QAAQ,EAAa,GAAG;AAAA,EACnC;AACD;AAcA,IAAM,UAAU,CAAC,MAAsB,GAAG,EAAE,MAAM,IAAI,EAAE,QAAQ;AAEzD,IAAM,aAAN,MAAiB;AAAA,EACf,QAAgB,CAAC;AAAA,EAChB;AAAA,EACA;AAAA;AAAA,EAGD,aAAa;AAAA,EACb,SAAS,oBAAI,IAAwB;AAAA,EACrC,gBAAgB;AAAA,EAExB,cAAc;AACb,SAAK,aAAa,KAAK,QAAQ,IAAI,UAAU,MAAM,CAAC;AACpD,SAAK,cAAc,KAAK,QAAQ,IAAI,UAAU,OAAO,CAAC;AAAA,EACvD;AAAA;AAAA,EAGA,aAAa,IAAmB;AAC/B,SAAK,aAAa;AAAA,EACnB;AAAA;AAAA,EAEA,aAAmB;AAClB,SAAK,OAAO,MAAM;AAClB,SAAK,gBAAgB;AAAA,EACtB;AAAA;AAAA,EAEA,QAAQ,QAAwC;AAC/C,WAAO,KAAK,OAAO,IAAI,QAAQ,MAAM,CAAC;AAAA,EACvC;AAAA;AAAA,EAEA,IAAI,eAAuB;AAC1B,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,QAAQ,MAAoB;AAC3B,UAAM,KAAK,KAAK,MAAM;AACtB,SAAK,MAAM,KAAK,IAAI;AACpB,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,SAAS,IAAY,OAA0B,QAAgB;AAC9D,UAAM,SAAS,SAAS,SAAS,KAAK,aAAa,SAAS,UAAU,KAAK,cAAc;AACzF,UAAM,WAAW,KAAK,MAAM,MAAM,EAAE,SAAS,EAAE;AAC/C,WAAO,EAAE,QAAQ,SAAS;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW,QAAsB;AAChC,SAAK,MAAM,OAAO,MAAM,EAAE,WAAW,OAAO,QAAQ;AAKpD,SAAK,OAAO,OAAO,QAAQ,MAAM,CAAC;AAAA,EACnC;AAAA;AAAA,EAGA,OAAO,QAAgB,KAAgB;AACtC,QAAI,CAAC,KAAK,YAAY;AACrB,WAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,UAAU,GAAG;AACrD;AAAA,IACD;AACA,SAAK;AACL,UAAM,KAAK,YAAY,IAAI;AAC3B,QAAI;AACH,WAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,UAAU,GAAG;AAAA,IACtD,UAAE;AACD,YAAM,OAAO,YAAY,IAAI,IAAI,MAAM;AACvC,YAAM,MAAM,QAAQ,MAAM;AAC1B,YAAM,IAAI,KAAK,OAAO,IAAI,GAAG,KAAK;AAAA,QACjC,SAAS;AAAA,QACT,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,MACjB;AACA,QAAE;AACF,QAAE,iBAAiB;AACnB,QAAE,mBAAmB;AACrB,WAAK,OAAO,IAAI,KAAK,CAAC;AAAA,IACvB;AAAA,EACD;AAAA,EAEA,SAAS,QAA0B;AAClC,WAAO,KAAK,MAAM,MAAM,EAAE;AAAA,EAC3B;AACD;AAGO,IAAM,oBAAoB,IAAI,WAAW;;;ACzDzC,IAAM,WAAN,MAAe;AAAA,EACb,SAAS;AAAA,EACA,QAA8C,CAAC;AAAA,EAC/C,SAAiD,CAAC;AAAA,EAClD,QAAsC,CAAC;AAAA,EACvC,WAA4C,CAAC;AAAA,EAC7C,aAAgD,CAAC;AAAA,EACjD,YAA+C,CAAC;AAAA,EAChD,gBAAiD,CAAC;AAAA,EAClD,QAAyC,CAAC;AAAA,EAC1C,WAA4C,CAAC;AAAA,EAC7C,gBAAiD,CAAC;AAAA,EAClD,WAA0B,EAAE,OAAO,CAAC,GAAG,MAAM,EAAE;AAAA,EAEhE,WACC,MACA,OACoC;AACpC,UAAM,KAAK,KAAK;AAChB,UAAM,OAAO,EAAE,GAAG,MAAM,GAAG;AAC3B,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,UAAU,EAAE,IAAI,MAAM;AAC3B,SAAK,WAAW,EAAE,IAAI,MAAM;AAC5B,SAAK,OAAO,EAAE,IAAI,MAAM;AACxB,SAAK,MAAM,EAAE,IAAI,MAAM;AACvB,SAAK,SAAS,EAAE,IAAI,MAAM;AAC1B,SAAK,cAAc,EAAE,IAAI,MAAM;AAC/B,SAAK,MAAM,EAAE,IAAI,MAAM;AACvB,SAAK,SAAS,EAAE,IAAI,MAAM;AAC1B,SAAK,cAAc,EAAE,IAAI,MAAM;AAC/B,WAAO,EAAE,IAAI,MAAM,KAAK;AAAA,EACzB;AAAA,EAEA,IAAO,IAAyB;AAC/B,UAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,QAAI,SAAS,OAAW,OAAM,IAAI,MAAM,6BAA6B;AACrE,WAAO;AAAA,EACR;AAAA,EAEA,SAAY,IAA2B;AACtC,UAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,oCAAoC;AAC7E,WAAO;AAAA,EACR;AAAA,EAEA,QAAQ,IAAuB;AAC9B,UAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,QAAI,SAAS,OAAW,OAAM,IAAI,MAAM,mCAAmC;AAC3E,WAAO;AAAA,EACR;AAAA,EAEA,WAAW,IAA0B;AACpC,UAAM,UAAU,KAAK,SAAS,EAAE;AAChC,QAAI,YAAY,OAAW,OAAM,IAAI,MAAM,sCAAsC;AACjF,WAAO;AAAA,EACR;AAAA,EAEA,aAAa,IAA4B;AACxC,UAAM,YAAY,KAAK,WAAW,EAAE;AACpC,QAAI,cAAc,OAAW,OAAM,IAAI,MAAM,wCAAwC;AACrF,WAAO;AAAA,EACR;AAAA,EAEA,OAAO,IAA4B;AAClC,UAAM,MAAM,KAAK,UAAU,EAAE;AAC7B,QAAI,QAAQ,OAAW,OAAM,IAAI,MAAM,kCAAkC;AACzE,WAAO;AAAA,EACR;AAAA,EAEA,gBAAgB,IAA0B;AACzC,UAAM,QAAQ,KAAK,cAAc,EAAE;AACnC,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,sCAAsC;AAC/E,WAAO;AAAA,EACR;AAAA,EAEA,SAAS,IAA0B;AAClC,UAAM,QAAQ,KAAK,MAAM,EAAE;AAC3B,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,sCAAsC;AAC/E,WAAO;AAAA,EACR;AAAA,EAEA,WAAW,IAA0B;AACpC,UAAM,QAAQ,KAAK,SAAS,EAAE;AAC9B,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,kCAAkC;AAC3E,WAAO;AAAA,EACR;AAAA,EAEA,WAAW,IAA0B;AACpC,UAAM,QAAQ,KAAK,cAAc,EAAE;AACnC,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,sCAAsC;AAC/E,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,YAAY,IAAkB;AAC7B,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,UAAU,EAAE,IAAI;AACrB,SAAK,WAAW,EAAE,IAAI;AACtB,SAAK,OAAO,EAAE,IAAI;AAClB,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,SAAS,EAAE,IAAI;AACpB,SAAK,cAAc,EAAE,IAAI;AACzB,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,SAAS,EAAE,IAAI;AACpB,SAAK,cAAc,EAAE,IAAI;AAAA,EAC1B;AAAA;AAAA,EAGA,oBAAoB,MAA0B;AAC7C,SAAK,SAAS,MAAM,KAAK,IAAI;AAAA,EAC9B;AAAA;AAAA,EAGA,mBAA4B;AAC3B,WAAO,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM;AAAA,EACjD;AAAA;AAAA,EAGA,oBAA4B;AAC3B,WAAO,KAAK,SAAS,MAAM,SAAS,KAAK,SAAS;AAAA,EACnD;AAAA;AAAA,EAGA,oBAA8C;AAC7C,QAAI,CAAC,KAAK,iBAAiB,GAAG;AAC7B,WAAK,SAAS,QAAQ,CAAC;AACvB,WAAK,SAAS,OAAO;AACrB,aAAO;AAAA,IACR;AACA,UAAM,OAAO,KAAK,SAAS,MAAM,KAAK,SAAS,MAAM;AACrD,QAAI,CAAC,KAAK,iBAAiB,GAAG;AAC7B,WAAK,SAAS,QAAQ,CAAC;AACvB,WAAK,SAAS,OAAO;AAAA,IACtB;AACA,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,oBAAoB,MAA0B;AAC7C,UAAM,YAAY,KAAK,SAAS,MAAM,MAAM,KAAK,SAAS,IAAI;AAC9D,SAAK,SAAS,QAAQ,CAAC,MAAM,GAAG,SAAS;AACzC,SAAK,SAAS,OAAO;AAAA,EACtB;AAAA;AAAA,EAGA,0BAA0B,YAA0B;AACnD,UAAM,YAAY,KAAK,SAAS,MAC9B,MAAM,KAAK,SAAS,IAAI,EACxB,OAAO,CAAC,SAAS,KAAK,eAAe,UAAU;AACjD,SAAK,SAAS,QAAQ;AACtB,SAAK,SAAS,OAAO;AAAA,EACtB;AACD;AAEO,SAAS,mBAAmBA,WAAkC;AACpE,SAAO;AAAA,IACN,OAAO,IAAI,MAAMA,SAAQ,EAAE,KAAK,IAAI;AAAA,IACpC,UAAU,MAAM,KAAK,EAAE,QAAQA,UAAS,GAAG,MAAM,CAAC,CAAC;AAAA,IACnD,YAAY,IAAI,MAAMA,SAAQ,EAAE,KAAK,MAAS;AAAA,IAC9C,MAAM,IAAI,MAAMA,SAAQ,EAAE,KAAK,QAAQ;AAAA,IACvC,SAAS,IAAI,MAAMA,SAAQ,EAAE,KAAK,KAAK;AAAA,IACvC,OAAO,IAAI,MAAMA,SAAQ,EAAE,KAAK,KAAK;AAAA,IACrC,MAAM,IAAI,MAAMA,SAAQ,EAAE,KAAK,CAAC;AAAA,IAChC,UAAU,IAAI,MAAMA,SAAQ,EAAE,KAAK,MAAS;AAAA,IAC5C,eAAe,IAAI,MAAMA,SAAQ,EAAE,KAAK,MAAS;AAAA,IACjD,QAAQ,CAAC;AAAA,IACT,UAAU,CAAC;AAAA,EACZ;AACD;;;ACrGO,IAAM,qBAAN,MAAM,oBAAmB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,OAA+B,CAAC,GAAG;AAC9C,SAAK,UAAU,KAAK;AACpB,SAAK,OAAO,KAAK;AACjB,SAAK,MAAM,KAAK;AAChB,SAAK,YAAY,KAAK;AACtB,SAAK,UAAU,KAAK;AACpB,WAAO,OAAO,IAAI;AAAA,EACnB;AAAA,EAEA,OAAO,QAA4B;AAClC,WAAO;AAAA,EACR;AAAA,EAEA,YAAY,QAAgD;AAC3D,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,SAAS,OAAO,CAAC;AAAA,EAC3D;AAAA,EAEA,SAAS,QAA6C;AACrD,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,MAAM,OAAO,CAAC;AAAA,EACxD;AAAA,EAEA,QAAQ,QAA4C;AACnD,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,KAAK,OAAO,CAAC;AAAA,EACvD;AAAA,EAEA,cAAc,QAAkD;AAC/D,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,WAAW,OAAO,CAAC;AAAA,EAC7D;AAAA,EAEA,YAAY,QAAgD;AAC3D,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,SAAS,OAAO,CAAC;AAAA,EAC3D;AAAA,EAEA,gBAAgD;AAC/C,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,aAA0C;AACzC,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,YAAwC;AACvC,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,kBAAoD;AACnD,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,gBAAgD;AAC/C,WAAO,KAAK;AAAA,EACb;AACD;AAEA,IAAM,oBAAoB,IAAI,mBAAmB;;;ACpOjD,IAAM,uBAAuB,KAAK;AAElC,SAAS,uBAAuB,OAAe,MAAoB;AAClE,MAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC5B,UAAM,IAAI,UAAU,0CAA0C,IAAI,EAAE;AAAA,EACrE;AACD;AAEA,SAAS,uBAAuB,OAAe,MAAoB;AAClE,yBAAuB,OAAO,IAAI;AAClC,MAAI,OAAO,GAAG,OAAO,EAAE,GAAG;AACzB,UAAM,IAAI,UAAU,6CAA6C,IAAI,EAAE;AAAA,EACxE;AACA,QAAM,MAAM,KAAK,IAAI,KAAK;AAC1B,MAAI,MAAM,KAAK,MAAM,sBAAsB;AAC1C,UAAM,IAAI,UAAU,yCAAyC,IAAI,EAAE;AAAA,EACpE;AACA,MAAI,OAAO,UAAU,KAAK,KAAK,CAAC,OAAO,cAAc,KAAK,GAAG;AAC5D,UAAM,IAAI,UAAU,mDAAmD,IAAI,EAAE;AAAA,EAC9E;AACD;AAEA,SAAS,gBACR,OACA,OAAO,oBAAI,IAAY,GACvB,OAAO,KACP,gBAAgB,OACJ;AACZ,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAW,QAAO;AACpE,MAAI,OAAO,UAAU,UAAU;AAC9B,QAAI,cAAe,wBAAuB,OAAO,IAAI;AAAA,QAChD,wBAAuB,OAAO,IAAI;AACvC,WAAO;AAAA,EACR;AACA,MAAI,OAAO,UAAU,UAAU;AAC9B,UAAM,IAAI,UAAU,8BAA8B,IAAI,wBAAwB;AAAA,EAC/E;AACA,MAAI,KAAK,IAAI,KAAK,EAAG,OAAM,IAAI,UAAU,2CAA2C,IAAI,EAAE;AAC1F,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,UAAU,OAAO,aAAa,UAAU,MAAM;AAC1E,UAAM,IAAI,UAAU,yCAAyC,IAAI,EAAE;AAAA,EACpE;AACA,OAAK,IAAI,KAAK;AACd,MAAI;AACH,QAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,GAAG;AACnD,cAAM,IAAI,UAAU,gDAAgD,IAAI,EAAE;AAAA,MAC3E;AACA,iBAAW,OAAO,OAAO,oBAAoB,KAAK,GAAG;AACpD,cAAM,UACL,iBAAiB,KAAK,GAAG,KACzB,OAAO,cAAc,OAAO,GAAG,CAAC,KAChC,OAAO,GAAG,IAAI,MAAM;AACrB,YAAI,QAAQ,YAAY,CAAC,SAAS;AACjC,gBAAM,IAAI,UAAU,iDAAiD,IAAI,IAAI,GAAG,EAAE;AAAA,QACnF;AAAA,MACD;AACA,YAAMC,OAAmB,CAAC;AAC1B,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,YAAI,EAAE,KAAK,QAAQ;AAClB,gBAAM,IAAI,UAAU,0CAA0C,IAAI,IAAI,CAAC,GAAG;AAAA,QAC3E;AACA,QAAAA,KAAI,KAAK,gBAAgB,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,aAAa,CAAC;AAAA,MACzE;AACA,aAAOA;AAAA,IACR;AACA,QAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,GAAG;AACnD,YAAM,IAAI,UAAU,gDAAgD,IAAI,EAAE;AAAA,IAC3E;AACA,UAAM,MAAiC,uBAAO,OAAO,IAAI;AACzD,eAAW,OAAO,OAAO,KAAK,KAAgC,EAAE,KAAK,GAAG;AACvE,UAAI,GAAG,IAAI;AAAA,QACT,MAAkC,GAAG;AAAA,QACtC;AAAA,QACA,GAAG,IAAI,IAAI,GAAG;AAAA,QACd;AAAA,MACD;AAAA,IACD;AACA,WAAO;AAAA,EACR,UAAE;AACD,SAAK,OAAO,KAAK;AAAA,EAClB;AACD;AAGO,SAAS,iBAAiB,OAAwB;AACxD,SAAO,KAAK,UAAU,gBAAgB,KAAK,CAAC;AAC7C;AAEA,SAAS,uBAAuB,OAAwB;AACvD,SAAO,KAAK,UAAU,gBAAgB,OAAO,oBAAI,IAAY,GAAG,KAAK,IAAI,CAAC;AAC3E;AAGO,SAAS,eAA4B;AAC3C,QAAM,UAAU,IAAI,YAAY;AAChC,QAAM,UAAU,IAAI,YAAY;AAChC,SAAO;AAAA,IACN,OAAO,OAAsB;AAC5B,aAAO,QAAQ,OAAO,iBAAiB,KAAK,CAAC;AAAA,IAC9C;AAAA,IACA,OAAO,OAAsB;AAC5B,aAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,CAAC;AAAA,IACxC;AAAA,EACD;AACD;AAGO,IAAM,YAA4B,aAAsB;AAE/D,SAAS,WAAW,GAAe,GAAwB;AAC1D,MAAI,EAAE,eAAe,EAAE,WAAY,QAAO;AAC1C,WAAS,IAAI,GAAG,IAAI,EAAE,YAAY,KAAK,GAAG;AACzC,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAAA,EAC3B;AACA,SAAO;AACR;AAEA,SAAS,qBAAqB,OAAwB;AACrD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,UAAM,OAAO,MAAM,WAAW,CAAC;AAC/B,QAAI,QAAQ,SAAU,QAAQ,OAAQ;AACrC,YAAM,OAAO,MAAM,WAAW,IAAI,CAAC;AACnC,UAAI,QAAQ,SAAU,QAAQ,OAAQ;AACrC,aAAK;AACL;AAAA,MACD;AACA,aAAO;AAAA,IACR;AACA,QAAI,QAAQ,SAAU,QAAQ,MAAQ,QAAO;AAAA,EAC9C;AACA,SAAO;AACR;AAEA,SAAS,2BAA2B,OAAgB,OAAO,oBAAI,IAAY,GAAG,OAAO,KAAW;AAC/F,MAAI,OAAO,UAAU,UAAU;AAC9B,QAAI,qBAAqB,KAAK,GAAG;AAChC,YAAM,IAAI,UAAU,0CAA0C,IAAI,EAAE;AAAA,IACrE;AACA;AAAA,EACD;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU;AACjD,MAAI,KAAK,IAAI,KAAK,EAAG;AACrB,OAAK,IAAI,KAAK;AACd,MAAI;AACH,QAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,mCAA2B,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG;AAAA,MAC3D;AACA;AAAA,IACD;AACA,eAAW,OAAO,OAAO,KAAK,KAAgC,GAAG;AAChE,UAAI,qBAAqB,GAAG,GAAG;AAC9B,cAAM,IAAI,UAAU,0CAA0C,IAAI,IAAI,GAAG,EAAE;AAAA,MAC5E;AACA,iCAA4B,MAAkC,GAAG,GAAG,MAAM,GAAG,IAAI,IAAI,GAAG,EAAE;AAAA,IAC3F;AAAA,EACD,UAAE;AACD,SAAK,OAAO,KAAK;AAAA,EAClB;AACD;AAEA,SAAS,gCAAgC,MAAoB;AAC5D,MAAI,QAAQ;AAEZ,WAAS,KAAK,SAAwB;AACrC,UAAM,IAAI,UAAU,oBAAoB,OAAO,EAAE;AAAA,EAClD;AAEA,WAAS,iBAAuB;AAC/B,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,EAAG,UAAS;AAAA,EAC/C;AAEA,WAAS,iBAAyB;AACjC,UAAM,QAAQ;AACd,aAAS;AACT,WAAO,QAAQ,KAAK,QAAQ;AAC3B,YAAM,KAAK,KAAK,KAAK;AACrB,UAAI,OAAO,KAAK;AACf,iBAAS;AACT,YAAI;AACH,iBAAO,KAAK,MAAM,KAAK,MAAM,OAAO,KAAK,CAAC;AAAA,QAC3C,QAAQ;AACP,eAAK,uBAAuB;AAAA,QAC7B;AAAA,MACD;AACA,UAAI,OAAO,MAAM;AAChB,iBAAS;AACT;AAAA,MACD;AACA,eAAS;AAAA,IACV;AACA,SAAK,0BAA0B;AAAA,EAChC;AAEA,WAAS,eAAe,SAAuB;AAC9C,QAAI,KAAK,MAAM,OAAO,QAAQ,QAAQ,MAAM,MAAM,SAAS;AAC1D,WAAK,4BAA4B,KAAK,EAAE;AAAA,IACzC;AACA,aAAS,QAAQ;AAAA,EAClB;AAEA,WAAS,gBAAsB;AAC9B,UAAM,QAAQ,yCAAyC,KAAK,KAAK,MAAM,KAAK,CAAC;AAC7E,QAAI,CAAC,MAAO,MAAK,mCAAmC,KAAK,EAAE;AAC3D,aAAS,MAAM,CAAC,EAAE;AAAA,EACnB;AAEA,WAAS,WAAW,MAAoB;AACvC,mBAAe;AACf,UAAM,KAAK,KAAK,KAAK;AACrB,QAAI,OAAO,KAAK;AACf,kBAAY,IAAI;AAChB;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,iBAAW,IAAI;AACf;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe;AACf;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe,MAAM;AACrB;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe,OAAO;AACtB;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe,MAAM;AACrB;AAAA,IACD;AACA,QAAI,OAAO,OAAQ,OAAO,UAAa,MAAM,OAAO,MAAM,KAAM;AAC/D,oBAAc;AACd;AAAA,IACD;AACA,SAAK,4BAA4B,KAAK,EAAE;AAAA,EACzC;AAEA,WAAS,YAAY,MAAoB;AACxC,UAAM,OAAO,oBAAI,IAAY;AAC7B,aAAS;AACT,mBAAe;AACf,QAAI,KAAK,KAAK,MAAM,KAAK;AACxB,eAAS;AACT;AAAA,IACD;AACA,WAAO,QAAQ,KAAK,QAAQ;AAC3B,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,IAAK,MAAK,iCAAiC,KAAK,EAAE;AACtE,YAAM,MAAM,eAAe;AAC3B,UAAI,KAAK,IAAI,GAAG,GAAG;AAClB,cAAM,IAAI;AAAA,UACT,yCAAyC,KAAK,UAAU,GAAG,CAAC,OAAO,IAAI;AAAA,QACxE;AAAA,MACD;AACA,WAAK,IAAI,GAAG;AACZ,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,IAAK,MAAK,2CAA2C,KAAK,EAAE;AAChF,eAAS;AACT,iBAAW,GAAG,IAAI,IAAI,GAAG,EAAE;AAC3B,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,WAAK,iCAAiC,KAAK,EAAE;AAAA,IAC9C;AACA,SAAK,0BAA0B;AAAA,EAChC;AAEA,WAAS,WAAW,MAAoB;AACvC,aAAS;AACT,mBAAe;AACf,QAAI,KAAK,KAAK,MAAM,KAAK;AACxB,eAAS;AACT;AAAA,IACD;AACA,QAAI,OAAO;AACX,WAAO,QAAQ,KAAK,QAAQ;AAC3B,iBAAW,GAAG,IAAI,IAAI,IAAI,GAAG;AAC7B,cAAQ;AACR,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,WAAK,iCAAiC,KAAK,EAAE;AAAA,IAC9C;AACA,SAAK,yBAAyB;AAAA,EAC/B;AAEA,aAAW,GAAG;AACd,iBAAe;AACf,MAAI,UAAU,KAAK,OAAQ,MAAK,iCAAiC,KAAK,EAAE;AACzE;AAOO,SAAS,qBAAkC;AACjD,QAAM,UAAU,IAAI,YAAY;AAChC,QAAM,UAAU,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC;AACxD,SAAO;AAAA,IACN,OAAO,OAAsB;AAC5B,iCAA2B,KAAK;AAChC,aAAO,QAAQ,OAAO,uBAAuB,KAAK,CAAC;AAAA,IACpD;AAAA,IACA,OAAO,OAAsB;AAC5B,YAAM,OAAO,QAAQ,OAAO,KAAK;AACjC,sCAAgC,IAAI;AACpC,YAAM,UAAU,KAAK,MAAM,IAAI;AAC/B,iCAA2B,OAAO;AAClC,YAAM,YAAY,QAAQ,OAAO,uBAAuB,OAAO,CAAC;AAChE,UAAI,CAAC,WAAW,OAAO,SAAS,GAAG;AAClC,cAAM,IAAI,UAAU,sDAAsD;AAAA,MAC3E;AACA,aAAO;AAAA,IACR;AAAA,EACD;AACD;AAGO,IAAM,kBAAkC,mBAA4B;AAGpE,SAAS,yBAAyB,OAA4B;AACpE,SAAO,gBAAgB,OAAO,KAAK;AACpC;;;AClUA,IAAM,iBAAiB,OAAO,OAAO;AAAA,EACpC,4BAA4B;AAC7B,CAAC;AAED,SAAS,QAAQ,OAA2B;AAC3C,MAAI,OAAO;AACX,QAAM,QAAQ;AACd,aAAW,QAAQ,OAAO;AACzB,YAAQ,OAAO,IAAI;AACnB,WAAO,OAAO,QAAQ,IAAI,OAAO,KAAK;AAAA,EACvC;AACA,SAAO,KAAK,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG;AAC1C;AAQO,SAAS,uBAAuB,OAA2B;AACjE,SAAO,WAAW,QAAQ,KAAK,CAAC;AACjC;AAEA,SAAS,aACR,QACA,OACS;AACT,SAAO,OAAO,KAAK,yBAAyB,KAAK,CAAC;AACnD;AAEO,SAAS,gCACf,QACA,OACO;AACP,MAAI,CAAC,OAAO,WAAW,OAAO,UAAU,EAAG;AAC3C,2BAAyB,KAAK;AAC/B;AAEO,SAAS,wBACf,QACA,OACU;AACV,MAAI,CAAC,OAAO,WAAW,OAAO,UAAU,EAAG,QAAO;AAClD,QAAM,QAAQ,yBAAyB,KAAK;AAC5C,SAAO,gBAAgB,OAAO,KAAK;AACpC;AAEO,SAAS,4BACf,QAC+B;AAC/B,MAAI,WAAW,MAAO,QAAO,EAAE,SAAS,MAAM;AAC9C,MAAI,WAAW,UAAa,WAAW,EAAG,QAAO,EAAE,SAAS,MAAM,OAAO,EAAE;AAC3E,MAAI,WAAW,EAAG,QAAO,EAAE,SAAS,MAAM,OAAO,GAAG,MAAM,uBAAuB;AACjF,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AAClD,QAAI,OAAO,UAAU,EAAG,QAAO,EAAE,SAAS,MAAM,OAAO,EAAE;AACzD,QAAI,OAAO,UAAU,GAAG;AACvB,aAAO,EAAE,SAAS,MAAM,OAAO,GAAG,MAAM,OAAO,QAAQ,uBAAuB;AAAA,IAC/E;AAAA,EACD;AACA,QAAM,IAAI,MAAM,wEAAwE;AACzF;AAEO,SAAS,kBACf,QACA,eAAwB,gBACE;AAC1B,MAAI,CAAC,OAAO,QAAS,QAAO;AAC5B,MAAI,OAAO,UAAU,EAAG,QAAO,OAAO,OAAO,EAAE,OAAO,GAAG,SAAS,EAAE,CAAC;AACrE,SAAO,OAAO,OAAO;AAAA,IACpB,OAAO;AAAA,IACP,SAAS;AAAA,IACT,KAAK,aAAa,QAAQ,YAAY;AAAA,IACtC,MAAM;AAAA,EACP,CAAC;AACF;AAEO,SAAS,mBACf,SACA,QACA,OAC0B;AAC1B,MAAI,CAAC,OAAO,QAAS,QAAO;AAC5B,MAAI,YAAY,OAAW,QAAO,kBAAkB,QAAQ,KAAK;AACjE,MAAI,OAAO,UAAU,GAAG;AACvB,WAAO,OAAO,OAAO,EAAE,OAAO,GAAG,SAAS,QAAQ,UAAU,EAAE,CAAC;AAAA,EAChE;AACA,QAAM,WAAW,QAAQ,UAAU,IAAI,QAAQ,MAAM;AACrD,SAAO,OAAO,OAAO;AAAA,IACpB,OAAO;AAAA,IACP,SAAS,QAAQ,UAAU;AAAA,IAC3B,KAAK,aAAa,QAAQ,KAAK;AAAA,IAC/B,MAAM;AAAA,EACP,CAAC;AACF;AAEO,SAAS,iBAAiB,SAA2D;AAC3F,MAAI,YAAY,OAAW,QAAO;AAClC,MAAI,QAAQ,UAAU,EAAG,QAAO,OAAO,OAAO,EAAE,OAAO,GAAG,SAAS,QAAQ,QAAQ,CAAC;AACpF,SAAO,OAAO,OAAO;AAAA,IACpB,OAAO;AAAA,IACP,SAAS,QAAQ;AAAA,IACjB,KAAK,QAAQ;AAAA,IACb,MAAM,QAAQ;AAAA,EACf,CAAC;AACF;AAEO,SAAS,cACf,QACA,SACA,OACS;AACT,SAAO,aAAa,QAAQ,UAAU,QAAQ,cAAc;AAC7D;;;ACiBA,IAAI;AACJ,IAAI;AACJ,IAAM,cAAc,oBAAI,QAAgC;AACxD,IAAM,+BAA+B,oBAAI,QAAoD;AAC7F,IAAM,oBAAoB,oBAAI,QAAkD;AAChF,IAAM,iBAAiB,oBAAI,QAA0D;AACrF,IAAM,mBAAmB,oBAAI,QAAmC;AAChE,IAAM,2BAA2B,oBAAI,QAAsC;AAC3E,IAAM,yBAAyB,oBAAI,QAAqC;AACxE,IAAM,oBAAoB,oBAAI,QAAsC;AACpE,IAAM,gBAAgB,oBAAI,QAAuB;AAG1C,SAAS,aACf,MACA,QACQ;AACR,QAAM,OAAO;AACb,qBAAmB;AACnB,MAAI;AACH,WAAO,OAAO;AAAA,EACf,UAAE;AACD,uBAAmB;AAAA,EACpB;AACD;AAGO,SAAS,uBACf,aACA,QACQ;AACR,QAAM,OAAO;AACb,4BAA0B;AAC1B,MAAI;AACH,WAAO,OAAO;AAAA,EACf,UAAE;AACD,8BAA0B;AAAA,EAC3B;AACD;AAGO,SAAS,aAAa,GAA2B;AACvD,SAAO,YAAY,IAAI,CAAC;AACzB;AAeA,SAAS,0BACRC,OACA,UACA,MACO;AACP,+BAA6B,IAAIA,KAAI,IAAIA,OAAM,UAAU,IAAI;AAC9D;AAiBO,SAAS,qBAAqB,GAAwB;AAC5D,mBAAiB,IAAI,CAAC,IAAI;AAC3B;AAkBO,SAAS,sBAAsB,GAA2B;AAChE,SAAO,cAAc,IAAI,CAAC;AAC3B;AAEA,SAAS,aAAa,GAAqB;AAC1C,SAAO,MAAM,SAAY,QAAQ;AAClC;AAEA,SAAS,oBAAoB,QAAgC;AAC5D,MAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GAAG;AAC3E,UAAM,IAAI,MAAM,iEAAiE;AAAA,EAClF;AACA,QAAM,SAAU,OAAgC;AAChD,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UAAU;AAC7D,UAAM,IAAI,MAAM,+DAA+D;AAAA,EAChF;AACA,QAAM,SAAU,OAAgC;AAChD,SAAO,WAAW,SAAY,EAAE,OAAO,IAAI,EAAE,QAAQ,OAAO;AAC7D;AAEA,SAAS,qBAAqB,MAAkB;AAC/C,aAAW,KAAK,MAAM;AACrB,QAAI,EAAE,CAAC,MAAM,UAAU,EAAE,CAAC,MAAM,QAAW;AAC1C,YAAM,IAAI,MAAM,6DAA6D;AAAA,IAC9E;AACA,QAAI,EAAE,CAAC,MAAM,WAAW,sBAAsB,EAAE,CAAC,CAAC,GAAG;AACpD,YAAM,IAAI,MAAM,2EAA2E;AAAA,IAC5F;AAAA,EACD;AACD;AAaO,IAAM,OAAN,MAAwB;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,6BAA6B;AAAA,EAC7B,YAAY;AAAA,EAEpB,IAAY,WAAuB;AAClC,WAAO,KAAK,cAAc;AAAA,EAC3B;AAAA,EAEA,IAAY,SAAS,KAAiB;AACrC,SAAK,cAAc,QAAQ;AAAA,EAC5B;AAAA,EAEA,YACC,MACA,YACA,OAAuB,CAAC,GACvB;AACD,UAAM,OAAO;AACb,uBAAmB;AACnB,UAAM,aAAa,KAAK,cAAc;AACtC,UAAM,cAAc,2BAA2B,mBAAmB,MAAM;AACxE,8BAA0B;AAC1B,UAAM,OAAO,KAAK,QAAQ;AAC1B,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,WAAW,KAAK;AACtB,UAAM,OAAO,KAAK,WAAW;AAI7B,QAAI,QAAQ,aAAa;AACxB,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAED,QAAI;AACJ,QAAI,eAAe,KAAM,UAAS;AAAA,aACzB,OAAO,eAAe,WAAY,UAAS,WAAW,SAAS,YAAY,IAAI;AAAA,QACnF,UAAS;AAEd,UAAM,IAAI,KAAK;AACf,UAAM,MAAM,mBAAmB,CAAC;AAChC,UAAM,aAAa,4BAA4B,KAAK,UAAU;AAC9D,UAAM,QAAQ;AAAA,MACb,OAAO;AAAA,MACP,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,aAAa;AAAA,MACb,YAAY,CAAC;AAAA,IACd;AACA,QAAI,KAAK,YAAY,QAAW;AAC/B,YAAM,QAAQ,KAAK;AACnB,YAAM,UAAU;AAChB,YAAM,SAAS;AAAA,IAChB;AACA,UAAM,eAAe,oBAAI,IAAa;AACtC,SAAK,QAAQ,QAAQ,IAAI,SAAS;AAClC,UAAM,UAAU,KAAK,MAAM;AAAA,MAC1B;AAAA,QACC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS,KAAK,WAAW;AAAA,QACzB,qBAAqB,KAAK,uBAAuB;AAAA,QACjD,0BAA0B,KAAK,4BAA4B;AAAA,QAC3D,oBAAoB,KAAK,sBAAsB;AAAA,QAC/C,gBAAgB,KAAK,kBAAkB;AAAA,QACvC,iBAAiB,KAAK,mBAAmB;AAAA,QACzC;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS,KAAK,gBAAgB;AAAA,QAC9B,SAAS,KAAK,WAAW;AAAA,QACzB,MAAM,KAAK;AAAA,QACX,SAAS,KAAK;AAAA,MACf;AAAA,MACA;AAAA,QACC;AAAA,QACA,WAAW,EAAE,aAAa,oBAAI,IAAU,GAAG,WAAW,MAAM;AAAA,QAC5D;AAAA,QACA,MAAM;AAAA,UACL,SAAS;AAAA,UACT,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,uBAAuB;AAAA,UACvB,eAAe;AAAA,UACf,eAAe;AAAA,UACf,kBAAkB;AAAA,UAClB,gBAAgB;AAAA,QACjB;AAAA,QACA,SAAS;AAAA,UACR;AAAA,UACA,uBAAuB;AAAA,UACvB,aAAa,CAAC;AAAA,UACd,YAAY;AAAA,UACZ,YAAY;AAAA,UACZ,eAAe;AAAA,UACf,iBAAiB;AAAA,QAClB;AAAA,QACA,cAAc,EAAE,OAAO,UAAU,SAAS,MAAM;AAAA,QAChD,OAAO,EAAE,gBAAgB,CAAC,GAAG,cAAc,CAAC,EAAE;AAAA,QAC9C,SAAS,EAAE,OAAO,KAAK;AAAA,QACvB,SAAS;AAAA,UACR,QAAQ;AAAA,UACR,OAAO;AAAA,YACN;AAAA,YACA,KAAK,YAAY,SAAY,KAAK,UAAU;AAAA,UAC7C;AAAA,QACD;AAAA,MACD;AAAA,IACD;AACA,SAAK,MAAM,QAAQ;AACnB,SAAK,QAAQ,KAAK,MAAM,IAAO,KAAK,GAAG;AACvC,SAAK,OAAO,KAAK,MAAM,OAAO,KAAK,GAAG;AACtC,SAAK,SAAS,KAAK,MAAM,SAAY,KAAK,GAAG;AAC7C,SAAK,QAAQ,KAAK,MAAM,QAAQ,KAAK,GAAG;AACxC,SAAK,WAAW,KAAK,MAAM,WAAW,KAAK,GAAG;AAC9C,SAAK,aAAa,KAAK,MAAM,aAAa,KAAK,GAAG;AAClD,SAAK,gBAAgB,KAAK,MAAM,gBAAgB,KAAK,GAAG;AACxD,SAAK,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAC1C,SAAK,gBAAgB,KAAK,MAAM,WAAW,KAAK,GAAG;AACnD,SAAK,WAAW,KAAK,MAAM,WAAW,KAAK,GAAG;AAC9C,sBAAkB,IAAI,MAAuB,OAAO;AAAA,MACnD,OAAO,KAAK,OAAO;AAAA,MACnB,SAAS,KAAK,OAAO;AAAA,MACrB,UAAU,KAAK,OAAO;AAAA,MACtB,WAAW,KAAK,WAAW;AAAA,MAC3B,iBAAiB,KAAK,MAAM;AAAA,MAC5B,UAAU;AAAA,QACT,OAAO,KAAK,cAAc;AAAA,QAC1B,SAAS,KAAK,cAAc;AAAA,MAC7B;AAAA,MACA,SAAS,iBAAiB,KAAK,SAAS,KAAK;AAAA,MAC7C,QAAQ,KAAK,MAAM;AAAA,IACpB,EAAE;AACF,mBAAe,IAAI,MAAuB,CAAC,UAAU;AACpD,WAAK,mBAAmB,cAAc;AACtC,WAAK,OAAO,QAAQ,MAAM;AAC1B,WAAK,OAAO,UAAU,MAAM;AAC5B,WAAK,OAAO,SAAS,MAAM;AAC3B,WAAK,OAAO,WAAW,MAAM;AAC7B,WAAK,OAAO,cAAc;AAC1B,WAAK,OAAO,aAAa,CAAC;AAC1B,WAAK,MAAM,kBAAkB,MAAM;AACnC,WAAK,MAAM,uBAAuB;AAClC,WAAK,MAAM,wBAAwB;AACnC,WAAK,MAAM,UAAU;AACrB,WAAK,MAAM,gBAAgB;AAC3B,WAAK,MAAM,gBAAgB;AAC3B,WAAK,MAAM,mBAAmB;AAC9B,WAAK,MAAM,iBAAiB;AAC5B,WAAK,SAAS,cAAc,CAAC;AAC7B,WAAK,SAAS,wBAAwB;AACtC,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,gBAAgB;AAC9B,WAAK,SAAS,kBAAkB;AAChC,WAAK,SAAS,aAAa,MAAM;AACjC,WAAK,cAAc,QAAQ,MAAM,SAAS;AAC1C,WAAK,cAAc,UAAU,MAAM,SAAS;AAC5C,UAAI,MAAM,YAAY,OAAO;AAC5B,aAAK,SAAS,SAAS,EAAE,SAAS,MAAM;AACxC,aAAK,SAAS,QAAQ;AAAA,MACvB,WAAW,MAAM,QAAQ,UAAU,GAAG;AACrC,aAAK,SAAS,SAAS,EAAE,SAAS,MAAM,OAAO,EAAE;AACjD,aAAK,SAAS,QAAQ,iBAAiB,MAAM,OAAO;AAAA,MACrD,OAAO;AACN,YAAI,CAAC,KAAK,SAAS,OAAO,WAAW,KAAK,SAAS,OAAO,UAAU,GAAG;AACtE,gBAAM,IAAI;AAAA,YACT,+CAA+C,MAAM,QAAQ,KAAK;AAAA,UACnE;AAAA,QACD;AAIA,YAAI,CAAC,MAAM,WAAW,MAAM,QAAQ,UAAU,GAAG;AAChD,gBAAM,IAAI;AAAA,YACT;AAAA,UACD;AAAA,QACD;AACA,cAAM,cAAc,cAAc,KAAK,SAAS,QAAQ,MAAM,SAAS,MAAM,KAAK;AAClF,YAAI,gBAAgB,MAAM,QAAQ,KAAK;AACtC,gBAAM,IAAI;AAAA,YACT;AAAA,UACD;AAAA,QACD;AACA,aAAK,SAAS,QAAQ,iBAAiB,MAAM,OAAO;AAAA,MACrD;AACA,WAAK,WAAW;AAChB,WAAK,eAAe;AAIpB,WAAK,WAAW,YAAY;AAC5B,WAAK,WAAW,YAAY,MAAM;AAClC,WAAK,6BAA6B;AAAA,IACnC,CAAC;AACD,qBAAiB,IAAI,MAAuB,MAAM,KAAK,gBAAgB,CAAC;AACxE,6BAAyB,IAAI,MAAuB,MAAM,KAAK,8BAA8B,CAAC;AAC9F,2BAAuB,IAAI,MAAuB,MAAM,KAAK,iBAAiB,CAAC;AAC/E,sBAAkB,IAAI,MAAuB,MAAM,KAAK,WAAW,SAAS;AAAA,EAC7E;AAAA;AAAA,EAGQ,eAAwB;AAC/B,WAAO,KAAK,MAAM,QAAQ,KAAK,SAAS,eAAe;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,SAA6B;AAChC,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,IAAI,QAAuB;AAC1B,WAAO,KAAK,OAAO;AAAA,EACpB;AAAA,EAEA,IAAI,SAAiB;AACpB,WAAO,KAAK,OAAO;AAAA,EACpB;AAAA,EAEA,IAAI,UAAmC;AACtC,WAAO,iBAAiB,KAAK,SAAS,KAAK;AAAA,EAC5C;AAAA,EAEA,IAAI,OAA2B;AAC9B,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA,EAGA,IAAI,UAA8B;AACjC,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,OAAiC;AACpC,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,SAAwB;AAC3B,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA,EAGA,UAAU,MAAwB;AACjC,SAAK,mBAAmB,WAAW;AAInC,cAAU;AACV,QAAI;AAGH,UAAI,KAAK,OAAO,aAAa,QAAW;AACvC,YAAI,KAAK,MAAM,gBAAgB;AAC9B,eAAK,6BAA6B;AAClC,eAAK,gBAAgB;AAAA,QACtB;AACC,gBAAM,IAAI;AAAA,YACT;AAAA,UACD;AAAA,MACF;AAEA,WAAK,WAAW,YAAY,IAAI,IAAI;AACpC,WAAK,CAAC,OAAO,CAAC;AACd,UAAI,KAAK,MAAM,UAAU,KAAK,KAAK,OAAO,WAAW,SAAS,GAAG;AAEhE,mBAAW,KAAK,KAAK,OAAO,WAAY,MAAK,CAAC,QAAQ,CAAC,CAAC;AAAA,MACzD,WAAW,KAAK,OAAO,WAAW,CAAC,KAAK,MAAM,MAAM;AAInD,aAAK,CAAC,QAAQ,KAAK,OAAO,KAAK,CAAC;AAAA,MACjC,WAAW,KAAK,OAAO,WAAW,WAAW,CAAC,KAAK,MAAM,MAAM;AAC9D,aAAK,CAAC,OAAO,CAAC;AAAA,MACf;AAEA,UAAI,CAAC,KAAK,WAAW,UAAW,MAAK,UAAU;AAE/C,aAAO,MAAM;AACZ,YAAI,CAAC,KAAK,WAAW,YAAY,OAAO,IAAI,EAAG;AAC/C,YAAI,KAAK,WAAW,YAAY,SAAS,EAAG,MAAK,YAAY;AAAA,MAC9D;AAAA,IACD,UAAE;AACD,eAAS;AAAA,IACV;AAAA,EACD;AAAA;AAAA,EAGA,KAAK,MAAkB;AACtB,SAAK,mBAAmB,MAAM;AAG9B,cAAU;AACV,QAAI;AACH,WAAK,MAAM,IAAI;AAAA,IAChB,UAAE;AACD,eAAS;AAAA,IACV;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,GAAG,MAAY,WAA0B;AACxC,SAAK,mBAAmB,IAAI;AAE5B,cAAU;AACV,QAAI;AACH,WAAK,IAAI,MAAM,SAAS;AAAA,IACzB,UAAE;AACD,eAAS;AAAA,IACV;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,mBAAmB,IAAoB;AAC9C,gBAAY,KAAK,OAAO,MAAM,KAAK,iBAAiB,EAAE,GAAG;AAAA,MACxD,YAAY,0BAA0B;AAAA,MACtC,SAAS,MAAM,CAAC,KAAK,sBAAsB;AAAA,IAC5C,CAAC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,eAAe,MAAY,WAA0B;AAC5D;AAAA,MACC,KAAK;AAAA,MACL,MAAM;AACL,YAAI,CAAC,KAAK,UAAW,MAAK,IAAI,MAAM,SAAS;AAAA,MAC9C;AAAA,MACA;AAAA,QACC,YAAY,0BAA0B;AAAA,QACtC,SAAS,MAAM,CAAC,KAAK,sBAAsB;AAAA,MAC5C;AAAA,IACD;AAAA,EACD;AAAA;AAAA,EAGQ,iBAAiB,IAAoB;AAC5C,QAAI,KAAK,UAAW;AACpB,QAAI;AAIH,UAAI,GAAG,SAAS,OAAO;AACtB,cAAM,OAAO,KAAK,MAAM,KAAK,SAAS,GAAG,GAAG,IACzC,CAAC,GAAG,KAAK,MAAM,IAAI,IACnB,CAAC,GAAG,KAAK,MAAM,MAAM,GAAG,GAAG;AAC9B,aAAK,QAAQ,MAAM,GAAG,IAAI,EAAE,oBAAoB,KAAK,CAAC;AAAA,MACvD,WAAW,GAAG,SAAS,UAAU;AAChC,aAAK;AAAA,UACJ,KAAK,MAAM,KAAK,OAAO,CAAC,MAAM,MAAM,GAAG,GAAG;AAAA,UAC1C,GAAG;AAAA,UACH,EAAE,oBAAoB,KAAK;AAAA,QAC5B;AAAA,MACD,OAAO;AACN,aAAK,QAAQ,KAAK,WAAW,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,oBAAoB,KAAK,CAAC;AAAA,MAC3E;AAAA,IACD,SAAS,GAAG;AAMX,WAAK,MAAM,CAAC,CAAC,SAAS,aAAa,GAAG,sBAAsB,CAAC,CAAC,CAAC;AAAA,IAChE;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAY,SAA0B,IAAkB;AACvD,SAAK,mBAAmB,aAAa;AACrC,SAAK,QAAQ,KAAK,WAAW,OAAO,GAAG,EAAE;AAAA,EAC1C;AAAA;AAAA,EAGA,aAAa,SAAwB,IAAoB;AACxD,SAAK,mBAAmB,cAAc;AACtC,UAAM,OAAO,KAAK,MAAM,KAAK,SAAS,OAAO,IAC1C,CAAC,GAAG,KAAK,MAAM,IAAI,IACnB,CAAC,GAAG,KAAK,MAAM,MAAM,OAAO;AAC/B,UAAM,WAAW,KAAK,QAAQ,MAAM,EAAE;AACtC,WAAO,WAAW,KAAK,QAAQ,OAAO,IAAI,KAAK,MAAM,KAAK,QAAQ,OAAO;AAAA,EAC1E;AAAA;AAAA,EAGA,eAAe,SAAwB,IAAkB;AACxD,SAAK,mBAAmB,gBAAgB;AACxC,SAAK;AAAA,MACJ,KAAK,MAAM,KAAK,OAAO,CAAC,MAAM,MAAM,OAAO;AAAA,MAC3C;AAAA,IACD;AAAA,EACD;AAAA,EAEQ,WAAW,MAAwC;AAC1D,UAAM,OAAO,oBAAI,IAAmB;AACpC,UAAM,MAAuB,CAAC;AAC9B,eAAW,KAAK;AACf,UAAI,CAAC,KAAK,IAAI,CAAC,GAAG;AACjB,aAAK,IAAI,CAAC;AACV,YAAI,KAAK,CAAC;AAAA,MACX;AACD,WAAO;AAAA,EACR;AAAA;AAAA,EAGQ,mBAAmB,MAAqB,QAAgC;AAC/E,UAAM,OAAO,oBAAI,IAAmB;AACpC,UAAM,QAAyB,CAAC,IAAI;AACpC,WAAO,MAAM,SAAS,GAAG;AACxB,YAAM,IAAI,MAAM,IAAI;AACpB,UAAI,MAAM,OAAW;AACrB,UAAI,MAAM,OAAQ,QAAO;AACzB,UAAI,KAAK,IAAI,CAAC,EAAG;AACjB,WAAK,IAAI,CAAC;AACV,iBAAW,KAAK,EAAE,MAAM,KAAM,OAAM,KAAK,CAAC;AAAA,IAC3C;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,sBAAsB,KAA0B;AACvD,UAAM,YAAY,aAAa,IAAgC;AAC/D,UAAM,WAAW,aAAa,GAAG;AACjC,QAAI,cAAc,UAAa,aAAa,UAAa,cAAc,UAAU;AAChF,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,IACD;AAAA,EACD;AAAA,EAEQ,QACP,SACA,IACA,OAAyC,CAAC,GAChC;AAEV,QAAI,KAAK,OAAO,aAAa,UAAa,CAAC,KAAK;AAC/C,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,QAAI,KAAK,MAAM;AACd,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,QAAI,KAAK,MAAM;AACd,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,QAAI,QAAQ,SAAS,IAAgC;AACpD,YAAM,IAAI,MAAM,mDAAmD;AACpE,UAAM,UAAU,KAAK,MAAM;AAC3B,UAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC;AACxD,eAAW,KAAK,OAAO;AACtB,UAAI,KAAK,mBAAmB,GAAG,IAAgC;AAC9D,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,UAAI,EAAE,OAAO,aAAa,UAAa,CAAC,EAAE,MAAM;AAC/C,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,WAAK,sBAAsB,CAAC;AAAA,IAC7B;AAEA,QACC,yBAAyB,MAAM,MAAM;AACpC,WAAK,QAAQ,SAAS,IAAI,EAAE,GAAG,MAAM,oBAAoB,KAAK,CAAC;AAAA,IAChE,CAAC,GACA;AACD,aAAO;AAAA,IACR;AACA,QAAI,CAAC,KAAK,WAAW,UAAW,MAAK,6BAA6B;AAElE,SAAK,MAAM,gBAAgB;AAC3B,SAAK,MAAM,mBAAmB;AAC9B,QAAI,iBAAiB;AACrB,QAAI;AAMH,YAAM,YAAY,KAAK,MAAM;AAC7B,WAAK,MAAM,SAAS,KAAK,MAAM,WAAW,SAAS,IAAI,KAAK,MAAM,IAAI;AACtE,UAAI,cAAc,KAAM,MAAK,MAAM,WAAW,WAAW,SAAS;AAElE,YAAM,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC;AAC1D,UAAI,0BAA0B;AAC9B,iBAAW,KAAK,SAAS;AACxB,cAAM,SAAS,QAAQ,QAAQ,CAAC;AAChC,YAAI,KAAK,KAAK,MAAM,MAAM,GAAG;AAC5B,oCAA0B;AAC1B,eAAK,MAAM;AAAA,QACZ;AACA,YAAI,KAAK,WAAW,WAAW;AAC9B,gBAAM,MAAM,KAAK,KAAK,SAAS,MAAM;AACrC,cAAI,IAAK,KAAI,IAAI;AACjB,gBAAM,QAAQ,KAAK,KAAK,OAAO,MAAM;AACrC,cAAI,MAAO,OAAM;AAAA,QAClB;AAAA,MACD;AAIA,YAAM,IAAI,QAAQ;AAClB,YAAM,WAAoC,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAChE,YAAM,UAAqB,IAAI,MAAM,CAAC,EAAE,KAAK,QAAQ;AACrD,YAAM,aAAwB,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AACrD,YAAM,WAAsB,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AACnD,YAAM,UAAoB,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAC7C,YAAM,cAAiD,IAAI,MAAM,CAAC,EAAE,KAAK,MAAS;AAClF,YAAM,mBAAsD,IAAI,MAAM,CAAC,EAAE,KAAK,MAAS;AACvF,YAAM,YAA+B,IAAI,MAAM,CAAC;AAChD,YAAM,WAAiC,IAAI,MAAM,CAAC;AAClD,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,cAAM,SAAS,QAAQ,QAAQ,QAAQ,CAAC,CAAC;AACzC,YAAI,WAAW,IAAI;AAClB,mBAAS,CAAC,IAAI,KAAK,KAAK,MAAM,MAAM;AACpC,kBAAQ,CAAC,IAAI,KAAK,KAAK,KAAK,MAAM;AAClC,qBAAW,CAAC,IAAI,KAAK,KAAK,QAAQ,MAAM;AACxC,mBAAS,CAAC,IAAI,KAAK,KAAK,MAAM,MAAM;AACpC,kBAAQ,CAAC,IAAI,KAAK,KAAK,KAAK,MAAM;AAClC,sBAAY,CAAC,IAAI,KAAK,KAAK,SAAS,MAAM;AAC1C,oBAAU,CAAC,IAAI,KAAK,KAAK,OAAO,MAAM;AAEtC,gBAAM,MAAM,KAAK,KAAK,SAAS,MAAM;AACrC,cAAI,IAAK,KAAI,IAAI;AACjB,mBAAS,CAAC,IAAI;AAAA,QACf;AAAA,MACD;AACA,WAAK,MAAM,OAAO;AAClB,WAAK,KAAK,QAAQ;AAClB,WAAK,KAAK,OAAO;AACjB,WAAK,KAAK,UAAU;AACpB,WAAK,KAAK,QAAQ;AAClB,WAAK,KAAK,OAAO;AACjB,WAAK,KAAK,WAAW;AACrB,WAAK,KAAK,gBAAgB;AAC1B,WAAK,KAAK,SAAS;AACnB,WAAK,KAAK,WAAW;AACrB,WAAK,KAAK,WAAW,QAAQ,IAAI,MAAM,CAAC,CAAC;AACzC,WAAK,KAAK,aAAa,IAAI,MAAM,QAAQ,MAAM,EAAE,KAAK,MAAS;AAC/D,WAAK,WAAW;AAIhB,UAAI,KAAK,WAAW,WAAW;AAC9B,mBAAW,KAAK,MAAO,MAAK,gBAAgB,CAAC;AAAA,MAC9C;AACA,gCAA0B,MAAkC,SAAS,OAAO;AAO5E,UAAI,2BAA2B,KAAK,MAAM,YAAY,KAAK,KAAK,OAAO,WAAW,SAAS;AAC1F,YAAI,QAAQ,SAAS,EAAG,MAAK,MAAM,mBAAmB;AAAA,YACjD,kBAAiB;AAAA,MACvB;AAAA,IACD,UAAE;AACD,WAAK,MAAM,gBAAgB;AAAA,IAC5B;AAKA,QAAI,KAAK,MAAM,kBAAkB;AAChC,WAAK,MAAM,mBAAmB;AAC9B,WAAK,cAAc;AAAA,IACpB,WAAW,gBAAgB;AAC1B,UAAI,KAAK,MAAM,qBAAsB,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,UACzD,MAAK,OAAO,SAAS,KAAK,OAAO,UAAU,YAAY;AAAA,IAC7D;AACA,WAAO;AAAA,EACR;AAAA;AAAA,EAIQ,YAAkB;AACzB,SAAK,WAAW,YAAY;AAC5B,UAAM,mBAAmB,KAAK;AAC9B,SAAK,6BAA6B;AAGlC,SAAK,KAAK,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK,MAAM;AACnD,SAAK,KAAK,WAAW,IAAI,MAAM,KAAK,MAAM,KAAK,MAAM;AACrD,eAAW,OAAO,KAAK,MAAM;AAC5B,WAAK,gBAAgB,KAAK,EAAE,cAAc,iBAAiB,CAAC;AAE7D,QAAI,KAAK,MAAM,KAAK,WAAW,KAAK,KAAK,MAAM,WAAW,QAAQ,CAAC,KAAK,MAAM,iBAAiB;AAC9F,WAAK,SAAS;AAAA,IACf;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,gBAAgB,SAAwB,OAAmC,CAAC,GAAS;AAC5F,UAAM,OAAO,KAAK,MAAM,KAAK,QAAQ,OAAO;AAC5C,UAAM,MAAM,EAAE,GAAG,KAAK;AACtB,QAAI,oBAAoB,KAAK,iBAAiB;AAC9C,QAAI,qBAAqB,SAAS,IAAI;AACrC,WAAK,mBAAmB,MAAM,OAAO;AACrC,UAAI,QAAQ,OAAO,aAAa,UAAa,CAAC,QAAQ,MAAM,gBAAgB;AAC3E,aAAK,KAAK,OAAO,IAAI,IAAI,MAAM;AAAA,QAAC;AAChC,aAAK,KAAK,SAAS,IAAI,IAAI;AAC3B;AAAA,MACD;AAAA,IACD;AACA,UAAM,QAAQ,QAAQ,UAAU,CAAC,KAAK,aAAa;AAClD,UAAI,qBAAqB,aAAa,OAAW;AACjD,UAAI,kBAAmB,qBAAoB;AAC3C,UAAI,IAAI,MAAM,GAAI;AAClB,WAAK,gBAAgB,IAAI,GAAG,KAAK,QAAQ;AAAA,IAC1C,CAAC;AACD,QAAI,qBAAqB,SAAS,MAAM,IAAI,MAAM,GAAI,MAAK,mBAAmB,MAAM,OAAO;AAC3F,wBAAoB;AACpB,QAAI,SAAS,IAAI;AAChB,WAAK,KAAK,OAAO,IAAI,IAAI;AACzB,WAAK,KAAK,SAAS,IAAI,IAAI;AAAA,IAC5B;AAAA,EACD;AAAA,EAEQ,mBAAmB,KAAa,SAA8B;AACrE,UAAM,WAAW,QAAQ,OAAO,WAAW,CAAC,QAAQ,MAAM;AAC1D,SAAK,KAAK,MAAM,GAAG,IAAI;AACvB,SAAK,KAAK,SAAS,GAAG,IAAI,CAAC;AAC3B,SAAK,KAAK,WAAW,GAAG,IAAI;AAC5B,SAAK,KAAK,KAAK,GAAG,IAAI,WAAW,QAAQ,OAAO,QAAQ;AACxD,SAAK,KAAK,QAAQ,GAAG,IAAI;AACzB,SAAK,KAAK,MAAM,GAAG,IAAI;AACvB,SAAK,KAAK,KAAK,GAAG,IAAI,WAAW,IAAI;AACrC,SAAK,KAAK,SAAS,GAAG,IAAI,QAAQ,OAAO;AACzC,SAAK,KAAK,cAAc,GAAG,IAAI;AAAA,EAChC;AAAA,EAEQ,cAAoB;AAC3B,SAAK,WAAW,YAAY;AAC5B,eAAW,KAAK,KAAK,KAAK,OAAQ,KAAI,EAAG,GAAE;AAC3C,SAAK,KAAK,SAAS,CAAC;AACpB,SAAK,KAAK,WAAW,CAAC;AACtB,eAAW,MAAM,KAAK,OAAO,eAAgB,IAAG;AAChD,SAAK,OAAO,iBAAiB,CAAC;AAC9B,SAAK,OAAO,eAAe,CAAC;AAE5B,UAAM,YAAY,KAAK,MAAM,WAAW,QAAQ,KAAK,MAAM,KAAK,SAAS;AACzE,QAAI,WAAW;AAEd,WAAK,OAAO,QAAQ;AACpB,WAAK,OAAO,UAAU;AACtB,WAAK,OAAO,SAAS;AAAA,IACtB;AACA,SAAK,eAAe;AACpB,SAAK,MAAM,kBAAkB;AAC7B,SAAK,SAAS,aAAa,MAAM;AACjC,SAAK,SAAS,cAAc,CAAC;AAC7B,SAAK,SAAS,wBAAwB;AACtC,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,gBAAgB;AAC9B,SAAK,OAAO,aAAa,CAAC;AAC1B,QAAI,CAAC,KAAK,cAAc,QAAS,MAAK,cAAc,QAAQ;AAAA,EAC7D;AAAA,EAEQ,mBAAmB,IAAkB;AAC5C,QAAI,KAAK;AACR,YAAM,IAAI,MAAM,GAAG,EAAE,0DAA0D;AAAA,EACjF;AAAA,EAEQ,mBAA2B;AAClC,WAAO,KAAK,WAAW,YAAY;AAAA,EACpC;AAAA,EAEQ,gCAAyC;AAChD,WACC,CAAC,KAAK,aACN,KAAK,OAAO,WAAW,WACvB,KAAK,OAAO,WAAW,aACvB,KAAK,MAAM,YAAY,KACvB,CAAC,KAAK,MAAM,iBACZ,CAAC,KAAK,MAAM,iBACZ,CAAC,KAAK,MAAM,oBACZ,CAAC,KAAK,MAAM,kBACZ,KAAK,KAAK,MAAM,MAAM,CAAC,UAAU,CAAC,KAAK,KACvC,KAAK,SAAS,YAAY,WAAW,KACrC,CAAC,KAAK,SAAS,yBACf,KAAK,SAAS,eAAe,UAC7B,KAAK,SAAS,eAAe,UAC7B,CAAC,KAAK,SAAS,mBACf,KAAK,SAAS,aAAa,SAAS;AAAA,EAEtC;AAAA,EAEQ,kBAAwB;AAC/B,QAAI,KAAK,UAAW;AACpB,SAAK,YAAY;AACjB,kBAAc,IAAI,IAAqB;AACvC,QAAI;AACJ,UAAM,qBAAqB,CAAC,UAAyB;AACpD,UAAI,iBAAiB,OAAW,gBAAe;AAAA,IAChD;AACA,SAAK,WAAW,YAAY;AAC5B,eAAW,KAAK,KAAK,KAAK,QAAQ;AACjC,UAAI;AACH,UAAE;AAAA,MACH,SAAS,OAAO;AACf,2BAAmB,KAAK;AAAA,MAEzB;AAAA,IACD;AACA,eAAW,MAAM,KAAK,OAAO,gBAAgB;AAC5C,UAAI;AACH,WAAG;AAAA,MACJ,SAAS,OAAO;AACf,2BAAmB,KAAK;AAAA,MAEzB;AAAA,IACD;AACA,SAAK,KAAK,SAAS,CAAC;AACpB,SAAK,KAAK,WAAW,CAAC;AACtB,SAAK,WAAW,YAAY,MAAM;AAClC,QAAI,KAAK,MAAM,WAAW,MAAM;AAC/B,WAAK,MAAM,WAAW,WAAW,KAAK,MAAM,MAAM;AAClD,WAAK,MAAM,SAAS;AAAA,IACrB;AACA,SAAK,MAAM,OAAO,CAAC;AACnB,SAAK,KAAK,QAAQ,CAAC;AACnB,SAAK,KAAK,WAAW,CAAC;AACtB,SAAK,KAAK,aAAa,CAAC;AACxB,SAAK,KAAK,OAAO,CAAC;AAClB,SAAK,KAAK,UAAU,CAAC;AACrB,SAAK,KAAK,QAAQ,CAAC;AACnB,SAAK,KAAK,OAAO,CAAC;AAClB,SAAK,KAAK,WAAW,CAAC;AACtB,SAAK,KAAK,gBAAgB,CAAC;AAC3B,SAAK,OAAO,QAAQ;AACpB,SAAK,OAAO,UAAU;AACtB,SAAK,OAAO,SAAS;AACrB,SAAK,OAAO,WAAW;AACvB,SAAK,OAAO,aAAa,CAAC;AAC1B,SAAK,cAAc,QAAQ;AAC3B,SAAK,cAAc,UAAU;AAC7B,SAAK,WAAW;AAChB,SAAK,eAAe;AACpB,SAAK,OAAO,iBAAiB,CAAC;AAC9B,SAAK,OAAO,eAAe,CAAC;AAC5B,SAAK,SAAS,aAAa,MAAM;AACjC,SAAK,SAAS,cAAc,CAAC;AAC7B,SAAK,SAAS,wBAAwB;AACtC,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,gBAAgB;AAC9B,SAAK,6BAA6B;AAClC,sBAAkB,OAAO,IAAqB;AAC9C,mBAAe,OAAO,IAAqB;AAC3C,qBAAiB,OAAO,IAAqB;AAC7C,6BAAyB,OAAO,IAAqB;AACrD,2BAAuB,OAAO,IAAqB;AACnD,sBAAkB,OAAO,IAAqB;AAC9C,gBAAY,OAAO,IAAqB;AACxC,iCAA6B,OAAO,IAAqB;AACzD,SAAK,MAAM,YAAY,KAAK,GAAG;AAC/B,QAAI,iBAAiB,OAAW,OAAM;AAAA,EACvC;AAAA,EAEQ,iBAAuB;AAC9B,UAAM,IAAI,KAAK,MAAM,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,WAAK,KAAK,MAAM,CAAC,IAAI;AACrB,WAAK,KAAK,SAAS,CAAC,IAAI,CAAC;AACzB,WAAK,KAAK,WAAW,CAAC,IAAI;AAC1B,WAAK,KAAK,KAAK,CAAC,IAAI;AACpB,WAAK,KAAK,QAAQ,CAAC,IAAI;AACvB,WAAK,KAAK,MAAM,CAAC,IAAI;AACrB,WAAK,KAAK,KAAK,CAAC,IAAI;AACpB,WAAK,KAAK,SAAS,CAAC,IAAI;AACxB,WAAK,KAAK,cAAc,CAAC,IAAI;AAAA,IAC9B;AACA,SAAK,MAAM,UAAU;AACrB,SAAK,MAAM,uBAAuB;AAAA,EACnC;AAAA;AAAA,EAIQ,qBAAqB,KAAa,UAA+C;AACxF,UAAM,QAAQ,UAAU,QAAQ,CAAC;AACjC,QAAI,KAAK,KAAK,WAAW,GAAG,MAAM,OAAO;AACxC,WAAK,KAAK,SAAS,GAAG,EAAE,KAAK,CAAC,CAAC;AAC/B,WAAK,KAAK,WAAW,GAAG,IAAI;AAAA,IAC7B;AACA,WAAO,KAAK,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,SAAS,GAAG,EAAE,SAAS,CAAC;AAAA,EAClE;AAAA,EAEQ,sBAAsB,KAAsB;AACnD,UAAM,aAAa,KAAK,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,SAAS,GAAG,EAAE,SAAS,CAAC;AAC7E,WAAO,YAAY,KAAK,CAAC,MAAM,MAAM,QAAQ,KAAK;AAAA,EACnD;AAAA,EAEQ,gBAAgB,KAAa,KAAc,UAA+B;AACjF,QAAI,KAAK,UAAW;AACpB,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,MAAM,QAAS;AACnB,UAAM,wBAAwB,UAAU,QAAQ;AAGhD,QAAI,KAAK,OAAO,aAAa,QAAW;AACvC,UAAI,MAAM,WAAY,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAC/C;AAAA,IACD;AAEA,QAAI,MAAM,cAAc;AACvB,YAAM,aAAa,KAAK,qBAAqB,KAAK,QAAQ;AAC1D,iBAAW,KAAK,QAAQ;AACxB,UAAI,WAAW,KAAK,CAAC,MAAM,MAAM,QAAQ,KAAK,sBAAuB,MAAK,UAAU;AAGpF,WAAK,KAAK,KAAK,GAAG,IAAI;AACtB,WAAK,KAAK,QAAQ,GAAG,IAAI;AACzB,WAAK,KAAK,MAAM,GAAG,IAAI;AAIvB,UAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,aAAK,KAAK,MAAM,GAAG,IAAI;AACvB,aAAK,MAAM;AAAA,MACZ;AAOA,UAAI,KAAK,SAAS,yBAAyB,KAAK,KAAK,MAAM,MAAM,CAAC,MAAM,MAAM,IAAI,GAAG;AACpF,aAAK,SAAS,wBAAwB;AAAA,MACvC;AACA,YAAM,UAAU,KAAK,OAAO;AAC5B,WAAK,YAAY;AAIjB,UAAI,KAAK,MAAM,YAAY,KAAK,KAAK,MAAM,sBAAsB;AAChE,YAAI,CAAC,QAAS,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,YAClC,MAAK,MAAM,uBAAuB;AAAA,MACxC;AACA,WAAK,uBAAuB;AAC5B;AAAA,IACD;AAEA,QAAI,WAAW,CAAC,GAAG;AAKlB,YAAM,UAAU,MAAM;AACtB,YAAM,aAAa,UAAW,IAAoC,CAAC,IAAI;AACvE,WAAK,KAAK,SAAS,GAAG,IAAI,UAAU,aAAa;AACjD,WAAK,KAAK,cAAc,GAAG,IAAI,UAAU,aAAa;AAKtD,WAAK,iBAAiB,GAAG;AACzB,YAAM,yBAAyB,KAAK,sBAAsB,GAAG,KAAK;AAClE,UAAI,uBAAwB,MAAK,UAAU;AAC3C,UAAI,WAAW,KAAK,MAAM,oBAAoB;AAC7C,aAAK,MAAM,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC;AAAA,MACnC,WAAW,KAAK,MAAM,qBAAqB;AAC1C,YAAI,wBAAwB;AAC3B,eAAK,uBAAuB;AAC5B;AAAA,QACD;AACA,aAAK,UAAU;AAAA,MAChB,WAAW,KAAK,MAAM,4BAA4B,KAAK,iBAAiB,GAAG;AAK1E,aAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,MAC1B,OAAO;AAGN,aAAK,6BAA6B;AAAA,MACnC;AACA,WAAK,uBAAuB;AAC5B;AAAA,IACD;AAEA,QAAI,MAAM,YAAY;AACrB,WAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AACzB;AAAA,IACD;AAEA,QAAI,MAAM,SAAS;AAClB,UAAI,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG;AAC1B,aAAK,KAAK,MAAM,GAAG,IAAI;AACvB,aAAK,MAAM;AACX,aAAK,KAAK,KAAK,GAAG,IAAI;AACtB,aAAK,WAAW;AAAA,MACjB;AACA;AAAA,IACD;AAEA,QAAI,MAAM,QAAQ;AACjB,YAAM,IAAI,IAAI,CAAC;AACf,WAAK,qBAAqB,KAAK,QAAQ,EAAE,KAAK,CAAC;AAC/C,YAAM,IAAI,KAAK,KAAK,MAAM,GAAG;AAC7B,UAAI,MAAM,KAAM,MAAK,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC;AAAA,UACpC,GAAE,KAAK,CAAC;AACb,WAAK,KAAK,KAAK,GAAG,IAAI;AACtB,WAAK,KAAK,QAAQ,GAAG,IAAI;AACzB,WAAK,KAAK,KAAK,GAAG,IAAI;AACtB,UAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,aAAK,KAAK,MAAM,GAAG,IAAI;AACvB,aAAK,MAAM;AAAA,MACZ;AACA,UAAI,sBAAuB,MAAK,UAAU;AAC1C,WAAK,uBAAuB;AAC5B;AAAA,IACD;AAEA,QAAI,MAAM,YAAY;AACrB,WAAK,qBAAqB,KAAK,QAAQ;AACvC,WAAK,KAAK,KAAK,GAAG,IAAI;AACtB,UAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,aAAK,KAAK,MAAM,GAAG,IAAI;AACvB,aAAK,MAAM;AAAA,MACZ;AACA,UAAI,sBAAuB,MAAK,UAAU;AAC1C,WAAK,uBAAuB;AAC5B;AAAA,IACD;AAAA,EAGD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,iBAAiB,KAAmB;AAC3C,QAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,WAAK,KAAK,MAAM,GAAG,IAAI;AACvB,WAAK,MAAM;AAAA,IACZ;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,+BAAqC;AAC5C,QAAI,KAAK,MAAM,YAAY,KAAK,CAAC,KAAK,MAAM,qBAAsB;AAIlE,UAAM,UAAU,KAAK,KAAK,MAAM,KAAK,CAAC,MAAM,MAAM,QAAQ,EAAE,SAAS,CAAC;AACtE,QAAI,QAAS,MAAK,UAAU;AAO5B,QAAI,KAAK,MAAM,qBAAsB,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,EAC/D;AAAA,EAEQ,aAAmB;AAC1B,SAAK,OAAO,SAAS;AAMrB,QAAI,KAAK,aAAa,EAAG;AACzB,QAAI,CAAC,KAAK,MAAM,sBAAsB;AACrC,WAAK,MAAM,uBAAuB;AAClC,WAAK,YAAY,CAAC,OAAO,CAAC;AAAA,IAC3B;AAAA,EACD;AAAA,EAEQ,YAAkB;AAKzB,QAAI,KAAK,MAAM,eAAe;AAC7B,WAAK,MAAM,mBAAmB;AAC9B;AAAA,IACD;AAGA,QAAI,KAAK,MAAM,aAAa,SAAS,KAAK,UAAU,KAAK,KAAK,aAAa,IAAI;AAC9E,WAAK,SAAS,wBAAwB;AACtC;AAAA,IACD;AACA,SAAK,QAAQ;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,gBAAsB;AAC7B,QAAI,KAAK,MAAM,aAAa,QAAQ,KAAK,UAAU,GAAG;AACrD,WAAK,SAAS,wBAAwB;AACtC;AAAA,IACD;AACA,QAAI,KAAK,MAAM,UAAU,EAAG;AAC5B,QAAI,KAAK,MAAM,WAAW,MAAM;AAC/B,WAAK,iBAAiB;AACtB;AAAA,IACD;AACA,QAAI,CAAC,KAAK,MAAM,mBAAmB,EAAE,KAAK,MAAM,WAAW,KAAK,gBAAgB,GAAI;AACpF,SAAK,WAAW;AAChB,SAAK,SAAS;AAAA,EACf;AAAA,EAEQ,UAAgB;AACvB,QAAI,KAAK,MAAM,UAAU,EAAG;AAC5B,QAAI,KAAK,MAAM,WAAW,MAAM;AAE/B,WAAK,iBAAiB;AACtB;AAAA,IACD;AACA,QAAI,CAAC,KAAK,MAAM,iBAAiB;AAChC,UAAI,KAAK,MAAM,WAAW,KAAK,gBAAgB,EAAG,MAAK,SAAS;AAEhE;AAAA,IACD;AACA,SAAK,SAAS;AAAA,EACf;AAAA,EAEQ,kBAA2B;AAClC,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK,QAAQ,KAAK;AAChD,UAAI,KAAK,KAAK,QAAQ,CAAC,EAAG;AAC1B,UAAI,KAAK,MAAM,uBAAuB,KAAK,KAAK,SAAS,CAAC,MAAM,OAAW;AAC3E,aAAO;AAAA,IACR;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,mBAAyB;AAEhC,UAAM,IAAI,KAAK,KAAK,MAAM,CAAC;AAC3B,QAAI,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC/B,WAAK,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;AAAA,IACvC,WAAW,KAAK,MAAM,sBAAsB;AAO3C,WAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IAC1B;AACA,SAAK,KAAK,MAAM,CAAC,IAAI;AACrB,SAAK,MAAM,uBAAuB;AAAA,EACnC;AAAA,EAEQ,WAAiB;AAOxB,QAAI,KAAK,MAAM;AACd,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,SAAK,MAAM,kBAAkB;AAM7B,SAAK,OAAO,eAAe,CAAC;AAC5B,SAAK,OAAO,iBAAiB,CAAC;AAC9B,UAAM,MAAM,KAAK,UAAU;AAC3B,UAAM,WAAW,KAAK,MAAM;AAC5B,SAAK,MAAM,wBAAwB;AACnC,SAAK,MAAM,gBAAgB;AAC3B,QAAI;AACH,WAAK,MAAM,WAAW,OAAO,KAAK,MAAM,QAAkB,GAAG;AAAA,IAC9D,UAAE;AACD,WAAK,MAAM,gBAAgB;AAAA,IAC5B;AAWA,QACC,YACA,CAAC,KAAK,MAAM,yBACZ,KAAK,OAAO,aAAa,UACzB,CAAC,KAAK,aAAa,GAClB;AACD,WAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IAC1B;AAGA,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,MAAM,QAAQ,KAAK;AAChD,WAAK,KAAK,MAAM,CAAC,IAAI;AACrB,WAAK,KAAK,SAAS,CAAC,IAAI,CAAC;AACzB,WAAK,KAAK,WAAW,CAAC,IAAI;AAC1B,WAAK,KAAK,cAAc,CAAC,IAAI;AAAA,IAC9B;AACA,SAAK,MAAM,uBAAuB;AAAA,EACnC;AAAA;AAAA,EAIQ,YAAiB;AACxB,UAAM,OAAO,KAAK,MAAM,SACrB,KAAK,MAAM,WAAW,SAAS,KAAK,MAAM,OAAO,MAAM,IACvD;AACH,QAAI,SAAS,QAAQ;AACpB,UAAI,KAAK,aAAa,KAAM,MAAK,WAAW,KAAK,SAAS;AAC1D,WAAK,YAAY,KAAK,QAAQ;AAC9B,aAAO,KAAK;AAAA,IACb;AAEA,WAAO,KAAK,SAAS;AAAA,MACpB,UAAU,KAAK,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,MACpE,UAAU,KAAK,KAAK,cAAc,IAAI,YAAY;AAAA,MAClD,QAAQ,CAAC,GAAG,KAAK,KAAK,IAAI;AAAA,IAC3B,CAAC;AAAA,EACF;AAAA,EAEQ,SAAS,UAIT;AACP,UAAM,MAAW;AAAA;AAAA;AAAA;AAAA,MAIhB,IAAI,CAAC,MAAM,cAAc;AACxB,YAAI,KAAK,UAAW;AACpB,kBAAU;AACV,YAAI;AACH,eAAK,IAAI,MAAM,SAAS;AAAA,QACzB,UAAE;AACD,mBAAS;AAAA,QACV;AAAA,MACD;AAAA,MACA,MAAM,CAAC,SAAS;AACf,YAAI,KAAK,UAAW;AACpB,kBAAU;AACV,YAAI;AACH,eAAK,MAAM,IAAI;AAAA,QAChB,UAAE;AACD,mBAAS;AAAA,QACV;AAAA,MACD;AAAA,MACA,UAAU,UAAU,YAAY,KAAK,KAAK;AAAA,MAC1C,UAAU,UAAU,YAAY,KAAK,KAAK,cAAc,IAAI,YAAY;AAAA,MACxE,OAAO,KAAK,WAAW;AAAA,MACvB,gBAAgB,CAAC,OAAO;AACvB,YAAI,KAAK,UAAW;AACpB,aAAK,OAAO,eAAe,KAAK,EAAE;AAAA,MACnC;AAAA,MACA,cAAc,CAAC,OAAO;AACrB,YAAI,KAAK,UAAW;AACpB,aAAK,OAAO,aAAa,KAAK,EAAE;AAAA,MACjC;AAAA,MACA,aAAa,MAAM,KAAK,MAAM;AAAA;AAAA,MAE9B,YAAY;AAAA,QACX,cAAc,CAAC,KAAK,OAAO,KAAK,mBAAmB,EAAE,MAAM,OAAO,KAAK,GAAG,CAAC;AAAA,QAC3E,gBAAgB,CAAC,KAAK,OAAO,KAAK,mBAAmB,EAAE,MAAM,UAAU,KAAK,GAAG,CAAC;AAAA,QAChF,aAAa,CAAC,MAAM,OAAO,KAAK,mBAAmB,EAAE,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,MAC7E;AAAA;AAAA;AAAA;AAAA,MAIA,QAAQ,CAAC,MAAM,cAAc,KAAK,eAAe,MAAM,SAAS;AAAA,MAChE,GAAI,KAAK,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,MAAM,KAAK,SAAS,WAAW;AAAA,MACnF,CAAC,aAAa,GAAG,EAAE,QAAQ,UAAU,UAAU,KAAK,KAAK,KAAK;AAAA,MAC9D,CAAC,gBAAgB,GAAG;AAAA,QACnB,YAAY,KAAK,MAAM;AAAA,QACvB,QAAQ,CAAI,YACX,uBAAuB,KAAK,MAAM,aAAa,MAAM,aAAa,KAAK,OAAO,OAAO,CAAC;AAAA,MACxF;AAAA,IACD;AACA,QAAI,KAAK,MAAM,SAAS;AAIvB,UAAI,QAAQ,CAAC,MAAc,IAAI,aAAa,GAAG,OAAO,CAAC;AAAA,IACxD;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,YAAY,KAAgB;AACnC,IAAC,IAA+B,WAAW,KAAK,KAAK;AACrD,IAAC,IAAmC,WAAW,KAAK,KAAK,cAAc,IAAI,YAAY;AACvF,QAAI,KAAK,SAAS,eAAe,QAAW;AAC3C,aAAQ,IAA8B;AAAA,IACvC,OAAO;AACN,MAAC,IAA8B,OAAO,KAAK,SAAS;AAAA,IACrD;AACA,QAAI,aAAa,IAAI,EAAE,QAAQ,KAAK,KAAK,KAAK;AAAA,EAC/C;AAAA,EAEQ,aAAuB;AAC9B,WAAO;AAAA,MACN,KAAK,MAAS,KAAK,cAAc;AAAA,MACjC,KAAK,CAAI,MAAS;AACjB,aAAK,cAAc,QAAQ;AAAA,MAC5B;AAAA,MACA,SAAS,CAAC,KAAK,SAAS;AACvB,aAAK,cAAc,UAAU;AAAA,MAC9B;AAAA,IACD;AAAA,EACD;AAAA;AAAA,EAIQ,MAAM,MAAkB;AAC/B,QAAI,KAAK,UAAW;AACpB,yBAAqB,IAAI;AACzB,UAAM,eAAe,CAAC;AACtB,UAAM,8BAA8B,CAAC,SAA6B;AACjE,iBAAW,KAAK,MAAM;AACrB,YAAI,EAAE,CAAC,MAAM,OAAQ,iCAAgC,KAAK,SAAS,QAAQ,EAAE,CAAC,CAAC;AAAA,MAChF;AAAA,IACD;AACA,UAAM,sBAAsB,CAAC,SAC5B,KAAK;AAAA,MAAI,CAAC,MACT,EAAE,CAAC,MAAM,SACL,CAAC,QAAQ,wBAAwB,KAAK,SAAS,QAAQ,EAAE,CAAC,CAAC,CAAC,IAC7D;AAAA,IACJ;AACD,gCAA4B,IAAI;AAUhC,QAAI,KAAK,OAAO,aAAa,QAAW;AACvC,UAAI,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,UAAU,EAAG;AAC5C,WAAK,OAAO,cAAc;AAC1B,UAAI,KAAK,MAAM,iBAAiB;AAC/B,aAAK,OAAO,QAAQ;AACpB,aAAK,OAAO,UAAU;AAAA,MACvB;AACA,WAAK,YAAY,CAAC,UAAU,GAAG,EAAE,MAAM,cAAc,MAAM,KAAK,CAAC;AACjE;AAAA,IACD;AACA,QAAI,SAAoB,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,YAAY,EAAE,CAAC,CAAC,IAAI,YAAY,EAAE,CAAC,CAAC,CAAC;AAGtF,UAAM,kBAAkB,OAAO,UAAU,CAAC,MAAM,EAAE,CAAC,MAAM,YAAY;AACrE,QAAI,oBAAoB,IAAI;AAC3B,eAAS,OAAO,OAAO,CAAC,GAAG,MAAM,EAAE,CAAC,MAAM,gBAAgB,MAAM,eAAe;AAAA,IAChF;AAIA,UAAM,cAAc,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,UAAU;AAC1D,UAAM,cAAc,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,cAAc,EAAE,CAAC,MAAM,OAAO;AAC9E,QACC,eACA,CAAC,eACD,KAAK,OAAO,aAAa,UACzB,CAAC,KAAK,OAAO,aACZ;AACD,eAAS,CAAC,CAAC,UAAU,GAAG,GAAG,MAAM;AAAA,IAClC;AAIA,QAAI,CAAC,KAAK,MAAM,iBAAiB,aAAa,GAAG;AAChD,YAAM,WAAW,oBAAoB,OAAO,OAAO,CAAC,MAAM,eAAe,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/E,UAAI,SAAS,SAAS,GAAG;AACxB,YAAI,CAAC,KAAK,MAAM,sBAAsB;AACrC,eAAK,MAAM,uBAAuB;AAClC,eAAK,OAAO,SAAS;AACrB,eAAK,YAAY,CAAC,OAAO,GAAG,EAAE,MAAM,cAAc,MAAM,MAAM,CAAC;AAAA,QAChE;AACA,aAAK,MAAM,iBAAiB;AAC5B,qBAAa,MAAM,QAAQ;AAC3B;AAAA,MACD;AAAA,IACD;AAIA,QAAI,KAAK,qBAAqB,GAAG;AAChC,YAAM,WAAW,oBAAoB,OAAO,OAAO,CAAC,MAAM,oBAAoB,EAAE,CAAC,CAAC,CAAC,CAAC;AACpF,UAAI,SAAS,SAAS,GAAG;AAIxB,aAAK,MAAM,wBAAwB;AACnC,aAAK,SAAS,YAAY,KAAK,QAAQ;AAAA,MACxC;AACA,eAAS,OAAO,OAAO,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;AACxD,UAAI,OAAO,WAAW,EAAG;AAAA,IAC1B;AACA,QAAI,YAAY;AAChB,QAAI,WAAW;AACf,QAAI,cAAc;AAClB,eAAW,KAAK,QAAQ;AACvB,UAAI,EAAE,CAAC,MAAM,OAAQ;AACrB,UAAI,EAAE,CAAC,MAAM,WAAY,eAAc;AACvC,UAAI,YAAY,EAAE,CAAC,CAAC,EAAG,YAAW;AAAA,IACnC;AAGA,QAAI,aAAa,KAAK,aAAa;AAClC,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,IACD;AACA,UAAM,kBAAkD,IAAI,MAAM,OAAO,MAAM;AAC/E,QAAI,YAAY,GAAG;AAClB,UAAI,iBAAiB,KAAK,SAAS;AACnC,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,cAAM,IAAI,OAAO,CAAC;AAClB,YAAI,EAAE,CAAC,MAAM,OAAQ;AACrB,yBAAiB,mBAAmB,gBAAgB,KAAK,SAAS,QAAQ,EAAE,CAAC,CAAC;AAC9E,wBAAgB,CAAC,IAAI;AAAA,MACtB;AAAA,IACD;AAIA,QACC,aACC,CAAC,KAAK,MAAM,iBAAiB,KAAK,SAAS,kBAC5C,CAAC,KAAK,MAAM,sBACX;AACD,WAAK,MAAM,uBAAuB;AAClC,WAAK,OAAO,SAAS;AACrB,WAAK,YAAY,CAAC,OAAO,GAAG,EAAE,MAAM,cAAc,MAAM,MAAM,CAAC;AAAA,IAChE;AAEA,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,YAAM,IAAI,OAAO,CAAC;AAClB,YAAM,WAAW,EAAE,MAAM,cAAc,MAAM,MAAM,OAAO,SAAS,EAAE;AAGrE,UAAI,eAAe,EAAE,CAAC,CAAC,EAAG,MAAK,MAAM,wBAAwB;AAC7D,UAAI,EAAE,CAAC,MAAM,SAAS;AACrB,YAAI,CAAC,KAAK,MAAM,sBAAsB;AACrC,eAAK,MAAM,uBAAuB;AAClC,eAAK,OAAO,SAAS;AACrB,eAAK,YAAY,CAAC,OAAO,GAAG,QAAQ;AAAA,QACrC;AACA;AAAA,MACD;AACA,UAAI,EAAE,CAAC,MAAM,QAAQ;AACpB,cAAM,IAAI,EAAE,CAAC;AAIb,aAAK,OAAO,QAAQ;AACpB,aAAK,OAAO,UAAU;AACtB,aAAK,OAAO,SAAS;AACrB,aAAK,SAAS,QAAQ,gBAAgB,CAAC;AACvC,YAAI,KAAK,MAAM,UAAU,GAAG;AAC3B,eAAK,OAAO,WAAW,KAAK,CAAC;AAC7B,cAAI,KAAK,OAAO,WAAW,SAAS,KAAK,MAAM,QAAS,MAAK,OAAO,WAAW,MAAM;AAAA,QACtF;AACA,aAAK,YAAY,CAAC,QAAQ,CAAC,GAAG,QAAQ;AACtC;AAAA,MACD;AACA,UAAI,EAAE,CAAC,MAAM,YAAY;AACxB,aAAK,OAAO,SAAS,KAAK,OAAO,UAAU,aAAa;AACxD,aAAK,YAAY,CAAC,UAAU,GAAG,QAAQ;AACvC;AAAA,MACD;AACA,UAAI,EAAE,CAAC,MAAM,cAAc;AAC1B,aAAK,YAAY,QAAQ;AACzB;AAAA,MACD;AACA,UAAI,EAAE,CAAC,MAAM,YAAY;AACxB,YAAI,KAAK,OAAO,aAAa,OAAW;AACxC,aAAK,OAAO,WAAW;AACvB,aAAK,SAAS,cAAc,CAAC;AAC7B,aAAK,OAAO,SAAS;AACrB,aAAK,YAAY,CAAC,UAAU,GAAG,QAAQ;AACvC;AAAA,MACD;AACA,UAAI,EAAE,CAAC,MAAM,SAAS;AACrB,YAAI,KAAK,OAAO,aAAa,OAAW;AACxC,aAAK,OAAO,WAAW,EAAE,CAAC;AAC1B,aAAK,SAAS,cAAc,CAAC;AAC7B,aAAK,OAAO,SAAS;AACrB,aAAK,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,QAAQ;AAC1C;AAAA,MACD;AACA,UAAI,EAAE,CAAC,MAAM,YAAY;AACxB,aAAK,OAAO,cAAc;AAC1B,YAAI,KAAK,MAAM,iBAAiB;AAC/B,eAAK,OAAO,QAAQ;AACpB,eAAK,OAAO,UAAU;AAAA,QACvB;AACA,aAAK,YAAY,CAAC,UAAU,GAAG,QAAQ;AAAA,MACxC;AAAA,IAED;AAEA,QAAI,CAAC,KAAK,MAAM,cAAe,MAAK,MAAM,uBAAuB;AAAA,EAClE;AAAA,EAEQ,IAAI,MAAY,WAAoB,OAA4B;AACvE,QAAI,KAAK,UAAW;AACpB,UAAM,aAAa,SAAS,EAAE,aAAa,oBAAI,IAAI,EAAE;AACrD,eAAW,KAAK,MAAM;AACrB,UAAI,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG;AACvB,cAAM,IAAI;AAAA,UACT,WAAW,EAAE,CAAC,CAAC,uBAAuB,YAAY,EAAE,CAAC,CAAC,CAAC;AAAA,QACxD;AAAA,MACD;AAAA,IACD;AACA,eAAW,KAAK,MAAM;AACrB,UAAI,EAAE,CAAC,MAAM,SAAS;AAGrB,aAAK,cAAc,EAAE,CAAC,CAAC;AAAA,MACxB,WAAW,EAAE,CAAC,MAAM,UAAU;AAE7B,YAAI,KAAK,SAAS,aAAa,IAAI,EAAE,CAAC,CAAC,GAAG;AAEzC,eAAK,cAAc,EAAE,CAAC,CAAC;AAAA,QACxB,OAAO;AAEN,eAAK,WAAW,GAAG,WAAW,UAAU;AAAA,QACzC;AAAA,MACD,WAAW,EAAE,CAAC,MAAM,QAAQ;AAE3B,cAAM,SAAS,oBAAoB,EAAE,CAAC,CAAC;AACvC,YAAI,KAAK,MAAM,QAAQ,OAAO,WAAW,KAAK,MAAM,UAAU;AAC7D,cAAI,CAAC,KAAK,kBAAkB,OAAO,QAAQ,UAAU,EAAG,MAAK,UAAU,MAAM;AAAA,QAC9E,OAAO;AACN,eAAK,WAAW,CAAC,QAAQ,MAAM,GAAG,WAAW,UAAU;AAAA,QACxD;AAAA,MACD,WAAW,KAAK,MAAM,KAAK,WAAW,GAAG;AASxC,YAAI,EAAE,CAAC,MAAM,aAAc,MAAK,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;AAAA,MACvD,OAAO;AAEN,aAAK,WAAW,GAAG,WAAW,UAAU;AAAA,MACzC;AAAA,IACD;AAAA,EACD;AAAA,EAEQ,kBAAkB,QAAgB,OAA8B;AACvE,QAAI,UAAU,MAAM,YAAY,IAAI,MAAM;AAC1C,QAAI,YAAY,QAAW;AAC1B,gBAAU,oBAAI,IAAI;AAClB,YAAM,YAAY,IAAI,QAAQ,OAAO;AAAA,IACtC;AACA,QAAI,QAAQ,IAAI,IAAgC,EAAG,QAAO;AAC1D,YAAQ,IAAI,IAAgC;AAC5C,WAAO;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUQ,WAAW,GAAY,WAA+B,OAA2B;AACxF,QAAI,KAAK,MAAM,KAAK,WAAW,EAAG;AAClC,QAAI,cAAc,QAAW;AAC5B,YAAM,IAAI,KAAK,MAAM,KAAK,SAAS;AACnC,UAAI,MAAM,OAAW,GAAE,IAAI,CAAC,CAAC,GAAG,QAAW,KAAK;AAAA,IACjD,OAAO;AACN,iBAAW,OAAO,KAAK,MAAM,KAAM,KAAI,IAAI,CAAC,CAAC,GAAG,QAAW,KAAK;AAAA,IACjE;AAAA,EACD;AAAA;AAAA,EAIQ,YAAqB;AAC5B,WAAO,KAAK,SAAS,aAAa,OAAO;AAAA,EAC1C;AAAA,EAEQ,wBAAiC;AACxC,QAAI,KAAK,MAAM,aAAa,MAAO,QAAO;AAC1C,WAAO,KAAK,SAAS,aAAa,OAAO;AAAA,EAC1C;AAAA,EAEQ,eAAwB;AAC/B,WACC,KAAK,MAAM,WAAW,QACtB,KAAK,MAAM,WAAW,SAAS,KAAK,MAAM,OAAO,MAAM,MAAM;AAAA,EAE/D;AAAA,EAEQ,cAAc,QAAuB;AAC5C,SAAK,SAAS,aAAa,IAAI,MAAM;AAAA,EACtC;AAAA,EAEQ,cAAc,QAAuB;AAC5C,QAAI,CAAC,KAAK,SAAS,aAAa,IAAI,MAAM,EAAG;AAC7C,SAAK,SAAS,aAAa,OAAO,MAAM;AAGxC,QAAI,KAAK,MAAM,QAAQ,KAAK,SAAS,eAAe,OAAW,MAAK,uBAAuB;AAC3F,QAAI,KAAK,sBAAsB,EAAG;AAClC,0BAAsB,KAAK,KAAK;AAChC,QAAI,KAAK,MAAM,KAAM;AACrB,SAAK,UAAU;AAAA,EAChB;AAAA,EAEQ,YAAkB;AAGzB,QAAI,KAAK,OAAO,aAAa,QAAW;AACvC,WAAK,SAAS,cAAc,CAAC;AAC7B,WAAK,SAAS,wBAAwB;AACtC,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,gBAAgB;AAC9B;AAAA,IACD;AAIA,QAAI,KAAK,SAAS,YAAY,SAAS,GAAG;AACzC,YAAM,MAAM,KAAK,SAAS;AAC1B,WAAK,SAAS,cAAc,CAAC;AAC7B,iBAAW,QAAQ,IAAK,MAAK,MAAM,IAAI;AAAA,IACxC;AACA,QAAI,KAAK,SAAS,uBAAuB;AACxC,WAAK,SAAS,wBAAwB;AACtC,WAAK,QAAQ;AAAA,IACd;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,iBAA0B;AACjC,QAAI,KAAK,OAAO,aAAa,UAAa,KAAK,MAAM,UAAU,EAAG,QAAO;AACzE,WAAO,KAAK,SAAS,aAAa,SAAS;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,mBAAmB,QAA0B;AACpD,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,kBAAkB;AAChC,QAAI;AACH,WAAK,gBAAgB;AAAA,IACtB,UAAE;AACD,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,kBAAkB;AAAA,IACjC;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,UAAU,QAA0B;AAC3C,QAAI,KAAK,SAAS,gBAAiB;AACnC,QAAI,KAAK,eAAe,EAAG,MAAK,mBAAmB,MAAM;AAAA,QACpD,MAAK,SAAS,aAAa;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,kBAAwB;AAC/B,QAAI,gBAAgB;AACpB,QAAI,KAAK,SAAS,YAAY,SAAS,GAAG;AACzC,YAAM,MAAM,KAAK,SAAS;AAC1B,WAAK,SAAS,cAAc,CAAC;AAC7B,iBAAW,QAAQ,IAAK,MAAK,MAAM,IAAI;AACvC,sBAAgB;AAAA,IACjB;AACA,QAAI,cAAe;AACnB,QAAI,KAAK,SAAS,uBAAuB;AAMxC,YAAM,QACL,KAAK,MAAM,WAAW,QACtB,CAAC,KAAK,MAAM,mBACZ,EAAE,KAAK,MAAM,WAAW,KAAK,gBAAgB;AAC9C,UAAI,KAAK,MAAM,UAAU,KAAK,MAAO;AACrC,WAAK,SAAS,wBAAwB;AACtC,WAAK,MAAM,uBAAuB;AAClC,WAAK,SAAS,gBAAgB;AAC9B,UAAI;AACH,aAAK,QAAQ;AAAA,MACd,UAAE;AACD,aAAK,SAAS,gBAAgB;AAAA,MAC/B;AACA;AAAA,IACD;AACA,QAAI,KAAK,MAAM,WAAW,MAAM;AAC/B,UAAI,CAAC,KAAK,MAAM,mBAAmB,EAAE,KAAK,MAAM,WAAW,KAAK,gBAAgB,GAAI;AACpF,WAAK,MAAM,uBAAuB;AAClC,WAAK,SAAS,gBAAgB;AAC9B,UAAI;AACH,aAAK,SAAS;AAAA,MACf,UAAE;AACD,aAAK,SAAS,gBAAgB;AAAA,MAC/B;AAAA,IACD;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,yBAA+B;AACtC,QAAI,KAAK,SAAS,gBAAiB;AACnC,QAAI,KAAK,MAAM,QAAQ,KAAK,SAAS,eAAe,UAAa,KAAK,eAAe,GAAG;AACvF,WAAK,mBAAmB,KAAK,SAAS,UAAU;AAAA,IACjD;AAAA,EACD;AAAA;AAAA,EAGQ,uBAAgC;AAGvC,QAAI,KAAK,MAAM,aAAa,MAAO,QAAO;AAC1C,QAAI,CAAC,KAAK,UAAU,KAAK,CAAC,KAAK,aAAa,EAAG,QAAO;AAEtD,QAAI,KAAK,MAAM,aAAa,YAAa,QAAO;AAIhD,QAAI,CAAC,KAAK,MAAM,iBAAiB,KAAK,aAAa,KAAK,KAAK,MAAM,KAAK,SAAS,EAAG,QAAO;AAC3F,WAAO;AAAA,EACR;AAAA;AAAA,EAGQ,YAAY,UAA+B;AAClD,QAAI,CAAC,KAAK,OAAO,QAAS;AAC1B,SAAK,OAAO,QAAQ;AACpB,SAAK,OAAO,UAAU;AACtB,SAAK,OAAO,SAAS;AACrB,SAAK,OAAO,aAAa,CAAC;AAC1B,eAAW,MAAM,KAAK,OAAO,aAAc,IAAG;AAC9C,SAAK,YAAY,CAAC,YAAY,GAAG,QAAQ;AAAA,EAC1C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,mBAA4B;AACnC,QAAI,KAAK,MAAM,KAAK,WAAW,EAAG,QAAO;AACzC,eAAW,MAAM,KAAK,KAAK,SAAU,KAAI,OAAO,OAAW,QAAO;AAClE,WAAO;AAAA,EACR;AAAA;AAAA,EAGQ,kBAAwB;AAC/B,eAAW,KAAK,KAAK,KAAK,OAAQ,KAAI,EAAG,GAAE;AAC3C,SAAK,KAAK,SAAS,CAAC;AACpB,SAAK,KAAK,WAAW,CAAC;AACtB,SAAK,WAAW,YAAY,MAAM;AAClC,SAAK,WAAW,YAAY;AAC5B,SAAK,OAAO,WAAW;AACvB,SAAK,OAAO,cAAc;AAC1B,SAAK,MAAM,kBAAkB;AAC7B,SAAK,eAAe;AACpB,SAAK,SAAS,aAAa,MAAM;AACjC,SAAK,SAAS,cAAc,CAAC;AAC7B,SAAK,SAAS,wBAAwB;AACtC,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,gBAAgB;AAC9B,SAAK,OAAO,aAAa,CAAC;AAC1B,UAAM,YAAY,KAAK,MAAM,WAAW,QAAQ,KAAK,MAAM,KAAK,SAAS;AACzE,QAAI,WAAW;AACd,WAAK,OAAO,QAAQ;AACpB,WAAK,OAAO,UAAU;AACtB,WAAK,OAAO,SAAS;AAAA,IACtB,OAAO;AACN,WAAK,OAAO,SAAS,KAAK,OAAO,UAAU,YAAY;AAAA,IACxD;AACA,QAAI,CAAC,KAAK,cAAc,QAAS,MAAK,cAAc,QAAQ;AAAA,EAC7D;AAAA,EAEQ,YAAY,KAAc,UAA+B;AAChE,QAAI,KAAK,UAAW;AAEpB,UAAM,OAAO,CAAC,GAAG,KAAK,WAAW,WAAW;AAC5C,eAAW,QAAQ,KAAM,MAAK,KAAK,QAAQ;AAAA,EAC5C;AAAA;AAAA,EAGA,oBAAoB,MAAkB;AACrC,SAAK,MAAM,iBAAiB;AAC5B,SAAK,MAAM,IAAI;AAAA,EAChB;AAAA;AAAA,EAGA,oBAA0B;AAGzB,QAAI,KAAK,MAAM,gBAAgB;AAC9B,WAAK,MAAM,iBAAiB;AAC5B,WAAK,MAAM,uBAAuB;AAClC,WAAK,OAAO,SAAS,KAAK,OAAO,UAAU,YAAY;AACvD,WAAK,YAAY,CAAC,UAAU,CAAC;AAAA,IAC9B;AAAA,EACD;AAAA;AAAA,EAGA,gBAAgB,IAAgB,YAA2B;AAC1D,gBAAY,KAAK,OAAO,IAAI;AAAA,MAC3B;AAAA,MACA,SAAS,MAAM,CAAC,KAAK,sBAAsB;AAAA,IAC5C,CAAC;AAAA,EACF;AACD;AASO,SAAS,KACf,OAAwB,CAAC,GACzB,aAAqC,MACrC,OAAuB,CAAC,GACd;AACV,SAAO,IAAI,KAAQ,MAAM,YAAY,IAAI;AAC1C;;;ACriEO,SAAS,iBAAiB,OAAgB,OAAO,KAA0B;AACjF,MAAI;AACH,WAAO,gBAAgB,OAAO,gBAAgB,OAAO,KAAK,CAAC;AAAA,EAC5D,SAAS,OAAO;AACf,UAAM,IAAI,UAAU,wBAAwB,IAAI,kCAAkC;AAAA,MACjF;AAAA,IACD,CAAC;AAAA,EACF;AACD;AAmBA,IAAM,2BAA2B,oBAAI,QAAgD;AAG9E,SAAS,gCACfC,OACA,aACO;AACP,2BAAyB,IAAIA,OAAM,WAAW;AAC/C;;;AC6CO,SAAS,SACf,IACA,MACA,OAA0B,CAAC,GACd;AACb,SAAO,aAAa,IAAI,MAAM,IAAI;AACnC;AAYA,SAAS,aACR,IACA,MACA,MACa;AACb,QAAM,OAAO,eAAe,EAAE;AAK9B,SAAO,IAAI,KAAW,CAAC,GAAG,IAAI,GAAG,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,GAAG,MAAM,GAAG,KAAK,CAAC;AACpF;AAGO,SAAS,eAA0B,IAAiC;AAC1E,SAAO,CAAC,QAAQ;AACf,QAAI;AACH,SAAG,KAAK,GAAG;AAAA,IACZ,SAAS,GAAG;AACX,UAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,8CAA8C,CAAC,CAAC,CAAC;AAAA,IACtF;AAAA,EACD;AACD;;;ACjCA,SAAS,UAAU,GAAqC;AACvD,SAAO,aAAa,CAAC;AACtB;AAEO,SAAS,qBAAqB,OAAc,GAAkB,OAAqB;AACzF,MAAI,sBAAsB,CAAC,GAAG;AAC7B,UAAM,IAAI,MAAM,GAAG,KAAK,oDAAoD;AAAA,EAC7E;AACA,QAAM,WAAW,UAAU,CAAC;AAC5B,MAAI,aAAa,UAAa,aAAa,OAAO;AACjD,UAAM,IAAI;AAAA,MACT,GAAG,KAAK;AAAA,IACT;AAAA,EACD;AACD;;;ACiFO,SAAS,uBAAuB,OAA0C;AAChF,QAAM,SAAmB,CAAC;AAC1B,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAChD,WAAO,EAAE,IAAI,OAAO,QAAQ,CAAC,4BAA4B,EAAE;AAAA,EAC5D;AACA,QAAM,WAAW;AACjB,MAAI,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,WAAW,GAAG;AAChE,WAAO,KAAK,+BAA+B;AAAA,EAC5C;AACA,MAAI,CAAC,OAAO,OAAO,UAAU,SAAS,GAAG;AACxC,WAAO,KAAK,yBAAyB;AAAA,EACtC;AACA,MAAI,OAAO,SAAS,QAAQ,UAAU;AACrC,WAAO,KAAK,sBAAsB;AAAA,EACnC;AACA,QAAM,aAAa,SAAS;AAC5B,MACC,CAAC,OAAO,SAAS,UAAU,KAC3B,eAAe,UACf,aAAa,KACb,aAAa,GACZ;AACD,WAAO,KAAK,8CAA8C;AAAA,EAC3D;AACA,MAAI,CAAC,eAAe,SAAS,MAAM,CAAC,QAAuB,OAAO,QAAQ,QAAQ,GAAG;AACpF,WAAO,KAAK,sCAAsC;AAAA,EACnD;AACA,MAAI,CAAC,eAAe,SAAS,SAAS,CAACC,YAA6B,OAAOA,YAAW,QAAQ,GAAG;AAChG,WAAO,KAAK,yCAAyC;AAAA,EACtD;AACA,MAAI,SAAS,cAAc,UAAa,OAAO,SAAS,cAAc,UAAU;AAC/E,WAAO,KAAK,yCAAyC;AAAA,EACtD;AACA,MAAI,SAAS,YAAY,UAAa,OAAO,SAAS,YAAY,UAAU;AAC3E,WAAO,KAAK,uCAAuC;AAAA,EACpD;AACA,MACC,OAAO,SAAS,cAAc,YAC9B,OAAO,SAAS,YAAY,YAC5B,SAAS,aAAa,SAAS,SAC9B;AACD,WAAO,KAAK,wCAAwC;AAAA,EACrD;AACA,MACC,SAAS,cAAc,UACvB,CAAC;AAAA,IAAe,SAAS;AAAA,IAAW,CAAC,cACpC,OAAO,SAAS,SAAS;AAAA,EAC1B,GACC;AACD,WAAO,KAAK,sDAAsD;AAAA,EACnE;AACA,MAAI,SAAS,qBAAqB,UAAa,OAAO,SAAS,qBAAqB,UAAU;AAC7F,WAAO,KAAK,gDAAgD;AAAA,EAC7D;AACA,MAAI,SAAS,eAAe,UAAa,OAAO,SAAS,eAAe,UAAU;AACjF,WAAO,KAAK,0CAA0C;AAAA,EACvD;AACA,SAAO,EAAE,IAAI,OAAO,WAAW,GAAG,OAAO;AAC1C;AA+DA,SAAS,eAAkB,OAAgB,WAAuD;AACjG,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,KAAK,CAAC,UAAU,MAAM,CAAC,CAAC,EAAG,QAAO;AAAA,EAC9D;AACA,SAAO;AACR;;;AC7HO,IAAM,qCAAqC;AAC3C,IAAM,sCAAsC;AAsiB5C,SAAS,yBACf,QACkC;AAClC,QAAM,SAAS,0BAAiC,QAAQ,CAAC;AACzD,MAAI,OAAO,OAAO,SAAS,KAAK,OAAO,WAAW,QAAW;AAC5D,UAAM,IAAI;AAAA,MACT,6CAA6C,OAAO,OAClD,QAAQ,CAAC,UAAU,MAAM,oBAAoB,CAAC,MAAM,OAAO,CAAC,EAC5D,KAAK,IAAI,CAAC;AAAA,IACb;AAAA,EACD;AACA,sCAAoC,MAAM;AAC1C,wBAAsB,OAAO,OAAO,SAAS,SAAS,yBAAyB;AAC/E,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ,OAAO,OAAO;AAAA,MACrB,IAAI,OAAO,OAAO;AAAA,MAClB,MAAM,OAAO,OAAO;AAAA,MACpB,kBAAkB,OAAO,OAAO;AAAA,MAChC,cAAc,OAAO,OAAO;AAAA,MAC5B,GAAI,OAAO,OAAO,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,OAAO,OAAO,MAAM;AAAA,MAC1E,UAAU,cAAc,OAAO,OAAO,QAAiC;AAAA,IACxE,CAAC;AAAA,EACF,CAAC;AACF;AAGO,SAAS,+BACf,OACkC;AAClC,MAAI,CAAC,cAAc,KAAK;AACvB,UAAM,IAAI,UAAU,mDAAmD;AACxE,wBAAsB,OAAO,0BAA0B;AACvD,kBAAgB,OAAO,CAAC,UAAU,UAAU,SAAS,GAAG,0BAA0B;AAClF,MAAI,MAAM,WAAW,oCAAoC;AACxD,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAC/D;AACA,MAAI,MAAM,YAAY,qCAAqC;AAC1D,UAAM,IAAI,UAAU,2CAA2C;AAAA,EAChE;AACA,QAAM,YAAY,MAAM;AACxB,MAAI,CAAC,cAAc,SAAS,GAAG;AAC9B,UAAM,IAAI,UAAU,oDAAoD;AAAA,EACzE;AACA;AAAA,IACC;AAAA,IACA,UAAU,UAAU,SACjB,CAAC,gBAAgB,YAAY,MAAM,QAAQ,kBAAkB,IAC7D,CAAC,gBAAgB,YAAY,MAAM,QAAQ,oBAAoB,OAAO;AAAA,IACzE;AAAA,EACD;AACA,QAAM,cAAc,UAAU;AAC9B,MAAI,CAAC,cAAc,WAAW,GAAG;AAChC,UAAM,IAAI,UAAU,sDAAsD;AAAA,EAC3E;AACA;AAAA,IACC;AAAA,IACA;AAAA,MACC;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,YAAY,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAC3D,GAAI,YAAY,YAAY,SAAY,CAAC,IAAI,CAAC,SAAS;AAAA,MACvD;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,YAAY,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAC3D,GAAI,YAAY,qBAAqB,SAAY,CAAC,IAAI,CAAC,kBAAkB;AAAA,MACzE,GAAI,YAAY,eAAe,SAAY,CAAC,IAAI,CAAC,YAAY;AAAA,IAC9D;AAAA,IACA;AAAA,EACD;AACA,MAAI,UAAU,UAAU,OAAW,kBAAiB,UAAU,KAAK;AACnE,QAAM,QAAQ;AACd,QAAM,UAAU,gBAAgB,KAAK;AACrC,QAAM,YAAY,yBAAyB,OAAO;AAClD,SAAO;AACR;AAGO,SAAS,gCAE4B;AAC3C,SAAO;AAAA,IACN,OAAO,OAAoD;AAC1D,aAAO,gBAAgB,OAAO,+BAAsC,KAAK,CAAC;AAAA,IAC3E;AAAA,IACA,OAAO,OAAoD;AAC1D,aAAO,+BAAsC,gBAAgB,OAAO,KAAK,CAAC;AAAA,IAC3E;AAAA,EACD;AACD;AAGO,SAAS,2BAEd;AACD,QAAM,aAAa,8BAAqC;AACxD,SAAO;AAAA,IACN,OAAO,OAA+C;AACrD,aAAO,WAAW,OAAO,yBAAyB,KAAK,CAAC;AAAA,IACzD;AAAA,IACA,OAAO,OAA+C;AACrD,aAAO,gBAAgB,WAAW,OAAO,KAAK,CAAC;AAAA,IAChD;AAAA,EACD;AACD;AA0vBA,SAAS,cACR,UACoC;AACpC,SAAO,OAAO,OAAO;AAAA,IACpB,IAAI,SAAS;AAAA,IACb,SAAS,SAAS;AAAA,IAClB,KAAK,oBAAoB,SAAS,KAAK,cAAc;AAAA,IACrD,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,oBAAoB,SAAS,WAAW,oBAAoB,EAAE;AAAA,IAC9E,GAAI,SAAS,YAAY,SACtB,CAAC,IACD,EAAE,SAAS,oBAAoB,SAAS,SAAS,kBAAkB,EAAE;AAAA,IACxE,YAAY,SAAS;AAAA,IACrB,MAAM,OAAO,OAAO,CAAC,GAAG,SAAS,IAAI,CAAC;AAAA,IACtC,SAAS,OAAO,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC;AAAA,IAC5C,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,OAAO,OAAO,CAAC,GAAG,SAAS,SAAS,CAAC,EAAE;AAAA,IACvD,GAAI,SAAS,qBAAqB,SAC/B,CAAC,IACD,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,IACjD,GAAI,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,YAAY,SAAS,WAAW;AAAA,EAChF,CAAC;AACF;AAEA,SAAS,gBACR,OAC6B;AAC7B,QAAM,WAAW,MAAM,OAAO;AAC9B,QAAM,SAAqC;AAAA,IAC1C,IAAI,qBAAqB,MAAM,OAAO,IAAI,WAAW;AAAA,IACrD,MAAM,gBAAgB,MAAM,OAAO,IAAI;AAAA,IACvC,kBAAkB,4BAA4B,MAAM,OAAO,gBAAgB;AAAA,IAC3E,cAAc,wBAAwB,MAAM,OAAO,YAAY;AAAA,IAC/D,GAAI,MAAM,OAAO,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,iBAAiB,MAAM,OAAO,KAAK,EAAE;AAAA,IAC1F,UAAU;AAAA,MACT,IAAI,qBAAqB,SAAS,IAAI,aAAa;AAAA,MACnD,SAAS,sBAAsB,SAAS,SAAS,kBAAkB;AAAA,MACnE,KAAK,mBAAmB,SAAS,KAAK,cAAc;AAAA,MACpD,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,mBAAmB,SAAS,WAAW,oBAAoB,EAAE;AAAA,MAC7E,GAAI,SAAS,YAAY,SACtB,CAAC,IACD,EAAE,SAAS,mBAAmB,SAAS,SAAS,kBAAkB,EAAE;AAAA,MACvE,YAAY,iBAAiB,SAAS,YAAY,qBAAqB;AAAA,MACvE,MAAM,kBAAkB,SAAS,MAAM,eAAe;AAAA,MACtD,SAAS,kBAAkB,SAAS,SAAS,kBAAkB;AAAA,MAC/D,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,wBAAwB,SAAS,WAAW,oBAAoB,EAAE;AAAA,MAClF,GAAI,SAAS,qBAAqB,SAC/B,CAAC,IACD;AAAA,QACA,kBAAkB,qBAAqB,SAAS,kBAAkB,kBAAkB;AAAA,MACrF;AAAA,MACF,GAAI,SAAS,eAAe,SACzB,CAAC,IACD,EAAE,YAAY,aAAa,SAAS,YAAY,YAAY,EAAE;AAAA,IAClE;AAAA,EACD;AACA,QAAM,SAAS,0BAAiC,QAAQ,CAAC;AACzD,MAAI,OAAO,OAAO,SAAS,KAAK,OAAO,WAAW,QAAW;AAC5D,UAAM,IAAI;AAAA,MACT,wDAAwD,OAAO,OAC7D,QAAQ,CAAC,UAAU,MAAM,oBAAoB,CAAC,MAAM,OAAO,CAAC,EAC5D,KAAK,IAAI,CAAC;AAAA,IACb;AAAA,EACD;AACA,SAAO,OAAO;AACf;AA6qCA,SAAS,0BACR,OACA,OAIC;AACD,MAAI;AACH,WAAO,+BAAkC,OAAO,KAAK;AAAA,EACtD,SAAS,OAAO;AACf,WAAO;AAAA,MACN,QAAQ;AAAA,QACP;AAAA,UACC,MAAM;AAAA,UACN,SAAS,8CAA8C,aAAa,KAAK,CAAC;AAAA,UAC1E;AAAA,UACA,QAAQ;AAAA,UACR,kBAAkB,OAAO,OAAO,CAAC,sBAAsB,CAAC;AAAA,QACzD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,+BACR,OACA,OAIC;AACD,QAAM,SAA+C,CAAC;AACtD,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACxE,WAAO;AAAA,MACN,QAAQ;AAAA,QACP;AAAA,UACC,MAAM;AAAA,UACN,SAAS;AAAA,UACT;AAAA,UACA,QAAQ;AAAA,QACT;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACA,QAAM,SAAS;AACf,QAAM,WAAW,OAAO,OAAO,OAAO,WAAW,OAAO,KAAK;AAC7D,MAAI,aAAa,UAAa,SAAS,WAAW,GAAG;AACpD,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,CAAC,sCAAsC;AAAA,IAC1D,CAAC;AAAA,EACF;AACA,MAAI,CAAC,oBAAoB,OAAO,IAAI,GAAG;AACtC,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,CAAC,sEAAsE;AAAA,IAC1F,CAAC;AAAA,EACF;AACA,MAAI,CAAC,gCAAgC,OAAO,gBAAgB,GAAG;AAC9D,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB;AAAA,QACjB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,EACF;AACA,MAAI,CAAC,4BAA4B,OAAO,YAAY,GAAG;AACtD,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,CAAC,8DAA8D;AAAA,IAClF,CAAC;AAAA,EACF;AACA,QAAM,kBAAkB,cAAc,OAAO,KAAK;AAClD,MAAI,CAAC,gBAAgB,IAAI;AACxB,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,OAAO,OAAO,gBAAgB,MAAM;AAAA,IACvD,CAAC;AAAA,EACF;AACA,QAAM,qBAAqB,uBAAuB,OAAO,QAAQ;AACjE,MAAI,CAAC,mBAAmB,IAAI;AAC3B,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,YACC,OAAO,OAAO,aAAa,YAC3B,OAAO,aAAa,QACpB,OAAQ,OAAO,SAAqC,OAAO,WACvD,OAAO,SAAqC,KAC7C;AAAA,MACJ,QAAQ;AAAA,MACR,kBAAkB,OAAO,OAAO,CAAC,GAAG,mBAAmB,MAAM,CAAC;AAAA,IAC/D,CAAC;AAAA,EACF;AACA,QAAM,kBAAkB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACA,QAAM,mBAAmB,gBAAgB,OAAO,CAAC,UAAU,OAAO,OAAO,QAAQ,KAAK,CAAC;AACvF,MAAI,iBAAiB,SAAS,GAAG;AAChC,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,OAAO;AAAA,QACxB,iBAAiB,IAAI,CAAC,UAAU,GAAG,KAAK,qCAAqC;AAAA,MAC9E;AAAA,IACD,CAAC;AAAA,EACF;AACA,MAAI,OAAO,SAAS,EAAG,QAAO,EAAE,OAAO;AACvC,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,WAAW,iBAAiB,OAAO,QAA6B;AACtE,SAAO;AAAA,IACN,QAAQ,OAAO,OAAO;AAAA,MACrB,IAAI;AAAA,MACJ,MAAM,OAAO;AAAA,MACb,kBAAkB,OAAO;AAAA,MACzB,cAAc,OAAO;AAAA,MACrB,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,MACvC;AAAA,IACD,CAAC;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,iBAAoB,UAAgD;AAC5E,SAAO,OAAO,OAAO;AAAA,IACpB,IAAI,SAAS;AAAA,IACb,SAAS,SAAS;AAAA,IAClB,KAAK,SAAS;AAAA,IACd,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,SAAS,UAAU;AAAA,IAC5E,GAAI,SAAS,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,SAAS,QAAQ;AAAA,IACtE,YAAY,SAAS;AAAA,IACrB,MAAM,OAAO,OAAO,CAAC,GAAG,SAAS,IAAI,CAAC;AAAA,IACtC,SAAS,OAAO,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC;AAAA,IAC5C,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,OAAO,OAAO,CAAC,GAAG,SAAS,SAAS,CAAC,EAAE;AAAA,IACvD,GAAI,SAAS,qBAAqB,SAC/B,CAAC,IACD,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,IACjD,GAAI,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,YAAY,SAAS,WAAW;AAAA,EAChF,CAAC;AACF;AA8EA,SAAS,oBAAoB,OAA4C;AACxE,SACC,UAAU,aACV,UAAU,cACV,UAAU,cACV,UAAU,gBACV,UAAU;AAEZ;AAEA,SAAS,gCAAgC,OAAwD;AAChG,SACC,UAAU,UACV,UAAU,aACV,UAAU,aACV,UAAU,cACV,UAAU,eACV,UAAU;AAEZ;AAEA,SAAS,4BAA4B,OAAoD;AACxF,SAAO,UAAU,SAAS,UAAU,aAAa,UAAU,aAAa,UAAU;AACnF;AAEA,SAAS,cAAc,OAIrB;AACD,MAAI,UAAU,OAAW,QAAO,EAAE,IAAI,MAAM,QAAQ,CAAC,EAAE;AACvD,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACxE,WAAO,EAAE,IAAI,OAAO,QAAQ,CAAC,sCAAsC,EAAE;AAAA,EACtE;AACA,QAAM,QAAQ;AACd,QAAM,SAAmB,CAAC;AAC1B,QAAM,UAAU,oBAAI,IAAI,CAAC,aAAa,aAAa,UAAU,UAAU,CAAC;AACxE,aAAW,OAAO,OAAO,KAAK,KAAK,GAAG;AACrC,QAAI,CAAC,QAAQ,IAAI,GAAG,EAAG,QAAO,KAAK,SAAS,GAAG,oCAAoC;AAAA,EACpF;AACA,aAAW,OAAO,SAAS;AAC1B,QAAI,MAAM,GAAG,MAAM,WAAc,OAAO,MAAM,GAAG,MAAM,YAAY,MAAM,GAAG,EAAE,WAAW,IAAI;AAC5F,aAAO,KAAK,SAAS,GAAG,0CAA0C;AAAA,IACnE;AAAA,EACD;AACA,MAAI,OAAO,SAAS,EAAG,QAAO,EAAE,IAAI,OAAO,OAAO;AAClD,SAAO;AAAA,IACN,IAAI;AAAA,IACJ;AAAA,IACA,OAAO,OAAO,OAAO;AAAA,MACpB,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,UAAoB;AAAA,MAChF,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,UAAoB;AAAA,MAChF,GAAI,MAAM,WAAW,SAAY,CAAC,IAAI,EAAE,QAAQ,MAAM,OAAiB;AAAA,MACvE,GAAI,MAAM,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,MAAM,SAAmB;AAAA,IAC9E,CAAC;AAAA,EACF;AACD;AAEA,SAAS,cAAc,OAAkD;AACxE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEA,SAAS,QAAQ,OAAmD;AACnE,SAAO,OAAO,KAAK,KAAK,EAAE,KAAK;AAChC;AAEA,SAAS,gBACR,OACA,UACA,OACO;AACP,QAAM,SAAS,QAAQ,KAAK;AAC5B,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,uBAAuB,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EACtE;AACD;AAEA,SAAS,oCAAoC,OAAsB;AAClE,MAAI,CAAC,cAAc,KAAK,GAAG;AAC1B,UAAM,IAAI,UAAU,oDAAoD;AAAA,EACzE;AACA,qBAAmB,OAAO,iCAAiC;AAC3D;AAAA,IACC;AAAA,IACA,MAAM,UAAU,SACb,CAAC,gBAAgB,YAAY,MAAM,QAAQ,kBAAkB,IAC7D,CAAC,gBAAgB,YAAY,MAAM,QAAQ,oBAAoB,OAAO;AAAA,IACzE;AAAA,EACD;AACA,QAAM,WAAW,MAAM;AACvB,MAAI,CAAC,cAAc,QAAQ,GAAG;AAC7B,UAAM,IAAI,UAAU,sDAAsD;AAAA,EAC3E;AACA,qBAAmB,UAAU,0CAA0C;AACvE;AAAA,IACC;AAAA,IACA;AAAA,MACC;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MACxD,GAAI,SAAS,YAAY,SAAY,CAAC,IAAI,CAAC,SAAS;AAAA,MACpD;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MACxD,GAAI,SAAS,qBAAqB,SAAY,CAAC,IAAI,CAAC,kBAAkB;AAAA,MACtE,GAAI,SAAS,eAAe,SAAY,CAAC,IAAI,CAAC,YAAY;AAAA,IAC3D;AAAA,IACA;AAAA,EACD;AACA,wBAAsB,SAAS,MAAM,sBAAsB;AAC3D,wBAAsB,SAAS,SAAS,yBAAyB;AACjE,MAAI,SAAS,cAAc,QAAW;AACrC,0BAAsB,SAAS,WAAW,2BAA2B;AAAA,EACtE;AACA,MAAI,MAAM,UAAU,OAAW,kBAAiB,MAAM,KAAK;AAC5D;AAEA,SAAS,mBAAmB,OAAe,OAAqB;AAC/D,MAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,GAAG;AACnD,UAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B;AAAA,EACzD;AACD;AAEA,SAAS,oBAAoB,OAAe,OAAuB;AAClE,QAAM,MAAM,MAAM,SAAS,EAAE;AAC7B,MAAI,CAAC,mBAAmB,KAAK,GAAG,GAAG;AAClC,UAAM,IAAI,UAAU,GAAG,KAAK,mDAAmD;AAAA,EAChF;AACA,SAAO;AACR;AAEA,SAAS,mBAAmB,OAAgB,OAAuB;AAClE,MAAI,OAAO,UAAU,YAAY,CAAC,mBAAmB,KAAK,KAAK,GAAG;AACjE,UAAM,IAAI,UAAU,GAAG,KAAK,4CAA4C;AAAA,EACzE;AACA,SAAO,OAAO,KAAK;AACpB;AAEA,SAAS,sBAAsB,OAAgB,OAAgC;AAC9E,MAAI;AACH,oBAAgB,OAAO,KAAK;AAC5B,WAAO;AAAA,EACR,SAAS,OAAO;AACf,UAAM,IAAI,UAAU,GAAG,KAAK,yBAAyB,aAAa,KAAK,CAAC,EAAE;AAAA,EAC3E;AACD;AAEA,SAAS,iBAAiB,OAAoC;AAC7D,MAAI,CAAC,cAAc,KAAK,GAAG;AAC1B,UAAM,IAAI,UAAU,gEAAgE;AAAA,EACrF;AACA,wBAAsB,OAAO,cAAc;AAC3C,QAAM,aAAa,cAAc,KAAK;AACtC,MAAI,CAAC,WAAW,MAAM,WAAW,UAAU,QAAW;AACrD,UAAM,IAAI,UAAU,4CAA4C,WAAW,OAAO,KAAK,IAAI,CAAC,EAAE;AAAA,EAC/F;AACA;AAAA,IACC;AAAA,IACA;AAAA,MACC,GAAK,MAAkC,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAClF,GAAK,MAAkC,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAClF,GAAK,MAAkC,WAAW,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,MAC5E,GAAK,MAAkC,aAAa,SAAY,CAAC,IAAI,CAAC,UAAU;AAAA,IACjF;AAAA,IACA;AAAA,EACD;AACA,SAAO,WAAW;AACnB;AAEA,SAAS,gBAAgB,OAAmC;AAC3D,MAAI,CAAC,oBAAoB,KAAK,GAAG;AAChC,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACpE;AACA,SAAO;AACR;AAEA,SAAS,4BAA4B,OAA+C;AACnF,MAAI,CAAC,gCAAgC,KAAK,GAAG;AAC5C,UAAM,IAAI,UAAU,qDAAqD;AAAA,EAC1E;AACA,SAAO;AACR;AAEA,SAAS,wBAAwB,OAA2C;AAC3E,MAAI,CAAC,4BAA4B,KAAK,GAAG;AACxC,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACtE;AACA,SAAO;AACR;AAEA,SAAS,qBAAqB,OAAgB,OAAuB;AACpE,MAAI,CAAC,iBAAiB,KAAK,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;AACvF,SAAO;AACR;AAEA,SAAS,aAAa,OAAgB,OAAuB;AAC5D,MAAI,OAAO,UAAU,SAAU,OAAM,IAAI,UAAU,GAAG,KAAK,mBAAmB;AAC9E,SAAO;AACR;AAEA,SAAS,iBAAiB,OAAgB,OAAuB;AAChE,MAAI,CAAC,OAAO,SAAS,KAAK,KAAM,QAAmB,KAAM,QAAmB,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,oCAAoC;AAAA,EACjE;AACA,SAAO;AACR;AAEA,SAAS,kBAAkB,OAAgB,OAAkC;AAC5E,MAAI,CAACC,gBAAe,OAAO,CAAC,SAAyB,OAAO,SAAS,QAAQ,GAAG;AAC/E,UAAM,IAAI,UAAU,GAAG,KAAK,kCAAkC;AAAA,EAC/D;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;AAChC;AAEA,SAAS,wBAAwB,OAAgB,OAAkC;AAClF,MAAI,CAACA,gBAAe,OAAO,CAAC,SAAyB,OAAO,SAAS,IAAI,CAAC,GAAG;AAC5E,UAAM,IAAI,UAAU,GAAG,KAAK,gCAAgC;AAAA,EAC7D;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;AAChC;AAEA,SAAS,iBAAiB,OAAiC;AAC1D,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS;AACpD;AAEA,SAASA,gBAAkB,OAAgB,WAAuD;AACjG,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,KAAK,CAAC,UAAU,MAAM,CAAC,CAAC,EAAG,QAAO;AAAA,EAC9D;AACA,SAAO;AACR;AAmBA,SAAS,aAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;ACz3GO,IAAM,wCACZ;AACM,IAAM,sCACZ;AACM,IAAM,8CAA8C;AAwGpD,SAAS,gCAAgC,gBAAgB,kBAA0B;AACzF,MAAI,cAAc,WAAW,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACrF,SAAO,GAAG,aAAa;AACxB;AAEO,SAAS,iCAGf,SACA,OAA2C,CAAC,GACF;AAC1C,QAAM,eAAe,qBAAqB,KAAK,gBAAgB,EAAE;AACjE,SAAO,uCAAuC;AAAA,IAC7C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA,SAAS,QAAQ,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,EAClE,CAAC;AACF;AAEO,SAAS,+BAEd,SAAuF;AACxF,SAAO,qCAAqC;AAAA,IAC3C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ;AAAA,MACP,MAAM;AAAA,MACN,SAAS,QAAQ,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,IAClE;AAAA,EACD,CAAC;AACF;AAEO,SAAS,uCAEd,OAAyD;AAC1D,MAAI,CAACC,eAAc,KAAK,EAAG,OAAM,IAAI,UAAU,iDAAiD;AAChG;AAAA,IACC;AAAA,IACA,CAAC,gBAAgB,UAAU,WAAW,SAAS;AAAA,IAC/C;AAAA,EACD;AACA,MAAI,MAAM,WAAW,uCAAuC;AAC3D,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACpE;AACA,MAAI,MAAM,YAAY,6CAA6C;AAClE,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,QAAM,eAAe,qBAAqB,MAAM,YAAY;AAC5D,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,GAAG;AAClC,UAAM,IAAI,UAAU,yDAAyD;AAAA,EAC9E;AACA,QAAM,UAAU;AAAA,IACf,MAAM;AAAA,IACN;AAAA,EACD;AACA,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA,SAAS,OAAO,OAAO,OAAO;AAAA,EAC/B,CAAC;AACF;AAEO,SAAS,qCAEd,OAAuD;AACxD,MAAI,CAACA,eAAc,KAAK,EAAG,OAAM,IAAI,UAAU,+CAA+C;AAC9F,aAAW,OAAO,CAAC,UAAU,UAAU,SAAS,GAAG,6BAA6B;AAChF,MAAI,MAAM,WAAW,qCAAqC;AACzD,UAAM,IAAI,UAAU,6CAA6C;AAAA,EAClE;AACA,MAAI,MAAM,YAAY,6CAA6C;AAClE,UAAM,IAAI,UAAU,8CAA8C;AAAA,EACnE;AACA,MAAI,CAACA,eAAc,MAAM,MAAM,GAAG;AACjC,UAAM,IAAI,UAAU,uDAAuD;AAAA,EAC5E;AACA,aAAW,MAAM,QAAQ,CAAC,QAAQ,SAAS,GAAG,oCAAoC;AAClF,MAAI,MAAM,OAAO,SAAS,cAAc;AACvC,UAAM,IAAI,UAAU,6DAA6D;AAAA,EAClF;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,OAAO,GAAG;AACzC,UAAM,IAAI,UAAU,8DAA8D;AAAA,EACnF;AACA,QAAM,UAAU;AAAA,IACf,MAAM,OAAO;AAAA,IACb;AAAA,EACD;AACA,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ,OAAO,OAAO;AAAA,MACrB,MAAM;AAAA,MACN,SAAS,OAAO,OAAO,OAAO;AAAA,IAC/B,CAAC;AAAA,EACF,CAAC;AACF;AAEO,SAAS,8BAEd,MAA8F;AAC/F,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,cAAc,KAAK,eAAe,gCAAgC,aAAa;AACrF,SAAO,KAAK,cAAc,IAAI,WAAW,EAAE,KAAK,CAAC,gBAAgB;AAChE,QAAI,UAAiD,CAAC;AACtD,QAAIC,UAA4D;AAChE,QAAI,eAAe;AACnB,QAAI,gBAAgB,QAAW;AAC9B,YAAM,WAAW,uCAA8C,WAAW;AAC1E,gBAAU,SAAS,QAAQ,IAAIC,gBAAe;AAC9C,qBAAe,SAAS;AACxB,MAAAD,UAAS;AAAA,IACV;AACA,QAAI,KAAK,cAAc,QAAW;AACjC,aAAO;AAAA,QACN;AAAA,QACA,QAAAA;AAAA,QACA,UAAU,EAAE,OAAO,gBAAgB,QAAW,aAAa;AAAA,QAC3D,SAAS,EAAE,SAAS,GAAG,QAAQ,aAAa;AAAA,MAC7C;AAAA,IACD;AACA,WAAO,KAAK,UAAU,KAAK,EAAE,OAAO,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY;AACrE,UAAI,UAAU;AACd,UAAI,SAAS;AACb,iBAAW,SAAS,SAAS;AAC5B,YAAI,MAAM,QAAQ,SAAS,GAAG;AAC7B,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACtE;AACA,cAAM,SAAS,qCAA4C,MAAM,KAAK;AACtE,kBAAU,OAAO,OAAO,QAAQ,IAAIC,gBAAe;AACnD,iBAAS,MAAM;AACf,mBAAW;AAAA,MACZ;AACA,aAAO;AAAA,QACN;AAAA,QACA,QACC,gBAAgB,UAAa,UAAU,IACpC,qBACA,gBAAgB,SACf,aACA,UAAU,IACT,YACA;AAAA,QACN,UAAU,EAAE,OAAO,gBAAgB,QAAW,aAAa;AAAA,QAC3D,SAAS,EAAE,SAAS,OAAO;AAAA,MAC5B;AAAA,IACD,CAAC;AAAA,EACF,CAAC;AACF;AAEO,SAAS,4BAGf,OACA,SACA,MACwC;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,cACL,KAAK,eAAe,gCAAgC,KAAK,iBAAiB,IAAI;AAC/E,QAAM,uBAAuB,6BAA6B,KAAK,oBAAoB;AACnF,uBAAqB,OAAO,SAA0B,GAAG,IAAI,UAAU;AACvE,MAAI,cAAqD;AAAA,IACxD,MAAM;AAAA,IACN,WAAW,qBAAqB,KAAK,uBAAuB,EAAE;AAAA,IAC9D,gBAAgB;AAAA,IAChB,cAAc;AAAA,EACf;AACA,MAAI,cAAc,SAAS,YAAY,GAAG,GAAG,GAAG,WAAW;AAC3D,MAAI,aAAa;AACjB,MAAI,SAAS;AACb,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,MAAI,+BAA+B;AACnC,MAAI,gBAAuD,QAAQ,SAAS,CAAC;AAC7E,MAAI;AACJ,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAQ,MAAM,MAAM,OAAO,EAAE,MAAM,GAAG,IAAI,SAAS,CAAC;AAC1D,QAAM,SAAS,MAAM,MAA6C,aAAa;AAAA,IAC9E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,QAAQ,MAAM,MAAmD,MAAM;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,SAAS,MAAM,MAA6C,aAAa;AAAA,IAC9E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AAED,WAAS,QAAQ,OAA6D;AAC7E,UAAM,YAAY,YAAY,UAAU,aAAa,UAAU,aAAa,YAAY;AACxF,kBAAc;AAAA,MACb;AAAA,MACA,MAAM,UAAU,UAAU,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,WAAO,IAAI,WAAW;AACtB,WAAO,IAAI,WAAW;AACtB,QAAI,cAAc,QAAS,OAAM,IAAI,IAAI;AACzC,QAAI,cAAc,aAAa,cAAc,WAAY,OAAM,IAAI,KAAK;AAAA,EACzE;AAEA,WAAS,OAAO,OAA8B,QAAuB;AACpE,kBAAc;AACd,UAAM,IAAI,EAAE,OAAO,SAASC,cAAa,MAAM,GAAG,QAAQ,YAAY,CAAC;AAAA,EACxE;AAEA,WAAS,SAAS,MAA+B;AAChD,QAAI;AACH,aAAO,WAAW;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,WAAS,OAAO,MAAuB;AACtC,QAAI,KAAK,UAAU,WAAW;AAC7B,iBAAW;AACX,gBAAU;AACV,cAAQ,UAAU;AAAA,IACnB,WAAW,YAAY,UAAU,WAAW;AAC3C,gBAAU;AACV,cAAQ,OAAO;AAAA,IAChB,OAAO;AACN,gBAAU;AACV,cAAQ,SAAS;AAAA,IAClB;AACA,aAAS,KAAK,IAAI;AAClB,IAAAC,OAAM;AAAA,EACP;AAEA,WAAS,KAAK,MAAiB,QAAuB;AACrD,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,QAAO,KAAK,OAAO,MAAM;AACnF,cAAU;AACV,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,SAAQ,SAAS;AAC3E,aAAS,KAAK,IAAI;AAClB,IAAAA,OAAM;AAAA,EACP;AAEA,WAAS,cAAc,MAAiB,OAAyB;AAChE,QAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,UAAM,OAAQ,MAA6B;AAC3C,QAAI,OAAO,SAAS,WAAY,QAAO;AACvC,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,SAAqB;AACpC,UAAI,QAAS;AACb,gBAAU;AACV,WAAK;AAAA,IACN;AACA,QAAI;AACH,MAAC,KAAoF;AAAA,QACpF;AAAA,QACA,MAAM,OAAO,MAAM,OAAO,IAAI,CAAC;AAAA,QAC/B,CAAC,WAAW,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5C;AAAA,IACD,SAAS,QAAQ;AAChB,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACR;AAEA,WAAS,QAAQ,MAAuB;AACvC,QAAI,YAAa,oBAAoB,KAAK,UAAU,aAAa,KAAK,UAAU,SAAU;AACzF,eAAS,KAAK,IAAI;AAClB;AAAA,IACD;AACA,UAAM,KAAK,IAAI;AACf,IAAAA,OAAM;AAAA,EACP;AAEA,WAASA,SAAc;AACtB,QAAI,QAAS;AACb,UAAM,OAAO,MAAM,MAAM;AACzB,QAAI,SAAS,OAAW;AACxB,cAAU;AACV;AAAA,MACC,KAAK,UAAU,UAAU,aAAa,YAAY,UAAU,aAAa,aAAa;AAAA,IACvF;AACA,QAAI;AACJ,QAAI;AACH,eAAS,KAAK,IAAI;AAAA,IACnB,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB;AAAA,IACD;AACA,QAAI,cAAc,MAAM,MAAM,EAAG;AACjC,WAAO,IAAI;AAAA,EACZ;AAEA,WAAS,gBAAgB,MAAsE;AAC9F,UAAM,kBAAkB;AACxB,mCAA+B;AAC/B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AACL,cAAMC,WAAU,OAAO;AAAA,UACtB,gBAAgB,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,QACjE;AACA,cAAM,QAAQ,uCAA8C;AAAA,UAC3D,QAAQ;AAAA,UACR,SAAS;AAAA,UACT,cAAc,YAAY;AAAA,UAC1B,SAAAA;AAAA,QACD,CAAC;AACD,eAAO,KAAK,cAAc,IAAI,aAAa,KAAK,EAAE,KAAK,MAAM;AAC5D,wBAAc,EAAE,GAAG,aAAa,gBAAgB,YAAY,iBAAiB,EAAE;AAC/E,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,cAAc,aAA0D;AAChF,UAAM,YAAY,KAAK;AACvB,QAAI,cAAc,OAAW;AAC7B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AACL,cAAM,QAAQ,+BAA+B,WAAW;AACxD,eAAO,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,YAAY;AAChD,gBAAM,QAAQ;AACd,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,WAAW,MAAM;AAAA,YACjB,cAAc,YAAY,eAAe;AAAA,UAC1C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,yBAA+B;AACvC,UAAM,UAAU,MAAM,OAAO,CAAC;AAC9B,eAAW,QAAQ,QAAS,UAAS,KAAK,IAAI;AAAA,EAC/C;AAEA,SAAO,QAAQ,UAAU,CAAC,KAAc,aAA4B;AACnE,QAAI,iBAAkB;AACtB,UAAM,cAAc,OAA8C,GAAG;AACrE,QAAI,gBAAgB,OAAW;AAC/B,oBAAgB;AAChB,QAAI,eAAe,aAAa,OAAW;AAC3C,oCAAgC;AAChC,kBAAc,WAAW;AACzB,QACC,yBAAyB,UACzB,gCAAgC,sBAC/B;AACD,sBAAgB;AAAA,IACjB;AAAA,EACD,CAAC;AACD,gBAAc;AACd,MAAI,KAAK,qBAAqB,MAAO,iBAAgB;AAAA,MAChD,SAAQ,OAAO;AAEpB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,MAAsE;AAC3E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,cAAQ,EAAE,OAAO,SAAS,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACvD;AAAA,IACA,SAAS,MAAsE;AAC9E,UAAI,YAAY,kBAAkB;AACjC,iBAAS,IAAI;AACb;AAAA,MACD;AACA,sBAAgB,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,MAAsE;AAC7E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,yBAAmB;AACnB,aAAO;AACP,6BAAuB;AACvB,cAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACzD;AAAA,EACD;AACD;AAEO,SAAS,mCAGf,MACiD;AACjD,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,gCAAgC,aAAa;AACrF,SAAO,8BAAqC,EAAE,GAAG,MAAM,aAAa,cAAc,CAAC,EAAE;AAAA,IACpF,CAAC,WAAW;AACX,YAAM,UACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAAY,KAAK,UAAU,OAAO;AACjF,YAAMC,QAAO,KAAK,MAAM,MAA6C,SAAS;AAAA,QAC7E,MAAM,KAAK;AAAA,MACZ,CAAC;AACD,YAAM,cAAc,4BAA4B,KAAK,OAAOA,OAAM;AAAA,QACjE,GAAG;AAAA,QACH,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA,qBAAqB,OAAO,QAAQ;AAAA,MACrC,CAAC;AACD,aAAO,EAAE,SAASA,OAAM,aAAa,OAAO;AAAA,IAC7C;AAAA,EACD;AACD;AAEA,SAASJ,iBACR,OAC6B;AAC7B,SAAO,yBAAgC,EAAE;AAAA,IACxC,8BAAqC,EAAE,OAAO,KAAK;AAAA,EACpD;AACD;AAEA,SAAS,SACR,OACA,SACA,QACA,QACA,QACwC;AACxC,SAAO,EAAE,OAAO,SAAS,QAAQ,QAAQ,OAAO;AACjD;AAEA,SAAS,OAAU,KAA6B;AAC/C,SAAO,IAAI,CAAC,MAAM,SAAU,IAAI,CAAC,IAAU;AAC5C;AAEA,SAAS,qBAAqB,OAAwB;AACrD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,IAAI;AAC5E,UAAM,IAAI,WAAW,2CAA2C;AAAA,EACjE;AACA,SAAO;AACR;AAEA,SAAS,6BAA6B,OAA+C;AACpF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC9C,UAAM,IAAI,WAAW,sDAAsD;AAAA,EAC5E;AACA,SAAO;AACR;AAEA,SAASF,eAAc,OAAkD;AACxE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEA,SAAS,WACR,OACA,UACA,OACO;AACP,QAAM,SAAS,OAAO,KAAK,KAAK,EAAE,KAAK;AACvC,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EAC5E;AACD;AAEA,SAAS,wBACR,OACA,OAC6C;AAC7C,QAAM,UAA6C,CAAC;AACpD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,GAAG;AAC7B,YAAM,IAAI,UAAU,GAAG,KAAK,0BAA0B,CAAC,EAAE;AAAA,IAC1D;AACA,YAAQ,KAAK,+BAAsC,MAAM,CAAC,CAAC,CAAC;AAAA,EAC7D;AACA,SAAO,OAAO,OAAO,OAAO;AAC7B;AAEA,SAASG,cAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;AC9jBO,IAAM,YAA2B,OAAO,OAAO,EAAE,MAAM,OAAO,CAAC;AAE/D,SAAS,YAAY,cAAc,GAAG,UAAyB,WAAwB;AAC7F,MAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,GAAG;AACvD,UAAM,IAAI,WAAW,qDAAqD;AAAA,EAC3E;AACA,SAAO,OAAO,OAAO,EAAE,aAAa,QAAQ,CAAC;AAC9C;AAEO,SAAS,YAAY,QAAqB,eAAgC;AAChF,SAAO,gBAAgB,OAAO;AAC/B;AAEO,SAAS,iBAAiB,QAAqB,aAAyC;AAC9F,MAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,KAAK,cAAc,OAAO,aAAa;AAC3F,WAAO;AAAA,EACR;AACA,SAAO,eAAe,OAAO,SAAS,WAAW;AAClD;AAEO,SAAS,eAAe,QAAuB,SAAyB;AAC9E,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,CAAC;AACnD,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK;AACJ,aAAO;AAAA,IACR,KAAK;AACJ,aAAO,YAAY,OAAO,OAAO;AAAA,IAClC,KAAK;AACJ,aAAO;AAAA,QACN,YAAY,OAAO,SAAS,IAAI,YAAY,OAAO,MAAM,KAAK,cAAc;AAAA,QAC5E,OAAO;AAAA,MACR;AAAA,IACD,KAAK,eAAe;AACnB,YAAM,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,MAAM,CAAC;AACpD,aAAO,IAAI,YAAY,OAAO,SAAS,IAAI,WAAW,cAAc,IAAI,OAAO,KAAK;AAAA,IACrF;AAAA,IACA,KAAK;AACJ,aAAO,IAAI,YAAY,OAAO,MAAM,IAAI,UAAU,WAAW,GAAG,OAAO,KAAK;AAAA,EAC9E;AACD;AAEA,SAAS,IAAI,OAAe,KAAiC;AAC5D,MAAI,QAAQ,OAAW,QAAO;AAC9B,SAAO,KAAK,IAAI,OAAO,YAAY,GAAG,CAAC;AACxC;AAEA,SAAS,YAAY,OAAuB;AAC3C,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK;AACzB;AAEA,SAAS,UAAU,GAAmB;AACrC,MAAI,KAAK,EAAG,QAAO;AACnB,MAAI,OAAO;AACX,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AAC/B,UAAM,OAAO,OAAO;AACpB,WAAO;AACP,WAAO;AAAA,EACR;AACA,SAAO;AACR;;;ACuPA,IAAM,gBAAgB,oBAAI,IAA4B;AAAA,EACrD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,IAAM,sBAAsB;AAC5B,IAAM,uBAAuB,oBAAI,QAG/B;AACF,IAAM,uBAAuB,oBAAI,QAG/B;AAGK,SAAS,yBAAyB,WAAmB,KAAqB;AAChF,SAAO,GAAG,SAAS,IAAI,GAAG;AAC3B;AAGO,SAAS,mBAAoC,OAYtB;AAC7B,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,GAAG;AACxE,UAAM,IAAI,WAAW,0DAA0D;AAAA,EAChF;AACA,MAAI,CAAC,cAAc,IAAI,MAAM,IAAI,GAAG;AACnC,UAAM,IAAI,WAAW,4CAA4C;AAAA,EAClE;AACA,MAAI,CAAC,sBAAsB,MAAM,GAAG,GAAG;AACtC,UAAM,IAAI,WAAW,oDAAoD;AAAA,EAC1E;AACA,QAAM,SAAS,MAAM,UAAU;AAC/B,MAAI,CAAC,yBAAyB,MAAM,GAAG;AACtC,UAAM,IAAI,WAAW,2DAA2D;AAAA,EACjF;AACA,QAAM,UAAU,MAAM,WAAW;AACjC,MAAI,CAAC,sBAAsB,OAAO,GAAG;AACpC,UAAM,IAAI,WAAW,wDAAwD;AAAA,EAC9E;AACA,QAAM,cAAc,MAAM,eAAe;AACzC,MAAI,CAAC,sBAAsB,WAAW,KAAK,cAAc,SAAS;AACjE,UAAM,IAAI,WAAW,oDAAoD;AAAA,EAC1E;AACA,MAAI,MAAM,cAAc,UAAa,CAAC,sBAAsB,MAAM,SAAS,GAAG;AAC7E,UAAM,IAAI,WAAW,0DAA0D;AAAA,EAChF;AACA,OAAK,MAAM,SAAS,SAAS,MAAM,SAAS,WAAW,MAAM,cAAc,QAAW;AACrF,UAAM,IAAI,WAAW,uBAAuB,MAAM,IAAI,8BAA8B;AAAA,EACrF;AACA,MAAI,MAAM,mBAAmB,UAAa,MAAM,eAAe,WAAW,GAAG;AAC5E,UAAM,IAAI,WAAW,+DAA+D;AAAA,EACrF;AACA,QAAM,eAAe,uBAAuB,MAAM,MAAM,MAAM,SAAS,oBAAoB;AAC3F,MAAI,iBAAiB,QAAW;AAC/B,UAAM,IAAI,WAAW,YAAY;AAAA,EAClC;AACA,SAAO;AAAA,IACN,WAAW,MAAM;AAAA,IACjB,MAAM,MAAM;AAAA,IACZ,SAAS,MAAM;AAAA,IACf,UAAU;AAAA,MACT,KAAK,MAAM;AAAA,MACX;AAAA,MACA,gBAAgB,MAAM,kBAAkB,yBAAyB,MAAM,WAAW,MAAM,GAAG;AAAA,MAC3F;AAAA,MACA;AAAA,MACA,aAAa,MAAM;AAAA,MACnB,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,IAClB;AAAA,EACD;AACD;AAEO,SAAS,WACf,OACA,MACwC;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS,KAAK,SAAS,YAAY;AACzC,QAAM,UAAU,MAAM,KAAmC,CAAC,GAAG,MAAM;AAAA,IAClE,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,EACV,CAAC;AACD,QAAM,cAAc,MAAM;AAAA,IACzB,CAAC;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,IACV;AAAA,EACD;AACA,QAAM,UAAU,mBAAmB,aAAa,KAAK,SAAS;AAC9D,QAAM,SAAS;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACA,QAAM,WAAW,gBAAgB,OAAO,QAAQ,IAAI;AACpD,QAAM,OAAO,YAAY,OAAO,QAAQ,IAAI;AAC5C,QAAM,QAAQ,aAAa,OAAO,QAAQ,IAAI;AAC9C,QAAM,SAAS,cAAc,OAAO,QAAQ,MAAM,KAAK,SAAS;AAChE,QAAM,SAAS,cAAc,OAAO,QAAQ,IAAI;AAChD,QAAM,SAAS,cAAc,OAAO,QAAQ,IAAI;AAChD,QAAM,WAAW,gBAAgB,OAAO,QAAQ,IAAI;AACpD,QAAM,SAAgD;AAAA,IACrD,WAAW,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IACvD,MAAM,CAAC,SAAS,aACf,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN;AAAA,UACA,gBAAgB,UAAU;AAAA,UAC1B,WAAW,UAAU;AAAA,QACtB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,KAAK,CAAC,WAAW,YAChB,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN;AAAA,UACA,gBAAgB,SAAS;AAAA,UACzB,WAAW,SAAS;AAAA,QACrB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,MAAM,CAAC,WAAW,OAAO,aACxB,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA,gBAAgB,UAAU;AAAA,UAC1B,WAAW,UAAU;AAAA,QACtB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,OAAO,CAAC,QAAQ,cACf,QAAQ,KAAK;AAAA,MACZ,CAAC,QAAQ,EAAE,MAAM,SAAS,QAAQ,gBAAgB,WAAW,eAAe,CAAC;AAAA,IAC9E,CAAC;AAAA,EACH;AACA,uBAAqB,IAAI,QAA8C,EAAE,SAAS,CAAC,EAAE,CAAC;AACtF,uBAAqB,IAAI,QAA8C,WAAW;AAClF,SAAO;AACR;AAGO,SAAS,WACf,OACA,QACA,OAA0B,CAAC,GACa;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,MAAM,KAAwB,CAAC,GAAG,MAAM;AAAA,IACxD,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,IACT,0BAA0B;AAAA,IAC1B,oBAAoB;AAAA,EACrB,CAAC;AACD,QAAM,YAAY,wBAAwB,OAAO,OAAO,QAAQ,UAAU,IAAI;AAC9E,QAAM,UAAU,sBAAsB,OAAO,WAAW,IAAI;AAC5D,QAAM,SAAS,qBAAqB,OAAO,OAAO,QAAQ,WAAW,UAAU,IAAI;AACnF,QAAM,SAAS,qBAAqB,OAAO,WAAW,UAAU,OAAO,QAAQ,IAAI;AACnF,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,WAAW,WAAW,SAAS,UAAU;AAC7C,YAAM,UAAU,kBAAkB,WAAW,WAAW,OAAO;AAC/D,aAAO,QAAQ,KAAK;AAAA,QACnB;AAAA,UACC;AAAA,UACA;AAAA,YACC,MAAM;AAAA,YACN,SAAS;AAAA,YACT,gBAAgB,UAAU;AAAA,YAC1B;AAAA,UACD;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO;AAAA,IACR;AAAA,IACA,QAAQ,WAAW,WAAW,OAAO;AACpC,YAAM,UAAU,kBAAkB,WAAW,WAAW,KAAK;AAC7D,eAAS,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AACjC,aAAO;AAAA,IACR;AAAA,EACD;AACD;AAEO,SAAS,uBACf,WACA,QACwD;AACxD,MAAI,UAAU,WAAW,GAAG;AAC3B,UAAM,IAAI,WAAW,qDAAqD;AAAA,EAC3E;AACA,MAAI,OAAO,WAAW,YAAY;AACjC,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACxE;AACA,SAAO,EAAE,WAAW,OAAO;AAC5B;AAGO,SAAS,gBACf,OACA,QACA,OAAoD,CAAC,GACR;AAC7C,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,wBAAwB,KAAK,YAAY,CAAC,CAAC;AAC5D,QAAM,WAAW,MAAM,cAAc,EAAE,MAAM,GAAG,IAAI,mBAAmB,CAAC;AACxE,QAAM,SAAS,SAAS;AAAA,IACvB;AAAA,MACC;AAAA,MACA,wBAAwB,MAAM;AAAA,MAC9B;AAAA,MACA,OAAO;AAAA,MACP;AAAA,MACA,KAAK,kBAAkB;AAAA,IACxB;AAAA,EACD;AACA,QAAM,mBAAmB,SAAS,IAAI,oCAAoC,OAAO,QAAQ,IAAI,CAAC;AAC9F,QAAM,WAAW,SAAS,IAAI,4BAA4B,OAAO,QAAQ,IAAI,CAAC;AAC9E,QAAM,SAAS,SAAS,IAAI,0BAA0B,OAAO,QAAQ,IAAI,CAAC;AAC1E,QAAM,SAAS,SAAS,IAAI,0BAA0B,OAAO,QAAQ,IAAI,CAAC;AAC1E,MAAI;AACH,kCAA8B,QAAQ,gBAAgB;AAAA,EACvD,SAAS,OAAO;AACf,aAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,gCAAgC,CAAC;AACnE,UAAM;AAAA,EACP;AACA,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AACT,UAAI,SAAU;AACd,oCAA8B,QAAQ,gBAAgB;AACtD,UAAI;AACH,iBAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,2BAA2B,CAAC;AAC9D,mBAAW;AAAA,MACZ,SAAS,OAAO;AACf,sCAA8B,QAAQ,gBAAgB;AACtD,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,qBACR,OACA,SACA,SACA,MACA,MACA,QAC6C;AAC7C,QAAM,MAAM,KAAK,OAAO,KAAK;AAC7B,SAAO,MAAM;AAAA,IACZ,CAAC,SAAS,OAAO;AAAA,IACjB,CAAC,QAAQ;AACR,YAAM,QAAQ,gBAA2B,GAAG;AAE5C,YAAM,eAAe,CACpB,MACA,SACA,cAAmF,CAAC,GACpF,eACI;AACJ,YAAI,CAAC,sBAAsB,MAAM,OAAO,GAAG;AAC1C,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,GAAG,KAAK,SAAS;AAAA,cACzB;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM,MAAM,MAAM;AAClB,YAAI;AACJ,YAAI;AACH,qBAAW,mBAA8B;AAAA,YACxC,WAAW,KAAK;AAAA,YAChB;AAAA,YACA;AAAA,YACA,QAAQ,MAAM;AAAA,YACd;AAAA,YACA,gBAAgB,YAAY;AAAA,YAC5B,SAAS;AAAA,YACT,aAAa,OAAO;AAAA,YACpB,aAAa,IAAI;AAAA,YACjB,WAAW,YAAY;AAAA,YACvB,WAAW,YAAY;AAAA,UACxB,CAAC;AAAA,QACF,SAAS,OAAO;AACf,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,cAC7D;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM;AACN,qBAAa;AACb,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,SAAS,CAAC,CAAC,CAAC;AACnD,YAAI,eAAe,IAAI,EAAG,eAAc,KAAK,OAAO,UAAU,MAAM,QAAQ,GAAG;AAAA,MAChF;AAEA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,uBAAe,KAAK,OAAO,KAAK,KAAK,SAAS;AAAA,MAC/C;AACA,YAAM,kBAAkB,IAAI,SAAS,CAAC;AACtC,UAAI,oBAAoB,SAAS,oBAAoB,UAAa,CAAC,MAAM,kBAAkB;AAC1F,cAAM,mBAAmB;AACzB,cAAM,QACL,oBAAoB,OACjB,GAAG,KAAK,SAAS,uGACjB,GAAG,KAAK,SAAS,4BAA4B;AAAA,UAC7C,aAAa,eAAe;AAAA,QAC7B,CAAC;AACJ,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,MAAM,CAAC,CAAC,CAAC;AAAA,MAChD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU,gBAAgB,GAAG;AACnC,YAAI,YAAY,QAAW;AAC1B,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,QAAQ,CAAC,CAAC,CAAC;AACxD;AAAA,QACD;AACA,cAAM,eAAe;AACrB,gBAAQ,aAAa,MAAM;AAAA,UAC1B,KAAK;AACJ,yBAAa,SAAS,QAAW,YAAY;AAC7C;AAAA,UACD,KAAK;AACJ,yBAAa,QAAQ,EAAE,MAAM,QAAQ,OAAO,aAAa,QAAQ,GAAG,YAAY;AAChF;AAAA,UACD,KAAK;AACJ,yBAAa,OAAO,QAAW;AAAA,cAC9B,gBAAgB,aAAa;AAAA,cAC7B,WAAW,aAAa;AAAA,cACxB,WAAW,aAAa;AAAA,YACzB,CAAC;AACD;AAAA,UACD,KAAK;AACJ;AAAA,cACC;AAAA,cACA,EAAE,MAAM,SAAS,OAAO,aAAa,aAAa,KAAK,EAAE;AAAA,cACzD;AAAA,gBACC,gBAAgB,aAAa;AAAA,gBAC7B,WAAW,aAAa;AAAA,gBACxB,WAAW,aAAa;AAAA,cACzB;AAAA,YACD;AACA;AAAA,UACD,KAAK;AACJ;AAAA,cACC;AAAA,cACA,EAAE,MAAM,SAAS,QAAQ,aAAa,OAAO;AAAA,cAC7C;AAAA,cACA,MAAM;AACL,2BAAW,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC7C,sBAAI,QAAQ,UAAU,OAAW,cAAa,QAAQ,KAAK;AAAA,gBAC5D;AACA,sBAAM,QAAQ,MAAM;AAAA,cACrB;AAAA,YACD;AACA;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,oBAAoB;AAAA,MACpB,0BAA0B;AAAA,MAC1B,qBAAqB;AAAA,IACtB;AAAA,EACD;AACD;AAEA,SAAS,gBAA0B,KAAiC;AACnE,MAAI,QAAQ,IAAI,MAAM,IAA2B;AACjD,MAAI,UAAU,QAAW;AACxB,YAAQ;AAAA,MACP,QAAQ;AAAA,MACR,kBAAkB;AAAA,MAClB,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,kBAAkB;AAAA,MAClB,SAAS,oBAAI,IAAI;AAAA,IAClB;AACA,QAAI,MAAM,IAAI,KAAK;AAAA,EACpB;AACA,QAAM,SAAS;AACf,MAAI,CAAC,MAAM,kBAAkB;AAC5B,UAAM,mBAAmB;AACzB,QAAI,eAAe,MAAM;AACxB,YAAM,SAAS;AACf,YAAM,mBAAmB;AACzB,iBAAW,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC7C,YAAI,QAAQ,UAAU,OAAW,cAAa,QAAQ,KAAK;AAAA,MAC5D;AACA,YAAM,QAAQ,MAAM;AAAA,IACrB,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,8BACR,QACAI,SACO;AACP,QAAM,WAAW,qBAAqB,IAAI,MAA4C;AACtF,MAAI,aAAa,QAAW;AAC3B,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AACA,QAAM,UAAU,SAAS;AACzB,QAAM,kBAAkB,CAAC,GAAG,OAAO;AACnC,MAAI,CAAC,QAAQ,SAASA,OAAM,EAAG,SAAQ,KAAKA,OAAM;AAClD,MAAI;AACH,WAAO,QAAQ,YAAY,CAAC,GAAG,OAAO,GAAG,0BAA0B,QAAQ,MAAM,CAAC;AAAA,EACnF,SAAS,OAAO;AACf,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,eAAe;AACpD,WAAO,QAAQ;AAAA,MACd,CAAC,GAAG,eAAe;AAAA,MACnB,0BAA0B,gBAAgB,MAAM;AAAA,IACjD;AACA,UAAM;AAAA,EACP;AACD;AAEA,SAAS,8BACR,QACAA,SACO;AACP,QAAM,WAAW,qBAAqB,IAAI,MAA4C;AACtF,MAAI,aAAa,QAAW;AAC3B,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AACA,QAAM,UAAU,SAAS;AACzB,MAAI,CAAC,QAAQ,SAASA,OAAM,EAAG;AAC/B,QAAM,kBAAkB,CAAC,GAAG,OAAO;AACnC,QAAM,cAAc,QAAQ,OAAO,CAAC,cAAc,cAAcA,OAAM;AACtE,UAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,WAAW;AAChD,MAAI;AACH,WAAO,QAAQ,YAAY,CAAC,GAAG,WAAW,GAAG,0BAA0B,YAAY,MAAM,CAAC;AAAA,EAC3F,SAAS,OAAO;AACf,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,eAAe;AACpD,WAAO,QAAQ;AAAA,MACd,CAAC,GAAG,eAAe;AAAA,MACnB,0BAA0B,gBAAgB,MAAM;AAAA,IACjD;AACA,UAAM;AAAA,EACP;AACD;AAEA,SAAS,wBACR,QACgE;AAChE,QAAM,SAAS,qBAAqB,IAAI,MAA4C;AACpF,MAAI,WAAW,QAAW;AACzB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AACA,SAAO;AACR;AAEA,SAAS,0BAAqC,aAAyC;AACtF,SAAO,CAAC,QAAQ;AACf,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK,GAAG;AACxC,iBAAW,WAAW,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC7C,YAAI,KAAK,CAAC,CAAC,QAAQ,OAAuC,CAAC,CAAC;AAAA,MAC7D;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,kBACR,WACA,WACA,SAC8B;AAC9B,MAAI,UAAU,WAAW,EAAG,OAAM,IAAI,WAAW,yCAAyC;AAC1F,MAAI,UAAU,WAAW,EAAG,OAAM,IAAI,WAAW,yCAAyC;AAC1F,SAAO,EAAE,WAAW,WAAW,QAAQ;AACxC;AAEA,SAAS,kBACR,WACA,WACA,OACoB;AACpB,MAAI,UAAU,WAAW;AACxB,UAAM,IAAI,WAAW,iDAAiD;AACvE,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,WAAW,6CAA6C;AAC1F,SAAO,EAAE,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,UAAU,GAAI,WAAW,MAAM;AAC9E;AAaA,SAAS,qBAAyC;AACjD,SAAO,EAAE,YAAY,oBAAI,IAAI,GAAG,OAAO,oBAAI,IAAI,EAAE;AAClD;AAEA,SAAS,sBAAsB,OAA2B,WAA4B;AACrF,SAAO,MAAM,WAAW,IAAI,SAAS;AACtC;AAEA,SAAS,uBAAuB,OAA2B,SAAwC;AAClG,QAAM,UAAU,8BAA8B,OAAO,QAAQ,GAAG;AAChE,SAAO,SAAS,cAAc,QAAQ,aAAa,MAAM,WAAW,IAAI,QAAQ,SAAS;AAC1F;AAEA,SAAS,8BACR,OACA,KACmC;AACnC,SAAO,MAAM,MAAM,IAAI,GAAG;AAC3B;AAEA,SAAS,oBAAoB,OAA2B,SAAqC;AAC5F,QAAM,gBAAgB,MAAM,MAAM,IAAI,QAAQ,GAAG;AACjD,MAAI,kBAAkB,QAAW;AAChC,UAAM,WAAW,OAAO,cAAc,SAAS;AAAA,EAChD;AACA,aAAW,CAAC,KAAK,OAAO,KAAK,MAAM,OAAO;AACzC,QAAI,QAAQ,cAAc,QAAQ,aAAa,QAAQ,QAAQ,KAAK;AACnE,YAAM,MAAM,OAAO,GAAG;AACtB;AAAA,IACD;AAAA,EACD;AACA,QAAM,WAAW,IAAI,QAAQ,SAAS;AACtC,QAAM,MAAM,IAAI,QAAQ,KAAK,OAAO;AACrC;AAEA,SAAS,6BACR,OACA,WACmC;AACnC,MAAI,CAAC,MAAM,WAAW,OAAO,SAAS,EAAG,QAAO;AAChD,MAAI;AACJ,MAAI;AACJ,aAAW,CAAC,cAAc,OAAO,KAAK,MAAM,OAAO;AAClD,QAAI,QAAQ,cAAc,WAAW;AACpC,YAAM;AACN,cAAQ;AACR;AAAA,IACD;AAAA,EACD;AACA,MAAI,QAAQ,OAAW,OAAM,MAAM,OAAO,GAAG;AAC7C,SAAO;AACR;AAEA,SAAS,uBACR,OACA,KACmC;AACnC,QAAM,UAAU,MAAM,MAAM,IAAI,GAAG;AACnC,MAAI,YAAY,OAAW,QAAO;AAClC,QAAM,MAAM,OAAO,GAAG;AACtB,QAAM,WAAW,OAAO,QAAQ,SAAS;AACzC,SAAO;AACR;AAEA,SAAS,yBACR,OACA,UACmC;AACnC,QAAM,QAAQ,uBAAuB,OAAO,SAAS,SAAS,GAAG;AACjE,MAAI,UAAU,OAAW,QAAO;AAChC,QAAM,WAAW,2BAA2B,QAAQ;AACpD,MAAI,aAAa,UAAa,sBAAsB,OAAO,SAAS,SAAS,GAAG;AAC/E,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAEA,SAAS,2BACR,UACmC;AACnC,MAAI,SAAS,SAAS,SAAS,OAAQ,QAAO;AAC9C,QAAM,UAAU,0BAA0B,SAAS,QAAQ,KAAK;AAChE,MAAI,YAAY,OAAW,QAAO;AAClC,SAAO;AAAA,IACN,WAAW,QAAQ;AAAA,IACnB,WAAW,QAAQ;AAAA,IACnB,KAAK,SAAS,SAAS;AAAA,EACxB;AACD;AAEA,SAAS,0BAA6B,OAAkD;AACvF,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,EAAE,aAAa,OAAQ,QAAO;AAClC,SAAO;AAAA,IACN,WAAW,MAAM;AAAA,IACjB,WAAW,MAAM;AAAA,IACjB,SAAS,MAAM;AAAA,EAChB;AACD;AAEA,SAAS,2BAA8B,OAAmD;AACzF,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,MAAM,SAAS,YAAY,aAAa,OAAO;AAClD,WAAO;AAAA,MACN,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,SAAS,MAAM;AAAA,IAChB;AAAA,EACD;AACA,MAAI,MAAM,SAAS,WAAW,OAAO,MAAM,UAAU,YAAY,MAAM,MAAM,SAAS,GAAG;AACxF,WAAO;AAAA,MACN,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,OAAO,MAAM;AAAA,IACd;AAAA,EACD;AACA,MAAI,MAAM,SAAS,YAAY,OAAO,MAAM,WAAW,YAAY,MAAM,OAAO,SAAS,GAAG;AAC3F,WAAO;AAAA,MACN,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,QAAQ,MAAM;AAAA,IACf;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,iCAAiC,OAAoC;AAC7E,MAAI,CAAC,SAAS,KAAK,EAAG,QAAO;AAC7B,SAAO,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,SAAS,IACpE,MAAM,YACN;AACJ;AAEA,SAAS,SAAS,OAAkD;AACnE,SAAO,OAAO,UAAU,YAAY,UAAU;AAC/C;AAEA,SAAS,WAAW,OAAyB;AAC5C,SAAO,SAAS,KAAK,KAAK,OAAO,MAAM,SAAS;AACjD;AAEA,SAAS,4BAA+B,UAAyC;AAChF,SAAO,SAAS;AACjB;AAEA,SAAS,6BAAgC,UAA0C;AAClF,SAAO,SAAS,SAAS,YAAY,SAAS,SAAS;AACxD;AAEA,SAAS,wBACR,OACA,QACA,UACA,MACsC;AACtC,SAAO,MAAM;AAAA,IACZ,CAAC,QAAQ,QAAQ;AAAA,IACjB,CAAC,QAAQ;AAIR,YAAM,QAAQ,IAAI,MAAM,IAAW,KAAK;AAAA,QACvC,SAAS,mBAAmB;AAAA,MAC7B;AACA,YAAM,QAAyC,CAAC;AAChD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,UAAU,2BAA2B,MAAM,QAAQ;AACzD,cAAI,YAAY,OAAW;AAC3B,cAAI,uBAAuB,MAAM,SAAS,OAAO,EAAG;AACpD,8BAAoB,MAAM,SAAS,OAAO;AAAA,QAC3C,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS,QAAQ;AAC/E,gBAAM,WAAW,2BAAsC,MAAM,SAAS,QAAQ,KAAK;AACnF,cAAI,aAAa,QAAW;AAC3B,kBAAMC,aAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,gBAAIA,eAAc,UAAa,sBAAsB,MAAM,SAASA,UAAS,GAAG;AAC/E,2CAA6B,MAAM,SAASA,UAAS;AAAA,YACtD;AACA;AAAA,UACD;AACA,gBAAM,YAAY,4BAA4B,QAAQ;AACtD,cAAI,sBAAsB,MAAM,SAAS,SAAS,GAAG;AACpD,gBAAI,6BAA6B,QAAQ,GAAG;AAC3C,2CAA6B,MAAM,SAAS,SAAS;AAAA,YACtD;AACA,kBAAM,KAAK,QAAQ;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,mCAAyB,MAAM,SAAS,MAAM,QAAQ;AAAA,QACvD,WAAW,MAAM,SAAS,aAAa;AACtC,iCAAuB,MAAM,SAAS,MAAM,GAAG;AAAA,QAChD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU;AAChB,qCAA6B,MAAM,SAAS,QAAQ,SAAS;AAAA,MAC9D;AACA,UAAI,MAAM,IAAI,KAAK;AACnB,iBAAW,YAAY,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,CAAC,CAAC;AAAA,IAC5D;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,sBACR,OACA,WACA,MACoC;AACpC,SAAO,MAAM;AAAA,IACZ,CAAC,SAAS;AAAA,IACV,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,WAAW;AACjB,YAAI,SAAS,SAAS,UAAU;AAC/B,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,SAAS,SAAS;AAAA,cACnB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,YAAY,SAAS,qBAAqB,0BAA0B,MAAM;AAAA,EAC1F;AACD;AAEA,SAAS,qBACR,OACA,QACA,WACA,UACA,MACyB;AACzB,SAAO,MAAM;AAAA,IACZ,CAAC,QAAQ,WAAW,QAAQ;AAAA,IAC5B,CAAC,QAAQ;AAER,YAAM,QACL,IAAI,MAAM,IAAW,KACpB;AAAA,QACA,QAAQ,EAAE,OAAO,QAAQ,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,EAAE;AAAA,QAC1E,SAAS,mBAAmB;AAAA,MAC7B;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,UAAU,2BAA2B,MAAM,QAAQ;AACzD,cAAI,YAAY,QAAW;AAC1B,gBAAI,uBAAuB,MAAM,SAAS,OAAO,GAAG;AACnD,oBAAM,SAAS;AAAA,gBACd,GAAG,MAAM;AAAA,gBACT,OAAO;AAAA,gBACP,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB,QAAQ,MAAM,OAAO,SAAS;AAAA,cAC/B;AACA;AAAA,YACD;AACA,gCAAoB,MAAM,SAAS,OAAO;AAC1C,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,QAAQ;AAAA,cACnB,WAAW,QAAQ;AAAA,YACpB;AAAA,UACD;AAAA,QACD,WACC,MAAM,SAAS,aACf,MAAM,SAAS,sBACf,MAAM,SAAS,kBACf,MAAM,SAAS,gBACd;AACD,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,gBAAM,UAAU,yBAAyB,MAAM,SAAS,MAAM,QAAQ;AACtE,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,GAAI,YAAY,SACb,CAAC,IACD,EAAE,WAAW,QAAQ,WAAW,WAAW,QAAQ,UAAU;AAAA,YAChE,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,WAAW,MAAM,SAAS,aAAa;AACtC,gBAAM,UAAU,uBAAuB,MAAM,SAAS,MAAM,GAAG;AAC/D,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,GAAI,YAAY,SACb,CAAC,IACD,EAAE,WAAW,QAAQ,WAAW,WAAW,QAAQ,UAAU;AAAA,YAChE,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS,QAAQ;AAC/E,gBAAM,WAAW,2BAAsC,MAAM,SAAS,QAAQ,KAAK;AACnF,cAAI,aAAa,QAAW;AAC3B,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,gBAAI,cAAc,QAAW;AAC5B,oBAAM,UAAU,6BAA6B,MAAM,SAAS,SAAS;AACrE,kBAAI,YAAY,QAAW;AAC1B,sBAAM,SAAS;AAAA,kBACd,GAAG,MAAM;AAAA,kBACT,OAAO;AAAA,kBACP,WAAW,QAAQ;AAAA,kBACnB;AAAA,kBACA,QAAQ,MAAM,OAAO,SAAS;AAAA,gBAC/B;AAAA,cACD;AAAA,YACD;AAAA,UACD;AAAA,QACD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,WAAW;AACjB,YAAI,SAAS,SAAS,UAAU;AAC/B,uCAA6B,MAAM,SAAS,SAAS,SAAS;AAC9D,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,WAAW,SAAS;AAAA,YACpB,WAAW,SAAS;AAAA,YACpB,WAAW,MAAM,OAAO,YAAY;AAAA,UACrC;AAAA,QACD,WAAW,SAAS,SAAS,SAAS;AACrC,uCAA6B,MAAM,SAAS,SAAS,SAAS;AAC9D,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,WAAW,SAAS;AAAA,YACpB,WAAW,SAAS;AAAA,YACpB,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,OAAO;AACN,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,WAAW,SAAS;AAAA,YACpB,WAAW,SAAS;AAAA,UACrB;AAAA,QACD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU;AAChB,qCAA6B,MAAM,SAAS,QAAQ,SAAS;AAC7D,cAAM,SAAS;AAAA,UACd,GAAG,MAAM;AAAA,UACT,OAAO;AAAA,UACP,WAAW,QAAQ;AAAA,UACnB,WAAW,QAAQ;AAAA,UACnB,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC9B,UAAU,MAAM,OAAO,WAAW;AAAA,QACnC;AAAA,MACD;AACA,YAAM,SAAS,EAAE,GAAG,MAAM,QAAQ,SAAS,MAAM,QAAQ,WAAW,KAAK;AACzE,UAAI,MAAM,IAAI,KAAK;AACnB,UAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,MAAM,CAAC,CAAC;AAAA,IAClC;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,qBACR,OACA,WACA,UACA,QACA,MACwB;AACxB,SAAO,MAAM;AAAA,IACZ,CAAC,WAAW,UAAU,MAAM;AAAA,IAC5B,CAAC,QAAQ;AACR,YAAM,UAAU,IAAI,MAAM,IAAwB,KAAK,mBAAmB;AAC1E,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,UAAU,2BAA2B,MAAM,QAAQ;AACzD,cAAI,YAAY,QAAW;AAC1B,gBAAI,uBAAuB,SAAS,OAAO,GAAG;AAC7C,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,WAAW,QAAQ;AAAA,oBACnB,WAAW,QAAQ;AAAA,oBACnB,OAAO,8CAA8C,QAAQ,SAAS;AAAA,kBACvE;AAAA,gBACD;AAAA,cACD,CAAC;AACD;AAAA,YACD;AACA,gCAAoB,SAAS,OAAO;AAAA,UACrC;AAAA,QACD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,WAAW;AACjB,YAAI,SAAS,SAAS,SAAS;AAC9B,uCAA6B,SAAS,SAAS,SAAS;AACxD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,OAAO,SAAS;AAAA,cACjB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,SAAS,SAAS,UAAU;AACtC,uCAA6B,SAAS,SAAS,SAAS;AAAA,QACzD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU;AAChB,qCAA6B,SAAS,QAAQ,SAAS;AACvD,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA,EAAE,WAAW,QAAQ,WAAW,WAAW,QAAQ,WAAW,OAAO,QAAQ,MAAM;AAAA,UACpF;AAAA,QACD,CAAC;AAAA,MACF;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS,QAAQ;AACxE,gBAAM,WAAW,2BAAsC,MAAM,SAAS,QAAQ,KAAK;AACnF,cAAI,aAAa,QAAW;AAC3B,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAM,UACL,cAAc,SACX,SACA,6BAA6B,SAAS,SAAS;AACnD,gBAAI,YAAY,OAAW;AAC3B,gBAAI,KAAK;AAAA,cACR;AAAA,gBACC;AAAA,gBACA;AAAA,kBACC,WAAW,QAAQ;AAAA,kBACnB,WAAW,QAAQ;AAAA,kBACnB,OAAO;AAAA,gBACR;AAAA,cACD;AAAA,YACD,CAAC;AAAA,UACF;AACA;AAAA,QACD;AACA,YAAI,MAAM,SAAS,QAAQ;AAC1B,gBAAM,UAAU,yBAAyB,SAAS,MAAM,QAAQ;AAChE,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,OAAO,OAAO,MAAM,KAAK;AAAA,cAC1B;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,aAAa;AACtC,gBAAM,UAAU,uBAAuB,SAAS,MAAM,GAAG;AACzD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,OAAO,OAAO,MAAM,KAAK;AAAA,cAC1B;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC;AAAA,QAC5C,WACC,MAAM,SAAS,sBACf,MAAM,SAAS,kBACf,MAAM,SAAS,gBACd;AACD,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,OAAO,6BAA6B,KAAK,EAAE,CAAC,CAAC,CAAC;AAAA,QACpE;AAAA,MACD;AACA,UAAI,MAAM,IAAI,OAAO;AAAA,IACtB;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,6BACR,OACS;AACT,MAAI,MAAM,SAAS,oBAAoB;AACtC,WAAO,+BAA+B,MAAM,MAAM,2BAA2B,MAAM,QAAQ;AAAA,EAC5F;AACA,MAAI,MAAM,SAAS,gBAAgB;AAClC,WAAO,2BAA2B,MAAM,GAAG,gCAAgC,MAAM,QAAQ;AAAA,EAC1F;AACA,MAAI,MAAM,SAAS,gBAAgB;AAClC,WAAO,oBAAoB,MAAM,OAAO,uCAAuC,MAAM,SAAS;AAAA,EAC/F;AACA,SAAO;AACR;AAEA,SAAS,wBACR,UAC2D;AAC3D,QAAM,MAAM,oBAAI,IAAyD;AACzE,aAAW,WAAW,UAAU;AAC/B,QAAI,QAAQ,UAAU,WAAW,GAAG;AACnC,YAAM,IAAI,WAAW,8CAA8C;AAAA,IACpE;AACA,QAAI,IAAI,IAAI,QAAQ,SAAS,GAAG;AAC/B,YAAM,IAAI,WAAW,yCAAyC,QAAQ,SAAS,GAAG;AAAA,IACnF;AACA,QAAI,IAAI,QAAQ,WAAW,QAAQ,MAAM;AAAA,EAC1C;AACA,SAAO;AACR;AAYA,SAAS,6BACR,QACA,UACA,mBAC4B;AAC5B,QAAM,gBAAgB,wBAAwB,QAAQ;AACtD,MAAI,kBAAkB,QAAW;AAChC,WAAO,EAAE,MAAM,WAAW,OAAO,cAAc;AAAA,EAChD;AACA,MAAI,SAAS,cAAc,mBAAmB;AAC7C,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,oCAAoC,SAAS,SAAS,2BAA2B,iBAAiB;AAAA,IAC1G;AAAA,EACD;AACA,QAAM,MAAM,SAAS,SAAS;AAC9B,QAAM,WAAW,OAAO,SAAS;AACjC,MAAI,OAAO,OAAO,QAAQ;AACzB,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,0CAA0C,GAAG,cAAc,OAAO,MAAM;AAAA,IAChF;AAAA,EACD;AACA,MAAI,MAAM,UAAU;AACnB,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,6CAA6C,GAAG,cAAc,QAAQ;AAAA,IAC9E;AAAA,EACD;AACA,MAAI,SAAS,SAAS,SAAS,OAAO,cAAc;AACnD,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,GAAG,SAAS,SAAS,oCAAoC,SAAS,SAAS,MAAM,oBAAoB,OAAO,YAAY;AAAA,IAChI;AAAA,EACD;AACA,SAAO,SAAS;AAChB,SAAO,eAAe,SAAS,SAAS;AACxC,MAAI,SAAS,SAAS,OAAQ,QAAO,EAAE,MAAM,WAAW;AACxD,MAAI,SAAS,SAAS,SAAS,QAAQ;AACtC,WAAO,EAAE,MAAM,WAAW,OAAO,4DAA4D;AAAA,EAC9F;AACA,QAAM,UAAU,0BAA6B,SAAS,QAAQ,KAAK;AACnE,MAAI,YAAY,QAAW;AAC1B,WAAO,EAAE,MAAM,WAAW,OAAO,gDAAgD;AAAA,EAClF;AACA,SAAO,EAAE,MAAM,WAAW,SAAS,IAAI;AACxC;AAEA,SAAS,0BACR,OACA,SACA,MACA,mBACA,UACA,eACkD;AAClD,SAAO,MAAM;AAAA,IACZ,CAAC,OAAO;AAAA,IACR,CAAC,QAAQ;AACR,YAAM,SAAS,IAAI,MAAM,IAA2B,KAAK,EAAE,QAAQ,GAAG,cAAc,EAAE;AACtF,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,WAAW;AACjB,cAAM,WAAW,6BAA6B,QAAQ,UAAU,iBAAiB;AACjF,YAAI,SAAS,SAAS,WAAY;AAClC,YAAI,SAAS,SAAS,WAAW;AAChC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,SAAS,MAAM,CAAC,CAAC,CAAC;AAC/D;AAAA,QACD;AACA,cAAM,EAAE,SAAS,IAAI,IAAI;AACzB,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,SAAS,IAAI,CAAC,CAAC,CAAC;AACtD,cAAM,UAAU,SAAS,IAAI,QAAQ,SAAS;AAC9C,YAAI,YAAY,QAAW;AAC1B,cAAI,CAAC,cAAe;AACpB,gBAAM,QAAQ,uCAAuC,QAAQ,SAAS;AACtE,gBAAM,WAAW,wBAAwB,SAAS,KAAK;AACvD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB;AAAA,gBACA,SAAS,EAAE,MAAM,QAAQ,SAAS,UAAU,WAAW,QAAQ,UAAU;AAAA,cAC1E;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,YAAI;AACH,gBAAM,UAAU,QAAQ,OAAO;AAC/B,cAAI,WAAW,OAAO,GAAG;AACxB,kBAAM,IAAI,MAAM,sEAAsE;AAAA,UACvF;AACA,gBAAM,WAAW;AAAA,YAChB,MAAM;AAAA,YACN,WAAW,QAAQ;AAAA,YACnB,WAAW,QAAQ;AAAA,YACnB;AAAA,UACD;AACA,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB,SAAS,EAAE,MAAM,QAAQ,SAAS,UAAU,WAAW,QAAQ,UAAU;AAAA,cAC1E;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,uCAA6B,KAAK;AAClC,gBAAM,UAAUC,cAAa,KAAK;AAClC,gBAAM,WAAW,wBAAwB,SAAS,OAAO;AACzD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB,OAAO;AAAA,gBACP,SAAS,EAAE,MAAM,QAAQ,SAAS,UAAU,WAAW,QAAQ,UAAU;AAAA,cAC1E;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AACA,UAAI,MAAM,IAAI,MAAM;AAAA,IACrB;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,wBACR,SACA,OACgC;AAChC,SAAO;AAAA,IACN,MAAM;AAAA,IACN,WAAW,QAAQ;AAAA,IACnB,WAAW,QAAQ;AAAA,IACnB;AAAA,EACD;AACD;AAEA,SAAS,oCACR,OACA,QACA,MACyD;AACzD,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,aACE,MAAM,SAAS,cAAc,MAAM,SAAS,eAC7C,MAAM,YAAY,QACjB;AACD,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,QACnC;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,4BACR,OACA,QACA,MACoC;AACpC,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAEA,SAAS,0BACR,OACA,QACA,MAC8B;AAC9B,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,SACH,IAAI,MAAM,IAA2B,KACpC,EAAE,OAAO,QAAQ,SAAS,GAAG,UAAU,GAAG,QAAQ,EAAE;AACtD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,YAAY;AAC9B,mBAAS;AAAA,YACR,GAAG;AAAA,YACH,OAAO;AAAA,YACP,WAAW,MAAM;AAAA,YACjB,WAAW,MAAM;AAAA,YACjB,SAAS,OAAO,UAAU;AAAA,UAC3B;AAAA,QACD,WAAW,MAAM,SAAS,YAAY;AACrC,mBAAS;AAAA,YACR,GAAG;AAAA,YACH,OAAO;AAAA,YACP,WAAW,MAAM;AAAA,YACjB,WAAW,MAAM;AAAA,YACjB,UAAU,OAAO,WAAW;AAAA,YAC5B,QAAQ,OAAO,SAAS;AAAA,UACzB;AAAA,QACD,WAAW,MAAM,SAAS,WAAW;AACpC,mBAAS,EAAE,GAAG,QAAQ,OAAO,WAAW,QAAQ,OAAO,SAAS,EAAE;AAAA,QACnE;AAAA,MACD;AACA,UAAI,MAAM,IAAI,MAAM;AACpB,UAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,IAC5B;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,0BACR,OACA,QACA,MACwB;AACxB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,YAAY;AAC9B,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,EAAE,WAAW,MAAM,WAAW,WAAW,MAAM,WAAW,OAAO,MAAM,MAAM;AAAA,YAC9E;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC;AAAA,QAC5C;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB,0BAA0B,MAAM;AAAA,EAC7F;AACD;AAEA,SAAS,cACR,KACA,OACA,UACA,MACA,QACA,KACO;AACP,QAAM,YAAY,KAAK,gBAAgB;AACvC,MAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,GAAG;AACjD,UAAM,IAAI,WAAW,+DAA+D;AAAA,EACrF;AACA,QAAM,UAAqC,EAAE,SAAS;AACtD,QAAM,WAAW,CAAC,YAA0C;AAC3D,YAAQ,QAAQ,WAAW,MAAM;AAChC,cAAQ,QAAQ;AAChB,UAAI,CAAC,MAAM,UAAU,CAAC,MAAM,QAAQ,IAAI,QAAQ,SAAS,GAAG,EAAG;AAC/D,UAAI,KAAK;AAAA,QACR;AAAA,UACC;AAAA,UACA;AAAA,YACC,MAAM;AAAA,YACN,KAAK,QAAQ,SAAS;AAAA,YACtB,SAAS,QAAQ,SAAS;AAAA,UAC3B;AAAA,QACD;AAAA,MACD,CAAC;AACD,UAAI,CAAC,YAAY,QAAQ,QAAQ,SAAS,OAAO,GAAG;AACnD,cAAM,QAAQ,GAAG,KAAK,SAAS,yBAAyB,QAAQ,SAAS,GAAG;AAC5E,cAAM,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACzC,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA;AAAA,cACC,MAAM;AAAA,cACN,KAAK,QAAQ,SAAS;AAAA,cACtB,SAAS,QAAQ,SAAS;AAAA,cAC1B;AAAA,YACD;AAAA,UACD;AAAA,QACD,CAAC;AACD;AAAA,MACD;AACA,YAAM,UAAU,QAAQ,SAAS,UAAU;AAC3C,YAAM,UAAU,iBAAiB,QAAQ,OAAO,KAAK;AACrD,UAAI,KAAK;AAAA,QACR;AAAA,UACC;AAAA,UACA;AAAA,YACC,MAAM;AAAA,YACN,KAAK,QAAQ,SAAS;AAAA,YACtB;AAAA,YACA;AAAA,YACA,OAAO,GAAG,KAAK,SAAS,yBAAyB,QAAQ,SAAS,GAAG;AAAA,UACtE;AAAA,QACD;AAAA,MACD,CAAC;AACD,YAAM,QAAQ,mBAA6B;AAAA,QAC1C,WAAW,QAAQ;AAAA,QACnB,MAAM,QAAQ;AAAA,QACd,KAAK,QAAQ,SAAS;AAAA,QACtB,QAAQ,MAAM;AAAA,QACd,SAAS,QAAQ;AAAA,QACjB,gBAAgB,QAAQ,SAAS;AAAA,QACjC;AAAA,QACA,aAAa,OAAO;AAAA,QACpB,aAAa,IAAI;AAAA,QACjB,WAAW,QAAQ,SAAS;AAAA,MAC7B,CAAC;AACD,cAAQ,QAAQ,WAAW,MAAM;AAChC,gBAAQ,QAAQ;AAChB,YAAI,CAAC,MAAM,UAAU,CAAC,MAAM,QAAQ,IAAI,QAAQ,SAAS,GAAG,EAAG;AAC/D,gBAAQ,WAAW;AACnB,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,UAAU,MAAM,CAAC,CAAC,CAAC;AAC1D,iBAAS,KAAK;AAAA,MACf,GAAG,OAAO;AAAA,IACX,GAAG,SAAS;AAAA,EACb;AACA,QAAM,QAAQ,IAAI,SAAS,SAAS,KAAK,OAAO;AAChD,WAAS,QAAQ;AAClB;AAEA,SAAS,eACR,KACA,OACA,OACA,WACO;AACP,MAAI,iBAAiB,KAAK,GAAG;AAC5B,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC;AAC5D;AAAA,EACD;AACA,QAAM,UAAU,wBAAwB,KAAK;AAC7C,MAAI,YAAY,QAAW;AAC1B,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,QAAQ,CAAC,CAAC,CAAC;AACxD;AAAA,EACD;AACA,QAAM,WAAW;AACjB,MAAI,SAAS,cAAc,WAAW;AACrC,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,UAAU;AAAA,UACV,QAAQ,SAAS;AAAA,QAClB;AAAA,MACD;AAAA,IACD,CAAC;AACD;AAAA,EACD;AACA,QAAM,MAAM,SAAS,SAAS;AAC9B,QAAM,WAAW,MAAM,SAAS;AAChC,MAAI,OAAO,MAAM,QAAQ;AACxB,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,aAAa,KAAK,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC;AACrE;AAAA,EACD;AACA,MAAI,MAAM,UAAU;AACnB,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,gBAAgB,KAAK,SAAS,CAAC,CAAC,CAAC;AAC5D;AAAA,EACD;AACA,MAAI,SAAS,SAAS,SAAS,MAAM,cAAc;AAClD,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,OAAO,GAAG,SAAS,oBAAoB,SAAS,SAAS,MAAM,oBAAoB,MAAM,YAAY;AAAA,QACtG;AAAA,MACD;AAAA,IACD,CAAC;AACD;AAAA,EACD;AACA,QAAM,eAAe,SAAS,SAAS;AACvC,QAAM,SAAS;AACf,MAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC;AAC7D,MAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,SAAS,CAAC,CAAC,CAAC;AAClD,MAAI,SAAS,SAAS,SAAS,SAAS,SAAS,cAAc,QAAW;AACzE,UAAM,UAAU,MAAM,QAAQ,IAAI,SAAS,SAAS,SAAS;AAC7D,QAAI,YAAY,QAAW;AAC1B,UAAI,KAAK;AAAA,QACR,CAAC,QAAQ,EAAE,MAAM,gBAAgB,SAAS,OAAO,WAAW,SAAS,SAAS,UAAU,CAAC;AAAA,MAC1F,CAAC;AACD;AAAA,IACD;AACA,QAAI,SAAS,UAAU,OAAW,cAAa,QAAQ,KAAK;AAC5D,UAAM,QAAQ,OAAO,SAAS,SAAS,SAAS;AAChD,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,WAAW,SAAS,SAAS;AAAA,UAC7B;AAAA,UACA,UAAU,QAAQ;AAAA,QACnB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,EACF,WAAW,SAAS,SAAS,UAAU,SAAS,SAAS,cAAc,QAAW;AACjF,UAAM,UAAU,MAAM,QAAQ,IAAI,SAAS,SAAS,SAAS;AAC7D,QAAI,YAAY,QAAW;AAC1B,UAAI,KAAK;AAAA,QACR,CAAC,QAAQ,EAAE,MAAM,gBAAgB,SAAS,QAAQ,WAAW,SAAS,SAAS,UAAU,CAAC;AAAA,MAC3F,CAAC;AACD;AAAA,IACD;AACA,QAAI,SAAS,UAAU,OAAW,cAAa,QAAQ,KAAK;AAC5D,UAAM,QAAQ,OAAO,SAAS,SAAS,SAAS;AAChD,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,WAAW,SAAS,SAAS;AAAA,UAC7B;AAAA,UACA,UAAU,QAAQ;AAAA,UAClB,OAAO,mBAAmB,SAAS,SAAS,aAAa;AAAA,QAC1D;AAAA,MACD;AAAA,IACD,CAAC;AAAA,EACF;AACD;AAEA,SAAS,wBAAwB,UAAuC;AACvE,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACtD,WAAO;AAAA,EACR;AACA,QAAM,YAAY;AAClB,MAAI,OAAO,UAAU,cAAc,YAAY,UAAU,UAAU,WAAW,GAAG;AAChF,WAAO;AAAA,EACR;AACA,MACC,OAAO,UAAU,SAAS,YAC1B,CAAC,cAAc,IAAI,UAAU,IAA8B,GAC1D;AACD,WAAO;AAAA,EACR;AACA,QAAM,WAAW,UAAU;AAC3B,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACtD,WAAO;AAAA,EACR;AACA,MAAI,CAAC,sBAAsB,SAAS,GAAG,GAAG;AACzC,WAAO;AAAA,EACR;AACA,MAAI,CAAC,yBAAyB,SAAS,MAAM,GAAG;AAC/C,WAAO;AAAA,EACR;AACA,MACC,OAAO,SAAS,mBAAmB,YAClC,SAAS,eAA0B,WAAW,GAC9C;AACD,WAAO;AAAA,EACR;AACA,MAAI,CAAC,sBAAsB,SAAS,OAAO,GAAG;AAC7C,WAAO;AAAA,EACR;AACA,MACC,CAAC,sBAAsB,SAAS,WAAW,KAC1C,SAAS,cAA0B,SAAS,SAC5C;AACD,WAAO;AAAA,EACR;AACA,MAAI,SAAS,cAAc,UAAa,CAAC,sBAAsB,SAAS,SAAS,GAAG;AACnF,WAAO;AAAA,EACR;AACA,OAAK,UAAU,SAAS,SAAS,UAAU,SAAS,WAAW,SAAS,cAAc,QAAW;AAChG,WAAO,uBAAuB,UAAU,IAAI;AAAA,EAC7C;AACA,QAAM,eAAe;AAAA,IACpB,UAAU;AAAA,IACV,UAAU;AAAA,IACV;AAAA,EACD;AACA,MAAI,iBAAiB,OAAW,QAAO;AACvC,SAAO;AACR;AAEA,SAAS,gBAAgB,OAAoC;AAC5D,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAChD,WAAO;AAAA,EACR;AACA,QAAM,OAAQ,MAAsC;AACpD,MACC,SAAS,WACT,SAAS,UACT,SAAS,SACT,SAAS,UACT,SAAS,SACR;AACD,WAAO;AAAA,EACR;AACA,OACE,SAAS,SAAS,SAAS,WAC5B,CAAC,sBAAuB,MAA2C,SAAS,GAC3E;AACD,WAAO,eAAe,IAAI;AAAA,EAC3B;AACA,SAAO;AACR;AAEA,SAAS,gBACR,OACA,QACA,MACsC;AACtC,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAY,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,QAAQ,CAAC,CAAC;AAAA,MACnE;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,qBAAqB;AAAA,EAC3D;AACD;AAEA,SAAS,YACR,OACA,QACA,MACsB;AACtB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,OAAO;AACzB,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,WAAW,MAAM,WAAW,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AAAA,QAC9E;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,SAAS,SAAS,iBAAiB;AAAA,EACnD;AACD;AAEA,SAAS,aACR,OACA,QACA,MACuB;AACvB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,QAAQ;AAC1B,cAAI,KAAK;AAAA,YACR,CAAC,QAAQ,EAAE,WAAW,MAAM,WAAW,UAAU,MAAM,UAAU,OAAO,MAAM,MAAM,CAAC;AAAA,UACtF,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,UAAU,SAAS,kBAAkB;AAAA,EACrD;AACD;AAEA,SAAS,cACR,OACA,QACA,MACA,WACyB;AACzB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,OACH,IAAI,MAAM,IAAsB,KAC/B;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,SAAS;AAAA,QACT,UAAU;AAAA,QACV,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,QAAQ;AAAA,MACT;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,EAAE,KAAK,QAAQ,IAAI,MAAM,SAAS;AACxC,gBAAM,WAAW,eAAe,MAAM,SAAS,IAAI;AACnD,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OACC,MAAM,SAAS,SAAS,UACrB,YACA,MAAM,SAAS,SAAS,UACvB,WACA;AAAA,YACL,SAAS,KAAK,IAAI,KAAK,SAAS,MAAM,CAAC;AAAA,YACvC,SACC,MAAM,SAAS,SAAS,UACrB,IACA,YAAY,YAAY,IACvB,KAAK,UAAU,IACf,KAAK;AAAA,YACV,UAAU,WAAW,KAAK,WAAW,IAAI,KAAK;AAAA,YAC9C,SAAS;AAAA,UACV;AAAA,QACD,WAAW,MAAM,SAAS,OAAO;AAChC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO,MAAM,SAAS,SAAS,UAAU,WAAW;AAAA,YACpD,SAAS,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC;AAAA,YACrC,OAAO,KAAK,QAAQ;AAAA,YACpB,SAAS,MAAM,SAAS,SAAS;AAAA,UAClC;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC;AAAA,YACrC,QAAQ,KAAK,SAAS;AAAA,YACtB,QAAQ,KAAK,SAAS;AAAA,YACtB,SAAS,MAAM,SAAS,SAAS;AAAA,UAClC;AAAA,QACD,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,aAAa;AACtC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC;AAAA,YACrC,QAAQ,KAAK,SAAS;AAAA,YACtB,SAAS,MAAM;AAAA,UAChB;AAAA,QACD,WAAW,MAAM,SAAS,UAAU;AACnC,iBAAO,EAAE,GAAG,MAAM,QAAQ,MAAM,OAAO;AAAA,QACxC,WAAW,MAAM,SAAS,gBAAgB;AACzC,iBAAO,EAAE,GAAG,MAAM,OAAO,WAAW,QAAQ,KAAK,SAAS,GAAG,SAAS,MAAM,IAAI;AAAA,QACjF,WAAW,MAAM,SAAS,oBAAoB;AAC7C,iBAAO,EAAE,GAAG,MAAM,OAAO,WAAW,QAAQ,KAAK,SAAS,EAAE;AAAA,QAC7D,WAAW,MAAM,SAAS,kBAAkB,MAAM,SAAS,WAAW;AACrE,iBAAO,EAAE,GAAG,MAAM,OAAO,WAAW,QAAQ,KAAK,SAAS,EAAE;AAAA,QAC7D,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS;AACvE,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,QAAQ,KAAK,SAAS;AAAA,YACtB,SAAS,MAAM,SAAS,SAAS;AAAA,UAClC;AAAA,QACD,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS;AACvE,iBAAO,EAAE,GAAG,MAAM,OAAO,UAAU,SAAS,MAAM,SAAS,SAAS,IAAI;AAAA,QACzE;AAAA,MACD;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,mBAAmB;AAAA,EACvD;AACD;AAEA,SAAS,cACR,OACA,QACA,MACgB;AAChB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,OAAQ,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,iBAClD,MAAM,SAAS,YAAa,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,iBAC5D,MAAM,SAAS,gBAAgB;AACvC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,GAAG,IAAI,iBAAiB,MAAM,GAAG,gCAAgC,MAAM,QAAQ;AAAA,YAChF;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS;AACvE,cAAI,KAAK,CAAC,CAAC,QAAQ,mBAAmB,MAAM,SAAS,SAAS,uBAAuB,CAAC,CAAC,CAAC;AAAA,QACzF,WAAW,MAAM,SAAS,oBAAoB;AAC7C,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,GAAG,IAAI,qBAAqB,MAAM,MAAM,2BAA2B,MAAM,QAAQ;AAAA,YAClF;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,gBAAgB;AACzC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,GAAG,IAAI,UAAU,MAAM,OAAO,uCAAuC,MAAM,SAAS;AAAA,YACrF;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,QACjC;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,mBAAmB;AAAA,EACvD;AACD;AAEA,SAAS,cACR,OACA,QACA,MACe;AACf,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,SAAU,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,MAAM,CAAC,CAAC;AAAA,MAC/D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,mBAAmB;AAAA,EACvD;AACD;AAEA,SAAS,gBACR,OACA,QACA,MAC0B;AAC1B,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,cAAc,eAAe,MAAM,SAAS,IAAI,GAAG;AACrE,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,KAAK,MAAM,SAAS,SAAS;AAAA,gBAC7B,SAAS,MAAM,SAAS,SAAS;AAAA,gBACjC,aAAa,MAAM,SAAS,SAAS;AAAA,cACtC;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,qBAAqB;AAAA,EAC3D;AACD;AAEA,SAAS,mBACRC,OACA,WACqC;AACrC,SAAO,IAAI,MAAMA,OAAM;AAAA,IACtB,IAAI,QAAQ,UAAU;AACrB,UAAI,aAAa,QAAQ;AACxB,eAAO,CAAC,SAAe,OAAO,KAAK,iBAAiB,MAAM,SAAS,CAAC;AAAA,MACrE;AACA,YAAM,QAAQ,QAAQ,IAAI,QAAQ,UAAU,MAAM;AAClD,aAAO,OAAO,UAAU,aAAa,MAAM,KAAK,MAAM,IAAI;AAAA,IAC3D;AAAA,EACD,CAAC;AACF;AAEA,SAAS,iBAAiB,MAAY,WAAyB;AAC9D,SAAO,KAAK,IAAI,CAAC,QAAQ;AACxB,QAAI,IAAI,CAAC,MAAM,OAAQ,QAAO;AAC9B,QAAI,IAAI,CAAC,MAAM,SAAS;AACvB,aAAO;AAAA,QACN;AAAA,QACA;AAAA,UACC,GAAG,SAAS,4BAA4B;AAAA,YACvC,aAAa,IAAI,CAAC,CAAC;AAAA,UACpB,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AACA,QAAI,IAAI,CAAC,MAAM,YAAY;AAC1B,aAAO;AAAA,QACN;AAAA,QACA;AAAA,UACC,GAAG,SAAS;AAAA,QACb;AAAA,MACD;AAAA,IACD;AACA,WAAO;AAAA,MACN;AAAA,MACA;AAAA,QACC,GAAG,SAAS,oDAAoD,IAAI,CAAC,CAAC;AAAA,MACvE;AAAA,IACD;AAAA,EACD,CAAC;AACF;AAEA,SAAS,eAAe,OAAyC;AAChE,SAAO,EAAE,4BAA4B,MAAM,MAAM;AAClD;AAEA,SAAS,iBAAiB,OAAmD;AAC5E,SACC,OAAO,UAAU,YACjB,UAAU,QACT,MAAmC,+BAA+B,QACnE,OAAQ,MAAmC,UAAU;AAEvD;AAEA,SAAS,eAAe,MAAuC;AAC9D,SAAO,SAAS,WAAW,SAAS,UAAU,SAAS;AACxD;AAEA,SAAS,sBAAsB,OAAiC;AAC/D,SAAO,OAAO,cAAc,KAAK,KAAM,QAAmB;AAC3D;AAEA,SAAS,yBAAyB,OAAiC;AAClE,SAAO,OAAO,cAAc,KAAK,KAAM,SAAoB;AAC5D;AAEA,SAAS,uBACR,MACA,SACA,QACqB;AACrB,QAAM,OACL,OAAO,YAAY,YAAY,YAAY,OACvC,QAAwC,OACzC;AACJ,UAAQ,MAAM;AAAA,IACb,KAAK;AACJ,aAAO,SAAS,UAAW,QAAyC,UAAU,SAC3E,SACA,GAAG,MAAM;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AACJ,aAAO,SAAS,WAAY,QAAyC,UAAU,SAC5E,SACA,GAAG,MAAM,KAAK,IAAI;AAAA,IACtB,KAAK;AACJ,aAAO,SAAS,YAAa,QAA0C,WAAW,SAC/E,SACA,GAAG,MAAM;AAAA,IACb,KAAK;AACJ,aAAO,SAAS,UAAU,SAAY,GAAG,MAAM;AAAA,IAChD,KAAK;AAAA,IACL,KAAK;AACJ,aAAO,YAAY,SAChB,SACA,GAAG,MAAM,KAAK,IAAI;AAAA,EACvB;AACD;AAEA,SAAS,mBAAmB,SAAkB,UAA4B;AACzE,MACC,OAAO,YAAY,YACnB,YAAY,QACX,QAAwC,SAAS,SACjD;AACD,WAAQ,QAAyC;AAAA,EAClD;AACA,SAAO;AACR;AAEA,SAAS,6BAA6B,OAAsB;AAC3D,QAAM,UAAUD,cAAa,KAAK;AAClC,MACC,QAAQ,SAAS,cAAc,KAC/B,QAAQ,SAAS,UAAU,KAC3B,QAAQ,SAAS,gBAAgB,KACjC,QAAQ,SAAS,KAAK,KACtB,QAAQ,SAAS,KAAK,KACtB,QAAQ,SAAS,iBAAiB,KAClC,QAAQ,SAAS,aAAa,KAC9B,QAAQ,SAAS,aAAa,KAC9B,QAAQ,SAAS,0BAA0B,KAC3C,QAAQ,SAAS,wBAAwB,KACzC,QAAQ,SAAS,gBAAgB,GAChC;AACD,UAAM;AAAA,EACP;AACD;AAEA,SAASA,cAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;ACjpEA,SAAS,kBAAqBE,SAA0B;AACvD,SAAOA;AACR;AAEA,SAAS,cAAc,KAAqB;AAC3C,MAAI,QAAQ,IAAI,MAAM,IAAe;AACrC,MAAI,UAAU,QAAW;AACxB,YAAQ;AAAA,MACP,KAAK;AAAA,MACL,SAAS,oBAAI,IAAI;AAAA,MACjB,QAAQ,oBAAI,IAAI;AAAA,MAChB,QAAQ;AAAA,MACR,kBAAkB;AAAA,IACnB;AACA,QAAI,MAAM,IAAI,KAAK;AAAA,EACpB;AACA,QAAM,SAAS;AACf,MAAI,CAAC,MAAM,kBAAkB;AAC5B,UAAM,mBAAmB;AACzB,QAAI,eAAe,MAAM;AACxB,YAAM,SAAS;AACf,YAAM,mBAAmB;AACzB,iBAAW,UAAU,MAAM,QAAQ,OAAO,EAAG,WAAU,MAAM;AAC7D,iBAAWC,UAAS,MAAM,OAAO,OAAO,EAAG,cAAaA,MAAK;AAC7D,YAAM,QAAQ,MAAM;AACpB,YAAM,OAAO,MAAM;AAAA,IACpB,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,UAAU,QAA4B;AAC9C,MAAI;AACH,WAAO;AAAA,EACR,QAAQ;AAAA,EAER;AACD;AAEA,SAAS,cACR,OACA,QACA,MACkC;AAClC,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,YAAM,UACL,IAAI,MAAM,IAAoB,KAC7B,EAAE,OAAO,QAAQ,UAAU,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,EAAE;AAC/D,UAAI,OAAO;AACX,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,eAAO,aAAa,MAAM,KAAuC;AAAA,MAClE;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,iBAAiB;AAAA,EACrD;AACA,QAAM,WAAW,MAAM;AAAA,IACtB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,cAAM,QAAQ;AACd,YAAI,aAAa,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MAC3D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,mBAAmB;AAAA,EACzD;AACA,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,cAAM,QAAQ;AACd,YAAI,WAAW,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MACvD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,iBAAiB;AAAA,EACrD;AACA,SAAO,EAAE,QAAQ,QAAQ,UAAU,OAAO;AAC3C;AAEA,SAAS,aACR,SACA,OACiB;AACjB,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,QAAQ,WAAW;AAAA,QAC7B,SAAS,MAAM;AAAA,MAChB;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,aAAa,MAAM;AAAA,MACpB;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,MAAM,QAAQ,OAAO;AAAA,QACrB,aAAa;AAAA,MACd;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,QAAQ,QAAQ,SAAS;AAAA,MAC1B;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,QAAQ,QAAQ,SAAS;AAAA,MAC1B;AAAA,IACD,KAAK;AACJ,aAAO,EAAE,GAAG,SAAS,OAAO,YAAY;AAAA,IACzC,KAAK;AACJ,aAAO,EAAE,GAAG,SAAS,OAAO,UAAU,QAAQ,QAAQ,SAAS,EAAE;AAAA,EACnE;AACD;AAqBA,SAAS,0BAA0B,KAAiC;AACnE,MAAI,QAAQ,IAAI,MAAM,IAA2B;AACjD,MAAI,UAAU,QAAW;AACxB,YAAQ;AAAA,MACP,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,kBAAkB;AAAA,MAClB,gBAAgB;AAAA,MAChB,gBAAgB;AAAA,MAChB,aAAa,oBAAI,IAAI;AAAA,MACrB,WAAW,oBAAI,IAAI;AAAA,MACnB,iBAAiB,CAAC;AAAA,MAClB,QAAQ,oBAAI,IAAI;AAAA,MAChB,KAAK;AAAA,MACL,aAAa;AAAA,IACd;AACA,QAAI,MAAM,IAAI,KAAK;AAAA,EACpB;AACA,QAAM,SAAS;AACf,MAAI,CAAC,MAAM,kBAAkB;AAC5B,UAAM,mBAAmB;AACzB,QAAI,eAAe,MAAM;AACxB,YAAM,cAAc,CAAC,GAAG,MAAM,YAAY,OAAO,CAAC;AAClD,YAAM,SAAS,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC;AACxC,YAAM,UAAU,MAAM;AACtB,YAAM,SAAS;AACf,YAAM,mBAAmB;AACzB,YAAM,YAAY;AAClB,YAAM,iBAAiB;AACvB,YAAM,iBAAiB;AACvB,YAAM,YAAY,MAAM;AACxB,YAAM,UAAU,MAAM;AACtB,YAAM,kBAAkB,CAAC;AACzB,YAAM,OAAO,MAAM;AACnB,iBAAW,UAAU,YAAa,WAAU,MAAM;AAClD,iBAAWA,UAAS,OAAQ,cAAaA,MAAK;AAC9C,eAAS,OAAO;AAAA,IACjB,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,2BACR,OACA,eAAkC,UAIjC;AACD,QAAM,UAAU,MAAM;AACtB,QAAM,SAAS,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC;AACxC,QAAM,cAAc,CAAC,GAAG,MAAM,YAAY,OAAO,CAAC;AAClD,QAAM,WAAW,CAAC,GAAG,MAAM,iBAAiB,GAAG,MAAM,UAAU,OAAO,CAAC;AACvE,QAAM,YAAY;AAClB,QAAM,iBAAiB;AACvB,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM;AACnB,QAAM,YAAY,MAAM;AACxB,QAAM,kBAAkB,CAAC;AACzB,QAAM,UAAU,MAAM;AACtB,aAAWA,UAAS,OAAQ,cAAaA,MAAK;AAC9C,aAAW,cAAc,YAAa,WAAU,UAAU;AAC1D,MAAI,iBAAiB,SAAU,UAAS,OAAO;AAC/C,SAAO,EAAE,UAAU,QAAQ;AAC5B;AAEA,SAAS,kBAAkB,OAAoC;AAC9D,aAAWA,UAAS,MAAM,OAAO,OAAO,EAAG,cAAaA,MAAK;AAC7D,QAAM,OAAO,MAAM;AACpB;AAEA,SAAS,2BACR,OACA,eAAkC,UACL;AAC7B,QAAM,UAAU,MAAM;AACtB,QAAM,cAAc,CAAC,GAAG,MAAM,YAAY,OAAO,CAAC;AAClD,QAAM,WAAW,CAAC,GAAG,MAAM,UAAU,OAAO,CAAC;AAC7C,QAAM,YAAY;AAClB,QAAM,iBAAiB;AACvB,QAAM,iBAAiB;AACvB,QAAM,YAAY,MAAM;AACxB,QAAM,UAAU,MAAM;AACtB,aAAW,cAAc,YAAa,WAAU,UAAU;AAC1D,MAAI,iBAAiB,SAAU,UAAS,OAAO;AAC/C,SAAO;AACR;AAEA,SAAS,oCACR,QACyF;AACzF,MAAI,QAAQ,SAAS,SAAU,QAAO,EAAE,MAAM,SAAS;AACvD,MAAI,CAAC,OAAO,SAAS,OAAO,UAAU,KAAK,OAAO,aAAa,GAAG;AACjE,UAAM,IAAI,MAAM,qEAAqE;AAAA,EACtF;AACA,SAAO,EAAE,MAAM,UAAU,YAAY,KAAK,MAAM,OAAO,UAAU,EAAE;AACpE;AAEA,SAAS,0BACR,OACA,SACA,SACA,MACA,QACA,YAC8B;AAC9B,SAAO,MAAM;AAAA,IACZ,CAAC,OAAO;AAAA,IACR,CAAC,QAAQ;AACR,YAAM,QAAQ,0BAA0B,GAAG;AAE3C,YAAM,eAAe,CAAC,SAAmC;AACxD,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,KAAK,CAAiC,CAAC,CAAC;AAAA,MAChF;AAEA,YAAM,uBAAuB,CAC5B,OACA,WACI;AACJ,mBAAW,QAAQ,OAAO;AACzB,uBAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAEA,YAAM,uBAAuB,CAAC,OAA4C,UAAmB;AAC5F,cAAM,UAAU,aAAa,KAAK;AAClC,mBAAW,QAAQ,OAAO;AACzB,uBAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO;AAAA,UACR,CAAC;AAAA,QACF;AAAA,MACD;AAEA,YAAM,iBAAiB,CAAC,SAAiB,UAAmB;AAC3D,cAAM,UAAU,aAAa,KAAK;AAClC,cAAM,WAAW,2BAA2B,KAAK;AACjD,6BAAqB,UAAU,GAAG,IAAI,sBAAsB;AAC5D,YAAI,YAAY,QAAQ,OAAO,GAAG;AACjC,gBAAM,cAAc,UAAU;AAC9B,gBAAM,UAAU,iBAAiB,QAAQ,WAAW,KAAK;AACzD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA,OAAO;AAAA,cACR;AAAA,YACD;AAAA,UACD,CAAC;AACD,gBAAM,UAAU,MAAM;AACtB,gBAAMA,SAAQ,WAAW,MAAM;AAC9B,kBAAM,OAAO,OAAO,OAAO;AAC3B,gBAAI,CAAC,MAAM,OAAQ;AACnB,kBAAM,WAAW;AAAA,UAClB,GAAG,OAAO;AACV,gBAAM,OAAO,IAAI,SAASA,MAAK;AAAA,QAChC,OAAO;AACN,+BAAqB,MAAM,iBAAiB,OAAO;AACnD,gBAAM,kBAAkB,CAAC;AACzB,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,EAAE,MAAM,aAAa,SAAS,OAAO,QAAQ;AAAA,YAC9C;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAEA,YAAM,QAAQ,CAAC,YAAoB;AAClC,YACC,CAAC,MAAM,UACP,MAAM,aACN,MAAM,mBAAmB,KACzB,MAAM,OAAO,OAAO,GACnB;AACD;AAAA,QACD;AACA,cAAM,SAAS,IAAI,YAAY,EAAE,gBAAgB;AACjD,cAAM,iBAAiB;AACvB,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA;AAAA,cACC,MAAM;AAAA,cACN;AAAA,cACA,aAAa,OAAO;AAAA,YACrB;AAAA,UACD;AAAA,QACD,CAAC;AACD,cAAM,iBAAiB,QAAQ;AAC/B,YAAI,mBAAmB,QAAW;AACjC,yBAAe,SAAS,GAAG,IAAI,wCAAwC;AACvE;AAAA,QACD;AACA,YAAI;AACJ,YAAI;AACH,oBAAU,eAAe,KAAK,QAAQ,SAAS,CAAC,UAAU;AACzD,gBAAI,CAAC,MAAM,UAAU,MAAM,mBAAmB,QAAS;AACvD,gBAAI,MAAM,SAAS,SAAS;AAC3B,oBAAM,KAAK,MAAM;AACjB,kBAAI,GAAG,SAAS,QAAQ;AACvB,sBAAM,YAAY;AAClB,oBAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,QAAQ,CAAiC,CAAC,CAAC;AAC9E,6BAAa;AAAA,cACd,WAAW,GAAG,SAAS,UAAU,GAAG,SAAS,UAAU;AACtD,oBAAI,KAAK;AAAA,kBACR;AAAA,oBACC;AAAA,oBACA;AAAA,sBACC,MAAM;AAAA,sBACN,SAAS;AAAA,oBACV;AAAA,kBACD;AAAA,gBACD,CAAC;AAAA,cACF,WAAW,GAAG,SAAS,SAAS;AAC/B,sBAAM,cAAc,GAAG,SAAS;AAChC,sBAAM,WAAW,2BAA2B,KAAK;AACjD,qCAAqB,UAAU,GAAG,IAAI,kBAAkB;AACxD,oBAAI,KAAK;AAAA,kBACR;AAAA,oBACC;AAAA,oBACA;AAAA,sBACC,MAAM;AAAA,sBACN,MAAM,GAAG;AAAA,sBACT,QAAQ,GAAG;AAAA,oBACZ;AAAA,kBACD;AAAA,gBACD,CAAC;AACD,oBAAI,CAAC,aAAa;AACjB,iCAAe,SAAS;AAAA,oBACvB,MAAM;AAAA,oBACN,MAAM,GAAG;AAAA,oBACT,QAAQ,GAAG;AAAA,kBACZ,CAAC;AAAA,gBACF;AAAA,cACD;AAAA,YACD,WAAW,MAAM,SAAS,SAAS;AAClC,6BAAe,SAAS,MAAM,KAAK;AAAA,YACpC,WAAW,MAAM,SAAS,YAAY;AACrC,6BAAe,SAAS,GAAG,IAAI,wBAAwB;AAAA,YACxD;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,yBAAe,SAAS,KAAK;AAC7B;AAAA,QACD;AACA,YAAI,YAAY,QAAW;AAC1B,yBAAe,SAAS,GAAG,IAAI,wCAAwC;AACvE;AAAA,QACD;AACA,YAAI,MAAM,UAAU,MAAM,mBAAmB,SAAS;AACrD,gBAAM,iBAAiB;AAAA,QACxB,OAAO;AACN,kBAAQ,OAAO;AAAA,QAChB;AAAA,MACD;AAEA,eAAS,QAAQ,MAAsC;AACtD,YAAI,CAAC,MAAM,WAAW;AACrB,uBAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO,GAAG,IAAI;AAAA,UACf,CAAC;AACD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,GAAG,IAAI;AAAA,cACf;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM,UAAU,MAAM;AACtB,YAAI,YAAY,QAAW;AAC1B,uBAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO,GAAG,IAAI;AAAA,UACf,CAAC;AACD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,GAAG,IAAI;AAAA,cACf;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM,SAAS,MAAM;AACrB,cAAM,UAAU,IAAI,QAAQ,IAAI;AAChC,qBAAa,EAAE,MAAM,WAAW,KAAK,KAAK,KAAK,SAAS,KAAK,QAAQ,CAAC;AACtE,YAAI,OAAO;AACX,YAAI;AACJ,YAAI;AACH,mBAAS,QAAQ,KAAK,KAAK,SAAS,CAAC,WAAW;AAC/C,gBAAI,QAAQ,CAAC,MAAM,UAAU,CAAC,MAAM,UAAU,IAAI,MAAM,EAAG;AAC3D,mBAAO;AACP,kBAAM,UAAU,OAAO,MAAM;AAC7B,kBAAM,YAAY,OAAO,MAAM;AAC/B,gBAAI,OAAO,IAAI;AACd,2BAAa,EAAE,MAAM,QAAQ,KAAK,KAAK,KAAK,SAAS,KAAK,QAAQ,CAAC;AACnE,kBAAI,KAAK;AAAA,gBACR,CAAC,QAAQ,EAAE,MAAM,QAAQ,SAAS,KAAK,QAAQ,CAAiC;AAAA,cACjF,CAAC;AAAA,YACF,OAAO;AACN,oBAAM,UAAU,aAAa,OAAO,KAAK;AACzC,2BAAa;AAAA,gBACZ,MAAM;AAAA,gBACN,KAAK,KAAK;AAAA,gBACV,SAAS,KAAK;AAAA,gBACd,OAAO;AAAA,cACR,CAAC;AACD,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,MAAM;AAAA,oBACN,OAAO;AAAA,kBACR;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,gBAAM,UAAU,OAAO,MAAM;AAC7B,gBAAM,UAAU,aAAa,KAAK;AAClC,uBAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO;AAAA,UACR,CAAC;AACD,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,OAAO,QAAQ,CAAiC,CAAC,CAAC;AACtF;AAAA,QACD;AACA,YAAI,WAAW,UAAa,CAAC,QAAQ,MAAM,UAAU,MAAM,UAAU,IAAI,MAAM,GAAG;AACjF,gBAAM,YAAY,IAAI,QAAQ,MAAM;AAAA,QACrC,WAAW,WAAW,UAAa,CAAC,MAAM,OAAQ,WAAU,MAAM;AAAA,MACnE;AAEA,eAAS,eAAqB;AAC7B,cAAM,UAAU,MAAM;AACtB,cAAM,kBAAkB,CAAC;AACzB,iBAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACpD,gBAAM,OAAO,QAAQ,KAAK;AAC1B,cAAI,CAAC,MAAM,aAAa,MAAM,mBAAmB,QAAW;AAC3D,iCAAqB,QAAQ,MAAM,KAAK,GAAG,GAAG,IAAI,kBAAkB;AACpE;AAAA,UACD;AACA,kBAAQ,IAAI;AAAA,QACb;AAAA,MACD;AAEA,YAAM,OAAO,CAAC,YAA2B;AACxC,cAAM,OAAO,EAAE,KAAK,MAAM,eAAe,QAAQ;AACjD,YAAI,MAAM,WAAW;AACpB,kBAAQ,IAAI;AACZ;AAAA,QACD;AACA,YAAI,WAAW,SAAS,UAAU;AACjC,cAAI,MAAM,gBAAgB,UAAU,WAAW,YAAY;AAC1D,yBAAa;AAAA,cACZ,MAAM;AAAA,cACN,KAAK,KAAK;AAAA,cACV;AAAA,cACA,OAAO,GAAG,IAAI;AAAA,YACf,CAAC;AACD,gBAAI,KAAK;AAAA,cACR;AAAA,gBACC;AAAA,gBACA;AAAA,kBACC,MAAM;AAAA,kBACN,OAAO,GAAG,IAAI;AAAA,gBACf;AAAA,cACD;AAAA,YACD,CAAC;AACD;AAAA,UACD;AACA,gBAAM,gBAAgB,KAAK,IAAI;AAC/B,uBAAa,EAAE,MAAM,UAAU,KAAK,KAAK,KAAK,QAAQ,CAAC;AACvD;AAAA,QACD;AACA,qBAAa;AAAA,UACZ,MAAM;AAAA,UACN,KAAK,KAAK;AAAA,UACV;AAAA,UACA,OAAO,GAAG,IAAI;AAAA,QACf,CAAC;AACD,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA;AAAA,cACC,MAAM;AAAA,cACN,OAAO,GAAG,IAAI;AAAA,YACf;AAAA,UACD;AAAA,QACD,CAAC;AAAA,MACF;AAEA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,eAAe;AACrB,YAAI,aAAa,SAAS,QAAS,OAAM,CAAC;AAAA,iBACjC,aAAa,SAAS,OAAQ,MAAK,aAAa,OAAO;AAAA,aAC3D;AACJ,4BAAkB,KAAK;AACvB,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,MAAM,aAAa;AAAA,gBACnB,QAAQ,aAAa;AAAA,cACtB;AAAA,YACD;AAAA,UACD,CAAC;AACD,gBAAM,EAAE,UAAU,QAAQ,IAAI,2BAA2B,OAAO,MAAM;AACtE,+BAAqB,UAAU,GAAG,IAAI,kBAAkB;AACxD,mBAAS,MAAM,aAAa,MAAM,aAAa,MAAM;AACrD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,MAAM,aAAa;AAAA,gBACnB,QAAQ,aAAa;AAAA,cACtB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB;AAAA,EAC7D;AACD;AAEA,SAAS,sBACR,OACA,SACA,QACA,MACA,QACyB;AACzB,QAAM,UAAU,MAAM;AAAA,IACrB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,YAAY,SAAS,0BAA0B;AAAA,EAC/D;AACA,QAAM,YAAY,MAAM;AAAA,IACvB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAW;AAC7B,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,SAAS,MAAM;AAAA,gBACf,aAAa,MAAM;AAAA,cACpB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,QAAQ;AACjC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,SAAS,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,QAC9D,WAAW,MAAM,SAAS,QAAQ;AACjC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,SAAS,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,QAC9D,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,UAAU;AAC/D,cAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QAC3B,WAAW,MAAM,SAAS,SAAS;AAClC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,SAAS,MAAM;AAAA,gBACf,aAAa,MAAM;AAAA,gBACnB,SAAS,MAAM;AAAA,gBACf,OAAO,MAAM;AAAA,cACd;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,aAAa;AACtC,cAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QAC3B;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,cAAc,SAAS,4BAA4B;AAAA,EACnE;AACA,QAAM,WAAW,MAAM;AAAA,IACtB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAY,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,IAAI,CAAC,CAAC;AAAA,MAC/D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,2BAA2B;AAAA,EACjE;AACA,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,OACH,IAAI,MAAM,IAA4B,KACrC;AAAA,QACA,OAAO;AAAA,QACP,SAAS;AAAA,QACT,aAAa,OAAO;AAAA,QACpB,MAAM;AAAA,QACN,UAAU;AAAA,QACV,QAAQ;AAAA,MACT;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAW;AAC7B,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,YACnB,aAAa;AAAA,UACd;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,iBAAO,EAAE,GAAG,MAAM,OAAO,QAAQ,SAAS,MAAM,SAAS,aAAa,OAAU;AAAA,QACjF,WAAW,MAAM,SAAS,WAAW;AACpC,iBAAO,EAAE,GAAG,MAAM,UAAU,KAAK,WAAW,EAAE;AAAA,QAC/C,WAAW,MAAM,SAAS,QAAQ;AACjC,iBAAO,EAAE,GAAG,MAAM,MAAM,KAAK,OAAO,EAAE;AAAA,QACvC,WAAW,MAAM,SAAS,WAAW;AACpC,iBAAO,EAAE,GAAG,MAAM,OAAO,UAAU;AAAA,QACpC,WAAW,MAAM,SAAS,UAAU;AACnC,iBAAO,EAAE,GAAG,MAAM,OAAO,SAAS;AAAA,QACnC,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,QAAQ,KAAK,SAAS;AAAA,YACtB,aAAa,MAAM;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM,WAAW,KAAK;AAAA,YAC/B,QAAQ,KAAK,SAAS;AAAA,UACvB;AAAA,QACD,WAAW,MAAM,SAAS,aAAa;AACtC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,QAAQ,KAAK,SAAS;AAAA,UACvB;AAAA,QACD;AAAA,MACD;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB;AAAA,EAC7D;AACA,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,WAAW,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MACvD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB;AAAA,EAC7D;AACA,QAAM,WAAW,MAAM;AAAA,IACtB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,2BAA2B;AAAA,EACjE;AACA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IACvD,MAAM,CAAC,YACN,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,SACC,OAAO,YAAY,YAAY,mBAAmB,aAC/C,EAAE,MAAM,QAAQ,IAChB;AAAA,QACL;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,OAAO,CAAC,MAAM,WAAW,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC;AAAA,EAClF;AACD;AAQO,SAAS,iBACf,OACA,SACA,OAAgC,CAAC,GACR;AACzB,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS,KAAK,SAAS,YAAY;AACzC,QAAM,aAAa,oCAAoC,KAAK,UAAU;AACtE,QAAM,UAAU,MAAM,KAA8B,CAAC,GAAG,MAAM;AAAA,IAC7D,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,EACV,CAAC;AACD,QAAM,SAAS,0BAA0B,OAAO,SAAS,SAAS,MAAM,QAAQ,UAAU;AAC1F,SAAO,sBAAsB,OAAO,SAAS,QAAQ,MAAM,MAAM;AAClE;AAEA,SAAS,aACR,OACAD,SACA,MACA,MAKA,MACuC;AACvC,QAAM,SAAS,KAAK,SAAS,YAAY;AACzC,SAAO,MAAM;AAAA,IACZ,CAAC,kBAAkBA,OAAM,CAAC;AAAA,IAC1B,CAAC,QAAQ;AACR,YAAM,QAAQ,cAAc,GAAG;AAC/B,YAAM,QAAQ,CAAC,OAAe,YAAoB;AACjD,YAAI,CAAC,MAAM,OAAQ;AACnB,cAAM,KAAK,MAAM;AACjB,YAAI,KAAK;AAAA,UACR,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,QAAQ,CAA0C;AAAA,QACtF,CAAC;AACD,cAAM,eAAe,CAAC,UAAmB;AACxC,gBAAM,UAAU,aAAa,KAAK;AAClC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,EAAE,MAAM,aAAa,OAAO,SAAS,OAAO,QAAQ;AAAA,YAIrD;AAAA,UACD,CAAC;AACD,cAAI,KAAK,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC;AAAA,QAC9B;AACA,YAAI;AACJ,YAAI,OAAO;AACX,YAAI;AACH,mBAAS,KAAK,KAAK,OAAO,CAAC,WAAW;AACrC,gBAAI,QAAQ,CAAC,MAAM,OAAQ;AAC3B,mBAAO;AACP,kBAAM,QAAQ,OAAO,EAAE;AACvB,gBAAI,OAAO,IAAI;AACd,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA,EAAE,MAAM,QAAQ,OAAO,SAAS,QAAQ,OAAO,MAAM;AAAA,gBAItD;AAAA,cACD,CAAC;AACD;AAAA,YACD;AACA,gBAAI,YAAY,QAAQ,OAAO,GAAG;AACjC,oBAAM,cAAc,UAAU;AAC9B,oBAAM,UAAU,iBAAiB,QAAQ,WAAW,KAAK;AACzD,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,MAAM;AAAA,oBACN;AAAA,oBACA;AAAA,oBACA;AAAA,oBACA,OAAO,aAAa,OAAO,KAAK;AAAA,kBACjC;AAAA,gBACD;AAAA,cACD,CAAC;AACD,oBAAMC,SAAQ,WAAW,MAAM;AAC9B,sBAAM,OAAO,OAAO,EAAE;AACtB,oBAAI,CAAC,MAAM,OAAQ;AACnB,sBAAM,OAAO,WAAW;AAAA,cACzB,GAAG,OAAO;AACV,oBAAM,OAAO,IAAI,IAAIA,MAAK;AAAA,YAC3B,OAAO;AACN,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,MAAM;AAAA,oBACN;AAAA,oBACA;AAAA,oBACA,OAAO,aAAa,OAAO,KAAK;AAAA,kBACjC;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,cAAI,CAAC,MAAM;AACV,mBAAO;AACP,kBAAM,QAAQ,OAAO,EAAE;AACvB,yBAAa,KAAK;AAAA,UACnB;AACA;AAAA,QACD;AACA,YAAI,WAAW,QAAW;AACzB,cAAI,CAAC,MAAM;AACV,mBAAO;AACP,yBAAa,GAAG,IAAI,yCAAyC;AAAA,UAC9D;AACA;AAAA,QACD;AACA,YAAI,CAAC,QAAQ,MAAM,QAAQ;AAC1B,gBAAM,QAAQ,IAAI,IAAI,MAAM;AAAA,QAC7B,WAAW,CAAC,MAAM,QAAQ;AACzB,oBAAU,MAAM;AAAA,QACjB;AAAA,MACD;AACA,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,EAAG,OAAM,OAAiB,CAAC;AACpE,YAAM,WAAW,IAAI,SAAS,CAAC;AAC/B,UAAI,aAAa,MAAM;AACtB,YAAI,KAAK;AAAA,UACR,CAAC,QAAQ,EAAE,MAAM,oBAAoB,CAA0C;AAAA,QAChF,CAAC;AAAA,MACF,WAAW,aAAa,SAAS,aAAa,QAAW;AACxD,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA,EAAE,MAAM,kBAAkB,OAAO,SAAS;AAAA,UAC3C;AAAA,QACD,CAAC;AAAA,MACF;AAAA,IACD;AAAA,IACA,EAAE,MAAM,SAAS,KAAK;AAAA,EACvB;AACD;AAEO,SAAS,OACf,OACAD,SACA,WACA,OAA+B,CAAC,GACE;AAClC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS;AAAA,IACd;AAAA,IACAA;AAAA,IACA;AAAA,IACA,CAAC,KAAK,OAAO,aAAa;AACzB,YAAM,UAAU,UAAU,KAAK;AAC/B,aAAO,IAAI,YAAY,EAAE,WAAW,GAAG,QAAQ,SAAS,QAAQ;AAAA,IACjE;AAAA,IACA;AAAA,EACD;AACA,SAAO,cAAc,OAAO,QAAQ,IAAI;AACzC;AAEO,SAAS,UACf,OACAA,SACA,WACA,OAA+B,CAAC,GACG;AACnC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS;AAAA,IACd;AAAA,IACAA;AAAA,IACA;AAAA,IACA,CAAC,KAAK,OAAO,aAAa;AACzB,YAAM,UAAU,UAAU,KAAK;AAC/B,aAAO,IAAI,YAAY,EAAE,cAAc,GAAG,IAAI,SAAS,QAAQ;AAAA,IAChE;AAAA,IACA;AAAA,EACD;AACA,SAAO,cAAc,OAAO,QAAQ,IAAI;AACzC;AAEO,SAAS,YACf,OACAA,SACA,SACA,QACA,OAA+B,CAAC,GACS;AACzC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS;AAAA,IACd;AAAA,IACAA;AAAA,IACA;AAAA,IACA,CAAC,KAAK,OAAO,aAAa;AACzB,YAAM,SAAS,IAAI,YAAY,EAAE,gBAAgB;AACjD,aAAO,QAAQ,OAAO,SAAS,OAAO,KAAK,GAAG,QAAQ;AAAA,IACvD;AAAA,IACA;AAAA,EACD;AACA,SAAO,cAAc,OAAO,QAAQ,IAAI;AACzC;;;ACvqCO,IAAM,wBAAwB,uBAAO,IAAI,uBAAuB;AAGhE,IAAM,4BAA4B,uBAAO,IAAI,2BAA2B;AAGxE,IAAM,2BAA2B,uBAAO,IAAI,0BAA0B;AAoBtE,IAAM,iBAAiB,oBAAI,IAAkD;AAC7E,IAAM,oBAAoB,oBAAI,IAAmD;AACjF,IAAM,gBAAgB,oBAAI,IAA+C;AAMzE,SAAS,cAAc,MAAsB;AACnD,SAAO,uBAAO,IAAI,oBAAoB,IAAI,EAAE;AAC7C;AAGO,SAAS,aAAa,MAAsB;AAClD,SAAO,uBAAO,IAAI,mBAAmB,IAAI,EAAE;AAC5C;AAEA,SAAS,SAAY,GAAM,GAAe;AACzC,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,QAAM,OAAO,QAAQ,QAAQ,IAAI;AACjC,MAAI,KAAK,WAAW,QAAQ,QAAQ,KAAK,EAAE,OAAQ,QAAO;AAC1D,aAAW,OAAO,MAAM;AACvB,QAAI,CAAC,OAAO,GAAG,KAAK,GAAG,GAAG,MAAM,GAAG,CAAC,EAAG,QAAO;AAAA,EAC/C;AACA,SAAO;AACR;AAEA,SAAS,eACR,UACA,MACA,MACO;AACP,QAAM,WAAW,SAAS,IAAI,IAAI,KAAK,CAAC;AACxC,MAAI,SAAS,KAAK,CAAC,YAAY,SAAS,SAAS,IAAI,CAAC,EAAG;AACzD,WAAS,IAAI,MAAM,CAAC,GAAG,UAAU,IAAI,CAAC;AACvC;AAEA,SAAS,aACR,UACA,MACuB;AACvB,UAAQ,CAAC,eAAuB,iBAAgE;AAC/F,QAAI,OAAO,iBAAiB,YAAY,iBAAiB,MAAM;AAC9D,YAAM,YAAY,aAAa;AAC/B,mBAAa,eAAe,WAAyB;AACpD,cAAME,QAAQ,KAAmD;AACjE,uBAAe,UAAUA,OAAM,KAAK,SAAS,CAAC;AAAA,MAC/C,CAAC;AACD;AAAA,IACD;AAEA,UAAM,OAAQ,cAA4D;AAC1E,mBAAe,UAAU,MAAM,KAAK,YAAY,CAAC;AAAA,EAClD;AACD;AAGO,SAAS,aAAa,UAAwC;AACpE,SAAO,aAAa,gBAAgB,CAAC,eAAe,EAAE,UAAU,UAAU,EAAE;AAC7E;AAGO,SAAS,cAAc,IAAkC;AAC/D,SAAO,aAAa,mBAAmB,CAAC,eAAe,EAAE,IAAI,UAAU,EAAE;AAC1E;AAGO,SAAS,UAAU,MAAoC;AAC7D,SAAO,aAAa,eAAe,CAAC,eAAe,EAAE,MAAM,UAAU,EAAE;AACxE;;;ACDA,SAAS,4BAA4B,QAAyD;AAC7F,QAAM,aAAa,QAAQ;AAC3B,MAAI,eAAe,OAAW,QAAO;AACrC,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACpD,UAAM,IAAI,WAAW,4DAA4D,UAAU,GAAG;AAAA,EAC/F;AACA,SAAO;AACR;AAOO,IAAM,gBAAN,MAAsD;AAAA,EAC3C;AAAA,EACA;AAAA,EACA,OAAoC,CAAC;AAAA,EACrC,OAAO,oBAAI,IAAO;AAAA,EAEnC,YAAY,QAAqC,SAAkC,OAAO,IAAI;AAC7F,SAAK,aAAa,4BAA4B,MAAM;AACpD,SAAK,SAAS;AAAA,EACf;AAAA,EAEA,IAAI,KAAuB;AAC1B,UAAM,QAAQ,KAAK,KAAK,UAAU,CAACC,WAAU,KAAK,OAAOA,OAAM,KAAK,GAAG,CAAC;AACxE,QAAI,QAAQ,EAAG,QAAO;AACtB,UAAM,CAAC,KAAK,IAAI,KAAK,KAAK,OAAO,OAAO,CAAC;AACzC,QAAI,UAAU,OAAW,QAAO;AAChC,SAAK,KAAK,KAAK,KAAK;AACpB,WAAO,MAAM;AAAA,EACd;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC3B,SAAK,YAAY,KAAK;AACtB,SAAK,KAAK,IAAI,KAAK;AACnB,QAAI,KAAK,eAAe,EAAG;AAC3B,SAAK,KAAK,KAAK,EAAE,KAAK,MAAM,CAAC;AAC7B,WAAO,KAAK,eAAe,UAAa,KAAK,KAAK,SAAS,KAAK,YAAY;AAC3E,WAAK,KAAK,MAAM;AAAA,IACjB;AAAA,EACD;AAAA,EAEA,YAAY,OAAgB;AAC3B,aAAS,IAAI,KAAK,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAClD,UAAI,KAAK,KAAK,CAAC,GAAG,UAAU,MAAO,MAAK,KAAK,OAAO,GAAG,CAAC;AAAA,IACzD;AACA,SAAK,KAAK,OAAO,KAAK;AAAA,EACvB;AAAA,EAEA,aAAmB;AAClB,eAAW,QAAQ,CAAC,GAAG,KAAK,IAAI,EAAG,MAAK,QAAQ;AAChD,SAAK,KAAK,SAAS;AACnB,SAAK,KAAK,MAAM;AAAA,EACjB;AACD;AAQO,SAAS,kBACf,aACA,MACqB;AACrB,QAAM,EAAE,YAAY,SAAS,OAAO,qBAAqB,MAAM,UAAU,IAAI;AAC7E,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAC5C,QAAM,QAAQ,OAAO,cAAc,EAAE,MAAM,QAAQ,QAAQ,CAAC;AAC5D,QAAM,YAAY,CAAC,QAAmB;AACrC,eAAW,UAAW,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoB;AAC9D,UAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,IAC5B;AAAA,EACD;AACA,QAAM,QAAQ,QACX,MAAM,KAAQ,CAAC,WAAW,GAAG,WAAW;AAAA,IACxC,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,yBAAyB,QAAQ;AAAA,IAC/C,SAAS;AAAA,EACV,CAAC,IACA,IAAI,KAAQ,CAAC,WAAW,GAAG,WAAW;AAAA,IACtC,GAAG;AAAA,IACH,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,SAAS;AAAA,EACV,CAAC;AAEH,QAAM,SAAS,uBAAO,OAAO,GAAG,IAAI,cAAc,GAAG,OAAO,WAAW;AACvE,QAAM,eAAe,CAAC,QAAmB;AACxC,QAAI;AACH,UAAI,KAAK,CAAC,CAAC,QAAQ,oBAAoB,CAAC,CAAC,CAAC;AAAA,IAC3C,SAAS,GAAG;AACX,UAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,GAAG,OAAO,+BAA+B,CAAC,CAAC,CAAC;AAAA,IACjF;AAAA,EACD;AACA,QAAM,WAAW,QACd,MAAM,KAAQ,CAAC,KAAsB,GAAG,cAAc;AAAA,IACtD,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,MAAM,EAAE,MAAM,4BAA4B,QAAQ;AAAA,IAClD,SAAS;AAAA,IACT;AAAA,EACD,CAAC,IACA,IAAI,KAAQ,CAAC,KAAsB,GAAG,cAAc;AAAA,IACpD,GAAG;AAAA,IACH,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,SAAS;AAAA,IACT;AAAA,EACD,CAAC;AAEH,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAgB;AACf,UAAI,SAAU;AACd,UAAI,OAAO;AACV,cAAM,QAAQ,EAAE,QAAQ,QAAQ,CAAC;AAAA,MAClC,OAAO;AACN,6BAAqB,KAAsB;AAC3C,6BAAqB,QAAyB;AAAA,MAC/C;AACA,iBAAW;AACX,kBAAY;AAAA,IACb;AAAA,EACD;AACD;AAOO,SAAS,eACf,SACA,SACA,OAA8B,CAAC,GAC/B,SACuB;AACvB,QAAM,EAAE,MAAM,YAAY,MAAM,IAAI;AACpC,QAAM,OAAoC,aAAa,EAAE,WAAW,IAAI,CAAC;AACzE,MAAI,UAAU;AAId,QAAM,QAAQ,QACX,MAAM,KAAQ,CAAC,GAAG,MAAM;AAAA,IACxB,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,oBAAoB,YAAY,QAAQ;AAAA,IACtD,GAAI,UAAU,EAAE,SAAS,EAAE,KAAK,QAAQ,UAAU,QAAQ,QAAQ,OAAO,EAAE,IAAI,CAAC;AAAA,EACjF,CAAC,IACA,IAAI,KAAQ,CAAC,GAAG,MAAM;AAAA,IACtB,GAAG;AAAA,IACH,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,EAChC,CAAC;AAOH,QAAM,SAAS,uBAAO,OAAO,GAAG,IAAI,cAAc,GAAG,OAAO,WAAW;AACvE,MAAI,mBAAmB,QAAQ;AAC/B,QAAM,SAAS,CAAC,QAAmB;AAClC,QAAI,IAAI,SAAS,UAAa,QAAQ,YAAY,iBAAkB;AACpE,uBAAmB,QAAQ;AAC3B,QAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,SAAS,CAAC,CAAC,CAAC;AAAA,EACxC;AACA,QAAM,WAAW,QACd,MAAM,KAAQ,CAAC,KAAsB,GAAG,QAAQ;AAAA,IAChD;AAAA,IACA,SAAS;AAAA,IACT,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,MAAM,EAAE,MAAM,uBAAuB,YAAY,QAAQ;AAAA,IACzD,GAAI,UAAU,EAAE,SAAS,EAAE,KAAK,QAAQ,aAAa,QAAQ,QAAQ,OAAO,EAAE,IAAI,CAAC;AAAA,EACpF,CAAC,IACA,IAAI,KAAQ,CAAC,KAAsB,GAAG,QAAQ;AAAA,IAC9C,GAAG;AAAA,IACH;AAAA,IACA,SAAS;AAAA,IACT,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,EACnC,CAAC;AAEH,MAAI,YAAY,QAAW;AAC1B,oCAAgC,OAAwB,QAAQ,YAAY;AAAA,EAC7E;AAEA,WAAS,KAAK,QAAiB;AAG9B,UAAM,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,EAC9B;AAEA,WAAS,WAAc,KAAc,OAAuC;AAC3E,QAAI,UAAU;AACb,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAID,UAAM,KAAwB;AAAA,MAC7B,SAAS,GAAG,OAAO;AAAA,MACnB,MAAM,CAAC,QAAa;AACnB,cAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAI;AACH,cAAI,EAAG,YAAW,KAAK,EAAG,OAAM,CAAM;AAAA,QACvC,SAAS,GAAG;AACX,cAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,kCAAkC,CAAC,CAAC,CAAC;AAAA,QAC1E;AAAA,MACD;AAAA,IACD;AACA,UAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,MACxC,MAAM,OAAO,GAAG,IAAI,SAAS,SAAS,KAAK;AAAA,MAC3C,MAAM,EAAE,MAAM,0BAA0B,YAAY,QAAQ;AAAA,IAC7D,CAAC;AACD,WAAO,MAAM,OAAO,QAAQ,EAAE,QAAQ,GAAG,OAAO,cAAc,CAAC;AAAA,EAChE;AAEA,SAAO,EAAE,OAAO,UAAU,QAAQ,MAAM,WAAW;AACpD;;;AChPA,SAAS,OAAO,GAAY,GAAoB;AAC/C,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,KAAK,OAAO;AAClB,MACC,OAAO,OAAO,MACb,OAAO,YAAY,OAAO,YAAY,OAAO,aAAa,OAAO,WACjE;AACD,UAAM,KAAK;AACX,UAAM,KAAK;AACX,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAAA,EACrC;AACA,SAAO,OAAO,CAAC,EAAE,cAAc,OAAO,CAAC,CAAC;AACzC;AACA,SAAS,YAAkB,GAAmB,GAA2B;AACxE,QAAM,IAAI,OAAO,EAAE,WAAW,EAAE,SAAS;AACzC,SAAO,MAAM,IAAI,IAAI,OAAO,EAAE,SAAS,EAAE,OAAO;AACjD;AACA,SAAS,WAAiB,MAAiC,KAA6B;AACvF,MAAI,KAAK;AACT,MAAI,KAAK,KAAK;AACd,SAAO,KAAK,IAAI;AACf,UAAM,MAAO,KAAK,MAAO;AACzB,QAAI,YAAY,KAAK,GAAG,GAAqB,GAAG,IAAI,EAAG,MAAK,MAAM;AAAA,QAC7D,MAAK;AAAA,EACX;AACA,SAAO;AACR;AAGA,IAAM,eAAN,MAAyB;AAAA,EAChB,WAAW;AAAA,EACF,MAAwB,CAAC;AAAA,EACzB,QAAQ,oBAAI,IAAuB;AAAA,EACnC;AAAA,EAEjB,YAAY,UAAmB,cAAyC,CAAC,GAAG;AAC3E,SAAK,WAAW;AAChB,eAAW,OAAO,aAAa;AAC9B,WAAK,OAAO,IAAI,SAAS,IAAI,WAAW,IAAI,KAAK;AAAA,IAClD;AACA,SAAK,WAAW;AAAA,EACjB;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,OAAe;AAClB,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EACA,IAAI,SAAqB;AACxB,UAAM,MAAM,KAAK,MAAM,IAAI,OAAO;AAClC,QAAI,QAAQ,OAAW,QAAO;AAC9B,SAAK,SAAS,GAAG;AACjB,WAAO;AAAA,EACR;AAAA,EACA,IAAI,SAA2B;AAC9B,UAAM,MAAM,KAAK,MAAM,IAAI,OAAO;AAClC,QAAI,QAAQ,OAAW,QAAO;AAC9B,SAAK,SAAS,GAAG;AACjB,WAAO,IAAI;AAAA,EACZ;AAAA,EAEQ,SAAS,KAA2B;AAC3C,QAAI,CAAC,KAAK,SAAU;AACpB,SAAK,MAAM,OAAO,IAAI,OAAO;AAC7B,SAAK,MAAM,IAAI,IAAI,SAAS,GAAG;AAAA,EAChC;AAAA,EAEQ,UAAU,KAA2B;AAC5C,UAAM,QAAQ,WAAW,KAAK,KAAK,GAAG;AACtC,aACK,IAAI,OACR,IAAI,KAAK,IAAI,UAAU,YAAY,KAAK,IAAI,CAAC,GAAqB,GAAG,MAAM,GAC3E,KACC;AACD,UAAI,KAAK,IAAI,CAAC,MAAM,KAAK;AACxB,aAAK,IAAI,OAAO,GAAG,CAAC;AACpB;AAAA,MACD;AAAA,IACD;AACA,UAAM,WAAW,KAAK,IAAI,QAAQ,GAAG;AACrC,QAAI,YAAY,GAAG;AAClB,WAAK,IAAI,OAAO,UAAU,CAAC;AAC3B;AAAA,IACD;AACA,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACnE;AAAA,EAEA,OAAO,SAAY,WAAoB,OAAmB;AACzD,UAAM,WAAW,KAAK,MAAM,IAAI,OAAO;AACvC,UAAM,MAAsB,EAAE,SAAS,WAAW,MAAM;AACxD,QAAI,aAAa,QAAW;AAC3B,WAAK,UAAU,QAAQ;AACvB,WAAK,MAAM,OAAO,OAAO;AAAA,IAC1B;AACA,SAAK,IAAI,OAAO,WAAW,KAAK,KAAK,GAAG,GAAG,GAAG,GAAG;AACjD,SAAK,MAAM,IAAI,SAAS,GAAG;AAC3B,SAAK,YAAY;AACjB,WAAO,aAAa;AAAA,EACrB;AAAA,EAEA,OAAO,SAAqB;AAC3B,UAAM,WAAW,KAAK,MAAM,IAAI,OAAO;AACvC,QAAI,aAAa,OAAW,QAAO;AACnC,SAAK,UAAU,QAAQ;AACvB,SAAK,MAAM,OAAO,OAAO;AACzB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,QAAgB;AACf,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,IAAI,SAAS;AAClB,SAAK,MAAM,MAAM;AACjB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,eAAe,OAAU,KAAa;AACrC,QAAI,OAAO,OAAO,GAAG,KAAK,EAAG,QAAO,CAAC;AACrC,UAAM,OAAO,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC,EAAE;AAAA,MACtC,CAAC,CAAC,CAAC,MAAM,OAAO,GAAG,KAAK,KAAK,KAAK,OAAO,GAAG,GAAG,IAAI;AAAA,IACpD;AACA,SAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC;AACpC,WAAO,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK;AAAA,EACnC;AAAA,EAEA,oBAAoB,OAAmC,SAAiC;AACvF,QAAI,YAAY,OAAW,QAAO;AAClC,QAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,YAAM,IAAI,WAAW,0DAA0D,OAAO,GAAG;AAC1F,UAAM,WAAW,KAAK,IAAI,SAAS;AACnC,QAAI,YAAY,EAAG,QAAO;AAE1B,YAAQ,OAAO;AAAA,MACd,KAAK,aAAa;AACjB,cAAM,MAAM,KAAK,IAAI,CAAC;AACtB,YAAI,QAAQ,OAAW,QAAO;AAC9B,aAAK,IAAI,MAAM;AACf,aAAK,MAAM,OAAO,IAAI,OAAO;AAC7B,aAAK,YAAY;AACjB,eAAO,IAAI;AAAA,MACZ;AAAA,MACA,KAAK,WAAW;AACf,YAAI;AACJ,mBAAW,OAAO,KAAK,MAAM,KAAK,GAAG;AACpC,cAAI,WAAW,UAAa,OAAO,KAAK,MAAM,IAAI,EAAG,UAAS;AAAA,QAC/D;AACA,YAAI,WAAW,OAAW,QAAO;AACjC,cAAM,MAAM,KAAK,MAAM,IAAI,MAAM;AACjC,YAAI,QAAQ,OAAW,MAAK,UAAU,GAAG;AACzC,aAAK,MAAM,OAAO,MAAM;AACxB,aAAK,YAAY;AACjB,eAAO;AAAA,MACR;AAAA,MACA,KAAK,OAAO;AACX,cAAM,SAAS,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AACxC,YAAI,WAAW,OAAW,QAAO;AACjC,cAAM,MAAM,KAAK,MAAM,IAAI,MAAM;AACjC,YAAI,QAAQ,OAAW,MAAK,UAAU,GAAG;AACzC,aAAK,MAAM,OAAO,MAAM;AACxB,aAAK,YAAY;AACjB,eAAO;AAAA,MACR;AAAA,MACA,SAAS;AACR,cAAM,IAAI,MAAM,0CAA0C,OAAO,KAAK,CAAC,GAAG;AAAA,MAC3E;AAAA,IACD;AAAA,EACD;AAAA,EAEA,WAAsC;AACrC,WAAO,CAAC,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA,EACA,eAAkC;AACjC,UAAM,IAAI,oBAAI,IAAU;AACxB,eAAW,KAAK,KAAK,IAAK,GAAE,IAAI,EAAE,SAAS,EAAE,KAAK;AAClD,WAAO;AAAA,EACR;AACD;AAEA,SAAS,8BAA8B,MAAmD;AACzF,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACtC,UAAM,UAAU,IAAI;AACpB,QACC,YAAY,QACZ,OAAO,YAAY,YACnB,OAAO,YAAY,YACnB,OAAO,YAAY,WAClB;AACD;AAAA,IACD;AACA,UAAM,IAAI;AAAA,MACT,yCAAyC,CAAC;AAAA,IAC3C;AAAA,EACD;AACD;AAaO,SAAS,qCACf,aACA,UAAgC,CAAC,GACX;AACtB,SAAO,oBAAoB,SAAS,WAAW;AAChD;AAEA,SAAS,oBACR,UAAgC,CAAC,GACjC,cAAyC,CAAC,GACpB;AACtB,QAAM,EAAE,UAAU,OAAO,YAAY,KAAK,IAAI;AAC9C,QAAM,aAAa,UAAU,UAAU;AACvC,QAAM,UAAU,IAAI,aAAmB,YAAY,WAAW;AAC9D,QAAM,OAAqE;AAAA,IAC1E;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,UAAa,SAAS,UAAa,aAAa,SACvD;AAAA,MACA,UAAU;AAAA,MACV,aAAa;AAAA,MACb,cAAc,MAAM;AACnB,cAAM,OAAO,QAAQ,SAAS;AAC9B,sCAA8B,IAAI;AAClC,eAAO;AAAA,MACR;AAAA,IACD,IACC;AAAA,EACJ;AACA,QAAM,QAA2B,CAAC;AAClC,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAC5C,QAAM,WAAW,oBAAI,QAAuB;AAC5C,QAAM,YAAY,IAAI,cAGpB,QAAQ,WAAW,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,IAAI,MAAM;AACxD,WAAO,OAAO,QAAQ,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,MAAM;AAAA,EAC/D,CAAC;AACD,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI;AACJ,MAAI;AACJ,MAAI,eAAe,MAAM;AAAA,EAAC;AAE1B,WAAS,UAAa,GAAsC;AAC3D,WAAO,aAAa;AAAA,EACrB;AAEA,WAAS,gBAAgB,GAAmB;AAC3C,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI,WAAW,0DAA0D,CAAC,GAAG;AACpF,WAAO;AAAA,EACR;AAEA,WAAS,kBAAwB;AAChC,QAAI,yBAAyB,OAAW;AACxC,eAAS;AACR,YAAM,UAAU,QAAQ,oBAAoB,sBAAsB,cAAc;AAChF,UAAI,YAAY,OAAW;AAC3B,WAAK,KAAK,EAAE,MAAM,UAAU,QAAQ,CAAC;AAAA,IACtC;AAAA,EACD;AAEA,QAAM,YAAY,CAAC,QAAmB;AACrC,UAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,QAAQ,gBAAgB;AAC3B,cAAM,SAAS,UAAU,KAAK,CAAC;AAC/B,YAAI,WAAW,OAAW,kBAAiB,gBAAgB,MAAgB;AAC3E;AAAA,MACD;AACA,UAAI,OAAO,SAAS,IAAI,GAAG,GAAG;AAC7B,mBAAW,KAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAIjC;AACJ,kBAAQ,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK;AAC9C,eAAK,KAAK,EAAE,MAAM,UAAU,SAAS,EAAE,SAAS,WAAW,EAAE,WAAW,OAAO,EAAE,MAAM,CAAC;AACxF,0BAAgB;AAAA,QACjB;AAAA,MACD;AAAA,IACD;AACA,oBAAgB;AAAA,EACjB;AAEA,WAAS,cAAuC;AAC/C,QAAI,UAAU,OAAW,QAAO;AAChC,UAAM,KAA2C;AAAA,MAChD,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM,EAAE,SAAS,KAAK;AAAA,IACvB;AACA,UAAM,OAAO,iBAAiB,CAAC,cAA+B,IAAI,CAAC;AACnE,YAAQ,QACL,MAAM,SAAS,IAAI,MAAM;AAAA,MACzB,MAAM,OAAO,GAAG,IAAI,oBAAoB;AAAA,MACxC,MAAM,EAAE,MAAM,2BAA2B,YAAY,gBAAgB;AAAA,IACtE,CAAC,IACA,IAAI,KAAwB,MAAM,GAAG,MAAM;AAAA,MAC3C,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS;AAAA,MACT,MAAM,OAAO,GAAG,IAAI,oBAAoB;AAAA,IACzC,CAAC;AACH,mBAAe,QACZ,MAAM,OAAO,OAAO,EAAE,QAAQ,+BAA+B,CAAC,IAC9D,MAAM,UAAU,MAAM;AAAA,IAAC,CAAC;AAC3B,WAAO;AAAA,EACR;AAEA,MAAI;AACJ,QAAM,uBAA+D,UAAU;AAC/E,MAAI,aAAa,QAAW;AAC3B,QACC,yBAAyB,eACzB,yBAAyB,aACzB,yBAAyB,OACxB;AACD,YAAM,IAAI,MAAM,0EAA0E;AAAA,IAC3F;AAEA,UAAM,UAAU,SAAS;AACzB,QAAI,UAAU,OAAO,KAAK,UAAU,QAAW;AAC9C,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,IACD;AAEA,qBAAiB,UAAU,OAAO,IAC/B,UACA,QACC,MAAM;AAAA,MACN;AAAA,QACC,SAAS;AAAA,QACT,MAAM,MAAM;AAAA,QAAC;AAAA,QACb,MAAM,EAAE,SAAS,gBAAgB,OAAO,EAAE;AAAA,MAC3C;AAAA,MACA,CAAC;AAAA,MACD;AAAA,QACC,MAAM,OAAO,GAAG,IAAI,mBAAmB;AAAA,QACvC,MAAM,EAAE,MAAM,qBAAqB,YAAY,iBAAiB,QAAQ,UAAU;AAAA,MACnF;AAAA,IACD,IACC;AAEJ,QAAI,CAAC,UAAU,OAAO,EAAG,kBAAiB,gBAAgB,OAAO;AAEjE,QAAI,0BAA0B,KAAM,aAAY;AAAA,EACjD;AAIA,MAAI;AACJ,WAAS,eAAwC;AAChD,QAAI,kBAAkB,QAAW;AAChC,sBAAgB;AAAA,QACf,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AAGb,cAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,aAAa,CAAC,CAAC,CAAC;AAAA,QAC5C;AAAA,QACA,EAAE,SAAS,2BAA2B,SAAS,KAAK;AAAA,MACrD;AAAA,IACD;AACA,WAAO;AAAA,EACR;AAEA,WAAS,SAAS,OAAU,KAAuD;AAClF,UAAM,MAAM,CAAC,OAAO,GAAG;AACvB,UAAM,MAAM,UAAU,IAAI,GAAG;AAC7B,QAAI,QAAQ,OAAW,QAAO;AAC9B,UAAM,cAAc,MAAoB,QAAQ,eAAe,OAAO,GAAG;AACzE,QAAI;AACJ,WAAO,kBAAmD,KAAK,OAAwB;AAAA,MACtF,GAAG;AAAA,MACH,SAAS;AAAA,MACT,MAAM,OAAO,GAAG,IAAI,UAAU,UAAU,KAAK;AAAA,MAC7C,qBAAqB;AAAA,MACrB,WAAW,MAAM;AAChB,kBAAU,YAAY,IAAI;AAAA,MAC3B;AAAA,IACD,CAAC;AACD,cAAU,IAAI,KAAK,IAAI;AACvB,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IAEb,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,IAAI,SAAqB;AACxB,aAAO,QAAQ,IAAI,OAAO;AAAA,IAC3B;AAAA,IACA,IAAI,SAA2B;AAC9B,aAAO,QAAQ,IAAI,OAAO;AAAA,IAC3B;AAAA,IACA,eAAe,OAAU,KAAa;AACrC,aAAO,QAAQ,eAAe,OAAO,GAAG;AAAA,IACzC;AAAA,IACA,MAAM,OAAU,KAAuD;AACtE,aAAO,SAAS,OAAO,GAAG;AAAA,IAC3B;AAAA,IACA,UAAqC;AACpC,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IACA,eAAkC;AACjC,aAAO,QAAQ,aAAa;AAAA,IAC7B;AAAA,IACA,IAAI,YAAqC;AACxC,aAAO,aAAa;AAAA,IACrB;AAAA,IAEA,OAAO,SAAY,WAAoB,OAAmB;AACzD,YAAM,WAAW,QAAQ,OAAO,SAAS,WAAW,KAAK;AACzD,WAAK,KAAK,EAAE,MAAM,UAAU,SAAS,WAAW,MAAM,CAAC;AACvD,sBAAgB;AAChB,aAAO;AAAA,IACR;AAAA,IACA,WAAW,MAAoE;AAC9E,iBAAW,KAAK,MAAM;AACrB,gBAAQ,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK;AAC9C,aAAK,KAAK,EAAE,MAAM,UAAU,SAAS,EAAE,SAAS,WAAW,EAAE,WAAW,OAAO,EAAE,MAAM,CAAC;AACxF,wBAAgB;AAAA,MACjB;AAAA,IACD;AAAA,IACA,OAAO,SAAkB;AACxB,UAAI,QAAQ,OAAO,OAAO,EAAG,MAAK,KAAK,EAAE,MAAM,UAAU,QAAQ,CAAC;AAAA,IACnE;AAAA,IACA,WAAW,WAA8B;AACxC,YAAM,UAAe,CAAC;AACtB,iBAAW,KAAK,UAAW,KAAI,QAAQ,OAAO,CAAC,EAAG,SAAQ,KAAK,CAAC;AAChE,UAAI,QAAQ,SAAS,EAAG,MAAK,KAAK,EAAE,MAAM,cAAc,WAAW,QAAQ,CAAC;AAAA,IAC7E;AAAA,IACA,QAAc;AACb,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,MAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD;AAAA,IAEA,WAAW,KAAqE;AAC/E,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,YAAM,KAGF;AAAA,QACH,SAAS;AAAA,QACT,MAAM,CAAC,QAAa;AACnB,cAAI;AACH,uBAAW,KAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAIjC;AACJ,kBAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,YACvB;AAAA,UACD,SAAS,GAAG;AACX,gBAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,iCAAiC,CAAC,CAAC,CAAC;AAAA,UACzE;AAAA,QACD;AAAA,MACD;AACA,YAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,QACxC,MAAM,OAAO,GAAG,IAAI,SAAS,SAAS,KAAK;AAAA,QAC3C,MAAM,EAAE,MAAM,0BAA0B,YAAY,gBAAgB;AAAA,MACrE,CAAC;AACD,eAAS,IAAI,MAAuB;AACpC,YAAM,YAAY,YAAY;AAC9B,gBAAU,aAAa,QAAyB,SAAS;AACzD,UAAIC,UAAS;AACb,YAAM,UAAU,MAAM;AACrB,YAAI,CAACA,QAAQ;AACb,QAAAA,UAAS;AACT,kBAAU,eAAe,QAAyB,SAAS;AAAA,MAC5D;AACA,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,mBAAa;AACb,gBAAU,WAAW;AAAA,IACtB;AAAA,EACD;AACD;;;ACjkBO,IAAM,eAAN,MAAmB;AAAA,EAChB;AAAA,EAET,YAAY,UAAoC,CAAC,GAAG;AACnD,SAAK,OAAO,CAAC,GAAG,OAAO;AAAA,EACxB;AAAA,EAEA,IAAOC,OAA4C;AAClD,QAAIA,UAAS,OAAW,QAAO,oBAAuB;AACtD,UAAM,QAAQ,KAAK,KAAK,KAAKA,KAAqB,IAAI;AACtD,WAAO,aAAgB,KAAK;AAAA,EAC7B;AACD;AAEA,SAAS,sBAA0C;AAClD,SAAO;AAAA,IACN,OAAO;AAAA,IACP,MAAM,CAAC,MAAM,YAAY;AAAA,EAC1B;AACD;AAEA,SAAS,aAAgB,OAAgC;AACxD,SAAO;AAAA,IACN;AAAA,IACA,KAAK,KAAK,SAAS;AAClB,YAAM,SAAS,UAAU,KAAK,KAAK;AACnC,aAAO,WAAW,SAAY,UAAW;AAAA,IAC1C;AAAA,EACD;AACD;AAMO,SAAS,QAAW,MAAsC;AAChE,SAAO;AAAA,IACN,MAAM,MAAM;AAAA,EACb;AACD;AAYO,SAAS,iBACf,OACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,2CAA2C,OAAO,GAAG;AAE3E,QAAM,OAAO,UAAU,SAAS,OAAO,OAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,SAAS;AACpF,MAAI,SAAS,OAAW,OAAM,IAAI,MAAM,wDAAwD;AAChG,QAAM,WAAW,OAAO;AACxB,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,MAAI,MAAM,QAAQ,KAAK,KAAK,EAAE,UAAU,QAAS,QAAO,MAAM,OAAO,GAAG,QAAQ;AAEhF,QAAM,UAAe,CAAC;AACtB,aAAW,QAAQ,OAAO;AACzB,YAAQ,KAAK,IAAI;AACjB,QAAI,QAAQ,WAAW,SAAU;AAAA,EAClC;AACA,SAAO;AACR;AAcO,SAAS,YAAkC;AACjD,SAAO,IAAI,gBAAmB;AAC/B;AAEA,IAAM,kBAAN,MAAsD;AAAA,EACpC,QAA4B,CAAC;AAAA,EAE9C,IAAI,OAAe;AAClB,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,KAAK,MAA8B;AAClC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,GAAG,KAAK,MAAM,SAAS,CAAC;AAAA,EAC9B;AAAA,EAEA,OAAqC;AACpC,WAAO,KAAK,MAAM,CAAC;AAAA,EACpB;AAAA,EAEA,MAAoC;AACnC,UAAM,MAAM,KAAK,MAAM,CAAC;AACxB,UAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,QAAI,QAAQ,UAAa,SAAS,UAAa,KAAK,MAAM,SAAS,GAAG;AACrE,WAAK,MAAM,CAAC,IAAI;AAChB,WAAK,KAAK,CAAC;AAAA,IACZ;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,GAAG,GAAiB;AAC3B,WAAO,IAAI,GAAG;AACb,YAAM,IAAK,IAAI,KAAM;AACrB,UACE,KAAK,MAAM,CAAC,EAAuB,aACnC,KAAK,MAAM,CAAC,EAAuB;AAEpC;AACD,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI;AAAA,QAChC,KAAK,MAAM,CAAC;AAAA,QACZ,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,KAAK,GAAiB;AAC7B,eAAS;AACR,YAAM,OAAO,IAAI,IAAI;AACrB,YAAM,QAAQ,OAAO;AACrB,UAAI,WAAW;AACf,UAAI,OAAO,KAAK,MAAM,UAAU,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,QAAQ;AAC7E,mBAAW;AACZ,UAAI,QAAQ,KAAK,MAAM,UAAU,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,QAAQ;AAC/E,mBAAW;AACZ,UAAI,aAAa,EAAG;AACpB,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC,IAAI;AAAA,QACvC,KAAK,MAAM,QAAQ;AAAA,QACnB,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,UAAU,GAAmB;AACpC,WAAQ,KAAK,MAAM,CAAC,EAAuB;AAAA,EAC5C;AACD;AAWO,SAAS,uBACf,eACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,yDAAyD,OAAO,GAAG;AACzF,QAAM,WAAW,cAAc,SAAS;AACxC,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,SAAO,cACL,IAAI,CAAC,MAAM,UAAU;AACrB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK;AAC9B,YAAM,IAAI,WAAW,uCAAuC,KAAK,KAAK,GAAG;AAC1E,WAAO,EAAE,GAAG,MAAM,MAAM;AAAA,EACzB,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,MAAM,GAAG,QAAQ,EACjB,IAAI,CAAC,SAAS,KAAK,KAAK;AAC3B;;;AC5IA,IAAM,cAAN,MAAqB;AAAA,EACZ,WAAW;AAAA,EACF;AAAA,EAEjB,YAAY,SAAwB,SAAkB;AACrD,SAAK,MAAM,UAAU,CAAC,GAAG,OAAO,IAAI,CAAC;AACrC,qBAAiB,KAAK,KAAK,EAAE,QAAQ,CAAC;AAAA,EACvC;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAI,OAAe;AAClB,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EAEA,GAAG,OAA8B;AAChC,QAAI,CAAC,OAAO,UAAU,KAAK,EAAG,QAAO;AACrC,UAAM,IAAI,SAAS,IAAI,QAAQ,KAAK,IAAI,SAAS;AACjD,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI,SAAS,SAAY,KAAK,IAAI,CAAC;AAAA,EAC9D;AAAA,EAEA,WAAyB;AACxB,WAAO,CAAC,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA,EAEA,OAAO,OAAgB;AACtB,SAAK,IAAI,KAAK,KAAK;AACnB,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,WAAW,QAA4B;AACtC,QAAI,OAAO,WAAW,EAAG;AACzB,eAAW,KAAK,OAAQ,MAAK,IAAI,KAAK,CAAC;AACvC,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,OAAO,OAAe,OAAgB;AACrC,QAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI;AAC7D,YAAM,IAAI,WAAW,iBAAiB,KAAK,qBAAqB,KAAK,IAAI,MAAM,GAAG;AACnF,SAAK,IAAI,OAAO,OAAO,GAAG,KAAK;AAC/B,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,WAAW,OAAe,QAA4B;AACrD,QAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI;AAC7D,YAAM,IAAI,WAAW,qBAAqB,KAAK,qBAAqB,KAAK,IAAI,MAAM,GAAG;AACvF,QAAI,OAAO,WAAW,EAAG;AACzB,SAAK,IAAI,OAAO,OAAO,GAAG,GAAG,MAAM;AACnC,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,IAAI,OAAkB;AACrB,QAAI,KAAK,IAAI,WAAW,EAAG,OAAM,IAAI,WAAW,qBAAqB;AACrE,QAAI,CAAC,OAAO,UAAU,KAAK,EAAG,OAAM,IAAI,WAAW,cAAc,KAAK,qBAAqB;AAC3F,UAAM,IAAI,SAAS,IAAI,QAAQ,KAAK,IAAI,SAAS;AACjD,QAAI,IAAI,KAAK,KAAK,KAAK,IAAI,OAAQ,OAAM,IAAI,WAAW,cAAc,KAAK,eAAe;AAC1F,UAAM,CAAC,CAAC,IAAI,KAAK,IAAI,OAAO,GAAG,CAAC;AAChC,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,QAAgB;AACf,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,IAAI,SAAS;AAClB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,eAAe,SAA0B;AACxC,UAAM,UAAU,iBAAiB,KAAK,KAAK,EAAE,QAAQ,CAAC,EAAE;AACxD,QAAI,UAAU,EAAG,MAAK,YAAY;AAClC,WAAO;AAAA,EACR;AACD;AAiBO,SAAS,aACf,SACA,UAA+B,CAAC,GACd;AAClB,QAAM,EAAE,SAAS,OAAO,WAAW,IAAI;AACvC,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAE5C,WAAS,UAAU,GAA2D;AAC7E,WAAO,aAAa;AAAA,EACrB;AAEA,WAAS,gBAAgB,GAAmB;AAC3C,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI,WAAW,yDAAyD,CAAC,GAAG;AACnF,WAAO;AAAA,EACR;AAEA,QAAM,iBAAiB,UAAU,OAAO,IAAI,SAAY;AACxD,QAAM,UAAU,IAAI;AAAA,IACnB;AAAA,IACA,mBAAmB,SAAY,SAAY,gBAAgB,cAAc;AAAA,EAC1E;AACA,QAAM,aAAa,UAAU,UAAa,QAAQ,SAAS,UAAa,YAAY;AACpF,QAAM,OAAoD;AAAA,IACzD;AAAA,IACA;AAAA,IACA;AAAA,IACA,aACG;AAAA,MACA,UAAU;AAAA,MACV,aAAa;AAAA,MACb,cAAc,MAAM,QAAQ,SAAS;AAAA,IACtC,IACC;AAAA,EACJ;AACA,QAAM,QAA2B,CAAC;AAClC,QAAM,WAAW,oBAAI,QAAuB;AAC5C,MAAI,UAAU;AACd,MAAI;AACJ,MAAI;AACJ,MAAI,eAAe,MAAM;AAAA,EAAC;AAC1B,MAAI,iBAAiB;AAErB,WAAS,YAAY,GAAiB;AACrC,QAAI,IAAI,EAAG,MAAK,KAAK,EAAE,MAAM,YAAY,EAAE,CAAC;AAAA,EAC7C;AAEA,WAAS,kBAAwB;AAChC,gBAAY,QAAQ,eAAe,cAAc,CAAC;AAAA,EACnD;AAEA,QAAM,YAAY,CAAC,QAAmB;AACrC,UAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,QAAQ,gBAAgB;AAC3B,cAAM,SAAS,UAAU,KAAK,CAAC;AAC/B,YAAI,WAAW,OAAW,kBAAiB,gBAAgB,MAAgB;AAC3E;AAAA,MACD;AACA,UAAI,OAAO,SAAS,IAAI,GAAG,GAAG;AAC7B,mBAAW,SAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoB;AAC7D,kBAAQ,OAAO,KAAK;AACpB,eAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AACnC,0BAAgB;AAAA,QACjB;AAAA,MACD;AAAA,IACD;AACA,oBAAgB;AAAA,EACjB;AAEA,WAAS,cAAmC;AAC3C,QAAI,UAAU,OAAW,QAAO;AAChC,UAAM,KAAuC;AAAA,MAC5C,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM,EAAE,SAAS,KAAK;AAAA,IACvB;AACA,UAAM,OAAO,iBAAiB,CAAC,cAA+B,IAAI,CAAC;AACnE,YAAQ,QACL,MAAM,SAAS,IAAI,MAAM;AAAA,MACzB,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,oBAAoB;AAAA,MACxD,MAAM,EAAE,MAAM,2BAA2B,YAAY,eAAe;AAAA,IACrE,CAAC,IACA,IAAI,KAAoB,MAAM,GAAG,MAAM;AAAA,MACvC,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS;AAAA,MACT,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,oBAAoB;AAAA,IACzD,CAAC;AACH,mBAAe,QACZ,MAAM,OAAO,OAAO,EAAE,QAAQ,8BAA8B,CAAC,IAC7D,MAAM,UAAU,MAAM;AAAA,IAAC,CAAC;AAC3B,WAAO;AAAA,EACR;AAEA,WAAS,gBAAgB,OAA6B;AACrD,UAAM,KAA8B;AAAA,MACnC,SAAS;AAAA,MACT,MAAM,MAAM;AAAA,MAAC;AAAA,MACb,MAAM,EAAE,SAAS,MAAM;AAAA,IACxB;AACA,QAAI,OAAO;AACV,aAAO,MAAM,SAAS,IAAI,CAAC,GAAG;AAAA,QAC7B,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,mBAAmB;AAAA,QACvD,MAAM,EAAE,MAAM,qBAAqB,YAAY,gBAAgB,QAAQ,UAAU;AAAA,MAClF,CAAC;AAAA,IACF;AACA,WAAO,IAAI,KAAa,CAAC,GAAG,MAAM;AAAA,MACjC,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS;AAAA,MACT,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,mBAAmB;AAAA,IACxD,CAAC;AAAA,EACF;AAEA,MAAI,YAAY,QAAW;AAC1B,QAAI,UAAU,OAAO,KAAK,UAAU;AACnC,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,qBAAiB,UAAU,OAAO,IAC/B,UACA,QACC,gBAAgB,gBAAgB,OAAO,CAAC,IACxC;AACJ,QAAI,mBAAmB,OAAW,aAAY;AAAA,EAC/C;AAEA,SAAO;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IAEb,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,GAAG,OAA8B;AAChC,aAAO,QAAQ,GAAG,KAAK;AAAA,IACxB;AAAA,IACA,UAAwB;AACvB,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IAEA,OAAO,OAAgB;AACtB,cAAQ,OAAO,KAAK;AACpB,WAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AACnC,sBAAgB;AAAA,IACjB;AAAA,IACA,WAAW,QAA4B;AACtC,UAAI,OAAO,WAAW,EAAG;AACzB,YAAM,OAAO,CAAC,GAAG,MAAM;AACvB,cAAQ,WAAW,IAAI;AACvB,WAAK,KAAK,EAAE,MAAM,cAAc,QAAQ,KAAK,CAAC;AAC9C,sBAAgB;AAAA,IACjB;AAAA,IACA,OAAO,OAAe,OAAgB;AACrC,cAAQ,OAAO,OAAO,KAAK;AAC3B,WAAK,KAAK,EAAE,MAAM,UAAU,OAAO,MAAM,CAAC;AAC1C,sBAAgB;AAAA,IACjB;AAAA,IACA,WAAW,OAAe,QAA4B;AACrD,UAAI,OAAO,WAAW,GAAG;AAExB,gBAAQ,WAAW,OAAO,MAAM;AAChC;AAAA,MACD;AACA,YAAM,OAAO,CAAC,GAAG,MAAM;AACvB,cAAQ,WAAW,OAAO,IAAI;AAC9B,WAAK,KAAK,EAAE,MAAM,cAAc,OAAO,QAAQ,KAAK,CAAC;AACrD,sBAAgB;AAAA,IACjB;AAAA,IACA,IAAI,QAAQ,IAAO;AAClB,YAAM,WAAW,QAAQ,IAAI,QAAQ,OAAO,QAAQ;AACpD,YAAM,QAAQ,QAAQ,IAAI,KAAK;AAC/B,WAAK,KAAK,EAAE,MAAM,OAAO,OAAO,UAAU,MAAM,CAAC;AACjD,aAAO;AAAA,IACR;AAAA,IACA,QAAc;AACb,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,MAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD;AAAA,IAEA,WAAW,KAA0B;AACpC,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,YAAM,KAAqB;AAAA,QAC1B,SAAS;AAAA,QACT,MAAM,CAAC,QAAa;AACnB,cAAI;AACH,uBAAW,SAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoB;AAC7D,kBAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,YAC3B;AAAA,UACD,SAAS,GAAG;AACX,gBAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,gCAAgC,CAAC,CAAC,CAAC;AAAA,UACxE;AAAA,QACD;AAAA,MACD;AACA,YAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,QACxC,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,SAAS,SAAS,KAAK;AAAA,QAC3D,MAAM,EAAE,MAAM,0BAA0B,YAAY,eAAe;AAAA,MACpE,CAAC;AACD,eAAS,IAAI,MAAuB;AACpC,YAAM,YAAY,YAAY;AAC9B,gBAAU,aAAa,QAAyB,SAAS;AACzD,UAAIC,UAAS;AACb,YAAM,UAAU,MAAM;AACrB,YAAI,CAACA,QAAQ;AACb,QAAAA,UAAS;AACT,kBAAU,eAAe,QAAyB,SAAS;AAAA,MAC5D;AACA,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,mBAAa;AAAA,IACd;AAAA,EACD;AACD;;;ACjSA,IAAM,aAAN,MAAoB;AAAA,EACX,WAAW;AAAA,EACX;AAAA,EACS;AAAA,EAEjB,YAAY,SAAwB,SAAkB;AACrD,QAAI,YAAY,UAAa,UAAU;AACtC,YAAM,IAAI,WAAW,mCAAmC;AACzD,SAAK,UAAU;AACf,SAAK,MAAM,UAAU,CAAC,GAAG,OAAO,IAAI,CAAC;AACrC,qBAAiB,KAAK,KAAK,EAAE,QAAQ,CAAC;AAAA,EACvC;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,OAAe;AAClB,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EACA,GAAG,OAA8B;AAChC,QAAI,CAAC,OAAO,UAAU,KAAK,EAAG,QAAO;AACrC,UAAM,IAAI,SAAS,IAAI,QAAQ,KAAK,IAAI,SAAS;AACjD,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI,SAAS,SAAY,KAAK,IAAI,CAAC;AAAA,EAC9D;AAAA,EACA,WAAyB;AACxB,WAAO,CAAC,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA,EAEA,OAAO,OAAgB;AACtB,SAAK,IAAI,KAAK,KAAK;AACnB,qBAAiB,KAAK,KAAK,EAAE,SAAS,KAAK,QAAQ,CAAC;AACpD,SAAK,YAAY;AAAA,EAClB;AAAA,EACA,WAAW,QAA4B;AACtC,QAAI,OAAO,WAAW,EAAG;AACzB,eAAW,KAAK,OAAQ,MAAK,IAAI,KAAK,CAAC;AACvC,qBAAiB,KAAK,KAAK,EAAE,SAAS,KAAK,QAAQ,CAAC;AACpD,SAAK,YAAY;AAAA,EAClB;AAAA,EACA,QAAgB;AACf,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,IAAI,SAAS;AAClB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EACA,SAAS,GAAmB;AAC3B,QAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AAC/B,YAAM,IAAI,WAAW,mDAAmD,CAAC,GAAG;AAC7E,QAAI,MAAM,KAAK,KAAK,IAAI,WAAW,EAAG,QAAO;AAC7C,UAAM,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM;AAC3C,SAAK,IAAI,OAAO,GAAG,OAAO;AAC1B,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AACD;AAEA,SAAS,gBAAmB,OAAU,KAAmB;AAExD,MAAI,UAAU;AACb,UAAM,IAAI;AAAA,MACT,GAAG,GAAG;AAAA,IACP;AACF;AAMO,SAAS,YACf,SACA,UAA8B,CAAC,GACd;AACjB,QAAM,EAAE,SAAS,WAAW,GAAG,SAAS,IAAI;AAC5C,QAAM,OAAO,SAAS,aAAa,EAAE,YAAY,SAAS,WAAW,IAAI,CAAC;AAC1E,QAAM,UAAU,IAAI,WAAc,SAAS,OAAO;AAClD,QAAM,gBACL,SAAS,UAAU,UAAa,SAAS,SAAS,SAC9C;AAAA,IACD,GAAI,YAAY,SAAY,EAAE,QAAQ,IAAI,CAAC;AAAA,EAC5C,IACC;AACJ,QAAM,OAAmD;AAAA,IACxD;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB,SACf;AAAA,MACA,UAAU;AAAA,MACV,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,cAAc,MAAM,QAAQ,SAAS;AAAA,IACtC,IACC;AAAA,EACJ;AACA,QAAM,QAA2B,CAAC;AAClC,QAAM,WAAW,oBAAI,IAAgC;AACrD,QAAM,YAAY,oBAAI,IAAgC;AACtD,QAAM,WAAW,IAAI,cAAgE,SAAS;AAC9F,MAAI,UAAU;AAEd,SAAO;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IAEb,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,GAAG,OAA8B;AAChC,aAAO,QAAQ,GAAG,KAAK;AAAA,IACxB;AAAA,IACA,UAAwB;AACvB,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IAEA,OAAO,OAAgB;AACtB,sBAAgB,OAAO,oBAAoB;AAC3C,cAAQ,OAAO,KAAK;AACpB,WAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AAAA,IACpC;AAAA,IACA,WAAW,QAA4B;AACtC,UAAI,OAAO,WAAW,EAAG;AACzB,iBAAW,KAAK,OAAQ,iBAAgB,GAAG,wBAAwB;AACnE,YAAM,OAAO,CAAC,GAAG,MAAM;AACvB,cAAQ,WAAW,IAAI;AACvB,WAAK,KAAK,EAAE,MAAM,cAAc,QAAQ,KAAK,CAAC;AAAA,IAC/C;AAAA,IACA,QAAc;AACb,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,MAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD;AAAA,IACA,SAAS,GAAiB;AACzB,YAAM,UAAU,QAAQ,SAAS,CAAC;AAClC,UAAI,UAAU,EAAG,MAAK,KAAK,EAAE,MAAM,YAAY,GAAG,QAAQ,CAAC;AAAA,IAC5D;AAAA,IAEA,KAAK,GAA+B;AACnC,UAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AAC/B,cAAM,IAAI,WAAW,+CAA+C,CAAC,GAAG;AACzE,YAAM,MAAM,SAAS,IAAI,CAAC;AAC1B,UAAI,QAAQ,OAAW,QAAO;AAI9B,YAAM,QAAQ;AAAA,QACb,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AACb,gBAAM,MAAM,QAAQ,SAAS;AAC7B,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,IAAI,CAAC,IAAI,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,QAC3E;AAAA,QACA,EAAE,GAAG,MAAM,SAAS,oBAAoB,SAAS,KAAK;AAAA,MACvD;AACA,eAAS,IAAI,GAAG,KAAK;AACrB,aAAO;AAAA,IACR;AAAA,IAEA,MAAM,OAAe,MAAmC;AACvD,UAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC1C,cAAM,IAAI,WAAW,oDAAoD,KAAK,GAAG;AAAA,MAClF;AACA,UAAI,SAAS,WAAc,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,IAAI;AAChE,cAAM,IAAI,WAAW,mDAAmD,IAAI,GAAG;AAAA,MAChF;AACA,YAAM,MAAM,GAAG,KAAK,IAAI,QAAQ,EAAE;AAClC,YAAM,MAAM,UAAU,IAAI,GAAG;AAC7B,UAAI,QAAQ,OAAW,QAAO;AAG9B,YAAM,QAAQ;AAAA,QACb,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AACb,cAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,SAAS,EAAE,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AAAA,QAC3D;AAAA,QACA,EAAE,GAAG,MAAM,SAAS,qBAAqB,SAAS,KAAK;AAAA,MACxD;AACA,gBAAU,IAAI,KAAK,KAAK;AACxB,aAAO;AAAA,IACR;AAAA,IAEA,KAAK,QAAgB,OAAyD;AAC7E,UAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC5C,cAAM,IAAI,WAAW,oDAAoD,MAAM,GAAG;AAAA,MACnF;AACA,UAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC1C,cAAM,IAAI,WAAW,mDAAmD,KAAK,GAAG;AAAA,MACjF;AACA,YAAM,MAAM,GAAG,MAAM,IAAI,KAAK;AAC9B,YAAM,MAAM,SAAS,IAAI,GAAG;AAC5B,UAAI,QAAQ,OAAW,QAAO;AAC9B,YAAM,cAAc,MAAoB,QAAQ,SAAS,EAAE,MAAM,QAAQ,SAAS,KAAK;AACvF,UAAI;AACJ,aAAO,kBAA8C,KAAK,OAAwB;AAAA,QACjF,GAAG;AAAA,QACH,SAAS;AAAA,QACT,MAAM,SAAS,OAAO,GAAG,SAAS,IAAI,SAAS,SAAS,KAAK;AAAA,QAC7D,qBAAqB;AAAA,QACrB,WAAW,MAAM;AAChB,mBAAS,YAAY,IAAI;AAAA,QAC1B;AAAA,MACD,CAAC;AACD,eAAS,IAAI,KAAK,IAAI;AACtB,aAAO;AAAA,IACR;AAAA,IAEA,KAAQC,UAAY,MAAwC;AAG3D,aAAO;AAAA,QACN,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AACb,gBAAM,KAAK,IAAI,MAAM,IAAmC,KAAK;AAAA,YAC5D,KAAKA;AAAA,YACL,WAAW;AAAA,UACZ;AACA,gBAAM,MAAM,QAAQ,SAAS;AAC7B,cAAI,IAAI,SAAS,GAAG,aAAc,YAAY,UAAa,IAAI,UAAU,GAAG,WAAY;AAEvF,gBAAI,MAAMA;AACV,uBAAW,KAAK,IAAK,OAAM,KAAK,KAAK,CAAC;AACtC,eAAG,MAAM;AACT,eAAG,YAAY,IAAI;AAAA,UACpB,OAAO;AACN,qBAAS,IAAI,GAAG,WAAW,IAAI,IAAI,QAAQ,IAAK,IAAG,MAAM,KAAK,GAAG,KAAK,IAAI,CAAC,CAAM;AACjF,eAAG,YAAY,IAAI;AAAA,UACpB;AACA,cAAI,MAAM,IAAI,EAAE;AAChB,cAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,QAC5B;AAAA,QACA,EAAE,GAAG,MAAM,SAAS,oBAAoB,SAAS,KAAK;AAAA,MACvD;AAAA,IACD;AAAA,IAEA,OAAO,KAA0B;AAChC,YAAM,UAAU,KAAK,WAAW,KAAK,CAAC,UAAa;AAClD,wBAAgB,OAAO,oBAAoB;AAC3C,gBAAQ,OAAO,KAAK;AACpB,aAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AAAA,MACpC,CAAC;AACD,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,eAAS,MAAM;AACf,gBAAU,MAAM;AAChB,eAAS,WAAW;AAAA,IACrB;AAAA,EACD;AACD;;;ACrRA,SAAS,OACR,SAEA,OACA,MACqB;AACrB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,MAAM,CAAC,QAAQ;AACd,UAAI;AACJ,UAAI,cAAc;AAClB,UAAI,eAAe,MAAM;AACxB,sBAAc;AACd,YAAI,OAAO,YAAY,WAAY,SAAQ;AAAA,MAC5C,CAAC;AACD,YAAM,eAAe,MAAM,GAAG;AAC9B,gBAAU,OAAO,iBAAiB,aAAa,eAAe;AAC9D,UAAI,eAAe,OAAO,YAAY,WAAY,SAAQ;AAAA,IAC3D;AAAA,EACD;AACD;AAybA,SAAS,YAAY,SAAiB,IAAY,MAAiD;AAClG,QAAM,EAAE,QAAQ,OAAO,IAAI,QAAQ,CAAC;AACpC,QAAM,KAAK;AAAA,IACV;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,OAAO;AACX,UAAI,QAAQ;AACZ,UAAI;AACJ,UAAI;AACJ,YAAM,UAAU,MAAM;AACrB,eAAO;AACP,YAAI,MAAM,OAAW,cAAa,CAAC;AACnC,YAAI,OAAO,OAAW,eAAc,EAAE;AACtC,gBAAQ,oBAAoB,SAAS,OAAO;AAAA,MAC7C;AACA,YAAM,UAAU,MAAM;AACrB,YAAI,KAAM;AACV,gBAAQ;AACR,YAAI,KAAK,CAAC,CAAC,SAAS,aAAa,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,MACnD;AACA,YAAM,SAAS,MAAM;AACpB,YAAI,KAAM;AACV,YAAI,UAAU,MAAM;AACnB,cAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AAC5B,eAAK,YAAY,MAAM;AACtB,gBAAI,KAAM;AACV,gBAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AAAA,UAC7B,GAAG,MAAM;AAAA,QACV,OAAO;AAEN,iBAAO;AACP,kBAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC;AAAA,QAC3C;AAAA,MACD;AACA,UAAI,QAAQ,SAAS;AACpB,gBAAQ;AACR;AAAA,MACD;AACA,cAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACzD,UAAI,WAAW,QAAQ,EAAE;AACzB,aAAO;AAAA,IACR;AAAA,IACA,EAAE,MAAM,QAAQ,UAAU,MAAM;AAAA,EACjC;AACA,MAAI,YAAY,WAAW,WAAW,UAAa,WAAW,QAAW;AACxE,WAAO,EAAE,GAAG,IAAI,SAAS,EAAE,KAAK,SAAS,QAAQ,EAAE,IAAI,iBAAiB,IAAI,UAAU,EAAE,EAAE,EAAE;AAAA,EAC7F;AACA,SAAO;AACR;AAOO,SAAS,MAAM,IAAY,MAAiD;AAClF,SAAO,YAAY,SAAS,IAAI,IAAI;AACrC;;;AC/bA,SAAS,mBAAmB,OAAwB;AACnD,SAAO,MAAM,KAAK,yBAAyB,KAAK,CAAC,EAAE,KAAK,GAAG;AAC5D;AAoBA,IAAM,aAAN,MAAuB;AAAA,EACd,WAAW;AAAA,EACF,QAAQ,oBAAI,IAAiB;AAAA,EAC7B;AAAA,EAEjB,YAAY,MAA8B;AACzC,SAAK,MAAM,KAAK,OAAO,KAAK;AAAA,EAC7B;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAI,OAAe;AAClB,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,QAAgB;AACf,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EAEA,YAAY,KAA4B;AACvC,WAAO,KAAK,MAAM,IAAI,GAAG,GAAG;AAAA,EAC7B;AAAA,EAEQ,UAAU,GAAsB;AACvC,WAAO,EAAE,cAAc,UAAa,KAAK,IAAI,KAAK,EAAE;AAAA,EACrD;AAAA,EAEA,iBAAiB,KAAkC;AAClD,QAAI,QAAQ,OAAW,QAAO;AAC9B,QAAI,CAAC,OAAO,SAAS,GAAG,KAAK,OAAO;AACnC,YAAM,IAAI,WAAW,0DAA0D,GAAG,GAAG;AACtF,WAAO,KAAK,IAAI,IAAI;AAAA,EACrB;AAAA,EAEQ,cAAc,KAAQ,GAA4B;AACzD,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,YAAY;AACjB,WAAO,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC;AAAA,EACvB;AAAA;AAAA,EAGA,OAAO,KAAmB;AACzB,UAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AAC5B,QAAI,MAAM,OAAW,QAAO,EAAE,OAAO,MAAM;AAC3C,QAAI,KAAK,UAAU,CAAC,EAAG,QAAO,EAAE,OAAO,OAAO,SAAS,MAAM,UAAU,EAAE,MAAM;AAE/E,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,MAAM,IAAI,KAAK,CAAC;AACrB,WAAO,EAAE,OAAO,MAAM,OAAO,EAAE,MAAM;AAAA,EACtC;AAAA;AAAA,EAGA,IAAI,KAAQ,OAAU,WAA0B;AAC/C,QAAI,KAAK,MAAM,IAAI,GAAG,EAAG,MAAK,MAAM,OAAO,GAAG;AAC9C,SAAK,MAAM,IAAI,KAAK,EAAE,OAAO,UAAU,CAAC;AACxC,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,WAAW,SAAiC;AAC3C,UAAM,UAAyB,CAAC;AAChC,eAAW,UAAU,iBAAiB,QAAQ,KAAK,MAAM,KAAK,CAAC,EAAE,KAAK,GAAG;AAAA,MACxE;AAAA,MACA,MAAM,KAAK,MAAM;AAAA,IAClB,CAAC,GAAG;AACH,YAAM,IAAI,KAAK,MAAM,IAAI,MAAM;AAC/B,UAAI,MAAM,OAAW,SAAQ,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC;AACnD,WAAK,MAAM,OAAO,MAAM;AAAA,IACzB;AACA,QAAI,QAAQ,SAAS,EAAG,MAAK,YAAY;AACzC,WAAO;AAAA,EACR;AAAA,EAEA,iBAAiB,QAAuD;AACvE,QAAI,WAAW,UAAa,OAAO,YAAY,OAAW,QAAO,CAAC;AAClE,UAAM,SAAyC,CAAC;AAChD,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,OAAO;AACtC,UAAI,CAAC,KAAK,UAAU,KAAK,GAAG;AAC3B,eAAO,KAAK;AAAA,UACX,OAAO,CAAC,KAAK,MAAM,KAAK;AAAA,UACxB,OAAO,OAAO,MAAM,EAAE,KAAK,OAAO,MAAM,MAAM,CAAC;AAAA,QAChD,CAAC;AAAA,MACF;AAAA,IACD;AACA,UAAM,WAAW,uBAAuB,QAAQ,EAAE,SAAS,OAAO,QAAQ,CAAC;AAC3E,eAAW,CAAC,GAAG,KAAK,SAAU,MAAK,MAAM,OAAO,GAAG;AACnD,QAAI,SAAS,SAAS,EAAG,MAAK,YAAY;AAC1C,WAAO,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,KAAK,CAAC;AAAA,EACnD;AAAA,EAEA,OAAO,KAAmB;AACzB,UAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AAC5B,QAAI,MAAM,OAAW,QAAO,EAAE,OAAO,MAAM;AAC3C,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,YAAY;AACjB,WAAO,EAAE,OAAO,MAAM,OAAO,EAAE,MAAM;AAAA,EACtC;AAAA,EAEA,QAAgB;AACf,UAAM,IAAI,KAAK,MAAM;AACrB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,MAAM,MAAM;AACjB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,eAA8B;AAC7B,UAAM,UAAyB,CAAC;AAChC,eAAW,CAAC,GAAG,CAAC,KAAK,KAAK,OAAO;AAChC,UAAI,KAAK,UAAU,CAAC,GAAG;AACtB,aAAK,MAAM,OAAO,CAAC;AACnB,gBAAQ,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC;AAAA,MAC1B;AAAA,IACD;AACA,QAAI,QAAQ,SAAS,EAAG,MAAK,YAAY;AACzC,WAAO;AAAA,EACR;AAAA,EAEA,kBAAkB,KAAuB;AACxC,UAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AAC5B,QAAI,MAAM,UAAa,CAAC,KAAK,UAAU,CAAC,EAAG,QAAO,CAAC;AACnD,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EACjC;AAAA;AAAA,EAGA,WAA8B;AAC7B,UAAM,MAAM,oBAAI,IAAU;AAC1B,eAAW,CAAC,GAAG,CAAC,KAAK,KAAK,MAAO,KAAI,CAAC,KAAK,UAAU,CAAC,EAAG,KAAI,IAAI,GAAG,EAAE,KAAK;AAC3E,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,oBAAkD;AACjD,UAAM,MAA8B,CAAC;AACrC,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,OAAO;AACtC,UAAI,MAAM,cAAc,QAAW;AAClC,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AAAA,MACD;AACA,YAAM,YAAY,mBAAmB,GAAG;AACxC,UAAI,KAAK,IAAI,SAAS,GAAG;AACxB,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AAAA,MACD;AACA,WAAK,IAAI,SAAS;AAClB,UAAI,KAAK,CAAC,KAAK,MAAM,KAAK,CAAU;AAAA,IACrC;AACA,WAAO;AAAA,EACR;AACD;AAWO,SAAS,mCACf,gBACA,UAAoC,CAAC,GACjB;AACpB,SAAO,kBAAkB,SAAS,cAAc;AACjD;AAEA,SAAS,kBACR,UAAoC,CAAC,GACrC,iBAA+C,CAAC,GAC5B;AACpB,QAAM,EAAE,SAAS,YAAY,WAAW,WAAW,KAAK,MAAM,YAAY,MAAM,IAAI;AACpF,QAAM,UAAU,IAAI,WAAiB,EAAE,IAAI,CAAC;AAC5C,aAAW,CAAC,KAAK,KAAK,KAAK,eAAgB,SAAQ,IAAI,KAAK,KAAK;AACjE,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAC5C,QAAM,aACL,UAAU,UACV,SAAS,UACT,YAAY,UACZ,eAAe,UACf,cAAc;AAEf,WAAS,UAAa,GAA2C;AAChE,WAAO,aAAa;AAAA,EACrB;AAEA,WAAS,gBAAgB,GAAmB;AAC3C,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI,WAAW,wDAAwD,CAAC,GAAG;AAClF,WAAO;AAAA,EACR;AAEA,WAAS,YAAY,GAAmB;AACvC,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK;AAC/B,YAAM,IAAI,WAAW,iEAAiE,CAAC,GAAG;AAC3F,WAAO;AAAA,EACR;AAEA,WAAS,yBAAyB,GAAmB;AACpD,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI;AAAA,QACT,sEAAsE,CAAC;AAAA,MACxE;AACD,WAAO;AAAA,EACR;AAEA,MAAI,cAAc,UAAa,OAAO,UAAU,UAAU;AACzD,UAAM,IAAI,UAAU,iDAAiD;AAItE,WAAS,gBAAgB,OAAoB,OAA6B;AACzE,UAAM,KAA8B;AAAA,MACnC,SAAS,eAAe,KAAK;AAAA,MAC7B,MAAM,MAAM;AAAA,MAAC;AAAA,MACb,MAAM,EAAE,SAAS,MAAM;AAAA,IACxB;AACA,QAAI,OAAO;AACV,aAAO,MAAM,SAAS,IAAI,CAAC,GAAG;AAAA,QAC7B,MAAM,OAAO,GAAG,IAAI,IAAI,KAAK,KAAK;AAAA,QAClC,MAAM,EAAE,MAAM,qBAAqB,YAAY,eAAe,QAAQ,MAAM;AAAA,MAC7E,CAAC;AAAA,IACF;AACA,WAAO,IAAI,KAAa,CAAC,GAAG,MAAM;AAAA,MACjC,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS,eAAe,KAAK;AAAA,MAC7B,MAAM,OAAO,GAAG,IAAI,IAAI,KAAK,KAAK;AAAA,IACnC,CAAC;AAAA,EACF;AAEA,WAAS,WACR,OACA,KACA,UAC2B;AAC3B,QAAI,QAAQ,OAAW,QAAO;AAC9B,QAAI,UAAU,GAAG,GAAG;AACnB,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT,eAAe,KAAK,+EAA+E,UAAU,oBAAoB,QAAQ,KAAK;AAAA,QAC/I;AACD,aAAO;AAAA,IACR;AACA,WAAO,gBAAgB,OAAO,SAAS,GAAG,CAAC;AAAA,EAC5C;AAEA,QAAM,WAA6C;AAAA,IAClD,SAAS;AAAA,IACT,MAAM,MAAM;AAAA,IAAC;AAAA,EACd;AACA,QAAM,SAAS,QACZ,MAAM,SAAS,UAAU,CAAC,GAAG;AAAA,IAC7B,MAAM,OAAO,GAAG,IAAI,YAAY;AAAA,IAChC,MAAM,EAAE,MAAM,qBAAqB,YAAY,cAAc;AAAA,IAC7D,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,qBAAqB,EAAE,IAAI,CAAC;AAAA,EAChE,CAAC,IACA,IAAI,KAAsB,CAAC,GAAG,MAAM;AAAA,IACpC,GAAG;AAAA,IACH,SAAS;AAAA,IACT,MAAM,OAAO,GAAG,IAAI,YAAY;AAAA,EACjC,CAAC;AACH,QAAM,YAAY,WAAW,aAAa,SAAS,eAAe;AAClE,QAAM,YAAY,WAAW,aAAa,YAAY,WAAW;AACjE,QAAM,kBAAkB;AAAA,IACvB;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACD;AAEA,MAAI,iBAAiB,UAAU,OAAO,IAAI,SAAY;AACtD,MAAI,oBAAoB,UAAU,UAAU,IAAI,SAAY;AAC5D,MAAI,0BAA0B,UAAU,WAAW,OAAO,IACvD,SACA,WAAW,YAAY,SACtB,SACA,yBAAyB,UAAU,OAAO;AAC9C,QAAM,UAAU,UAAa;AAC7B,MAAI,WAAiC;AACrC,MAAI;AACJ,QAAM,WAAW,oBAAI,QAAuB;AAC5C,MAAI,UAAU;AACd,MAAI;AACJ,QAAM,aAAa,IAAI,cAGrB,SAAS;AACX,MAAI,YAAY;AAEhB,QAAM,eAAe,IAAI,aAAa,CAAC,MAAuB,CAAC;AAC/D,QAAM,YAAY,aAAa,IAAI,SAAS;AAC5C,QAAM,YAAY,aAAa,IAAI,SAAS;AAC5C,QAAM,kBAAkB,aAAa,IAAI,eAAe;AAExD,WAAS,YAAY,KAAU,SAA8B;AAC5D,eAAW,CAAC,KAAK,QAAQ,KAAK;AAC7B,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,UAAU,QAAQ,UAAU,CAAC,CAAC,CAAC;AAAA,EAC3E;AAEA,WAAS,eAAe,KAAU,SAA8B;AAC/D,eAAW,CAAC,KAAK,QAAQ,KAAK;AAC7B,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,UAAU,QAAQ,YAAY,CAAC,CAAC,CAAC;AAAA,EAC7E;AAEA,WAAS,aAAa,KAAU,SAA8B;AAC7D,eAAW,CAAC,KAAK,QAAQ,KAAK;AAC7B,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,UAAU,QAAQ,WAAW,CAAC,CAAC,CAAC;AAAA,EAC5E;AAEA,WAAS,kBAA+E;AACvF,eAAS;AACR,YAAM,MAAM,QAAQ,KAAK;AACzB,UAAI,QAAQ,OAAW,QAAO;AAC9B,UAAI,QAAQ,YAAY,IAAI,GAAG,MAAM,IAAI,UAAW,QAAO;AAC3D,cAAQ,IAAI;AAAA,IACb;AAAA,EACD;AAEA,WAAS,YAAY,KAAU,MAAoB;AAClD,eAAS;AACR,YAAM,OAAO,gBAAgB;AAC7B,UAAI,SAAS,QAAW;AACvB,YAAI,SAAU,KAAI,WAAW,eAAe,UAAU,IAAI;AAC1D,mBAAW;AACX,sBAAc;AACd;AAAA,MACD;AACA,UAAI,KAAK,aAAa,QAAQ,MAAM,GAAG;AACtC,oBAAY,KAAK,QAAQ,aAAa,CAAC;AACvC;AAAA,MACD;AACA,UAAI,gBAAgB,KAAK,UAAW;AACpC,UAAI,SAAU,KAAI,WAAW,eAAe,UAAU,IAAI;AAC1D,oBAAc,KAAK;AACnB,iBAAW,SAAS,MAAM,KAAK,IAAI,GAAG,KAAK,YAAY,QAAQ,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;AAClF,UAAI,WAAW,aAAa,UAAU,IAAI;AAC1C;AAAA,IACD;AAAA,EACD;AAEA,WAAS,YAAY,KAAU,aAAoC;AAClE,QAAI,YAAY,SAAS,OAAO;AAC/B,YAAM,MAAM,YAAY,OAAO;AAC/B,YAAM,YAAY,QAAQ,iBAAiB,GAAG;AAC9C,cAAQ,IAAI,YAAY,KAAK,YAAY,OAAO,SAAS;AACzD,UAAI,cAAc,OAAW,SAAQ,KAAK,EAAE,KAAK,YAAY,KAAK,UAAU,CAAC;AAC7E,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,OAAO,KAAK,YAAY,KAAK,OAAO,YAAY,MAAM,CAAC,CAAC,CAAC;AACpF,qBAAe,KAAK,QAAQ,WAAW,cAAc,CAAC;AACtD;AAAA,QACC;AAAA,QACA,QAAQ;AAAA,UACP,YAAY,EAAE,SAAS,yBAAyB,OAAO,UAAU,MAAM,IAAI;AAAA,QAC5E;AAAA,MACD;AACA;AAAA,IACD;AACA,QAAI,YAAY,SAAS,UAAU;AAClC,YAAM,WAAW,QAAQ,OAAO,YAAY,GAAG;AAC/C,UAAI,SAAS;AACZ,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA,EAAE,MAAM,UAAU,KAAK,YAAY,KAAK,UAAU,SAAS,OAAO,QAAQ,WAAW;AAAA,UACtF;AAAA,QACD,CAAC;AACF;AAAA,IACD;AACA,QAAI,YAAY,SAAS,SAAS;AACjC,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,MAAM,CAAC,CAAC,CAAC;AAC5D;AAAA,IACD;AACA,QAAI,YAAY,SAAS,gBAAgB;AACxC,kBAAY,KAAK,QAAQ,aAAa,CAAC;AACvC;AAAA,IACD;AACA,gBAAY,KAAK,QAAQ,kBAAkB,YAAY,GAAG,CAAC;AAAA,EAC5D;AAEA,QAAM,YAAoB,CAAC,QAAa;AACvC,UAAM,cAAc,UAAU,KAAK,KAAK,cAAc;AACtD,qBAAiB,gBAAgB,SAAY,SAAY,gBAAgB,WAAW;AACpF,UAAM,UAAU,UAAU,KAAK,KAAK,iBAAiB;AACrD,wBAAoB,YAAY,SAAY,SAAY,YAAY,OAAO;AAC3E,UAAM,uBAAuB,gBAAgB,KAAK,KAAK,uBAAuB;AAC9E,8BACC,yBAAyB,SACtB,SACA,yBAAyB,oBAAoB;AAEjD,eAAW,QAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAkC;AAC1E,kBAAY,KAAK,IAAI;AAAA,IACtB;AACA,UAAM,OAAO,MAAM;AACnB,aAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,UAAI,MAAM,UAAU,SAAS,MAAM,UAAU,SAAS,MAAM,gBAAgB,MAAO;AACnF,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,OAAO,SAAS,IAAI,GAAG,GAAG;AAC7B,mBAAW,QAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAkC;AAC1E,sBAAY,KAAK,IAAI;AAAA,QACtB;AACA;AAAA,MACD;AACA,UACC,QAAQ,cACN,SAAS,KAAK,CAAC,GAAG,UAAU,KAAK,KAAK,mBAAmB,YAAY,KAAK,CAAC,CAAC,IAC7E;AACD,YAAI,SAAU,KAAI,WAAW,eAAe,UAAU,SAAS;AAC/D,mBAAW;AACX,sBAAc;AACd,oBAAY,KAAK,QAAQ,aAAa,CAAC;AAAA,MACxC;AAAA,IACD;AAEA,mBAAe,KAAK,QAAQ,WAAW,cAAc,CAAC;AACtD;AAAA,MACC;AAAA,MACA,QAAQ;AAAA,QACP,YAAY,EAAE,SAAS,yBAAyB,OAAO,UAAU,MAAM,IAAI;AAAA,MAC5E;AAAA,IACD;AACA,gBAAY,KAAK,SAAS;AAAA,EAC3B;AAEA,QAAM,UAA8C;AAAA,IACnD,SAAS;AAAA,IACT,MAAM;AAAA,IACN,MAAM,EAAE,SAAS,KAAK;AAAA,EACvB;AACA,UAAQ,QACL,MAAM,SAAS,SAAS,aAAa,MAAkC;AAAA,IACvE,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,2BAA2B,YAAY,cAAc;AAAA,IACnE,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,oBAAoB,EAAE,IAAI,CAAC;AAAA,EAC/D,CAAC,IACA,SAAS,SAAS,aAAa,MAAM;AAAA,IACrC,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,EAChC,CAAC;AAEH,QAAM,SAAS,uBAAO,OAAO,GAAG,IAAI,cAAc,sBAAsB;AACxE,QAAM,iBAAwD;AAAA,IAC7D,SAAS;AAAA,IACT,MAAM,CAAC,QAAa;AACnB,YAAM,UAAU,QAAQ,aAAa,EAAE;AAAA,QACtC,CAAC,CAAC,KAAK,QAAQ,OAAwB;AAAA,UACtC,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,QACT;AAAA,MACD;AACA,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,UAAU,QAAQ,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC/D;AAAA,IACA,MAAM;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA,SAAS;AAAA,IACV;AAAA,EACD;AACA,QAAM,eAAe,QAClB,MAAM,SAAS,gBAAgB,CAAC,KAAsB,GAAG;AAAA,IACzD,MAAM,OAAO,GAAG,IAAI,kBAAkB;AAAA,IACtC,MAAM,EAAE,MAAM,4BAA4B,YAAY,cAAc;AAAA,IACpE,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,2BAA2B,EAAE,IAAI,CAAC;AAAA,EACtE,CAAC,IACA,SAAS,gBAAgB,CAAC,KAAsB,GAAG;AAAA,IACnD,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,kBAAkB;AAAA,EACvC,CAAC;AACH,QAAM,UAA8C;AAAA,IACnD,SAAS;AAAA,IACT,MAAM,CAAC,QAAa;AACnB,iBAAW,UAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC5C,YAAI,KAAK,CAAC,CAAC,QAAQ,MAAyB,CAAC,CAAC;AAAA,MAC/C;AACA,iBAAW,QAAQ,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC1C,mBAAW,UAAW,KAA4B,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,MACvF;AAAA,IACD;AAAA,IACA,MAAM,EAAE,SAAS,KAAK;AAAA,EACvB;AACA,QAAM,QAAQ,QACX,MAAM,SAAS,SAAS,CAAC,OAAwB,YAA6B,GAAG;AAAA,IACjF,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,oBAAoB,YAAY,cAAc;AAAA,IAC5D,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,oBAAoB,EAAE,IAAI,CAAC;AAAA,EAC/D,CAAC,IACA,SAAS,SAAS,CAAC,OAAwB,YAA6B,GAAG;AAAA,IAC3E,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,EAChC,CAAC;AACH,QAAM,aAAmD;AAAA,IACxD,SAAS;AAAA,IACT,MAAM,CAAC,QAAa;AACnB,iBAAW,QAAQ,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC1C,YAAI,KAAK,CAAC,CAAC,QAAS,KAA4B,QAAQ,CAAC,CAAC;AAAA,MAC3D;AAAA,IACD;AAAA,IACA,MAAM,EAAE,SAAS,KAAK;AAAA,EACvB;AACA,QAAM,WAAW,QACd,MAAM,SAAS,YAAY,CAAC,YAA6B,GAAG;AAAA,IAC5D,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,MAAM,EAAE,MAAM,uBAAuB,YAAY,cAAc;AAAA,IAC/D,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,uBAAuB,EAAE,IAAI,CAAC;AAAA,EAClE,CAAC,IACA,SAAS,YAAY,CAAC,YAA6B,GAAG;AAAA,IACtD,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,EACnC,CAAC;AACH,MAAI,YAAY;AACf,oCAAgC,QAAyB,MAAM,QAAQ,kBAAkB,CAAC;AAAA,EAC3F;AACA,QAAM,eAAe,QAClB,MAAM,OAAO,OAAO,EAAE,QAAQ,oBAAoB,CAAC,IACnD,MAAM,UAAU,MAAM;AAAA,EAAC,CAAC;AAC3B,QAAM,QAA2B,CAAC;AAElC,WAAS,MAAM,KAAQ,OAAU,KAAoB;AACpD,QAAI,QAAQ,OAAW,aAAY,GAAG;AACtC,WAAO,KAAK;AAAA,MACX,CAAC,QAAQ,QAAQ,SAAY,EAAE,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE,MAAM,OAAO,KAAK,OAAO,IAAI,CAAC;AAAA,IAC5F,CAAC;AAAA,EACF;AAEA,WAAS,KAAK,KAAmB;AAChC,UAAM,IAAI,QAAQ,OAAO,GAAG;AAC5B,QAAI,CAAC,EAAE,SAAS,EAAE,QAAS,QAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,IAAI,CAAC,CAAC,CAAC;AAC5E,WAAO;AAAA,EACR;AAEA,WAAS,iBAAiB,WAA6D;AACtF,UAAM,MAAM,oBAAI,IAAU;AAC1B,eAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,SAAS,GAAG;AAC9C,UAAI,UAAU,OAAO,GAAG,EAAG,KAAI,IAAI,KAAK,KAAK;AAAA,IAC9C;AACA,WAAO;AAAA,EACR;AAEA,WAAS,OACR,WACmD;AACnD,QAAI,OAAO,cAAc;AACxB,YAAM,IAAI,UAAU,kDAAkD;AACvE,UAAM,SAAS,WAAW,IAAI,SAAS;AACvC,QAAI,WAAW,OAAW,QAAO;AACjC,QAAI;AACJ,WAAO,kBAAsD,OAAwB;AAAA,MACpF;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,MAAM,OAAO,GAAG,IAAI,WAAW,WAAW,KAAK;AAAA,MAC/C,qBAAqB,MAAM,iBAAiB,SAAS;AAAA,MACrD,WAAW,MAAM;AAChB,mBAAW,YAAY,IAAI;AAAA,MAC5B;AAAA,IACD,CAAC;AACD,eAAW,IAAI,WAAW,IAAI;AAC9B,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IAEA,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,IAAI,KAAuB;AAC1B,YAAM,IAAI,KAAK,GAAG;AAClB,aAAO,EAAE,QAAQ,EAAE,QAAQ;AAAA,IAC5B;AAAA,IACA,IAAI,KAAiB;AACpB,aAAO,KAAK,GAAG,EAAE;AAAA,IAClB;AAAA,IACA,QAA2B;AAC1B,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,eAAe,CAAC,CAAC,CAAC;AAChD,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IACA;AAAA,IAEA,IAAI,KAAQ,OAAU,MAA+B;AACpD,YAAM,KAAK,OAAO,MAAM,GAAG;AAAA,IAC5B;AAAA,IACA,QAAQ,SAAoC,MAA+B;AAC1E,iBAAW,CAAC,GAAG,CAAC,KAAK,QAAS,OAAM,GAAG,GAAG,MAAM,GAAG;AAAA,IACpD;AAAA,IACA,OAAO,KAAc;AACpB,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,IAAI,CAAC,CAAC,CAAC;AAAA,IAChD;AAAA,IACA,WAAW,MAAyB;AACnC,iBAAW,KAAK,MAAM;AACrB,eAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,EAAE,CAAC,CAAC,CAAC;AAAA,MACnD;AAAA,IACD;AAAA,IACA,QAAc;AACb,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC1C;AAAA,IACA,eAAqB;AACpB,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,eAAe,CAAC,CAAC,CAAC;AAAA,IACjD;AAAA,IAEA,QAAQ,KAAwC;AAC/C,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,YAAM,KAAiD;AAAA,QACtD,SAAS;AAAA,QACT,MAAM,CAAC,QAAa;AACnB,cAAI;AACH,uBAAW,CAAC,GAAG,CAAC,KAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoC;AAC9E,kBAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,OAAO,KAAK,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;AAAA,YACvD;AAAA,UACD,SAAS,GAAG;AACX,gBAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,+BAA+B,CAAC,CAAC,CAAC;AAAA,UACvE;AAAA,QACD;AAAA,MACD;AACA,YAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,QACxC,MAAM,OAAO,GAAG,IAAI,SAAS,SAAS,KAAK;AAAA,QAC3C,MAAM,EAAE,MAAM,0BAA0B,YAAY,cAAc;AAAA,MACnE,CAAC;AACD,eAAS,IAAI,MAAuB;AACpC,YAAM,aAAa,QAAyB,SAAS;AACrD,UAAIC,UAAS;AACb,YAAM,UAAU,MAAM;AACrB,YAAI,CAACA,QAAQ;AACb,QAAAA,UAAS;AACT,cAAM,eAAe,QAAyB,SAAS;AAAA,MACxD;AACA,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,WAAW;AACtB,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,mBAAa;AAAA,IACd;AAAA,EACD;AACD;;;ACjxBA,SAAS,mBACR,OACuC;AACvC,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,kBAAqB,OAAiE;AAC9F,MAAI,CAAC,mBAAmB,KAAK,EAAG,QAAO;AACvC,MAAI,MAAM,SAAS,eAAgB,OAAM,IAAI,UAAU,yCAAyC;AAChG,SAAO,MAAM;AACd;AAEA,SAAS,kBACR,OACsC;AACtC,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,iBAAoB,OAAgE;AAC5F,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,MAAI,MAAM,SAAS,cAAe,OAAM,IAAI,UAAU,wCAAwC;AAC9F,SAAO,MAAM;AACd;AAEA,SAAS,kBACR,OACyC;AACzC,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,kBACR,OAC+B;AAC/B,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,MAAI,MAAM,SAAS,cAAe,OAAM,IAAI,UAAU,wCAAwC;AAC9F,SAAO,MAAM;AACd;AAEA,SAAS,oBACR,OAC2C;AAC3C,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,iBACR,OAC4B;AAC5B,MAAI,CAAC,oBAAoB,KAAK,EAAG,QAAO;AACxC,MAAI,MAAM,SAAS,iBAAiB;AACnC,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAC/D;AACA,SAAO,MAAM;AACd;AAGO,SAAS,oBACf,OACA,UAA+B,CAAC,GACd;AAClB,QAAM,SAAS,kBAAkB,KAAK;AACtC,SAAO,aAAgB,QAAQ,OAAO;AACvC;AAGO,SAAS,mBACf,OACA,UAA8B,CAAC,GACd;AACjB,QAAM,SAAS,iBAAiB,KAAK;AACrC,SAAO,YAAe,QAAQ,OAAO;AACtC;AAGO,SAAS,mBACf,OACA,UAAoC,CAAC,GACjB;AACpB,QAAM,UAAU,kBAAkB,KAAK;AACvC,SAAO,mCAAyC,SAAS,OAAO;AACjE;AAGO,SAAS,qBACf,OACA,UAAgC,CAAC,GACX;AACtB,QAAM,OAAO,iBAAiB,KAAK;AACnC,SAAO,qCAA2C,MAAM,OAAO;AAChE;;;AC9FO,IAAM,sCACZ;AAEM,IAAM,oCACZ;AAEM,IAAM,oCAAoC;AA6EjD,SAASC,UAAS,OAAkD;AACnE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEA,SAASC,SAAQ,OAAmD;AACnE,SAAO,OAAO,KAAK,KAAK,EAAE,KAAK;AAChC;AAEA,SAASC,YACR,OACA,UACA,OACO;AACP,QAAM,SAASD,SAAQ,KAAK;AAC5B,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EAC5E;AACD;AAEA,SAAS,kBAAkB,OAAgB,OAAe,MAAM,GAAW;AAC1E,MAAI,CAAC,OAAO,cAAc,KAAK,KAAM,QAAmB,KAAK;AAC5D,UAAM,IAAI,UAAU,GAAG,KAAK,8BAA8B,GAAG,EAAE;AAAA,EAChE;AACA,SAAO;AACR;AAEA,SAAS,WACR,OACA,UACA,OACI;AACJ,MAAI,UAAU,SAAU,OAAM,IAAI,UAAU,GAAG,KAAK,kBAAkB,QAAQ,EAAE;AAChF,SAAO;AACR;AAEA,SAAS,YAAyB,OAAgB,OAA6B;AAC9E,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;AACpF,SAAO;AACR;AAEA,SAASE,oBAAmB,OAAwB;AACnD,SAAO,MAAM,KAAK,yBAAyB,KAAK,CAAC,EAAE,KAAK,GAAG;AAC5D;AAEA,SAAS,iBACR,OACA,OAC+B;AAC/B,QAAM,UAAU,YAAqB,OAAO,KAAK;AACjD,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,CAAC,GAAG,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC3C,QAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AAChD,YAAM,IAAI,UAAU,GAAG,KAAK,WAAW,CAAC,sBAAsB;AAAA,IAC/D;AACA,UAAM,MAAMA,oBAAmB,MAAM,CAAC,CAAC;AACvC,QAAI,KAAK,IAAI,GAAG,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,WAAW,CAAC,4BAA4B;AACvF,SAAK,IAAI,GAAG;AAAA,EACb;AACA,SAAO;AACR;AAEA,SAAS,gBACR,OACA,OAC4B;AAC5B,QAAM,OAAO,YAAqB,OAAO,KAAK;AAC9C,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACtC,QAAI,CAACH,UAAS,GAAG,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,SAAS,CAAC,oBAAoB;AAC9E,IAAAE,YAAW,KAAK,CAAC,WAAW,aAAa,OAAO,GAAG,GAAG,KAAK,MAAM;AACjE,UAAM,UAAUC,oBAAmB,IAAI,OAAO;AAC9C,QAAI,KAAK,IAAI,OAAO,GAAG;AACtB,YAAM,IAAI,UAAU,GAAG,KAAK,SAAS,CAAC,gCAAgC;AAAA,IACvE;AACA,SAAK,IAAI,OAAO;AAAA,EACjB;AACA,SAAO;AACR;AAGO,SAAS,sBAAsB,gBAAgB,uBAA+B;AACpF,MAAI,cAAc,WAAW,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACrF,SAAO,GAAG,aAAa;AACxB;AAGO,SAAS,gCACf,MACA,UACA,OAA2C,CAAC,GACJ;AACxC,QAAM,eAAe,KAAK,gBAAgB;AAC1C,MAAI,CAAC,OAAO,cAAc,YAAY,KAAK,eAAe,IAAI;AAC7D,UAAM,IAAI,WAAW,wEAAwE;AAAA,EAC9F;AACA,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,8BACf,MACA,QACsC;AACtC,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,sCAGd,OAAgB,cAAwD;AACzE,MAAI,CAACH,UAAS,KAAK,EAAG,OAAM,IAAI,UAAU,sDAAsD;AAChG,EAAAE,YAAW,OAAO,CAAC,gBAAgB,UAAU,QAAQ,YAAY,SAAS,GAAG,gBAAgB;AAC7F,MAAI,MAAM,WAAW,qCAAqC;AACzD,UAAM,IAAI,UAAU,gCAAgC;AAAA,EACrD;AACA,MAAI,MAAM,YAAY,mCAAmC;AACxD,UAAM,IAAI,UAAU,iCAAiC;AAAA,EACtD;AACA,aAAW,MAAM,MAAM,cAAc,gBAAgB;AACrD,oBAAkB,MAAM,cAAc,+BAA+B,EAAE;AACvE,qBAA4B,EAAE,OAAO,KAAK;AAC1C,SAAO;AACR;AAGO,SAAS,oCAGd,OAAgB,cAAsD;AACvE,MAAI,CAACF,UAAS,KAAK,EAAG,OAAM,IAAI,UAAU,oDAAoD;AAC9F,EAAAE,YAAW,OAAO,CAAC,UAAU,UAAU,QAAQ,SAAS,GAAG,cAAc;AACzE,MAAI,MAAM,WAAW,mCAAmC;AACvD,UAAM,IAAI,UAAU,8BAA8B;AAAA,EACnD;AACA,MAAI,MAAM,YAAY,mCAAmC;AACxD,UAAM,IAAI,UAAU,+BAA+B;AAAA,EACpD;AACA,aAAW,MAAM,MAAM,cAAc,cAAc;AACnD,MAAI,CAAC,OAAO,OAAO,OAAO,QAAQ,EAAG,OAAM,IAAI,UAAU,kCAAkC;AAC3F,qBAA4B,EAAE,OAAO,KAAK;AAC1C,SAAO;AACR;AAkCA,SAAS,iBAAoB,OAA+B;AAC3D,MAAI,CAACE,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACtE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,oCAAoC;AAC5F,MAAAC,YAAW,OAAO,CAAC,QAAQ,OAAO,GAAG,qBAAqB;AAC1D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,QAAQ,GAAG,yBAAyB;AAC/D,kBAAe,MAAM,QAAQ,gCAAgC;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,QAAQ,OAAO,GAAG,qBAAqB;AACnE,wBAAkB,MAAM,OAAO,6BAA6B,CAAC;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,QAAQ,QAAQ,GAAG,yBAAyB;AACxE,wBAAkB,MAAM,OAAO,iCAAiC,CAAC;AACjE,kBAAe,MAAM,QAAQ,gCAAgC;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,QAAQ,OAAO,GAAG,kBAAkB;AAChE,wBAAkB,MAAM,OAAO,0BAA0B,CAAC;AAC1D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,GAAG,GAAG,uBAAuB;AACxD,wBAAkB,MAAM,GAAG,2BAA2B,CAAC;AACvD,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,oBAAoB;AACzD,wBAAkB,MAAM,OAAO,4BAA4B,CAAC;AAC5D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,wCAAwC,MAAM,IAAI,EAAE;AAAA,EAC1E;AACD;AAEA,SAAS,gBAAmB,OAA8B;AACzD,MAAI,CAACD,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,mCAAmC;AAC3F,MAAAC,YAAW,OAAO,CAAC,QAAQ,OAAO,GAAG,oBAAoB;AACzD,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,QAAQ,GAAG,wBAAwB;AAC9D,kBAAe,MAAM,QAAQ,+BAA+B;AAC5D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,GAAG,GAAG,sBAAsB;AACvD,wBAAkB,MAAM,GAAG,0BAA0B,CAAC;AACtD,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,mBAAmB;AACxD,wBAAkB,MAAM,OAAO,2BAA2B,CAAC;AAC3D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,uCAAuC,MAAM,IAAI,EAAE;AAAA,EACzE;AACD;AAEA,SAAS,gBAAsB,OAAiC;AAC/D,MAAI,CAACD,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,KAAK,EAAG,OAAM,IAAI,UAAU,8BAA8B;AACpF,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,gCAAgC;AACxF,MAAAC,YAAW,OAAO,CAAC,OAAO,QAAQ,OAAO,GAAG,iBAAiB;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,KAAK,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACvF,UAAI,CAAC,OAAO,OAAO,OAAO,UAAU,GAAG;AACtC,cAAM,IAAI,UAAU,sCAAsC;AAAA,MAC3D;AACA,MAAAA,YAAW,OAAO,CAAC,OAAO,QAAQ,YAAY,QAAQ,GAAG,oBAAoB;AAC7E,UACC,MAAM,WAAW,aACjB,MAAM,WAAW,eACjB,MAAM,WAAW,cACjB,MAAM,WAAW,YAChB;AACD,cAAM,IAAI,UAAU,sCAAsC;AAAA,MAC3D;AACA,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,mBAAmB;AACxD,wBAAkB,MAAM,OAAO,2BAA2B,CAAC;AAC3D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,uCAAuC,MAAM,IAAI,EAAE;AAAA,EACzE;AACD;AAEA,SAAS,kBAAwB,OAAmC;AACnE,MAAI,CAACD,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,kDAAkD;AAAA,EACvE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,SAAS,GAAG;AACrC,cAAM,IAAI,UAAU,uCAAuC;AAAA,MAC5D;AACA,UAAI,CAAC,OAAO,OAAO,OAAO,WAAW,GAAG;AACvC,cAAM,IAAI,UAAU,yCAAyC;AAAA,MAC9D;AACA,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO;AAChC,cAAM,IAAI,UAAU,qCAAqC;AAC1D,MAAAC,YAAW,OAAO,CAAC,QAAQ,WAAW,aAAa,OAAO,GAAG,sBAAsB;AACnF,aAAO;AAAA,IACR,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,SAAS,GAAG;AACrC,cAAM,IAAI,UAAU,uCAAuC;AAAA,MAC5D;AACA,MAAAA,YAAW,OAAO,CAAC,QAAQ,SAAS,GAAG,sBAAsB;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,WAAW,GAAG,0BAA0B;AACnE,kBAAe,MAAM,WAAW,oCAAoC;AACpE,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,qBAAqB;AAC1D,wBAAkB,MAAM,OAAO,6BAA6B,CAAC;AAC7D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,yCAAyC,MAAM,IAAI,EAAE;AAAA,EAC3E;AACD;AAEA,SAAS,gBAAmB,OAAY,QAA6B;AACpE,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK;AACJ,YAAM,KAAK,OAAO,KAAK;AACvB;AAAA,IACD,KAAK;AACJ,YAAM,KAAK,GAAG,OAAO,MAAM;AAC3B;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,QAAQ,MAAM;AACxB,cAAM,IAAI,MAAM,4CAA4C;AAC7D,YAAM,OAAO,OAAO,OAAO,GAAG,OAAO,KAAK;AAC1C;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,QAAQ,MAAM,QAAQ;AAChC,cAAM,IAAI,MAAM,gDAAgD;AAAA,MACjE;AACA,YAAM,OAAO,OAAO,OAAO,GAAG,GAAG,OAAO,MAAM;AAC9C;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,SAAS,MAAM,OAAQ,OAAM,IAAI,MAAM,yCAAyC;AAC3F,UAAI,CAAC,iBAAiB,MAAM,OAAO,KAAK,GAAG,OAAO,KAAK,GAAG;AACzD,cAAM,IAAI,MAAM,4DAA4D;AAAA,MAC7E;AACA,YAAM,OAAO,OAAO,OAAO,CAAC;AAC5B;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,IAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,8CAA8C;AAC3F,YAAM,OAAO,GAAG,OAAO,CAAC;AACxB;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,8DAA8D;AAAA,MAC/E;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,iBAAiB,GAAY,GAAqB;AAC1D,QAAM,OAAO,yBAAyB,CAAC;AACvC,QAAM,QAAQ,yBAAyB,CAAC;AACxC,MAAI,KAAK,eAAe,MAAM,WAAY,QAAO;AACjD,WAAS,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK,EAAG,KAAI,KAAK,CAAC,MAAM,MAAM,CAAC,EAAG,QAAO;AAC9E,SAAO;AACR;AAEA,SAAS,cACR,QACA,OACA,KACA,OACS;AACT,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC1C,QAAI,iBAAiB,MAAM,OAAO,CAAC,CAAM,GAAG,GAAG,GAAG;AACjD,UAAI,UAAU,GAAI,OAAM,IAAI,MAAM,GAAG,KAAK,sCAAsC;AAChF,cAAQ;AAAA,IACT;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAASC,QAAO,GAAY,GAAoB;AAC/C,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,KAAK,OAAO;AAClB,MACC,OAAO,OAAO,MACb,OAAO,YAAY,OAAO,YAAY,OAAO,aAAa,OAAO,WACjE;AACD,UAAM,KAAK;AACX,UAAM,KAAK;AACX,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAAA,EACrC;AACA,SAAO,OAAO,CAAC,EAAE,cAAc,OAAO,CAAC,CAAC;AACzC;AAEA,SAAS,eAAkB,OAAY,QAA4B;AAClE,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK;AACJ,YAAM,KAAK,OAAO,KAAK;AACvB;AAAA,IACD,KAAK;AACJ,YAAM,KAAK,GAAG,OAAO,MAAM;AAC3B;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,IAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,6CAA6C;AAC1F,YAAM,OAAO,GAAG,OAAO,CAAC;AACxB;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,6DAA6D;AAAA,MAC9E;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,eAAqB,OAA+B,QAA+B;AAC3F,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK,OAAO;AACX,YAAM,QAAQ,cAAc,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,OAAO,KAAK,aAAa;AAC5E,UAAI,UAAU,GAAI,OAAM,KAAK,CAAC,OAAO,KAAK,OAAO,KAAK,CAAU;AAAA,UAC3D,OAAM,KAAK,IAAI,CAAC,OAAO,KAAK,OAAO,KAAK;AAC7C;AAAA,IACD;AAAA,IACA,KAAK,UAAU;AACd,YAAM,QAAQ,cAAc,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,OAAO,KAAK,aAAa;AAC5E,UAAI,UAAU,GAAI,OAAM,IAAI,MAAM,0CAA0C;AAC5E,UAAI,CAAC,iBAAiB,MAAM,KAAK,IAAI,CAAC,GAAG,OAAO,QAAQ,GAAG;AAC1D,cAAM,IAAI,MAAM,uEAAuE;AAAA,MACxF;AACA,YAAM,OAAO,OAAO,CAAC;AACrB;AAAA,IACD;AAAA,IACA,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,6DAA6D;AAAA,MAC9E;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,cAAoB,OAAoC;AAChE,QAAM,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,cAAcA,QAAO,EAAE,WAAW,EAAE,SAAS;AACnD,WAAO,gBAAgB,IAAIA,QAAO,EAAE,SAAS,EAAE,OAAO,IAAI;AAAA,EAC3D,CAAC;AACF;AAEA,SAAS,iBAAuB,OAA8B,QAAiC;AAC9F,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK,UAAU;AACd,YAAM,QAAQ,cAAc,OAAO,CAACC,SAAQA,KAAI,SAAS,OAAO,SAAS,eAAe;AACxF,YAAM,MAAsB;AAAA,QAC3B,SAAS,OAAO;AAAA,QAChB,WAAW,OAAO;AAAA,QAClB,OAAO,OAAO;AAAA,MACf;AACA,UAAI,UAAU,GAAI,OAAM,KAAK,GAAG;AAAA,UAC3B,OAAM,KAAK,IAAI;AACpB,oBAAc,KAAK;AACnB;AAAA,IACD;AAAA,IACA,KAAK,UAAU;AACd,YAAM,QAAQ,cAAc,OAAO,CAAC,QAAQ,IAAI,SAAS,OAAO,SAAS,eAAe;AACxF,UAAI,UAAU,GAAI,OAAM,IAAI,MAAM,gDAAgD;AAClF,YAAM,OAAO,OAAO,CAAC;AACrB;AAAA,IACD;AAAA,IACA,KAAK,cAAc;AAClB,iBAAW,WAAW,OAAO,WAAW;AACvC,cAAM,QAAQ,cAAc,OAAO,CAAC,QAAQ,IAAI,SAAS,SAAS,eAAe;AACjF,YAAI,UAAU,IAAI;AACjB,gBAAM,IAAI,MAAM,oDAAoD;AAAA,QACrE;AACA,cAAM,OAAO,OAAO,CAAC;AAAA,MACtB;AACA;AAAA,IACD;AAAA,IACA,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,+DAA+D;AAAA,MAChF;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,YACR,MACA,OACA,eACA,gBACA,SACA,QACkD;AAClD,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,QAAQ,gBACL,UAAU,IACT,qBACA,aACD,UAAU,IACT,YACA;AAAA,IACJ,UAAU,EAAE,OAAO,eAAe,cAAc,eAAe;AAAA,IAC/D,SAAS,EAAE,SAAS,OAAO;AAAA,EAC5B;AACD;AAEA,SAAS,UACR,MACA,MACA,gBACA,cACA,aAC2D;AAC3D,QAAM,MAAM,KAAK,eAAe,sBAAsB,KAAK,aAAa;AACxE,SAAO,KAAK,cAAc,IAAI,GAAG,EAAE,KAAK,CAAC,kBAAkB;AAC1D,QAAI,gBAAgB;AACpB,QAAI,iBAAiB;AACrB,QAAI,QAAa,CAAC;AAElB,QAAI,kBAAkB,QAAW;AAChC,YAAM,QAAQ,sCAAuD,eAAe,IAAI;AACxF,cAAQ,CAAC,GAAG,eAAe,MAAM,QAAQ,CAAC;AAC1C,sBAAgB;AAChB,uBAAiB,MAAM;AAAA,IACxB;AAEA,QAAI,KAAK,cAAc,QAAW;AACjC,aAAO,YAAY,MAAM,OAAO,eAAe,gBAAgB,GAAG,cAAc;AAAA,IACjF;AAEA,WAAO,KAAK,UAAU,KAAK,EAAE,OAAO,eAAe,CAAC,EAAE,KAAK,CAAC,YAAY;AACvE,UAAI,UAAU;AACd,UAAI,SAAS;AACb,iBAAW,SAAS,SAAS;AAC5B,cAAM,cAAc,SAAS;AAC7B,YAAI,CAAC,OAAO,cAAc,MAAM,GAAG,KAAK,MAAM,QAAQ,aAAa;AAClE,gBAAM,IAAI;AAAA,YACT,kEAAkE,WAAW,SAAS,MAAM,GAAG;AAAA,UAChG;AAAA,QACD;AACA,cAAM,QAAQ,oCAA0C,MAAM,OAAO,IAAI;AACzE,cAAM,SAAS,aAAa,MAAM,MAAM;AACxC,oBAAY,OAAO,MAAM;AACzB,mBAAW;AACX,iBAAS,MAAM;AAAA,MAChB;AACA,aAAO,YAAY,MAAM,OAAO,eAAe,gBAAgB,SAAS,MAAM;AAAA,IAC/E,CAAC;AAAA,EACF,CAAC;AACF;AAGO,SAAS,sBACf,MACuC;AACvC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,YAAe,OAAO,uBAAuB;AAAA,IACxD;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,qBACf,MACsC;AACtC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,YAAe,OAAO,sBAAsB;AAAA,IACvD;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,qBACf,MACyC;AACzC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,iBAAuB,OAAO,sBAAsB;AAAA,IAC/D;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,uBACf,MAC2C;AAC3C,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,gBAAsB,OAAO,wBAAwB;AAAA,IAChE;AAAA,IACA;AAAA,EACD;AACD;;;ACvkBA,SAAS,YAAY,YAAkE;AACtF,SAAO;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,cAAc;AAAA,EACf;AACD;AAEA,SAASC,cAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;AAEA,SAASC,8BAA6B,OAA+C;AACpF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC9C,UAAM,IAAI,WAAW,sDAAsD;AAAA,EAC5E;AACA,SAAO;AACR;AAEA,SAAS,4BAA4B,OAAmC;AACvE,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,IAAI;AAC/C,UAAM,IAAI,WAAW,kDAAkD;AAAA,EACxE;AACA,SAAO;AACR;AAEA,SAASC,UACR,OACA,SACA,QACA,QACA,QACsC;AACtC,SAAO,EAAE,OAAO,SAAS,QAAQ,QAAQ,OAAO;AACjD;AAEA,SAASC,QAAU,KAA6B;AAC/C,SAAO,IAAI,CAAC,MAAM,SAAU,IAAI,CAAC,IAAU;AAC5C;AAMO,SAAS,0BACf,OACA,YACA,MACsC;AACtC,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,KAAK,QAAQ,GAAG,IAAI;AACjC,QAAM,cAAc,KAAK,eAAe,sBAAsB,KAAK,iBAAiB,IAAI;AACxF,QAAM,uBAAuBF,8BAA6B,KAAK,oBAAoB;AACnF,uBAAqB,OAAO,WAAW,OAAwB,GAAG,IAAI,mBAAmB;AACzF,uBAAqB,OAAO,WAAW,UAA2B,GAAG,IAAI,sBAAsB;AAE/F,MAAI,cAAc;AAAA,IACjB,GAAG,YAAY,IAAI;AAAA,IACnB,WAAW,4BAA4B,KAAK,mBAAmB;AAAA,EAChE;AACA,MAAI,cAAcC,UAAS,YAAY,GAAG,GAAG,GAAG,WAAW;AAC3D,MAAI,aAAa;AACjB,MAAI,SAAS;AACb,MAAI,+BAA+B;AACnC,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,MAAI;AACJ,QAAM,QAAqB,CAAC;AAE5B,QAAM,QAAQ,MAAM,MAAM,OAAO,EAAE,MAAM,GAAG,IAAI,SAAS,CAAC;AAC1D,QAAM,SAAS,MAAM,MAA2C,aAAa;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,QAAQ,MAAM,MAAiD,MAAM;AAAA,IAC1E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,SAAS,MAAM,MAA2C,aAAa;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AAED,WAAS,QAAQ,OAA2D;AAC3E,UAAM,YAAY,YAAY,UAAU,aAAa,UAAU,aAAa,YAAY;AACxF,kBAAcA;AAAA,MACb;AAAA,MACA,MAAM,UAAU,UAAU,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,WAAO,IAAI,WAAW;AACtB,WAAO,IAAI,WAAW;AACtB,QAAI,cAAc,QAAS,OAAM,IAAI,IAAI;AACzC,QAAI,cAAc,aAAa,cAAc,WAAY,OAAM,IAAI,KAAK;AAAA,EACzE;AAEA,WAAS,OAAO,OAA8B,QAAuB;AACpE,kBAAc;AACd,UAAM,OAAO,EAAE,OAAO,SAASF,cAAa,MAAM,GAAG,QAAQ,YAAY;AACzE,UAAM,IAAI,IAAI;AAAA,EACf;AAEA,WAAS,SAAS,MAA+B;AAChD,QAAI;AACH,aAAO,WAAW;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,WAAS,OAAO,MAAuB;AACtC,QAAI,KAAK,UAAU,WAAW;AAC7B,iBAAW;AACX,gBAAU;AACV,cAAQ,UAAU;AAAA,IACnB,WAAW,YAAY,UAAU,WAAW;AAC3C,gBAAU;AACV,cAAQ,OAAO;AAAA,IAChB,OAAO;AACN,gBAAU;AACV,cAAQ,SAAS;AAAA,IAClB;AACA,aAAS,KAAK,IAAI;AAClB,IAAAI,OAAM;AAAA,EACP;AAEA,WAAS,KAAK,MAAiB,QAAuB;AACrD,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,QAAO,KAAK,OAAO,MAAM;AACnF,cAAU;AACV,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,SAAQ,SAAS;AAC3E,aAAS,KAAK,IAAI;AAClB,IAAAA,OAAM;AAAA,EACP;AAEA,WAAS,cAAc,MAAiB,OAAyB;AAChE,QAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,QAAI;AACJ,QAAI;AACH,aAAQ,MAA6B;AAAA,IACtC,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB,aAAO;AAAA,IACR;AACA,QAAI,OAAO,SAAS,WAAY,QAAO;AACvC,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,SAAqB;AACpC,UAAI,QAAS;AACb,gBAAU;AACV,WAAK;AAAA,IACN;AACA,QAAI;AACH,MAAC,KAAoF;AAAA,QACpF;AAAA,QACA,MAAM,OAAO,MAAM,OAAO,IAAI,CAAC;AAAA,QAC/B,CAAC,WAAW,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5C;AAAA,IACD,SAAS,QAAQ;AAChB,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACR;AAEA,WAAS,QAAQ,MAAuB;AACvC,QAAI,YAAa,oBAAoB,KAAK,UAAU,aAAa,KAAK,UAAU,SAAU;AACzF,eAAS,KAAK,IAAI;AAClB;AAAA,IACD;AACA,UAAM,KAAK,IAAI;AACf,IAAAA,OAAM;AAAA,EACP;AAEA,WAASA,SAAc;AACtB,QAAI,QAAS;AACb,UAAM,OAAO,MAAM,MAAM;AACzB,QAAI,SAAS,OAAW;AACxB,cAAU;AACV;AAAA,MACC,KAAK,UAAU,UAAU,aAAa,YAAY,UAAU,aAAa,aAAa;AAAA,IACvF;AACA,QAAI;AACJ,QAAI;AACH,eAAS,KAAK,IAAI;AAAA,IACnB,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB;AAAA,IACD;AACA,QAAI,cAAc,MAAM,MAAM,EAAG;AACjC,WAAO,IAAI;AAAA,EACZ;AAEA,WAAS,gBAAgB,MAAoE;AAC5F,UAAM,WAAW,mBAAmB,YAAY,IAAI;AACpD,mCAA+B;AAC/B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AACL,cAAM,QACL,gCAAgC,MAAM,UAAU;AAAA,UAC/C,cAAc,YAAY;AAAA,QAC3B,CAAC;AACF,8CAAsC,OAAO,IAAI;AACjD,eAAO,KAAK,cAAc,IAAI,aAAa,KAAK,EAAE,KAAK,MAAM;AAC5D,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,gBAAgB,YAAY,iBAAiB;AAAA,UAC9C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,cAAc,QAAuC;AAC7D,UAAM,YAAY,KAAK;AACvB,QAAI,cAAc,OAAW;AAC7B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AACL,cAAM,QAGF,8BAA8B,MAAM,MAAM;AAC9C,4CAAoC,OAAO,IAAI;AAC/C,eAAO,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,YAAY;AAChD,gBAAM,QAAQ;AAGd,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,WAAW,MAAM;AAAA,YACjB,cAAc,YAAY,eAAe;AAAA,UAC1C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,yBAA+B;AACvC,UAAM,UAAU,MAAM,OAAO,CAAC;AAC9B,eAAW,QAAQ,QAAS,UAAS,KAAK,IAAI;AAAA,EAC/C;AAEA,SAAQ,WAAW,MAAwC;AAAA,IAC1D,CAAC,KAAc,aAA4B;AAC1C,UAAI,iBAAkB;AACtB,YAAM,SAASD,QAAgC,GAAG;AAClD,UAAI,WAAW,OAAW;AAC1B,UAAI,eAAe,aAAa,OAAW;AAC3C,sCAAgC;AAChC,oBAAc,MAAM;AACpB,UACC,yBAAyB,UACzB,gCAAgC,sBAC/B;AACD,wBAAgB;AAAA,MACjB;AAAA,IACD;AAAA,EACD;AACA,gBAAc;AAEd,MAAI,KAAK,qBAAqB,MAAO,iBAAgB;AAAA,MAChD,SAAQ,OAAO;AAEpB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,MAAoE;AACzE,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,cAAQ,EAAE,OAAO,SAAS,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACvD;AAAA,IACA,SAAS,MAAoE;AAC5E,UAAI,YAAY,kBAAkB;AACjC,iBAAS,IAAI;AACb;AAAA,MACD;AACA,sBAAgB,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,MAAoE;AAC3E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,yBAAmB;AACnB,aAAO;AACP,6BAAuB;AACvB,cAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACzD;AAAA,EACD;AACD;AAEA,SAAS,mBACR,YACA,MACqB;AACrB,MAAI,SAAS,eAAe;AAC3B,WAAO,CAAC,GAAI,WAA6C,MAAM,CAAC;AAAA,EACjE;AACA,MAAI,SAAS,iBAAiB;AAC7B,WAAQ,WAA+C,QAAQ;AAAA,EAChE;AACA,SAAQ,WAAgD,QAAQ;AACjE;AAqFO,SAAS,2BACf,MACqC;AACrC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,sBAAyB,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC1D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,oBAAuB,OAAO;AAAA,MAChD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA6C,KAAK,OAAO,YAAY;AAAA,MACxF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,0BACf,MACoC;AACpC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,qBAAwB,QAAQ,EAAE,KAAK,CAAC,WAAW;AACzD,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,mBAAsB,OAAO;AAAA,MAC/C,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA4C,KAAK,OAAO,YAAY;AAAA,MACvF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,0BACf,MACuC;AACvC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,qBAA2B,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC5D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,mBAAyB,OAAO;AAAA,MAClD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA4C,KAAK,OAAO,YAAY;AAAA,MACvF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,4BACf,MACyC;AACzC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,uBAA6B,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC9D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,qBAA2B,OAAO;AAAA,MACpD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA8C,KAAK,OAAO,YAAY;AAAA,MACzF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;;;ACnhBO,SAAS,aAAgBE,OAA8B;AAC7D,SAAOA,MAAK;AACb;AAMO,SAAS,oBACfA,OACA,KACA,OAAkC,CAAC,GACtB;AACb,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,MAAI,KAAK,UAAW,KAAI,KAAK,CAAC;AAE9B,MAAI,cAAc;AAClB,QAAM,+BAA+B,KAAK,eAAe,KAAK;AAC9D,QAAM,OAAa,CAAC,KAAK,aAA4B;AACpD,YAAQ,IAAI,CAAC,GAAG;AAAA,MACf,KAAK;AACJ,YAAI,gCAAgC,eAAe,aAAa,QAAW;AAC1E;AAAA,QACD;AACA,YAAI,IAAI,CAAC,CAAM;AACf;AAAA,MACD,KAAK;AACJ,aAAK,UAAU,IAAI,CAAC,CAAC;AACrB;AAAA,MACD,KAAK;AACJ,aAAK,aAAa;AAClB;AAAA,IACF;AAAA,EACD;AACA,QAAM,cAAcA,MAAK,UAAU,IAAI;AACvC,gBAAc;AACd,SAAO;AACR;AAGO,SAAS,cACfA,OACA,OAAkC,CAAC,GAChB;AACnB,SAAO;AAAA,IACN,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,QAAQ,oBAAoBA,OAAM,KAAK,EAAE,WAAW,MAAM,GAAG,KAAK,CAAC;AAAA,EAChF;AACD;AAEA,SAAS,eAAkBA,OAAwC;AAClE,SAAO,OAAQA,MAA2B,QAAQ;AACnD;AAEA,SAAS,aAAgBA,OAAuB,OAAgB;AAC/D,EAAAA,MAAK,IAAI,KAAK;AACf;AAWO,SAAS,cACfA,OACA,OAAgC,CAAC,GACd;AACnB,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,QAAM,QAAQ,KAAK,UAAU,eAAeA,KAAI,IAAI,eAAe;AACnE,MAAI,CAAC,OAAO;AACX,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAC/E;AACA,QAAM,WAAWA;AACjB,SAAO;AAAA,IACN,KAAK;AAAA,IACL,WAAW,CAAC,QAAQ,oBAAoBA,OAAM,KAAK,EAAE,WAAW,MAAM,GAAG,KAAK,CAAC;AAAA,IAC/E,KAAK,CAAC,UAAU,MAAM,UAAU,KAAK;AAAA,IACrC,QAAQ,CAAC,OAAO,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC;AAAA,EAC3C;AACD;AAGO,SAAS,cACfA,OACA,OAAkF,CAAC,GAChE;AACnB,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,SAAO;AAAA,IACN,aAAa;AAAA,IACb,mBAAmB;AAAA,IACnB,WAAW,CAAC,kBACX,oBAAoBA,OAAM,MAAM,cAAc,GAAG;AAAA,MAChD,aAAa;AAAA,MACb,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,IAClB,CAAC;AAAA,EACH;AACD;AAGO,SAAS,oBACf,UACA,SACA,OAA6C,CAAC,GAChB;AAC9B,QAAM,OAAO,MAAM;AAClB,UAAM,OAAO,SAAS,SAAS,CAAC;AAChC,UAAM,MAAM,CAAC;AACb,eAAW,OAAO,MAAM;AACvB,YAAM,QAAQ,QAAQ,GAAG;AACzB,YAAM,SAAS,CAAC;AAChB,iBAAW,SAAS,OAAO,KAAK,KAAK,GAAqB;AACzD,eAAO,KAAK,IAAI,MAAM,KAAK,EAAE;AAAA,MAC9B;AACA,UAAI,GAAG,IAAI;AAAA,IACZ;AACA,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN,KAAK;AAAA,IACL,UAAU,KAAK;AACd,YAAM,cAAiC,CAAC;AACxC,YAAM,iBAAiB,MAAM;AAC5B,mBAAW,SAAS,YAAY,OAAO,CAAC,EAAG,OAAM;AAAA,MAClD;AACA,YAAM,OAAO,MAAM;AAClB,uBAAe;AACf,mBAAW,OAAO,SAAS,SAAS,CAAC,GAAG;AACvC,gBAAM,QAAQ,QAAQ,GAAG;AACzB,qBAAW,SAAS,OAAO,KAAK,KAAK,GAAqB;AACzD,wBAAY;AAAA,cACX,oBAAoB,MAAM,KAAK,GAAG,MAAM,IAAI,KAAK,CAAC,GAAG;AAAA,gBACpD,aAAa;AAAA,gBACb,SAAS,KAAK;AAAA,gBACd,YAAY,KAAK;AAAA,cAClB,CAAC;AAAA,YACF;AAAA,UACD;AAAA,QACD;AACA,YAAI,KAAK,CAAC;AAAA,MACX;AACA,YAAM,YAAY,oBAAoB,UAAU,MAAM;AAAA,QACrD,aAAa;AAAA,QACb,SAAS,KAAK;AAAA,QACd,YAAY,KAAK;AAAA,MAClB,CAAC;AACD,WAAK;AACL,aAAO,MAAM;AACZ,kBAAU;AACV,uBAAe;AAAA,MAChB;AAAA,IACD;AAAA,EACD;AACD;AAaO,SAAS,aACfA,OACA,eAAkB,aAAaA,KAAI,GACnC,OAAgC,CAAC,GACZ;AACrB,QAAM,YAAY,oBAAI,IAAgB;AACtC,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,QAAM,QAAQ,KAAK,UAAU,eAAeA,KAAI,IAAI,eAAe;AACnE,MAAI,CAAC,OAAO;AACX,UAAM,IAAI,UAAU,yDAAyD;AAAA,EAC9E;AACA,QAAM,WAAWA;AACjB,QAAM,MAA0B;AAAA,IAC/B,UAAU,MAAM,KAAK;AAAA,IACrB,SAAS,SAAS,SAAS;AAC1B,YAAM,OAAO,IAAI,SAAS;AAC1B,YAAM,OAAO,OAAO,YAAY,aAAa,QAAQ,IAAI,IAAI;AAC7D,YAAM,UAAU,UAAW,OAAc,EAAE,GAAG,MAAM,GAAG,KAAK,CAAO;AAAA,IACpE;AAAA,IACA,iBAAiB,MAAM;AAAA,IACvB,UAAU,UAAU;AACnB,UAAI,OAAO,IAAI,SAAS;AACxB,YAAM,QAAQ;AAAA,QACbA;AAAA,QACA,CAAC,UAAU;AACV,gBAAM,OAAO;AACb,mBAAS,MAAM,IAAI;AACnB,iBAAO;AAAA,QACR;AAAA,QACA,EAAE,aAAa,MAAM,SAAS,KAAK,SAAS,YAAY,KAAK,WAAW;AAAA,MACzE;AACA,gBAAU,IAAI,KAAK;AACnB,aAAO,MAAM;AACZ,YAAI,CAAC,UAAU,OAAO,KAAK,EAAG;AAC9B,cAAM;AAAA,MACP;AAAA,IACD;AAAA,IACA,UAAU;AACT,iBAAW,SAAS,CAAC,GAAG,SAAS,GAAG;AACnC,kBAAU,OAAO,KAAK;AACtB,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAQO,SAAS,UACfA,OACA,OAA4D,CAAC,GACvB;AACtC,QAAM,OAAqB;AAAA,IAC1B,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,aAAa,MAAM,GAAG,KAAK,CAAC;AAAA,IAC3F,OAAOA;AAAA,EACR;AACA,MAAI,eAAeA,KAAI,KAAK,OAAQ,KAAiC,UAAU,YAAY;AAC1F,UAAM,WAAW;AAAA,MAChBA;AAAA,MACA;AAAA,IAGD;AACA,WAAO,EAAE,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,OAAO;AAAA,EAC9D;AACA,SAAO;AACR;AAQO,SAAS,SACfA,OACA,OAA4D,CAAC,GACzB;AACpC,QAAM,OAAoB;AAAA,IACzB,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,WAAW,MAAM,GAAG,KAAK,CAAC;AAAA,IACzF,QAAQ,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,aAAa,MAAM,GAAG,KAAK,CAAC;AAAA,IACxF,OAAOA;AAAA,EACR;AACA,MAAI,eAAeA,KAAI,KAAK,OAAQ,KAAiC,UAAU,YAAY;AAC1F,UAAM,WAAW;AAAA,MAChBA;AAAA,MACA;AAAA,IAGD;AACA,WAAO,EAAE,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,OAAO;AAAA,EAC9D;AACA,SAAO;AACR;AAQO,SAAS,eACfA,OACA,OAA4D,CAAC,GACrB;AACxC,QAAM,OAAsB;AAAA,IAC3B,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,aAAa,MAAM,GAAG,KAAK,CAAC;AAAA,IAC3F,OAAOA;AAAA,EACR;AACA,MAAI,eAAeA,KAAI,KAAK,OAAQ,KAAiC,UAAU,YAAY;AAC1F,UAAM,WAAW;AAAA,MAChBA;AAAA,MACA;AAAA,IAGD;AACA,WAAO,EAAE,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,OAAO;AAAA,EAC9D;AACA,SAAO;AACR;","names":["depCount","out","node","node","source","isDenseArrayOf","isPlainRecord","source","recordFromFrame","errorMessage","drain","records","node","source","requestId","errorMessage","node","source","timer","ctor","entry","active","node","active","initial","active","isRecord","ownKeys","assertKeys","strictJsonIdentity","isRecord","assertKeys","cmpOrd","row","errorMessage","validateSnapshotEveryChanges","statusOf","dataOf","drain","node"]}
+{"version":3,"sources":["../../src/adapters/index.ts","../../src/batch/boundary.ts","../../src/batch/batch.ts","../../src/protocol/messages.ts","../../src/ctx/types.ts","../../src/dispatcher/index.ts","../../src/node/core.ts","../../src/graph/environment.ts","../../src/node/protocol-guards.ts","../../src/node/runtime-accessors.ts","../../src/node/node-context-runtime.ts","../../src/node/node-input-runtime.ts","../../src/node/node-runtime-host.ts","../../src/node/node-lifecycle-runtime.ts","../../src/json/codec.ts","../../src/node/versioning.ts","../../src/node/node-output-runtime.ts","../../src/node/node-rewire-runtime.ts","../../src/node/node.ts","../../src/graph/checkpoint.ts","../../src/graph/operators.ts","../../src/graph/graph.ts","../../src/patterns/semantic-memory.ts","../../src/solutions/agentic-memory-shared.ts","../../src/solutions/agentic-memory-frame.ts","../../src/adapters/agentic-memory-storage.ts","../../src/graph/resilience.ts","../../src/adapters/bridge-protobuf.ts","../../src/adapters/bridge-validation.ts","../../src/adapters/bridge-remote-call.ts","../../src/adapters/bridge-projections.ts","../../src/adapters/bridge-remote-responder.ts","../../src/adapters/bridge.ts","../../src/adapters/bridge-wire-edge-group.ts","../../src/adapters/environment-outbound.ts","../../src/adapters/environment-websocket-session.ts","../../src/graph/data-structures/core.ts","../../src/graph/data-structures/reactive-index.ts","../../src/graph/policies/collection.ts","../../src/graph/data-structures/reactive-list.ts","../../src/graph/data-structures/reactive-log.ts","../../src/graph/sources.ts","../../src/graph/data-structures/reactive-map.ts","../../src/data-structures/persistence.ts","../../src/storage/reactive-collection.ts","../../src/adapters/reactive-collection-storage.ts","../../src/adapters/store.ts"],"sourcesContent":["/**\n * Graph/framework/environment adapter namespace.\n *\n * Use focused adapter subpaths for graph-bound bridges such as\n * `@graphrefly/ts/adapters/observe-storage`.\n */\n\nexport * from \"./agentic-memory-storage.js\";\nexport * from \"./bridge.js\";\nexport * from \"./bridge-wire-edge-group.js\";\nexport * from \"./environment.js\";\nexport * from \"./reactive-collection-storage.js\";\nexport * from \"./store.js\";\n","/**\n * The wave-owner boundary + deferred self-rewire drain (R-rewire-deferred / D47).\n *\n * `ctx.rewireNext` defers a node's OWN dep-set mutation to the COMMITTED wave boundary.\n * The substrate has no such boundary on the raw call stack, so this module establishes one:\n * a module-global re-entrant DEPTH counter — the TS analogue of the Rust `WaveScope` /\n * `with_wave_owner` (graphrefly-rs B25, flagged forward-load-bearing for exactly this). JS is\n * single-threaded and waves are synchronous, so one cascade is on the stack at a time (same\n * rationale as `batch.ts`'s module-global `active`).\n *\n * Every EXTERNAL wave origin brackets its synchronous cascade with {@link enterWave} /\n * {@link exitWave}: `Node.subscribe`/`Node.down`/`Node.up` (activation, state.set, control),\n * the async-pool `ctx.down`/`ctx.up` re-entry (which enters via the stashed ctx, NOT the public\n * method), and `batch()` (so the drain fires AFTER commit). Re-entrant (nested) calls just\n * inc/dec the counter; only the OUTERMOST exit (depth → 0) DRAINS the deferred-rewire queue.\n *\n * B49 migration: the deferred thunks now live on the graph-local NodeCore, not in this module.\n * This module keeps only the JS call-stack wave-owner depth plus a small FIFO of cores that\n * have work to drain. Per D22, a graph is the supported single-thread domain; cross-domain\n * coordination is the async wire bridge (D32), so the queued work for one legal synchronous cascade\n * belongs to one graph-local core. Standalone nodes keep their private core. Within a core, FIFO\n * issue order still gives the R-rewire-deferred drain order, and the scheduler records one core\n * token per queued task so mixed-core legal batches keep their enqueue order. Each queued mutation\n * runs as a fresh wave whose own `ctx.rewireNext` calls re-enqueue and drain in the same loop.\n *\n * C-25 / D110: queued boundary work is tagged with the batch frame that caused it (when any)\n * plus an owner-readiness predicate. The drain applies only committed, unpaused tasks; rollback\n * drops the batch's tasks, and paused owners re-schedule their core on final RESUME.\n * Zero behavior change when no `ctx.rewireNext`/`ctx.upNext` is ever called: the drain is one\n * empty-queue check per outermost wave (F-PERF).\n */\n\nimport type { NodeCore } from \"../node/core.js\";\n\nlet depth = 0;\nconst pendingCores: NodeCore[] = [];\nlet pendingHead = 0;\n\n/** Enter a wave cascade (re-entrant). Pair with {@link exitWave} in a try/finally. */\nexport function enterWave(): void {\n\tdepth++;\n}\n\n/** Exit a wave cascade; the OUTERMOST exit (depth → 0) drains the deferred-rewire queue. */\nexport function exitWave(): void {\n\tdepth--;\n\tif (depth === 0 && pendingHead < pendingCores.length) drain();\n}\n\nexport interface DeferredBoundaryOptions {\n\treadonly batchToken?: object;\n\treadonly isReady?: () => boolean;\n}\n\n/**\n * Queue a deferred self-rewire application, drained at the committed boundary\n * (R-rewire-deferred). The thunk applies one queued mutation to its owning node.\n */\nexport function deferRewire(\n\tcore: NodeCore,\n\tapply: () => void,\n\toptions: DeferredBoundaryOptions = {},\n): void {\n\tcore.enqueueBoundaryTask({ apply, batchToken: options.batchToken, isReady: options.isReady });\n\tpendingCores.push(core);\n}\n\n/** Re-schedule an existing core queue, used when a final RESUME opens a paused boundary gate. */\nexport function scheduleBoundaryDrain(core: NodeCore): void {\n\tfor (let i = 0; i < core.boundaryTaskCount(); i++) pendingCores.push(core);\n\tif (depth === 0 && pendingHead < pendingCores.length) drain();\n}\n\n/** D110: an uncommitted batch cannot leak queued boundary effects. */\nexport function dropBoundaryTasksForBatch(batchToken: object): void {\n\tconst seen = new Set<NodeCore>();\n\tfor (let i = pendingHead; i < pendingCores.length; i++) {\n\t\tconst core = pendingCores[i] as NodeCore;\n\t\tif (seen.has(core)) continue;\n\t\tseen.add(core);\n\t\tcore.dropBoundaryTasksForBatch(batchToken);\n\t}\n}\n\nfunction drain(): void {\n\t// Each applied rewire runs a fresh wave (its own depth-bracketed cascade) which may itself\n\t// enqueue more rewireNext requests — appended and drained by this same FIFO loop\n\t// (DrainExactlyOnce). The depth++ around apply() prevents the fresh wave's own outermost\n\t// exit from re-entering drain (this loop owns the draining). A net-changing op re-issued\n\t// every boundary (oscillation) is a user-level runaway, like an infinite producer — NOT a\n\t// substrate-detected error (D47).\n\t//\n\t// Per-thunk isolation: a thunk whose application throws (e.g. its _applyRewireNext error-route\n\t// reaches a throwing external sink) must NOT abandon the rest of the queue — otherwise the\n\t// stranded thunks would linger in this module-global queue and drain at an unrelated LATER\n\t// wave boundary (a stale, misattributed rewire). Drain every thunk; re-surface the FIRST\n\t// escape once the queue is empty so the error stays visible without corrupting the queue.\n\tlet escaped: { e: unknown } | null = null;\n\twhile (pendingHead < pendingCores.length) {\n\t\tconst core = pendingCores[pendingHead++] as NodeCore;\n\t\tconst task = core.shiftBoundaryTask();\n\t\tif (task === undefined) continue;\n\t\tif (task.batchToken !== undefined) {\n\t\t\t// A stale token means the batch never reached the committed boundary (D110). Rollback\n\t\t\t// normally removes these before drain; this guard covers commit failures before the\n\t\t\t// batch frame marks itself committed.\n\t\t\tconst committed = (task.batchToken as { committed?: boolean }).committed === true;\n\t\t\tif (!committed) continue;\n\t\t}\n\t\tif (task.isReady !== undefined && !task.isReady()) {\n\t\t\tcore.unshiftBoundaryTask(task);\n\t\t\tcontinue;\n\t\t}\n\t\tdepth++;\n\t\ttry {\n\t\t\ttask.apply();\n\t\t} catch (e) {\n\t\t\tif (escaped === null) escaped = { e };\n\t\t} finally {\n\t\t\tdepth--;\n\t\t}\n\t}\n\tpendingCores.length = 0;\n\tpendingHead = 0;\n\tif (escaped !== null) throw escaped.e;\n}\n","/**\n * Declarative batch (R-batch-coalesce / D12).\n *\n * Inside a batch, DIRTY propagates immediately but the tier-3 settle slice\n * (DATA/RESOLVED/INVALIDATE) is deferred to commit, so a shared downstream\n * recomputes ONCE after all batched sources settle. Success -> commit; a thrown\n * error -> rollback; `bctx.rollback()` is the explicit escape hatch.\n *\n * Coalescing note: this kernel coalesces multiple emits to the SAME node within\n * one batch to the latest tier-3 wave (last-value-wins). Full per-item batch-array\n * delivery (downstream fn receiving [v1..vK]) is a documented refinement — the\n * dominant use (coalescing a diamond join to one recompute) is exact here.\n */\n\nimport type { Wave } from \"../protocol/messages.js\";\nimport { dropBoundaryTasksForBatch, enterWave, exitWave } from \"./boundary.js\";\n\n/** A node target the batch can commit/rollback against (structural, avoids an import cycle). */\nexport interface BatchTarget {\n\t__commitBatchedWave(wave: Wave): void;\n\t__rollbackBatched(): void;\n\t__deferBoundary(fn: () => void, batchToken?: object): void;\n}\n\nexport interface BatchCtx {\n\t/** Discard all deferred emissions in this batch instead of committing. */\n\trollback(): void;\n}\n\ninterface ActiveBatch {\n\torder: BatchTarget[];\n\tdeferred: Map<BatchTarget, Wave>;\n\tcommitted: boolean;\n\trolledBack: boolean;\n}\n\nlet active: ActiveBatch | null = null;\nlet boundaryOwner: ActiveBatch | null = null;\n\nexport function currentBatch(): boolean {\n\treturn active !== null;\n}\n\nexport function currentBoundaryBatchToken(): object | undefined {\n\treturn active ?? boundaryOwner ?? undefined;\n}\n\n/**\n * Defer a node's tier-3 settle slice into the active batch. Returns true if a batch\n * captured it; false if there is no active batch (caller emits normally).\n */\nexport function deferToBatch(target: BatchTarget, tier3Wave: Wave): boolean {\n\tif (active === null) return false;\n\tif (!active.deferred.has(target)) active.order.push(target);\n\tactive.deferred.set(target, tier3Wave); // last-value coalescing\n\treturn true;\n}\n\n/**\n * Defer a topology mutation until after the active batch has committed/rolled back,\n * but only when this target has an uncommitted settle slice in the current batch.\n */\nexport function deferAfterBatchForTarget(target: BatchTarget, fn: () => void): boolean {\n\tif (active === null || !active.deferred.has(target)) return false;\n\tconst owner = active;\n\ttarget.__deferBoundary(() => {\n\t\tif (owner.committed) fn();\n\t}, owner);\n\treturn true;\n}\n\nfunction commit(b: ActiveBatch): void {\n\tconst prev = boundaryOwner;\n\tboundaryOwner = b;\n\ttry {\n\t\tfor (const target of b.order) {\n\t\t\tconst wave = b.deferred.get(target);\n\t\t\tif (wave) target.__commitBatchedWave(wave);\n\t\t}\n\t\tb.committed = true;\n\t} catch (e) {\n\t\tdropBoundaryTasksForBatch(b);\n\t\tthrow e;\n\t} finally {\n\t\tboundaryOwner = prev;\n\t}\n}\n\nfunction rollback(b: ActiveBatch): void {\n\tdropBoundaryTasksForBatch(b);\n\tfor (const target of b.order) target.__rollbackBatched();\n}\n\n/**\n * Run updates as one coalesced batch.\n *\n * @param fn - Synchronous callback that performs node updates and may call `rollback()`.\n * @returns The callback return value when the batch commits.\n * @example\n * ```ts\n * import { batch, graph } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const left = g.state(0);\n * const right = g.state(0);\n *\n * batch(() => {\n *   left.set(1);\n *   right.set(2);\n * });\n * ```\n * @remarks **Coalescing:** DATA/RESOLVED/INVALIDATE settle slices are deferred until commit so\n *   shared downstream nodes recompute once for the batch.\n * @category core\n */\nexport function batch<R>(fn: (bctx: BatchCtx) => R): R {\n\t// Wave-owner boundary (R-rewire-deferred / D47): bracket the whole batch (fn + commit) so a\n\t// ctx.rewireNext issued by a fn that runs during COMMIT drains AFTER the commit, never on the\n\t// un-committed view. Inner waves (state.set, commit cascade) nest under this owner.\n\tenterWave();\n\ttry {\n\t\tif (active !== null) {\n\t\t\t// Nested batch joins the outer frame (one commit at the outermost exit).\n\t\t\tconst outer = active;\n\t\t\treturn fn({\n\t\t\t\trollback: () => {\n\t\t\t\t\touter.rolledBack = true;\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t\tconst b: ActiveBatch = { order: [], deferred: new Map(), committed: false, rolledBack: false };\n\t\tactive = b;\n\t\tconst bctx: BatchCtx = {\n\t\t\trollback: () => {\n\t\t\t\tb.rolledBack = true;\n\t\t\t},\n\t\t};\n\t\tlet result: R;\n\t\ttry {\n\t\t\tresult = fn(bctx);\n\t\t} catch (e) {\n\t\t\tactive = null;\n\t\t\trollback(b);\n\t\t\tthrow e;\n\t\t}\n\t\tactive = null;\n\t\tif (b.rolledBack) rollback(b);\n\t\telse {\n\t\t\tcommit(b);\n\t\t}\n\t\treturn result;\n\t} finally {\n\t\texitWave();\n\t}\n}\n","/**\n * Wave-protocol message types and the tier const table.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-msg-format, R-msg-closed-set, R-tier (D34), R-data-payload, R-sentinel.\n */\n\n/** Opaque pause-lock / pull identifier (R-pause-lockset, R-pull). */\nexport type LockId = string | symbol;\n\n/** Explicit pull demand payload (D269/D272). Params are holder-visible context, never DATA-up. */\nexport interface PullDemand {\n\treadonly pullId: LockId;\n\treadonly params?: unknown;\n}\n\n/**\n * The CLOSED set of 11 message types (R-msg-closed-set / D9 + D269 + START handshake).\n * No open set, no user-defined custom types. Adding a type is a spec change.\n */\nexport type Message =\n\t| readonly [\"START\"]\n\t| readonly [\"DIRTY\"]\n\t| readonly [\"DATA\", unknown]\n\t| readonly [\"RESOLVED\"]\n\t| readonly [\"INVALIDATE\"]\n\t| readonly [\"COMPLETE\"]\n\t| readonly [\"ERROR\", unknown]\n\t| readonly [\"TEARDOWN\"]\n\t| readonly [\"PAUSE\", LockId]\n\t| readonly [\"RESUME\", LockId]\n\t| readonly [\"PULL\", PullDemand];\n\n/** One array of messages delivered in one call = one Wave (R-wave-boundary). */\nexport type Wave = readonly Message[];\n\n/** The message-type tag (the first tuple element). */\nexport type MessageType = Message[0];\n\n/**\n * SENTINEL = absence-of-DATA (R-sentinel / D16). TS representation is `undefined`.\n * Never a valid DATA payload; `null` IS a valid DATA value (domain-level absence).\n */\nexport const SENTINEL = undefined;\n\n/** R-data-payload: ERROR payloads must not collide with terminal metadata shorthand. */\nexport function isInvalidErrorPayload(v: unknown): boolean {\n\treturn v === SENTINEL || typeof v === \"boolean\";\n}\n\n/** R-data-payload / D78: host-language failures that collide with ctx.terminal shorthand become diagnostics. */\nexport function errorPayload(reason: unknown, fallback = \"error without a valid payload\"): unknown {\n\treturn isInvalidErrorPayload(reason) ? new Error(fallback) : reason;\n}\n\nexport const TIER_START = 0;\nexport const TIER_CONTROL = 1;\nexport const TIER_NOTIFICATION = 2;\nexport const TIER_VALUE = 3;\nexport const TIER_SETTLE = 4;\nexport const TIER_TERMINAL = 5;\nexport const TIER_TEARDOWN = 6;\n\n/**\n * Tier const table (R-tier / D34). Tiers below value dispatch immediately; value\n * and above are batch-deferred. This is a compile-time const table (D18), not runtime config.\n */\nconst TIER: Record<MessageType, number> = {\n\tSTART: TIER_START,\n\tPAUSE: TIER_CONTROL,\n\tRESUME: TIER_CONTROL,\n\tPULL: TIER_CONTROL,\n\tDIRTY: TIER_NOTIFICATION,\n\tDATA: TIER_VALUE,\n\tRESOLVED: TIER_VALUE,\n\tINVALIDATE: TIER_SETTLE,\n\tCOMPLETE: TIER_TERMINAL,\n\tERROR: TIER_TERMINAL,\n\tTEARDOWN: TIER_TEARDOWN,\n};\n\nexport function messageTier(t: MessageType): number {\n\treturn TIER[t];\n}\n\n/** Value and above are deferred inside a batch (DATA/RESOLVED/INVALIDATE/terminal/teardown). */\nexport function isDeferredTier(t: MessageType): boolean {\n\treturn TIER[t] >= TIER_VALUE;\n}\n\n/** Value-tier messages (DATA/RESOLVED) occupy the tier-3 slot. */\nexport function isValueTier(t: MessageType): boolean {\n\treturn TIER[t] === TIER_VALUE;\n}\n\n/** The pause buffer holds the settle slice only: value-tier DATA/RESOLVED plus INVALIDATE. */\nexport function isPauseBufferedTier(t: MessageType): boolean {\n\tconst tier = TIER[t];\n\treturn tier === TIER_VALUE || tier === TIER_SETTLE;\n}\n\n/**\n * A TERMINAL message = tier 5 (COMPLETE | ERROR), R-tier / D34. Detected via the CENTRAL tier\n * table, NOT a per-variant `=== \"COMPLETE\" || === \"ERROR\"` check — so terminal routing stays\n * driven by the one const table (feedback_use_tier_for_signal_routing); discriminate COMPLETE vs\n * ERROR within the tier by the message type only where the handling actually differs.\n */\nexport function isTerminal(t: MessageType): boolean {\n\treturn TIER[t] === TIER_TERMINAL;\n}\n\n/**\n * ctx.up carries control/demand tiers only (R-ctx-up / D269): DIRTY, PAUSE, RESUME, PULL,\n * INVALIDATE, TEARDOWN. DATA/RESOLVED (tier 3) and COMPLETE/ERROR (tier 5) are\n * down-only.\n */\nexport function isUpAllowed(t: MessageType): boolean {\n\tconst tier = TIER[t];\n\treturn tier !== TIER_VALUE && tier !== TIER_TERMINAL;\n}\n","/**\n * The fn-invocation context and per-dep input shapes.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-fn-contract (D8/D27), R-ctx-state (D23/D29), R-cleanup-hooks (D28), R-ctx-up.\n */\n\nimport type { Dispatcher } from \"../dispatcher/index.js\";\nimport type { EnvironmentDrivers } from \"../graph/environment.js\";\nimport type { Node } from \"../node/node.js\";\nimport { type Message, type PullDemand, SENTINEL, type Wave } from \"../protocol/messages.js\";\n\n/** A downstream sink callback (the only way to connect to a node's output). */\nexport type Sink = (msg: Message, delivery?: DeliveryMeta) => void;\n\n/** Internal delivery metadata used to preserve the upstream `ctx.down(msgs)` wave boundary. */\nexport interface DeliveryMeta {\n\treadonly wave: object;\n\treadonly last: boolean;\n}\n\n/**\n * Internal current-value reader. It is deliberately a symbol-backed implementation detail:\n * raw ctx exposes `waveData` + `terminal`; helpers below derive from that plus this dep cache.\n */\nexport const CTX_DEP_CACHE: unique symbol = Symbol(\"graphrefly.ctx.depCache\");\n\nexport interface CtxDepCache {\n\treadonly latest: readonly unknown[];\n}\n\n/** Internal node-construction binding for graph-local helper-created deps. */\nexport const CTX_NODE_BINDING: unique symbol = Symbol(\"graphrefly.ctx.nodeBinding\");\n\nexport interface CtxNodeBinding {\n\treadonly dispatcher: Dispatcher;\n\tcreate<T>(factory: () => Node<T>): Node<T>;\n}\n\n/** Per-dep wave projections: dep -> waves -> values/SENTINEL markers. */\nexport type WaveData = readonly (readonly (readonly unknown[])[])[];\n\n/** Terminal metadata parallel to `waveData`: false = none, true = COMPLETE, otherwise ERROR payload. */\nexport type TerminalData = readonly unknown[];\n\nexport function isTerminalNone(t: unknown): boolean {\n\treturn t === false || t === undefined;\n}\n\nexport function isTerminalComplete(t: unknown): t is true {\n\treturn t === true;\n}\n\nexport function isTerminalError(t: unknown): boolean {\n\treturn !isTerminalNone(t) && !isTerminalComplete(t);\n}\n\nexport function terminalErrorValue(t: unknown): unknown {\n\treturn isTerminalError(t) ? t : undefined;\n}\n\n/**\n * Per-node private cross-wave state (R-ctx-state / D23,D29). Default fresh-lifecycle\n * wipe; `persist(true)` keeps it across lifecycle transitions.\n */\nexport interface CtxState {\n\tget<S = unknown>(): S | undefined;\n\tset<S = unknown>(v: S): void;\n\tpersist(on?: boolean): void;\n}\n\n/**\n * Deferred SELF-rewire (R-rewire-deferred / D47). A node fn may, DURING its run, request a\n * mutation of its OWN dep set; the request is QUEUED and applied at the committed wave boundary\n * (after the current wave settles / batch commit / final-lock RESUME) as a fresh wave, reusing\n * R-rewire surgical/Option-C semantics (D42). This is the ONLY legal self-triggered rewire — an\n * IMMEDIATE in-fn `node.subscribeDep/unsubscribeDep/replaceDeps` is the D37 mid-fn feedback-cycle ERROR. An\n * added cached dep pushes `[DIRTY,DATA]` on the boundary wave (R-push-subscribe); a removed dep\n * is drained and, if it loses its last subscriber, `_deactivate`s + fires `onDeactivation`\n * (input-side teardown — the basis for higher-order operator cancellation / abortInFlight).\n */\nexport interface RewireNext {\n\t/** Defer subscribing to a dep (paired with the re-supplied fn — positional fn-deps lock, SD-1). */\n\tsubscribeDep(dep: Node<unknown>, fn: NodeFn): void;\n\t/** Defer unsubscribing from a dep (its source is torn down if it loses its last subscriber). */\n\tunsubscribeDep(dep: Node<unknown>, fn: NodeFn): void;\n\t/** Defer replacing the whole dep set (surgical: kept deps untouched, removed drained, added fresh-subscribe). */\n\treplaceDeps(deps: Node<unknown>[], fn: NodeFn): void;\n}\n\n/**\n * The single argument to a node fn: `(ctx) => void` (R-fn-contract / D8). All emission\n * is explicit via `ctx.down`; there is no return-value framing.\n */\nexport interface Ctx {\n\t/**\n\t * Emit upstream toward deps — control tiers only (R-ctx-up). IMMEDIATE. `towardDep` (a dep index)\n\t * routes the wave up ONE declared edge (R-up-routing directed-up); omitted = broadcast up all deps.\n\t * A pull DEMAND is `up([[PULL, { pullId, params }]])` — but for a SELF-demand (demanding a dep\n\t * this fn also reads) use {@link Ctx.upNext} instead, since an immediate demand whose delivery loops back\n\t * re-enters this fn mid-wave (D37 / R-reentrancy).\n\t */\n\tup(msgs: Wave, towardDep?: number): void;\n\t/** Emit downstream toward sinks. */\n\tdown(msgs: Wave): void;\n\t/**\n\t * The single raw dep-value input surface (R-ctx-wave-data / D77): dep -> upstream waves ->\n\t * per-wave DATA payloads and INVALIDATE/SENTINEL markers. `waveData[i] = []` means dep i\n\t * delivered no wave to this invocation; `waveData[i] = [[]]` means RESOLVED-only.\n\t */\n\twaveData: WaveData;\n\t/** Terminal metadata for the same invocation; terminal values never enter `waveData`. */\n\tterminal: TerminalData;\n\tstate: CtxState;\n\t/** Release external resources on deactivation (R-cleanup-hooks). */\n\tonDeactivation(fn: () => void): void;\n\t/** Flush on INVALIDATE (R-cleanup-hooks). */\n\tonInvalidate(fn: () => void): void;\n\t/** Graph-owned environment drivers for source/adapter boundaries (D130/D131). */\n\tenvironment(): EnvironmentDrivers;\n\t/** Holder-visible context for a PULL-caused invocation (D272); absent for ordinary waves. */\n\treadonly pull?: PullDemand;\n\t/**\n\t * Deferred SELF-rewire (R-rewire-deferred / D47) — the substrate affordance higher-order\n\t * operators (switchMap/mergeMap/concatMap/exhaustMap/flatMap) use to grow/shrink their own\n\t * inner-source dep set in response to their own data. Always present; see {@link RewireNext}.\n\t */\n\trewireNext: RewireNext;\n\t/**\n\t * Deferred up — the boundary-deferred form of {@link Ctx.up} (R-up-routing / R-pull / D59). Routes\n\t * `msgs` up from this node at the COMMITTED wave boundary (broadcast, or up the single `towardDep`\n\t * edge), riding the same R-rewire-deferred (D47) drain as {@link RewireNext}. This is the\n\t * SELF-DEMAND path: a consumer issues `ctx.upNext([[PULL, { pullId, params }]])` to demand a pull\n\t * dep it ALSO reads — the cone-routed PULL reaches the pullId-holder, whose delivery loops back as a\n\t * FRESH wave (not a mid-fn re-entry → no D37). The consumer accepts one-wave latency (the\n\t * HTTP-request model). No node reference needed: the author writes the pullId verbatim.\n\t */\n\tupNext(msgs: Wave, towardDep?: number): void;\n\t/**\n\t * Read a dep's latest value by index (dynamicNode only, R-dynamic-node / D35).\n\t * Present only on dynamicNode fns; all declared deps still participate in wave\n\t * tracking. Under D49/R-resolved-undirty an unread dep's change still fires the fn,\n\t * which re-emits its (unchanged) output as a DATA occurrence — there is NO equals-\n\t * absorption; pair with distinctUntilChanged to suppress unchanged re-emits (opt-in).\n\t */\n\ttrack?(depIndex: number): unknown;\n\t[CTX_DEP_CACHE]?: CtxDepCache;\n\t[CTX_NODE_BINDING]?: CtxNodeBinding;\n}\n\n/** A node fn (R-fn-contract). Registered in a dispatcher pool, indexed by Handle. */\nexport type NodeFn = (ctx: Ctx) => void;\n\n/** Number of declared dep slots visible in this invocation. */\nexport function depCount(ctx: Ctx): number {\n\treturn ctx.waveData.length;\n}\n\n/** DATA/SENTINEL projection batches delivered by one dep in this invocation. */\nexport function depWaves(ctx: Ctx, depIndex: number): readonly (readonly unknown[])[] {\n\treturn ctx.waveData[depIndex] ?? [];\n}\n\n/** Flattened DATA projection for old event-counting operator bodies; null = no wave. */\nexport function depBatch(ctx: Ctx, depIndex: number): readonly unknown[] | null {\n\tconst waves = depWaves(ctx, depIndex);\n\tif (waves.length === 0) return null;\n\tconst flattened = waves.flat().filter((v) => v !== SENTINEL);\n\treturn flattened.length === 0 ? [] : flattened;\n}\n\n/** Latest cached DATA for a dep, derived from implementation-owned dep cache. */\nexport function depLatest(ctx: Ctx, depIndex: number): unknown {\n\treturn ctx[CTX_DEP_CACHE]?.latest[depIndex];\n}\n\n/** Terminal metadata for one dep: false = none, true = COMPLETE, otherwise ERROR payload. */\nexport function depTerminal(ctx: Ctx, depIndex: number): unknown {\n\tconst t = ctx.terminal[depIndex];\n\treturn t === undefined ? false : t;\n}\n","/**\n * Dispatcher, pools, and the pure-data Handle.\n *\n * Canonical authority: ~/src/graphrefly/spec/rules.jsonl\n *   R-handle (D7), R-dispatch-all (D21), R-sync-core (D20/D21).\n *\n * Lifted from the validated retired handle-dispatch PoC (R8/R9):\n * fn lives in an external pool, indexed by handle; `dispatcher.invoke` is uniformly\n * SYNC void — async/remote behavior lives in the fn body (it kicks off async work\n * and emits later via `ctx.down`), not in a different call mechanism.\n */\n\nimport type { Ctx, NodeFn } from \"../ctx/types.js\";\n\n/** A pool kind label. LocalSync + LocalAsync ship in 1.0 (D20). */\nexport type PoolKind = \"sync\" | \"async\";\n\n/**\n * Handle = pure data `(poolId, handleId)`, NO methods (R-handle / D7). A serializable\n * index into a pool's dispatch table. node != handle.\n */\nexport interface Handle {\n\treadonly poolId: number;\n\treadonly handleId: number;\n}\n\n/** A dispatch pool: a flat fn table + an array-indexed sync invoke. */\nexport interface Pool {\n\treadonly kind: PoolKind;\n\tregister(fn: NodeFn): number;\n\t/** Free a handle's slot so its fn closure is GC'd and the id is reused (B15). */\n\tunregister(handleId: number): void;\n\tinvoke(handleId: number, ctx: Ctx): void;\n}\n\n/**\n * Array-indexed fn table with a free-list (B15). `register` reuses a freed slot before\n * growing the array, so a rewire-heavy graph (fn-swap on every replaceDeps/subscribeDep/unsubscribeDep,\n * e.g. CSP-2.7 higher-order *Map operators) keeps the table bounded to its peak live size\n * instead of leaking a slot + closure per swap. `unregister` tombstones the slot (drops the\n * closure reference for GC) and offers the id for reuse. handleId reuse is safe: the graph is\n * a single causal domain (D22) and D37 forbids a fn rewiring its own handle mid-run, so a\n * freed id is never re-registered while an invoke of it is in flight. The hot path stays a\n * raw array index (F-PERF).\n */\nclass PoolTable implements Pool {\n\tconstructor(readonly kind: PoolKind) {}\n\tprivate fns: (NodeFn | undefined)[] = [];\n\tprivate free: number[] = [];\n\tregister(fn: NodeFn): number {\n\t\tconst reused = this.free.pop();\n\t\tif (reused !== undefined) {\n\t\t\tthis.fns[reused] = fn;\n\t\t\treturn reused;\n\t\t}\n\t\tconst id = this.fns.length;\n\t\tthis.fns.push(fn);\n\t\treturn id;\n\t}\n\tunregister(handleId: number): void {\n\t\tif (this.fns[handleId] === undefined) return; // already free → idempotent\n\t\tthis.fns[handleId] = undefined; // drop the closure (GC)\n\t\tthis.free.push(handleId); // offer the slot for reuse (bounded growth)\n\t}\n\tinvoke(handleId: number, ctx: Ctx): void {\n\t\t// A live handle always resolves to a fn; a dead/unregistered id throws (TypeError —\n\t\t// invoking an unregistered handle is a bug, surfaced loudly). Cast keeps the hot path\n\t\t// a raw index with no extra branch (F-PERF).\n\t\t(this.fns[handleId] as NodeFn)(ctx);\n\t}\n}\n\n/**\n * First-class dispatcher (D21). Owns pools; graph binds to one (default = process-global,\n * D26 — the only global singleton). Pool trait is pluggable for WorkerPool/RemotePool (D20).\n */\n/** Per-handle profiling counters (D39 / R-profile). Lives on the dispatcher — the invoke\n * funnel (F-DISPATCH-ALL) — NEVER on the thin node (R-node-thin). */\nexport interface HandleStat {\n\tinvokes: number;\n\ttotalDurationNs: number;\n\tlastDurationNs: number;\n}\n\nconst statKey = (h: Handle): string => `${h.poolId}:${h.handleId}`;\n\nexport class Dispatcher {\n\tprivate pools: Pool[] = [];\n\treadonly syncPoolId: number;\n\treadonly asyncPoolId: number;\n\n\t// opt-in profile recorder (default OFF → zero overhead, F-PERF).\n\tprivate _recording = false;\n\tprivate _stats = new Map<string, HandleStat>();\n\tprivate _totalInvokes = 0;\n\n\tconstructor() {\n\t\tthis.syncPoolId = this.addPool(new PoolTable(\"sync\"));\n\t\tthis.asyncPoolId = this.addPool(new PoolTable(\"async\"));\n\t}\n\n\t/** Turn the profile recorder on/off (D39). Off = zero overhead on invoke. */\n\tsetRecording(on: boolean): void {\n\t\tthis._recording = on;\n\t}\n\t/** Reset accumulated profiling counters. */\n\tclearStats(): void {\n\t\tthis._stats.clear();\n\t\tthis._totalInvokes = 0;\n\t}\n\t/** Read a handle's accumulated counters (undefined if it never ran while recording). */\n\tstatFor(handle: Handle): HandleStat | undefined {\n\t\treturn this._stats.get(statKey(handle));\n\t}\n\t/** Total fn invocations recorded across the dispatcher. */\n\tget totalInvokes(): number {\n\t\treturn this._totalInvokes;\n\t}\n\n\taddPool(pool: Pool): number {\n\t\tconst id = this.pools.length;\n\t\tthis.pools.push(pool);\n\t\treturn id;\n\t}\n\n\t/** Register a fn in a pool, returning its Handle. Default pool = sync (R-sync-core). */\n\tregister(fn: NodeFn, pool: PoolKind | number = \"sync\"): Handle {\n\t\tconst poolId = pool === \"sync\" ? this.syncPoolId : pool === \"async\" ? this.asyncPoolId : pool;\n\t\tconst handleId = this.pools[poolId].register(fn);\n\t\treturn { poolId, handleId };\n\t}\n\n\t/**\n\t * Release a handle (B15): frees the pool slot (closure GC'd, id reusable) and drops any\n\t * accumulated profile stat so a reused id never inherits the previous tenant's counters.\n\t * Called on rewire fn-swap (node._rewire) — the old handle is dropped before the node\n\t * adopts the new one. Idempotent. NOT called on deactivate (a node's handle survives\n\t * activate↔deactivate and is reused on reactivation; only a rewire swaps it).\n\t */\n\tunregister(handle: Handle): void {\n\t\tthis.pools[handle.poolId].unregister(handle.handleId);\n\t\t// Drop the stat UNCONDITIONALLY (QA F2.1), not only while recording: if recording was\n\t\t// OFF at unregister time the key would linger, and a later register reusing this id (the\n\t\t// free-list) would inherit the prior tenant's counters once recording resumes. delete of\n\t\t// an absent key is a cheap no-op; unregister is off the hot invoke path (F-PERF intact).\n\t\tthis._stats.delete(statKey(handle));\n\t}\n\n\t/** Uniform sync-void invoke (R-sync-core / R-dispatch-all). */\n\tinvoke(handle: Handle, ctx: Ctx): void {\n\t\tif (!this._recording) {\n\t\t\tthis.pools[handle.poolId].invoke(handle.handleId, ctx);\n\t\t\treturn;\n\t\t}\n\t\tthis._totalInvokes++;\n\t\tconst t0 = performance.now();\n\t\ttry {\n\t\t\tthis.pools[handle.poolId].invoke(handle.handleId, ctx);\n\t\t} finally {\n\t\t\tconst dur = (performance.now() - t0) * 1e6; // ms → ns\n\t\t\tconst key = statKey(handle);\n\t\t\tconst s = this._stats.get(key) ?? {\n\t\t\t\tinvokes: 0,\n\t\t\t\ttotalDurationNs: 0,\n\t\t\t\tlastDurationNs: 0,\n\t\t\t};\n\t\t\ts.invokes++;\n\t\t\ts.lastDurationNs = dur;\n\t\t\ts.totalDurationNs += dur;\n\t\t\tthis._stats.set(key, s);\n\t\t}\n\t}\n\n\tpoolKind(poolId: number): PoolKind {\n\t\treturn this.pools[poolId].kind;\n\t}\n}\n\n/** The only global singleton (D26). Overridable by passing an explicit dispatcher. */\nexport const defaultDispatcher = new Dispatcher();\n","import type { Ctx, Sink } from \"../ctx/types.js\";\nimport type { Dispatcher, Handle } from \"../dispatcher/index.js\";\nimport type { EnvironmentDrivers } from \"../graph/environment.js\";\nimport { type LockId, type PullDemand, SENTINEL, type Wave } from \"../protocol/messages.js\";\nimport type { Node, Status } from \"./node.js\";\nimport type { NodeVersion, ResolvedNodeVersioningPolicy } from \"./versioning.js\";\n\nexport type NodeId = number & { readonly __nodeId: unique symbol };\n\nexport interface DepBookkeeping {\n\tbatch: Array<unknown[] | null>;\n\twaveData: unknown[][][];\n\twaveTokens: Array<object | undefined>;\n\tprev: unknown[];\n\thasData: boolean[];\n\tdirty: boolean[];\n\ttier: number[];\n\tterminal: Array<true | unknown | undefined>;\n\tterminalInput: Array<true | unknown | undefined>;\n\tunsubs: Array<() => void>;\n\tidxBoxes: Array<{ v: number }>;\n}\n\nexport interface ValueState<T> {\n\tcache: T | undefined;\n\thasData: boolean;\n\tstatus: Status;\n\tterminal: true | unknown | undefined;\n\thasTorndown: boolean;\n\treplayRing: T[];\n}\n\nexport interface VersionState {\n\tpolicy: ResolvedNodeVersioningPolicy;\n\tvalue: NodeVersion | undefined;\n}\n\nexport interface WaveState {\n\tpending: number;\n\thasCalledFnOnce: boolean;\n\temittedDirtyThisWave: boolean;\n\temittedSettleThisWave: boolean;\n\tinsideRunWave: boolean;\n\tinDepMutation: boolean;\n\trewireRunPending: boolean;\n\tbatchDirtyOwed: boolean;\n}\n\nexport interface ControlState {\n\tpauseLockset: Set<unknown>;\n\tpausedDepWaveOccurred: boolean;\n\tpauseBuffer: Wave[];\n\tdemandOwed: PullDemand | undefined;\n\tactivePull: PullDemand | undefined;\n\tpullDirtyOwed: boolean;\n\tinDeliverDemand: boolean;\n}\n\nexport interface PrivateState {\n\tvalue: unknown;\n\tpersist: boolean;\n}\n\nexport interface CleanupHooks {\n\tonDeactivation: Array<() => void>;\n\tonInvalidate: Array<() => void>;\n}\n\nexport interface SyncCtxState {\n\tvalue: Ctx | null;\n}\n\nexport interface LifecycleState {\n\tsubscribers: Set<Sink>;\n\tactivated: boolean;\n}\n\nexport interface BoundaryTask {\n\tapply: () => void;\n\tbatchToken?: object;\n\tisReady?: () => boolean;\n}\n\nexport interface BoundaryState {\n\tqueue: BoundaryTask[];\n\thead: number;\n}\n\nexport interface NodeSlot<_T> {\n\tid: NodeId;\n\tdeps: Node<unknown>[];\n\thandle: Handle | null;\n\tpool: \"sync\" | \"async\";\n\tdispatcher: Dispatcher;\n\tenvironment: EnvironmentDrivers;\n\tpartial: boolean;\n\tterminalAsRealInput: boolean;\n\tcompleteWhenDepsComplete: boolean;\n\terrorWhenDepsError: boolean;\n\tresubscribable: boolean;\n\tresetOnTeardown: boolean;\n\tpausable: boolean | \"resumeAll\";\n\tpull: boolean;\n\tpullLock: LockId | undefined;\n\treplayN: number;\n\tdynamic: boolean;\n\tname?: string;\n\tfactory?: string;\n}\n\nexport interface NodeState<T> {\n\tdep: DepBookkeeping;\n\tlifecycle: LifecycleState;\n\tvalue: ValueState<T>;\n\tversion: VersionState;\n\twave: WaveState;\n\tcontrol: ControlState;\n\tprivateState: PrivateState;\n\thooks: CleanupHooks;\n\tsyncCtx: SyncCtxState;\n}\n\nexport class NodeCore {\n\tprivate nextId = 0;\n\tprivate readonly slots: Array<NodeSlot<unknown> | undefined> = [];\n\tprivate readonly values: Array<ValueState<unknown> | undefined> = [];\n\tprivate readonly waves: Array<WaveState | undefined> = [];\n\tprivate readonly controls: Array<ControlState | undefined> = [];\n\tprivate readonly lifecycles: Array<LifecycleState | undefined> = [];\n\tprivate readonly depStates: Array<DepBookkeeping | undefined> = [];\n\tprivate readonly privateStates: Array<PrivateState | undefined> = [];\n\tprivate readonly hooks: Array<CleanupHooks | undefined> = [];\n\tprivate readonly syncCtxs: Array<SyncCtxState | undefined> = [];\n\tprivate readonly versionStates: Array<VersionState | undefined> = [];\n\tprivate readonly boundary: BoundaryState = { queue: [], head: 0 };\n\n\tcreateSlot<T>(\n\t\tslot: Omit<NodeSlot<T>, \"id\">,\n\t\tstate: NodeState<T>,\n\t): { id: NodeId; slot: NodeSlot<T> } {\n\t\tconst id = this.nextId++ as NodeId;\n\t\tconst full = { ...slot, id };\n\t\tthis.slots[id] = full as NodeSlot<unknown>;\n\t\tthis.depStates[id] = state.dep;\n\t\tthis.lifecycles[id] = state.lifecycle;\n\t\tthis.values[id] = state.value as ValueState<unknown>;\n\t\tthis.waves[id] = state.wave;\n\t\tthis.controls[id] = state.control;\n\t\tthis.privateStates[id] = state.privateState;\n\t\tthis.hooks[id] = state.hooks;\n\t\tthis.syncCtxs[id] = state.syncCtx;\n\t\tthis.versionStates[id] = state.version;\n\t\treturn { id, slot: full };\n\t}\n\n\tget<T>(id: NodeId): NodeSlot<T> {\n\t\tconst slot = this.slots[id];\n\t\tif (slot === undefined) throw new Error(\"NodeCore: unknown node slot\");\n\t\treturn slot as NodeSlot<T>;\n\t}\n\n\tgetValue<T>(id: NodeId): ValueState<T> {\n\t\tconst value = this.values[id];\n\t\tif (value === undefined) throw new Error(\"NodeCore: unknown node value state\");\n\t\treturn value as ValueState<T>;\n\t}\n\n\tgetWave(id: NodeId): WaveState {\n\t\tconst wave = this.waves[id];\n\t\tif (wave === undefined) throw new Error(\"NodeCore: unknown node wave state\");\n\t\treturn wave;\n\t}\n\n\tgetControl(id: NodeId): ControlState {\n\t\tconst control = this.controls[id];\n\t\tif (control === undefined) throw new Error(\"NodeCore: unknown node control state\");\n\t\treturn control;\n\t}\n\n\tgetLifecycle(id: NodeId): LifecycleState {\n\t\tconst lifecycle = this.lifecycles[id];\n\t\tif (lifecycle === undefined) throw new Error(\"NodeCore: unknown node lifecycle state\");\n\t\treturn lifecycle;\n\t}\n\n\tgetDep(id: NodeId): DepBookkeeping {\n\t\tconst dep = this.depStates[id];\n\t\tif (dep === undefined) throw new Error(\"NodeCore: unknown node dep state\");\n\t\treturn dep;\n\t}\n\n\tgetPrivateState(id: NodeId): PrivateState {\n\t\tconst state = this.privateStates[id];\n\t\tif (state === undefined) throw new Error(\"NodeCore: unknown node private state\");\n\t\treturn state;\n\t}\n\n\tgetHooks(id: NodeId): CleanupHooks {\n\t\tconst hooks = this.hooks[id];\n\t\tif (hooks === undefined) throw new Error(\"NodeCore: unknown node cleanup hooks\");\n\t\treturn hooks;\n\t}\n\n\tgetSyncCtx(id: NodeId): SyncCtxState {\n\t\tconst state = this.syncCtxs[id];\n\t\tif (state === undefined) throw new Error(\"NodeCore: unknown node ctx state\");\n\t\treturn state;\n\t}\n\n\tgetVersion(id: NodeId): VersionState {\n\t\tconst state = this.versionStates[id];\n\t\tif (state === undefined) throw new Error(\"NodeCore: unknown node version state\");\n\t\treturn state;\n\t}\n\n\t/** @internal D122: release graph-owned ephemeral node runtime state from core retention. */\n\treleaseSlot(id: NodeId): void {\n\t\tthis.slots[id] = undefined;\n\t\tthis.depStates[id] = undefined;\n\t\tthis.lifecycles[id] = undefined;\n\t\tthis.values[id] = undefined;\n\t\tthis.waves[id] = undefined;\n\t\tthis.controls[id] = undefined;\n\t\tthis.privateStates[id] = undefined;\n\t\tthis.hooks[id] = undefined;\n\t\tthis.syncCtxs[id] = undefined;\n\t\tthis.versionStates[id] = undefined;\n\t}\n\n\t/** @internal B49: graph-local deferred-boundary queue (rewireNext/upNext/batch-after-commit). */\n\tenqueueBoundaryTask(task: BoundaryTask): void {\n\t\tthis.boundary.queue.push(task);\n\t}\n\n\t/** @internal */\n\thasBoundaryTasks(): boolean {\n\t\treturn this.boundary.head < this.boundary.queue.length;\n\t}\n\n\t/** @internal */\n\tboundaryTaskCount(): number {\n\t\treturn this.boundary.queue.length - this.boundary.head;\n\t}\n\n\t/** @internal */\n\tshiftBoundaryTask(): BoundaryTask | undefined {\n\t\tif (!this.hasBoundaryTasks()) {\n\t\t\tthis.boundary.queue = [];\n\t\t\tthis.boundary.head = 0;\n\t\t\treturn undefined;\n\t\t}\n\t\tconst task = this.boundary.queue[this.boundary.head++];\n\t\tif (!this.hasBoundaryTasks()) {\n\t\t\tthis.boundary.queue = [];\n\t\t\tthis.boundary.head = 0;\n\t\t}\n\t\treturn task;\n\t}\n\n\t/** @internal Put a not-yet-ready task back at this core's FIFO head. */\n\tunshiftBoundaryTask(task: BoundaryTask): void {\n\t\tconst remaining = this.boundary.queue.slice(this.boundary.head);\n\t\tthis.boundary.queue = [task, ...remaining];\n\t\tthis.boundary.head = 0;\n\t}\n\n\t/** @internal D110: discard all pending tasks caused by an uncommitted batch. */\n\tdropBoundaryTasksForBatch(batchToken: object): void {\n\t\tconst remaining = this.boundary.queue\n\t\t\t.slice(this.boundary.head)\n\t\t\t.filter((task) => task.batchToken !== batchToken);\n\t\tthis.boundary.queue = remaining;\n\t\tthis.boundary.head = 0;\n\t}\n}\n\nexport function makeDepBookkeeping(depCount: number): DepBookkeeping {\n\treturn {\n\t\tbatch: new Array(depCount).fill(null),\n\t\twaveData: Array.from({ length: depCount }, () => []),\n\t\twaveTokens: new Array(depCount).fill(undefined),\n\t\tprev: new Array(depCount).fill(SENTINEL),\n\t\thasData: new Array(depCount).fill(false),\n\t\tdirty: new Array(depCount).fill(false),\n\t\ttier: new Array(depCount).fill(0),\n\t\tterminal: new Array(depCount).fill(undefined),\n\t\tterminalInput: new Array(depCount).fill(undefined),\n\t\tunsubs: [],\n\t\tidxBoxes: [],\n\t};\n}\n","/**\n * Graph-owned environment driver bag (D130/D131).\n *\n * Drivers host process/network/messaging/runtime boundary work outside the synchronous wave core.\n * The bag is graph-local and is read from ctx by source/adapter bodies.\n */\n\nexport type DriverCancel = () => void;\n\nexport type DriverResult<T> =\n\t| { readonly ok: true; readonly value: T }\n\t| { readonly ok: false; readonly error: unknown };\n\nexport interface ProcessCommand {\n\treadonly program: string;\n\treadonly args: readonly string[];\n\treadonly cwd?: string;\n\treadonly env?: readonly (readonly [string, string])[];\n}\n\nexport interface ProcessResult {\n\treadonly stdout: string;\n\treadonly stderr: string;\n\treadonly exitCode: number | null;\n\treadonly signal: string | null;\n}\n\nexport interface HttpRequest {\n\treadonly method: string;\n\treadonly url: string;\n\treadonly headers?: readonly (readonly [string, string])[];\n\treadonly body?: Uint8Array | string;\n}\n\nexport interface HttpResponse {\n\treadonly status: number;\n\treadonly headers: readonly (readonly [string, string])[];\n\treadonly body: Uint8Array;\n}\n\nexport interface SseRequest {\n\treadonly url: string;\n\treadonly headers?: readonly (readonly [string, string])[];\n}\n\nexport interface SseEvent {\n\treadonly event?: string;\n\treadonly data: string;\n\treadonly id?: string;\n\treadonly retryMs?: number;\n}\n\nexport type SseDriverEvent =\n\t| { readonly kind: \"event\"; readonly event: SseEvent }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"complete\" };\n\nexport interface WebSocketRequest {\n\treadonly url: string;\n\treadonly headers?: readonly (readonly [string, string])[];\n}\n\nexport type WebSocketEvent =\n\t| { readonly kind: \"open\" }\n\t| { readonly kind: \"text\"; readonly data: string }\n\t| { readonly kind: \"binary\"; readonly data: Uint8Array }\n\t| { readonly kind: \"close\"; readonly code?: number; readonly reason?: string };\n\nexport interface WebSocketSend {\n\treadonly data: string | Uint8Array;\n}\n\nexport interface WebSocketSendResult {\n\treadonly sent: true;\n}\n\n/** Live WebSocket session handle for D133 SessionBundle adapters. */\nexport interface WebSocketSessionHandle {\n\tsend(\n\t\tmessage: WebSocketSend,\n\t\tcallback: (result: DriverResult<WebSocketSendResult>) => void,\n\t): DriverCancel;\n\tclose(code?: number, reason?: string): void;\n\tcancel(): void;\n}\n\nexport type WebSocketDriverEvent =\n\t| { readonly kind: \"event\"; readonly event: WebSocketEvent }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"complete\" };\n\nexport interface WebhookRegistration {\n\treadonly id: string;\n\treadonly method?: string;\n\treadonly path?: string;\n}\n\nexport interface WebhookEvent {\n\treadonly registrationId: string;\n\treadonly method: string;\n\treadonly path: string;\n\treadonly headers: readonly (readonly [string, string])[];\n\treadonly query: readonly (readonly [string, string])[];\n\treadonly body: Uint8Array;\n}\n\nexport type WebhookDriverEvent =\n\t| { readonly kind: \"event\"; readonly event: WebhookEvent }\n\t| { readonly kind: \"error\"; readonly error: unknown }\n\t| { readonly kind: \"complete\" };\n\nexport interface LocalProcessDriver {\n\trun(\n\t\tcommand: ProcessCommand,\n\t\tcallback: (result: DriverResult<ProcessResult>) => void,\n\t): DriverCancel;\n}\n\nexport interface LocalHttpDriver {\n\trequest(\n\t\trequest: HttpRequest,\n\t\tcallback: (result: DriverResult<HttpResponse>) => void,\n\t): DriverCancel;\n}\n\nexport interface LocalSseDriver {\n\tconnect(request: SseRequest, callback: (event: SseDriverEvent) => void): DriverCancel;\n}\n\nexport interface LocalWebSocketDriver {\n\tconnect(request: WebSocketRequest, callback: (event: WebSocketDriverEvent) => void): DriverCancel;\n\tsend?(\n\t\trequest: WebSocketRequest,\n\t\tmessage: WebSocketSend,\n\t\tcallback: (result: DriverResult<WebSocketSendResult>) => void,\n\t): DriverCancel;\n\t/** Open a live bidirectional session; unlike send(), outbound messages use this same connection. */\n\tconnectSession?(\n\t\trequest: WebSocketRequest,\n\t\tcallback: (event: WebSocketDriverEvent) => void,\n\t): WebSocketSessionHandle;\n}\n\nexport interface LocalWebhookDriver {\n\tregister(\n\t\tregistration: WebhookRegistration,\n\t\tcallback: (event: WebhookDriverEvent) => void,\n\t): DriverCancel;\n}\n\nexport interface FetchResponseLike {\n\treadonly status: number;\n\treadonly headers?: { forEach?(fn: (value: string, key: string) => void): void };\n\tarrayBuffer(): PromiseLike<ArrayBuffer>;\n}\n\nexport type FetchLike = (\n\turl: string,\n\tinit?: {\n\t\treadonly method?: string;\n\t\treadonly headers?: readonly (readonly [string, string])[];\n\t\treadonly body?: Uint8Array | string;\n\t\treadonly signal?: AbortSignal;\n\t},\n) => PromiseLike<FetchResponseLike>;\n\nexport interface WebSocketLike {\n\tsend(data: string | Uint8Array): void;\n\tclose(code?: number, reason?: string): void;\n\taddEventListener(\n\t\ttype: \"open\" | \"message\" | \"error\" | \"close\",\n\t\tlistener: (event: unknown) => void,\n\t): void;\n\tremoveEventListener(\n\t\ttype: \"open\" | \"message\" | \"error\" | \"close\",\n\t\tlistener: (event: unknown) => void,\n\t): void;\n}\n\nexport type WebSocketConstructorLike = new (url: string) => WebSocketLike;\n\nexport interface EnvironmentDriversInit {\n\treadonly process?: LocalProcessDriver;\n\treadonly http?: LocalHttpDriver;\n\treadonly sse?: LocalSseDriver;\n\treadonly websocket?: LocalWebSocketDriver;\n\treadonly webhook?: LocalWebhookDriver;\n}\n\nexport class EnvironmentDrivers {\n\treadonly process?: LocalProcessDriver;\n\treadonly http?: LocalHttpDriver;\n\treadonly sse?: LocalSseDriver;\n\treadonly websocket?: LocalWebSocketDriver;\n\treadonly webhook?: LocalWebhookDriver;\n\n\tconstructor(init: EnvironmentDriversInit = {}) {\n\t\tthis.process = init.process;\n\t\tthis.http = init.http;\n\t\tthis.sse = init.sse;\n\t\tthis.websocket = init.websocket;\n\t\tthis.webhook = init.webhook;\n\t\tObject.freeze(this);\n\t}\n\n\tstatic empty(): EnvironmentDrivers {\n\t\treturn EMPTY_ENVIRONMENT;\n\t}\n\n\twithProcess(driver: LocalProcessDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, process: driver });\n\t}\n\n\twithHttp(driver: LocalHttpDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, http: driver });\n\t}\n\n\twithSse(driver: LocalSseDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, sse: driver });\n\t}\n\n\twithWebSocket(driver: LocalWebSocketDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, websocket: driver });\n\t}\n\n\twithWebhook(driver: LocalWebhookDriver): EnvironmentDrivers {\n\t\treturn new EnvironmentDrivers({ ...this, webhook: driver });\n\t}\n\n\tprocessDriver(): LocalProcessDriver | undefined {\n\t\treturn this.process;\n\t}\n\n\thttpDriver(): LocalHttpDriver | undefined {\n\t\treturn this.http;\n\t}\n\n\tsseDriver(): LocalSseDriver | undefined {\n\t\treturn this.sse;\n\t}\n\n\twebSocketDriver(): LocalWebSocketDriver | undefined {\n\t\treturn this.websocket;\n\t}\n\n\twebhookDriver(): LocalWebhookDriver | undefined {\n\t\treturn this.webhook;\n\t}\n}\n\nconst EMPTY_ENVIRONMENT = new EnvironmentDrivers();\n\nexport function fetchHttpDriver(fetchFn: FetchLike = requireGlobalFetch()): LocalHttpDriver {\n\treturn {\n\t\trequest(request, callback) {\n\t\t\tconst controller = new AbortController();\n\t\t\tvoid Promise.resolve(\n\t\t\t\tfetchFn(request.url, {\n\t\t\t\t\tmethod: request.method,\n\t\t\t\t\theaders: request.headers,\n\t\t\t\t\tbody: request.body,\n\t\t\t\t\tsignal: controller.signal,\n\t\t\t\t}),\n\t\t\t).then(\n\t\t\t\tasync (response) => {\n\t\t\t\t\tconst headers: Array<readonly [string, string]> = [];\n\t\t\t\t\tresponse.headers?.forEach?.((value, key) => {\n\t\t\t\t\t\theaders.push([key, value]);\n\t\t\t\t\t});\n\t\t\t\t\tconst body = new Uint8Array(await response.arrayBuffer());\n\t\t\t\t\tcallback({ ok: true, value: { status: response.status, headers, body } });\n\t\t\t\t},\n\t\t\t\t(error) => callback({ ok: false, error }),\n\t\t\t);\n\t\t\treturn () => controller.abort();\n\t\t},\n\t};\n}\n\nexport function domWebSocketDriver(\n\tWebSocketCtor: WebSocketConstructorLike = requireGlobalWebSocket(),\n): LocalWebSocketDriver {\n\treturn {\n\t\tconnect(request, callback) {\n\t\t\tconst socket = new WebSocketCtor(request.url);\n\t\t\tconst onOpen = () => callback({ kind: \"event\", event: { kind: \"open\" } });\n\t\t\tconst onMessage = (event: unknown) => {\n\t\t\t\tconst data = (event as { data?: unknown }).data;\n\t\t\t\tif (typeof data === \"string\") callback({ kind: \"event\", event: { kind: \"text\", data } });\n\t\t\t\telse if (data instanceof Uint8Array) {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"binary\", data } });\n\t\t\t\t} else {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"text\", data: String(data ?? \"\") } });\n\t\t\t\t}\n\t\t\t};\n\t\t\tconst onError = (event: unknown) => callback({ kind: \"error\", error: event });\n\t\t\tconst onClose = (event: unknown) => {\n\t\t\t\tconst close = event as { code?: number; reason?: string };\n\t\t\t\tcallback({\n\t\t\t\t\tkind: \"event\",\n\t\t\t\t\tevent: { kind: \"close\", code: close.code, reason: close.reason },\n\t\t\t\t});\n\t\t\t\tcallback({ kind: \"complete\" });\n\t\t\t};\n\t\t\tsocket.addEventListener(\"open\", onOpen);\n\t\t\tsocket.addEventListener(\"message\", onMessage);\n\t\t\tsocket.addEventListener(\"error\", onError);\n\t\t\tsocket.addEventListener(\"close\", onClose);\n\t\t\treturn () => {\n\t\t\t\tsocket.removeEventListener(\"open\", onOpen);\n\t\t\t\tsocket.removeEventListener(\"message\", onMessage);\n\t\t\t\tsocket.removeEventListener(\"error\", onError);\n\t\t\t\tsocket.removeEventListener(\"close\", onClose);\n\t\t\t\tsocket.close();\n\t\t\t};\n\t\t},\n\t\tsend(request, message, callback) {\n\t\t\tconst socket = new WebSocketCtor(request.url);\n\t\t\tlet settled = false;\n\t\t\tconst finish = (result: DriverResult<WebSocketSendResult>) => {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\tcallback(result);\n\t\t\t\tsocket.close();\n\t\t\t};\n\t\t\tconst onOpen = () => {\n\t\t\t\ttry {\n\t\t\t\t\tsocket.send(message.data);\n\t\t\t\t\tfinish({ ok: true, value: { sent: true } });\n\t\t\t\t} catch (error) {\n\t\t\t\t\tfinish({ ok: false, error });\n\t\t\t\t}\n\t\t\t};\n\t\t\tconst onError = (event: unknown) => finish({ ok: false, error: event });\n\t\t\tsocket.addEventListener(\"open\", onOpen);\n\t\t\tsocket.addEventListener(\"error\", onError);\n\t\t\treturn () => {\n\t\t\t\tsettled = true;\n\t\t\t\tsocket.removeEventListener(\"open\", onOpen);\n\t\t\t\tsocket.removeEventListener(\"error\", onError);\n\t\t\t\tsocket.close();\n\t\t\t};\n\t\t},\n\t\tconnectSession(request, callback) {\n\t\t\tconst socket = new WebSocketCtor(request.url);\n\t\t\tlet active = true;\n\t\t\tconst onOpen = () => callback({ kind: \"event\", event: { kind: \"open\" } });\n\t\t\tconst onMessage = (event: unknown) => {\n\t\t\t\tconst data = (event as { data?: unknown }).data;\n\t\t\t\tif (typeof data === \"string\") callback({ kind: \"event\", event: { kind: \"text\", data } });\n\t\t\t\telse if (data instanceof Uint8Array) {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"binary\", data } });\n\t\t\t\t} else {\n\t\t\t\t\tcallback({ kind: \"event\", event: { kind: \"text\", data: String(data ?? \"\") } });\n\t\t\t\t}\n\t\t\t};\n\t\t\tconst onError = (event: unknown) => callback({ kind: \"error\", error: event });\n\t\t\tconst onClose = (event: unknown) => {\n\t\t\t\tconst close = event as { code?: number; reason?: string };\n\t\t\t\tcallback({\n\t\t\t\t\tkind: \"event\",\n\t\t\t\t\tevent: { kind: \"close\", code: close.code, reason: close.reason },\n\t\t\t\t});\n\t\t\t\tcallback({ kind: \"complete\" });\n\t\t\t};\n\t\t\tconst removeListeners = () => {\n\t\t\t\tsocket.removeEventListener(\"open\", onOpen);\n\t\t\t\tsocket.removeEventListener(\"message\", onMessage);\n\t\t\t\tsocket.removeEventListener(\"error\", onError);\n\t\t\t\tsocket.removeEventListener(\"close\", onClose);\n\t\t\t};\n\t\t\tsocket.addEventListener(\"open\", onOpen);\n\t\t\tsocket.addEventListener(\"message\", onMessage);\n\t\t\tsocket.addEventListener(\"error\", onError);\n\t\t\tsocket.addEventListener(\"close\", onClose);\n\t\t\treturn {\n\t\t\t\tsend(message, sendCallback) {\n\t\t\t\t\tlet canceled = false;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tsocket.send(message.data);\n\t\t\t\t\t\tif (!canceled) sendCallback({ ok: true, value: { sent: true } });\n\t\t\t\t\t} catch (error) {\n\t\t\t\t\t\tif (!canceled) sendCallback({ ok: false, error });\n\t\t\t\t\t}\n\t\t\t\t\treturn () => {\n\t\t\t\t\t\tcanceled = true;\n\t\t\t\t\t};\n\t\t\t\t},\n\t\t\t\tclose(code, reason) {\n\t\t\t\t\tif (!active) return;\n\t\t\t\t\tsocket.close(code, reason);\n\t\t\t\t},\n\t\t\t\tcancel() {\n\t\t\t\t\tif (!active) return;\n\t\t\t\t\tactive = false;\n\t\t\t\t\tremoveListeners();\n\t\t\t\t\tsocket.close();\n\t\t\t\t},\n\t\t\t};\n\t\t},\n\t};\n}\n\nfunction requireGlobalFetch(): FetchLike {\n\tconst fetchFn = (globalThis as { fetch?: FetchLike }).fetch;\n\tif (fetchFn === undefined) throw new Error(\"fetchHttpDriver: global fetch is not available\");\n\treturn fetchFn;\n}\n\nfunction requireGlobalWebSocket(): WebSocketConstructorLike {\n\tconst ctor = (globalThis as { WebSocket?: WebSocketConstructorLike }).WebSocket;\n\tif (ctor === undefined) throw new Error(\"domWebSocketDriver: global WebSocket is not available\");\n\treturn ctor;\n}\n","import { isInvalidErrorPayload, type PullDemand, type Wave } from \"../protocol/messages.js\";\n\nexport function terminalView(t: unknown): unknown {\n\treturn t === undefined ? false : t;\n}\n\nexport function normalizePullDemand(demand: PullDemand): PullDemand {\n\tif (typeof demand !== \"object\" || demand === null || Array.isArray(demand)) {\n\t\tthrow new Error(\"ctx.up: PULL requires { pullId, params? } demand payload (D269)\");\n\t}\n\tconst pullId = (demand as { pullId?: unknown }).pullId;\n\tif (typeof pullId !== \"string\" && typeof pullId !== \"symbol\") {\n\t\tthrow new Error(\"ctx.up: PULL demand requires a string or symbol pullId (D269)\");\n\t}\n\tconst params = (demand as { params?: unknown }).params;\n\treturn params === undefined ? { pullId } : { pullId, params };\n}\n\nexport function validateDownPayloads(msgs: Wave): void {\n\tfor (const m of msgs) {\n\t\tif (m[0] === \"DATA\" && m[1] === undefined) {\n\t\t\tthrow new Error(\"down: DATA requires a non-SENTINEL payload (R-data-payload)\");\n\t\t}\n\t\tif (m[0] === \"ERROR\" && isInvalidErrorPayload(m[1])) {\n\t\t\tthrow new Error(\"down: ERROR requires a non-SENTINEL, non-boolean payload (R-data-payload)\");\n\t\t}\n\t}\n}\n","import type { EnvironmentDrivers } from \"../graph/environment.js\";\nimport type { NodeCore } from \"./core.js\";\nimport type { Node } from \"./node.js\";\nimport type { NodeCheckpointState, NodeRestoreState } from \"./types.js\";\n\ntype TopologyDepsChangedObserver = (\n\tnode: Node<unknown>,\n\tprevDeps: readonly Node<unknown>[],\n\tdeps: readonly Node<unknown>[],\n) => void;\n\nlet constructingCore: NodeCore | undefined;\nlet constructingEnvironment: EnvironmentDrivers | undefined;\nexport const ownerTokens = new WeakMap<Node<unknown>, unknown>();\nexport const topologyDepsChangedObservers = new WeakMap<\n\tNode<unknown>,\n\tTopologyDepsChangedObserver\n>();\nexport const checkpointReaders = new WeakMap<Node<unknown>, () => NodeCheckpointState>();\nexport const restoreWriters = new WeakMap<Node<unknown>, (state: NodeRestoreState) => void>();\nexport const runtimeReleasers = new WeakMap<Node<unknown>, () => void>();\nexport const runtimeQuiescenceReaders = new WeakMap<Node<unknown>, () => boolean>();\nexport const subscriberCountReaders = new WeakMap<Node<unknown>, () => number>();\nexport const activationReaders = new WeakMap<Node<unknown>, () => boolean>();\nexport const releasedNodes = new WeakSet<Node<unknown>>();\n\n/** @internal Run a Node/StateNode constructor against a graph-local core without widening the public constructor. */\nexport function withNodeCore<TNode extends Node<unknown>>(\n\tcore: NodeCore,\n\tcreate: () => TNode,\n): TNode {\n\tconst prev = constructingCore;\n\tconstructingCore = core;\n\ttry {\n\t\treturn create();\n\t} finally {\n\t\tconstructingCore = prev;\n\t}\n}\n\n/** @internal Consume the graph-local NodeCore staged by withNodeCore. */\nexport function takeConstructingNodeCore(): NodeCore | undefined {\n\tconst core = constructingCore;\n\tconstructingCore = undefined;\n\treturn core;\n}\n\n/** @internal Run a Node/StateNode constructor with graph-owned environment drivers (D130/D131). */\nexport function withEnvironmentDrivers<TNode extends Node<unknown>>(\n\tenvironment: EnvironmentDrivers,\n\tcreate: () => TNode,\n): TNode {\n\tconst prev = constructingEnvironment;\n\tconstructingEnvironment = environment;\n\ttry {\n\t\treturn create();\n\t} finally {\n\t\tconstructingEnvironment = prev;\n\t}\n}\n\n/** @internal Consume graph-owned environment drivers staged by withEnvironmentDrivers. */\nexport function takeConstructingEnvironmentDrivers(): EnvironmentDrivers | undefined {\n\tconst environment = constructingEnvironment;\n\tconstructingEnvironment = undefined;\n\treturn environment;\n}\n\n/** @internal Graph-domain ownership token for D22 intra-graph guards. */\nexport function getNodeOwner(n: Node<unknown>): unknown {\n\treturn ownerTokens.get(n);\n}\n\n/** @internal Assign graph-domain ownership after graph registration. */\nexport function setNodeOwner(n: Node<unknown>, owner: unknown): void {\n\townerTokens.set(n, owner);\n}\n\n/** @internal Graph-layer D145 topology egress hook. */\nexport function setNodeTopologyDepsChangedObserver(\n\tn: Node<unknown>,\n\tobserver: TopologyDepsChangedObserver,\n): void {\n\ttopologyDepsChangedObservers.set(n, observer);\n}\n\nexport function notifyTopologyDepsChanged(\n\tnode: Node<unknown>,\n\tprevDeps: readonly Node<unknown>[],\n\tdeps: readonly Node<unknown>[],\n): void {\n\ttopologyDepsChangedObservers.get(node)?.(node, prevDeps, deps);\n}\n\n/** @internal Graph checkpoint inspection, kept as a module helper so Node stays method-thin. */\nexport function checkpointStateOfNode(n: Node<unknown>): NodeCheckpointState {\n\tconst read = checkpointReaders.get(n);\n\tif (read === undefined) throw new Error(\"checkpoint: unknown node state\");\n\treturn read();\n}\n\n/** @internal D94 restore commit: install runtime state without a protocol wave or subscription. */\nexport function restoreStateOfNode(n: Node<unknown>, state: NodeRestoreState): void {\n\tconst write = restoreWriters.get(n);\n\tif (write === undefined) throw new Error(\"restoreGraph: unknown node state\");\n\twrite(state);\n}\n\n/** @internal D122 graph-owned ephemeral lifecycle release. */\nexport function releaseRuntimeOfNode(n: Node<unknown>): void {\n\truntimeReleasers.get(n)?.();\n}\n\n/** @internal D124 guard for graph-owned ephemeral lifecycle release. */\nexport function isNodeRuntimeQuiescentForRelease(n: Node<unknown>): boolean {\n\treturn runtimeQuiescenceReaders.get(n)?.() ?? false;\n}\n\n/** @internal D124 graph-owned release subscriber accounting. */\nexport function subscriberCountOfNode(n: Node<unknown>): number {\n\treturn subscriberCountReaders.get(n)?.() ?? 0;\n}\n\n/** @internal D124 graph-owned release internal-subscriber accounting. */\nexport function isNodeActiveForRelease(n: Node<unknown>): boolean {\n\treturn activationReaders.get(n)?.() ?? false;\n}\n\n/** @internal D122 guard for graph-owned ephemeral lifecycle release. */\nexport function isNodeRuntimeReleased(n: Node<unknown>): boolean {\n\treturn releasedNodes.has(n);\n}\n","import { enterWave, exitWave } from \"../batch/boundary.js\";\nimport {\n\tCTX_DEP_CACHE,\n\tCTX_NODE_BINDING,\n\ttype Ctx,\n\ttype CtxState,\n\ttype TerminalData,\n\ttype WaveData,\n} from \"../ctx/types.js\";\nimport type { PullDemand } from \"../protocol/messages.js\";\nimport type { Node } from \"./node.js\";\nimport type { NodeRuntimeHost } from \"./node-runtime-host.js\";\nimport { terminalView } from \"./protocol-guards.js\";\nimport { withEnvironmentDrivers, withNodeCore } from \"./runtime-accessors.js\";\n\nexport function nodeBuildCtx<T>(self: NodeRuntimeHost<T>): Ctx {\n\tconst kind = self._slot.handle\n\t\t? self._slot.dispatcher.poolKind(self._slot.handle.poolId)\n\t\t: \"sync\";\n\tif (kind === \"sync\") {\n\t\tif (self._syncCtx === null) self._syncCtx = self._makeCtx();\n\t\tself._refreshCtx(self._syncCtx);\n\t\treturn self._syncCtx;\n\t}\n\t// async: snapshot dep inputs so a deferred late-emit reads this wave's view.\n\treturn self._makeCtx({\n\t\twaveData: self._dep.waveData.map((waves) => waves.map((w) => [...w])),\n\t\tterminal: self._dep.terminalInput.map(terminalView),\n\t\tlatest: [...self._dep.prev],\n\t});\n}\n\nexport function nodeMakeCtx<T>(\n\tself: NodeRuntimeHost<T>,\n\tsnapshot?: { waveData: unknown[][][]; terminal: unknown[]; latest: unknown[] },\n): Ctx {\n\tconst ctx: Ctx = {\n\t\t// Wave-owner boundary (D47): a SYNC fn's emit nests under the public entry that drove\n\t\t// it (cheap inc/dec, no early drain); an ASYNC-pool fn re-enters here from its stashed\n\t\t// ctx at depth 0, so this is the boundary that drains any rewireNext it issued.\n\t\tup: (msgs, towardDep) => {\n\t\t\tif (self._released) return;\n\t\t\tenterWave();\n\t\t\ttry {\n\t\t\t\tself._up(msgs, towardDep);\n\t\t\t} finally {\n\t\t\t\texitWave();\n\t\t\t}\n\t\t},\n\t\tdown: (msgs) => {\n\t\t\tif (self._released) return;\n\t\t\tenterWave();\n\t\t\ttry {\n\t\t\t\tself._down(msgs);\n\t\t\t} finally {\n\t\t\t\texitWave();\n\t\t\t}\n\t\t},\n\t\twaveData: snapshot?.waveData ?? self._dep.waveData,\n\t\tterminal: snapshot?.terminal ?? self._dep.terminalInput.map(terminalView),\n\t\tstate: self._makeState(),\n\t\tonDeactivation: (fn) => {\n\t\t\tif (self._released) return;\n\t\t\tself._hooks.onDeactivation.push(fn);\n\t\t},\n\t\tonInvalidate: (fn) => {\n\t\t\tif (self._released) return;\n\t\t\tself._hooks.onInvalidate.push(fn);\n\t\t},\n\t\tenvironment: () => self._slot.environment,\n\t\t// R-rewire-deferred (D47): defer a self-dep-set mutation to the committed boundary.\n\t\trewireNext: {\n\t\t\tsubscribeDep: (dep, fn) => self._requestRewireNext({ kind: \"add\", dep, fn }),\n\t\t\tunsubscribeDep: (dep, fn) => self._requestRewireNext({ kind: \"remove\", dep, fn }),\n\t\t\treplaceDeps: (deps, fn) => self._requestRewireNext({ kind: \"set\", deps, fn }),\n\t\t},\n\t\t// R-up-routing / R-pull (D269): deferred up — route a control/demand wave (e.g. PULL)\n\t\t// up the declared cone at the committed boundary. The SELF-demand path: an\n\t\t// immediate ctx.up whose delivery loops back re-enters this fn (D37 / R-reentrancy).\n\t\tupNext: (msgs, towardDep) => self._requestUpNext(msgs, towardDep),\n\t\t...(self._control.activePull === undefined ? {} : { pull: self._control.activePull }),\n\t\t[CTX_DEP_CACHE]: { latest: snapshot?.latest ?? self._dep.prev },\n\t\t[CTX_NODE_BINDING]: {\n\t\t\tdispatcher: self._slot.dispatcher,\n\t\t\tcreate: <U>(factory: () => Node<U>) =>\n\t\t\t\twithEnvironmentDrivers(self._slot.environment, () => withNodeCore(self._core, factory)),\n\t\t},\n\t};\n\tif (self._slot.dynamic) {\n\t\t// R-dynamic-node: read a dep's latest by index. Untracked deps still drive waves and\n\t\t// re-run the fn; under D49 (no equals-substitution) the fn re-emits its current value\n\t\t// as DATA — to suppress redundant downstream propagation, pair with distinctUntilChanged.\n\t\tctx.track = (i: number) => ctx[CTX_DEP_CACHE]?.latest[i];\n\t}\n\treturn ctx;\n}\n\nexport function nodeRefreshCtx<T>(self: NodeRuntimeHost<T>, ctx: Ctx): void {\n\t(ctx as { waveData: WaveData }).waveData = self._dep.waveData;\n\t(ctx as { terminal: TerminalData }).terminal = self._dep.terminalInput.map(terminalView);\n\tif (self._control.activePull === undefined) {\n\t\tdelete (ctx as { pull?: PullDemand }).pull;\n\t} else {\n\t\t(ctx as { pull?: PullDemand }).pull = self._control.activePull;\n\t}\n\tctx[CTX_DEP_CACHE] = { latest: self._dep.prev };\n}\n\nexport function nodeMakeState<T>(self: NodeRuntimeHost<T>): CtxState {\n\treturn {\n\t\tget: <S>() => self._privateState.value as S | undefined,\n\t\tset: <S>(v: S) => {\n\t\t\tself._privateState.value = v;\n\t\t},\n\t\tpersist: (on = true) => {\n\t\t\tself._privateState.persist = on;\n\t\t},\n\t};\n}\n","import type { DeliveryMeta } from \"../ctx/types.js\";\nimport type { Handle } from \"../dispatcher/index.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport { isTerminal, SENTINEL } from \"../protocol/messages.js\";\nimport type { NodeRuntimeHost } from \"./node-runtime-host.js\";\n\nexport function nodeRecordDepProjection<T>(\n\tself: NodeRuntimeHost<T>,\n\tidx: number,\n\tdelivery: DeliveryMeta | undefined,\n): unknown[] {\n\tconst token = delivery?.wave ?? {};\n\tif (self._dep.waveTokens[idx] !== token) {\n\t\tself._dep.waveData[idx].push([]);\n\t\tself._dep.waveTokens[idx] = token;\n\t}\n\treturn self._dep.waveData[idx][self._dep.waveData[idx].length - 1];\n}\n\nexport function nodeDepProjectionHasData<T>(self: NodeRuntimeHost<T>, idx: number): boolean {\n\tconst projection = self._dep.waveData[idx][self._dep.waveData[idx].length - 1];\n\treturn projection?.some((v) => v !== SENTINEL) ?? false;\n}\n\nexport function nodeReceiveFromDep<T>(\n\tself: NodeRuntimeHost<T>,\n\tidx: number,\n\tmsg: Message,\n\tdelivery?: DeliveryMeta,\n): void {\n\tif (self._released) return;\n\tconst t = msg[0];\n\tif (t === \"START\") return;\n\tconst isLastInDeliveredWave = delivery?.last ?? true;\n\t// Terminal-is-forever, except terminal intermediates still relay upstream TEARDOWN\n\t// downstream for lifecycle unwire (R-teardown-terminal-relay / D65).\n\tif (self._value.terminal !== undefined) {\n\t\tif (t === \"TEARDOWN\") self._down([[\"TEARDOWN\"]]);\n\t\treturn;\n\t}\n\n\tif (t === \"INVALIDATE\") {\n\t\tconst projection = self._recordDepProjection(idx, delivery);\n\t\tprojection.push(SENTINEL);\n\t\tif (projection.some((v) => v !== SENTINEL) && isLastInDeliveredWave) self._maybeRun();\n\t\t// The dep's value is gone — drop our cached latest view to SENTINEL so the\n\t\t// never-emitted detector reads correctly, C-3) and cascade (idempotent).\n\t\tself._dep.prev[idx] = SENTINEL;\n\t\tself._dep.hasData[idx] = false;\n\t\tself._dep.batch[idx] = null;\n\t\t// EC3: un-wedge the dirty bookkeeping if this dep had gone DIRTY first, so an\n\t\t// INVALIDATE-before-DATA doesn't strand _pending / downstream forever\n\t\t// (R-invalidate-idempotent — exists to prevent the wedged-DIRTY deadlock).\n\t\tif (self._dep.dirty[idx]) {\n\t\t\tself._dep.dirty[idx] = false;\n\t\t\tself._wave.pending--;\n\t\t}\n\t\t// D50 / R-paused-invalidate: this INVALIDATE SUPERSEDES the dep's buffered\n\t\t// paused dep-wave (_depBatch[idx] just cleared). Re-derive the paused-recompute\n\t\t// flag — if no dep still carries a buffered DATA, CANCEL the paused recompute\n\t\t// (attributed cancellation; the node has settled to SENTINEL via its own\n\t\t// INVALIDATE, so a RESUME must not recompute against a now-SENTINEL dep). A\n\t\t// surviving dep keeps it set; a later DATA re-arms it ([DATA,INVALIDATE,DATA2]).\n\t\tif (self._control.pausedDepWaveOccurred && self._dep.batch.every((b) => b === null)) {\n\t\t\tself._control.pausedDepWaveOccurred = false;\n\t\t}\n\t\tconst hadData = self._value.hasData;\n\t\tself._invalidate(); // cascades INVALIDATE iff populated; no-op otherwise\n\t\t// If we broadcast DIRTY this wave but _invalidate produced no settle (the node\n\t\t// was never populated, so the cascade is suppressed per the rule), un-dirty\n\t\t// downstream with a RESOLVED once all deps have settled.\n\t\tif (self._wave.pending === 0 && self._wave.emittedDirtyThisWave) {\n\t\t\tif (!hadData) self._down([[\"RESOLVED\"]]);\n\t\t\telse self._wave.emittedDirtyThisWave = false;\n\t\t}\n\t\tself._fireOwedDemandIfReady(); // R-pull (D59/B1/F6): an INVALIDATE settle can drain _pending → fire a deferred demand\n\t\treturn;\n\t}\n\n\tif (isTerminal(t)) {\n\t\t// Tier 5 (R-tier / D34): COMPLETE | ERROR — ONE branch routed by the CENTRAL tier table,\n\t\t// not a per-variant string check (feedback_use_tier_for_signal_routing). The shared terminal\n\t\t// bookkeeping (record the terminal + release the in-wave DIRTY) runs for ANY tier-5 message;\n\t\t// only the COMPLETE-vs-ERROR cascade differs, so discriminate by the type within the tier.\n\t\tconst isError = t === \"ERROR\";\n\t\tconst errPayload = isError ? (msg as readonly [\"ERROR\", unknown])[1] : undefined;\n\t\tself._dep.terminal[idx] = isError ? errPayload : true;\n\t\tself._dep.terminalInput[idx] = isError ? errPayload : true;\n\t\t// R-terminal-settles-dirty (B35): a terminal RELEASES this dep's outstanding in-wave DIRTY\n\t\t// contribution (the exactly-one-settle invariant) — exactly as DATA/RESOLVED/INVALIDATE do\n\t\t// (a dirty-then-terminal-without-DATA dep would otherwise strand _pending and wedge the node,\n\t\t// the deadlock R-invalidate-idempotent prevents for INVALIDATE).\n\t\tself._releaseDepDirty(idx);\n\t\tconst ranValueBeforeTerminal = self._depProjectionHasData(idx) && isLastInDeliveredWave;\n\t\tif (ranValueBeforeTerminal) self._maybeRun();\n\t\tif (isError && self._slot.errorWhenDepsError) {\n\t\t\tself._down([[\"ERROR\", errPayload]]); // auto-cascade ERROR → node itself terminal\n\t\t} else if (self._slot.terminalAsRealInput) {\n\t\t\tif (ranValueBeforeTerminal) {\n\t\t\t\tself._fireOwedDemandIfReady();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tself._maybeRun(); // rescue/reduce/catch/*Map: the fn reads depTerminal(ctx, idx)\n\t\t} else if (self._slot.completeWhenDepsComplete && self._allDepsTerminal()) {\n\t\t\t// R-deps-terminal auto-COMPLETE + B42: COMPLETE once ALL deps are TERMINAL (each COMPLETE\n\t\t\t// or an absorbed ERROR) — so an absorbed-error dep terminating LAST still fires the\n\t\t\t// cascade. terminalAsRealInput is checked FIRST so a rescue recovers via _maybeRun rather\n\t\t\t// than being preempted (no operator sets both completeWhenDepsComplete:true + tari:true).\n\t\t\tself._down([[\"COMPLETE\"]]);\n\t\t} else {\n\t\t\t// absorbed terminal, NOT an input + not auto-completing: the dep's signalled change did\n\t\t\t// not materialise (no DATA) → un-dirty downstream, keep cache (R-resolved-undirty balance).\n\t\t\tself._settleAfterAbsorbedTerminal();\n\t\t}\n\t\tself._fireOwedDemandIfReady(); // R-pull (D59/B1/F6): a dep terminal can drain _pending → fire a deferred demand (no-op if this node went terminal)\n\t\treturn;\n\t}\n\n\tif (t === \"TEARDOWN\") {\n\t\tself._down([[\"TEARDOWN\"]]);\n\t\treturn;\n\t}\n\n\tif (t === \"DIRTY\") {\n\t\tif (!self._dep.dirty[idx]) {\n\t\t\tself._dep.dirty[idx] = true;\n\t\t\tself._wave.pending++;\n\t\t\tself._dep.tier[idx] = 2;\n\t\t\tself._markDirty();\n\t\t}\n\t\treturn;\n\t}\n\n\tif (t === \"DATA\") {\n\t\tconst v = msg[1];\n\t\tself._recordDepProjection(idx, delivery).push(v);\n\t\tconst b = self._dep.batch[idx];\n\t\tif (b === null) self._dep.batch[idx] = [v];\n\t\telse b.push(v);\n\t\tself._dep.prev[idx] = v;\n\t\tself._dep.hasData[idx] = true;\n\t\tself._dep.tier[idx] = 3;\n\t\tif (self._dep.dirty[idx]) {\n\t\t\tself._dep.dirty[idx] = false;\n\t\t\tself._wave.pending--;\n\t\t}\n\t\tif (isLastInDeliveredWave) self._maybeRun();\n\t\tself._fireOwedDemandIfReady(); // R-pull pin 5: settle-ready now → fire a deferred demand\n\t\treturn;\n\t}\n\n\tif (t === \"RESOLVED\") {\n\t\tself._recordDepProjection(idx, delivery);\n\t\tself._dep.tier[idx] = 3;\n\t\tif (self._dep.dirty[idx]) {\n\t\t\tself._dep.dirty[idx] = false;\n\t\t\tself._wave.pending--;\n\t\t}\n\t\tif (isLastInDeliveredWave) self._maybeRun();\n\t\tself._fireOwedDemandIfReady(); // R-pull pin 5: settle-ready now → fire a deferred demand\n\t\treturn;\n\t}\n\t// PAUSE / RESUME are not delivered downstream to a dep-subscriber; a node is\n\t// paused via its own up() (lockset), not by an upstream dep.\n}\n\nexport function nodeReleaseDepDirty<T>(self: NodeRuntimeHost<T>, idx: number): void {\n\tif (self._dep.dirty[idx]) {\n\t\tself._dep.dirty[idx] = false;\n\t\tself._wave.pending--;\n\t}\n}\n\nexport function nodeSettleAfterAbsorbedTerminal<T>(self: NodeRuntimeHost<T>): void {\n\tif (self._wave.pending !== 0 || !self._wave.emittedDirtyThisWave) return;\n\t// A real value occurred this wave (some OTHER dep delivered DATA) → recompute. _maybeRun\n\t// runs the fn ONLY if it's not gated (first-run gate open, not paused); it may emit DATA, a\n\t// fn-synthesized undirty RESOLVED, or nothing (gated / gate still holds).\n\tconst sawData = self._dep.batch.some((b) => b !== null && b.length > 0);\n\tif (sawData) self._maybeRun();\n\t// If after that the node STILL owes a downstream settle (no DATA occurred, OR the recompute\n\t// was gated — e.g. the first-run gate holds because the terminated dep never delivered and\n\t// terminalAsRealInput is false), balance the broadcast DIRTY with one undirty RESOLVED\n\t// (R-resolved-undirty), keeping the cache (a terminal, unlike INVALIDATE, leaves the value).\n\t// Without this fallback a DIRTY-then-terminal-without-DATA dep on a pre-first-run multi-dep\n\t// node would strand the DIRTY → downstream wedged (the B35 class, in the gate-holds corner).\n\tif (self._wave.emittedDirtyThisWave) self._down([[\"RESOLVED\"]]);\n}\n\nexport function nodeMarkDirty<T>(self: NodeRuntimeHost<T>): void {\n\tself._value.status = \"dirty\";\n\t// SPIKE (protocol-pull): while quiet, ABSORB the upstream DIRTY — do NOT relay it downstream.\n\t// This is the P0b wedge fix: a quiet pull node that relayed DIRTY but withheld the settle\n\t// (coalesced by pause) wedged every downstream's two-phase _pending. The downstream learns of\n\t// changes via the push STREAM port, not the silent snapshot port; on demand the pull node\n\t// emits a fresh wave. Internal dep dirty-accounting (the DIRTY-branch _pending++) is untouched.\n\tif (self._isPullQuiet()) return;\n\tif (!self._wave.emittedDirtyThisWave) {\n\t\tself._wave.emittedDirtyThisWave = true;\n\t\tself._emitToSubs([\"DIRTY\"]);\n\t}\n}\n\nexport function nodeMaybeRun<T>(self: NodeRuntimeHost<T>): void {\n\t// R-rewire: an added cached dep's push-on-subscribe lands here mid-mutation. Defer\n\t// the fn-run to ONE atomic two-phase settle after every added dep is wired, so the\n\t// fn never fires on a partially-populated added-dep view (multi-add) — _settleRewire\n\t// drains this flag.\n\tif (self._wave.inDepMutation) {\n\t\tself._wave.rewireRunPending = true;\n\t\treturn;\n\t}\n\t// R-pause-modes + R-pull: while externally paused or pull-quiet, default pull mode\n\t// coalesces. `resumeAll` still runs so its outgoing settle slice can enter pauseBuffer.\n\tif (self._slot.pausable === true && (self._isPaused() || self._isPullQuiet())) {\n\t\tself._control.pausedDepWaveOccurred = true;\n\t\treturn;\n\t}\n\tself._tryRun();\n}\n\nexport function nodeSettleRewire<T>(self: NodeRuntimeHost<T>): void {\n\tif (self._slot.pausable === true && self._isPaused()) {\n\t\tself._control.pausedDepWaveOccurred = true;\n\t\treturn;\n\t}\n\tif (self._wave.pending > 0) return;\n\tif (self._slot.handle === null) {\n\t\tself._passthroughEmit();\n\t\treturn;\n\t}\n\tif (!self._wave.hasCalledFnOnce && !(self._slot.partial || self._allDepsSettled())) return;\n\tself._markDirty(); // phase 1 (no-op if already dirty, e.g. unsubscribeDep auto-settle)\n\tself._runWave(); // phase 2: fn → DATA/RESOLVED\n}\n\nexport function nodeTryRun<T>(self: NodeRuntimeHost<T>): void {\n\tif (self._wave.pending > 0) return;\n\tif (self._slot.handle === null) {\n\t\t// Passthrough wire (deps, no fn): forward the latest dep DATA downstream.\n\t\tself._passthroughEmit();\n\t\treturn;\n\t}\n\tif (!self._wave.hasCalledFnOnce) {\n\t\tif (self._slot.partial || self._allDepsSettled()) self._runWave();\n\t\t// else: first-run gate holds fn until every dep has settled (R-first-run-gate).\n\t\treturn;\n\t}\n\tself._runWave();\n}\n\nexport function nodeAllDepsSettled<T>(self: NodeRuntimeHost<T>): boolean {\n\tfor (let i = 0; i < self._slot.deps.length; i++) {\n\t\tif (self._dep.hasData[i]) continue;\n\t\tif (self._slot.terminalAsRealInput && self._dep.terminal[i] !== undefined) continue;\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nexport function nodePassthroughEmit<T>(self: NodeRuntimeHost<T>): void {\n\t// Single-dep wire: relay dep 0's latest batch value as DATA.\n\tconst b = self._dep.batch[0];\n\tif (b !== null && b.length > 0) {\n\t\tself._down([[\"DATA\", b[b.length - 1]]]);\n\t} else if (self._wave.emittedDirtyThisWave) {\n\t\t// R-resolved-undirty (D49): the dep settled via an undirty RESOLVED (no DATA in the\n\t\t// batch), but this wire already broadcast DIRTY downstream this wave — balance it with\n\t\t// a RESOLVED so downstream un-dirties instead of wedging. Routed through _down (NOT a\n\t\t// bare _emitToSubs) so the balance respects batch-defer (D12) + pause-buffer, matching\n\t\t// the zero-dep un-dirty path. Without this, a passthrough over a filter-reject /\n\t\t// distinctUntilChanged-dup leaves a dangling DIRTY (the wedge D49 made common).\n\t\tself._down([[\"RESOLVED\"]]);\n\t}\n\tself._dep.batch[0] = null;\n\tself._wave.emittedDirtyThisWave = false;\n}\n\nexport function nodeRunWave<T>(self: NodeRuntimeHost<T>): void {\n\t// R-reentrancy (D37): a fn that re-drives its own dep mid-wave re-enters here while\n\t// _insideRunWave is still set — a synchronous feedback cycle. Reject (throw); the graph\n\t// layer catches it and converts to [[ERROR, e]] (D30). The try/finally resets the flag\n\t// on every frame as the throw unwinds, leaving the graph clean for the catch. Detection\n\t// is node-local and free — it reuses the existing _insideRunWave flag (no new structure,\n\t// dispatcher stays a pure funnel).\n\tif (self._wave.insideRunWave)\n\t\tthrow new Error(\n\t\t\t\"synchronous feedback cycle: node fn re-entered its own wave (R-reentrancy / D37)\",\n\t\t);\n\tself._wave.hasCalledFnOnce = true;\n\t// R-cleanup-hooks per-run lifecycle (D28 clarification): clear BOTH hook lists\n\t// before the fn runs; the fn body re-registers the current run's hooks. Only the\n\t// latest run's registrations are live — a re-run supersedes the prior run's hooks,\n\t// discarded WITHOUT firing (no fire-on-rerun; onRerun stays cut). Fixes the push-only\n\t// accumulation (K stale hooks fired after K runs). C-14.\n\tself._hooks.onInvalidate = [];\n\tself._hooks.onDeactivation = [];\n\tconst ctx = self._buildCtx();\n\tconst wasDirty = self._wave.emittedDirtyThisWave;\n\tself._wave.emittedSettleThisWave = false;\n\tself._wave.insideRunWave = true;\n\ttry {\n\t\tself._slot.dispatcher.invoke(self._slot.handle as Handle, ctx);\n\t} finally {\n\t\tself._wave.insideRunWave = false;\n\t}\n\n\t// R-resolved-undirty (D49): a SYNC fn DIRTY'd in phase 1 that produced NO tier-3 value\n\t// this wave (filter-reject / distinctUntilChanged-dup / any no-emit fn) gets a substrate-\n\t// SYNTHESIZED undirty RESOLVED to clear the downstream dirty — operator bodies stay\n\t// protocol-clean (R-primary-api-clean). Status reflects cache freshness: a carried value\n\t// -> resolved, never-valued -> sentinel. EXEMPT: terminal/INVALIDATE waves (they set\n\t// _emittedSettleThisWave and balance their own dirty), and ASYNC-pool nodes — an async fn\n\t// that returns without emitting has DEFERRED its result (it emits later via the stashed\n\t// ctx), NOT rejected; synthesizing here would prematurely settle a still-pending diamond\n\t// leg (R-async-paused / C-4). The eventual async ctx.down carries its own DIRTY balance.\n\tif (\n\t\twasDirty &&\n\t\t!self._wave.emittedSettleThisWave &&\n\t\tself._value.terminal === undefined &&\n\t\t!self._isAsyncPool()\n\t) {\n\t\tself._down([[\"RESOLVED\"]]);\n\t}\n\n\t// roll wave-local state forward\n\tfor (let i = 0; i < self._dep.batch.length; i++) {\n\t\tself._dep.batch[i] = null;\n\t\tself._dep.waveData[i] = [];\n\t\tself._dep.waveTokens[i] = undefined;\n\t\tself._dep.terminalInput[i] = undefined;\n\t}\n\tself._wave.emittedDirtyThisWave = false;\n}\n","import type { Ctx, CtxState, DeliveryMeta, NodeFn } from \"../ctx/types.js\";\nimport type { LockId, Message, PullDemand, Wave } from \"../protocol/messages.js\";\nimport type {\n\tCleanupHooks,\n\tControlState,\n\tDepBookkeeping,\n\tLifecycleState,\n\tNodeCore,\n\tNodeId,\n\tNodeSlot,\n\tPrivateState,\n\tSyncCtxState,\n\tValueState,\n\tVersionState,\n\tWaveState,\n} from \"./core.js\";\nimport type { Node } from \"./node.js\";\nimport type { RewireOp, UpRouteState } from \"./types.js\";\n\nexport interface NodeRuntimeHost<T = unknown> {\n\t_core: NodeCore;\n\t_id: NodeId;\n\t_slot: NodeSlot<T>;\n\t_dep: DepBookkeeping;\n\t_value: ValueState<T>;\n\t_wave: WaveState;\n\t_control: ControlState;\n\t_lifecycle: LifecycleState;\n\t_privateState: PrivateState;\n\t_hooks: CleanupHooks;\n\t_syncCtxState: SyncCtxState;\n\t_version: VersionState;\n\t_syncCtx: Ctx | null;\n\t_restoredActivationPending: boolean;\n\t_released: boolean;\n\t_assertNotReleased(op: string): void;\n\t_isPullQuiet(): boolean;\n\t_requestRewireNext(op: RewireOp): void;\n\t_requestUpNext(msgs: Wave, towardDep?: number): void;\n\t_applyRewireNext(op: RewireOp): void;\n\t_dedupDeps(deps: Node<unknown>[]): Node<unknown>[];\n\t_reachableUpstream(from: Node<unknown>, target: Node<unknown>): boolean;\n\t_assertRewireDepOwner(dep: Node<unknown>): void;\n\t_rewire(newDeps: Node<unknown>[], fn: NodeFn, opts?: { allowTerminalOwner?: boolean }): boolean;\n\t_activate(): void;\n\t_subscribeDepAt(depNode: Node<unknown>, opts?: { seedRestored?: boolean }): void;\n\t_seedRestoredDepAt(idx: number, depNode: Node<unknown>): void;\n\t_deactivate(): void;\n\t_subscriberCount(): number;\n\t_isRuntimeQuiescentForRelease(): boolean;\n\t_releaseRuntime(): void;\n\t_resetDepState(): void;\n\t_recordDepProjection(idx: number, delivery: DeliveryMeta | undefined): unknown[];\n\t_depProjectionHasData(idx: number): boolean;\n\t_receiveFromDep(idx: number, msg: Message, delivery?: DeliveryMeta): void;\n\t_releaseDepDirty(idx: number): void;\n\t_settleAfterAbsorbedTerminal(): void;\n\t_markDirty(): void;\n\t_maybeRun(): void;\n\t_settleRewire(): void;\n\t_tryRun(): void;\n\t_allDepsSettled(): boolean;\n\t_passthroughEmit(): void;\n\t_runWave(): void;\n\t_buildCtx(): Ctx;\n\t_makeCtx(snapshot?: { waveData: unknown[][][]; terminal: unknown[]; latest: unknown[] }): Ctx;\n\t_refreshCtx(ctx: Ctx): void;\n\t_makeState(): CtxState;\n\t_down(msgs: Wave): void;\n\t_up(msgs: Wave, towardDep?: number, route?: UpRouteState): void;\n\t_markDemandRouted(lockId: LockId, route: UpRouteState): boolean;\n\t_forwardUp(m: Message, towardDep: number | undefined, route: UpRouteState): void;\n\t_isPaused(): boolean;\n\t_hasBoundaryPauseLock(): boolean;\n\t_isAsyncPool(): boolean;\n\t_pauseAcquire(lockId: unknown): void;\n\t_pauseRelease(lockId: unknown): void;\n\t_onResume(): void;\n\t_canFireDemand(): boolean;\n\t_deliverPullDemand(demand: PullDemand): void;\n\t_onDemand(demand: PullDemand): void;\n\t_firePullDemand(): void;\n\t_fireOwedDemandIfReady(): void;\n\t_shouldBufferOnPause(): boolean;\n\t_invalidate(delivery?: DeliveryMeta): void;\n\t_allDepsTerminal(): boolean;\n\t_resetLifecycle(): void;\n\t_emitToSubs(msg: Message, delivery?: DeliveryMeta): void;\n\t__commitBatchedWave(wave: Wave): void;\n\t__rollbackBatched(): void;\n\t__deferBoundary(fn: () => void, batchToken?: object): void;\n}\n\nexport function nodeRuntimeHost<T>(node: Node<T>): NodeRuntimeHost<T> {\n\treturn node as unknown as NodeRuntimeHost<T>;\n}\n","import { SENTINEL } from \"../protocol/messages.js\";\nimport type { Node } from \"./node.js\";\nimport { type NodeRuntimeHost, nodeRuntimeHost } from \"./node-runtime-host.js\";\nimport {\n\tactivationReaders,\n\tcheckpointReaders,\n\townerTokens,\n\treleasedNodes,\n\trestoreWriters,\n\truntimeQuiescenceReaders,\n\truntimeReleasers,\n\tsubscriberCountReaders,\n\ttopologyDepsChangedObservers,\n} from \"./runtime-accessors.js\";\n\nexport function nodeActivate<T>(self: NodeRuntimeHost<T>): void {\n\tself._lifecycle.activated = true;\n\tconst seedRestoredDeps = self._restoredActivationPending;\n\tself._restoredActivationPending = false;\n\t// R-pull (D55/D272): activePull is undefined before wiring deps, so each dep's\n\t// push-on-subscribe DIRTY/DATA is absorbed quietly, not relayed downstream.\n\tself._dep.unsubs = new Array(self._slot.deps.length);\n\tself._dep.idxBoxes = new Array(self._slot.deps.length);\n\tfor (const dep of self._slot.deps) self._subscribeDepAt(dep, { seedRestored: seedRestoredDeps });\n\t// Depless producer (fn, no deps): run once on activation.\n\tif (self._slot.deps.length === 0 && self._slot.handle !== null && !self._wave.hasCalledFnOnce) {\n\t\tself._runWave();\n\t}\n}\n\nexport function nodeSubscribeDepAt<T>(\n\tself: NodeRuntimeHost<T>,\n\tdepNode: Node<unknown>,\n\topts: { seedRestored?: boolean } = {},\n): void {\n\tconst idx0 = self._slot.deps.indexOf(depNode);\n\tconst box = { v: idx0 };\n\tlet ignoreInitialPush = opts.seedRestored === true;\n\tif (ignoreInitialPush && idx0 !== -1) {\n\t\tself._seedRestoredDepAt(idx0, depNode);\n\t\tconst dep = nodeRuntimeHost(depNode);\n\t\tif (dep._value.terminal !== undefined && !dep._slot.resubscribable) {\n\t\t\tself._dep.unsubs[idx0] = () => {};\n\t\t\tself._dep.idxBoxes[idx0] = box;\n\t\t\treturn;\n\t\t}\n\t}\n\tconst unsub = depNode.subscribe((msg, delivery) => {\n\t\tif (ignoreInitialPush && delivery === undefined) return;\n\t\tif (ignoreInitialPush) ignoreInitialPush = false;\n\t\tif (box.v === -1) return; // dep removed — stale callback, drop (drain)\n\t\tself._receiveFromDep(box.v, msg, delivery);\n\t});\n\tif (ignoreInitialPush && idx0 !== -1 && box.v !== -1) self._seedRestoredDepAt(idx0, depNode);\n\tignoreInitialPush = false;\n\tif (idx0 !== -1) {\n\t\tself._dep.unsubs[idx0] = unsub;\n\t\tself._dep.idxBoxes[idx0] = box;\n\t}\n}\n\nexport function nodeSeedRestoredDepAt<T>(\n\tself: NodeRuntimeHost<T>,\n\tidx: number,\n\tdepNode: Node<unknown>,\n): void {\n\tconst dep = nodeRuntimeHost(depNode);\n\tconst seedData = dep._value.hasData && !dep._slot.pull;\n\tself._dep.batch[idx] = null;\n\tself._dep.waveData[idx] = [];\n\tself._dep.waveTokens[idx] = undefined;\n\tself._dep.prev[idx] = seedData ? dep._value.cache : SENTINEL;\n\tself._dep.hasData[idx] = seedData;\n\tself._dep.dirty[idx] = false;\n\tself._dep.tier[idx] = seedData ? 3 : 0;\n\tself._dep.terminal[idx] = dep._value.terminal;\n\tself._dep.terminalInput[idx] = undefined;\n}\n\nexport function nodeDeactivate<T>(self: NodeRuntimeHost<T>): void {\n\tself._lifecycle.activated = false;\n\tfor (const u of self._dep.unsubs) if (u) u();\n\tself._dep.unsubs = [];\n\tself._dep.idxBoxes = [];\n\tfor (const fn of self._hooks.onDeactivation) fn();\n\tself._hooks.onDeactivation = [];\n\tself._hooks.onInvalidate = [];\n\n\tconst isCompute = self._slot.handle !== null || self._slot.deps.length > 0;\n\tif (isCompute) {\n\t\t// RAM: compute nodes clear cache; reconnect re-runs fn fresh.\n\t\tself._value.cache = SENTINEL;\n\t\tself._value.hasData = false;\n\t\tself._value.status = \"sentinel\";\n\t}\n\tself._resetDepState();\n\tself._wave.hasCalledFnOnce = false;\n\tself._control.pauseLockset.clear();\n\tself._control.pauseBuffer = [];\n\tself._control.pausedDepWaveOccurred = false;\n\tself._control.demandOwed = undefined; // R-pull (D269): drop any deferred demand\n\tself._control.activePull = undefined;\n\tself._control.pullDirtyOwed = false;\n\tself._value.replayRing = []; // BH6: don't replay stale values to a post-reactivation subscriber\n\tif (!self._privateState.persist) self._privateState.value = SENTINEL;\n}\n\nexport function nodeSubscriberCount<T>(self: NodeRuntimeHost<T>): number {\n\treturn self._lifecycle.subscribers.size;\n}\n\nexport function nodeIsRuntimeQuiescentForRelease<T>(self: NodeRuntimeHost<T>): boolean {\n\treturn (\n\t\t!self._released &&\n\t\tself._value.status !== \"dirty\" &&\n\t\tself._value.status !== \"pending\" &&\n\t\tself._wave.pending === 0 &&\n\t\t!self._wave.insideRunWave &&\n\t\t!self._wave.inDepMutation &&\n\t\t!self._wave.rewireRunPending &&\n\t\t!self._wave.batchDirtyOwed &&\n\t\tself._dep.dirty.every((dirty) => !dirty) &&\n\t\tself._control.pauseBuffer.length === 0 &&\n\t\t!self._control.pausedDepWaveOccurred &&\n\t\tself._control.demandOwed === undefined &&\n\t\tself._control.activePull === undefined &&\n\t\t!self._control.inDeliverDemand &&\n\t\tself._control.pauseLockset.size === 0\n\t);\n}\n\nexport function nodeReleaseRuntime<T>(self: NodeRuntimeHost<T>): void {\n\tif (self._released) return;\n\tself._released = true;\n\tconst node = self as unknown as Node<unknown>;\n\treleasedNodes.add(node);\n\tlet releaseError: unknown;\n\tconst recordReleaseError = (error: unknown): void => {\n\t\tif (releaseError === undefined) releaseError = error;\n\t};\n\tself._lifecycle.activated = false;\n\tfor (const u of self._dep.unsubs) {\n\t\ttry {\n\t\t\tu();\n\t\t} catch (error) {\n\t\t\trecordReleaseError(error);\n\t\t\t// D124 release is graph-owned and atomic; user cleanup must not split commit.\n\t\t}\n\t}\n\tfor (const fn of self._hooks.onDeactivation) {\n\t\ttry {\n\t\t\tfn();\n\t\t} catch (error) {\n\t\t\trecordReleaseError(error);\n\t\t\t// D124 release cleans runtime without synthesizing protocol ERROR/COMPLETE.\n\t\t}\n\t}\n\tself._dep.unsubs = [];\n\tself._dep.idxBoxes = [];\n\tself._lifecycle.subscribers.clear();\n\tif (self._slot.handle !== null) {\n\t\tself._slot.dispatcher.unregister(self._slot.handle);\n\t\tself._slot.handle = null;\n\t}\n\tself._slot.deps = [];\n\tself._dep.batch = [];\n\tself._dep.waveData = [];\n\tself._dep.waveTokens = [];\n\tself._dep.prev = [];\n\tself._dep.hasData = [];\n\tself._dep.dirty = [];\n\tself._dep.tier = [];\n\tself._dep.terminal = [];\n\tself._dep.terminalInput = [];\n\tself._value.cache = SENTINEL;\n\tself._value.hasData = false;\n\tself._value.status = \"sentinel\";\n\tself._value.terminal = undefined;\n\tself._value.replayRing = [];\n\tself._privateState.value = SENTINEL;\n\tself._privateState.persist = false;\n\tself._syncCtx = null;\n\tself._resetDepState();\n\tself._hooks.onDeactivation = [];\n\tself._hooks.onInvalidate = [];\n\tself._control.pauseLockset.clear();\n\tself._control.pauseBuffer = [];\n\tself._control.pausedDepWaveOccurred = false;\n\tself._control.demandOwed = undefined;\n\tself._control.activePull = undefined;\n\tself._control.pullDirtyOwed = false;\n\tself._restoredActivationPending = false;\n\tcheckpointReaders.delete(node);\n\trestoreWriters.delete(node);\n\truntimeReleasers.delete(node);\n\truntimeQuiescenceReaders.delete(node);\n\tsubscriberCountReaders.delete(node);\n\tactivationReaders.delete(node);\n\townerTokens.delete(node);\n\ttopologyDepsChangedObservers.delete(node);\n\tself._core.releaseSlot(self._id);\n\tif (releaseError !== undefined) throw releaseError;\n}\n\nexport function nodeResetDepState<T>(self: NodeRuntimeHost<T>): void {\n\tconst n = self._slot.deps.length;\n\tfor (let i = 0; i < n; i++) {\n\t\tself._dep.batch[i] = null;\n\t\tself._dep.waveData[i] = [];\n\t\tself._dep.waveTokens[i] = undefined;\n\t\tself._dep.prev[i] = SENTINEL;\n\t\tself._dep.hasData[i] = false;\n\t\tself._dep.dirty[i] = false;\n\t\tself._dep.tier[i] = 0;\n\t\tself._dep.terminal[i] = undefined;\n\t\tself._dep.terminalInput[i] = undefined;\n\t}\n\tself._wave.pending = 0;\n\tself._wave.emittedDirtyThisWave = false;\n}\n","/**\n * Neutral JSON/encoding utilities (D96).\n *\n * Shared by graph checkpoints and storage bindings; neither layer owns the strict JSON\n * scanner/canonicalization contract.\n */\n\n/** Typed byte codec for D82 storage binding helpers and D96 shared JSON surfaces. */\nexport interface Codec<T> {\n\tencode(value: T): Uint8Array;\n\tdecode(bytes: Uint8Array): T;\n}\n\nexport type StrictJsonScalar = null | boolean | number | string;\nexport type StrictJsonValue =\n\t| StrictJsonScalar\n\t| readonly StrictJsonValue[]\n\t| { readonly [key: string]: StrictJsonValue };\nexport type StrictJsonObject = Readonly<Record<string, StrictJsonValue>>;\n\ntype JsonValue = StrictJsonValue;\n\nconst JS_MIN_NORMAL_NUMBER = 2 ** -1022;\n\nfunction assertStableJsonNumber(value: number, path: string): void {\n\tif (!Number.isFinite(value)) {\n\t\tthrow new TypeError(`stableJsonString: non-finite number at ${path}`);\n\t}\n}\n\nfunction assertStrictJsonNumber(value: number, path: string): void {\n\tassertStableJsonNumber(value, path);\n\tif (Object.is(value, -0)) {\n\t\tthrow new TypeError(`stableJsonString: non-canonical number at ${path}`);\n\t}\n\tconst abs = Math.abs(value);\n\tif (abs > 0 && abs < JS_MIN_NORMAL_NUMBER) {\n\t\tthrow new TypeError(`stableJsonString: subnormal number at ${path}`);\n\t}\n\tif (Number.isInteger(value) && !Number.isSafeInteger(value)) {\n\t\tthrow new TypeError(`stableJsonString: integer outside safe range at ${path}`);\n\t}\n}\n\nfunction sortedJsonValue(\n\tvalue: unknown,\n\tseen = new Set<object>(),\n\tpath = \"$\",\n\tstrictNumbers = false,\n): JsonValue {\n\tif (value === null) return null;\n\tif (typeof value === \"string\" || typeof value === \"boolean\") return value;\n\tif (typeof value === \"number\") {\n\t\tif (strictNumbers) assertStrictJsonNumber(value, path);\n\t\telse assertStableJsonNumber(value, path);\n\t\treturn value;\n\t}\n\tif (typeof value !== \"object\") {\n\t\tthrow new TypeError(`stableJsonString: value at ${path} is not JSON-encodable`);\n\t}\n\tif (seen.has(value)) throw new TypeError(`stableJsonString: circular reference at ${path}`);\n\tconst proto = Object.getPrototypeOf(value);\n\tif (!Array.isArray(value) && proto !== Object.prototype && proto !== null) {\n\t\tthrow new TypeError(`stableJsonString: non-plain object at ${path}`);\n\t}\n\tseen.add(value);\n\ttry {\n\t\tif (Array.isArray(value)) {\n\t\t\tif (Object.getOwnPropertySymbols(value).length > 0) {\n\t\t\t\tthrow new TypeError(`stableJsonString: symbol-keyed properties at ${path}`);\n\t\t\t}\n\t\t\tfor (const key of Object.getOwnPropertyNames(value)) {\n\t\t\t\tconst isIndex =\n\t\t\t\t\t/^(0|[1-9]\\d*)$/.test(key) &&\n\t\t\t\t\tNumber.isSafeInteger(Number(key)) &&\n\t\t\t\t\tNumber(key) < value.length;\n\t\t\t\tconst descriptor = Object.getOwnPropertyDescriptor(value, key);\n\t\t\t\tif (descriptor !== undefined && (\"get\" in descriptor || \"set\" in descriptor)) {\n\t\t\t\t\tthrow new TypeError(`stableJsonString: accessor property at ${path}.${key}`);\n\t\t\t\t}\n\t\t\t\tif (key !== \"length\" && !isIndex) {\n\t\t\t\t\tthrow new TypeError(`stableJsonString: non-index array property at ${path}.${key}`);\n\t\t\t\t}\n\t\t\t\tif (key !== \"length\" && descriptor !== undefined && !descriptor.enumerable) {\n\t\t\t\t\tthrow new TypeError(`stableJsonString: non-enumerable array property at ${path}.${key}`);\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst out: JsonValue[] = [];\n\t\t\tfor (let i = 0; i < value.length; i += 1) {\n\t\t\t\tif (!(i in value)) {\n\t\t\t\t\tthrow new TypeError(`stableJsonString: sparse array hole at ${path}[${i}]`);\n\t\t\t\t}\n\t\t\t\tout.push(sortedJsonValue(value[i], seen, `${path}[${i}]`, strictNumbers));\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\tif (Object.getOwnPropertySymbols(value).length > 0) {\n\t\t\tthrow new TypeError(`stableJsonString: symbol-keyed properties at ${path}`);\n\t\t}\n\t\tfor (const key of Object.getOwnPropertyNames(value)) {\n\t\t\tconst descriptor = Object.getOwnPropertyDescriptor(value, key);\n\t\t\tif (descriptor !== undefined && (\"get\" in descriptor || \"set\" in descriptor)) {\n\t\t\t\tthrow new TypeError(`stableJsonString: accessor property at ${path}.${key}`);\n\t\t\t}\n\t\t\tif (descriptor !== undefined && !descriptor.enumerable) {\n\t\t\t\tthrow new TypeError(`stableJsonString: non-enumerable property at ${path}.${key}`);\n\t\t\t}\n\t\t}\n\t\tconst out: Record<string, JsonValue> = Object.create(null);\n\t\tfor (const key of Object.keys(value as Record<string, unknown>).sort()) {\n\t\t\tout[key] = sortedJsonValue(\n\t\t\t\t(value as Record<string, unknown>)[key],\n\t\t\t\tseen,\n\t\t\t\t`${path}.${key}`,\n\t\t\t\tstrictNumbers,\n\t\t\t);\n\t\t}\n\t\treturn out;\n\t} finally {\n\t\tseen.delete(value);\n\t}\n}\n\n/** Stable JSON string: object keys sort by code-unit order for deterministic storage/checkpoint bytes. */\nexport function stableJsonString(value: unknown): string {\n\treturn JSON.stringify(sortedJsonValue(value));\n}\n\nfunction strictStableJsonString(value: unknown): string {\n\treturn JSON.stringify(sortedJsonValue(value, new Set<object>(), \"$\", true));\n}\n\n/** Build a JSON codec using stable object-key ordering. */\nexport function jsonCodecFor<T>(): Codec<T> {\n\tconst encoder = new TextEncoder();\n\tconst decoder = new TextDecoder();\n\treturn {\n\t\tencode(value: T): Uint8Array {\n\t\t\treturn encoder.encode(stableJsonString(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): T {\n\t\t\treturn JSON.parse(decoder.decode(bytes)) as T;\n\t\t},\n\t};\n}\n\n/** Default stable JSON codec for unknown values. */\nexport const jsonCodec: Codec<unknown> = jsonCodecFor<unknown>();\n\nfunction bytesEqual(a: Uint8Array, b: Uint8Array): boolean {\n\tif (a.byteLength !== b.byteLength) return false;\n\tfor (let i = 0; i < a.byteLength; i += 1) {\n\t\tif (a[i] !== b[i]) return false;\n\t}\n\treturn true;\n}\n\nfunction hasUnpairedSurrogate(value: string): boolean {\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tconst code = value.charCodeAt(i);\n\t\tif (code >= 0xd800 && code <= 0xdbff) {\n\t\t\tconst next = value.charCodeAt(i + 1);\n\t\t\tif (next >= 0xdc00 && next <= 0xdfff) {\n\t\t\t\ti += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\t\tif (code >= 0xdc00 && code <= 0xdfff) return true;\n\t}\n\treturn false;\n}\n\nfunction assertNoUnpairedSurrogates(value: unknown, seen = new Set<object>(), path = \"$\"): void {\n\tif (typeof value === \"string\") {\n\t\tif (hasUnpairedSurrogate(value)) {\n\t\t\tthrow new TypeError(`strictJsonCodec: unpaired surrogate at ${path}`);\n\t\t}\n\t\treturn;\n\t}\n\tif (value === null || typeof value !== \"object\") return;\n\tif (seen.has(value)) return;\n\tseen.add(value);\n\ttry {\n\t\tif (Array.isArray(value)) {\n\t\t\tfor (let i = 0; i < value.length; i += 1) {\n\t\t\t\tassertNoUnpairedSurrogates(value[i], seen, `${path}[${i}]`);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tfor (const key of Object.keys(value as Record<string, unknown>)) {\n\t\t\tif (hasUnpairedSurrogate(key)) {\n\t\t\t\tthrow new TypeError(`strictJsonCodec: unpaired surrogate at ${path}.${key}`);\n\t\t\t}\n\t\t\tassertNoUnpairedSurrogates((value as Record<string, unknown>)[key], seen, `${path}.${key}`);\n\t\t}\n\t} finally {\n\t\tseen.delete(value);\n\t}\n}\n\nfunction assertNoDuplicateJsonObjectKeys(text: string): void {\n\tlet index = 0;\n\n\tfunction fail(message: string): never {\n\t\tthrow new TypeError(`strictJsonCodec: ${message}`);\n\t}\n\n\tfunction skipWhitespace(): void {\n\t\twhile (/\\s/.test(text[index] ?? \"\")) index += 1;\n\t}\n\n\tfunction readJsonString(): string {\n\t\tconst start = index;\n\t\tindex += 1;\n\t\twhile (index < text.length) {\n\t\t\tconst ch = text[index];\n\t\t\tif (ch === '\"') {\n\t\t\t\tindex += 1;\n\t\t\t\ttry {\n\t\t\t\t\treturn JSON.parse(text.slice(start, index)) as string;\n\t\t\t\t} catch {\n\t\t\t\t\tfail(\"malformed JSON string\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ch === \"\\\\\") {\n\t\t\t\tindex += 2;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tindex += 1;\n\t\t}\n\t\tfail(\"unterminated JSON string\");\n\t}\n\n\tfunction consumeLiteral(literal: string): void {\n\t\tif (text.slice(index, index + literal.length) !== literal) {\n\t\t\tfail(`malformed JSON near byte ${index}`);\n\t\t}\n\t\tindex += literal.length;\n\t}\n\n\tfunction consumeNumber(): void {\n\t\tconst match = /^-?(0|[1-9]\\d*)(\\.\\d+)?([eE][+-]?\\d+)?/.exec(text.slice(index));\n\t\tif (!match) fail(`malformed JSON number near byte ${index}`);\n\t\tindex += match[0].length;\n\t}\n\n\tfunction parseValue(path: string): void {\n\t\tskipWhitespace();\n\t\tconst ch = text[index];\n\t\tif (ch === \"{\") {\n\t\t\tparseObject(path);\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"[\") {\n\t\t\tparseArray(path);\n\t\t\treturn;\n\t\t}\n\t\tif (ch === '\"') {\n\t\t\treadJsonString();\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"t\") {\n\t\t\tconsumeLiteral(\"true\");\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"f\") {\n\t\t\tconsumeLiteral(\"false\");\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"n\") {\n\t\t\tconsumeLiteral(\"null\");\n\t\t\treturn;\n\t\t}\n\t\tif (ch === \"-\" || (ch !== undefined && ch >= \"0\" && ch <= \"9\")) {\n\t\t\tconsumeNumber();\n\t\t\treturn;\n\t\t}\n\t\tfail(`malformed JSON near byte ${index}`);\n\t}\n\n\tfunction parseObject(path: string): void {\n\t\tconst keys = new Set<string>();\n\t\tindex += 1;\n\t\tskipWhitespace();\n\t\tif (text[index] === \"}\") {\n\t\t\tindex += 1;\n\t\t\treturn;\n\t\t}\n\t\twhile (index < text.length) {\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] !== '\"') fail(`expected object key near byte ${index}`);\n\t\t\tconst key = readJsonString();\n\t\t\tif (keys.has(key)) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t`strictJsonCodec: duplicate object key ${JSON.stringify(key)} at ${path}`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tkeys.add(key);\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] !== \":\") fail(`expected ':' after object key near byte ${index}`);\n\t\t\tindex += 1;\n\t\t\tparseValue(`${path}.${key}`);\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] === \",\") {\n\t\t\t\tindex += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (text[index] === \"}\") {\n\t\t\t\tindex += 1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfail(`expected ',' or '}' near byte ${index}`);\n\t\t}\n\t\tfail(\"unterminated JSON object\");\n\t}\n\n\tfunction parseArray(path: string): void {\n\t\tindex += 1;\n\t\tskipWhitespace();\n\t\tif (text[index] === \"]\") {\n\t\t\tindex += 1;\n\t\t\treturn;\n\t\t}\n\t\tlet item = 0;\n\t\twhile (index < text.length) {\n\t\t\tparseValue(`${path}[${item}]`);\n\t\t\titem += 1;\n\t\t\tskipWhitespace();\n\t\t\tif (text[index] === \",\") {\n\t\t\t\tindex += 1;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (text[index] === \"]\") {\n\t\t\t\tindex += 1;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tfail(`expected ',' or ']' near byte ${index}`);\n\t\t}\n\t\tfail(\"unterminated JSON array\");\n\t}\n\n\tparseValue(\"$\");\n\tskipWhitespace();\n\tif (index !== text.length) fail(`trailing JSON token near byte ${index}`);\n}\n\n/**\n * Build a strict canonical JSON codec (D84/D87/D96).\n * The strict surface rejects malformed UTF-8, duplicate object keys, non-canonical bytes,\n * unpaired surrogates, and values that cannot round-trip through stable JSON.\n */\nexport function strictJsonCodecFor<T>(): Codec<T> {\n\tconst encoder = new TextEncoder();\n\tconst decoder = new TextDecoder(\"utf-8\", { fatal: true });\n\treturn {\n\t\tencode(value: T): Uint8Array {\n\t\t\tassertNoUnpairedSurrogates(value);\n\t\t\treturn encoder.encode(strictStableJsonString(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): T {\n\t\t\tconst text = decoder.decode(bytes);\n\t\t\tassertNoDuplicateJsonObjectKeys(text);\n\t\t\tconst decoded = JSON.parse(text) as unknown;\n\t\t\tassertNoUnpairedSurrogates(decoded);\n\t\t\tconst canonical = encoder.encode(strictStableJsonString(decoded));\n\t\t\tif (!bytesEqual(bytes, canonical)) {\n\t\t\t\tthrow new TypeError(\"strictJsonCodec: bytes are not canonical stable JSON\");\n\t\t\t}\n\t\t\treturn decoded as T;\n\t\t},\n\t};\n}\n\n/** Default strict canonical JSON codec for unknown values. */\nexport const strictJsonCodec: Codec<unknown> = strictJsonCodecFor<unknown>();\n\n/** D113 neutral helper for strict canonical JSON UTF-8 bytes. */\nexport function strictCanonicalJsonBytes(value: unknown): Uint8Array {\n\treturn strictJsonCodec.encode(value);\n}\n\n/** Validate and normalize a host value into strict canonical JSON data. */\nexport function assertStrictJsonValue(value: unknown, label = \"strictJsonValue\"): StrictJsonValue {\n\ttry {\n\t\treturn strictJsonCodec.decode(strictJsonCodec.encode(value)) as StrictJsonValue;\n\t} catch (cause) {\n\t\tconst message = cause instanceof Error ? cause.message : String(cause);\n\t\tthrow new TypeError(`${label}: value is not strict JSON compatible: ${message}`, { cause });\n\t}\n}\n\n/** Validate and normalize a host value into a strict canonical JSON object. */\nexport function assertStrictJsonObject(\n\tvalue: unknown,\n\tlabel = \"strictJsonObject\",\n): StrictJsonObject {\n\tconst normalized = assertStrictJsonValue(value, label);\n\tif (normalized === null || typeof normalized !== \"object\" || Array.isArray(normalized)) {\n\t\tthrow new TypeError(`${label}: value must be a strict JSON object`);\n\t}\n\treturn normalized as StrictJsonObject;\n}\n","import { strictCanonicalJsonBytes, strictJsonCodec } from \"../json/codec.js\";\n\nexport type NodeVersioningLevel = 0 | 1;\n\n/**\n * D112 V1 node-version hash callback.\n *\n * The callback receives strict canonical JSON UTF-8 DATA bytes, not the raw host value.\n * Runtime V1 versioning encodes DATA with `strictCanonicalJsonBytes(value)` before calling hash.\n */\nexport type NodeVersionHashFn = (bytes: Uint8Array) => string;\n\nexport type NodeVersioningPolicy =\n\t| false\n\t| 0\n\t| 1\n\t| {\n\t\t\tlevel: NodeVersioningLevel;\n\t\t\thash?: NodeVersionHashFn;\n\t  };\n\nexport type ResolvedNodeVersioningPolicy =\n\t| { readonly enabled: false }\n\t| { readonly enabled: true; readonly level: 0 }\n\t| { readonly enabled: true; readonly level: 1; readonly hash: NodeVersionHashFn };\n\nexport type NodeVersionV0 = {\n\treadonly level: 0;\n\treadonly counter: number;\n};\n\nexport type NodeVersionV1 = {\n\treadonly level: 1;\n\treadonly counter: number;\n\treadonly cid: string;\n\treadonly prev: string | null;\n};\n\nexport type NodeVersion = NodeVersionV0 | NodeVersionV1;\n\nexport type NodeVersionJson = NodeVersion;\n\nconst ABSENT_V1_SEED = Object.freeze({\n\t\"@graphrefly/node-version\": \"v1-absent\",\n});\n\nfunction fnv1a64(input: Uint8Array): string {\n\tlet hash = 0xcbf29ce484222325n;\n\tconst prime = 0x100000001b3n;\n\tfor (const byte of input) {\n\t\thash ^= BigInt(byte);\n\t\thash = BigInt.asUintN(64, hash * prime);\n\t}\n\treturn hash.toString(16).padStart(16, \"0\");\n}\n\n/**\n * Default synchronous D112 V1 node-version hash over strict canonical JSON UTF-8 bytes.\n *\n * When hashing a host value directly, encode first:\n * `defaultNodeVersionHash(strictCanonicalJsonBytes(value))`.\n */\nexport function defaultNodeVersionHash(bytes: Uint8Array): string {\n\treturn `fnv1a64:${fnv1a64(bytes)}`;\n}\n\nfunction computeV1Cid(\n\tpolicy: Extract<ResolvedNodeVersioningPolicy, { enabled: true; level: 1 }>,\n\tvalue: unknown,\n): string {\n\treturn policy.hash(strictCanonicalJsonBytes(value));\n}\n\nexport function assertNodeVersionDataCompatible(\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tvalue: unknown,\n): void {\n\tif (!policy.enabled || policy.level === 0) return;\n\tstrictCanonicalJsonBytes(value);\n}\n\nexport function snapshotNodeVersionData(\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tvalue: unknown,\n): unknown {\n\tif (!policy.enabled || policy.level === 0) return value;\n\tconst bytes = strictCanonicalJsonBytes(value);\n\treturn strictJsonCodec.decode(bytes);\n}\n\nexport function resolveNodeVersioningPolicy(\n\tpolicy: NodeVersioningPolicy | undefined,\n): ResolvedNodeVersioningPolicy {\n\tif (policy === false) return { enabled: false };\n\tif (policy === undefined || policy === 0) return { enabled: true, level: 0 };\n\tif (policy === 1) return { enabled: true, level: 1, hash: defaultNodeVersionHash };\n\tif (typeof policy === \"object\" && policy !== null) {\n\t\tif (policy.level === 0) return { enabled: true, level: 0 };\n\t\tif (policy.level === 1) {\n\t\t\treturn { enabled: true, level: 1, hash: policy.hash ?? defaultNodeVersionHash };\n\t\t}\n\t}\n\tthrow new Error(\"node: versioning level must be 0 or 1; V2/V3 are not locked yet (D109)\");\n}\n\nexport function createNodeVersion(\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tinitialValue: unknown = ABSENT_V1_SEED,\n): NodeVersion | undefined {\n\tif (!policy.enabled) return undefined;\n\tif (policy.level === 0) return Object.freeze({ level: 0, counter: 0 });\n\treturn Object.freeze({\n\t\tlevel: 1,\n\t\tcounter: 0,\n\t\tcid: computeV1Cid(policy, initialValue),\n\t\tprev: null,\n\t});\n}\n\nexport function advanceNodeVersion(\n\tcurrent: NodeVersion | undefined,\n\tpolicy: ResolvedNodeVersioningPolicy,\n\tvalue: unknown,\n): NodeVersion | undefined {\n\tif (!policy.enabled) return undefined;\n\tif (current === undefined) return createNodeVersion(policy, value);\n\tif (policy.level === 0) {\n\t\treturn Object.freeze({ level: 0, counter: current.counter + 1 });\n\t}\n\tconst previous = current.level === 1 ? current.cid : null;\n\treturn Object.freeze({\n\t\tlevel: 1,\n\t\tcounter: current.counter + 1,\n\t\tcid: computeV1Cid(policy, value),\n\t\tprev: previous,\n\t});\n}\n\nexport function cloneNodeVersion(version: NodeVersion | undefined): NodeVersion | undefined {\n\tif (version === undefined) return undefined;\n\tif (version.level === 0) return Object.freeze({ level: 0, counter: version.counter });\n\treturn Object.freeze({\n\t\tlevel: 1,\n\t\tcounter: version.counter,\n\t\tcid: version.cid,\n\t\tprev: version.prev,\n\t});\n}\n\nexport function restoredV1Cid(\n\tpolicy: Extract<ResolvedNodeVersioningPolicy, { enabled: true; level: 1 }>,\n\thasData: boolean,\n\tcache: unknown,\n): string {\n\treturn computeV1Cid(policy, hasData ? cache : ABSENT_V1_SEED);\n}\n\nexport function validateNodeVersionJson(value: unknown, path: string): NodeVersionJson {\n\tif (typeof value !== \"object\" || value === null) {\n\t\tthrow new Error(`restoreGraph: ${path} must be an object`);\n\t}\n\tconst record = value as Record<string, unknown>;\n\tif (record.level === 0) {\n\t\tif (!Number.isSafeInteger(record.counter) || (record.counter as number) < 0) {\n\t\t\tthrow new Error(`restoreGraph: ${path}.counter must be a non-negative safe integer`);\n\t\t}\n\t\treturn Object.freeze({ level: 0, counter: record.counter as number });\n\t}\n\tif (record.level === 1) {\n\t\tif (!Number.isSafeInteger(record.counter) || (record.counter as number) < 0) {\n\t\t\tthrow new Error(`restoreGraph: ${path}.counter must be a non-negative safe integer`);\n\t\t}\n\t\tif (typeof record.cid !== \"string\") {\n\t\t\tthrow new Error(`restoreGraph: ${path}.cid must be a string`);\n\t\t}\n\t\tif (record.prev !== null && typeof record.prev !== \"string\") {\n\t\t\tthrow new Error(`restoreGraph: ${path}.prev must be a string or null`);\n\t\t}\n\t\tif ((record.counter as number) === 0 && record.prev !== null) {\n\t\t\tthrow new Error(`restoreGraph: ${path}.prev must be null when counter is 0`);\n\t\t}\n\t\tif ((record.counter as number) > 0 && typeof record.prev !== \"string\") {\n\t\t\tthrow new Error(`restoreGraph: ${path}.prev must be a string when counter is > 0`);\n\t\t}\n\t\treturn Object.freeze({\n\t\t\tlevel: 1,\n\t\t\tcounter: record.counter as number,\n\t\t\tcid: record.cid,\n\t\t\tprev: record.prev,\n\t\t});\n\t}\n\tthrow new Error(`restoreGraph: ${path}.level must be 0 or 1`);\n}\n","import { currentBatch, deferToBatch } from \"../batch/batch.js\";\nimport { deferRewire, scheduleBoundaryDrain } from \"../batch/boundary.js\";\nimport type { DeliveryMeta } from \"../ctx/types.js\";\nimport type { LockId, Message, PullDemand, Wave } from \"../protocol/messages.js\";\nimport {\n\tisDeferredTier,\n\tisPauseBufferedTier,\n\tisUpAllowed,\n\tisValueTier,\n\tmessageTier,\n\tSENTINEL,\n} from \"../protocol/messages.js\";\nimport type { Node } from \"./node.js\";\nimport { type NodeRuntimeHost, nodeRuntimeHost } from \"./node-runtime-host.js\";\nimport { normalizePullDemand, validateDownPayloads } from \"./protocol-guards.js\";\nimport type { UpRouteState } from \"./types.js\";\nimport {\n\tadvanceNodeVersion,\n\tassertNodeVersionDataCompatible,\n\tsnapshotNodeVersionData,\n} from \"./versioning.js\";\n\nexport function nodeDown<T>(self: NodeRuntimeHost<T>, msgs: Wave): void {\n\tif (self._released) return;\n\tvalidateDownPayloads(msgs);\n\tconst deliveryWave = {};\n\tconst assertVersionDataCompatible = (wave: readonly Message[]) => {\n\t\tfor (const m of wave) {\n\t\t\tif (m[0] === \"DATA\") assertNodeVersionDataCompatible(self._version.policy, m[1]);\n\t\t}\n\t};\n\tconst snapshotVersionData = (wave: readonly Message[]): Message[] =>\n\t\twave.map((m) =>\n\t\t\tm[0] === \"DATA\"\n\t\t\t\t? ([\"DATA\", snapshotNodeVersionData(self._version.policy, m[1])] as Message)\n\t\t\t\t: m,\n\t\t);\n\tassertVersionDataCompatible(msgs);\n\t// Terminal-is-forever (R-terminal / D17 / B30): once COMPLETE/ERROR has been emitted the\n\t// node is final — a self-emit (state.set / ctx.down) in a LATER wave is a no-op, never\n\t// resurrecting the cache or re-emitting. The COMPLETE/ERROR arms below also self-guard\n\t// against a double terminal, but DATA/RESOLVED/INVALIDATE had no entry guard, so a\n\t// post-terminal set() would overwrite cache + emit DATA. R-teardown-terminal-relay / D65\n\t// carves out the only post-terminal exception: TEARDOWN still relays downstream for unwire\n\t// without reopening value output. A single wave that goes terminal mid-loop (e.g.\n\t// [COMPLETE, TEARDOWN]) is unaffected: _terminal is still undefined at entry.\n\t// Resubscribable reset clears _terminal before any re-emit.\n\tif (self._value.terminal !== undefined) {\n\t\tif (!msgs.some((m) => m[0] === \"TEARDOWN\")) return;\n\t\tself._value.hasTorndown = true;\n\t\tif (self._slot.resetOnTeardown) {\n\t\t\tself._value.cache = SENTINEL;\n\t\t\tself._value.hasData = false;\n\t\t}\n\t\tself._emitToSubs([\"TEARDOWN\"], { wave: deliveryWave, last: true });\n\t\treturn;\n\t}\n\tlet sorted: Message[] = [...msgs].sort((a, b) => messageTier(a[0]) - messageTier(b[0]));\n\t// R-same-wave-merge: collapse repeated INVALIDATE in one wave (Q9) so the\n\t// cleanup hook + downstream broadcast fire at most once.\n\tconst firstInvalidate = sorted.findIndex((m) => m[0] === \"INVALIDATE\");\n\tif (firstInvalidate !== -1) {\n\t\tsorted = sorted.filter((m, i) => m[0] !== \"INVALIDATE\" || i === firstInvalidate);\n\t}\n\t// R-teardown-complete: a TEARDOWN reaching a non-terminal node synthesizes a\n\t// COMPLETE prefix (so firstValueFrom-style bridges resolve), unless the wave\n\t// already carries a terminal or the node already tore down.\n\tconst hasTeardown = sorted.some((m) => m[0] === \"TEARDOWN\");\n\tconst hasTerminal = sorted.some((m) => m[0] === \"COMPLETE\" || m[0] === \"ERROR\");\n\tif (\n\t\thasTeardown &&\n\t\t!hasTerminal &&\n\t\tself._value.terminal === undefined &&\n\t\t!self._value.hasTorndown\n\t) {\n\t\tsorted = [[\"COMPLETE\"], ...sorted];\n\t}\n\t// R-batch-coalesce (D12): inside a batch, emit DIRTY immediately but defer the\n\t// tier-3 settle slice to commit so a shared downstream recomputes once. Only\n\t// external emits defer (fn emits during commit run normally).\n\tif (!self._wave.insideRunWave && currentBatch()) {\n\t\tconst deferred = snapshotVersionData(sorted.filter((m) => isDeferredTier(m[0])));\n\t\tif (deferred.length > 0) {\n\t\t\tif (!self._wave.emittedDirtyThisWave) {\n\t\t\t\tself._wave.emittedDirtyThisWave = true;\n\t\t\t\tself._value.status = \"dirty\";\n\t\t\t\tself._emitToSubs([\"DIRTY\"], { wave: deliveryWave, last: false });\n\t\t\t}\n\t\t\tself._wave.batchDirtyOwed = true; // BH1: owe a balancing RESOLVED on rollback\n\t\t\tdeferToBatch(self as unknown as Node<unknown>, deferred);\n\t\t\treturn;\n\t\t}\n\t}\n\t// R-pause-modes / R-async-paused: defer the settle slice (tier 3/4) into the\n\t// pause buffer while paused; tier 0-2 (DIRTY/PAUSE/RESUME), tier 5 (terminal),\n\t// tier 6 (TEARDOWN) bypass so end-of-stream + control always reach observers.\n\tif (self._shouldBufferOnPause()) {\n\t\tconst buffered = snapshotVersionData(sorted.filter((m) => isPauseBufferedTier(m[0])));\n\t\tif (buffered.length > 0) {\n\t\t\t// B36 / R-resolved-undirty: buffering a settle slice still means this fn wave\n\t\t\t// produced a settle. Without this, _runWave sees \"dirty + no settle\" and\n\t\t\t// synthesizes a RESOLVED that pierces the pause while the DATA waits in the buffer.\n\t\t\tself._wave.emittedSettleThisWave = true;\n\t\t\tself._control.pauseBuffer.push(buffered);\n\t\t}\n\t\tsorted = sorted.filter((m) => !isPauseBufferedTier(m[0]));\n\t\tif (sorted.length === 0) return;\n\t}\n\tlet dataCount = 0;\n\tlet hasTier3 = false;\n\tlet hasResolved = false;\n\tfor (const m of sorted) {\n\t\tif (m[0] === \"DATA\") dataCount++;\n\t\tif (m[0] === \"RESOLVED\") hasResolved = true;\n\t\tif (isValueTier(m[0])) hasTier3 = true;\n\t}\n\t// EC2 / R-resolved-undirty tier-3 exclusivity: a wave's tier-3 slot is >=1 DATA\n\t// (occurrence) XOR exactly 1 RESOLVED (undirty) — never mixed. Reject fail-fast.\n\tif (dataCount >= 1 && hasResolved) {\n\t\tthrow new Error(\n\t\t\t\"down: a wave cannot mix DATA and RESOLVED (tier-3 exclusivity, R-resolved-undirty)\",\n\t\t);\n\t}\n\tconst plannedVersions: Array<NodeVersion | undefined> = new Array(sorted.length);\n\tif (dataCount > 0) {\n\t\tlet plannedVersion = self._version.value;\n\t\tfor (let i = 0; i < sorted.length; i++) {\n\t\t\tconst m = sorted[i];\n\t\t\tif (m[0] !== \"DATA\") continue;\n\t\t\tplannedVersion = advanceNodeVersion(plannedVersion, self._version.policy, m[1]);\n\t\t\tplannedVersions[i] = plannedVersion;\n\t\t}\n\t}\n\n\t// Synthesize a leading DIRTY for an EXTERNAL tier-3 emit (R-dirty-before-data), and for\n\t// PULL demand fns only when they actually emit tier-3. A no-op pull helper must stay silent.\n\tif (\n\t\thasTier3 &&\n\t\t(!self._wave.insideRunWave || self._control.pullDirtyOwed) &&\n\t\t!self._wave.emittedDirtyThisWave\n\t) {\n\t\tself._wave.emittedDirtyThisWave = true;\n\t\tself._value.status = \"dirty\";\n\t\tself._emitToSubs([\"DIRTY\"], { wave: deliveryWave, last: false });\n\t}\n\n\tfor (let i = 0; i < sorted.length; i++) {\n\t\tconst m = sorted[i];\n\t\tconst delivery = { wave: deliveryWave, last: i === sorted.length - 1 };\n\t\t// R-resolved-undirty (D49): a tier-3+ emit this wave means the fn produced a settle,\n\t\t// so no synthesized undirty RESOLVED is owed (see _runWave).\n\t\tif (isDeferredTier(m[0])) self._wave.emittedSettleThisWave = true;\n\t\tif (m[0] === \"DIRTY\") {\n\t\t\tif (!self._wave.emittedDirtyThisWave) {\n\t\t\t\tself._wave.emittedDirtyThisWave = true;\n\t\t\t\tself._value.status = \"dirty\";\n\t\t\t\tself._emitToSubs([\"DIRTY\"], delivery);\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (m[0] === \"DATA\") {\n\t\t\tconst v = m[1] as T;\n\t\t\t// R-resolved-undirty (D49): every value-occurrence is emitted as DATA — the\n\t\t\t// substrate never substitutes DATA->RESOLVED on value-equality. Dedup is opt-in\n\t\t\t// at the operator layer (distinctUntilChanged), never a substrate behavior.\n\t\t\tself._value.cache = v;\n\t\t\tself._value.hasData = true;\n\t\t\tself._value.status = \"settled\";\n\t\t\tself._version.value = plannedVersions[i];\n\t\t\tif (self._slot.replayN > 0) {\n\t\t\t\tself._value.replayRing.push(v);\n\t\t\t\tif (self._value.replayRing.length > self._slot.replayN) self._value.replayRing.shift();\n\t\t\t}\n\t\t\tself._emitToSubs([\"DATA\", v], delivery);\n\t\t\tcontinue;\n\t\t}\n\t\tif (m[0] === \"RESOLVED\") {\n\t\t\tself._value.status = self._value.hasData ? \"resolved\" : \"sentinel\";\n\t\t\tself._emitToSubs([\"RESOLVED\"], delivery);\n\t\t\tcontinue;\n\t\t}\n\t\tif (m[0] === \"INVALIDATE\") {\n\t\t\tself._invalidate(delivery);\n\t\t\tcontinue;\n\t\t}\n\t\tif (m[0] === \"COMPLETE\") {\n\t\t\tif (self._value.terminal !== undefined) continue;\n\t\t\tself._value.terminal = true;\n\t\t\tself._control.pauseBuffer = []; // BH3: terminal discards buffered settle slices\n\t\t\tself._value.status = \"completed\";\n\t\t\tself._emitToSubs([\"COMPLETE\"], delivery);\n\t\t\tcontinue;\n\t\t}\n\t\tif (m[0] === \"ERROR\") {\n\t\t\tif (self._value.terminal !== undefined) continue;\n\t\t\tself._value.terminal = m[1];\n\t\t\tself._control.pauseBuffer = []; // BH3: terminal discards buffered settle slices\n\t\t\tself._value.status = \"errored\";\n\t\t\tself._emitToSubs([\"ERROR\", m[1]], delivery);\n\t\t\tcontinue;\n\t\t}\n\t\tif (m[0] === \"TEARDOWN\") {\n\t\t\tself._value.hasTorndown = true;\n\t\t\tif (self._slot.resetOnTeardown) {\n\t\t\t\tself._value.cache = SENTINEL;\n\t\t\t\tself._value.hasData = false;\n\t\t\t}\n\t\t\tself._emitToSubs([\"TEARDOWN\"], delivery);\n\t\t}\n\t\t// PAUSE / RESUME — control slice.\n\t}\n\n\tif (!self._wave.insideRunWave) self._wave.emittedDirtyThisWave = false;\n}\n\nexport function nodeUp<T>(\n\tself: NodeRuntimeHost<T>,\n\tmsgs: Wave,\n\ttowardDep?: number,\n\troute?: UpRouteState,\n): void {\n\tif (self._released) return;\n\tconst routeState = route ?? { demandFired: new Map() };\n\tfor (const m of msgs) {\n\t\tif (!isUpAllowed(m[0])) {\n\t\t\tthrow new Error(\n\t\t\t\t`ctx.up: ${m[0]} is down-only (tier ${messageTier(m[0])}); up carries control tiers only (R-ctx-up)`,\n\t\t\t);\n\t\t}\n\t}\n\tfor (const m of msgs) {\n\t\tif (m[0] === \"PAUSE\") {\n\t\t\t// PAUSE is NODE-TARGETED (R-up-routing): it ACQUIRES a lock, so there is no\n\t\t\t// pre-existing holder to route to — a controller targets the node directly.\n\t\t\tself._pauseAcquire(m[1]);\n\t\t} else if (m[0] === \"RESUME\") {\n\t\t\t// R-up-routing (D269): RESUME is pause-lock release only.\n\t\t\tif (self._control.pauseLockset.has(m[1])) {\n\t\t\t\t// a pause lock held HERE → release LOCALLY (normal pause/resume, R-pause-lockset).\n\t\t\t\tself._pauseRelease(m[1]);\n\t\t\t} else {\n\t\t\t\t// not held here → forward UP the declared cone to find the holder.\n\t\t\t\tself._forwardUp(m, towardDep, routeState);\n\t\t\t}\n\t\t} else if (m[0] === \"PULL\") {\n\t\t\t// R-up-routing / R-pull (D269/D272): DEMAND-IF-PULL-HOLDER-ELSE-FORWARD-UP.\n\t\t\tconst demand = normalizePullDemand(m[1]);\n\t\t\tif (self._slot.pull && demand.pullId === self._slot.pullLock) {\n\t\t\t\tif (!self._markDemandRouted(demand.pullId, routeState)) self._onDemand(demand);\n\t\t\t} else {\n\t\t\t\tself._forwardUp([\"PULL\", demand], towardDep, routeState);\n\t\t\t}\n\t\t} else if (self._slot.deps.length === 0) {\n\t\t\t// R-up-at-source (D38): a depless source is the terminus of upstream control.\n\t\t\t// INVALIDATE → HONOR the invalidate-request. Routed through _down (NOT a direct\n\t\t\t// _invalidate call, QA A-2) so the invalidate-request respects batch-defer (D12)\n\t\t\t// and pause-buffer exactly like a downstream-originated INVALIDATE; _down's\n\t\t\t// INVALIDATE branch calls _invalidate() (clear cache → SENTINEL, fire onInvalidate,\n\t\t\t// broadcast downstream). Outside batch/pause it is identical to a direct call.\n\t\t\t// DIRTY / TEARDOWN → DROP (no coherent terminus action; self-dirty would wedge\n\t\t\t// downstream awaiting a settle that never comes; source lifecycle is source-owned).\n\t\t\tif (m[0] === \"INVALIDATE\") self._down([[\"INVALIDATE\"]]);\n\t\t} else {\n\t\t\t// dep-bearing intermediate: forward DIRTY/INVALIDATE/TEARDOWN up toward deps.\n\t\t\tself._forwardUp(m, towardDep, routeState);\n\t\t}\n\t}\n}\n\nexport function nodeMarkDemandRouted<T>(\n\tself: NodeRuntimeHost<T>,\n\tlockId: LockId,\n\troute: UpRouteState,\n): boolean {\n\tlet holders = route.demandFired.get(lockId);\n\tif (holders === undefined) {\n\t\tholders = new Set();\n\t\troute.demandFired.set(lockId, holders);\n\t}\n\tconst node = self as unknown as Node<unknown>;\n\tif (holders.has(node)) return true;\n\tholders.add(node);\n\treturn false;\n}\n\nexport function nodeForwardUp<T>(\n\tself: NodeRuntimeHost<T>,\n\tm: Message,\n\ttowardDep: number | undefined,\n\troute: UpRouteState,\n): void {\n\tif (self._slot.deps.length === 0) return; // depless source terminus → drop\n\tif (towardDep !== undefined) {\n\t\tconst d = self._slot.deps[towardDep];\n\t\tif (d !== undefined) nodeRuntimeHost(d)._up([m], undefined, route);\n\t} else {\n\t\tfor (const dep of self._slot.deps) nodeRuntimeHost(dep)._up([m], undefined, route);\n\t}\n}\n\nexport function nodeIsPaused<T>(self: NodeRuntimeHost<T>): boolean {\n\treturn self._control.pauseLockset.size > 0;\n}\n\nexport function nodeHasBoundaryPauseLock<T>(self: NodeRuntimeHost<T>): boolean {\n\tif (self._slot.pausable === false) return false;\n\treturn self._control.pauseLockset.size > 0;\n}\n\nexport function nodeIsAsyncPool<T>(self: NodeRuntimeHost<T>): boolean {\n\treturn (\n\t\tself._slot.handle !== null &&\n\t\tself._slot.dispatcher.poolKind(self._slot.handle.poolId) === \"async\"\n\t);\n}\n\nexport function nodePauseAcquire<T>(self: NodeRuntimeHost<T>, lockId: unknown): void {\n\tself._control.pauseLockset.add(lockId); // Set => same-id repeat PAUSE is idempotent\n}\n\nexport function nodePauseRelease<T>(self: NodeRuntimeHost<T>, lockId: unknown): void {\n\tif (!self._control.pauseLockset.has(lockId)) return; // unknown id => no-op\n\tself._control.pauseLockset.delete(lockId);\n\t// R-pull (D59 / D272): releasing an EXTERNAL pause lock can unblock an owed demand.\n\t// Pull quiet is activePull-derived and never stored in pauseLockset.\n\tif (self._slot.pull && self._control.demandOwed !== undefined) self._fireOwedDemandIfReady();\n\tif (self._hasBoundaryPauseLock()) return; // another external lock still held => stay paused\n\tscheduleBoundaryDrain(self._core);\n\tif (self._slot.pull) return; // pull nodes stay quiet until PULL, even after external resume\n\tself._onResume();\n}\n\nexport function nodeOnResume<T>(self: NodeRuntimeHost<T>): void {\n\t// BH3: a node that terminated while paused discards its buffer and never\n\t// replays/recomputes (terminal-is-forever).\n\tif (self._value.terminal !== undefined) {\n\t\tself._control.pauseBuffer = [];\n\t\tself._control.pausedDepWaveOccurred = false;\n\t\tself._control.demandOwed = undefined;\n\t\tself._control.activePull = undefined;\n\t\tself._control.pullDirtyOwed = false;\n\t\treturn;\n\t}\n\t// Non-pull pause/resume (R-pause-modes): drain buffered settle slices (resumeAll /\n\t// async-at-paused, R-async-paused), then fire a coalesced dep-wave once (default mode).\n\t// A PULL node does not resume by draining here; its demand fires through _onDemand.\n\tif (self._control.pauseBuffer.length > 0) {\n\t\tconst buf = self._control.pauseBuffer;\n\t\tself._control.pauseBuffer = [];\n\t\tfor (const wave of buf) self._down(wave);\n\t}\n\tif (self._control.pausedDepWaveOccurred) {\n\t\tself._control.pausedDepWaveOccurred = false;\n\t\tself._tryRun();\n\t}\n}\n\nexport function nodeCanFireDemand<T>(self: NodeRuntimeHost<T>): boolean {\n\tif (self._value.terminal !== undefined || self._wave.pending > 0) return false;\n\treturn self._control.pauseLockset.size === 0;\n}\n\nexport function nodeDeliverPullDemand<T>(self: NodeRuntimeHost<T>, demand: PullDemand): void {\n\tself._control.demandOwed = undefined;\n\tself._control.activePull = demand;\n\tself._control.inDeliverDemand = true;\n\ttry {\n\t\tself._firePullDemand();\n\t} finally {\n\t\tself._control.activePull = undefined;\n\t\tself._control.inDeliverDemand = false;\n\t}\n}\n\nexport function nodeOnDemand<T>(self: NodeRuntimeHost<T>, demand: PullDemand): void {\n\tif (self._control.inDeliverDemand) return; // re-entrant demand during an active delivery → drop (1:1)\n\tif (self._canFireDemand()) self._deliverPullDemand(demand);\n\telse self._control.demandOwed = demand; // latest owed params wins (D269/D272)\n}\n\nexport function nodeFirePullDemand<T>(self: NodeRuntimeHost<T>): void {\n\tlet drainedBuffer = false;\n\tif (self._control.pauseBuffer.length > 0) {\n\t\tconst buf = self._control.pauseBuffer;\n\t\tself._control.pauseBuffer = [];\n\t\tfor (const wave of buf) self._down(wave);\n\t\tdrainedBuffer = true;\n\t}\n\tif (drainedBuffer) return;\n\tif (self._control.pausedDepWaveOccurred) {\n\t\t// QA-B2: only deliver if the fn can actually run this wave (settle-ready + first-run gate\n\t\t// open). A gated run emits no DATA, so emitting the leading DIRTY would STRAND downstream\n\t\t// — the exact wedge this feature exists to prevent (NoWedgeWhileQuiet). When gated, stay\n\t\t// SILENT and KEEP _pausedDepWaveOccurred so a later demand (once every dep has settled)\n\t\t// delivers. Mirrors _settleRewire's pre-_markDirty gate.\n\t\tconst gated =\n\t\t\tself._slot.handle !== null &&\n\t\t\t!self._wave.hasCalledFnOnce &&\n\t\t\t!(self._slot.partial || self._allDepsSettled());\n\t\tif (self._wave.pending > 0 || gated) return;\n\t\tself._control.pausedDepWaveOccurred = false;\n\t\tself._wave.emittedDirtyThisWave = false;\n\t\tself._control.pullDirtyOwed = true;\n\t\ttry {\n\t\t\tself._tryRun(); // fn DATA triggers DIRTY-before-DATA; no DATA means no output.\n\t\t} finally {\n\t\t\tself._control.pullDirtyOwed = false;\n\t\t}\n\t\treturn;\n\t}\n\tif (self._slot.handle !== null) {\n\t\tif (!self._wave.hasCalledFnOnce && !(self._slot.partial || self._allDepsSettled())) return;\n\t\tself._wave.emittedDirtyThisWave = false;\n\t\tself._control.pullDirtyOwed = true;\n\t\ttry {\n\t\t\tself._runWave();\n\t\t} finally {\n\t\t\tself._control.pullDirtyOwed = false;\n\t\t}\n\t}\n}\n\nexport function nodeFireOwedDemandIfReady<T>(self: NodeRuntimeHost<T>): void {\n\tif (self._control.inDeliverDemand) return; // don't re-enter during an active delivery (1:1, QA guard)\n\tif (self._slot.pull && self._control.demandOwed !== undefined && self._canFireDemand()) {\n\t\tself._deliverPullDemand(self._control.demandOwed);\n\t}\n}\n\nexport function nodeShouldBufferOnPause<T>(self: NodeRuntimeHost<T>): boolean {\n\t// D44: pausable mode is the OUTER gate over R-async-paused buffering.\n\t// false: ignore PAUSE/RESUME ENTIRELY — never buffer, keep producing (R-pause-modes; resolves B20).\n\tif (self._slot.pausable === false) return false;\n\tif (!self._isPaused() && !self._isPullQuiet()) return false;\n\t// resumeAll: production-gating — buffer the node's own (sync/async) settle slice too.\n\tif (self._slot.pausable === \"resumeAll\") return true;\n\t// true (default): PAUSE gates recomputation/propagation, NOT a leaf source's own production.\n\t// An async COMPUTE node's (deps>0) in-flight result buffers (R-async-paused / C-2); a depless\n\t// async leaf source's own production delivers immediately (R-pause-modes / C-10).\n\tif (!self._wave.insideRunWave && self._isAsyncPool() && self._slot.deps.length > 0) return true;\n\treturn false;\n}\n\nexport function nodeInvalidate<T>(self: NodeRuntimeHost<T>, delivery?: DeliveryMeta): void {\n\tif (!self._value.hasData) return; // never-populated or already-reset → no-op\n\tself._value.cache = SENTINEL;\n\tself._value.hasData = false;\n\tself._value.status = \"sentinel\";\n\tself._value.replayRing = []; // BH6: invalidated values are stale — don't replay them\n\tfor (const fn of self._hooks.onInvalidate) fn();\n\tself._emitToSubs([\"INVALIDATE\"], delivery);\n}\n\nexport function nodeAllDepsTerminal<T>(self: NodeRuntimeHost<T>): boolean {\n\tif (self._slot.deps.length === 0) return false;\n\tfor (const tm of self._dep.terminal) if (tm === undefined) return false;\n\treturn true;\n}\n\nexport function nodeResetLifecycle<T>(self: NodeRuntimeHost<T>): void {\n\tfor (const u of self._dep.unsubs) if (u) u();\n\tself._dep.unsubs = [];\n\tself._dep.idxBoxes = [];\n\tself._lifecycle.subscribers.clear();\n\tself._lifecycle.activated = false;\n\tself._value.terminal = undefined;\n\tself._value.hasTorndown = false;\n\tself._wave.hasCalledFnOnce = false;\n\tself._resetDepState();\n\tself._control.pauseLockset.clear();\n\tself._control.pauseBuffer = [];\n\tself._control.pausedDepWaveOccurred = false;\n\tself._control.demandOwed = undefined; // R-pull (D269): drop any deferred demand\n\tself._control.activePull = undefined;\n\tself._control.pullDirtyOwed = false;\n\tself._value.replayRing = []; // BH6\n\tconst isCompute = self._slot.handle !== null || self._slot.deps.length > 0;\n\tif (isCompute) {\n\t\tself._value.cache = SENTINEL;\n\t\tself._value.hasData = false;\n\t\tself._value.status = \"sentinel\";\n\t} else {\n\t\tself._value.status = self._value.hasData ? \"settled\" : \"sentinel\";\n\t}\n\tif (!self._privateState.persist) self._privateState.value = SENTINEL;\n}\n\nexport function nodeEmitToSubs<T>(\n\tself: NodeRuntimeHost<T>,\n\tmsg: Message,\n\tdelivery?: DeliveryMeta,\n): void {\n\tif (self._released) return;\n\t// Copy guards against subscribe/unsubscribe during iteration.\n\tconst subs = [...self._lifecycle.subscribers];\n\tfor (const sink of subs) sink(msg, delivery);\n}\n\nexport function nodeCommitBatchedWave<T>(self: NodeRuntimeHost<T>, wave: Wave): void {\n\tself._wave.batchDirtyOwed = false; // commit delivers the real settle (BH1)\n\tself._down(wave); // batch is inactive at commit -> processes normally\n}\n\nexport function nodeRollbackBatched<T>(self: NodeRuntimeHost<T>): void {\n\t// BH1: keyed on _batchDirtyOwed (not _emittedDirtyThisWave, which a fn wave between\n\t// defer and rollback would have reset) so the balancing RESOLVED is never skipped.\n\tif (self._wave.batchDirtyOwed) {\n\t\tself._wave.batchDirtyOwed = false;\n\t\tself._wave.emittedDirtyThisWave = false;\n\t\tself._value.status = self._value.hasData ? \"settled\" : \"sentinel\";\n\t\tself._emitToSubs([\"RESOLVED\"]);\n\t}\n}\n\nexport function nodeDeferBoundary<T>(\n\tself: NodeRuntimeHost<T>,\n\tfn: () => void,\n\tbatchToken?: object,\n): void {\n\tdeferRewire(self._core, fn, {\n\t\tbatchToken,\n\t\tisReady: () => !self._hasBoundaryPauseLock(),\n\t});\n}\n","import { currentBoundaryBatchToken, deferAfterBatchForTarget } from \"../batch/batch.js\";\nimport { deferRewire } from \"../batch/boundary.js\";\nimport type { NodeFn } from \"../ctx/types.js\";\nimport type { Wave } from \"../protocol/messages.js\";\nimport { errorPayload, SENTINEL } from \"../protocol/messages.js\";\nimport type { Node } from \"./node.js\";\nimport { type NodeRuntimeHost, nodeRuntimeHost } from \"./node-runtime-host.js\";\nimport { notifyTopologyDepsChanged } from \"./runtime-accessors.js\";\nimport type { RewireOp } from \"./types.js\";\n\nexport function nodeRequestRewireNext<T>(self: NodeRuntimeHost<T>, op: RewireOp): void {\n\tdeferRewire(self._core, () => self._applyRewireNext(op), {\n\t\tbatchToken: currentBoundaryBatchToken(),\n\t\tisReady: () => !self._hasBoundaryPauseLock(),\n\t});\n}\n\nexport function nodeRequestUpNext<T>(\n\tself: NodeRuntimeHost<T>,\n\tmsgs: Wave,\n\ttowardDep?: number,\n): void {\n\tdeferRewire(\n\t\tself._core,\n\t\t() => {\n\t\t\tif (!self._released) self._up(msgs, towardDep);\n\t\t},\n\t\t{\n\t\t\tbatchToken: currentBoundaryBatchToken(),\n\t\t\tisReady: () => !self._hasBoundaryPauseLock(),\n\t\t},\n\t);\n}\n\nexport function nodeApplyRewireNext<T>(self: NodeRuntimeHost<T>, op: RewireOp): void {\n\tif (self._released) return;\n\ttry {\n\t\t// D62 / R-rewire-deferred: terminal seals output but does NOT cancel queued topology.\n\t\t// Public/immediate rewire of a terminal node still rejects; the exception is only for\n\t\t// self-triggered ops already issued before terminal and now draining at the boundary.\n\t\tif (op.kind === \"add\") {\n\t\t\tconst next = self._slot.deps.includes(op.dep)\n\t\t\t\t? [...self._slot.deps]\n\t\t\t\t: [...self._slot.deps, op.dep];\n\t\t\tself._rewire(next, op.fn, { allowTerminalOwner: true });\n\t\t} else if (op.kind === \"remove\") {\n\t\t\tself._rewire(\n\t\t\t\tself._slot.deps.filter((d) => d !== op.dep),\n\t\t\t\top.fn,\n\t\t\t\t{ allowTerminalOwner: true },\n\t\t\t);\n\t\t} else {\n\t\t\tself._rewire(self._dedupDeps(op.deps), op.fn, { allowTerminalOwner: true });\n\t\t}\n\t} catch (e) {\n\t\t// An invalid deferred op (cycle / self / non-resubscribable terminal dep) surfaces as\n\t\t// an ERROR on this node (D30-consistent) rather than stranding the rest of the drain\n\t\t// queue. Reachable only on misuse — higher-order operator inners are fresh, acyclic\n\t\t// leaf sources. Coerce a SENTINEL reason (a rewire fn that `throw undefined`s) to a real\n\t\t// Error so _down's R-data-payload guard does not itself throw out of the drain.\n\t\tself._down([[\"ERROR\", errorPayload(e, \"rewireNext op failed\")]]);\n\t}\n}\n\nexport function nodeRewire<T>(\n\tself: NodeRuntimeHost<T>,\n\tnewDeps: Node<unknown>[],\n\tfn: NodeFn,\n\topts: { allowTerminalOwner?: boolean } = {},\n): boolean {\n\tconst node = self as unknown as Node<unknown>;\n\t// ── rejects (R-rewire / D42) ──\n\tif (self._value.terminal !== undefined && !opts.allowTerminalOwner)\n\t\tthrow new Error(\n\t\t\t\"rewire: node is terminal (completed/errored) — cannot rewire (R-rewire / D42)\",\n\t\t);\n\tif (self._wave.insideRunWave)\n\t\tthrow new Error(\n\t\t\t\"rewire: mid-fn topology mutation — a fn mutating its own deps mid-wave is the feedback cycle (R-rewire / D37)\",\n\t\t);\n\tif (self._wave.inDepMutation)\n\t\tthrow new Error(\n\t\t\t\"rewire: reentrant dep mutation — another replaceDeps/subscribeDep/unsubscribeDep is in flight (R-rewire)\",\n\t\t);\n\tif (newDeps.includes(node)) throw new Error(\"rewire: self-dependency rejected (R-rewire / D42)\");\n\tconst oldDeps = self._slot.deps;\n\tconst added = newDeps.filter((d) => !oldDeps.includes(d));\n\tfor (const d of added) {\n\t\tif (self._reachableUpstream(d, node))\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: would create a cycle — dep already transitively depends on this node (R-rewire / D42)\",\n\t\t\t);\n\t\tconst dep = nodeRuntimeHost(d);\n\t\tif (dep._value.terminal !== undefined && !dep._slot.resubscribable)\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: cannot add a non-resubscribable terminal dep — would wedge (R-rewire / D42)\",\n\t\t\t);\n\t\tself._assertRewireDepOwner(d);\n\t}\n\n\tif (\n\t\tdeferAfterBatchForTarget(node, () => {\n\t\t\tself._rewire(newDeps, fn, { ...opts, allowTerminalOwner: true });\n\t\t})\n\t) {\n\t\treturn true;\n\t}\n\tif (!self._lifecycle.activated) self._restoredActivationPending = false;\n\n\tself._wave.inDepMutation = true;\n\tself._wave.rewireRunPending = false;\n\tlet zeroDepUnDirty = false;\n\ttry {\n\t\t// fn swap (SD-1): re-register against the same pool, then release the old handle\n\t\t// (B15) so the rewired-away fn closure is GC'd and its dispatcher slot is reused —\n\t\t// a rewire-heavy graph (CSP-2.7 *Map) no longer leaks a handle per swap. Register\n\t\t// first, then unregister the old: self._slot.handle never points at a freed slot, and a\n\t\t// null old handle (a passthrough/state node gaining a fn) has nothing to free.\n\t\tconst oldHandle = self._slot.handle;\n\t\tself._slot.handle = self._slot.dispatcher.register(fn, self._slot.pool);\n\t\tif (oldHandle !== null) self._slot.dispatcher.unregister(oldHandle);\n\n\t\tconst removed = oldDeps.filter((d) => !newDeps.includes(d));\n\t\tlet removedDirtyContributor = false;\n\t\tfor (const d of removed) {\n\t\t\tconst oldIdx = oldDeps.indexOf(d);\n\t\t\tif (self._dep.dirty[oldIdx]) {\n\t\t\t\tremovedDirtyContributor = true;\n\t\t\t\tself._wave.pending--;\n\t\t\t}\n\t\t\tif (self._lifecycle.activated) {\n\t\t\t\tconst box = self._dep.idxBoxes[oldIdx];\n\t\t\t\tif (box) box.v = -1; // drain: any stale in-flight callback drops\n\t\t\t\tconst unsub = self._dep.unsubs[oldIdx];\n\t\t\t\tif (unsub) unsub(); // stops the removed dep's edge — no further delivery\n\t\t\t}\n\t\t}\n\n\t\t// Rebuild per-dep parallel arrays in newDeps order; kept deps carry their state\n\t\t// + subscription, added deps start fresh (R-rewire Q1/Q4).\n\t\tconst n = newDeps.length;\n\t\tconst newBatch: Array<unknown[] | null> = new Array(n).fill(null);\n\t\tconst newPrev: unknown[] = new Array(n).fill(SENTINEL);\n\t\tconst newHasData: boolean[] = new Array(n).fill(false);\n\t\tconst newDirty: boolean[] = new Array(n).fill(false);\n\t\tconst newTier: number[] = new Array(n).fill(0);\n\t\tconst newTerminal: Array<true | unknown | undefined> = new Array(n).fill(undefined);\n\t\tconst newTerminalInput: Array<true | unknown | undefined> = new Array(n).fill(undefined);\n\t\tconst newUnsubs: Array<() => void> = new Array(n);\n\t\tconst newBoxes: Array<{ v: number }> = new Array(n);\n\t\tfor (let j = 0; j < n; j++) {\n\t\t\tconst oldIdx = oldDeps.indexOf(newDeps[j]);\n\t\t\tif (oldIdx !== -1) {\n\t\t\t\tnewBatch[j] = self._dep.batch[oldIdx];\n\t\t\t\tnewPrev[j] = self._dep.prev[oldIdx];\n\t\t\t\tnewHasData[j] = self._dep.hasData[oldIdx];\n\t\t\t\tnewDirty[j] = self._dep.dirty[oldIdx];\n\t\t\t\tnewTier[j] = self._dep.tier[oldIdx];\n\t\t\t\tnewTerminal[j] = self._dep.terminal[oldIdx];\n\t\t\t\tnewUnsubs[j] = self._dep.unsubs[oldIdx];\n\t\t\t\t// carry the kept dep's subscription box and point it at the new index (O(1) reroute)\n\t\t\t\tconst box = self._dep.idxBoxes[oldIdx];\n\t\t\t\tif (box) box.v = j;\n\t\t\t\tnewBoxes[j] = box;\n\t\t\t}\n\t\t}\n\t\tself._slot.deps = newDeps;\n\t\tself._dep.batch = newBatch;\n\t\tself._dep.prev = newPrev;\n\t\tself._dep.hasData = newHasData;\n\t\tself._dep.dirty = newDirty;\n\t\tself._dep.tier = newTier;\n\t\tself._dep.terminal = newTerminal;\n\t\tself._dep.terminalInput = newTerminalInput;\n\t\tself._dep.unsubs = newUnsubs;\n\t\tself._dep.idxBoxes = newBoxes;\n\t\tself._dep.waveData = newDeps.map(() => []);\n\t\tself._dep.waveTokens = new Array(newDeps.length).fill(undefined);\n\t\tself._syncCtx = null;\n\n\t\t// Subscribe added deps — push-on-subscribe (R-push-subscribe) delivers a cached\n\t\t// dep's DATA here, which drives _maybeRun; a SENTINEL dep delivers START only.\n\t\tif (self._lifecycle.activated) {\n\t\t\tfor (const d of added) self._subscribeDepAt(d);\n\t\t}\n\t\tnotifyTopologyDepsChanged(node, oldDeps, newDeps);\n\n\t\t// Q6 auto-settle: removing the sole dirty contributor closes the wave. With deps\n\t\t// remaining, request the atomic settle (recompute → DATA for a value; a no-emit fn\n\t\t// gets a substrate-synthesized undirty RESOLVED per R-resolved-undirty/D49 — NOT\n\t\t// equals-absorption, which is gone). With zero deps the node is inert (degenerate\n\t\t// fn-no-deps) — just un-dirty downstream. Cache is preserved either way (Q7).\n\t\tif (removedDirtyContributor && self._wave.pending === 0 && self._value.status === \"dirty\") {\n\t\t\tif (newDeps.length > 0) self._wave.rewireRunPending = true;\n\t\t\telse zeroDepUnDirty = true;\n\t\t}\n\t} finally {\n\t\tself._wave.inDepMutation = false;\n\t}\n\n\t// Atomic post-mutation settle (outside the reentrancy guard so a fresh wave runs\n\t// normally): ONE two-phase DIRTY→DATA recompute if any added dep delivered data or a\n\t// sole-dirty dep was removed; else the zero-dep un-dirty via _down (pause/batch-safe).\n\tif (self._wave.rewireRunPending) {\n\t\tself._wave.rewireRunPending = false;\n\t\tself._settleRewire();\n\t} else if (zeroDepUnDirty) {\n\t\tif (self._wave.emittedDirtyThisWave) self._down([[\"RESOLVED\"]]);\n\t\telse self._value.status = self._value.hasData ? \"settled\" : \"sentinel\";\n\t}\n\treturn false;\n}\n","/**\n * The node primitive — the thinnest substrate object (R-node-thin / D5).\n *\n * Holds a fn handle + deps + the wave state machine; ZERO inspection cruft\n * (naming/find/describe are the graph layer, CSP-2). Canonical authority:\n * ~/src/graphrefly/spec/rules.jsonl (R-node-*, R-two-phase, R-diamond, R-resolved-undirty,\n * R-first-run-gate, R-push-subscribe, R-rom-ram, R-fn-contract, R-initial, R-ctx-up).\n *\n * Slice 1 = core wave: state node, compute node, two-phase DIRTY->DATA, diamond\n * pending-counter join, first-run gate, substrate-synthesized undirty RESOLVED\n * (R-resolved-undirty / D49 — no equals-substitution; every occurrence is DATA),\n * push-on-subscribe, lazy activation, ROM/RAM. Lifecycle (terminal/INVALIDATE/cleanup),\n * control (PAUSE/async), batch, and dynamicNode land in later slices.\n */\n\nimport { enterWave, exitWave } from \"../batch/boundary.js\";\nimport type { Ctx, CtxState, DeliveryMeta, NodeFn, Sink } from \"../ctx/types.js\";\nimport { defaultDispatcher, type Handle } from \"../dispatcher/index.js\";\nimport { EnvironmentDrivers } from \"../graph/environment.js\";\nimport {\n\ttype LockId,\n\ttype Message,\n\ttype PullDemand,\n\tSENTINEL,\n\ttype Wave,\n} from \"../protocol/messages.js\";\nimport {\n\ttype CleanupHooks,\n\ttype ControlState,\n\ttype DepBookkeeping,\n\ttype LifecycleState,\n\tmakeDepBookkeeping,\n\tNodeCore,\n\ttype NodeId,\n\ttype NodeSlot,\n\ttype PrivateState,\n\ttype SyncCtxState,\n\ttype ValueState,\n\ttype VersionState,\n\ttype WaveState,\n} from \"./core.js\";\nimport {\n\tnodeBuildCtx,\n\tnodeMakeCtx,\n\tnodeMakeState,\n\tnodeRefreshCtx,\n} from \"./node-context-runtime.js\";\nimport {\n\tnodeAllDepsSettled,\n\tnodeDepProjectionHasData,\n\tnodeMarkDirty,\n\tnodeMaybeRun,\n\tnodePassthroughEmit,\n\tnodeReceiveFromDep,\n\tnodeRecordDepProjection,\n\tnodeReleaseDepDirty,\n\tnodeRunWave,\n\tnodeSettleAfterAbsorbedTerminal,\n\tnodeSettleRewire,\n\tnodeTryRun,\n} from \"./node-input-runtime.js\";\nimport {\n\tnodeActivate,\n\tnodeDeactivate,\n\tnodeIsRuntimeQuiescentForRelease,\n\tnodeReleaseRuntime,\n\tnodeResetDepState,\n\tnodeSeedRestoredDepAt,\n\tnodeSubscribeDepAt,\n\tnodeSubscriberCount,\n} from \"./node-lifecycle-runtime.js\";\nimport {\n\tnodeAllDepsTerminal,\n\tnodeCanFireDemand,\n\tnodeCommitBatchedWave,\n\tnodeDeferBoundary,\n\tnodeDeliverPullDemand,\n\tnodeDown,\n\tnodeEmitToSubs,\n\tnodeFireOwedDemandIfReady,\n\tnodeFirePullDemand,\n\tnodeForwardUp,\n\tnodeHasBoundaryPauseLock,\n\tnodeInvalidate,\n\tnodeIsAsyncPool,\n\tnodeIsPaused,\n\tnodeMarkDemandRouted,\n\tnodeOnDemand,\n\tnodeOnResume,\n\tnodePauseAcquire,\n\tnodePauseRelease,\n\tnodeResetLifecycle,\n\tnodeRollbackBatched,\n\tnodeShouldBufferOnPause,\n\tnodeUp,\n} from \"./node-output-runtime.js\";\nimport {\n\tnodeApplyRewireNext,\n\tnodeRequestRewireNext,\n\tnodeRequestUpNext,\n\tnodeRewire,\n} from \"./node-rewire-runtime.js\";\nimport { nodeRuntimeHost } from \"./node-runtime-host.js\";\nimport {\n\tactivationReaders,\n\tcheckpointReaders,\n\tgetNodeOwner,\n\trestoreWriters,\n\truntimeQuiescenceReaders,\n\truntimeReleasers,\n\tsubscriberCountReaders,\n\ttakeConstructingEnvironmentDrivers,\n\ttakeConstructingNodeCore,\n} from \"./runtime-accessors.js\";\nimport type { NodeOptions, RewireOp, Status, UpRouteState } from \"./types.js\";\nimport {\n\tcloneNodeVersion,\n\tcreateNodeVersion,\n\ttype NodeVersion,\n\tresolveNodeVersioningPolicy,\n\trestoredV1Cid,\n} from \"./versioning.js\";\n\nexport {\n\tcheckpointStateOfNode,\n\tgetNodeOwner,\n\tisNodeActiveForRelease,\n\tisNodeRuntimeQuiescentForRelease,\n\tisNodeRuntimeReleased,\n\treleaseRuntimeOfNode,\n\trestoreStateOfNode,\n\tsetNodeOwner,\n\tsetNodeTopologyDepsChangedObserver,\n\tsubscriberCountOfNode,\n\twithEnvironmentDrivers,\n\twithNodeCore,\n} from \"./runtime-accessors.js\";\nexport type { NodeCheckpointState, NodeOptions, NodeRestoreState, Status } from \"./types.js\";\n\n/**\n * Reactive substrate node that owns dependencies, wave handling, lifecycle, and subscribers.\n *\n * @example\n * ```ts\n * import { node } from \"@graphrefly/ts\";\n *\n * const source = node<number>([], null);\n * source.subscribe((value) => console.log(value));\n * source.down([[\"DATA\", 1]]);\n * ```\n * @remarks **Substrate primitive:** `Node` is graph-agnostic; use `graph().node`,\n *   `graph().state`, or `graph().derived` when you want inspection and lifecycle ownership.\n * @category core\n */\nexport class Node<T = unknown> {\n\tprivate readonly _core: NodeCore;\n\tprivate readonly _id: NodeId;\n\tprivate readonly _slot: NodeSlot<T>;\n\tprivate readonly _dep: DepBookkeeping;\n\tprivate readonly _value: ValueState<T>;\n\tprivate readonly _wave: WaveState;\n\tprivate readonly _control: ControlState;\n\tprivate readonly _lifecycle: LifecycleState;\n\tprivate readonly _privateState: PrivateState;\n\tprivate readonly _hooks: CleanupHooks;\n\tprivate readonly _syncCtxState: SyncCtxState;\n\tprivate readonly _version: VersionState;\n\tprivate _restoredActivationPending = false;\n\tprivate _released = false;\n\n\tprivate get _syncCtx(): Ctx | null {\n\t\treturn this._syncCtxState.value;\n\t}\n\n\tprivate set _syncCtx(ctx: Ctx | null) {\n\t\tthis._syncCtxState.value = ctx;\n\t}\n\n\tprivate static _retainIndirectRuntimeMethods(node: Node<unknown>): void {\n\t\tvoid node._dep;\n\t\tvoid node._hooks;\n\t\tvoid node._restoredActivationPending;\n\t\tvoid node._requestRewireNext;\n\t\tvoid node._requestUpNext;\n\t\tvoid node._applyRewireNext;\n\t\tvoid node._reachableUpstream;\n\t\tvoid node._assertRewireDepOwner;\n\t\tvoid node._subscribeDepAt;\n\t\tvoid node._seedRestoredDepAt;\n\t\tvoid node._recordDepProjection;\n\t\tvoid node._depProjectionHasData;\n\t\tvoid node._receiveFromDep;\n\t\tvoid node._releaseDepDirty;\n\t\tvoid node._settleAfterAbsorbedTerminal;\n\t\tvoid node._markDirty;\n\t\tvoid node._maybeRun;\n\t\tvoid node._settleRewire;\n\t\tvoid node._tryRun;\n\t\tvoid node._allDepsSettled;\n\t\tvoid node._passthroughEmit;\n\t\tvoid node._runWave;\n\t\tvoid node._buildCtx;\n\t\tvoid node._makeCtx;\n\t\tvoid node._refreshCtx;\n\t\tvoid node._makeState;\n\t\tvoid node._markDemandRouted;\n\t\tvoid node._forwardUp;\n\t\tvoid node._isPullQuiet;\n\t\tvoid node._isPaused;\n\t\tvoid node._hasBoundaryPauseLock;\n\t\tvoid node._isAsyncPool;\n\t\tvoid node._pauseAcquire;\n\t\tvoid node._pauseRelease;\n\t\tvoid node._onResume;\n\t\tvoid node._canFireDemand;\n\t\tvoid node._deliverPullDemand;\n\t\tvoid node._onDemand;\n\t\tvoid node._firePullDemand;\n\t\tvoid node._fireOwedDemandIfReady;\n\t\tvoid node._shouldBufferOnPause;\n\t\tvoid node._invalidate;\n\t\tvoid node._allDepsTerminal;\n\t\tvoid node._emitToSubs;\n\t}\n\n\tconstructor(\n\t\tdeps: Node<unknown>[],\n\t\thandleOrFn: Handle | NodeFn | null,\n\t\topts: NodeOptions<T> = {},\n\t) {\n\t\tconst core = takeConstructingNodeCore();\n\t\tconst dispatcher = opts.dispatcher ?? defaultDispatcher;\n\t\tconst environment = takeConstructingEnvironmentDrivers() ?? EnvironmentDrivers.empty();\n\t\tconst pool = opts.pool ?? \"sync\";\n\t\tconst pausable = opts.pausable ?? true;\n\t\tconst pullLock = opts.pullId;\n\t\tconst pull = opts.pullId !== undefined;\n\t\t// R-pull (D269): pull-mode is keyed by an author-supplied pullId (its quiet latch).\n\t\t// R-pull (D55, pin 3): pull still uses the pausable delivery-content axis; pausable:false\n\t\t// ignores PAUSE/RESUME buffering and contradicts quiet pull delivery. Reject at construction.\n\t\tif (pull && pausable === false)\n\t\t\tthrow new Error(\n\t\t\t\t\"node: pullId is incompatible with pausable:false — a pull node uses the pausable delivery-content axis (R-pull / R-pause-modes / D55,D269)\",\n\t\t\t);\n\n\t\tlet handle: Handle | null;\n\t\tif (handleOrFn === null) handle = null;\n\t\telse if (typeof handleOrFn === \"function\") handle = dispatcher.register(handleOrFn, pool);\n\t\telse handle = handleOrFn;\n\n\t\tconst n = deps.length;\n\t\tconst dep = makeDepBookkeeping(n);\n\t\tconst versioning = resolveNodeVersioningPolicy(opts.versioning);\n\t\tconst value = {\n\t\t\tcache: SENTINEL as T | undefined,\n\t\t\thasData: false,\n\t\t\tstatus: \"sentinel\" as Status,\n\t\t\tterminal: undefined,\n\t\t\thasTorndown: false,\n\t\t\treplayRing: [] as T[],\n\t\t};\n\t\tif (opts.initial !== undefined) {\n\t\t\tvalue.cache = opts.initial as T;\n\t\t\tvalue.hasData = true;\n\t\t\tvalue.status = \"settled\";\n\t\t}\n\t\tconst pauseLockset = new Set<unknown>();\n\t\tthis._core = core ?? new NodeCore();\n\t\tconst created = this._core.createSlot<T>(\n\t\t\t{\n\t\t\t\tdeps,\n\t\t\t\thandle,\n\t\t\t\tpool,\n\t\t\t\tdispatcher,\n\t\t\t\tenvironment,\n\t\t\t\tpartial: opts.partial ?? false,\n\t\t\t\tterminalAsRealInput: opts.terminalAsRealInput ?? false,\n\t\t\t\tcompleteWhenDepsComplete: opts.completeWhenDepsComplete ?? true,\n\t\t\t\terrorWhenDepsError: opts.errorWhenDepsError ?? true,\n\t\t\t\tresubscribable: opts.resubscribable ?? false,\n\t\t\t\tresetOnTeardown: opts.resetOnTeardown ?? false,\n\t\t\t\tpausable,\n\t\t\t\tpull,\n\t\t\t\tpullLock,\n\t\t\t\treplayN: opts.replayBuffer ?? 0,\n\t\t\t\tdynamic: opts.dynamic ?? false,\n\t\t\t\tname: opts.name,\n\t\t\t\tfactory: opts.factory,\n\t\t\t},\n\t\t\t{\n\t\t\t\tdep,\n\t\t\t\tlifecycle: { subscribers: new Set<Sink>(), activated: false },\n\t\t\t\tvalue,\n\t\t\t\twave: {\n\t\t\t\t\tpending: 0,\n\t\t\t\t\thasCalledFnOnce: false,\n\t\t\t\t\temittedDirtyThisWave: false,\n\t\t\t\t\temittedSettleThisWave: false,\n\t\t\t\t\tinsideRunWave: false,\n\t\t\t\t\tinDepMutation: false,\n\t\t\t\t\trewireRunPending: false,\n\t\t\t\t\tbatchDirtyOwed: false,\n\t\t\t\t},\n\t\t\t\tcontrol: {\n\t\t\t\t\tpauseLockset,\n\t\t\t\t\tpausedDepWaveOccurred: false,\n\t\t\t\t\tpauseBuffer: [],\n\t\t\t\t\tdemandOwed: undefined,\n\t\t\t\t\tactivePull: undefined,\n\t\t\t\t\tpullDirtyOwed: false,\n\t\t\t\t\tinDeliverDemand: false,\n\t\t\t\t},\n\t\t\t\tprivateState: { value: SENTINEL, persist: false },\n\t\t\t\thooks: { onDeactivation: [], onInvalidate: [] },\n\t\t\t\tsyncCtx: { value: null },\n\t\t\t\tversion: {\n\t\t\t\t\tpolicy: versioning,\n\t\t\t\t\tvalue: createNodeVersion(\n\t\t\t\t\t\tversioning,\n\t\t\t\t\t\topts.initial !== undefined ? opts.initial : undefined,\n\t\t\t\t\t),\n\t\t\t\t},\n\t\t\t},\n\t\t);\n\t\tthis._id = created.id;\n\t\tthis._slot = this._core.get<T>(this._id);\n\t\tthis._dep = this._core.getDep(this._id);\n\t\tthis._value = this._core.getValue<T>(this._id);\n\t\tthis._wave = this._core.getWave(this._id);\n\t\tthis._control = this._core.getControl(this._id);\n\t\tthis._lifecycle = this._core.getLifecycle(this._id);\n\t\tthis._privateState = this._core.getPrivateState(this._id);\n\t\tthis._hooks = this._core.getHooks(this._id);\n\t\tthis._syncCtxState = this._core.getSyncCtx(this._id);\n\t\tthis._version = this._core.getVersion(this._id);\n\t\tcheckpointReaders.set(this as Node<unknown>, () => ({\n\t\t\tcache: this._value.cache,\n\t\t\thasData: this._value.hasData,\n\t\t\tterminal: this._value.terminal,\n\t\t\tactivated: this._lifecycle.activated,\n\t\t\thasCalledFnOnce: this._wave.hasCalledFnOnce,\n\t\t\tctxState: {\n\t\t\t\tvalue: this._privateState.value,\n\t\t\t\tpersist: this._privateState.persist,\n\t\t\t},\n\t\t\tversion: cloneNodeVersion(this._version.value),\n\t\t\thandle: this._slot.handle,\n\t\t}));\n\t\trestoreWriters.set(this as Node<unknown>, (state) => {\n\t\t\tthis._assertNotReleased(\"restoreGraph\");\n\t\t\tthis._value.cache = state.cache as T;\n\t\t\tthis._value.hasData = state.hasData;\n\t\t\tthis._value.status = state.status;\n\t\t\tthis._value.terminal = state.terminal;\n\t\t\tthis._value.hasTorndown = false;\n\t\t\tthis._value.replayRing = [];\n\t\t\tthis._wave.hasCalledFnOnce = state.hasCalledFnOnce;\n\t\t\tthis._wave.emittedDirtyThisWave = false;\n\t\t\tthis._wave.emittedSettleThisWave = false;\n\t\t\tthis._wave.pending = 0;\n\t\t\tthis._wave.insideRunWave = false;\n\t\t\tthis._wave.inDepMutation = false;\n\t\t\tthis._wave.rewireRunPending = false;\n\t\t\tthis._wave.batchDirtyOwed = false;\n\t\t\tthis._control.pauseBuffer = [];\n\t\t\tthis._control.pausedDepWaveOccurred = false;\n\t\t\tthis._control.demandOwed = undefined;\n\t\t\tthis._control.activePull = undefined;\n\t\t\tthis._control.pullDirtyOwed = false;\n\t\t\tthis._control.inDeliverDemand = false;\n\t\t\tthis._control.pauseLockset.clear();\n\t\t\tthis._privateState.value = state.ctxState.value;\n\t\t\tthis._privateState.persist = state.ctxState.persist;\n\t\t\tif (state.version === false) {\n\t\t\t\tthis._version.policy = { enabled: false };\n\t\t\t\tthis._version.value = undefined;\n\t\t\t} else if (state.version.level === 0) {\n\t\t\t\tthis._version.policy = { enabled: true, level: 0 };\n\t\t\t\tthis._version.value = cloneNodeVersion(state.version);\n\t\t\t} else {\n\t\t\t\tif (!this._version.policy.enabled || this._version.policy.level !== 1) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t`restoreGraph: checkpoint node version level ${state.version.level} requires matching node versioning policy`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\t// D109: V1 restore must match the selected hash lane. After DATA then\n\t\t\t\t// INVALIDATE/resetOnTeardown, cache is absent while cid remains the last DATA cid;\n\t\t\t\t// without the DATA value, restore cannot verify the lane, so fail honestly.\n\t\t\t\tif (!state.hasData && state.version.counter > 0) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"restoreGraph: checkpoint node version cid cannot be verified without current DATA under V1 versioning (D109)\",\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tconst expectedCid = restoredV1Cid(this._version.policy, state.hasData, state.cache);\n\t\t\t\tif (expectedCid !== state.version.cid) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"restoreGraph: checkpoint node version cid does not match the selected node versioning hash policy (D109)\",\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tthis._version.value = cloneNodeVersion(state.version);\n\t\t\t}\n\t\t\tthis._syncCtx = null;\n\t\t\tthis._resetDepState();\n\t\t\t// A fresh restored graph has no subscribers before return. Keep activation closed so the\n\t\t\t// first real subscriber wires deps normally; D94's preserved lifecycle bit is the first-run\n\t\t\t// gate (`hasCalledFnOnce`), not a hidden subscription graph.\n\t\t\tthis._lifecycle.activated = false;\n\t\t\tthis._lifecycle.subscribers.clear();\n\t\t\tthis._restoredActivationPending = true;\n\t\t});\n\t\truntimeReleasers.set(this as Node<unknown>, () => this._releaseRuntime());\n\t\truntimeQuiescenceReaders.set(this as Node<unknown>, () => this._isRuntimeQuiescentForRelease());\n\t\tsubscriberCountReaders.set(this as Node<unknown>, () => this._subscriberCount());\n\t\tactivationReaders.set(this as Node<unknown>, () => this._lifecycle.activated);\n\t\tNode._retainIndirectRuntimeMethods(this as Node<unknown>);\n\t}\n\n\t/** R-pull (D55/D272): true while a pull node is not serving a PULL demand pulse. */\n\tprivate _isPullQuiet(): boolean {\n\t\treturn this._slot.pull && this._control.activePull === undefined;\n\t}\n\n\t/**\n\t * R-pull (D269/D272): this pull node's pullId (pure data, like {@link cache}/{@link handle} —\n\t * never triggers computation). A consumer demands one delivery by cone-routing PULL of it (no\n\t * node reference): `ctx.up([[\"PULL\", { pullId }]])` (immediate; loops back → D37 for a self-read\n\t * dep) or `ctx.upNext([[\"PULL\", { pullId }]])` (boundary-deferred self-demand). Undefined for a\n\t * non-pull node. The author writes the pullId verbatim; routing matches by identity.\n\t */\n\tget pullId(): LockId | undefined {\n\t\treturn this._slot.pullLock;\n\t}\n\n\tget cache(): T | undefined {\n\t\treturn this._value.cache;\n\t}\n\n\tget status(): Status {\n\t\treturn this._value.status;\n\t}\n\n\tget version(): NodeVersion | undefined {\n\t\treturn cloneNodeVersion(this._version.value);\n\t}\n\n\tget name(): string | undefined {\n\t\treturn this._slot.name;\n\t}\n\n\t/** R-describe/D51: real factory name for a standalone graph-less node (a runtime *Map inner). */\n\tget factory(): string | undefined {\n\t\treturn this._slot.factory;\n\t}\n\n\t/**\n\t * The node's CURRENT/LIVE deps (R-describe / R-edges-derived / D51) — readonly view of the\n\t * live `_deps`, which a rewire (C-8 / C-11) mutates. The graph's describe() reads this (NOT a\n\t * construction-time snapshot) so every edge corresponds to a real current subscription (D3).\n\t * Inspection-only, like cache/status; never triggers computation.\n\t */\n\tget deps(): readonly Node<unknown>[] {\n\t\treturn this._slot.deps;\n\t}\n\n\t/**\n\t * The fn handle (pure data `(poolId, handleId)`, D7) or null for state/passthrough\n\t * nodes. Inspection-only (L1.6 handle is referenceable/inspectable) — lets the graph\n\t * layer key a dispatcher-backed profile recorder WITHOUT putting counters on the node\n\t * (R-node-thin / D39).\n\t */\n\tget handle(): Handle | null {\n\t\treturn this._slot.handle;\n\t}\n\n\t/** R-push-subscribe: a new sink receives START, then cached DATA (or DIRTY if dirty). */\n\tsubscribe(sink: Sink): () => void {\n\t\tthis._assertNotReleased(\"subscribe\");\n\t\t// Wave-owner boundary (R-rewire-deferred / D47): the activation cascade can run fns that\n\t\t// issue ctx.rewireNext; the OUTERMOST exit drains them. Nested subscribes (dep wiring)\n\t\t// just inc/dec the depth.\n\t\tenterWave();\n\t\ttry {\n\t\t\t// R-terminal: late subscribe to a terminal node either resets (resubscribable)\n\t\t\t// or is rejected (non-resubscribable, R2.2.7.b).\n\t\t\tif (this._value.terminal !== undefined) {\n\t\t\t\tif (this._slot.resubscribable) {\n\t\t\t\t\tthis._restoredActivationPending = false;\n\t\t\t\t\tthis._resetLifecycle();\n\t\t\t\t} else\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\"subscribe: node is non-resubscribable and has terminated; the stream is permanently over (R-terminal / R2.2.7.b)\",\n\t\t\t\t\t);\n\t\t\t}\n\n\t\t\tthis._lifecycle.subscribers.add(sink);\n\t\t\tsink([\"START\"]);\n\t\t\tif (this._slot.replayN > 0 && this._value.replayRing.length > 0) {\n\t\t\t\t// R-replay-buffer: late subscriber gets the last N DATA after START.\n\t\t\t\tfor (const v of this._value.replayRing) sink([\"DATA\", v]);\n\t\t\t} else if (this._value.hasData && !this._slot.pull) {\n\t\t\t\t// R-pull (D55): a pull node NEVER push-on-subscribes its cached value — quiet by\n\t\t\t\t// default, it stays silent until demanded (START only). QA-B4: gated on `_pull`, not\n\t\t\t\t// activePull, so a REACTIVATED pull node still does not leak its cache.\n\t\t\t\tsink([\"DATA\", this._value.cache]);\n\t\t\t} else if (this._value.status === \"dirty\" && !this._slot.pull) {\n\t\t\t\tsink([\"DIRTY\"]);\n\t\t\t}\n\n\t\t\tif (!this._lifecycle.activated) this._activate();\n\n\t\t\treturn () => {\n\t\t\t\tif (!this._lifecycle.subscribers.delete(sink)) return;\n\t\t\t\tif (this._lifecycle.subscribers.size === 0) this._deactivate();\n\t\t\t};\n\t\t} finally {\n\t\t\texitWave();\n\t\t}\n\t}\n\n\t/** External emission toward sinks (state-node push, or async late-emit). One call = one wave. */\n\tdown(msgs: Wave): void {\n\t\tthis._assertNotReleased(\"down\");\n\t\t// Wave-owner boundary (D47): a state.set / external push that drives a fn issuing\n\t\t// ctx.rewireNext drains at this outermost exit.\n\t\tenterWave();\n\t\ttry {\n\t\t\tthis._down(msgs);\n\t\t} finally {\n\t\t\texitWave();\n\t\t}\n\t}\n\n\t/**\n\t * Emit upstream toward deps — control tiers only (R-ctx-up). `towardDep` (a dep index) routes up\n\t * ONE declared edge (R-up-routing directed-up); omitted = broadcast up all deps.\n\t */\n\tup(msgs: Wave, towardDep?: number): void {\n\t\tthis._assertNotReleased(\"up\");\n\t\t// Wave-owner boundary (D47). Internal dep-forwarding calls dep.up() nest under this.\n\t\tenterWave();\n\t\ttry {\n\t\t\tthis._up(msgs, towardDep);\n\t\t} finally {\n\t\t\texitWave();\n\t\t}\n\t}\n\n\t// ── rewire (R-rewire / D42): intra-graph runtime topology mutation ──\n\n\t/**\n\t * Replace this node's deps atomically (surgical, Option-C). Requires an explicit\n\t * `fn` (SD-1 fn-deps pairing — user fns read dep input positionally). Kept deps\n\t * keep their subscription + per-dep state; only removed deps unsubscribe and only\n\t * added deps fresh-subscribe (push-on-subscribe for an added cached dep). The\n\t * first-run gate and cache are PRESERVED (R-rewire Q2/Q7). Intra-graph only (D22).\n\t */\n\treplaceDeps(newDeps: Node<unknown>[], fn: NodeFn): void {\n\t\tthis._assertNotReleased(\"replaceDeps\");\n\t\tthis._rewire(this._dedupDeps(newDeps), fn);\n\t}\n\n\t/** Subscribe to one dep (special case of replaceDeps); returns its index. fn required (SD-1). */\n\tsubscribeDep(depNode: Node<unknown>, fn: NodeFn): number {\n\t\tthis._assertNotReleased(\"subscribeDep\");\n\t\tconst next = this._slot.deps.includes(depNode)\n\t\t\t? [...this._slot.deps]\n\t\t\t: [...this._slot.deps, depNode];\n\t\tconst deferred = this._rewire(next, fn);\n\t\treturn deferred ? next.indexOf(depNode) : this._slot.deps.indexOf(depNode);\n\t}\n\n\t/** Unsubscribe from one dep (special case of replaceDeps); idempotent if absent (fn swap still applies). */\n\tunsubscribeDep(depNode: Node<unknown>, fn: NodeFn): void {\n\t\tthis._assertNotReleased(\"unsubscribeDep\");\n\t\tthis._rewire(\n\t\t\tthis._slot.deps.filter((d) => d !== depNode),\n\t\t\tfn,\n\t\t);\n\t}\n\n\tprivate _requestRewireNext(op: RewireOp): void {\n\t\tnodeRequestRewireNext(nodeRuntimeHost(this), op);\n\t}\n\n\tprivate _requestUpNext(msgs: Wave, towardDep?: number): void {\n\t\tnodeRequestUpNext(nodeRuntimeHost(this), msgs, towardDep);\n\t}\n\n\tprivate _applyRewireNext(op: RewireOp): void {\n\t\tnodeApplyRewireNext(nodeRuntimeHost(this), op);\n\t}\n\n\tprivate _dedupDeps(deps: Node<unknown>[]): Node<unknown>[] {\n\t\tconst seen = new Set<Node<unknown>>();\n\t\tconst out: Node<unknown>[] = [];\n\t\tfor (const d of deps)\n\t\t\tif (!seen.has(d)) {\n\t\t\t\tseen.add(d);\n\t\t\t\tout.push(d);\n\t\t\t}\n\t\treturn out;\n\t}\n\n\tprivate _reachableUpstream(from: Node<unknown>, target: Node<unknown>): boolean {\n\t\tconst seen = new Set<Node<unknown>>();\n\t\tconst stack: Node<unknown>[] = [from];\n\t\twhile (stack.length > 0) {\n\t\t\tconst n = stack.pop();\n\t\t\tif (n === undefined) continue;\n\t\t\tif (n === target) return true;\n\t\t\tif (seen.has(n)) continue;\n\t\t\tseen.add(n);\n\t\t\tfor (const d of nodeRuntimeHost(n)._slot.deps) stack.push(d);\n\t\t}\n\t\treturn false;\n\t}\n\n\tprivate _assertRewireDepOwner(dep: Node<unknown>): void {\n\t\tconst selfOwner = getNodeOwner(this as unknown as Node<unknown>);\n\t\tconst depOwner = getNodeOwner(dep);\n\t\tif (selfOwner !== undefined && depOwner !== undefined && selfOwner !== depOwner)\n\t\t\tthrow new Error(\n\t\t\t\t\"rewire: dep belongs to a different graph; cross-graph deps require a wire bridge (D22 / R-graph-domain)\",\n\t\t\t);\n\t}\n\n\tprivate _rewire(\n\t\tnewDeps: Node<unknown>[],\n\t\tfn: NodeFn,\n\t\topts: { allowTerminalOwner?: boolean } = {},\n\t): boolean {\n\t\treturn nodeRewire(nodeRuntimeHost(this), newDeps, fn, opts);\n\t}\n\n\t// ── activation / deactivation (lazy; R-rom-ram) ──\n\n\tprivate _activate(): void {\n\t\tnodeActivate(nodeRuntimeHost(this));\n\t}\n\n\tprivate _deactivate(): void {\n\t\tnodeDeactivate(nodeRuntimeHost(this));\n\t}\n\n\tprivate _assertNotReleased(op: string): void {\n\t\tif (this._released)\n\t\t\tthrow new Error(`${op}: node has been released from its graph lifecycle (D122)`);\n\t}\n\n\tprivate _subscriberCount(): number {\n\t\treturn nodeSubscriberCount(nodeRuntimeHost(this));\n\t}\n\n\tprivate _isRuntimeQuiescentForRelease(): boolean {\n\t\treturn nodeIsRuntimeQuiescentForRelease(nodeRuntimeHost(this));\n\t}\n\n\tprivate _releaseRuntime(): void {\n\t\tnodeReleaseRuntime(nodeRuntimeHost(this));\n\t}\n\n\tprivate _resetDepState(): void {\n\t\tnodeResetDepState(nodeRuntimeHost(this));\n\t}\n\n\tprivate _subscribeDepAt(depNode: Node<unknown>, opts: { seedRestored?: boolean } = {}): void {\n\t\tnodeSubscribeDepAt(nodeRuntimeHost(this), depNode, opts);\n\t}\n\n\tprivate _seedRestoredDepAt(idx: number, depNode: Node<unknown>): void {\n\t\tnodeSeedRestoredDepAt(nodeRuntimeHost(this), idx, depNode);\n\t}\n\n\tprivate _recordDepProjection(idx: number, delivery: DeliveryMeta | undefined): unknown[] {\n\t\treturn nodeRecordDepProjection(nodeRuntimeHost(this), idx, delivery);\n\t}\n\n\tprivate _depProjectionHasData(idx: number): boolean {\n\t\treturn nodeDepProjectionHasData(nodeRuntimeHost(this), idx);\n\t}\n\n\tprivate _receiveFromDep(idx: number, msg: Message, delivery?: DeliveryMeta): void {\n\t\tnodeReceiveFromDep(nodeRuntimeHost(this), idx, msg, delivery);\n\t}\n\n\tprivate _releaseDepDirty(idx: number): void {\n\t\tnodeReleaseDepDirty(nodeRuntimeHost(this), idx);\n\t}\n\n\tprivate _settleAfterAbsorbedTerminal(): void {\n\t\tnodeSettleAfterAbsorbedTerminal(nodeRuntimeHost(this));\n\t}\n\n\tprivate _markDirty(): void {\n\t\tnodeMarkDirty(nodeRuntimeHost(this));\n\t}\n\n\tprivate _maybeRun(): void {\n\t\tnodeMaybeRun(nodeRuntimeHost(this));\n\t}\n\n\tprivate _settleRewire(): void {\n\t\tnodeSettleRewire(nodeRuntimeHost(this));\n\t}\n\n\tprivate _tryRun(): void {\n\t\tnodeTryRun(nodeRuntimeHost(this));\n\t}\n\n\tprivate _allDepsSettled(): boolean {\n\t\treturn nodeAllDepsSettled(nodeRuntimeHost(this));\n\t}\n\n\tprivate _passthroughEmit(): void {\n\t\tnodePassthroughEmit(nodeRuntimeHost(this));\n\t}\n\n\tprivate _runWave(): void {\n\t\tnodeRunWave(nodeRuntimeHost(this));\n\t}\n\n\tprivate _buildCtx(): Ctx {\n\t\treturn nodeBuildCtx(nodeRuntimeHost(this));\n\t}\n\n\tprivate _makeCtx(snapshot?: {\n\t\twaveData: unknown[][][];\n\t\tterminal: unknown[];\n\t\tlatest: unknown[];\n\t}): Ctx {\n\t\treturn nodeMakeCtx(nodeRuntimeHost(this), snapshot);\n\t}\n\n\tprivate _refreshCtx(ctx: Ctx): void {\n\t\tnodeRefreshCtx(nodeRuntimeHost(this), ctx);\n\t}\n\n\tprivate _makeState(): CtxState {\n\t\treturn nodeMakeState(nodeRuntimeHost(this));\n\t}\n\n\t// ── downstream emission pipeline (the unified waist) ──\n\n\tprivate _down(msgs: Wave): void {\n\t\tnodeDown(nodeRuntimeHost(this), msgs);\n\t}\n\n\tprivate _up(msgs: Wave, towardDep?: number, route?: UpRouteState): void {\n\t\tnodeUp(nodeRuntimeHost(this), msgs, towardDep, route);\n\t}\n\n\tprivate _markDemandRouted(lockId: LockId, route: UpRouteState): boolean {\n\t\treturn nodeMarkDemandRouted(nodeRuntimeHost(this), lockId, route);\n\t}\n\n\tprivate _forwardUp(m: Message, towardDep: number | undefined, route: UpRouteState): void {\n\t\tnodeForwardUp(nodeRuntimeHost(this), m, towardDep, route);\n\t}\n\n\tprivate _isPaused(): boolean {\n\t\treturn nodeIsPaused(nodeRuntimeHost(this));\n\t}\n\n\tprivate _hasBoundaryPauseLock(): boolean {\n\t\treturn nodeHasBoundaryPauseLock(nodeRuntimeHost(this));\n\t}\n\n\tprivate _isAsyncPool(): boolean {\n\t\treturn nodeIsAsyncPool(nodeRuntimeHost(this));\n\t}\n\n\tprivate _pauseAcquire(lockId: unknown): void {\n\t\tnodePauseAcquire(nodeRuntimeHost(this), lockId);\n\t}\n\n\tprivate _pauseRelease(lockId: unknown): void {\n\t\tnodePauseRelease(nodeRuntimeHost(this), lockId);\n\t}\n\n\tprivate _onResume(): void {\n\t\tnodeOnResume(nodeRuntimeHost(this));\n\t}\n\n\tprivate _canFireDemand(): boolean {\n\t\treturn nodeCanFireDemand(nodeRuntimeHost(this));\n\t}\n\n\tprivate _deliverPullDemand(demand: PullDemand): void {\n\t\tnodeDeliverPullDemand(nodeRuntimeHost(this), demand);\n\t}\n\n\tprivate _onDemand(demand: PullDemand): void {\n\t\tnodeOnDemand(nodeRuntimeHost(this), demand);\n\t}\n\n\tprivate _firePullDemand(): void {\n\t\tnodeFirePullDemand(nodeRuntimeHost(this));\n\t}\n\n\tprivate _fireOwedDemandIfReady(): void {\n\t\tnodeFireOwedDemandIfReady(nodeRuntimeHost(this));\n\t}\n\n\tprivate _shouldBufferOnPause(): boolean {\n\t\treturn nodeShouldBufferOnPause(nodeRuntimeHost(this));\n\t}\n\n\tprivate _invalidate(delivery?: DeliveryMeta): void {\n\t\tnodeInvalidate(nodeRuntimeHost(this), delivery);\n\t}\n\n\tprivate _allDepsTerminal(): boolean {\n\t\treturn nodeAllDepsTerminal(nodeRuntimeHost(this));\n\t}\n\n\tprivate _emitToSubs(msg: Message, delivery?: DeliveryMeta): void {\n\t\tnodeEmitToSubs(nodeRuntimeHost(this), msg, delivery);\n\t}\n\n\t/** R-terminal: resubscribable reset clears terminal + dep state + re-arms the gate. */\n\tprivate _resetLifecycle(): void {\n\t\tnodeResetLifecycle(nodeRuntimeHost(this));\n\t}\n\n\t/** Batch commit (R-batch-coalesce): deliver the deferred tier-3 wave now. */\n\t__commitBatchedWave(wave: Wave): void {\n\t\tnodeCommitBatchedWave(nodeRuntimeHost(this), wave);\n\t}\n\n\t/** Batch rollback: balance the immediate DIRTY with a RESOLVED so downstream un-dirties. */\n\t__rollbackBatched(): void {\n\t\tnodeRollbackBatched(nodeRuntimeHost(this));\n\t}\n\n\t/** B49: enqueue a committed-boundary task on this node's graph-local core. */\n\t__deferBoundary(fn: () => void, batchToken?: object): void {\n\t\tnodeDeferBoundary(nodeRuntimeHost(this), fn, batchToken);\n\t}\n}\n\n/**\n * Construct a node (R-node-iface / D5 / L1.9 deps-first).\n *   node([], null, { initial })       — state node (manual source; emit via .down)\n *   node([], fn)                        — producer (runs on activation)\n *   node([a, b], fn)                    — compute / derived\n *   node([dep])                         — passthrough wire\n *\n * @param deps - Upstream nodes this node reads positionally from `ctx`.\n * @param handleOrFn - Dispatcher handle, node function, or `null` for a manual source/state node.\n * @param opts - Node runtime options such as `initial`, `name`, pool, dispatcher, and restore data.\n * @returns A graph-agnostic `Node`.\n * @example\n * ```ts\n * import { depLatest, node } from \"@graphrefly/ts\";\n *\n * const source = node<number>([], null, { initial: 1 });\n * const doubled = node<number>([source], (ctx) => {\n *   ctx.down([[\"DATA\", Number(depLatest(ctx, 0)) * 2]]);\n * });\n * ```\n * @category core\n */\nexport function node<T = unknown>(\n\tdeps: Node<unknown>[] = [],\n\thandleOrFn: Handle | NodeFn | null = null,\n\topts: NodeOptions<T> = {},\n): Node<T> {\n\treturn new Node<T>(deps, handleOrFn, opts);\n}\n\n/**\n * Construct a dynamicNode (R-dynamic-node / D35) — a node variant whose fn reads a\n * subset of a fixed superset of deps per invocation via `ctx.track(i)`. All declared\n * deps participate in wave tracking; an unread dep's change re-runs the fn, which re-emits\n * its current value as DATA (D49 removed equals-absorption — dedup is opt-in via\n * distinctUntilChanged). Intra-graph only (D22).\n */\nexport function dynamicNode<T = unknown>(\n\tdeps: Node<unknown>[],\n\tfn: NodeFn,\n\topts: NodeOptions<T> = {},\n): Node<T> {\n\treturn new Node<T>(deps, fn, { ...opts, dynamic: true });\n}\n","/**\n * Graph checkpoint public data shape (D83/D86/D90/D116).\n *\n * Checkpoint is a graph lifecycle snapshot: strict-JSON-compatible data, no storage I/O,\n * no observe-log replay, and no restore runtime in this first TS slice.\n */\n\nimport { type StrictJsonValue, strictJsonCodec } from \"../json/codec.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { NodeVersionJson } from \"../node/versioning.js\";\nimport { SENTINEL } from \"../protocol/messages.js\";\n\nexport const GRAPH_CHECKPOINT_VERSION = \"graphrefly.checkpoint.v1\" as const;\n\nexport type GraphCheckpointVersion = typeof GRAPH_CHECKPOINT_VERSION;\n\nexport type GraphCheckpointJson = StrictJsonValue;\n\nexport type GraphCheckpointValue =\n\t| { kind: \"SENTINEL\" }\n\t| { kind: \"DATA\"; data: GraphCheckpointJson };\n\nexport type GraphCheckpointTerminal =\n\t| { kind: \"none\" }\n\t| { kind: \"COMPLETE\" }\n\t| { kind: \"ERROR\"; error: GraphCheckpointJson };\n\nexport type GraphCheckpointFactory =\n\t| {\n\t\t\tkind: \"registry-ref\";\n\t\t\tref: string;\n\t\t\tconfig?: GraphCheckpointJson;\n\t\t\tconfigVersion?: GraphCheckpointJson;\n\t  }\n\t| { kind: \"local-only\"; name: string; reason: string };\n\nexport interface GraphCheckpointNode {\n\tid: string;\n\tname?: string;\n\tfactory: GraphCheckpointFactory;\n\tstatus: string;\n\tdeps: string[];\n\tvalue: GraphCheckpointValue;\n\tbackendState?: GraphCheckpointJson;\n\tversion?: NodeVersionJson;\n\tterminal: GraphCheckpointTerminal;\n\tlifecycle: { activated: boolean; hasCalledFnOnce: boolean };\n\tctxState: { persist: boolean; value: GraphCheckpointValue };\n\tmeta?: { [key: string]: GraphCheckpointJson };\n}\n\nexport interface GraphCheckpointEdge {\n\tfrom: string;\n\tto: string;\n}\n\nexport interface GraphCheckpointMount {\n\tat: string;\n\tcheckpoint: GraphCheckpoint;\n}\n\nexport interface GraphCheckpoint {\n\tversion: GraphCheckpointVersion;\n\tname?: string;\n\tnodes: GraphCheckpointNode[];\n\tedges: GraphCheckpointEdge[];\n\tmounts?: GraphCheckpointMount[];\n}\n\nexport function toCheckpointJson(value: unknown, path = \"$\"): GraphCheckpointJson {\n\ttry {\n\t\treturn strictJsonCodec.decode(strictJsonCodec.encode(value)) as GraphCheckpointJson;\n\t} catch (cause) {\n\t\tthrow new TypeError(`checkpoint: value at ${path} is not strict JSON compatible`, {\n\t\t\tcause,\n\t\t});\n\t}\n}\n\nexport function checkpointValue(\n\tvalue: unknown,\n\thasData: boolean,\n\tpath: string,\n): GraphCheckpointValue {\n\tif (!hasData || value === SENTINEL) return { kind: \"SENTINEL\" };\n\treturn { kind: \"DATA\", data: toCheckpointJson(value, path) };\n}\n\nexport function checkpointTerminal(value: unknown, path: string): GraphCheckpointTerminal {\n\tif (value === undefined) return { kind: \"none\" };\n\tif (value === true) return { kind: \"COMPLETE\" };\n\treturn { kind: \"ERROR\", error: toCheckpointJson(value, path) };\n}\n\ntype BackendStateContributor = () => unknown;\n\nconst backendStateContributors = new WeakMap<Node<unknown>, BackendStateContributor>();\n\n/** @internal D160: collection-owned backend checkpoint contributor for graph checkpoint. */\nexport function registerBackendStateContributor(\n\tnode: Node<unknown>,\n\tcontributor: BackendStateContributor,\n): void {\n\tbackendStateContributors.set(node, contributor);\n}\n\n/** @internal D160: capture a node's collection backend state when it has a contributor. */\nexport function checkpointBackendStateOfNode(\n\tnode: Node<unknown>,\n\tpath: string,\n): GraphCheckpointJson | undefined {\n\tconst contributor = backendStateContributors.get(node);\n\tif (contributor === undefined) return undefined;\n\treturn toCheckpointJson(contributor(), path);\n}\n","/**\n * Operators as free-standing factory definitions (D43 / D6 / D40 Catalog-first).\n *\n * Operators are `node` sugar (D6), NOT verbs (D4) and NEVER in parity (D24). Each is a\n * pure {@link Operator} spec — `{factory, body, opts}` — built on the bare `node` primitive\n * (NOT the `derived` verb): `body` reads ctx dep slots positionally and emits via\n * `ctx.down`. Two ways to instantiate:\n *\n *   - {@link initNode}(op, deps, opts?) — bare, no Graph; returns a working `Node<T>`.\n *   - `g.initNode(op, deps, opts?)` — graph-bound; the SAME call, plus inspection registration\n *     (the real factory name lands in the graph's `_entries`, so describe/observe/profile\n *     show it — D6/R-describe — while the node stays thin, R-node-thin).\n *\n * The D30 throw→ERROR boundary lives once, in the free {@link initNode} (which `g.initNode`\n * funnels through). The pure-ts `operatorOpts/partialOperatorOpts/gatedOperatorOpts` trio is\n * NOT ported: its sole job (`describeKind:\"derived\"`) is dead under D6/D39 (factory = the\n * REAL operator name); only the `partial`/`terminalAsRealInput` flags survive, carried\n * per-operator in `op.opts`.\n *\n * Config is folded into the factory (`map(fn)`, `scan(reducer, seed)`, `take(n)`, `merge()`),\n * so fn params are annotated where the source type can't be inferred (RxJS-pipe cost);\n * dep-type safety is recovered by the typed `g.initNode` overloads.\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepCount,\n\tdepLatest,\n\tdepTerminal,\n\tisTerminalComplete,\n\tisTerminalError,\n\ttype NodeFn,\n\tterminalErrorValue,\n} from \"../ctx/types.js\";\nimport type { NodeCore } from \"../node/core.js\";\nimport { Node, type NodeOptions, withNodeCore } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport { type GraphCheckpointJson, toCheckpointJson } from \"./checkpoint.js\";\nimport type { GraphRestoreDefinition, GraphRestoreEntry, GraphRestoreRegistry } from \"./restore.js\";\n\n/**\n * A free-standing operator definition (D43). `TIn` = the element type each dep delivers\n * (the operator reads `depLatest(ctx, i) as TIn`); `TOut` = the emitted value type.\n * `__in`/`__out` are phantom-only (never assigned) — they let `g.initNode` infer + check the\n * dep tuple against the operator without an explicit type argument.\n */\nexport interface Operator<TIn = unknown, TOut = unknown> {\n\t/** Real operator name shown in describe (D6/L1.5) — recorded at `_add` by `g.initNode`. */\n\treadonly factory: string;\n\t/** The ctx-body: reads ctx dep slots positionally, emits via `ctx.down`. */\n\treadonly body: (ctx: Ctx) => void;\n\t/** Behavioral node options the operator needs (e.g. `partial:true` for combine-family). */\n\treadonly opts?: Partial<NodeOptions<TOut>>;\n\t/**\n\t * D97/D100 restore metadata derived from a named definition or static built-in config.\n\t * This is semantic metadata only; dispatcher handles stay graph-local runtime state.\n\t */\n\treadonly restore?: {\n\t\tref: string;\n\t\tconfig?: GraphCheckpointJson;\n\t\tconfigVersion?: GraphCheckpointJson;\n\t};\n\t/** @internal phantom — never set; carries the dep element type for `g.initNode` inference. */\n\treadonly __in?: TIn;\n\t/** @internal phantom — never set; carries the output value type. */\n\treadonly __out?: TOut;\n}\n\ntype MutableRestoreRegistry = Map<string, GraphRestoreEntry> | Record<string, GraphRestoreEntry>;\n\nexport type RestoreRegistryEntry = GraphRestoreEntry;\n\nexport interface Definition<S = unknown, T = unknown> extends GraphRestoreDefinition<S, T> {\n\treadonly ref: string;\n\treadonly fn: (v: S) => T;\n}\n\nexport interface DefineOpts {\n\tregistry?: MutableRestoreRegistry;\n}\n\nfunction registryHas(registry: MutableRestoreRegistry, ref: string): boolean {\n\treturn registry instanceof Map ? registry.has(ref) : Object.hasOwn(registry, ref);\n}\n\nfunction registrySet(\n\tregistry: MutableRestoreRegistry,\n\tref: string,\n\tentry: GraphRestoreEntry,\n): void {\n\tif (registryHas(registry, ref)) {\n\t\tthrow new Error(`restoreRegistry: duplicate ref '${ref}'`);\n\t}\n\tif (registry instanceof Map) registry.set(ref, entry);\n\telse registry[ref] = entry;\n}\n\nexport function addToRestoreRegistry(\n\tregistry: MutableRestoreRegistry,\n\tentry: GraphRestoreEntry,\n): void {\n\tregistrySet(registry, entry.ref, entry);\n}\n\nexport function restoreRegistry(\n\tentries: readonly GraphRestoreEntry[] = [],\n\tbase?: GraphRestoreRegistry,\n): Map<string, GraphRestoreEntry> {\n\tconst out = new Map<string, GraphRestoreEntry>();\n\tif (base instanceof Map) {\n\t\tfor (const [ref, entry] of base) registrySet(out, ref, entry);\n\t} else if (base !== undefined) {\n\t\tfor (const [ref, entry] of Object.entries(base)) registrySet(out, ref, entry);\n\t}\n\tfor (const entry of entries) addToRestoreRegistry(out, entry);\n\treturn out;\n}\n\nfunction isDefinition<S, T>(fn: ((v: S) => T) | Definition<S, T>): fn is Definition<S, T> {\n\treturn typeof fn === \"object\" && fn !== null && (fn as Definition<S, T>).kind === \"definition\";\n}\n\nexport function define<S, T>(\n\tref: string,\n\tfn: (v: S) => T,\n\topts: DefineOpts = {},\n): Definition<S, T> {\n\tconst jsonRef = toCheckpointJson(ref, \"define.ref\");\n\tif (typeof jsonRef !== \"string\") throw new TypeError(\"define: ref must be a string\");\n\tconst definition: Definition<S, T> = {\n\t\tkind: \"definition\",\n\t\tref: jsonRef,\n\t\tfn,\n\t};\n\tif (opts.registry !== undefined) addToRestoreRegistry(opts.registry, definition);\n\treturn definition;\n}\n\n/**\n * Instantiate an operator as a bare `Node<T>` — NO Graph required (D43 bare-node path).\n * Wraps `op.body` in the D30 value-throw→ERROR boundary; merges `op.opts` with caller `opts`\n * (caller wins, so `partial`/`pool`/`dispatcher` overrides take effect). The\n * dispatcher defaults to the process-global (D26) unless `opts.dispatcher` is passed.\n *\n * `g.initNode` is the same call PLUS graph registration; graph inspection\n * (describe/observe/profile) requires that path — a node built bare here is not registered in\n * any graph's index.\n */\nexport function initNode<TIn, TOut>(\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut> = {},\n): Node<TOut> {\n\treturn makeInitNode(op, deps, opts);\n}\n\n/** @internal Graph-bound operator instantiation into a graph-local B49 core. */\nexport function initNodeWithCore<TIn, TOut>(\n\tcore: NodeCore,\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut> = {},\n): Node<TOut> {\n\treturn withNodeCore(core, () => makeInitNode(op, deps, opts));\n}\n\nfunction makeInitNode<TIn, TOut>(\n\top: Operator<TIn, TOut>,\n\tdeps: readonly Node<unknown>[],\n\topts: NodeOptions<TOut>,\n): Node<TOut> {\n\tconst body = operatorNodeFn(op);\n\t// D43-reserved / D51: stamp the operator's real factory onto the bare node so a runtime *Map\n\t// inner (created here via fromAny, NOT registered in any graph) is named in describe's\n\t// auto-discovery. A graph-bound g.initNode also records it in `_entries` (entry.factory wins\n\t// there); this field is only read for a node absent from the graph index. Caller opts win.\n\treturn new Node<TOut>([...deps], body, { factory: op.factory, ...op.opts, ...opts });\n}\n\n/** @internal Build the dispatcher body for an Operator spec. */\nexport function operatorNodeFn<TIn, TOut>(op: Operator<TIn, TOut>): NodeFn {\n\treturn (ctx) => {\n\t\ttry {\n\t\t\top.body(ctx);\n\t\t} catch (e) {\n\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"operator threw without a valid error payload\")]]); // D30: value-level throw → ERROR\n\t\t}\n\t};\n}\n\n// ── Slice 1 — single-dep map / take / control (CSP-2.7 catalog re-derive, D40) ──\n// All read dep 0 positionally + emit via ctx.down. Under D49 every occurrence is DATA (no\n// equals-absorption); a body that returns WITHOUT emitting gets a substrate-synthesized undirty\n// RESOLVED (R-resolved-undirty) — so a \"skip this wave\" is a bare `return`. Terminal-emitting\n// operators (reduce/last/find/elementAt) read `depTerminal(ctx, 0)` via the\n// `completeWhenDepsComplete:false + terminalAsRealInput:true` flags (R-deps-terminal): the fn fires\n// on the source's COMPLETE and emits its final value. NOT 1:1 pure-ts ports — the frozen reference\n// (D41) uses a producer + internal `subscribeOr`, the D45-banned describe island; these are\n// declared-dep nodes whose single edge `describe` shows truthfully.\n\n/**\n * Transform each upstream DATA value with a synchronous mapping function.\n *\n * @param fn - Mapping function, or a named `define()` definition for checkpoint restoration.\n * @returns An operator that emits `fn(value)` for each upstream value.\n * @example\n * ```ts\n * import { graph, map } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const count = g.state(1);\n * const doubled = g.initNode(map((value: number) => value * 2), [count]);\n * ```\n * @remarks **Restorable maps:** Passing a named `define()` registers semantic restore metadata.\n * @category operators\n */\nexport function map<S, T>(fn: ((v: S) => T) | Definition<S, T>): Operator<S, T> {\n\tif (isDefinition(fn)) {\n\t\treturn mapFromFunction(fn.fn, {\n\t\t\tref: \"map\",\n\t\t\tconfig: { fn: toCheckpointJson(fn.ref, `map.fn`) },\n\t\t});\n\t}\n\treturn mapFromFunction(fn);\n}\n\nfunction mapFromFunction<S, T>(\n\tfn: (v: S) => T,\n\trestore?: {\n\t\tref: string;\n\t\tconfig?: GraphCheckpointJson;\n\t\tconfigVersion?: GraphCheckpointJson;\n\t},\n): Operator<S, T> {\n\treturn {\n\t\tfactory: \"map\",\n\t\t...(restore ? { restore } : {}),\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b) ctx.down([[\"DATA\", fn(v as S)]]);\n\t\t},\n\t};\n}\n\n/**\n * Pass through upstream values that satisfy a predicate.\n *\n * @param pred - Predicate evaluated for each upstream DATA value.\n * @returns An operator that emits matching values and stays quiet for non-matches.\n * @example\n * ```ts\n * import { filter, graph } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const count = g.state(0);\n * const even = g.initNode(filter((value: number) => value % 2 === 0), [count]);\n * ```\n * @category operators\n */\nexport function filter<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"filter\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b) if (pred(v as S)) ctx.down([[\"DATA\", v]]);\n\t\t},\n\t};\n}\n\n/**\n * Accumulate upstream values and emit each intermediate accumulator.\n *\n * @param reducer - Reducer called with the previous accumulator and each upstream value.\n * @param seed - Initial accumulator value.\n * @returns An operator that emits the accumulator after every input value.\n * @example\n * ```ts\n * import { graph, scan } from \"@graphrefly/ts\";\n *\n * const g = graph();\n * const values = g.state(1);\n * const total = g.initNode(scan((sum: number, value: number) => sum + value, 0), [values]);\n * ```\n * @category operators\n */\nexport function scan<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T> {\n\treturn {\n\t\tfactory: \"scan\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet acc = ctx.state.get<T>() ?? seed;\n\t\t\tfor (const v of b) {\n\t\t\t\tacc = reducer(acc, v as S);\n\t\t\t\tctx.down([[\"DATA\", acc]]);\n\t\t\t}\n\t\t\tctx.state.set(acc);\n\t\t},\n\t};\n}\n\n/**\n * Emit the first `n` upstream values, then complete.\n *\n * @param n - Number of DATA values to pass before completion.\n * @returns An operator that forwards at most `n` values and then emits COMPLETE.\n * @example\n * ```ts\n * import { graph, take } from \"@graphrefly/ts\";\n *\n * const firstThree = graph().initNode(take<number>(3), [source]);\n * ```\n * @category operators\n */\nexport function take<S>(n: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"take\",\n\t\trestore: { ref: \"take\", config: { n: toCheckpointJson(n, \"take.n\") } },\n\t\tbody: (ctx) => {\n\t\t\tif (n <= 0) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tif (count >= n) return; // already satisfied\n\t\t\tfor (const v of b) {\n\t\t\t\tif (count >= n) break;\n\t\t\t\tcount += 1;\n\t\t\t\tctx.down(count >= n ? [[\"DATA\", v], [\"COMPLETE\"]] : [[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(count);\n\t\t},\n\t};\n}\n\n/**\n * Suppress consecutive duplicate values.\n *\n * @param eq - Equality predicate; defaults to `Object.is`.\n * @returns An operator that emits only when the next value differs from the previous emitted value.\n * @example\n * ```ts\n * import { distinctUntilChanged, graph } from \"@graphrefly/ts\";\n *\n * const stable = graph().initNode(distinctUntilChanged<number>(), [source]);\n * ```\n * @category operators\n */\nexport function distinctUntilChanged<S>(eq: (a: S, b: S) => boolean = Object.is): Operator<S, S> {\n\treturn {\n\t\tfactory: \"distinctUntilChanged\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tconst prev = ctx.state.get<{ v: S }>();\n\t\t\tlet last = prev?.v;\n\t\t\tlet hasLast = prev !== undefined;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (hasLast && eq(last as S, v)) continue;\n\t\t\t\tlast = v;\n\t\t\t\thasLast = true;\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tif (hasLast) ctx.state.set({ v: last as S });\n\t\t},\n\t};\n}\n\n/**\n * merge: interleave several sources — emit each DATA from whichever dep fired. `partial:true`\n * (combine-family): fires on any single dep, not gated on all deps settling.\n *\n * @returns An operator that forwards DATA from any dependency.\n * @example\n * ```ts\n * import { graph, merge } from \"@graphrefly/ts\";\n *\n * const merged = graph().initNode(merge<number>(), [left, right]);\n * ```\n * @category operators\n */\nexport function merge<T>(): Operator<T, T> {\n\treturn {\n\t\tfactory: \"merge\",\n\t\topts: { partial: true },\n\t\tbody: (ctx) => {\n\t\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\tif (b && b.length > 0) {\n\t\t\t\t\tfor (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * reduce: accumulate over the whole source, emit ONE final value on the source's COMPLETE\n * (RxJS `reduce`). Unlike {@link scan} (which emits every step), reduce stays quiet until the\n * source terminates. `completeWhenDepsComplete:false + terminalAsRealInput:true`: the fn fires on\n * the source COMPLETE (reading `terminal===true`) and emits the accumulator + COMPLETE. An empty\n * source emits the seed (RxJS parity). A source ERROR auto-forwards (errorWhenDepsError default).\n *\n * @param reducer - Reducer called with the accumulator and each upstream DATA value.\n * @param seed - Initial accumulator value emitted if the source completes empty.\n * @returns An operator that emits one accumulated value when the source completes.\n * @example\n * ```ts\n * import { graph, reduce } from \"@graphrefly/ts\";\n *\n * const total = graph().initNode(reduce((sum: number, value: number) => sum + value, 0), [source]);\n * ```\n * @category operators\n */\nexport function reduce<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T> {\n\treturn {\n\t\tfactory: \"reduce\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet acc = ctx.state.get<T>() ?? seed;\n\t\t\tif (b) for (const v of b) acc = reducer(acc, v as S);\n\t\t\tctx.state.set(acc);\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"DATA\", acc], [\"COMPLETE\"]]);\n\t\t\t// else (live DATA wave): no emit → substrate-synthesized undirty RESOLVED (D49).\n\t\t},\n\t};\n}\n\n/**\n * pairwise: emit `[previous, current]` for each consecutive pair; the very first value produces no\n * pair (quiet → undirty RESOLVED). Previous value is kept in `ctx.state`.\n */\nexport function pairwise<S>(): Operator<S, readonly [S, S]> {\n\treturn {\n\t\tfactory: \"pairwise\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tconst st = ctx.state.get<{ prev: S }>();\n\t\t\tlet prev = st?.prev;\n\t\t\tlet hasPrev = st !== undefined;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (hasPrev) ctx.down([[\"DATA\", [prev as S, v] as const]]);\n\t\t\t\tprev = v;\n\t\t\t\thasPrev = true;\n\t\t\t}\n\t\t\tif (hasPrev) ctx.state.set({ prev: prev as S });\n\t\t},\n\t};\n}\n\n/** skip: drop the first `n` DATA values, then pass the rest through. */\nexport function skip<S>(n: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"skip\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tfor (const v of b) {\n\t\t\t\tif (count < n) {\n\t\t\t\t\tcount += 1;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(count);\n\t\t},\n\t};\n}\n\n/**\n * takeWhile: emit values while `pred` holds; on the first value that fails `pred`, COMPLETE\n * WITHOUT emitting it (RxJS default, non-inclusive). Terminal-is-forever once it completes.\n */\nexport function takeWhile<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"takeWhile\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (pred(v)) ctx.down([[\"DATA\", v]]);\n\t\t\t\telse {\n\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * first: emit the first value matching `pred` (or simply the first value), then COMPLETE. EDGE\n * (RxJS divergence, flagged — same class as last/find/elementAt): if the source COMPLETEs with no\n * matching value, the substrate auto-cascades a bare COMPLETE (no value); RxJS `first()` throws\n * EmptyError. Could align to `[[ERROR, EmptyError]]` (expressible) if strict RxJS parity is wanted.\n */\nexport function first<S>(pred?: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"first\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tfor (const v of b as readonly S[]) {\n\t\t\t\tif (!pred || pred(v)) {\n\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// no match in this wave → undirty RESOLVED (await next match)\n\t\t},\n\t};\n}\n\n/**\n * last: emit the last value matching `pred` (or the last value) on the source's COMPLETE.\n * `completeWhenDepsComplete:false + terminalAsRealInput:true`. EDGE (RxJS divergence, flagged):\n * RxJS `last()` throws EmptyError when no value matched; we COMPLETE without a value (no throw) —\n * the clean-slate substrate has no \"complete-or-throw\" terminal and SENTINEL forbids emitting a\n * placeholder.\n */\nexport function last<S>(pred?: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"last\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b) for (const v of b) if (!pred || pred(v as S)) ctx.state.set({ v });\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) {\n\t\t\t\tconst st = ctx.state.get<{ v: S }>();\n\t\t\t\tctx.down(st ? [[\"DATA\", st.v], [\"COMPLETE\"]] : [[\"COMPLETE\"]]);\n\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * find: emit the first value matching `pred`, then COMPLETE. EDGE (RxJS divergence, flagged): RxJS\n * `find` emits `undefined` then COMPLETE when nothing matched — but `undefined` IS the SENTINEL\n * (R-sentinel), so a not-found source COMPLETE here emits a bare COMPLETE (no value).\n */\nexport function find<S>(pred: (v: S) => boolean): Operator<S, S> {\n\treturn {\n\t\tfactory: \"find\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tif (pred(v as S)) {\n\t\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]); // not found → bare COMPLETE\n\t\t},\n\t};\n}\n\n/**\n * elementAt: emit the value at zero-based `index`, then COMPLETE. EDGE (RxJS divergence, flagged):\n * RxJS throws ArgumentOutOfRangeError if the source completes before `index`; we COMPLETE without\n * a value (no throw), consistent with last/find.\n */\nexport function elementAt<S>(index: number): Operator<S, S> {\n\treturn {\n\t\tfactory: \"elementAt\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet count = ctx.state.get<number>() ?? 0;\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tif (count === index) {\n\t\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t\tctx.state.set(count);\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]); // index out of range → bare COMPLETE\n\t\t},\n\t};\n}\n\n/** Observer object for {@link tap} — lifecycle-aware side effects (RxJS tap observer form). */\nexport interface TapObserver<T> {\n\tdata?: (value: T) => void;\n\terror?: (err: unknown) => void;\n\tcomplete?: () => void;\n}\n\n/**\n * tap: invoke a side effect on each DATA (function form) or on data/error/complete (observer form);\n * values pass through unchanged. The observer form reads source terminals\n * (`completeWhenDepsComplete:false + errorWhenDepsError:false + terminalAsRealInput:true`) so it can\n * call `error`/`complete` then forward the terminal; the function form lets the substrate\n * auto-cascade terminals.\n */\nexport function tap<S>(fnOrObserver: ((v: S) => void) | TapObserver<S>): Operator<S, S> {\n\tif (typeof fnOrObserver === \"function\") {\n\t\tconst fn = fnOrObserver;\n\t\treturn {\n\t\t\tfactory: \"tap\",\n\t\t\tbody: (ctx) => {\n\t\t\t\tconst b = depBatch(ctx, 0);\n\t\t\t\tif (b)\n\t\t\t\t\tfor (const v of b) {\n\t\t\t\t\t\tfn(v as S);\n\t\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t\t}\n\t\t\t},\n\t\t};\n\t}\n\tconst obs = fnOrObserver;\n\treturn {\n\t\tfactory: \"tap\",\n\t\topts: {\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx) => {\n\t\t\tconst terminal = depTerminal(ctx, 0);\n\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\tobs.complete?.();\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(terminal)) {\n\t\t\t\tconst err = terminalErrorValue(terminal);\n\t\t\t\tobs.error?.(err);\n\t\t\t\tctx.down([[\"ERROR\", err]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (b)\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tobs.data?.(v as S);\n\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t}\n\t\t},\n\t};\n}\n\n/**\n * onFirstData (alias `tapFirst`): invoke `fn` exactly once on the first qualifying value (default\n * `where: v => v != null` — null/undefined pass through without counting as \"first\"), then pass all\n * values through unchanged. The one-shot guard is per-node `ctx.state` (NOT a factory closure, so a\n * second instantiation of the same factory re-arms — R-ctx-state).\n */\nexport function onFirstData<S>(\n\tfn: (v: S) => void,\n\topts?: { where?: (v: S) => boolean },\n): Operator<S, S> {\n\tconst where = opts?.where ?? ((v: S) => v != null);\n\treturn {\n\t\tfactory: \"onFirstData\",\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tif (!b) return;\n\t\t\tlet fired = ctx.state.get<boolean>() ?? false;\n\t\t\tfor (const v of b) {\n\t\t\t\tif (!fired && where(v as S)) {\n\t\t\t\t\tfired = true;\n\t\t\t\t\tfn(v as S);\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t}\n\t\t\tctx.state.set(fired);\n\t\t},\n\t};\n}\n\n/** tapFirst: alias of {@link onFirstData} (the one-shot companion to {@link tap}). */\nexport const tapFirst = onFirstData;\n\n/** Options for {@link settle}. */\nexport interface SettleOpts<S> {\n\t/** Consecutive no-change waves before declaring convergence + COMPLETE. */\n\tquietWaves: number;\n\t/** Optional hard cap on total waves before forced COMPLETE. */\n\tmaxWaves?: number;\n\t/** Optional comparator; a DATA equal to the previous one does NOT reset the quiet counter. */\n\tequals?: (a: S, b: S) => boolean;\n}\n\n/** Internal settle accumulator state (per-node, R-ctx-state). */\ninterface SettleState<S> {\n\tlast: S | undefined;\n\thasValue: boolean;\n\tquiet: number;\n\twaves: number;\n\tdone: boolean;\n}\n\n/**\n * settle: forward each DATA unchanged, watch for convergence, COMPLETE once the source has been\n * quiet for `quietWaves` consecutive waves (or `maxWaves` elapsed). \"Wave\" = one fn invocation\n * (a DATA batch OR a bare undirty RESOLVED end-of-wave). No polling (R-no-polling) — the counter\n * advances only on real upstream waves. `settle`'s own `equals` is a body comparator, NOT the\n * removed substrate `equals` (D49).\n */\nexport function settle<S>(opts: SettleOpts<S>): Operator<S, S> {\n\tconst { quietWaves, maxWaves, equals } = opts;\n\tif (!Number.isInteger(quietWaves) || quietWaves < 1) {\n\t\tthrow new RangeError(`settle: quietWaves must be a positive integer (got ${quietWaves})`);\n\t}\n\tif (maxWaves != null && (!Number.isInteger(maxWaves) || maxWaves < 1)) {\n\t\tthrow new RangeError(`settle: maxWaves must be a positive integer when set (got ${maxWaves})`);\n\t}\n\treturn {\n\t\tfactory: \"settle\",\n\t\tbody: (ctx) => {\n\t\t\tconst st: SettleState<S> = ctx.state.get<SettleState<S>>() ?? {\n\t\t\t\tlast: undefined,\n\t\t\t\thasValue: false,\n\t\t\t\tquiet: 0,\n\t\t\t\twaves: 0,\n\t\t\t\tdone: false,\n\t\t\t};\n\t\t\tif (st.done) return;\n\t\t\tst.waves++;\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tlet sawChange = false;\n\t\t\tif (b && b.length > 0) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tconst next = v as S;\n\t\t\t\t\tconst isChange = !st.hasValue || equals == null || !equals(st.last as S, next);\n\t\t\t\t\tif (isChange) sawChange = true;\n\t\t\t\t\tst.last = next;\n\t\t\t\t\tst.hasValue = true;\n\t\t\t\t\tctx.down([[\"DATA\", next]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tst.quiet = sawChange ? 0 : st.quiet + 1;\n\t\t\tconst settled = st.hasValue && st.quiet >= quietWaves;\n\t\t\tconst exhausted = maxWaves != null && st.waves >= maxWaves;\n\t\t\tif (settled || exhausted) {\n\t\t\t\tst.done = true;\n\t\t\t\tctx.state.set(st);\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t\t// A no-DATA wave that didn't converge → bare undirty RESOLVED is synthesized by the\n\t\t\t// substrate (D49); nothing to emit here.\n\t\t},\n\t};\n}\n\n// ── Slice 3 — error-handling control (CSP-2.7, D40) ──\n// rescue/catchError ABSORB the source ERROR (errorWhenDepsError:false) and read the error payload\n// from `depTerminal(ctx, 0)` (R-deps-terminal). They set completeWhenDepsComplete:false so a\n// normal source COMPLETE is forwarded explicitly — which ALSO sidesteps B40 (the\n// completeWhenDepsComplete:true × absorbed-errored-dep auto-complete gap): there is no auto-complete\n// to block. valve is a [source, control] gate (state-verb-legitimate control input).\n\n/**\n * rescue (alias `catchError`): replace an upstream ERROR with a recovered value. On source DATA →\n * forward; on source ERROR → emit `recover(err)` as DATA (if `recover` throws, forward THAT as\n * ERROR); on source COMPLETE → COMPLETE. After recovery the source is terminal-errored (dead) so no\n * further values flow — the recovered value is the final cached value (matches the frozen pure-ts\n * reference; it does NOT auto-COMPLETE, RxJS-`catchError(()=>of(x))` divergence, flagged).\n */\nexport function rescue<S>(recover: (err: unknown) => S): Operator<S, S> {\n\treturn {\n\t\tfactory: \"rescue\",\n\t\topts: {\n\t\t\terrorWhenDepsError: false,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tconst terminal = depTerminal(ctx, 0);\n\t\t\tif (b) for (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t} else if (isTerminalError(terminal)) {\n\t\t\t\t// ERROR payload absorbed → recover.\n\t\t\t\ttry {\n\t\t\t\t\tctx.down([[\"DATA\", recover(terminalErrorValue(terminal))]]);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"rescue threw without a valid error payload\")]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t};\n}\n\n/** catchError: RxJS-named alias of {@link rescue}. */\nexport const catchError = rescue;\n\n/** Options for {@link valve}. */\nexport interface ValveOpts {\n\t/**\n\t * Optional AbortController (or a `() => AbortController | undefined` factory): on the control's\n\t * truthy→falsy edge, `valve` calls `controller.abort()` — cancel an in-flight async boundary\n\t * (LLM/fetch) the caller threaded `controller.signal` into. An external-resource cleanup (like\n\t * `ctx.onDeactivation`), NOT an imperative reactive trigger (R-no-imperative).\n\t */\n\tabortInFlight?: AbortController | (() => AbortController | undefined);\n}\n\n/**\n * valve: forward the source's DATA only while `control` (dep 1) is truthy; when closed, stay quiet\n * (undirty RESOLVED). `[source, control]` declared deps + `partial:true` (the control wave can fire\n * before the source ever delivers). `completeWhenDepsComplete:false` — closing the gate (control\n * terminating) does NOT complete the valve; only the SOURCE's terminal (read via\n * `terminalAsRealInput`) is forwarded. The `state`-verb control input is a legitimate external\n * boundary (D4 / D54), not a forbidden imperative trigger.\n */\nexport function valve<S>(opts?: ValveOpts): Operator<S, S> {\n\tconst abortInFlight = opts?.abortInFlight;\n\treturn {\n\t\tfactory: \"valve\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst srcBatch = depBatch(ctx, 0);\n\t\t\tconst ctlBatch = depBatch(ctx, 1);\n\t\t\tconst srcTerminal = depTerminal(ctx, 0);\n\t\t\tconst controlValue = depLatest(ctx, 1) as boolean | undefined;\n\n\t\t\tif (abortInFlight != null) {\n\t\t\t\t// Fire abort on the truthy→falsy edge only (never on activation / no prior state).\n\t\t\t\tconst prev = ctx.state.get<{ ctl: boolean | undefined }>();\n\t\t\t\tif (prev?.ctl === true && !controlValue) {\n\t\t\t\t\tconst c = typeof abortInFlight === \"function\" ? abortInFlight() : abortInFlight;\n\t\t\t\t\tc?.abort();\n\t\t\t\t}\n\t\t\t\tctx.state.set({\n\t\t\t\t\tctl: controlValue === true ? true : controlValue == null ? undefined : false,\n\t\t\t\t});\n\t\t\t}\n\n\t\t\t// Source terminal forwarding (control terminal is absorbed by completeWhenDepsComplete:false).\n\t\t\tif (isTerminalComplete(srcTerminal)) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(srcTerminal)) {\n\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(srcTerminal)]]);\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (!controlValue) return; // gate closed → quiet (undirty RESOLVED)\n\n\t\t\tif (srcBatch && srcBatch.length > 0) {\n\t\t\t\tfor (const v of srcBatch) ctx.down([[\"DATA\", v]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Gate just opened this wave (control fired, source didn't): re-emit the last source value.\n\t\t\tconst srcLatest = depLatest(ctx, 0);\n\t\t\tif (ctlBatch && ctlBatch.length > 0 && srcLatest !== undefined) {\n\t\t\t\tctx.down([[\"DATA\", srcLatest as S]]);\n\t\t\t}\n\t\t},\n\t};\n}\n","/**\n * The Graph layer (CSP-2): convenience + inspection entry (D5 / R-graph-role).\n *\n * g.* sugar desugars to dispatcher.register + Node and auto-registers into the graph\n * inspection index (D27: sugar→ctx-fn conversion lives strictly here; the substrate node\n * only ever sees `(ctx)=>void`). The Graph owns naming, describe, mount, and the D30\n * value-level throw→ERROR boundary. The bare node()/dispatcher stay inspection-free\n * (R-node-thin).\n *\n * Canonical authority: ~/src/graphrefly — D3/D5/D27/D30/D36/D37/D39, R-graph-role,\n * R-describe, R-fn-contract, R-edges-derived, R-meta-presentation.\n */\n\nimport { type BatchCtx, batch as batchRun } from \"../batch/batch.js\";\nimport { type Ctx, depCount, depLatest, type NodeFn } from \"../ctx/types.js\";\nimport { type Dispatcher, defaultDispatcher } from \"../dispatcher/index.js\";\nimport { NodeCore } from \"../node/core.js\";\nimport {\n\tcheckpointStateOfNode,\n\tgetNodeOwner,\n\tisNodeActiveForRelease,\n\tisNodeRuntimeQuiescentForRelease,\n\tisNodeRuntimeReleased,\n\tNode,\n\ttype NodeOptions,\n\treleaseRuntimeOfNode,\n\tsetNodeOwner,\n\tsetNodeTopologyDepsChangedObserver,\n\tsubscriberCountOfNode,\n\twithEnvironmentDrivers,\n\twithNodeCore,\n} from \"../node/node.js\";\nimport type { NodeVersioningPolicy } from \"../node/versioning.js\";\nimport { errorPayload, messageTier, SENTINEL } from \"../protocol/messages.js\";\nimport {\n\tGRAPH_BLUEPRINT_VERSION,\n\ttype GraphBlueprint,\n\ttype GraphBlueprintOptions,\n\tgraphBlueprintDiagnostics,\n\tnormalizeTopology,\n\tnormalizeTopologyMeta,\n} from \"./blueprint.js\";\nimport {\n\tcheckpointBackendStateOfNode,\n\tcheckpointTerminal,\n\tcheckpointValue,\n\tGRAPH_CHECKPOINT_VERSION,\n\ttype GraphCheckpoint,\n\ttype GraphCheckpointFactory,\n\ttype GraphCheckpointJson,\n\ttype GraphCheckpointNode,\n\ttoCheckpointJson,\n} from \"./checkpoint.js\";\nimport {\n\ttype DescribeEdge,\n\ttype DescribeNode,\n\ttype DescribeOpts,\n\ttype DescribeSnapshot,\n\ttype GraphTopologySnapshot,\n\ttopologyFromDescribe,\n} from \"./describe.js\";\nimport { EnvironmentDrivers } from \"./environment.js\";\nimport { lifecycleRegistrars, restoreRegistrars } from \"./graph-lifecycle.js\";\nimport {\n\tassertCheckpointQuiescentStatus,\n\tcheckpointFactory,\n\tcloneTopologyEvent,\n\texplainSubset,\n\tisNonAuthoritativeCollectionHelperMeta,\n\tprefixTopologyPath,\n\ttopologyPathMatches,\n} from \"./graph-support.js\";\nimport {\n\tGraphTopologyGroup,\n\ttype TopologyGroup,\n\ttype TopologyGroupOptions,\n} from \"./graph-topology-group.js\";\nimport type { DepValues, DerivedFn, EffectFn, GraphOptions, SugarOpts } from \"./graph-types.js\";\nimport type {\n\tNodeProfile,\n\tObserveStream,\n\tProfile,\n\tTopologyEvent,\n\tTopologyStream,\n} from \"./inspect.js\";\nimport { initNodeWithCore, type Operator } from \"./operators.js\";\n\nexport type {\n\tTopologyGroup,\n\tTopologyGroupOptions,\n\tTopologyGroupReleaseOptions,\n} from \"./graph-topology-group.js\";\nexport type { DerivedFn, EffectFn, GraphOptions, SugarOpts } from \"./graph-types.js\";\n\ninterface Entry {\n\tnode: Node<unknown>;\n\tid: string;\n\tname?: string;\n\tfactory: string;\n\tdeps: readonly Node<unknown>[];\n\tmeta?: Record<string, unknown>;\n\trestore?: { ref: string; config?: unknown; configVersion?: unknown };\n}\n\ninterface TopologyObserver {\n\tpath?: string;\n\tsink(event: TopologyEvent): void;\n}\n\ninterface MountedGraph {\n\tat: string;\n\tgraph: Graph;\n\ttopologyUnsub?: () => void;\n}\n\nfunction nodeOwner(n: Node<unknown>): Graph | undefined {\n\treturn getNodeOwner(n) as Graph | undefined;\n}\n\nexport function assertGraphLocalNode(owner: Graph, n: Node<unknown>, label: string): void {\n\tif (isNodeRuntimeReleased(n)) {\n\t\tthrow new Error(`${label} has been released from its graph lifecycle (D122)`);\n\t}\n\tconst existing = nodeOwner(n);\n\tif (existing !== undefined && existing !== owner) {\n\t\tthrow new Error(\n\t\t\t`${label} belongs to a different graph; cross-graph deps require a wire bridge`,\n\t\t);\n\t}\n}\n\n/**\n * A state node (L4-Q1): a manual source whose `.set(v)` is `node.down([[DATA, v]])` sugar.\n * Extends the substrate Node so it is usable as a dep AND carries the graph-layer `.set`.\n *\n * @example\n * ```ts\n * import { graph } from \"@graphrefly/ts\";\n *\n * const count = graph().state(0);\n * count.set(1);\n * ```\n * @category graph\n */\nexport class StateNode<T> extends Node<T> {\n\tset(v: T): void {\n\t\tthis.down([[\"DATA\", v]]);\n\t}\n}\n\n/**\n * Own a single graph-local topology, lifecycle, inspection index, and dispatcher boundary.\n *\n * @example\n * ```ts\n * import { graph } from \"@graphrefly/ts\";\n *\n * const g = graph({ name: \"counter\" });\n * const count = g.state(0, { name: \"count\" });\n * const doubled = g.derived([count], ([value]) => value * 2, { name: \"doubled\" });\n * ```\n * @remarks **Graph-local:** Cross-graph dependencies require a wire bridge; direct deps stay inside\n *   one graph ownership domain.\n * @category graph\n */\nexport class Graph {\n\treadonly name?: string;\n\tprivate readonly _dispatcher: Dispatcher;\n\tprivate readonly _versioning: NodeVersioningPolicy | undefined;\n\tprivate readonly _environment: EnvironmentDrivers;\n\tprivate readonly _core = new NodeCore();\n\tprivate readonly _entries = new Map<Node<unknown>, Entry>();\n\tprivate readonly _byId = new Map<string, Node<unknown>>();\n\tprivate readonly _retiredIds = new Set<string>();\n\tprivate readonly _mounts: MountedGraph[] = [];\n\tprivate _seq = 0;\n\tprivate _clock = 0; // graph-local monotonic clock for observe seq (D26)\n\tprivate _topologyObserverSeq = 0;\n\tprivate readonly _topologyObservers = new Map<number, TopologyObserver>();\n\tprivate _topologyDelivering = false;\n\tprivate readonly _topologyQueue: TopologyEvent[] = [];\n\t// D51: stable synthetic ids for unregistered live deps (runtime *Map inners) auto-discovered by\n\t// describe(). WeakMap-cached so successive describes agree + the inner's id is freed when it is.\n\t// A dedicated counter (NOT _seq) so a describe() call never perturbs registered-node id numbering.\n\tprivate _synthSeq = 0;\n\tprivate readonly _synthIds = new WeakMap<Node<unknown>, string>();\n\n\tconstructor(opts: GraphOptions = {}) {\n\t\tthis.name = opts.name;\n\t\tthis._dispatcher = opts.dispatcher ?? defaultDispatcher;\n\t\tthis._versioning = opts.versioning;\n\t\tthis._environment = opts.environment ?? EnvironmentDrivers.empty();\n\t\tif (opts.profile) this._dispatcher.setRecording(true);\n\t\trestoreRegistrars.set(this, {\n\t\t\tstateNode: <T = unknown>(id: string, stateOpts: SugarOpts<T> = {}) => {\n\t\t\t\tconst n = this._construct(() => new StateNode<T>([], null, this._nodeOpts(stateOpts)));\n\t\t\t\tthis._addWithId(n, \"state\", [], stateOpts, id);\n\t\t\t\treturn n;\n\t\t\t},\n\t\t\tnode: <T = unknown>(\n\t\t\t\tid: string,\n\t\t\t\tfactory: string,\n\t\t\t\tdeps: readonly Node<unknown>[],\n\t\t\t\tfn: NodeFn | null,\n\t\t\t\tnodeOpts: SugarOpts<T> = {},\n\t\t\t) => {\n\t\t\t\tthis._assertDepsLocal(deps, `dep of restored '${id}'`);\n\t\t\t\tconst n = this._construct(() => new Node<T>([...deps], fn, this._nodeOpts(nodeOpts)));\n\t\t\t\tthis._addWithId(n, factory, deps, nodeOpts, id);\n\t\t\t\treturn n;\n\t\t\t},\n\t\t});\n\t\tlifecycleRegistrars.set(this, {\n\t\t\tassertRegisteredNode: (node, label) => this._assertRegisteredNode(node, label),\n\t\t\treleaseNodes: (nodes, releaseOpts) => this._releaseNodes(nodes, releaseOpts),\n\t\t});\n\t}\n\n\t// ── registration / inspection index ──\n\n\tprivate _add<T>(\n\t\tn: Node<T>,\n\t\tfactory: string,\n\t\tdeps: readonly Node<unknown>[],\n\t\topts: SugarOpts<T>,\n\t): Node<T> {\n\t\tconst id = opts.name ?? `${factory}#${this._seq++}`;\n\t\treturn this._addWithId(n, factory, deps, opts, id);\n\t}\n\n\tprivate _addWithId<T>(\n\t\tn: Node<T>,\n\t\tfactory: string,\n\t\tdeps: readonly Node<unknown>[],\n\t\topts: SugarOpts<T>,\n\t\tid: string,\n\t): Node<T> {\n\t\tassertGraphLocalNode(this, n as Node<unknown>, `graph node '${opts.name ?? factory}'`);\n\t\tfor (const dep of deps) assertGraphLocalNode(this, dep, `dep of '${opts.name ?? factory}'`);\n\t\tif (this._byId.has(id)) {\n\t\t\tthrow new Error(`graph: duplicate node id '${id}' (checkpoint/describe ids must be unique)`);\n\t\t}\n\t\tif (this._retiredIds.has(id)) {\n\t\t\tthrow new Error(`graph: node id '${id}' was released and cannot be reused (D152/D153)`);\n\t\t}\n\t\tconst meta =\n\t\t\topts.meta === undefined\n\t\t\t\t? undefined\n\t\t\t\t: (normalizeTopologyMeta(opts.meta, `graph node '${id}' meta`) as Record<string, unknown>);\n\t\tthis._entries.set(n as Node<unknown>, {\n\t\t\tnode: n as Node<unknown>,\n\t\t\tid,\n\t\t\tname: opts.name,\n\t\t\tfactory,\n\t\t\tdeps,\n\t\t\tmeta,\n\t\t\trestore: opts.restore,\n\t\t});\n\t\tsetNodeOwner(n as Node<unknown>, this);\n\t\tthis._byId.set(id, n as Node<unknown>);\n\t\tsetNodeTopologyDepsChangedObserver(n as Node<unknown>, (_node, prevDeps, nextDeps) => {\n\t\t\tthis._emitTopologyDepsChanged(n as Node<unknown>, prevDeps, nextDeps);\n\t\t});\n\t\tconst seqMatch = /#(\\d+)$/.exec(id);\n\t\tif (seqMatch) this._seq = Math.max(this._seq, Number(seqMatch[1]) + 1);\n\t\tthis._emitTopologyNodeRegistered(n as Node<unknown>);\n\t\treturn n;\n\t}\n\n\tprivate _assertDepsLocal(deps: readonly Node<unknown>[], label: string): void {\n\t\tfor (const dep of deps) assertGraphLocalNode(this, dep, label);\n\t}\n\n\tprivate _assertRegisteredNode(node: Node<unknown>, label: string): void {\n\t\tassertGraphLocalNode(this, node, label);\n\t\tif (!this._entries.has(node)) {\n\t\t\tthrow new Error(`${label} is not a registered graph node (D152)`);\n\t\t}\n\t}\n\n\tprivate _nodeOpts<T>(opts: SugarOpts<T>): NodeOptions<T> {\n\t\tif (opts.meta !== undefined) {\n\t\t\tnormalizeTopologyMeta(opts.meta, `graph node '${opts.name ?? opts.factory ?? \"node\"}' meta`);\n\t\t}\n\t\t// strip graph-only fields; inject the bound dispatcher\n\t\tconst { name: _n, meta: _m, restore: _r, ...rest } = opts;\n\t\treturn {\n\t\t\t...rest,\n\t\t\tversioning: rest.versioning ?? this._versioning,\n\t\t\tdispatcher: this._dispatcher,\n\t\t};\n\t}\n\n\tprivate _construct<TNode extends Node<unknown>>(create: () => TNode): TNode {\n\t\treturn withEnvironmentDrivers(this._environment, () => withNodeCore(this._core, create));\n\t}\n\n\t/** Look up a registered node by its id. */\n\tfind(id: string): Node<unknown> | undefined {\n\t\tconst local = this._byId.get(id);\n\t\tif (local !== undefined) return local;\n\t\tconst separator = id.indexOf(\"::\");\n\t\tif (separator < 0) return undefined;\n\t\tconst mountPath = id.slice(0, separator);\n\t\tconst childPath = id.slice(separator + 2);\n\t\treturn this._mounts.find((mount) => mount.at === mountPath)?.graph.find(childPath);\n\t}\n\n\tprivate _releaseNodes(nodes: readonly Node<unknown>[], _opts: { reason?: string } = {}): void {\n\t\tconst seen = new Set<Node<unknown>>();\n\t\tconst entries: Array<{ node: Node<unknown>; entry: Entry }> = [];\n\t\tfor (const node of nodes) {\n\t\t\tif (seen.has(node)) continue;\n\t\t\tseen.add(node);\n\t\t\tconst entry = this._entries.get(node);\n\t\t\tif (entry === undefined) continue;\n\t\t\tentries.push({ node, entry });\n\t\t}\n\t\tconst releaseSet = new Set(entries.map(({ node }) => node));\n\t\tconst releaseIds = new Map(entries.map(({ node, entry }) => [node, entry.id] as const));\n\t\tfor (const entry of this._entries.values()) {\n\t\t\tif (releaseSet.has(entry.node)) continue;\n\t\t\tfor (const dep of entry.node.deps) {\n\t\t\t\tif (!releaseSet.has(dep)) continue;\n\t\t\t\tconst depId = releaseIds.get(dep) ?? dep.name ?? dep.factory ?? \"released node\";\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`graph: cannot release node group; '${entry.id}' still depends on '${depId}' (D122)`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tfor (const { node, entry } of entries) {\n\t\t\tif (!isNodeRuntimeQuiescentForRelease(node)) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`graph: cannot release node group; '${entry.id}' is not runtime-quiescent (D124)`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tlet internalSubscribers = 0;\n\t\t\tfor (const { node: dependent } of entries) {\n\t\t\t\tif (dependent === node || !isNodeActiveForRelease(dependent)) continue;\n\t\t\t\tfor (const dep of dependent.deps) {\n\t\t\t\t\tif (dep === node) internalSubscribers += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (subscriberCountOfNode(node) > internalSubscribers) {\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`graph: cannot release node group; '${entry.id}' still has live subscribers (D124)`,\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tconst releasedEvents =\n\t\t\tthis._topologyObservers.size === 0\n\t\t\t\t? []\n\t\t\t\t: entries.map(({ node, entry }) => ({\n\t\t\t\t\t\tpath: entry.id,\n\t\t\t\t\t\tfactory: entry.factory,\n\t\t\t\t\t\tdeps: this._topologyDeps(node.deps),\n\t\t\t\t\t}));\n\t\tfor (const { node, entry } of entries) {\n\t\t\tthis._entries.delete(node);\n\t\t\tthis._byId.delete(entry.id);\n\t\t\tthis._retiredIds.add(entry.id);\n\t\t}\n\t\tlet releaseError: unknown;\n\t\tfor (const { node } of entries) {\n\t\t\ttry {\n\t\t\t\treleaseRuntimeOfNode(node);\n\t\t\t} catch (error) {\n\t\t\t\tif (releaseError === undefined) releaseError = error;\n\t\t\t}\n\t\t}\n\t\tfor (const event of releasedEvents) this._emitTopologyNodeReleased(event);\n\t\tif (releaseError !== undefined) throw releaseError;\n\t}\n\n\t// ── 8 verbs (core: node/state/batch + sugar: producer/derived/effect/mount) ──\n\n\t/** ctx-level power surface: a raw `(ctx)=>void` fn (or a passthrough/state when null). */\n\tnode<T = unknown>(\n\t\tdeps: readonly Node<unknown>[] = [],\n\t\tfn: NodeFn | null = null,\n\t\topts: SugarOpts<T> = {},\n\t): Node<T> {\n\t\tthis._assertDepsLocal(deps, `dep of '${opts.name ?? \"node\"}'`);\n\t\tconst n = this._construct(() => new Node<T>(deps as Node<unknown>[], fn, this._nodeOpts(opts)));\n\t\treturn this._add(n, opts.factory ?? \"node\", deps, opts);\n\t}\n\n\t/** A manual source with `.set(v)` (L4-Q1). */\n\tstate<T>(initial: T, opts: SugarOpts<T> = {}): StateNode<T> {\n\t\tconst n = this._construct(\n\t\t\t() => new StateNode<T>([], null, { ...this._nodeOpts(opts), initial }),\n\t\t);\n\t\tthis._add(n, \"state\", [], opts);\n\t\treturn n;\n\t}\n\n\t/** ctx-level depless source; its fn runs on activation (R-rom-ram). */\n\tproducer<T = unknown>(fn: NodeFn, opts: SugarOpts<T> = {}): Node<T> {\n\t\tconst n = this._construct(() => new Node<T>([], fn, this._nodeOpts(opts)));\n\t\treturn this._add(n, \"producer\", [], opts);\n\t}\n\n\t/** value-level pure transform: deps → value (D27 wrapped; D30 throw→ERROR). */\n\tderived<const D extends readonly Node<unknown>[], T>(\n\t\tdeps: D,\n\t\tfn: DerivedFn<D, T>,\n\t\topts: SugarOpts<T> = {},\n\t): Node<T> {\n\t\tthis._assertDepsLocal(deps, `dep of '${opts.name ?? \"derived\"}'`);\n\t\tconst ctxFn: NodeFn = (ctx: Ctx) => {\n\t\t\ttry {\n\t\t\t\tconst args = Array.from({ length: depCount(ctx) }, (_, i) =>\n\t\t\t\t\tdepLatest(ctx, i),\n\t\t\t\t) as DepValues<D>;\n\t\t\t\tconst result = fn(...args);\n\t\t\t\tif (result !== undefined) ctx.down([[\"DATA\", result]]);\n\t\t\t} catch (e) {\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"derived threw without a valid error payload\")]]); // D30: value-level throw → graph-layer ERROR\n\t\t\t}\n\t\t};\n\t\tconst n = this._construct(() => new Node<T>([...deps], ctxFn, this._nodeOpts(opts)));\n\t\treturn this._add(n, \"derived\", deps, opts);\n\t}\n\n\t/** value-level sink: deps → effect; return value (a fn) becomes onDeactivation (D28). */\n\teffect<const D extends readonly Node<unknown>[]>(\n\t\tdeps: D,\n\t\tfn: EffectFn<D>,\n\t\topts: SugarOpts<void> = {},\n\t): Node<void> {\n\t\tthis._assertDepsLocal(deps, `dep of '${opts.name ?? \"effect\"}'`);\n\t\t// effect cleanup = deactivation-only (D28 / Flag 3): the LATEST returned cleanup\n\t\t// fires ONCE when the effect deactivates (not between re-runs — onRerun was cut).\n\t\t// R-cleanup-hooks per-run lifecycle (D28 clarification / C-14): the substrate clears\n\t\t// the hook list before EACH fn run, so the effect re-registers its returned cleanup\n\t\t// every run — only the latest run's registration is live (or none, if the latest run\n\t\t// returned void). No st.registered/ctx.state bookkeeping; re-registering every run is\n\t\t// safe (the per-run clear prevents accumulation).\n\t\tconst ctxFn: NodeFn = (ctx: Ctx) => {\n\t\t\ttry {\n\t\t\t\tconst args = Array.from({ length: depCount(ctx) }, (_, i) =>\n\t\t\t\t\tdepLatest(ctx, i),\n\t\t\t\t) as DepValues<D>;\n\t\t\t\tconst cleanup = fn(...args);\n\t\t\t\tif (typeof cleanup === \"function\") ctx.onDeactivation(cleanup);\n\t\t\t} catch (e) {\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"effect threw without a valid error payload\")]]);\n\t\t\t}\n\t\t};\n\t\tconst n = this._construct(() => new Node<void>([...deps], ctxFn, this._nodeOpts(opts)));\n\t\treturn this._add(n, \"effect\", deps, opts);\n\t}\n\n\t/** Declarative batch (D12): one wave, success→commit / throw→rollback. */\n\tbatch<T>(fn: (bctx: BatchCtx) => T): T {\n\t\treturn batchRun(fn);\n\t}\n\n\t/** Embed a child graph addressable under `at` (R-mount; mount has no deps). */\n\tmount(child: Graph, opts: { at: string }): void {\n\t\tconst mount = { at: opts.at, graph: child };\n\t\tthis._mounts.push(mount);\n\t\tif (this._topologyObservers.size > 0) this._ensureMountedTopologyForwarders();\n\t\tthis._emitTopologyMountChanged(opts.at);\n\t}\n\n\t// ── operator funnel (D43): instantiate any free-standing Operator (node sugar, D6/L1.5) ──\n\t// g.initNode is the single graph-bound entry for the whole operator/source catalog (D40):\n\t// it delegates to the FREE initNode (graph/operators.ts — the D30 throw→ERROR boundary +\n\t// dispatcher binding live there) and records the operator's REAL factory name in the\n\t// inspection index (_add) so describe shows it (D6/R-describe) while the node stays thin\n\t// (R-node-thin). Operators are free-standing factory definitions (graph/operators.ts,\n\t// graph/sources.ts) usable bare via the free initNode(); this funnel is the inspectable\n\t// path. Replaces the per-operator methods.\n\n\t/**\n\t * Instantiate an operator (or source) factory as a registered graph node. `deps` are\n\t * type-checked against the operator's input element type; the output type flows from the\n\t * operator. A source is a depless operator — pass `[]`. Caller `opts` (name/meta/behavioral\n\t * overrides) win over the operator's baked-in `opts`.\n\t */\n\tinitNode<TIn, TOut>(\n\t\top: Operator<TIn, TOut>,\n\t\tdeps: readonly Node<TIn>[],\n\t\topts: SugarOpts<TOut> = {},\n\t): Node<TOut> {\n\t\tconst entryOpts =\n\t\t\top.restore !== undefined && !(\"restore\" in opts) ? { ...opts, restore: op.restore } : opts;\n\t\tfor (const dep of deps as readonly Node<unknown>[])\n\t\t\tassertGraphLocalNode(this, dep, `dep of '${entryOpts.name ?? op.factory}'`);\n\t\t// Node<T> is invariant (T appears in NodeOptions.initial); widen the typed deps to the\n\t\t// erased Node surface the free initNode / _add accept (same cast the old methods used).\n\t\tconst erased = deps as readonly Node<unknown>[];\n\t\tconst n = withEnvironmentDrivers(this._environment, () =>\n\t\t\tinitNodeWithCore(this._core, op, erased, this._nodeOpts(entryOpts)),\n\t\t);\n\t\treturn this._add(n, op.factory, erased, entryOpts);\n\t}\n\n\t/**\n\t * Graph-owned activation root for internal helper nodes. This is the sanctioned keepalive shape:\n\t * a graph, not a helper closure, owns the subscription and returns the release handle.\n\t */\n\tretain<T>(node: Node<T>, opts: { reason?: string } = {}): () => void {\n\t\tassertGraphLocalNode(this, node as Node<unknown>, opts.reason ?? \"retained node\");\n\t\treturn node.subscribe(() => {});\n\t}\n\n\t/**\n\t * D152 graph-owned topology/release group. Members are ordinary registered graph nodes;\n\t * release is quiescent-only and removes ids atomically without synthesizing protocol messages.\n\t */\n\ttopologyGroup(opts: TopologyGroupOptions = {}): TopologyGroup {\n\t\treturn new GraphTopologyGroup(this, opts);\n\t}\n\n\t// ── inspection: describe / observe / profile (D39) ──\n\n\t/** Live point-in-time structure snapshot (R-describe / D39 / D51). `_prefix` carries the mount path. */\n\tdescribe(opts: DescribeOpts = {}, _prefix = \"\"): DescribeSnapshot {\n\t\t// D51: edges derive from each node's CURRENT/LIVE deps (entry.node.deps, NOT the\n\t\t// construction-time entry.deps), so a rewire (C-8 immediate / C-11 *Map deferred) is\n\t\t// reflected and every edge is a real current subscription (D3). A live dep absent from this\n\t\t// graph's index (a runtime *Map inner / bare fromAny node) is AUTO-DISCOVERED as a snapshot\n\t\t// node with a synthesized stable id (B2). B38 extends this to transitive live-reachability:\n\t\t// discovered unregistered nodes are recursively expanded through their own live deps.\n\t\tconst discovered = new Map<Node<unknown>, string>(); // unregistered live dep → synth local id\n\t\tconst localId = (n: Node<unknown>): string => {\n\t\t\tconst e = this._entries.get(n);\n\t\t\tif (e) return `${_prefix}${e.id}`;\n\t\t\t// unregistered: a stable synthetic id, cached so successive describes + both call sites\n\t\t\t// agree; the `~` prefix can't collide with a registered name or `factory#seq`.\n\t\t\tlet sid = this._synthIds.get(n);\n\t\t\tif (sid === undefined) {\n\t\t\t\t// the `~` prefix avoids the registered `name`/`factory#seq` space; guard the\n\t\t\t\t// pathological case of a user node literally named `~factory#n` (bump until free).\n\t\t\t\tdo {\n\t\t\t\t\tsid = `~${n.factory ?? \"?\"}#${this._synthSeq++}`;\n\t\t\t\t} while (this._byId.has(sid));\n\t\t\t\tthis._synthIds.set(n, sid);\n\t\t\t}\n\t\t\tdiscovered.set(n, sid);\n\t\t\treturn `${_prefix}${sid}`;\n\t\t};\n\t\tconst nodes: DescribeNode[] = [];\n\t\tconst edges: DescribeEdge[] = [];\n\t\t// pass 1: registered nodes, reading LIVE deps (localId records any unregistered inner).\n\t\tfor (const entry of this._entries.values()) {\n\t\t\tconst id = `${_prefix}${entry.id}`;\n\t\t\tconst liveIds = entry.node.deps.map(localId);\n\t\t\tconst dnode: DescribeNode = {\n\t\t\t\tid,\n\t\t\t\tfactory: entry.factory,\n\t\t\t\tstatus: entry.node.status,\n\t\t\t\tdeps: liveIds,\n\t\t\t};\n\t\t\tif (entry.name !== undefined) dnode.name = entry.name;\n\t\t\tif (entry.node.cache !== undefined) dnode.value = entry.node.cache; // absent = SENTINEL\n\t\t\tif (entry.node.version !== undefined) dnode.version = entry.node.version;\n\t\t\tif (entry.meta !== undefined) dnode.meta = entry.meta;\n\t\t\tnodes.push(dnode);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: id });\n\t\t}\n\t\t// pass 2: recursively emit auto-discovered unregistered nodes (D51+B38). localId() may add\n\t\t// further unregistered deps to `discovered` while this loop runs; a visited set keeps each\n\t\t// discovered node emitted once (stable ids via _synthIds).\n\t\tconst visited = new Set<Node<unknown>>();\n\t\tconst queue: Node<unknown>[] = [...discovered.keys()];\n\t\tfor (let i = 0; i < queue.length; i += 1) {\n\t\t\tconst inner = queue[i];\n\t\t\tif (visited.has(inner)) continue;\n\t\t\tvisited.add(inner);\n\t\t\tconst sid = discovered.get(inner);\n\t\t\tif (sid === undefined) continue;\n\t\t\tconst liveIds = inner.deps.map(localId);\n\t\t\tfor (const dep of inner.deps) {\n\t\t\t\tif (!this._entries.has(dep) && !visited.has(dep)) queue.push(dep);\n\t\t\t}\n\t\t\tconst dnode: DescribeNode = {\n\t\t\t\tid: `${_prefix}${sid}`,\n\t\t\t\tfactory: inner.factory ?? \"?\",\n\t\t\t\tstatus: inner.status,\n\t\t\t\tdeps: liveIds,\n\t\t\t};\n\t\t\tif (inner.cache !== undefined) dnode.value = inner.cache;\n\t\t\tif (inner.version !== undefined) dnode.version = inner.version;\n\t\t\tnodes.push(dnode);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: dnode.id });\n\t\t}\n\t\tconst snap: DescribeSnapshot = { nodes, edges };\n\t\tif (this.name !== undefined) snap.name = this.name;\n\t\tif (this._mounts.length > 0) {\n\t\t\tsnap.subgraphs = this._mounts.map((m) => m.graph.describe({}, `${_prefix}${m.at}::`));\n\t\t}\n\t\treturn opts.explain ? explainSubset(snap, opts.explain) : snap;\n\t}\n\n\t/**\n\t * D173 pure-structure topology snapshot over the same live truth source as describe().\n\t * Runtime status/value/version remain on describe(); blueprint metadata is a later envelope.\n\t */\n\ttopology(): GraphTopologySnapshot {\n\t\treturn topologyFromDescribe(this.describe());\n\t}\n\n\t/**\n\t * D177 synchronous audit/collaboration envelope over the pure topology snapshot.\n\t * Hashing and environment provenance enrichment stay in pure helpers outside Graph core.\n\t */\n\tblueprint(opts: GraphBlueprintOptions = {}): GraphBlueprint {\n\t\tconst topology = normalizeTopology(this.topology());\n\t\tconst out: GraphBlueprint = {\n\t\t\tversion: GRAPH_BLUEPRINT_VERSION,\n\t\t\ttopology,\n\t\t};\n\t\tif (opts.diagnostics) {\n\t\t\t(out as { diagnostics?: ReturnType<typeof graphBlueprintDiagnostics> }).diagnostics =\n\t\t\t\tgraphBlueprintDiagnostics(topology);\n\t\t}\n\t\tif (opts.provenance !== undefined) {\n\t\t\t(out as { provenance?: GraphBlueprint[\"provenance\"] }).provenance = normalizeTopologyMeta(\n\t\t\t\topts.provenance,\n\t\t\t\t\"graph blueprint provenance\",\n\t\t\t\t\"provenance\",\n\t\t\t);\n\t\t}\n\t\treturn out;\n\t}\n\n\tprivate _observeTargets(path?: string): Array<[string, Node<unknown>]> {\n\t\tconst all: Array<[string, Node<unknown>]> = [...this._entries.values()].map((e) => [\n\t\t\te.id,\n\t\t\te.node,\n\t\t]);\n\t\tif (path === undefined) return all; // whole graph\n\t\tconst exact = this._byId.get(path);\n\t\tif (exact) return [[path, exact]]; // single node\n\t\treturn all.filter(([id]) => id.startsWith(`${path}::`)); // subtree (mount-aware :: boundary, QA A-1)\n\t}\n\n\t/**\n\t * observe(path?) = read-only enveloped EGRESS (R-observe / D39). NOT a graph node — it\n\t * taps the target node(s) via subscribe and forwards each Message as an ObserveEvent.\n\t * No path = whole graph; an exact id = a single node; otherwise a `::`-prefix subtree.\n\t */\n\t// NOTE (R-observe/D19): observe is a real, lazily-ACTIVATING subscriber — observing a\n\t// cold node runs its fn (and activates upstream); whole-graph observe() activates the\n\t// graph. \"Read-only\" means it never emits/mutates node state, NOT that it avoids\n\t// activation. Use it knowing inspection of a cold graph wakes it.\n\tobserve(path?: string): ObserveStream {\n\t\tconst targets = this._observeTargets(path);\n\t\treturn {\n\t\t\tsubscribe: (sink) => {\n\t\t\t\tconst unsubs = targets.map(([id, n]) =>\n\t\t\t\t\tn.subscribe((msg) => {\n\t\t\t\t\t\tsink({ path: id, msg, tier: messageTier(msg[0]), seq: this._clock++ });\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\treturn () => {\n\t\t\t\t\tfor (const u of unsubs) u();\n\t\t\t\t};\n\t\t\t},\n\t\t};\n\t}\n\n\t/**\n\t * D145 observeTopology(path?) = read-only graph lifecycle egress over the existing\n\t * graph registry. It is not a graph node, does not subscribe to nodes, and emits no DATA.\n\t */\n\tobserveTopology(path?: string): TopologyStream {\n\t\treturn {\n\t\t\tsubscribe: (sink) => {\n\t\t\t\tconst id = this._topologyObserverSeq++;\n\t\t\t\tthis._topologyObservers.set(id, { path, sink });\n\t\t\t\tthis._ensureMountedTopologyForwarders();\n\t\t\t\treturn () => {\n\t\t\t\t\tthis._topologyObservers.delete(id);\n\t\t\t\t\tif (this._topologyObservers.size === 0) this._releaseMountedTopologyForwarders();\n\t\t\t\t};\n\t\t\t},\n\t\t};\n\t}\n\n\tprivate _idForTopologyNode(n: Node<unknown>): string {\n\t\tconst e = this._entries.get(n);\n\t\tif (e) return e.id;\n\t\tlet sid = this._synthIds.get(n);\n\t\tif (sid === undefined) {\n\t\t\tdo {\n\t\t\t\tsid = `~${n.factory ?? \"?\"}#${this._synthSeq++}`;\n\t\t\t} while (this._byId.has(sid));\n\t\t\tthis._synthIds.set(n, sid);\n\t\t}\n\t\treturn sid;\n\t}\n\n\tprivate _topologyDeps(deps: readonly Node<unknown>[]): string[] {\n\t\treturn deps.map((dep) => this._idForTopologyNode(dep));\n\t}\n\n\tprivate _emitTopologyNodeRegistered(node: Node<unknown>): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tconst entry = this._entries.get(node);\n\t\tif (entry === undefined) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"node-registered\",\n\t\t\tpath: entry.id,\n\t\t\tfactory: entry.factory,\n\t\t\tdeps: this._topologyDeps(node.deps),\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyDepsChanged(\n\t\tnode: Node<unknown>,\n\t\tprevDeps: readonly Node<unknown>[],\n\t\tnextDeps: readonly Node<unknown>[],\n\t): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tconst entry = this._entries.get(node);\n\t\tif (entry === undefined) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"deps-changed\",\n\t\t\tpath: entry.id,\n\t\t\tprevDeps: this._topologyDeps(prevDeps),\n\t\t\tdeps: this._topologyDeps(nextDeps),\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyNodeReleased(event: {\n\t\tpath: string;\n\t\tfactory: string;\n\t\tdeps: readonly string[];\n\t}): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"node-released\",\n\t\t\tpath: event.path,\n\t\t\tfactory: event.factory,\n\t\t\tdeps: [...event.deps],\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyMountChanged(path: string): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: \"mount-changed\",\n\t\t\tpath,\n\t\t\tfactory: \"mount\",\n\t\t\tdeps: [],\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _ensureMountedTopologyForwarders(): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tfor (const mount of this._mounts) {\n\t\t\tif (mount.topologyUnsub !== undefined) continue;\n\t\t\tconst mountPath = mount.at;\n\t\t\tmount.topologyUnsub = mount.graph.observeTopology().subscribe((event) => {\n\t\t\t\tthis._emitMountedTopologyEvent(mountPath, event);\n\t\t\t});\n\t\t}\n\t}\n\n\tprivate _releaseMountedTopologyForwarders(): void {\n\t\tfor (const mount of this._mounts) {\n\t\t\tmount.topologyUnsub?.();\n\t\t\tmount.topologyUnsub = undefined;\n\t\t}\n\t}\n\n\tprivate _emitMountedTopologyEvent(mountPath: string, event: TopologyEvent): void {\n\t\tif (this._topologyObservers.size === 0) return;\n\t\tthis._emitTopologyEvent({\n\t\t\tkind: event.kind,\n\t\t\tpath: prefixTopologyPath(mountPath, event.path),\n\t\t\tdeps: event.deps.map((dep) => prefixTopologyPath(mountPath, dep)),\n\t\t\t...(event.prevDeps !== undefined\n\t\t\t\t? { prevDeps: event.prevDeps.map((dep) => prefixTopologyPath(mountPath, dep)) }\n\t\t\t\t: {}),\n\t\t\t...(event.factory !== undefined ? { factory: event.factory } : {}),\n\t\t\tseq: this._clock++,\n\t\t});\n\t}\n\n\tprivate _emitTopologyEvent(event: TopologyEvent): void {\n\t\tif (this._topologyDelivering) {\n\t\t\tthis._topologyQueue.push(event);\n\t\t\treturn;\n\t\t}\n\t\tthis._topologyDelivering = true;\n\t\ttry {\n\t\t\tlet current: TopologyEvent | undefined = event;\n\t\t\twhile (current !== undefined) {\n\t\t\t\tconst observers = [...this._topologyObservers.entries()];\n\t\t\t\tfor (const [id, observer] of observers) {\n\t\t\t\t\tif (this._topologyObservers.get(id) !== observer) continue;\n\t\t\t\t\tif (observer.path !== undefined && !topologyPathMatches(current.path, observer.path))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tobserver.sink(cloneTopologyEvent(current));\n\t\t\t\t\t} catch {\n\t\t\t\t\t\t// D145 egress is read-only inspection; observer failure must not veto a\n\t\t\t\t\t\t// graph registry/rewire mutation that already committed.\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcurrent = this._topologyQueue.shift();\n\t\t\t}\n\t\t} finally {\n\t\t\tthis._topologyDelivering = false;\n\t\t}\n\t}\n\n\t/**\n\t * profile() = accumulated-counter snapshot (R-profile / D39). invokes + duration are\n\t * dispatcher-backed (the invoke funnel, F-DISPATCH-ALL) — counters never live on the\n\t * thin node (R-node-thin). Requires `graph({ profile: true })` (opt-in, F-PERF).\n\t */\n\tprofile(): Profile {\n\t\tconst nodes: Record<string, NodeProfile> = {};\n\t\tlet totalInvokes = 0;\n\t\tfor (const e of this._entries.values()) {\n\t\t\tconst h = e.node.handle;\n\t\t\tconst stat = h ? this._dispatcher.statFor(h) : undefined;\n\t\t\tconst invokes = stat?.invokes ?? 0;\n\t\t\tnodes[e.id] = {\n\t\t\t\tinvokes,\n\t\t\t\ttotalDurationNs: stat?.totalDurationNs ?? 0,\n\t\t\t\tlastDurationNs: stat?.lastDurationNs ?? 0,\n\t\t\t\tstatus: e.node.status,\n\t\t\t};\n\t\t\t// graph-scoped (QA D-2): sum THIS graph's nodes, NOT the dispatcher-global\n\t\t\t// counter (which would leak invokes from other graphs sharing the dispatcher).\n\t\t\ttotalInvokes += invokes;\n\t\t}\n\t\treturn { totalInvokes, nodes };\n\t}\n\n\t/** Versioned graph lifecycle checkpoint (R-snapshot / D83 / D90). Pure capture, no storage I/O. */\n\tcheckpoint(): GraphCheckpoint {\n\t\treturn this._checkpoint(\"\", new WeakSet());\n\t}\n\n\tprivate _checkpoint(_prefix: string, stack: WeakSet<Graph>): GraphCheckpoint {\n\t\tif (stack.has(this)) {\n\t\t\tthrow new Error(\"checkpoint: cyclic graph mount detected\");\n\t\t}\n\t\tstack.add(this);\n\t\tconst discovered = new Map<Node<unknown>, string>();\n\t\tconst localId = (n: Node<unknown>): string => {\n\t\t\tconst e = this._entries.get(n);\n\t\t\tif (e) return `${_prefix}${e.id}`;\n\t\t\tlet sid = this._synthIds.get(n);\n\t\t\tif (sid === undefined) {\n\t\t\t\tdo {\n\t\t\t\t\tsid = `~${n.factory ?? \"?\"}#${this._synthSeq++}`;\n\t\t\t\t} while (this._byId.has(sid));\n\t\t\t\tthis._synthIds.set(n, sid);\n\t\t\t}\n\t\t\tdiscovered.set(n, sid);\n\t\t\treturn `${_prefix}${sid}`;\n\t\t};\n\t\tconst nodes: GraphCheckpointNode[] = [];\n\t\tconst edges: DescribeEdge[] = [];\n\t\tfor (const entry of this._entries.values()) {\n\t\t\tconst id = `${_prefix}${entry.id}`;\n\t\t\tconst liveIds = entry.node.deps.map(localId);\n\t\t\tnodes.push(\n\t\t\t\tthis._checkpointNode(entry.node, id, {\n\t\t\t\t\tname: entry.name,\n\t\t\t\t\tfactory: checkpointFactory(entry.factory, entry.node, false, entry.restore, entry.meta),\n\t\t\t\t\tdeps: liveIds,\n\t\t\t\t\tmeta: entry.meta,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: id });\n\t\t}\n\t\tconst visited = new Set<Node<unknown>>();\n\t\tconst queue: Node<unknown>[] = [...discovered.keys()];\n\t\tfor (let i = 0; i < queue.length; i += 1) {\n\t\t\tconst inner = queue[i];\n\t\t\tif (visited.has(inner)) continue;\n\t\t\tvisited.add(inner);\n\t\t\tconst sid = discovered.get(inner);\n\t\t\tif (sid === undefined) continue;\n\t\t\tconst liveIds = inner.deps.map(localId);\n\t\t\tfor (const dep of inner.deps) {\n\t\t\t\tif (!this._entries.has(dep) && !visited.has(dep)) queue.push(dep);\n\t\t\t}\n\t\t\tconst id = `${_prefix}${sid}`;\n\t\t\tnodes.push(\n\t\t\t\tthis._checkpointNode(inner, id, {\n\t\t\t\t\tfactory: checkpointFactory(inner.factory ?? \"?\", inner, true),\n\t\t\t\t\tdeps: liveIds,\n\t\t\t\t}),\n\t\t\t);\n\t\t\tfor (const from of liveIds) edges.push({ from, to: id });\n\t\t}\n\t\tconst checkpoint: GraphCheckpoint = {\n\t\t\tversion: GRAPH_CHECKPOINT_VERSION,\n\t\t\tnodes,\n\t\t\tedges,\n\t\t};\n\t\tif (this.name !== undefined) checkpoint.name = this.name;\n\t\tif (this._mounts.length > 0) {\n\t\t\tcheckpoint.mounts = this._mounts.map((m) => ({\n\t\t\t\tat: m.at,\n\t\t\t\tcheckpoint: m.graph._checkpoint(\"\", stack),\n\t\t\t}));\n\t\t}\n\t\tstack.delete(this);\n\t\treturn toCheckpointJson(checkpoint, \"checkpoint\") as unknown as GraphCheckpoint;\n\t}\n\n\tprivate _checkpointNode(\n\t\tnode: Node<unknown>,\n\t\tid: string,\n\t\topts: {\n\t\t\tname?: string;\n\t\t\tfactory: GraphCheckpointFactory;\n\t\t\tdeps: string[];\n\t\t\tmeta?: Record<string, unknown>;\n\t\t},\n\t): GraphCheckpointNode {\n\t\tconst state = checkpointStateOfNode(node);\n\t\tassertCheckpointQuiescentStatus(node.status, id, \"checkpoint\");\n\t\tconst nonAuthoritativeCollectionHelper = isNonAuthoritativeCollectionHelperMeta(opts.meta);\n\t\tconst out: GraphCheckpointNode = {\n\t\t\tid,\n\t\t\tfactory: opts.factory,\n\t\t\tstatus: node.status,\n\t\t\tdeps: opts.deps,\n\t\t\tvalue: nonAuthoritativeCollectionHelper\n\t\t\t\t? { kind: \"SENTINEL\" }\n\t\t\t\t: checkpointValue(state.cache, state.hasData, `${id}.value`),\n\t\t\tterminal: checkpointTerminal(state.terminal, `${id}.terminal`),\n\t\t\tlifecycle: { activated: state.activated, hasCalledFnOnce: state.hasCalledFnOnce },\n\t\t\tctxState: {\n\t\t\t\tpersist: state.ctxState.persist,\n\t\t\t\tvalue: nonAuthoritativeCollectionHelper\n\t\t\t\t\t? { kind: \"SENTINEL\" }\n\t\t\t\t\t: checkpointValue(\n\t\t\t\t\t\t\tstate.ctxState.value,\n\t\t\t\t\t\t\tstate.ctxState.value !== SENTINEL,\n\t\t\t\t\t\t\t`${id}.ctxState`,\n\t\t\t\t\t\t),\n\t\t\t},\n\t\t};\n\t\tif (opts.name !== undefined) out.name = opts.name;\n\t\tconst backendState = checkpointBackendStateOfNode(node, `${id}.backendState`);\n\t\tif (backendState !== undefined) out.backendState = backendState;\n\t\tif (state.version !== undefined) out.version = state.version;\n\t\tif (opts.meta !== undefined)\n\t\t\tout.meta = toCheckpointJson(opts.meta, `${id}.meta`) as {\n\t\t\t\t[key: string]: GraphCheckpointJson;\n\t\t\t};\n\t\treturn out;\n\t}\n}\n\n/**\n * Construct a graph with graph-local topology, lifecycle, and inspection ownership.\n *\n * @param opts - Optional graph name, dispatcher, versioning policy, environment drivers, and\n *   profiling switch.\n * @returns A `Graph` instance whose sugar methods create graph-registered nodes.\n * @example\n * ```ts\n * import { graph } from \"@graphrefly/ts\";\n *\n * const g = graph({ name: \"counter\" });\n * const count = g.state(0, { name: \"count\" });\n * const doubled = g.derived([count], ([value]) => value * 2);\n * ```\n * @category graph\n */\nexport function graph(opts: GraphOptions = {}): Graph {\n\treturn new Graph(opts);\n}\n\n/** @internal D122 graph-owned ephemeral node-group release. */\nexport function releaseGraphNodes(\n\tgraph: Graph,\n\tnodes: readonly Node<unknown>[],\n\topts: { reason?: string } = {},\n): void {\n\tconst registrar = lifecycleRegistrars.get(graph);\n\tif (registrar === undefined) throw new Error(\"graph: unknown lifecycle registrar\");\n\tregistrar.releaseNodes(nodes, opts);\n}\n\n/** @internal D94 descriptor path: register a restored state node without widening Graph. */\nexport function restoreStateNodeInGraph<T = unknown>(\n\tgraph: Graph,\n\tid: string,\n\topts: SugarOpts<T> = {},\n): StateNode<T> {\n\tconst registrar = restoreRegistrars.get(graph);\n\tif (registrar === undefined) throw new Error(\"restoreGraph: unknown graph restore registrar\");\n\treturn registrar.stateNode(id, opts);\n}\n\n/** @internal D94 descriptor path: register a restored ctx-level node without widening Graph. */\nexport function restoreNodeInGraph<T = unknown>(\n\tgraph: Graph,\n\tid: string,\n\tfactory: string,\n\tdeps: readonly Node<unknown>[],\n\tfn: NodeFn | null,\n\topts: SugarOpts<T> = {},\n): Node<T> {\n\tconst registrar = restoreRegistrars.get(graph);\n\tif (registrar === undefined) throw new Error(\"restoreGraph: unknown graph restore registrar\");\n\treturn registrar.node(id, factory, deps, fn, opts);\n}\n","/**\n * Passive semantic-memory vocabulary and deterministic helpers.\n *\n * D158 splits semantic memory into horizontal patterns and vertical solutions.\n * This module intentionally owns no graph nodes, storage restore, timers,\n * subscriptions, vector indexes, knowledge graphs, or agentic runtime.\n */\n\nimport type { StrictJsonValue } from \"../json/codec.js\";\n\n/** Stable identity for a semantic-memory fact. */\nexport type FactId = string;\n\n/** Shard partition key used by passive sharding helpers. */\nexport type ShardKey = string | number;\n\n/**\n * A single semantic-memory fact. Pattern convention only: this is not a\n * protocol message, storage record owner, restore contract, or graph runtime.\n */\nexport interface MemoryFragment<T = unknown> {\n\treadonly id: FactId;\n\treadonly payload: T;\n\t/** Transaction time, typically monotonic nanoseconds. */\n\treadonly tNs: bigint;\n\t/** Valid-time start. Undefined means unbounded past. */\n\treadonly validFrom?: bigint;\n\t/** Valid-time end. Undefined means currently valid. */\n\treadonly validTo?: bigint;\n\t/** Confidence score in the closed interval [0, 1]. */\n\treadonly confidence: number;\n\treadonly tags: readonly string[];\n\t/** Fact ids this fragment derives from or depends on. */\n\treadonly sources: readonly FactId[];\n\treadonly embedding?: readonly number[];\n\treadonly parentFragmentId?: FactId;\n\treadonly provenance?: string;\n}\n\n/** Columnar passive store vocabulary for callers that keep memory facts outside GraphReFly. */\nexport interface FactStore<T = unknown> {\n\treadonly byId: ReadonlyMap<FactId, MemoryFragment<T>>;\n}\n\n/** Read-only projection passed to scoring policies; it exposes no mutation surface. */\nexport interface StoreReadHandle<T = unknown> {\n\tget(id: FactId): MemoryFragment<T> | undefined;\n\thas(id: FactId): boolean;\n\treadonly size: number;\n\tvalues(): IterableIterator<MemoryFragment<T>>;\n}\n\nexport type ScoringPolicy<T = unknown> = (\n\tfragment: MemoryFragment<T>,\n\tstore: StoreReadHandle<T>,\n) => number;\nexport type DecayPolicy = (confidence: number, ageNs: bigint) => number;\nexport type AdmissionFilter<T = unknown> = (fragment: MemoryFragment<T>) => boolean;\n\n/** Outcome signal for policy learning. This is an application fact, not a protocol event. */\nexport interface OutcomeSignal {\n\treadonly factId: FactId;\n\treadonly reward: number;\n}\n\n/** Passive structured query over semantic-memory facts. */\nexport interface MemoryQuery {\n\treadonly tags?: readonly string[];\n\treadonly asOf?: bigint;\n\treadonly minConfidence?: number;\n\treadonly limit?: number;\n}\n\nexport interface MemoryAnswer<T = unknown> {\n\treadonly query: MemoryQuery;\n\treadonly results: readonly MemoryFragment<T>[];\n}\n\nexport type KnowledgeAssertionStrictJsonValue = StrictJsonValue;\n\n/** Passive KG endpoint vocabulary. Entity ids are DATA keys, not graph node ids. */\nexport interface KnowledgeAssertionSubject {\n\treadonly id: FactId;\n\treadonly type?: string;\n}\n\n/** Passive KG object/value vocabulary. */\nexport type KnowledgeAssertionObject =\n\t| {\n\t\t\treadonly kind: \"entity\";\n\t\t\treadonly id: FactId;\n\t\t\treadonly type?: string;\n\t  }\n\t| {\n\t\t\treadonly kind: \"value\";\n\t\t\treadonly value: KnowledgeAssertionStrictJsonValue;\n\t\t\treadonly valueType?: string;\n\t  };\n\n/** Passive KG assertion fact consumed by lower semantic-memory graph patterns. */\nexport interface KnowledgeAssertion {\n\treadonly id: FactId;\n\treadonly recordId?: FactId;\n\treadonly fragmentId?: FactId;\n\treadonly subject: KnowledgeAssertionSubject;\n\treadonly predicate: string;\n\treadonly object: KnowledgeAssertionObject;\n\treadonly confidence?: number;\n\treadonly sources?: readonly FactId[];\n\treadonly provenance?: string;\n}\n\n/** Entry vocabulary for ranked collection-like memory views. */\nexport interface CollectionEntry<T = unknown> {\n\treadonly id: string;\n\treadonly value: T;\n\treadonly createdAtNs: bigint;\n\treadonly lastAccessNs: bigint;\n\treadonly baseScore: number;\n}\n\nexport type RankedCollectionEntry<T = unknown> = CollectionEntry<T> & {\n\treadonly score: number;\n};\n\nexport type CollectionScoreFn<T = unknown> = (value: T) => number;\n\n/** Query shape shared by passive retrieval/ranking helpers. */\nexport interface RetrievalQuery {\n\treadonly text?: string;\n\treadonly vector?: readonly number[];\n\treadonly entityIds?: readonly string[];\n\treadonly context?: readonly string[];\n}\n\nexport interface VectorSearchResult<TMeta = unknown> {\n\treadonly id: string;\n\treadonly score: number;\n\treadonly meta?: TMeta;\n}\n\nexport interface RetrievalEntry<TMem = unknown> {\n\treadonly key: string;\n\treadonly value: TMem;\n\treadonly score: number;\n\treadonly sources: ReadonlyArray<\"vector\" | \"graph\" | \"store\">;\n\treadonly context?: readonly string[];\n}\n\nexport interface RetrievalTrace<TMem = unknown> {\n\treadonly vectorCandidates: ReadonlyArray<VectorSearchResult<TMem>>;\n\treadonly graphExpanded: ReadonlyArray<string>;\n\treadonly ranked: ReadonlyArray<RetrievalEntry<TMem>>;\n\treadonly packed: ReadonlyArray<RetrievalEntry<TMem>>;\n}\n\n/** Generic per-dimension thresholds. Any configured dimension below threshold is rejected. */\nexport type AdmissionThresholds<Dims extends string> = Partial<Record<Dims, number>>;\n\nexport interface AdmissionScoredOptions<Dims extends string, TRaw = unknown> {\n\treadonly scoreFn: (raw: TRaw) => Readonly<Record<Dims, number>>;\n\treadonly thresholds?: AdmissionThresholds<Dims>;\n}\n\nexport interface AdmissionScores {\n\treadonly persistence: number;\n\treadonly structure: number;\n\treadonly personalValue: number;\n}\n\nexport interface AdmissionScore3DOptions {\n\treadonly scoreFn: (raw: unknown) => AdmissionScores;\n\treadonly persistenceThreshold?: number;\n\treadonly personalValueThreshold?: number;\n\treadonly requireStructured?: boolean;\n}\n\nexport interface ShardByTenantOptions {\n\treadonly tenants?: readonly string[];\n\treadonly shardCount?: number;\n}\n\nexport interface ShardByTenantConfig<T = unknown> {\n\treadonly shardBy: (fragment: MemoryFragment<T>) => ShardKey;\n\treadonly shardCount: number;\n}\n\nexport interface MemoryFragmentValidation {\n\treadonly ok: boolean;\n\treadonly errors: readonly string[];\n}\n\n/** Cosine similarity over zero-padded vectors. Non-finite results normalize to 0. */\nexport function cosineSimilarity(a: readonly number[], b: readonly number[]): number {\n\tconst n = Math.max(a.length, b.length);\n\tlet dot = 0;\n\tlet na = 0;\n\tlet nb = 0;\n\tfor (let i = 0; i < n; i += 1) {\n\t\tconst av = a[i] ?? 0;\n\t\tconst bv = b[i] ?? 0;\n\t\tdot += av * bv;\n\t\tna += av * av;\n\t\tnb += bv * bv;\n\t}\n\tif (na === 0 || nb === 0) return 0;\n\tconst score = dot / Math.sqrt(na * nb);\n\treturn Number.isFinite(score) ? score : 0;\n}\n\n/**\n * Returns true when a fragment is valid at `asOf`.\n *\n * Omitted `asOf` has no clock to compare against, so it admits only fragments\n * that are live and not valid-time delayed.\n */\nexport function memoryFragmentValidAt(fragment: MemoryFragment, asOf?: bigint): boolean {\n\tif (asOf === undefined) return fragment.validTo === undefined && fragment.validFrom === undefined;\n\tif (fragment.validFrom !== undefined && fragment.validFrom > asOf) return false;\n\tif (fragment.validTo !== undefined && fragment.validTo <= asOf) return false;\n\treturn true;\n}\n\n/** Pure structured-query predicate over a single fragment. */\nexport function memoryFragmentMatchesQuery(\n\tfragment: MemoryFragment,\n\tquery: MemoryQuery = {},\n): boolean {\n\tif (!memoryFragmentValidAt(fragment, query.asOf)) return false;\n\tif (query.minConfidence !== undefined && fragment.confidence < query.minConfidence) return false;\n\tif (\n\t\tquery.tags &&\n\t\tquery.tags.length > 0 &&\n\t\t!query.tags.some((tag) => fragment.tags.includes(tag))\n\t) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\n/** Filter and rank fragments by confidence desc, then transaction time desc. */\nexport function filterMemoryFragments<T>(\n\tfragments: Iterable<MemoryFragment<T>>,\n\tquery: MemoryQuery = {},\n): readonly MemoryFragment<T>[] {\n\tconst results = [...fragments].filter((fragment) => memoryFragmentMatchesQuery(fragment, query));\n\tresults.sort((a, b) => b.confidence - a.confidence || compareBigIntDesc(a.tNs, b.tNs));\n\treturn query.limit === undefined ? results : results.slice(0, Math.max(0, query.limit));\n}\n\n/** Validate the passive MemoryFragment shape without throwing. */\nexport function validateMemoryFragment(value: unknown): MemoryFragmentValidation {\n\tconst errors: string[] = [];\n\tif (typeof value !== \"object\" || value === null) {\n\t\treturn { ok: false, errors: [\"fragment must be an object\"] };\n\t}\n\tconst fragment = value as Partial<MemoryFragment>;\n\tif (typeof fragment.id !== \"string\" || fragment.id.length === 0) {\n\t\terrors.push(\"id must be a non-empty string\");\n\t}\n\tif (!Object.hasOwn(fragment, \"payload\")) {\n\t\terrors.push(\"payload must be present\");\n\t}\n\tif (typeof fragment.tNs !== \"bigint\") {\n\t\terrors.push(\"tNs must be a bigint\");\n\t}\n\tconst confidence = fragment.confidence;\n\tif (\n\t\t!Number.isFinite(confidence) ||\n\t\tconfidence === undefined ||\n\t\tconfidence < 0 ||\n\t\tconfidence > 1\n\t) {\n\t\terrors.push(\"confidence must be a finite number in [0, 1]\");\n\t}\n\tif (!isDenseArrayOf(fragment.tags, (tag): tag is string => typeof tag === \"string\")) {\n\t\terrors.push(\"tags must be a readonly string array\");\n\t}\n\tif (!isDenseArrayOf(fragment.sources, (source): source is string => typeof source === \"string\")) {\n\t\terrors.push(\"sources must be a readonly string array\");\n\t}\n\tif (fragment.validFrom !== undefined && typeof fragment.validFrom !== \"bigint\") {\n\t\terrors.push(\"validFrom must be a bigint when present\");\n\t}\n\tif (fragment.validTo !== undefined && typeof fragment.validTo !== \"bigint\") {\n\t\terrors.push(\"validTo must be a bigint when present\");\n\t}\n\tif (\n\t\ttypeof fragment.validFrom === \"bigint\" &&\n\t\ttypeof fragment.validTo === \"bigint\" &&\n\t\tfragment.validFrom >= fragment.validTo\n\t) {\n\t\terrors.push(\"validFrom must be earlier than validTo\");\n\t}\n\tif (\n\t\tfragment.embedding !== undefined &&\n\t\t!isDenseArrayOf(fragment.embedding, (component): component is number =>\n\t\t\tNumber.isFinite(component),\n\t\t)\n\t) {\n\t\terrors.push(\"embedding must be a finite number array when present\");\n\t}\n\tif (fragment.parentFragmentId !== undefined && typeof fragment.parentFragmentId !== \"string\") {\n\t\terrors.push(\"parentFragmentId must be a string when present\");\n\t}\n\tif (fragment.provenance !== undefined && typeof fragment.provenance !== \"string\") {\n\t\terrors.push(\"provenance must be a string when present\");\n\t}\n\treturn { ok: errors.length === 0, errors };\n}\n\nexport function isMemoryFragment(value: unknown): value is MemoryFragment {\n\treturn validateMemoryFragment(value).ok;\n}\n\n/**\n * Generic N-dimension admission filter. Missing or non-finite thresholded scores reject.\n */\nexport function admissionScored<Dims extends string, TRaw = unknown>(\n\topts: AdmissionScoredOptions<Dims, TRaw>,\n): (raw: TRaw) => boolean {\n\tconst thresholds = opts.thresholds ?? ({} as AdmissionThresholds<Dims>);\n\treturn (raw: TRaw): boolean => {\n\t\tconst scores = opts.scoreFn(raw);\n\t\tfor (const dim of Object.keys(thresholds) as Dims[]) {\n\t\t\tconst min = thresholds[dim];\n\t\t\tif (min === undefined) continue;\n\t\t\tconst score = scores[dim];\n\t\t\tconst safe = Number.isFinite(score) ? (score as number) : Number.NEGATIVE_INFINITY;\n\t\t\tif (safe < min) return false;\n\t\t}\n\t\treturn true;\n\t};\n}\n\n/** Three-axis admission sugar for persistence / structure / personal-value scoring. */\nexport function admissionFilter3D(opts: AdmissionScore3DOptions): (raw: unknown) => boolean {\n\treturn (raw: unknown): boolean => {\n\t\tconst scores = opts.scoreFn(raw);\n\t\tif (!scoreAtLeast(scores.persistence, opts.persistenceThreshold ?? 0.3)) return false;\n\t\tif (!scoreAtLeast(scores.personalValue, opts.personalValueThreshold ?? 0.3)) return false;\n\t\tif (!opts.requireStructured) return true;\n\t\treturn scoreAtLeast(scores.structure, Number.MIN_VALUE);\n\t};\n}\n\n/** Build a passive `{ shardBy, shardCount }` pair for tenant-isolated sharding. */\nexport function shardByTenant<T>(\n\ttenantOf: (fragment: MemoryFragment<T>) => string,\n\topts: ShardByTenantOptions = {},\n): ShardByTenantConfig<T> {\n\tif (opts.tenants && opts.tenants.length > 0) {\n\t\tconst tenants = [...new Set(opts.tenants)];\n\t\tconst index = new Map(tenants.map((tenant, i) => [tenant, i] as const));\n\t\tconst overflow = tenants.length;\n\t\treturn {\n\t\t\tshardBy: (fragment) => index.get(tenantOf(fragment)) ?? overflow,\n\t\t\tshardCount: tenants.length + 1,\n\t\t};\n\t}\n\tconst configuredShardCount = opts.shardCount ?? 4;\n\tconst shardCount = Number.isSafeInteger(configuredShardCount)\n\t\t? Math.max(1, configuredShardCount)\n\t\t: 4;\n\treturn { shardBy: (fragment) => tenantOf(fragment), shardCount };\n}\n\nfunction compareBigIntDesc(a: bigint, b: bigint): number {\n\tif (a === b) return 0;\n\treturn a > b ? -1 : 1;\n}\n\nfunction isDenseArrayOf<T>(value: unknown, predicate: (item: unknown) => item is T): value is T[] {\n\tif (!Array.isArray(value)) return false;\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i) || !predicate(value[i])) return false;\n\t}\n\treturn true;\n}\n\nfunction scoreAtLeast(score: number, min: number): boolean {\n\treturn Number.isFinite(score) && score >= min;\n}\n","import { strictJsonCodec } from \"../json/codec.js\";\nimport type { MemoryFragment } from \"../patterns/semantic-memory.js\";\nimport { validateMemoryFragment } from \"../patterns/semantic-memory.js\";\nimport type {\n\tAgenticMemoryArtifactKind,\n\tAgenticMemoryError,\n\tAgenticMemoryKind,\n\tAgenticMemoryPersistenceLevel,\n\tAgenticMemoryRecord,\n\tAgenticMemoryRecordMetadata,\n\tAgenticMemoryScope,\n\tAgenticMemoryStatusState,\n\tStrictJsonValue,\n} from \"./agentic-memory-types.js\";\n\nexport function validateAndProjectRecords<T>(value: unknown): {\n\treadonly records: AgenticMemoryRecord<T>[];\n\treadonly fragments: MemoryFragment<T>[];\n\treadonly metadataByFragmentId: Record<FactId, AgenticMemoryRecordMetadata>;\n\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n\treadonly invalidRecordIndexes: Set<number>;\n} {\n\tconst records: AgenticMemoryRecord<T>[] = [];\n\tconst fragments: MemoryFragment<T>[] = [];\n\tconst metadataByFragmentId = Object.create(null) as Record<FactId, AgenticMemoryRecordMetadata>;\n\tconst errors: Omit<AgenticMemoryError, \"cursor\">[] = [];\n\tconst invalidRecordIndexes = new Set<number>();\n\tconst seenRecordIds = new Set<FactId>();\n\tconst seenFragmentIds = new Set<FactId>();\n\tif (!Array.isArray(value)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-records-input\",\n\t\t\tmessage: \"agenticMemoryBundle: records input must be an array\",\n\t\t\trecord: value,\n\t\t});\n\t\treturn { records, fragments, metadataByFragmentId, errors, invalidRecordIndexes };\n\t}\n\tconst length = safeArrayLength(value);\n\tif (length === undefined) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-records-input\",\n\t\t\tmessage: \"agenticMemoryBundle: records input length could not be read\",\n\t\t\trecord: value,\n\t\t});\n\t\treturn { records, fragments, metadataByFragmentId, errors, invalidRecordIndexes };\n\t}\n\tfor (let i = 0; i < length; i += 1) {\n\t\tlet raw: unknown;\n\t\ttry {\n\t\t\traw = value[i];\n\t\t} catch (error) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push({\n\t\t\t\tcode: \"invalid-record\",\n\t\t\t\tmessage: `agenticMemoryBundle: record access failed: ${errorMessage(error)}`,\n\t\t\t\tindex: i,\n\t\t\t\tvalidationErrors: Object.freeze([\"record access failed\"]),\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tconst result = validateAndSnapshotRecord<T>(raw, i);\n\t\tif (result.errors.length > 0) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push(...result.errors);\n\t\t\tcontinue;\n\t\t}\n\t\tif (result.record === undefined) continue;\n\t\tif (seenRecordIds.has(result.record.id)) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push({\n\t\t\t\tcode: \"duplicate-record-id\",\n\t\t\t\tmessage: \"agenticMemoryBundle: duplicate record id\",\n\t\t\t\tindex: i,\n\t\t\t\trecordId: result.record.id,\n\t\t\t\trecord: raw,\n\t\t\t\tvalidationErrors: [`duplicate record id '${result.record.id}'`],\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tif (seenFragmentIds.has(result.record.fragment.id)) {\n\t\t\tinvalidRecordIndexes.add(i);\n\t\t\terrors.push({\n\t\t\t\tcode: \"duplicate-fragment-id\",\n\t\t\t\tmessage: \"agenticMemoryBundle: duplicate fragment id\",\n\t\t\t\tindex: i,\n\t\t\t\trecordId: result.record.id,\n\t\t\t\tfragmentId: result.record.fragment.id,\n\t\t\t\trecord: raw,\n\t\t\t\tvalidationErrors: [`duplicate fragment id '${result.record.fragment.id}'`],\n\t\t\t});\n\t\t\tcontinue;\n\t\t}\n\t\tseenRecordIds.add(result.record.id);\n\t\tseenFragmentIds.add(result.record.fragment.id);\n\t\trecords.push(result.record);\n\t\tfragments.push(result.record.fragment);\n\t\tmetadataByFragmentId[result.record.fragment.id] = recordMetadata(result.record);\n\t}\n\treturn { records, fragments, metadataByFragmentId, errors, invalidRecordIndexes };\n}\n\nexport function validateAndSnapshotRecord<T>(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly record?: AgenticMemoryRecord<T>;\n\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n} {\n\ttry {\n\t\treturn validateAndSnapshotRecordInner<T>(value, index);\n\t} catch (error) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-record\",\n\t\t\t\t\tmessage: `agenticMemoryBundle: record access failed: ${errorMessage(error)}`,\n\t\t\t\t\tindex,\n\t\t\t\t\trecord: value,\n\t\t\t\t\tvalidationErrors: Object.freeze([\"record access failed\"]),\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n}\n\nexport function validateAndSnapshotRecordInner<T>(\n\tvalue: unknown,\n\tindex: number,\n): {\n\treadonly record?: AgenticMemoryRecord<T>;\n\treadonly errors: Omit<AgenticMemoryError, \"cursor\">[];\n} {\n\tconst errors: Omit<AgenticMemoryError, \"cursor\">[] = [];\n\tif (typeof value !== \"object\" || value === null || Array.isArray(value)) {\n\t\treturn {\n\t\t\terrors: [\n\t\t\t\t{\n\t\t\t\t\tcode: \"invalid-record\",\n\t\t\t\t\tmessage: \"agenticMemoryBundle: record must be an object\",\n\t\t\t\t\tindex,\n\t\t\t\t\trecord: value,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t}\n\tconst record = value as Partial<AgenticMemoryRecord<T>> & Record<string, unknown>;\n\tconst recordId = typeof record.id === \"string\" ? record.id : undefined;\n\tif (recordId === undefined || recordId.length === 0) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-record\",\n\t\t\tmessage: \"agenticMemoryBundle: record.id must be a non-empty string\",\n\t\t\tindex,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\"record.id must be a non-empty string\"],\n\t\t});\n\t}\n\tif (!isAgenticMemoryKind(record.kind)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-record-kind\",\n\t\t\tmessage: \"agenticMemoryBundle: record.kind is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\"kind must be one of working, episodic, semantic, procedural, profile\"],\n\t\t});\n\t}\n\tif (!isAgenticMemoryPersistenceLevel(record.persistenceLevel)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-persistence-level\",\n\t\t\tmessage: \"agenticMemoryBundle: record.persistenceLevel is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\n\t\t\t\t\"persistenceLevel must be one of turn, session, project, longTerm, permanent, archived\",\n\t\t\t],\n\t\t});\n\t}\n\tif (!isAgenticMemoryArtifactKind(record.artifactKind)) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-artifact-kind\",\n\t\t\tmessage: \"agenticMemoryBundle: record.artifactKind is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: [\"artifactKind must be one of raw, insight, profile, procedure\"],\n\t\t});\n\t}\n\tconst scopeValidation = validateScope(record.scope);\n\tif (!scopeValidation.ok) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-scope\",\n\t\t\tmessage: \"agenticMemoryBundle: record.scope is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: Object.freeze(scopeValidation.errors),\n\t\t});\n\t}\n\tconst fragmentValidation = validateMemoryFragment(record.fragment);\n\tif (!fragmentValidation.ok) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-fragment\",\n\t\t\tmessage: \"agenticMemoryBundle: record.fragment is invalid\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\tfragmentId:\n\t\t\t\ttypeof record.fragment === \"object\" &&\n\t\t\t\trecord.fragment !== null &&\n\t\t\t\ttypeof (record.fragment as Partial<MemoryFragment>).id === \"string\"\n\t\t\t\t\t? (record.fragment as Partial<MemoryFragment>).id\n\t\t\t\t\t: undefined,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: Object.freeze([...fragmentValidation.errors]),\n\t\t});\n\t}\n\tconst forbiddenFields = [\n\t\t\"storageTier\",\n\t\t\"storageKey\",\n\t\t\"adapter\",\n\t\t\"collection\",\n\t\t\"collections\",\n\t\t\"ttl\",\n\t\t\"ttlMs\",\n\t\t\"ttlNs\",\n\t\t\"expiresAt\",\n\t\t\"timer\",\n\t\t\"scheduler\",\n\t\t\"schedule\",\n\t\t\"retentionTimer\",\n\t\t\"consolidationSchedule\",\n\t\t\"reflectionSchedule\",\n\t\t\"llm\",\n\t\t\"llmHandle\",\n\t\t\"tool\",\n\t\t\"toolHandle\",\n\t\t\"runner\",\n\t\t\"runnerHandle\",\n\t\t\"restore\",\n\t\t\"hydrate\",\n\t\t\"hydration\",\n\t\t\"graphMutation\",\n\t\t\"protocol\",\n\t] as const;\n\tconst presentForbidden = forbiddenFields.filter((field) => Object.hasOwn(record, field));\n\tif (presentForbidden.length > 0) {\n\t\terrors.push({\n\t\t\tcode: \"invalid-record\",\n\t\t\tmessage: \"agenticMemoryBundle: record contains forbidden runtime/persistence fields\",\n\t\t\tindex,\n\t\t\trecordId,\n\t\t\trecord: value,\n\t\t\tvalidationErrors: Object.freeze(\n\t\t\t\tpresentForbidden.map((field) => `${field} is not part of AgenticMemoryRecord`),\n\t\t\t),\n\t\t});\n\t}\n\tif (errors.length > 0) return { errors };\n\tconst scope = scopeValidation.scope;\n\tconst fragment = snapshotFragment(record.fragment as MemoryFragment<T>);\n\treturn {\n\t\trecord: Object.freeze({\n\t\t\tid: recordId as FactId,\n\t\t\tkind: record.kind as AgenticMemoryKind,\n\t\t\tpersistenceLevel: record.persistenceLevel as AgenticMemoryPersistenceLevel,\n\t\t\tartifactKind: record.artifactKind as AgenticMemoryArtifactKind,\n\t\t\t...(scope === undefined ? {} : { scope }),\n\t\t\tfragment,\n\t\t}),\n\t\terrors,\n\t};\n}\n\nexport function snapshotFragment<T>(fragment: MemoryFragment<T>): MemoryFragment<T> {\n\treturn Object.freeze({\n\t\tid: fragment.id,\n\t\tpayload: fragment.payload,\n\t\ttNs: fragment.tNs,\n\t\t...(fragment.validFrom === undefined ? {} : { validFrom: fragment.validFrom }),\n\t\t...(fragment.validTo === undefined ? {} : { validTo: fragment.validTo }),\n\t\tconfidence: fragment.confidence,\n\t\ttags: Object.freeze([...fragment.tags]),\n\t\tsources: Object.freeze([...fragment.sources]),\n\t\t...(fragment.embedding === undefined\n\t\t\t? {}\n\t\t\t: { embedding: Object.freeze([...fragment.embedding]) }),\n\t\t...(fragment.parentFragmentId === undefined\n\t\t\t? {}\n\t\t\t: { parentFragmentId: fragment.parentFragmentId }),\n\t\t...(fragment.provenance === undefined ? {} : { provenance: fragment.provenance }),\n\t});\n}\n\nexport function recordMetadata(record: AgenticMemoryRecord): AgenticMemoryRecordMetadata {\n\treturn Object.freeze({\n\t\trecordId: record.id,\n\t\tkind: record.kind,\n\t\tpersistenceLevel: record.persistenceLevel,\n\t\tartifactKind: record.artifactKind,\n\t\t...(record.scope === undefined ? {} : { scope: record.scope }),\n\t});\n}\n\nexport function validateRecordMetadata(value: unknown): {\n\treadonly ok: boolean;\n\treadonly metadata?: AgenticMemoryRecordMetadata;\n\treadonly errors: readonly string[];\n} {\n\tif (value === undefined) return { ok: true, errors: [] };\n\tif (!isPlainRecord(value)) {\n\t\treturn { ok: false, errors: [\"record metadata must be an object when present\"] };\n\t}\n\tconst errors: string[] = [];\n\tfor (const key of Object.keys(value)) {\n\t\tif (\n\t\t\tkey !== \"recordId\" &&\n\t\t\tkey !== \"kind\" &&\n\t\t\tkey !== \"persistenceLevel\" &&\n\t\t\tkey !== \"artifactKind\" &&\n\t\t\tkey !== \"scope\"\n\t\t) {\n\t\t\terrors.push(`record.${key} is not part of AgenticMemoryRecordMetadata`);\n\t\t}\n\t}\n\tif (!isNonEmptyString(value.recordId)) {\n\t\terrors.push(\"record.recordId must be a non-empty string\");\n\t}\n\tif (!isAgenticMemoryKind(value.kind)) {\n\t\terrors.push(\"record.kind is invalid\");\n\t}\n\tif (!isAgenticMemoryPersistenceLevel(value.persistenceLevel)) {\n\t\terrors.push(\"record.persistenceLevel is invalid\");\n\t}\n\tif (!isAgenticMemoryArtifactKind(value.artifactKind)) {\n\t\terrors.push(\"record.artifactKind is invalid\");\n\t}\n\tconst scopeValidation = validateScope(value.scope);\n\tif (!scopeValidation.ok) {\n\t\terrors.push(...scopeValidation.errors.map((error) => `record.${error}`));\n\t}\n\tif (errors.length > 0) return { ok: false, errors };\n\treturn {\n\t\tok: true,\n\t\terrors,\n\t\tmetadata: Object.freeze({\n\t\t\trecordId: value.recordId as FactId,\n\t\t\tkind: value.kind as AgenticMemoryKind,\n\t\t\tpersistenceLevel: value.persistenceLevel as AgenticMemoryPersistenceLevel,\n\t\t\tartifactKind: value.artifactKind as AgenticMemoryArtifactKind,\n\t\t\t...(scopeValidation.scope === undefined ? {} : { scope: scopeValidation.scope }),\n\t\t}),\n\t};\n}\n\nexport function contextState(\n\tprojection: AgenticMemoryStatusState,\n\tretrieval: MemoryRetrievalStatus[\"state\"],\n): AgenticMemoryContextState {\n\tif (projection === \"error\" || retrieval === \"error\") return \"error\";\n\tif (projection === \"partial\" || retrieval === \"partial\") return \"partial\";\n\treturn retrieval;\n}\n\nexport function agenticStatusState(\n\terrorCount: number,\n\tvalidRecords: number,\n): AgenticMemoryStatusState {\n\tif (errorCount > 0 && validRecords === 0) return \"error\";\n\tif (errorCount > 0) return \"partial\";\n\treturn validRecords > 0 ? \"ready\" : \"empty\";\n}\n\nexport function isAgenticMemoryKind(value: unknown): value is AgenticMemoryKind {\n\treturn (\n\t\tvalue === \"working\" ||\n\t\tvalue === \"episodic\" ||\n\t\tvalue === \"semantic\" ||\n\t\tvalue === \"procedural\" ||\n\t\tvalue === \"profile\"\n\t);\n}\n\nexport function isAgenticMemoryPersistenceLevel(\n\tvalue: unknown,\n): value is AgenticMemoryPersistenceLevel {\n\treturn (\n\t\tvalue === \"turn\" ||\n\t\tvalue === \"session\" ||\n\t\tvalue === \"project\" ||\n\t\tvalue === \"longTerm\" ||\n\t\tvalue === \"permanent\" ||\n\t\tvalue === \"archived\"\n\t);\n}\n\nexport function isAgenticMemoryArtifactKind(value: unknown): value is AgenticMemoryArtifactKind {\n\treturn value === \"raw\" || value === \"insight\" || value === \"profile\" || value === \"procedure\";\n}\n\nexport function validateScope(value: unknown): {\n\treadonly ok: boolean;\n\treadonly scope?: AgenticMemoryScope;\n\treadonly errors: readonly string[];\n} {\n\tif (value === undefined) return { ok: true, errors: [] };\n\tif (typeof value !== \"object\" || value === null || Array.isArray(value)) {\n\t\treturn { ok: false, errors: [\"scope must be an object when present\"] };\n\t}\n\tconst scope = value as Record<string, unknown>;\n\tconst errors: string[] = [];\n\tconst allowed = new Set([\"sessionId\", \"projectId\", \"userId\", \"tenantId\"]);\n\tfor (const key of Object.keys(scope)) {\n\t\tif (!allowed.has(key)) errors.push(`scope.${key} is not part of AgenticMemoryScope`);\n\t}\n\tfor (const key of allowed) {\n\t\tif (scope[key] !== undefined && (typeof scope[key] !== \"string\" || scope[key].length === 0)) {\n\t\t\terrors.push(`scope.${key} must be a non-empty string when present`);\n\t\t}\n\t}\n\tif (errors.length > 0) return { ok: false, errors };\n\treturn {\n\t\tok: true,\n\t\terrors,\n\t\tscope: Object.freeze({\n\t\t\t...(scope.sessionId === undefined ? {} : { sessionId: scope.sessionId as string }),\n\t\t\t...(scope.projectId === undefined ? {} : { projectId: scope.projectId as string }),\n\t\t\t...(scope.userId === undefined ? {} : { userId: scope.userId as string }),\n\t\t\t...(scope.tenantId === undefined ? {} : { tenantId: scope.tenantId as string }),\n\t\t}),\n\t};\n}\n\nexport function isPlainRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nexport function ownKeys(value: Record<string, unknown>): readonly string[] {\n\treturn Object.keys(value).sort();\n}\n\nexport function assertExactKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = ownKeys(value);\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected fields ${actual.join(\",\")}`);\n\t}\n}\n\nexport function assertAgenticMemoryRecordCodecShape(value: unknown): void {\n\tif (!isPlainRecord(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: record must be an object\");\n\t}\n\tassertNoSymbolKeys(value, \"agenticMemoryRecordFrame.record\");\n\tassertExactKeys(\n\t\tvalue,\n\t\tvalue.scope === undefined\n\t\t\t? [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\"]\n\t\t\t: [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\", \"scope\"],\n\t\t\"agenticMemoryRecordFrame.record\",\n\t);\n\tconst fragment = value.fragment;\n\tif (!isPlainRecord(fragment)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: fragment must be an object\");\n\t}\n\tassertNoSymbolKeys(fragment, \"agenticMemoryRecordFrame.record.fragment\");\n\tassertExactKeys(\n\t\tfragment,\n\t\t[\n\t\t\t\"id\",\n\t\t\t\"payload\",\n\t\t\t\"tNs\",\n\t\t\t...(fragment.validFrom === undefined ? [] : [\"validFrom\"]),\n\t\t\t...(fragment.validTo === undefined ? [] : [\"validTo\"]),\n\t\t\t\"confidence\",\n\t\t\t\"tags\",\n\t\t\t\"sources\",\n\t\t\t...(fragment.embedding === undefined ? [] : [\"embedding\"]),\n\t\t\t...(fragment.parentFragmentId === undefined ? [] : [\"parentFragmentId\"]),\n\t\t\t...(fragment.provenance === undefined ? [] : [\"provenance\"]),\n\t\t],\n\t\t\"agenticMemoryRecordFrame.record.fragment\",\n\t);\n\tassertStrictJsonValue(fragment.tags, \"record.fragment.tags\");\n\tassertStrictJsonValue(fragment.sources, \"record.fragment.sources\");\n\tif (fragment.embedding !== undefined) {\n\t\tassertStrictJsonValue(fragment.embedding, \"record.fragment.embedding\");\n\t}\n\tif (value.scope !== undefined) assertScopeFrame(value.scope);\n}\n\nexport function assertNoSymbolKeys(value: object, label: string): void {\n\tif (Object.getOwnPropertySymbols(value).length > 0) {\n\t\tthrow new TypeError(`${label}: unexpected symbol fields`);\n\t}\n}\n\nexport function decimalBigIntString(value: bigint, label: string): string {\n\tconst out = value.toString(10);\n\tif (!/^-?(0|[1-9]\\d*)$/.test(out)) {\n\t\tthrow new TypeError(`${label} must encode as a canonical decimal bigint string`);\n\t}\n\treturn out;\n}\n\nexport function parseDecimalBigInt(value: unknown, label: string): bigint {\n\tif (typeof value !== \"string\" || !/^(0|-?[1-9]\\d*)$/.test(value)) {\n\t\tthrow new TypeError(`${label} must be a canonical decimal bigint string`);\n\t}\n\treturn BigInt(value);\n}\n\nexport function assertStrictJsonValue(value: unknown, label: string): StrictJsonValue {\n\ttry {\n\t\tstrictJsonCodec.encode(value);\n\t\treturn value as StrictJsonValue;\n\t} catch (error) {\n\t\tthrow new TypeError(`${label} must be strict JSON: ${errorMessage(error)}`);\n\t}\n}\n\nexport function assertScopeFrame(value: unknown): AgenticMemoryScope {\n\tif (!isPlainRecord(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: scope must be an object when present\");\n\t}\n\tassertStrictJsonValue(value, \"record.scope\");\n\tconst validation = validateScope(value);\n\tif (!validation.ok || validation.scope === undefined) {\n\t\tthrow new TypeError(`agenticMemoryRecordFrame: invalid scope: ${validation.errors.join(\"; \")}`);\n\t}\n\tassertExactKeys(\n\t\tvalue as Record<string, unknown>,\n\t\t[\n\t\t\t...((value as Record<string, unknown>).sessionId === undefined ? [] : [\"sessionId\"]),\n\t\t\t...((value as Record<string, unknown>).projectId === undefined ? [] : [\"projectId\"]),\n\t\t\t...((value as Record<string, unknown>).userId === undefined ? [] : [\"userId\"]),\n\t\t\t...((value as Record<string, unknown>).tenantId === undefined ? [] : [\"tenantId\"]),\n\t\t],\n\t\t\"agenticMemoryRecordFrame.record.scope\",\n\t);\n\treturn validation.scope;\n}\n\nexport function assertKindValue(value: unknown): AgenticMemoryKind {\n\tif (!isAgenticMemoryKind(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid memory kind\");\n\t}\n\treturn value;\n}\n\nexport function assertPersistenceLevelValue(value: unknown): AgenticMemoryPersistenceLevel {\n\tif (!isAgenticMemoryPersistenceLevel(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid persistence level\");\n\t}\n\treturn value;\n}\n\nexport function assertArtifactKindValue(value: unknown): AgenticMemoryArtifactKind {\n\tif (!isAgenticMemoryArtifactKind(value)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid artifact kind\");\n\t}\n\treturn value;\n}\n\nexport function assertNonEmptyString(value: unknown, label: string): string {\n\tif (!isNonEmptyString(value)) throw new TypeError(`${label} must be a non-empty string`);\n\treturn value;\n}\n\nexport function assertString(value: unknown, label: string): string {\n\tif (typeof value !== \"string\") throw new TypeError(`${label} must be a string`);\n\treturn value;\n}\n\nexport function assertConfidence(value: unknown, label: string): number {\n\tif (!Number.isFinite(value) || (value as number) < 0 || (value as number) > 1) {\n\t\tthrow new TypeError(`${label} must be a finite number in [0, 1]`);\n\t}\n\treturn value as number;\n}\n\nexport function assertStringArray(value: unknown, label: string): readonly string[] {\n\tif (!isDenseArrayOf(value, (item): item is string => typeof item === \"string\")) {\n\t\tthrow new TypeError(`${label} must be a readonly string array`);\n\t}\n\treturn Object.freeze([...value]);\n}\n\nexport function assertFiniteNumberArray(value: unknown, label: string): readonly number[] {\n\tif (!isDenseArrayOf(value, (item): item is number => Number.isFinite(item))) {\n\t\tthrow new TypeError(`${label} must be a finite number array`);\n\t}\n\treturn Object.freeze([...value]);\n}\n\nexport function isNonEmptyString(value: unknown): value is string {\n\treturn typeof value === \"string\" && value.length > 0;\n}\n\nexport function isDenseArrayOf<T>(\n\tvalue: unknown,\n\tpredicate: (item: unknown) => item is T,\n): value is T[] {\n\tif (!Array.isArray(value)) return false;\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i) || !predicate(value[i])) return false;\n\t}\n\treturn true;\n}\n\nexport function freezeError<T extends { readonly validationErrors?: readonly string[] }>(\n\terror: T,\n): T {\n\treturn Object.freeze({\n\t\t...error,\n\t\t...(error.validationErrors === undefined\n\t\t\t? {}\n\t\t\t: { validationErrors: Object.freeze([...error.validationErrors]) }),\n\t}) as T;\n}\n\nexport function safeArrayLength(value: readonly unknown[]): number | undefined {\n\ttry {\n\t\treturn value.length;\n\t} catch {\n\t\treturn undefined;\n\t}\n}\n\nexport function errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","import { type Codec, strictJsonCodec } from \"../json/codec.js\";\nimport type { MemoryFragment } from \"../patterns/semantic-memory.js\";\nimport {\n\tassertAgenticMemoryRecordCodecShape,\n\tassertArtifactKindValue,\n\tassertConfidence,\n\tassertExactKeys,\n\tassertFiniteNumberArray,\n\tassertKindValue,\n\tassertNonEmptyString,\n\tassertPersistenceLevelValue,\n\tassertScopeFrame,\n\tassertStrictJsonValue,\n\tassertString,\n\tassertStringArray,\n\tdecimalBigIntString,\n\tisPlainRecord,\n\tparseDecimalBigInt,\n\tvalidateAndSnapshotRecord,\n} from \"./agentic-memory-shared.js\";\nimport type {\n\tAgenticMemoryFragmentFrame,\n\tAgenticMemoryRecord,\n\tAgenticMemoryRecordFrame,\n\tStrictJsonValue,\n} from \"./agentic-memory-types.js\";\n\nexport const AGENTIC_MEMORY_RECORD_FRAME_FORMAT = \"graphrefly.agenticMemoryRecord\";\nexport const AGENTIC_MEMORY_RECORD_FRAME_VERSION = 1;\n\nexport function agenticMemoryRecordFrame<TJson extends StrictJsonValue>(\n\trecord: AgenticMemoryRecord<TJson>,\n): AgenticMemoryRecordFrame<TJson> {\n\tconst result = validateAndSnapshotRecord<TJson>(record, 0);\n\tif (result.errors.length > 0 || result.record === undefined) {\n\t\tthrow new TypeError(\n\t\t\t`agenticMemoryRecordFrame: invalid record: ${result.errors\n\t\t\t\t.flatMap((error) => error.validationErrors ?? [error.message])\n\t\t\t\t.join(\"; \")}`,\n\t\t);\n\t}\n\tassertAgenticMemoryRecordCodecShape(record);\n\tassertStrictJsonValue(result.record.fragment.payload, \"record.fragment.payload\");\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_FRAME_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_FRAME_VERSION,\n\t\trecord: Object.freeze({\n\t\t\tid: result.record.id,\n\t\t\tkind: result.record.kind,\n\t\t\tpersistenceLevel: result.record.persistenceLevel,\n\t\t\tartifactKind: result.record.artifactKind,\n\t\t\t...(result.record.scope === undefined ? {} : { scope: result.record.scope }),\n\t\t\tfragment: fragmentFrame(result.record.fragment as MemoryFragment<TJson>),\n\t\t}),\n\t});\n}\n\n/** Assert and snapshot a decoded D166 record frame. Unknown fields fail honestly. */\nexport function assertAgenticMemoryRecordFrame<TJson extends StrictJsonValue = StrictJsonValue>(\n\tvalue: unknown,\n): AgenticMemoryRecordFrame<TJson> {\n\tif (!isPlainRecord(value))\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: frame must be an object\");\n\tassertStrictJsonValue(value, \"agenticMemoryRecordFrame\");\n\tassertExactKeys(value, [\"format\", \"record\", \"version\"], \"agenticMemoryRecordFrame\");\n\tif (value.format !== AGENTIC_MEMORY_RECORD_FRAME_FORMAT) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: invalid version\");\n\t}\n\tconst rawRecord = value.record;\n\tif (!isPlainRecord(rawRecord)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: record must be an object\");\n\t}\n\tassertExactKeys(\n\t\trawRecord,\n\t\trawRecord.scope === undefined\n\t\t\t? [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\"]\n\t\t\t: [\"artifactKind\", \"fragment\", \"id\", \"kind\", \"persistenceLevel\", \"scope\"],\n\t\t\"agenticMemoryRecordFrame.record\",\n\t);\n\tconst rawFragment = rawRecord.fragment;\n\tif (!isPlainRecord(rawFragment)) {\n\t\tthrow new TypeError(\"agenticMemoryRecordFrame: fragment must be an object\");\n\t}\n\tassertExactKeys(\n\t\trawFragment,\n\t\t[\n\t\t\t\"id\",\n\t\t\t\"payload\",\n\t\t\t\"tNs\",\n\t\t\t...(rawFragment.validFrom === undefined ? [] : [\"validFrom\"]),\n\t\t\t...(rawFragment.validTo === undefined ? [] : [\"validTo\"]),\n\t\t\t\"confidence\",\n\t\t\t\"tags\",\n\t\t\t\"sources\",\n\t\t\t...(rawFragment.embedding === undefined ? [] : [\"embedding\"]),\n\t\t\t...(rawFragment.parentFragmentId === undefined ? [] : [\"parentFragmentId\"]),\n\t\t\t...(rawFragment.provenance === undefined ? [] : [\"provenance\"]),\n\t\t],\n\t\t\"agenticMemoryRecordFrame.record.fragment\",\n\t);\n\tif (rawRecord.scope !== undefined) assertScopeFrame(rawRecord.scope);\n\tconst frame = value as unknown as AgenticMemoryRecordFrame<TJson>;\n\tconst decoded = recordFromFrame(frame);\n\tconst roundtrip = agenticMemoryRecordFrame(decoded);\n\treturn roundtrip as AgenticMemoryRecordFrame<TJson>;\n}\n\n/** Strict canonical JSON codec for D166 AgenticMemoryRecordFrame values. */\nexport function agenticMemoryRecordFrameCodec<\n\tTJson extends StrictJsonValue = StrictJsonValue,\n>(): Codec<AgenticMemoryRecordFrame<TJson>> {\n\treturn {\n\t\tencode(value: AgenticMemoryRecordFrame<TJson>): Uint8Array {\n\t\t\treturn strictJsonCodec.encode(assertAgenticMemoryRecordFrame<TJson>(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): AgenticMemoryRecordFrame<TJson> {\n\t\t\treturn assertAgenticMemoryRecordFrame<TJson>(strictJsonCodec.decode(bytes));\n\t\t},\n\t};\n}\n\n/** Strict canonical JSON codec that persists records and decodes bigint fields back to bigint. */\nexport function agenticMemoryRecordCodec<TJson extends StrictJsonValue = StrictJsonValue>(): Codec<\n\tAgenticMemoryRecord<TJson>\n> {\n\tconst frameCodec = agenticMemoryRecordFrameCodec<TJson>();\n\treturn {\n\t\tencode(value: AgenticMemoryRecord<TJson>): Uint8Array {\n\t\t\treturn frameCodec.encode(agenticMemoryRecordFrame(value));\n\t\t},\n\t\tdecode(bytes: Uint8Array): AgenticMemoryRecord<TJson> {\n\t\t\treturn recordFromFrame(frameCodec.decode(bytes));\n\t\t},\n\t};\n}\n\n/**\n * D167 solution-level retention command projection.\n *\n * Archive/restore/setPersistenceLevel are derived views over current records;\n * requestConsolidation emits request facts only.\n */\n\nfunction fragmentFrame<TJson extends StrictJsonValue>(\n\tfragment: MemoryFragment<TJson>,\n): AgenticMemoryFragmentFrame<TJson> {\n\treturn Object.freeze({\n\t\tid: fragment.id,\n\t\tpayload: fragment.payload,\n\t\ttNs: decimalBigIntString(fragment.tNs, \"fragment.tNs\"),\n\t\t...(fragment.validFrom === undefined\n\t\t\t? {}\n\t\t\t: { validFrom: decimalBigIntString(fragment.validFrom, \"fragment.validFrom\") }),\n\t\t...(fragment.validTo === undefined\n\t\t\t? {}\n\t\t\t: { validTo: decimalBigIntString(fragment.validTo, \"fragment.validTo\") }),\n\t\tconfidence: fragment.confidence,\n\t\ttags: Object.freeze([...fragment.tags]),\n\t\tsources: Object.freeze([...fragment.sources]),\n\t\t...(fragment.embedding === undefined\n\t\t\t? {}\n\t\t\t: { embedding: Object.freeze([...fragment.embedding]) }),\n\t\t...(fragment.parentFragmentId === undefined\n\t\t\t? {}\n\t\t\t: { parentFragmentId: fragment.parentFragmentId }),\n\t\t...(fragment.provenance === undefined ? {} : { provenance: fragment.provenance }),\n\t});\n}\n\nfunction recordFromFrame<TJson extends StrictJsonValue>(\n\tframe: AgenticMemoryRecordFrame<TJson>,\n): AgenticMemoryRecord<TJson> {\n\tconst fragment = frame.record.fragment;\n\tconst record: AgenticMemoryRecord<TJson> = {\n\t\tid: assertNonEmptyString(frame.record.id, \"record.id\"),\n\t\tkind: assertKindValue(frame.record.kind),\n\t\tpersistenceLevel: assertPersistenceLevelValue(frame.record.persistenceLevel),\n\t\tartifactKind: assertArtifactKindValue(frame.record.artifactKind),\n\t\t...(frame.record.scope === undefined ? {} : { scope: assertScopeFrame(frame.record.scope) }),\n\t\tfragment: {\n\t\t\tid: assertNonEmptyString(fragment.id, \"fragment.id\"),\n\t\t\tpayload: assertStrictJsonValue(fragment.payload, \"fragment.payload\") as TJson,\n\t\t\ttNs: parseDecimalBigInt(fragment.tNs, \"fragment.tNs\"),\n\t\t\t...(fragment.validFrom === undefined\n\t\t\t\t? {}\n\t\t\t\t: { validFrom: parseDecimalBigInt(fragment.validFrom, \"fragment.validFrom\") }),\n\t\t\t...(fragment.validTo === undefined\n\t\t\t\t? {}\n\t\t\t\t: { validTo: parseDecimalBigInt(fragment.validTo, \"fragment.validTo\") }),\n\t\t\tconfidence: assertConfidence(fragment.confidence, \"fragment.confidence\"),\n\t\t\ttags: assertStringArray(fragment.tags, \"fragment.tags\"),\n\t\t\tsources: assertStringArray(fragment.sources, \"fragment.sources\"),\n\t\t\t...(fragment.embedding === undefined\n\t\t\t\t? {}\n\t\t\t\t: { embedding: assertFiniteNumberArray(fragment.embedding, \"fragment.embedding\") }),\n\t\t\t...(fragment.parentFragmentId === undefined\n\t\t\t\t? {}\n\t\t\t\t: {\n\t\t\t\t\t\tparentFragmentId: assertNonEmptyString(fragment.parentFragmentId, \"parentFragmentId\"),\n\t\t\t\t\t}),\n\t\t\t...(fragment.provenance === undefined\n\t\t\t\t? {}\n\t\t\t\t: { provenance: assertString(fragment.provenance, \"provenance\") }),\n\t\t},\n\t};\n\tconst result = validateAndSnapshotRecord<TJson>(record, 0);\n\tif (result.errors.length > 0 || result.record === undefined) {\n\t\tthrow new TypeError(\n\t\t\t`agenticMemoryRecordFrame: decoded record is invalid: ${result.errors\n\t\t\t\t.flatMap((error) => error.validationErrors ?? [error.message])\n\t\t\t\t.join(\"; \")}`,\n\t\t);\n\t}\n\treturn result.record;\n}\n","import type { DeliveryMeta } from \"../ctx/types.js\";\nimport { assertGraphLocalNode, type Graph, type StateNode } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport {\n\ttype AgenticMemoryRecord,\n\ttype AgenticMemoryRecordFrame,\n\ttype AgenticMemoryStrictJsonValue,\n\tagenticMemoryRecordCodec,\n\tagenticMemoryRecordFrame,\n\tagenticMemoryRecordFrameCodec,\n\tassertAgenticMemoryRecordFrame,\n} from \"../solutions/index.js\";\nimport type { AppendLogEntry, AppendLogStorageTier, KvStorageTier } from \"../storage/index.js\";\n\nexport const AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT =\n\t\"graphrefly.agenticMemory.records.snapshot\" as const;\nexport const AGENTIC_MEMORY_RECORD_CHANGE_FORMAT =\n\t\"graphrefly.agenticMemory.records.change\" as const;\nexport const AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION = 1 as const;\n\nexport interface AgenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION;\n\treadonly changeCursor: number;\n\treadonly records: readonly AgenticMemoryRecordFrame<TJson>[];\n}\n\nexport interface AgenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly format: typeof AGENTIC_MEMORY_RECORD_CHANGE_FORMAT;\n\treadonly version: typeof AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION;\n\treadonly change: {\n\t\treadonly kind: \"replaceAll\";\n\t\treadonly records: readonly AgenticMemoryRecordFrame<TJson>[];\n\t};\n}\n\nexport interface AgenticMemoryRecordsRestoreState<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n> {\n\treadonly records: readonly AgenticMemoryRecord<TJson>[];\n\treadonly source: \"empty\" | \"changes\" | \"snapshot\" | \"snapshot+changes\";\n\treadonly snapshot: { readonly found: boolean; readonly changeCursor: number };\n\treadonly changes: { readonly applied: number; readonly cursor: number };\n}\n\nexport interface LoadAgenticMemoryRecordsStateOptions {\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n}\n\nexport interface AgenticMemoryRecordsPersistenceCursor {\n\treadonly kind: \"persistence.cursor\";\n\treadonly changeSeq: number;\n\treadonly snapshotWrites: number;\n\treadonly changeWrites: number;\n}\n\nexport interface AgenticMemoryRecordsPersistenceStatus {\n\treadonly state: \"starting\" | \"ready\" | \"flushing\" | \"errored\" | \"disposed\";\n\treadonly pending: number;\n\treadonly writes: number;\n\treadonly errors: number;\n\treadonly cursor: AgenticMemoryRecordsPersistenceCursor;\n}\n\nexport interface AgenticMemoryRecordsPersistenceError {\n\treadonly phase: \"snapshot\" | \"change\";\n\treadonly message: string;\n\treadonly cursor: AgenticMemoryRecordsPersistenceCursor;\n}\n\nexport interface PersistAgenticMemoryRecordsOptions {\n\treadonly name?: string;\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n\treadonly initialChangeCursor?: number;\n\treadonly snapshotOnAttach?: boolean;\n\treadonly snapshotEveryChanges?: number;\n}\n\nexport interface AgenticMemoryRecordsPersistenceHandle {\n\treadonly ready: StateNode<boolean>;\n\treadonly status: StateNode<AgenticMemoryRecordsPersistenceStatus>;\n\treadonly error: StateNode<AgenticMemoryRecordsPersistenceError | null>;\n\treadonly cursor: StateNode<AgenticMemoryRecordsPersistenceCursor>;\n\tflush(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n\tsnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n\tdispose(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void;\n}\n\nexport interface OpenPersistentAgenticMemoryRecordsOptions<\n\tTJson extends AgenticMemoryStrictJsonValue,\n> extends LoadAgenticMemoryRecordsStateOptions,\n\t\tOmit<\n\t\t\tPersistAgenticMemoryRecordsOptions,\n\t\t\t\"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly AgenticMemoryRecord<TJson>[];\n}\n\nexport interface PersistentAgenticMemoryRecords<TJson extends AgenticMemoryStrictJsonValue> {\n\treadonly records: StateNode<readonly AgenticMemoryRecord<TJson>[]>;\n\treadonly persistence: AgenticMemoryRecordsPersistenceHandle;\n\treadonly loaded: AgenticMemoryRecordsRestoreState<TJson>;\n}\n\ninterface QueueItem {\n\treadonly phase: \"snapshot\" | \"change\" | \"flush\" | \"dispose\";\n\treadonly done?: (status: AgenticMemoryRecordsPersistenceStatus) => void;\n\trun(): void | PromiseLike<void>;\n}\n\nexport function agenticMemoryRecordsSnapshotKey(storagePrefix = \"agentic-memory\"): string {\n\tif (storagePrefix.length === 0) throw new TypeError(\"storagePrefix must be non-empty\");\n\treturn `${storagePrefix}/records.snapshot`;\n}\n\nexport function agenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\trecords: readonly AgenticMemoryRecord<TJson>[],\n\topts: { readonly changeCursor?: number } = {},\n): AgenticMemoryRecordSnapshotFrame<TJson> {\n\tconst changeCursor = validateChangeCursor(opts.changeCursor ?? -1);\n\treturn assertAgenticMemoryRecordSnapshotFrame({\n\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchangeCursor,\n\t\trecords: records.map((record) => agenticMemoryRecordFrame(record)),\n\t});\n}\n\nexport function agenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(records: readonly AgenticMemoryRecord<TJson>[]): AgenticMemoryRecordChangeFrame<TJson> {\n\treturn assertAgenticMemoryRecordChangeFrame({\n\t\tformat: AGENTIC_MEMORY_RECORD_CHANGE_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchange: {\n\t\t\tkind: \"replaceAll\",\n\t\t\trecords: records.map((record) => agenticMemoryRecordFrame(record)),\n\t\t},\n\t});\n}\n\nexport function assertAgenticMemoryRecordSnapshotFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(value: unknown): AgenticMemoryRecordSnapshotFrame<TJson> {\n\tif (!isPlainRecord(value)) throw new TypeError(\"agentic memory snapshot frame must be an object\");\n\tassertKeys(\n\t\tvalue,\n\t\t[\"changeCursor\", \"format\", \"records\", \"version\"],\n\t\t\"agentic memory snapshot frame\",\n\t);\n\tif (value.format !== AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: invalid version\");\n\t}\n\tconst changeCursor = validateChangeCursor(value.changeCursor);\n\tif (!Array.isArray(value.records)) {\n\t\tthrow new TypeError(\"agentic memory snapshot frame: records must be an array\");\n\t}\n\tconst records = assertDenseRecordFrames<TJson>(\n\t\tvalue.records,\n\t\t\"agentic memory snapshot frame records\",\n\t);\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchangeCursor,\n\t\trecords: Object.freeze(records),\n\t});\n}\n\nexport function assertAgenticMemoryRecordChangeFrame<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(value: unknown): AgenticMemoryRecordChangeFrame<TJson> {\n\tif (!isPlainRecord(value)) throw new TypeError(\"agentic memory change frame must be an object\");\n\tassertKeys(value, [\"change\", \"format\", \"version\"], \"agentic memory change frame\");\n\tif (value.format !== AGENTIC_MEMORY_RECORD_CHANGE_FORMAT) {\n\t\tthrow new TypeError(\"agentic memory change frame: invalid format\");\n\t}\n\tif (value.version !== AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION) {\n\t\tthrow new TypeError(\"agentic memory change frame: invalid version\");\n\t}\n\tif (!isPlainRecord(value.change)) {\n\t\tthrow new TypeError(\"agentic memory change frame: change must be an object\");\n\t}\n\tassertKeys(value.change, [\"kind\", \"records\"], \"agentic memory change frame change\");\n\tif (value.change.kind !== \"replaceAll\") {\n\t\tthrow new TypeError(\"agentic memory change frame: change.kind must be replaceAll\");\n\t}\n\tif (!Array.isArray(value.change.records)) {\n\t\tthrow new TypeError(\"agentic memory change frame: change.records must be an array\");\n\t}\n\tconst records = assertDenseRecordFrames<TJson>(\n\t\tvalue.change.records,\n\t\t\"agentic memory change frame records\",\n\t);\n\treturn Object.freeze({\n\t\tformat: AGENTIC_MEMORY_RECORD_CHANGE_FORMAT,\n\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\tchange: Object.freeze({\n\t\t\tkind: \"replaceAll\",\n\t\t\trecords: Object.freeze(records),\n\t\t}),\n\t});\n}\n\nexport function loadAgenticMemoryRecordsState<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(opts: LoadAgenticMemoryRecordsStateOptions): Promise<AgenticMemoryRecordsRestoreState<TJson>> {\n\tconst storagePrefix = opts.storagePrefix ?? \"agentic-memory\";\n\tconst snapshotKey = opts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(storagePrefix);\n\treturn opts.snapshotStore.get(snapshotKey).then((rawSnapshot) => {\n\t\tlet records: readonly AgenticMemoryRecord<TJson>[] = [];\n\t\tlet source: AgenticMemoryRecordsRestoreState<TJson>[\"source\"] = \"empty\";\n\t\tlet changeCursor = -1;\n\t\tif (rawSnapshot !== undefined) {\n\t\t\tconst snapshot = assertAgenticMemoryRecordSnapshotFrame<TJson>(rawSnapshot);\n\t\t\trecords = snapshot.records.map(recordFromFrame);\n\t\t\tchangeCursor = snapshot.changeCursor;\n\t\t\tsource = \"snapshot\";\n\t\t}\n\t\tif (opts.changeLog === undefined) {\n\t\t\treturn {\n\t\t\t\trecords,\n\t\t\t\tsource,\n\t\t\t\tsnapshot: { found: rawSnapshot !== undefined, changeCursor },\n\t\t\t\tchanges: { applied: 0, cursor: changeCursor },\n\t\t\t};\n\t\t}\n\t\treturn opts.changeLog.read({ after: changeCursor }).then((entries) => {\n\t\t\tlet applied = 0;\n\t\t\tlet cursor = changeCursor;\n\t\t\tfor (const entry of entries) {\n\t\t\t\tif (entry.seq !== cursor + 1) {\n\t\t\t\t\tthrow new Error(\"agentic memory records change log is non-contiguous\");\n\t\t\t\t}\n\t\t\t\tconst change = assertAgenticMemoryRecordChangeFrame<TJson>(entry.value);\n\t\t\t\trecords = change.change.records.map(recordFromFrame);\n\t\t\t\tcursor = entry.seq;\n\t\t\t\tapplied += 1;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\trecords,\n\t\t\t\tsource:\n\t\t\t\t\trawSnapshot !== undefined && applied > 0\n\t\t\t\t\t\t? \"snapshot+changes\"\n\t\t\t\t\t\t: rawSnapshot !== undefined\n\t\t\t\t\t\t\t? \"snapshot\"\n\t\t\t\t\t\t\t: applied > 0\n\t\t\t\t\t\t\t\t? \"changes\"\n\t\t\t\t\t\t\t\t: \"empty\",\n\t\t\t\tsnapshot: { found: rawSnapshot !== undefined, changeCursor },\n\t\t\t\tchanges: { applied, cursor },\n\t\t\t};\n\t\t});\n\t});\n}\n\nexport function persistAgenticMemoryRecords<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\tgraph: Graph,\n\trecords: Node<readonly AgenticMemoryRecord<TJson>[]>,\n\topts: PersistAgenticMemoryRecordsOptions,\n): AgenticMemoryRecordsPersistenceHandle {\n\tconst name = opts.name ?? \"agenticMemoryRecords.persistence\";\n\tconst snapshotKey =\n\t\topts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(opts.storagePrefix ?? name);\n\tconst snapshotEveryChanges = validateSnapshotEveryChanges(opts.snapshotEveryChanges);\n\tassertGraphLocalNode(graph, records as Node<unknown>, `${name}.records`);\n\tlet cursorValue: AgenticMemoryRecordsPersistenceCursor = {\n\t\tkind: \"persistence.cursor\",\n\t\tchangeSeq: validateChangeCursor(opts.initialChangeCursor ?? -1),\n\t\tsnapshotWrites: 0,\n\t\tchangeWrites: 0,\n\t};\n\tlet statusValue = statusOf(\"starting\", 0, 0, 0, cursorValue);\n\tlet errorCount = 0;\n\tlet writes = 0;\n\tlet running = false;\n\tlet disposed = false;\n\tlet disposeRequested = false;\n\tlet subscribing = true;\n\tlet observedChangesSinceSnapshot = 0;\n\tlet latestRecords: readonly AgenticMemoryRecord<TJson>[] = records.cache ?? [];\n\tlet stop: (() => void) | undefined;\n\tconst queue: QueueItem[] = [];\n\tconst ready = graph.state(false, { name: `${name}/ready` });\n\tconst status = graph.state<AgenticMemoryRecordsPersistenceStatus>(statusValue, {\n\t\tname: `${name}/status`,\n\t});\n\tconst error = graph.state<AgenticMemoryRecordsPersistenceError | null>(null, {\n\t\tname: `${name}/error`,\n\t});\n\tconst cursor = graph.state<AgenticMemoryRecordsPersistenceCursor>(cursorValue, {\n\t\tname: `${name}/cursor`,\n\t});\n\n\tfunction publish(state: AgenticMemoryRecordsPersistenceStatus[\"state\"]): void {\n\t\tconst nextState = statusValue.state === \"errored\" && state !== \"disposed\" ? \"errored\" : state;\n\t\tstatusValue = statusOf(\n\t\t\tnextState,\n\t\t\tqueue.length + (running ? 1 : 0),\n\t\t\twrites,\n\t\t\terrorCount,\n\t\t\tcursorValue,\n\t\t);\n\t\tcursor.set(cursorValue);\n\t\tstatus.set(statusValue);\n\t\tif (nextState === \"ready\") ready.set(true);\n\t\tif (nextState === \"errored\" || nextState === \"disposed\") ready.set(false);\n\t}\n\n\tfunction report(phase: \"snapshot\" | \"change\", caught: unknown): void {\n\t\terrorCount += 1;\n\t\terror.set({ phase, message: errorMessage(caught), cursor: cursorValue });\n\t}\n\n\tfunction callDone(done: QueueItem[\"done\"]): void {\n\t\ttry {\n\t\t\tdone?.(statusValue);\n\t\t} catch {\n\t\t\t// Done callbacks are advisory controls and must not wedge the adapter queue.\n\t\t}\n\t}\n\n\tfunction finish(item: QueueItem): void {\n\t\tif (item.phase === \"dispose\") {\n\t\t\tdisposed = true;\n\t\t\trunning = false;\n\t\t\tpublish(\"disposed\");\n\t\t} else if (statusValue.state !== \"errored\") {\n\t\t\trunning = false;\n\t\t\tpublish(\"ready\");\n\t\t} else {\n\t\t\trunning = false;\n\t\t\tpublish(\"errored\");\n\t\t}\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction fail(item: QueueItem, caught: unknown): void {\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") report(item.phase, caught);\n\t\trunning = false;\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") publish(\"errored\");\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction chainThenable(item: QueueItem, value: unknown): boolean {\n\t\tif ((typeof value !== \"object\" && typeof value !== \"function\") || value === null) return false;\n\t\tconst then = (value as { then?: unknown }).then;\n\t\tif (typeof then !== \"function\") return false;\n\t\tlet settled = false;\n\t\tconst settle = (next: () => void) => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tnext();\n\t\t};\n\t\ttry {\n\t\t\t(then as (onFulfilled: () => void, onRejected: (error: unknown) => void) => unknown).call(\n\t\t\t\tvalue,\n\t\t\t\t() => settle(() => finish(item)),\n\t\t\t\t(caught) => settle(() => fail(item, caught)),\n\t\t\t);\n\t\t} catch (caught) {\n\t\t\tsettle(() => fail(item, caught));\n\t\t}\n\t\treturn true;\n\t}\n\n\tfunction enqueue(item: QueueItem): void {\n\t\tif (disposed || (disposeRequested && item.phase !== \"dispose\" && item.phase !== \"flush\")) {\n\t\t\tcallDone(item.done);\n\t\t\treturn;\n\t\t}\n\t\tqueue.push(item);\n\t\tdrain();\n\t}\n\n\tfunction drain(): void {\n\t\tif (running) return;\n\t\tconst item = queue.shift();\n\t\tif (item === undefined) return;\n\t\trunning = true;\n\t\tpublish(\n\t\t\titem.phase === \"flush\" ? \"flushing\" : statusValue.state === \"starting\" ? \"starting\" : \"ready\",\n\t\t);\n\t\tlet result: void | PromiseLike<void>;\n\t\ttry {\n\t\t\tresult = item.run();\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn;\n\t\t}\n\t\tif (chainThenable(item, result)) return;\n\t\tfinish(item);\n\t}\n\n\tfunction enqueueSnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\tconst snapshotRecords = latestRecords;\n\t\tobservedChangesSinceSnapshot = 0;\n\t\tenqueue({\n\t\t\tphase: \"snapshot\",\n\t\t\tdone,\n\t\t\trun() {\n\t\t\t\tconst records = Object.freeze(\n\t\t\t\t\tsnapshotRecords.map((record) => agenticMemoryRecordFrame(record)),\n\t\t\t\t);\n\t\t\t\tconst frame = assertAgenticMemoryRecordSnapshotFrame<TJson>({\n\t\t\t\t\tformat: AGENTIC_MEMORY_RECORD_SNAPSHOT_FORMAT,\n\t\t\t\t\tversion: AGENTIC_MEMORY_RECORD_STORAGE_FRAME_VERSION,\n\t\t\t\t\tchangeCursor: cursorValue.changeSeq,\n\t\t\t\t\trecords,\n\t\t\t\t});\n\t\t\t\treturn opts.snapshotStore.set(snapshotKey, frame).then(() => {\n\t\t\t\t\tcursorValue = { ...cursorValue, snapshotWrites: cursorValue.snapshotWrites + 1 };\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction enqueueChange(nextRecords: readonly AgenticMemoryRecord<TJson>[]): void {\n\t\tconst changeLog = opts.changeLog;\n\t\tif (changeLog === undefined) return;\n\t\tenqueue({\n\t\t\tphase: \"change\",\n\t\t\trun() {\n\t\t\t\tconst frame = agenticMemoryRecordChangeFrame(nextRecords);\n\t\t\t\treturn changeLog.append(frame).then((written) => {\n\t\t\t\t\tconst entry = written as AppendLogEntry<AgenticMemoryRecordChangeFrame<TJson>>;\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tchangeSeq: entry.seq,\n\t\t\t\t\t\tchangeWrites: cursorValue.changeWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction cancelQueuedForDispose(): void {\n\t\tconst pending = queue.splice(0);\n\t\tfor (const item of pending) callDone(item.done);\n\t}\n\n\tstop = records.subscribe((msg: Message, delivery?: DeliveryMeta) => {\n\t\tif (disposeRequested) return;\n\t\tconst nextRecords = dataOf<readonly AgenticMemoryRecord<TJson>[]>(msg);\n\t\tif (nextRecords === undefined) return;\n\t\tlatestRecords = nextRecords;\n\t\tif (subscribing && delivery === undefined) return;\n\t\tobservedChangesSinceSnapshot += 1;\n\t\tenqueueChange(nextRecords);\n\t\tif (\n\t\t\tsnapshotEveryChanges !== undefined &&\n\t\t\tobservedChangesSinceSnapshot >= snapshotEveryChanges\n\t\t) {\n\t\t\tenqueueSnapshot();\n\t\t}\n\t});\n\tsubscribing = false;\n\tif (opts.snapshotOnAttach !== false) enqueueSnapshot();\n\telse publish(\"ready\");\n\n\treturn {\n\t\tready,\n\t\tstatus,\n\t\terror,\n\t\tcursor,\n\t\tflush(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueue({ phase: \"flush\", done, run: () => undefined });\n\t\t},\n\t\tsnapshot(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed || disposeRequested) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueueSnapshot(done);\n\t\t},\n\t\tdispose(done?: (status: AgenticMemoryRecordsPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdisposeRequested = true;\n\t\t\tstop?.();\n\t\t\tcancelQueuedForDispose();\n\t\t\tenqueue({ phase: \"dispose\", done, run: () => undefined });\n\t\t},\n\t};\n}\n\nexport function openPersistentAgenticMemoryRecords<\n\tTJson extends AgenticMemoryStrictJsonValue = AgenticMemoryStrictJsonValue,\n>(\n\topts: OpenPersistentAgenticMemoryRecordsOptions<TJson>,\n): Promise<PersistentAgenticMemoryRecords<TJson>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"agentic-memory\";\n\tconst snapshotKey = opts.snapshotKey ?? agenticMemoryRecordsSnapshotKey(storagePrefix);\n\treturn loadAgenticMemoryRecordsState<TJson>({ ...opts, snapshotKey, storagePrefix }).then(\n\t\t(loaded) => {\n\t\t\tconst records =\n\t\t\t\tloaded.source === \"empty\" && opts.initial !== undefined ? opts.initial : loaded.records;\n\t\t\tconst node = opts.graph.state<readonly AgenticMemoryRecord<TJson>[]>(records, {\n\t\t\t\tname: opts.name,\n\t\t\t});\n\t\t\tconst persistence = persistAgenticMemoryRecords(opts.graph, node, {\n\t\t\t\t...opts,\n\t\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\t\tsnapshotKey,\n\t\t\t\tstoragePrefix,\n\t\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t\t});\n\t\t\treturn { records: node, persistence, loaded };\n\t\t},\n\t);\n}\n\nfunction recordFromFrame<TJson extends AgenticMemoryStrictJsonValue>(\n\tframe: AgenticMemoryRecordFrame<TJson>,\n): AgenticMemoryRecord<TJson> {\n\treturn agenticMemoryRecordCodec<TJson>().decode(\n\t\tagenticMemoryRecordFrameCodec<TJson>().encode(frame),\n\t);\n}\n\nfunction statusOf(\n\tstate: AgenticMemoryRecordsPersistenceStatus[\"state\"],\n\tpending: number,\n\twrites: number,\n\terrors: number,\n\tcursor: AgenticMemoryRecordsPersistenceCursor,\n): AgenticMemoryRecordsPersistenceStatus {\n\treturn { state, pending, writes, errors, cursor };\n}\n\nfunction dataOf<C>(msg: Message): C | undefined {\n\treturn msg[0] === \"DATA\" ? (msg[1] as C) : undefined;\n}\n\nfunction validateChangeCursor(value: unknown): number {\n\tif (typeof value !== \"number\" || !Number.isSafeInteger(value) || value < -1) {\n\t\tthrow new RangeError(\"changeCursor must be a safe integer >= -1\");\n\t}\n\treturn value;\n}\n\nfunction validateSnapshotEveryChanges(value: number | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tif (!Number.isSafeInteger(value) || value < 1) {\n\t\tthrow new RangeError(\"snapshotEveryChanges must be a positive safe integer\");\n\t}\n\treturn value;\n}\n\nfunction isPlainRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction assertKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = Object.keys(value).sort();\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected frame fields ${actual.join(\",\")}`);\n\t}\n}\n\nfunction assertDenseRecordFrames<TJson extends AgenticMemoryStrictJsonValue>(\n\tvalue: readonly unknown[],\n\tlabel: string,\n): readonly AgenticMemoryRecordFrame<TJson>[] {\n\tconst records: AgenticMemoryRecordFrame<TJson>[] = [];\n\tfor (let i = 0; i < value.length; i += 1) {\n\t\tif (!Object.hasOwn(value, i)) {\n\t\t\tthrow new TypeError(`${label}: sparse array hole at ${i}`);\n\t\t}\n\t\trecords.push(assertAgenticMemoryRecordFrame<TJson>(value[i]));\n\t}\n\treturn Object.freeze(records);\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","/**\n * Passive resilience policy helpers for graph-visible adapters (D130/D132).\n *\n * These helpers never schedule work and never own graph state. Drivers/adapters\n * consume them, while graph-visible bundles expose attempts/status/errors.\n */\n\nexport type BackoffPolicy =\n\t| { readonly kind: \"none\" }\n\t| { readonly kind: \"constant\"; readonly delayMs: number }\n\t| {\n\t\t\treadonly kind: \"linear\";\n\t\t\treadonly initialMs: number;\n\t\t\treadonly stepMs: number;\n\t\t\treadonly maxMs?: number;\n\t  }\n\t| {\n\t\t\treadonly kind: \"exponential\";\n\t\t\treadonly initialMs: number;\n\t\t\treadonly factor: number;\n\t\t\treadonly maxMs?: number;\n\t  }\n\t| { readonly kind: \"fibonacci\"; readonly unitMs: number; readonly maxMs?: number };\n\nexport interface RetryPolicy {\n\t/** Total attempts including the first try. */\n\treadonly maxAttempts: number;\n\treadonly backoff: BackoffPolicy;\n}\n\nexport type RetryState = \"idle\" | \"running\" | \"waiting\" | \"succeeded\" | \"failed\" | \"exhausted\";\n\nexport interface RetryStatus {\n\treadonly attempt: number;\n\treadonly maxAttempts: number;\n\treadonly delayMs?: number;\n\treadonly state: RetryState;\n}\n\nexport const noBackoff: BackoffPolicy = Object.freeze({ kind: \"none\" });\n\nexport function retryPolicy(maxAttempts = 1, backoff: BackoffPolicy = noBackoff): RetryPolicy {\n\tif (!Number.isInteger(maxAttempts) || maxAttempts <= 0) {\n\t\tthrow new RangeError(\"retryPolicy: maxAttempts must be a positive integer\");\n\t}\n\treturn Object.freeze({ maxAttempts, backoff });\n}\n\nexport function shouldRetry(policy: RetryPolicy, failedAttempt: number): boolean {\n\treturn failedAttempt < policy.maxAttempts;\n}\n\nexport function nextRetryDelayMs(policy: RetryPolicy, nextAttempt: number): number | undefined {\n\tif (!Number.isInteger(nextAttempt) || nextAttempt <= 0 || nextAttempt > policy.maxAttempts) {\n\t\treturn undefined;\n\t}\n\treturn backoffDelayMs(policy.backoff, nextAttempt);\n}\n\nexport function backoffDelayMs(policy: BackoffPolicy, attempt: number): number {\n\tconst safeAttempt = Math.max(1, Math.trunc(attempt));\n\tswitch (policy.kind) {\n\t\tcase \"none\":\n\t\t\treturn 0;\n\t\tcase \"constant\":\n\t\t\treturn nonNegative(policy.delayMs);\n\t\tcase \"linear\":\n\t\t\treturn cap(\n\t\t\t\tnonNegative(policy.initialMs) + nonNegative(policy.stepMs) * (safeAttempt - 1),\n\t\t\t\tpolicy.maxMs,\n\t\t\t);\n\t\tcase \"exponential\": {\n\t\t\tconst factor = Math.max(1, Math.trunc(policy.factor));\n\t\t\treturn cap(nonNegative(policy.initialMs) * factor ** (safeAttempt - 1), policy.maxMs);\n\t\t}\n\t\tcase \"fibonacci\":\n\t\t\treturn cap(nonNegative(policy.unitMs) * fibonacci(safeAttempt), policy.maxMs);\n\t}\n}\n\nfunction cap(value: number, max: number | undefined): number {\n\tif (max === undefined) return value;\n\treturn Math.min(value, nonNegative(max));\n}\n\nfunction nonNegative(value: number): number {\n\tif (!Number.isFinite(value)) return 0;\n\treturn Math.max(0, value);\n}\n\nfunction fibonacci(n: number): number {\n\tif (n <= 1) return 1;\n\tlet prev = 1;\n\tlet curr = 1;\n\tfor (let i = 2; i <= n; i += 1) {\n\t\tconst next = prev + curr;\n\t\tprev = curr;\n\t\tcurr = next;\n\t}\n\treturn curr;\n}\n","// D497 canonical protobuf profile for the D134/D496 wire bridge envelope subset.\n\nexport type CanonicalProtobufErrorCategory =\n\t| \"unknown_field\"\n\t| \"duplicate_singular\"\n\t| \"noncanonical_bytes\"\n\t| \"invalid_oneof\"\n\t| \"missing_required\"\n\t| \"invalid_wire_edge\"\n\t| \"default_emission\"\n\t| \"malformed\";\n\nexport class CanonicalProtobufError extends Error {\n\treadonly category: CanonicalProtobufErrorCategory;\n\n\tconstructor(category: CanonicalProtobufErrorCategory, message: string) {\n\t\tsuper(message);\n\t\tthis.name = \"CanonicalProtobufError\";\n\t\tthis.category = category;\n\t}\n}\n\nexport interface CanonicalWireBridgeMetadata {\n\treadonly seq: bigint;\n\treadonly cursor: bigint;\n\treadonly idempotencyKey: string;\n\treadonly attempt: number;\n\treadonly maxAttempts: number;\n\treadonly timestampMs?: bigint;\n\treadonly ackForSeq?: bigint;\n\treadonly requestId?: string;\n}\n\nexport type CanonicalWireBridgeDataBody =\n\t| { readonly kind: \"value\"; readonly value: Uint8Array }\n\t| { readonly kind: \"wire_edge\"; readonly frame: CanonicalWireEdgeFrame };\n\nexport interface CanonicalWireEdgeFrame {\n\treadonly kind: \"dirty\" | \"data\";\n\treadonly edgeId: string;\n\treadonly causeId: string;\n\treadonly value?: Uint8Array;\n}\n\nexport type CanonicalWireBridgePayload =\n\t| { readonly kind: \"start\" }\n\t| { readonly kind: \"data\"; readonly body: CanonicalWireBridgeDataBody }\n\t| { readonly kind: \"ack\" }\n\t| { readonly kind: \"nack\"; readonly error?: Uint8Array }\n\t| { readonly kind: \"status\"; readonly status: Uint8Array }\n\t| { readonly kind: \"error\"; readonly error: Uint8Array }\n\t| { readonly kind: \"close\"; readonly reason?: Uint8Array };\n\nexport interface CanonicalWireBridgeEnvelope {\n\treadonly sessionId: string;\n\treadonly metadata: CanonicalWireBridgeMetadata;\n\treadonly payload: CanonicalWireBridgePayload;\n}\n\ninterface Field {\n\treadonly no: number;\n\treadonly wireType: number;\n\treadonly value: bigint | Uint8Array;\n}\n\nconst maxUint64 = (1n << 64n) - 1n;\nconst textDecoder = new TextDecoder(\"utf-8\", { fatal: true });\nconst textEncoder = new TextEncoder();\n\nexport function decodeCanonicalWireBridgeEnvelope(bytes: Uint8Array): CanonicalWireBridgeEnvelope {\n\tconst input = Uint8Array.from(bytes);\n\tconst envelope = parseWireBridgeEnvelope(input);\n\tvalidateWireBridgeEnvelope(envelope);\n\tconst canonical = encodeCanonicalWireBridgeEnvelope(envelope);\n\tif (!bytesEqual(input, canonical)) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"noncanonical_bytes\",\n\t\t\t\"WireBridgeEnvelope bytes are not canonical deterministic protobuf\",\n\t\t);\n\t}\n\treturn envelope;\n}\n\nexport function decodeCanonicalWireEdgeFrame(bytes: Uint8Array): CanonicalWireEdgeFrame {\n\tconst input = Uint8Array.from(bytes);\n\tconst frame = parseWireEdgeFrame(input);\n\tvalidateWireEdgeFrame(frame);\n\tconst canonical = encodeWireEdgeFrame(frame);\n\tif (!bytesEqual(input, canonical)) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"noncanonical_bytes\",\n\t\t\t\"WireEdgeFrame bytes are not canonical deterministic protobuf\",\n\t\t);\n\t}\n\treturn frame;\n}\n\nexport function encodeCanonicalWireEdgeFrame(frame: CanonicalWireEdgeFrame): Uint8Array {\n\tvalidateWireEdgeFrame(frame);\n\treturn encodeWireEdgeFrame(frame);\n}\n\nexport function encodeCanonicalWireBridgeEnvelope(\n\tenvelope: CanonicalWireBridgeEnvelope,\n): Uint8Array {\n\tvalidateWireBridgeEnvelope(envelope);\n\tconst out = new ByteWriter();\n\tout.stringField(1, envelope.sessionId);\n\tout.messageField(2, encodeMetadata(envelope.metadata));\n\tswitch (envelope.payload.kind) {\n\t\tcase \"start\":\n\t\t\tout.messageField(3, new Uint8Array());\n\t\t\tbreak;\n\t\tcase \"data\":\n\t\t\tout.messageField(4, encodeDataPayload(envelope.payload.body));\n\t\t\tbreak;\n\t\tcase \"ack\":\n\t\t\tout.messageField(5, new Uint8Array());\n\t\t\tbreak;\n\t\tcase \"nack\":\n\t\t\tout.messageField(6, encodeOptionalBytesMessage(1, envelope.payload.error));\n\t\t\tbreak;\n\t\tcase \"status\":\n\t\t\tout.messageField(7, encodeRequiredBytesMessage(1, envelope.payload.status));\n\t\t\tbreak;\n\t\tcase \"error\":\n\t\t\tout.messageField(8, encodeRequiredBytesMessage(1, envelope.payload.error));\n\t\t\tbreak;\n\t\tcase \"close\":\n\t\t\tout.messageField(9, encodeOptionalBytesMessage(1, envelope.payload.reason));\n\t\t\tbreak;\n\t}\n\treturn out.finish();\n}\n\nfunction parseWireBridgeEnvelope(bytes: Uint8Array): CanonicalWireBridgeEnvelope {\n\tconst fields = readFields(\n\t\tbytes,\n\t\tnew Map([\n\t\t\t[1, 2],\n\t\t\t[2, 2],\n\t\t\t[3, 2],\n\t\t\t[4, 2],\n\t\t\t[5, 2],\n\t\t\t[6, 2],\n\t\t\t[7, 2],\n\t\t\t[8, 2],\n\t\t\t[9, 2],\n\t\t]),\n\t\t\"WireBridgeEnvelope\",\n\t);\n\tconst session = bytesField(fields, 1);\n\tconst metadataBytes = bytesField(fields, 2);\n\tconst payloadFields = fields.filter((field) => field.no >= 3 && field.no <= 9);\n\tif (session === undefined || metadataBytes === undefined || payloadFields.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireBridgeEnvelope missing required fields\",\n\t\t);\n\t}\n\tif (payloadFields.length !== 1) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"invalid_oneof\",\n\t\t\t\"WireBridgeEnvelope payload oneof has multiple cases\",\n\t\t);\n\t}\n\tconst payloadField = payloadFields[0];\n\tif (!(payloadField.value instanceof Uint8Array)) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", \"WireBridgeEnvelope payload is malformed\");\n\t}\n\treturn {\n\t\tsessionId: utf8String(session, \"session_id\"),\n\t\tmetadata: parseMetadata(metadataBytes),\n\t\tpayload: parseEnvelopePayload(payloadField.no, payloadField.value),\n\t};\n}\n\nfunction parseEnvelopePayload(fieldNo: number, bytes: Uint8Array): CanonicalWireBridgePayload {\n\tswitch (fieldNo) {\n\t\tcase 3:\n\t\t\trequireEmptyMessage(bytes, \"start\");\n\t\t\treturn { kind: \"start\" };\n\t\tcase 4:\n\t\t\treturn { kind: \"data\", body: parseDataPayload(bytes) };\n\t\tcase 5:\n\t\t\trequireEmptyMessage(bytes, \"ack\");\n\t\t\treturn { kind: \"ack\" };\n\t\tcase 6:\n\t\t\treturn { kind: \"nack\", error: parseOptionalBytesPayload(bytes, \"nack\") };\n\t\tcase 7:\n\t\t\treturn { kind: \"status\", status: parseRequiredBytesPayload(bytes, \"status\") };\n\t\tcase 8:\n\t\t\treturn { kind: \"error\", error: parseRequiredBytesPayload(bytes, \"error\") };\n\t\tcase 9:\n\t\t\treturn { kind: \"close\", reason: parseOptionalBytesPayload(bytes, \"close\") };\n\t\tdefault:\n\t\t\tthrow new CanonicalProtobufError(\"unknown_field\", \"unknown envelope payload field\");\n\t}\n}\n\nfunction parseMetadata(bytes: Uint8Array): CanonicalWireBridgeMetadata {\n\tconst fields = readFields(\n\t\tbytes,\n\t\tnew Map([\n\t\t\t[1, 0],\n\t\t\t[2, 0],\n\t\t\t[3, 2],\n\t\t\t[4, 0],\n\t\t\t[5, 0],\n\t\t\t[6, 0],\n\t\t\t[7, 0],\n\t\t\t[8, 2],\n\t\t]),\n\t\t\"WireBridgeMetadata\",\n\t);\n\tconst seq = uintField(fields, 1);\n\tconst cursor = uintField(fields, 2);\n\tconst key = bytesField(fields, 3);\n\tconst attempt = uintField(fields, 4);\n\tconst maxAttempts = uintField(fields, 5);\n\tif (\n\t\tseq === undefined ||\n\t\tcursor === undefined ||\n\t\tkey === undefined ||\n\t\tattempt === undefined ||\n\t\tmaxAttempts === undefined\n\t) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireBridgeMetadata missing required fields\",\n\t\t);\n\t}\n\tconst timestampMs = uintField(fields, 6);\n\tconst ackForSeq = uintField(fields, 7);\n\tconst requestId = bytesField(fields, 8);\n\tif (timestampMs === 0n || ackForSeq === 0n || requestId?.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"default_emission\",\n\t\t\t\"optional metadata default value was emitted\",\n\t\t);\n\t}\n\treturn {\n\t\tseq,\n\t\tcursor,\n\t\tidempotencyKey: utf8String(key, \"idempotency_key\"),\n\t\tattempt: uint32(attempt, \"attempt\"),\n\t\tmaxAttempts: uint32(maxAttempts, \"max_attempts\"),\n\t\ttimestampMs,\n\t\tackForSeq,\n\t\trequestId: requestId === undefined ? undefined : utf8String(requestId, \"request_id\"),\n\t};\n}\n\nfunction parseDataPayload(bytes: Uint8Array): CanonicalWireBridgeDataBody {\n\tconst fields = readFields(\n\t\tbytes,\n\t\tnew Map([\n\t\t\t[1, 2],\n\t\t\t[2, 2],\n\t\t]),\n\t\t\"WireBridgeDataPayload\",\n\t);\n\tconst value = bytesField(fields, 1);\n\tconst wireEdge = bytesField(fields, 2);\n\tif (value !== undefined && wireEdge !== undefined) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"invalid_oneof\",\n\t\t\t\"WireBridgeDataPayload body has multiple cases\",\n\t\t);\n\t}\n\tif (value !== undefined) return { kind: \"value\", value };\n\tif (wireEdge !== undefined) return { kind: \"wire_edge\", frame: parseWireEdgeFrame(wireEdge) };\n\tthrow new CanonicalProtobufError(\"missing_required\", \"WireBridgeDataPayload missing body\");\n}\n\nfunction parseWireEdgeFrame(bytes: Uint8Array): CanonicalWireEdgeFrame {\n\tconst fields = readFields(\n\t\tbytes,\n\t\tnew Map([\n\t\t\t[1, 0],\n\t\t\t[2, 2],\n\t\t\t[3, 2],\n\t\t\t[4, 2],\n\t\t]),\n\t\t\"WireEdgeFrame\",\n\t);\n\tconst kind = uintField(fields, 1);\n\tconst edge = bytesField(fields, 2);\n\tconst cause = bytesField(fields, 3);\n\tconst value = bytesField(fields, 4);\n\tif (kind === undefined || edge === undefined || cause === undefined) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", \"WireEdgeFrame missing required fields\");\n\t}\n\tif (edge.length === 0 || cause.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireEdgeFrame edge_id/cause_id must be non-empty\",\n\t\t);\n\t}\n\tif (kind === 1n) {\n\t\tif (value !== undefined) {\n\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\"invalid_wire_edge\",\n\t\t\t\t\"DIRTY WireEdgeFrame must not carry value\",\n\t\t\t);\n\t\t}\n\t\treturn {\n\t\t\tkind: \"dirty\",\n\t\t\tedgeId: utf8String(edge, \"edge_id\"),\n\t\t\tcauseId: utf8String(cause, \"cause_id\"),\n\t\t};\n\t}\n\tif (kind === 2n) {\n\t\tif (value === undefined) {\n\t\t\tthrow new CanonicalProtobufError(\"invalid_wire_edge\", \"DATA WireEdgeFrame requires value\");\n\t\t}\n\t\treturn {\n\t\t\tkind: \"data\",\n\t\t\tedgeId: utf8String(edge, \"edge_id\"),\n\t\t\tcauseId: utf8String(cause, \"cause_id\"),\n\t\t\tvalue,\n\t\t};\n\t}\n\tthrow new CanonicalProtobufError(\"invalid_wire_edge\", \"WireEdgeFrame kind is invalid\");\n}\n\nfunction validateWireBridgeEnvelope(envelope: CanonicalWireBridgeEnvelope): void {\n\tif (!isRecord(envelope)) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", \"WireBridgeEnvelope DTO must be an object\");\n\t}\n\tif (typeof envelope.sessionId !== \"string\" || envelope.sessionId.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireBridgeEnvelope session_id must be non-empty\",\n\t\t);\n\t}\n\tconst metadata = envelope.metadata;\n\tif (!isRecord(metadata)) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", \"WireBridgeMetadata DTO must be an object\");\n\t}\n\tassertUint64(metadata.seq, \"seq\");\n\tassertUint64(metadata.cursor, \"cursor\");\n\tassertUint32Number(metadata.attempt, \"attempt\");\n\tassertUint32Number(metadata.maxAttempts, \"max_attempts\");\n\tif (metadata.timestampMs !== undefined) assertUint64(metadata.timestampMs, \"timestamp_ms\");\n\tif (metadata.ackForSeq !== undefined) assertUint64(metadata.ackForSeq, \"ack_for_seq\");\n\tif (metadata.seq === 0n || metadata.attempt === 0 || metadata.maxAttempts < metadata.attempt) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireBridgeMetadata positive fields are invalid\",\n\t\t);\n\t}\n\tif (typeof metadata.idempotencyKey !== \"string\" || metadata.idempotencyKey.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireBridgeMetadata idempotency_key is required\",\n\t\t);\n\t}\n\tif (metadata.requestId !== undefined && typeof metadata.requestId !== \"string\") {\n\t\tthrow new CanonicalProtobufError(\"malformed\", \"WireBridgeMetadata request_id must be a string\");\n\t}\n\tif (!isRecord(envelope.payload)) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", \"WireBridgeEnvelope payload is required\");\n\t}\n\tvalidatePayloadDto(envelope.payload);\n\tif (\n\t\t(envelope.payload.kind === \"ack\" || envelope.payload.kind === \"nack\") &&\n\t\tmetadata.ackForSeq === undefined\n\t) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", \"ACK/NACK requires metadata.ack_for_seq\");\n\t}\n\tif (metadata.timestampMs === 0n || metadata.ackForSeq === 0n || metadata.requestId === \"\") {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"default_emission\",\n\t\t\t\"optional metadata default value was emitted\",\n\t\t);\n\t}\n}\n\nfunction validatePayloadDto(payload: CanonicalWireBridgePayload): void {\n\tswitch (payload.kind) {\n\t\tcase \"start\":\n\t\tcase \"ack\":\n\t\t\treturn;\n\t\tcase \"data\":\n\t\t\tif (!isRecord(payload.body)) {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"missing_required\",\n\t\t\t\t\t\"WireBridgeDataPayload body is required\",\n\t\t\t\t);\n\t\t\t}\n\t\t\tif (payload.body.kind === \"value\") {\n\t\t\t\tassertUint8Array(payload.body.value, \"WireBridgeDataPayload value\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (payload.body.kind === \"wire_edge\") {\n\t\t\t\tvalidateWireEdgeFrame(payload.body.frame);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\"invalid_oneof\",\n\t\t\t\t\"WireBridgeDataPayload body kind is invalid\",\n\t\t\t);\n\t\tcase \"nack\":\n\t\t\tif (payload.error !== undefined)\n\t\t\t\tassertNonEmptyOptionalBytes(payload.error, \"WireBridgeNackPayload error\");\n\t\t\treturn;\n\t\tcase \"status\":\n\t\t\tassertNonEmptyRequiredBytes(payload.status, \"WireBridgeStatusPayload status\");\n\t\t\treturn;\n\t\tcase \"error\":\n\t\t\tassertNonEmptyRequiredBytes(payload.error, \"WireBridgeErrorPayload error\");\n\t\t\treturn;\n\t\tcase \"close\":\n\t\t\tif (payload.reason !== undefined)\n\t\t\t\tassertNonEmptyOptionalBytes(payload.reason, \"WireBridgeClosePayload reason\");\n\t\t\treturn;\n\t\tdefault:\n\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\"invalid_oneof\",\n\t\t\t\t\"WireBridgeEnvelope payload kind is invalid\",\n\t\t\t);\n\t}\n}\n\nfunction validateWireEdgeFrame(frame: CanonicalWireEdgeFrame): void {\n\tif (!isRecord(frame)) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", \"WireEdgeFrame DTO must be an object\");\n\t}\n\tif (typeof frame.edgeId !== \"string\" || typeof frame.causeId !== \"string\") {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireEdgeFrame edge_id/cause_id are required\",\n\t\t);\n\t}\n\tif (frame.edgeId.length === 0 || frame.causeId.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"missing_required\",\n\t\t\t\"WireEdgeFrame edge_id/cause_id must be non-empty\",\n\t\t);\n\t}\n\tswitch (frame.kind) {\n\t\tcase \"dirty\":\n\t\t\tif (frame.value !== undefined) {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"invalid_wire_edge\",\n\t\t\t\t\t\"DIRTY WireEdgeFrame must not carry value\",\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn;\n\t\tcase \"data\":\n\t\t\tif (frame.value === undefined) {\n\t\t\t\tthrow new CanonicalProtobufError(\"invalid_wire_edge\", \"DATA WireEdgeFrame requires value\");\n\t\t\t}\n\t\t\tassertUint8Array(frame.value, \"WireEdgeFrame value\");\n\t\t\treturn;\n\t\tdefault:\n\t\t\tthrow new CanonicalProtobufError(\"invalid_wire_edge\", \"WireEdgeFrame kind is invalid\");\n\t}\n}\n\nfunction encodeMetadata(metadata: CanonicalWireBridgeMetadata): Uint8Array {\n\tconst out = new ByteWriter();\n\tout.varintField(1, metadata.seq);\n\tout.varintField(2, metadata.cursor);\n\tout.stringField(3, metadata.idempotencyKey);\n\tout.varintField(4, BigInt(metadata.attempt));\n\tout.varintField(5, BigInt(metadata.maxAttempts));\n\tif (metadata.timestampMs !== undefined) out.varintField(6, metadata.timestampMs);\n\tif (metadata.ackForSeq !== undefined) out.varintField(7, metadata.ackForSeq);\n\tif (metadata.requestId !== undefined) out.stringField(8, metadata.requestId);\n\treturn out.finish();\n}\n\nfunction encodeDataPayload(body: CanonicalWireBridgeDataBody): Uint8Array {\n\tconst out = new ByteWriter();\n\tif (body.kind === \"value\") {\n\t\tout.bytesField(1, body.value);\n\t} else {\n\t\tout.messageField(2, encodeWireEdgeFrame(body.frame));\n\t}\n\treturn out.finish();\n}\n\nfunction encodeWireEdgeFrame(frame: CanonicalWireEdgeFrame): Uint8Array {\n\tconst out = new ByteWriter();\n\tout.varintField(1, frame.kind === \"dirty\" ? 1n : 2n);\n\tout.stringField(2, frame.edgeId);\n\tout.stringField(3, frame.causeId);\n\tif (frame.value !== undefined) out.bytesField(4, frame.value);\n\treturn out.finish();\n}\n\nfunction encodeRequiredBytesMessage(fieldNo: number, value: Uint8Array): Uint8Array {\n\tconst out = new ByteWriter();\n\tout.bytesField(fieldNo, value);\n\treturn out.finish();\n}\n\nfunction encodeOptionalBytesMessage(fieldNo: number, value: Uint8Array | undefined): Uint8Array {\n\tconst out = new ByteWriter();\n\tif (value !== undefined) {\n\t\tassertNonEmptyOptionalBytes(value, \"optional bytes payload\");\n\t\tout.bytesField(fieldNo, value);\n\t}\n\treturn out.finish();\n}\n\nfunction parseRequiredBytesPayload(bytes: Uint8Array, name: string): Uint8Array {\n\tconst fields = readFields(bytes, new Map([[1, 2]]), `WireBridge${name}Payload`);\n\tconst value = bytesField(fields, 1);\n\tif (value === undefined) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", `${name} payload missing required bytes`);\n\t}\n\tif (value.length === 0) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", `${name} payload bytes must be non-empty`);\n\t}\n\treturn value;\n}\n\nfunction parseOptionalBytesPayload(bytes: Uint8Array, name: string): Uint8Array | undefined {\n\tconst fields = readFields(bytes, new Map([[1, 2]]), `WireBridge${name}Payload`);\n\tconst value = bytesField(fields, 1);\n\tif (value?.length === 0) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"default_emission\",\n\t\t\t`${name} optional bytes default value was emitted`,\n\t\t);\n\t}\n\treturn value;\n}\n\nfunction requireEmptyMessage(bytes: Uint8Array, name: string): void {\n\tif (bytes.length !== 0) {\n\t\tthrow new CanonicalProtobufError(\"unknown_field\", `${name} payload must be empty`);\n\t}\n}\n\nfunction readFields(bytes: Uint8Array, allowed: Map<number, number>, messageName: string): Field[] {\n\tconst reader = new ByteReader(bytes);\n\tconst fields: Field[] = [];\n\tconst seen = new Set<number>();\n\twhile (!reader.done()) {\n\t\tconst key = reader.varint();\n\t\tconst fieldNo = Number(key >> 3n);\n\t\tconst wireType = Number(key & 7n);\n\t\tconst expectedWireType = allowed.get(fieldNo);\n\t\tif (fieldNo <= 0 || expectedWireType === undefined) {\n\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\"unknown_field\",\n\t\t\t\t`${messageName} contains unknown field ${fieldNo}`,\n\t\t\t);\n\t\t}\n\t\tif (wireType !== expectedWireType) {\n\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\"malformed\",\n\t\t\t\t`${messageName} field ${fieldNo} has wrong wire type`,\n\t\t\t);\n\t\t}\n\t\tif (seen.has(fieldNo)) {\n\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\"duplicate_singular\",\n\t\t\t\t`${messageName} field ${fieldNo} is duplicated`,\n\t\t\t);\n\t\t}\n\t\tseen.add(fieldNo);\n\t\tif (wireType === 0) {\n\t\t\tfields.push({ no: fieldNo, wireType, value: reader.varint() });\n\t\t} else if (wireType === 2) {\n\t\t\tfields.push({ no: fieldNo, wireType, value: reader.readBytes() });\n\t\t} else {\n\t\t\tthrow new CanonicalProtobufError(\"malformed\", `${messageName} unsupported wire type`);\n\t\t}\n\t}\n\treturn fields;\n}\n\nfunction uintField(fields: readonly Field[], no: number): bigint | undefined {\n\tconst field = fields.find((candidate) => candidate.no === no);\n\treturn typeof field?.value === \"bigint\" ? field.value : undefined;\n}\n\nfunction bytesField(fields: readonly Field[], no: number): Uint8Array | undefined {\n\tconst field = fields.find((candidate) => candidate.no === no);\n\treturn field?.value instanceof Uint8Array ? field.value : undefined;\n}\n\nfunction utf8String(bytes: Uint8Array, field: string): string {\n\tlet text: string;\n\ttry {\n\t\ttext = textDecoder.decode(bytes);\n\t} catch (error) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"malformed\",\n\t\t\t`${field} is not valid utf-8: ${error instanceof Error ? error.message : String(error)}`,\n\t\t);\n\t}\n\tif (text.length === 0) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", `${field} must be non-empty`);\n\t}\n\treturn text;\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null;\n}\n\nfunction assertUint64(value: unknown, field: string): asserts value is bigint {\n\tif (typeof value !== \"bigint\" || value < 0n || value > maxUint64) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", `${field} must be a uint64 bigint`);\n\t}\n}\n\nfunction assertUint32Number(value: unknown, field: string): asserts value is number {\n\tif (!Number.isInteger(value) || (value as number) < 0 || (value as number) > 0xffff_ffff) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", `${field} must be a uint32 number`);\n\t}\n}\n\nfunction assertUint8Array(value: unknown, field: string): asserts value is Uint8Array {\n\tif (!(value instanceof Uint8Array)) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", `${field} must be Uint8Array bytes`);\n\t}\n}\n\nfunction assertNonEmptyOptionalBytes(value: unknown, field: string): asserts value is Uint8Array {\n\tassertUint8Array(value, field);\n\tif (value.length === 0) {\n\t\tthrow new CanonicalProtobufError(\"default_emission\", `${field} default value must be omitted`);\n\t}\n}\n\nfunction assertNonEmptyRequiredBytes(value: unknown, field: string): asserts value is Uint8Array {\n\tassertUint8Array(value, field);\n\tif (value.length === 0) {\n\t\tthrow new CanonicalProtobufError(\"missing_required\", `${field} must be non-empty`);\n\t}\n}\n\nfunction uint32(value: bigint, field: string): number {\n\tif (value > 0xffff_ffffn) {\n\t\tthrow new CanonicalProtobufError(\"malformed\", `${field} exceeds uint32`);\n\t}\n\treturn Number(value);\n}\n\nfunction bytesEqual(left: Uint8Array, right: Uint8Array): boolean {\n\tif (left.length !== right.length) return false;\n\tfor (let i = 0; i < left.length; i++) {\n\t\tif (left[i] !== right[i]) return false;\n\t}\n\treturn true;\n}\n\nclass ByteReader {\n\tprivate offset = 0;\n\n\tconstructor(private readonly buf: Uint8Array) {}\n\n\tdone(): boolean {\n\t\treturn this.offset === this.buf.length;\n\t}\n\n\tvarint(): bigint {\n\t\tlet shift = 0n;\n\t\tlet result = 0n;\n\t\tfor (let i = 0; i < 10; i++) {\n\t\t\tif (this.offset >= this.buf.length) {\n\t\t\t\tthrow new CanonicalProtobufError(\"malformed\", \"truncated varint\");\n\t\t\t}\n\t\t\tconst byte = this.buf[this.offset++];\n\t\t\tif (i === 9 && (byte & 0xfe) !== 0) {\n\t\t\t\tthrow new CanonicalProtobufError(\"malformed\", \"varint exceeds 64 bits\");\n\t\t\t}\n\t\t\tresult |= BigInt(byte & 0x7f) << shift;\n\t\t\tif ((byte & 0x80) === 0) return result;\n\t\t\tshift += 7n;\n\t\t}\n\t\tthrow new CanonicalProtobufError(\"malformed\", \"varint exceeds 64 bits\");\n\t}\n\n\treadBytes(): Uint8Array {\n\t\tconst len = this.varint();\n\t\tif (len > BigInt(this.buf.length - this.offset)) {\n\t\t\tthrow new CanonicalProtobufError(\"malformed\", \"length-delimited field is truncated\");\n\t\t}\n\t\tconst start = this.offset;\n\t\tthis.offset += Number(len);\n\t\treturn this.buf.slice(start, this.offset);\n\t}\n}\n\nclass ByteWriter {\n\tprivate readonly chunks: number[] = [];\n\n\tvarintField(fieldNo: number, value: bigint): void {\n\t\tthis.tag(fieldNo, 0);\n\t\tthis.varint(value);\n\t}\n\n\tbytesField(fieldNo: number, value: Uint8Array): void {\n\t\tthis.tag(fieldNo, 2);\n\t\tthis.varint(BigInt(value.length));\n\t\tthis.bytes(value);\n\t}\n\n\tstringField(fieldNo: number, value: string): void {\n\t\tthis.bytesField(fieldNo, textEncoder.encode(value));\n\t}\n\n\tmessageField(fieldNo: number, value: Uint8Array): void {\n\t\tthis.bytesField(fieldNo, value);\n\t}\n\n\tfinish(): Uint8Array {\n\t\treturn new Uint8Array(this.chunks);\n\t}\n\n\tprivate tag(fieldNo: number, wireType: number): void {\n\t\tthis.varint(BigInt((fieldNo << 3) | wireType));\n\t}\n\n\tprivate varint(value: bigint): void {\n\t\tif (value < 0n || value > maxUint64) {\n\t\t\tthrow new CanonicalProtobufError(\"malformed\", \"varint value must fit uint64\");\n\t\t}\n\t\tlet next = value;\n\t\tdo {\n\t\t\tlet byte = Number(next & 0x7fn);\n\t\t\tnext >>= 7n;\n\t\t\tif (next !== 0n) byte |= 0x80;\n\t\t\tthis.chunks.push(byte);\n\t\t} while (next !== 0n);\n\t}\n\n\tprivate bytes(value: Uint8Array): void {\n\t\tfor (const byte of value) this.chunks.push(byte);\n\t}\n}\n","/**\n * Graph-visible wire bridge envelope helpers (D134).\n *\n * This first slice is transport-free: commands become outbound envelope facts,\n * remote receipts enter only through the inbound fact node, and retry/ack timeout\n * state is surfaced through graph-visible attempts/status/errors nodes.\n */\n\nimport { assertStrictJsonValue } from \"../json/codec.js\";\nimport type { CanonicalWireBridgeDataBody, CanonicalWireEdgeFrame } from \"./bridge-protobuf.js\";\nimport type {\n\tRemoteCallRequest,\n\tRemoteCallResponse,\n\tWireBridgeEnvelope,\n\tWireBridgeEnvelopeType,\n\tWireBridgeMetadata,\n} from \"./bridge-types.js\";\n\nexport const envelopeTypes = new Set<WireBridgeEnvelopeType>([\n\t\"start\",\n\t\"data\",\n\t\"ack\",\n\t\"nack\",\n\t\"status\",\n\t\"error\",\n\t\"close\",\n]);\n\nexport function validateRemoteCallRequest<T>(value: unknown): RemoteCallRequest<T> | undefined {\n\tif (!isRecord(value)) return undefined;\n\tif (typeof value.operation !== \"string\" || value.operation.length === 0) return undefined;\n\tif (typeof value.requestId !== \"string\" || value.requestId.length === 0) return undefined;\n\tif (!(\"payload\" in value)) return undefined;\n\treturn {\n\t\toperation: value.operation,\n\t\trequestId: value.requestId,\n\t\tpayload: value.payload as T,\n\t};\n}\n\nexport function validateRemoteCallResponse<T>(value: unknown): RemoteCallResponse<T> | undefined {\n\tif (!isRecord(value)) return undefined;\n\tif (typeof value.operation !== \"string\" || value.operation.length === 0) return undefined;\n\tif (typeof value.requestId !== \"string\" || value.requestId.length === 0) return undefined;\n\tif (value.kind === \"result\" && \"payload\" in value) {\n\t\treturn {\n\t\t\tkind: \"result\",\n\t\t\toperation: value.operation,\n\t\t\trequestId: value.requestId,\n\t\t\tpayload: value.payload as T,\n\t\t};\n\t}\n\tif (value.kind === \"error\" && typeof value.error === \"string\" && value.error.length > 0) {\n\t\treturn {\n\t\t\tkind: \"error\",\n\t\t\toperation: value.operation,\n\t\t\trequestId: value.requestId,\n\t\t\terror: value.error,\n\t\t};\n\t}\n\tif (value.kind === \"status\" && typeof value.status === \"string\" && value.status.length > 0) {\n\t\treturn {\n\t\t\tkind: \"status\",\n\t\t\toperation: value.operation,\n\t\t\trequestId: value.requestId,\n\t\t\tstatus: value.status,\n\t\t};\n\t}\n\treturn undefined;\n}\n\nexport function remoteMalformedResponseRequestId(value: unknown): string | undefined {\n\tif (!isRecord(value)) return undefined;\n\treturn typeof value.requestId === \"string\" && value.requestId.length > 0\n\t\t? value.requestId\n\t\t: undefined;\n}\n\nexport function remoteMalformedResponseOperation(value: unknown): string | undefined {\n\tif (!isRecord(value)) return undefined;\n\treturn typeof value.operation === \"string\" && value.operation.length > 0\n\t\t? value.operation\n\t\t: undefined;\n}\n\nexport function isRecord(value: unknown): value is Record<string, unknown> {\n\treturn typeof value === \"object\" && value !== null;\n}\n\nexport function isThenable(value: unknown): boolean {\n\treturn isRecord(value) && typeof value.then === \"function\";\n}\n\nexport function validateInboundEnvelope(envelope: unknown): string | undefined {\n\tif (typeof envelope !== \"object\" || envelope === null) {\n\t\treturn \"wireBridge: inbound envelope must be an object\";\n\t}\n\tconst candidate = envelope as Partial<WireBridgeEnvelope<unknown>>;\n\tif (typeof candidate.sessionId !== \"string\" || candidate.sessionId.length === 0) {\n\t\treturn \"wireBridge: inbound envelope sessionId must be a non-empty string\";\n\t}\n\tif (\n\t\ttypeof candidate.type !== \"string\" ||\n\t\t!envelopeTypes.has(candidate.type as WireBridgeEnvelopeType)\n\t) {\n\t\treturn \"wireBridge: inbound envelope type is not recognized\";\n\t}\n\tconst metadata = candidate.metadata as Partial<WireBridgeMetadata> | undefined;\n\tif (typeof metadata !== \"object\" || metadata === null) {\n\t\treturn \"wireBridge: inbound envelope metadata must be an object\";\n\t}\n\tif (!isSafePositiveInteger(metadata.seq)) {\n\t\treturn \"wireBridge: inbound envelope seq must be a positive integer\";\n\t}\n\tif (!isSafeNonNegativeInteger(metadata.cursor)) {\n\t\treturn \"wireBridge: inbound envelope cursor must be a non-negative integer\";\n\t}\n\tif (\n\t\ttypeof metadata.idempotencyKey !== \"string\" ||\n\t\t(metadata.idempotencyKey as string).length === 0\n\t) {\n\t\treturn \"wireBridge: inbound envelope idempotencyKey must be a non-empty string\";\n\t}\n\tif (!isSafePositiveInteger(metadata.attempt)) {\n\t\treturn \"wireBridge: inbound envelope attempt must be a positive integer\";\n\t}\n\tif (\n\t\t!isSafePositiveInteger(metadata.maxAttempts) ||\n\t\t(metadata.maxAttempts as number) < (metadata.attempt as number)\n\t) {\n\t\treturn \"wireBridge: inbound envelope maxAttempts must be >= attempt\";\n\t}\n\tif (metadata.ackForSeq !== undefined && !isSafePositiveInteger(metadata.ackForSeq)) {\n\t\treturn \"wireBridge: inbound envelope ackForSeq must be a positive integer\";\n\t}\n\tif ((candidate.type === \"ack\" || candidate.type === \"nack\") && metadata.ackForSeq === undefined) {\n\t\treturn `wireBridge: inbound ${candidate.type} envelope requires ackForSeq`;\n\t}\n\tconst payloadError = validatePayloadForType(\n\t\tcandidate.type as WireBridgeEnvelopeType,\n\t\tcandidate.payload,\n\t\t\"wireBridge: inbound envelope\",\n\t);\n\tif (payloadError !== undefined) return payloadError;\n\treturn undefined;\n}\n\nexport function validateCommand(value: unknown): string | undefined {\n\tif (typeof value !== \"object\" || value === null) {\n\t\treturn \"wireBridge: command fact must be an object\";\n\t}\n\tconst kind = (value as { readonly kind?: unknown }).kind;\n\tif (\n\t\tkind !== \"start\" &&\n\t\tkind !== \"send\" &&\n\t\tkind !== \"ack\" &&\n\t\tkind !== \"nack\" &&\n\t\tkind !== \"ack-timeout\" &&\n\t\tkind !== \"close\"\n\t) {\n\t\treturn \"wireBridge: command kind is not recognized\";\n\t}\n\tif (\n\t\t(kind === \"ack\" || kind === \"nack\") &&\n\t\t!isSafePositiveInteger((value as { readonly ackForSeq?: unknown }).ackForSeq)\n\t) {\n\t\treturn `wireBridge: ${kind} command ackForSeq must be a positive integer`;\n\t}\n\tif (kind === \"ack-timeout\") {\n\t\tconst timeout = value as {\n\t\t\treadonly seq?: unknown;\n\t\t\treadonly attempt?: unknown;\n\t\t\treadonly observedAtMs?: unknown;\n\t\t};\n\t\tif (!isSafePositiveInteger(timeout.seq)) {\n\t\t\treturn \"wireBridge: ack-timeout command seq must be a positive integer\";\n\t\t}\n\t\tif (!isSafePositiveInteger(timeout.attempt)) {\n\t\t\treturn \"wireBridge: ack-timeout command attempt must be a positive integer\";\n\t\t}\n\t\tconst observedAtMs = timeout.observedAtMs;\n\t\tif (\n\t\t\tobservedAtMs !== undefined &&\n\t\t\t(typeof observedAtMs !== \"number\" || !Number.isFinite(observedAtMs) || observedAtMs < 0)\n\t\t) {\n\t\t\treturn \"wireBridge: ack-timeout command observedAtMs must be a non-negative finite number\";\n\t\t}\n\t}\n\treturn undefined;\n}\n\nexport function shouldTrackAck(type: WireBridgeEnvelopeType): boolean {\n\treturn type === \"start\" || type === \"data\" || type === \"close\";\n}\n\nexport function isSafePositiveInteger(value: unknown): value is number {\n\treturn Number.isSafeInteger(value) && (value as number) > 0;\n}\n\nexport function isSafeNonNegativeInteger(value: unknown): value is number {\n\treturn Number.isSafeInteger(value) && (value as number) >= 0;\n}\n\nexport function validatePayloadForType(\n\ttype: WireBridgeEnvelopeType,\n\tpayload: unknown,\n\tprefix: string,\n): string | undefined {\n\tconst record =\n\t\ttypeof payload === \"object\" && payload !== null\n\t\t\t? (payload as Record<string, unknown>)\n\t\t\t: undefined;\n\tconst kind = record === undefined ? undefined : ownData(record, \"kind\");\n\tswitch (type) {\n\t\tcase \"data\":\n\t\t\tif (kind !== \"data\" || record === undefined || !hasOwnData(record, \"value\")) {\n\t\t\t\treturn `${prefix}: data envelope requires data payload`;\n\t\t\t}\n\t\t\treturn wireAdmissiblePayloadError(ownData(record, \"value\"), `${prefix}: data payload`);\n\t\tcase \"nack\":\n\t\tcase \"error\":\n\t\t\tif (kind !== \"error\" || record === undefined || !hasOwnData(record, \"error\")) {\n\t\t\t\treturn `${prefix}: ${type} envelope requires error payload`;\n\t\t\t}\n\t\t\treturn wireAdmissiblePayloadError(ownData(record, \"error\"), `${prefix}: ${type} payload`);\n\t\tcase \"status\":\n\t\t\tif (kind !== \"status\" || record === undefined || !hasOwnData(record, \"status\")) {\n\t\t\t\treturn `${prefix}: status envelope requires status payload`;\n\t\t\t}\n\t\t\treturn wireAdmissiblePayloadError(ownData(record, \"status\"), `${prefix}: status payload`);\n\t\tcase \"close\":\n\t\t\tif (kind !== \"close\") return `${prefix}: close envelope requires close payload`;\n\t\t\tif (record === undefined || !(\"reason\" in record)) return undefined;\n\t\t\tif (!hasOwnData(record, \"reason\")) {\n\t\t\t\treturn `${prefix}: close reason must be a data property`;\n\t\t\t}\n\t\t\treturn wireAdmissiblePayloadError(ownData(record, \"reason\"), `${prefix}: close reason`);\n\t\tcase \"start\":\n\t\tcase \"ack\":\n\t\t\treturn payload === undefined\n\t\t\t\t? undefined\n\t\t\t\t: `${prefix}: ${type} envelope must not carry a payload`;\n\t}\n}\n\nexport function normalizeWireAdmissiblePayload(value: unknown, label: string): unknown {\n\tif (value instanceof Uint8Array) return Uint8Array.from(value);\n\tif (isCanonicalWireBridgeDataBody(value)) return cloneCanonicalWireBridgeDataBody(value);\n\tif (isCanonicalWireEdgeFrame(value)) return cloneCanonicalWireEdgeFrame(value);\n\tif (isCanonicalWireBridgeDataBodyLike(value) || isCanonicalWireEdgeFrameLike(value)) {\n\t\tthrow new TypeError(`${label}: invalid canonical wire DTO`);\n\t}\n\ttry {\n\t\treturn assertStrictJsonValue(value, label);\n\t} catch (error) {\n\t\tthrow new TypeError(\n\t\t\t`${label}: wire-admissible payload must be copied bytes, canonical WireEdgeFrame material, or strict JSON-like material`,\n\t\t\t{ cause: error },\n\t\t);\n\t}\n}\n\nexport function wireAdmissiblePayloadError(value: unknown, label: string): string | undefined {\n\ttry {\n\t\tnormalizeWireAdmissiblePayload(value, label);\n\t\treturn undefined;\n\t} catch (error) {\n\t\treturn errorMessage(error);\n\t}\n}\n\nexport function normalizeWireBridgePayload<T>(\n\tpayload:\n\t\t| { readonly kind: \"data\"; readonly value: T }\n\t\t| { readonly kind: \"error\"; readonly error: unknown }\n\t\t| { readonly kind: \"status\"; readonly status: unknown }\n\t\t| { readonly kind: \"close\"; readonly reason?: unknown }\n\t\t| undefined,\n\tprefix: string,\n): typeof payload {\n\tif (payload === undefined) return undefined;\n\tif (payload.kind === \"data\") {\n\t\treturn {\n\t\t\t...payload,\n\t\t\tvalue: normalizeWireAdmissiblePayload(payload.value, `${prefix}: data payload`) as T,\n\t\t};\n\t}\n\tif (payload.kind === \"error\") {\n\t\treturn {\n\t\t\t...payload,\n\t\t\terror: normalizeWireAdmissiblePayload(payload.error, `${prefix}: error payload`),\n\t\t};\n\t}\n\tif (payload.kind === \"status\") {\n\t\treturn {\n\t\t\t...payload,\n\t\t\tstatus: normalizeWireAdmissiblePayload(payload.status, `${prefix}: status payload`),\n\t\t};\n\t}\n\tif (\"reason\" in payload) {\n\t\tif (payload.reason === undefined) return { kind: \"close\" };\n\t\treturn {\n\t\t\t...payload,\n\t\t\treason: normalizeWireAdmissiblePayload(payload.reason, `${prefix}: close reason`),\n\t\t};\n\t}\n\treturn payload;\n}\n\nfunction isCanonicalWireBridgeDataBody(value: unknown): value is CanonicalWireBridgeDataBody {\n\tif (!isPlainDataRecord(value)) return false;\n\tconst kind = ownData(value, \"kind\");\n\tif (kind === \"value\") {\n\t\treturn hasOnlyKeys(value, [\"kind\", \"value\"]) && ownData(value, \"value\") instanceof Uint8Array;\n\t}\n\tif (kind === \"wire_edge\") {\n\t\treturn (\n\t\t\thasOnlyKeys(value, [\"frame\", \"kind\"]) && isCanonicalWireEdgeFrame(ownData(value, \"frame\"))\n\t\t);\n\t}\n\treturn false;\n}\n\nfunction isCanonicalWireBridgeDataBodyLike(value: unknown): boolean {\n\tif (!isPlainDataRecord(value)) return false;\n\tconst kind = ownData(value, \"kind\");\n\tif (kind === \"wire_edge\") return \"frame\" in value;\n\tif (kind !== \"value\") return false;\n\treturn \"value\" in value && ownData(value, \"value\") instanceof Uint8Array;\n}\n\nfunction isCanonicalWireEdgeFrame(value: unknown): value is CanonicalWireEdgeFrame {\n\tif (!isPlainDataRecord(value)) return false;\n\tconst kind = ownData(value, \"kind\");\n\tconst edgeId = ownData(value, \"edgeId\");\n\tconst causeId = ownData(value, \"causeId\");\n\tif (typeof edgeId !== \"string\" || edgeId.length === 0) return false;\n\tif (typeof causeId !== \"string\" || causeId.length === 0) return false;\n\tif (kind === \"dirty\") return hasOnlyKeys(value, [\"causeId\", \"edgeId\", \"kind\"]);\n\tif (kind === \"data\") {\n\t\treturn (\n\t\t\thasOnlyKeys(value, [\"causeId\", \"edgeId\", \"kind\", \"value\"]) &&\n\t\t\townData(value, \"value\") instanceof Uint8Array\n\t\t);\n\t}\n\treturn false;\n}\n\nfunction isCanonicalWireEdgeFrameLike(value: unknown): boolean {\n\tif (!isPlainDataRecord(value)) return false;\n\tconst kind = ownData(value, \"kind\");\n\tif (kind !== \"dirty\" && kind !== \"data\") return false;\n\treturn \"edgeId\" in value || \"causeId\" in value || \"value\" in value;\n}\n\nfunction isPlainDataRecord(value: unknown): value is Record<string, unknown> {\n\tif (!isRecord(value)) return false;\n\tconst proto = Object.getPrototypeOf(value);\n\tif (proto !== Object.prototype && proto !== null) return false;\n\tif (Object.getOwnPropertySymbols(value).length > 0) return false;\n\tfor (const key of Object.getOwnPropertyNames(value)) {\n\t\tconst descriptor = Object.getOwnPropertyDescriptor(value, key);\n\t\tif (descriptor === undefined || !(\"value\" in descriptor) || !descriptor.enumerable) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nfunction ownData(value: Record<string, unknown>, key: string): unknown {\n\tconst descriptor = Object.getOwnPropertyDescriptor(value, key);\n\treturn descriptor !== undefined && \"value\" in descriptor ? descriptor.value : undefined;\n}\n\nfunction hasOwnData(value: Record<string, unknown>, key: string): boolean {\n\tconst descriptor = Object.getOwnPropertyDescriptor(value, key);\n\treturn descriptor !== undefined && \"value\" in descriptor;\n}\n\nfunction hasOnlyKeys(value: Record<string, unknown>, keys: readonly string[]): boolean {\n\tconst allowed = new Set(keys);\n\tconst actual = Object.getOwnPropertyNames(value);\n\treturn actual.length === keys.length && actual.every((key) => allowed.has(key));\n}\n\nfunction cloneCanonicalWireBridgeDataBody(\n\tvalue: CanonicalWireBridgeDataBody,\n): CanonicalWireBridgeDataBody {\n\tif (value.kind === \"value\") return { kind: \"value\", value: Uint8Array.from(value.value) };\n\treturn { kind: \"wire_edge\", frame: cloneCanonicalWireEdgeFrame(value.frame) };\n}\n\nfunction cloneCanonicalWireEdgeFrame(value: CanonicalWireEdgeFrame): CanonicalWireEdgeFrame {\n\treturn {\n\t\tkind: value.kind,\n\t\tedgeId: value.edgeId,\n\t\tcauseId: value.causeId,\n\t\t...(value.value === undefined ? {} : { value: Uint8Array.from(value.value) }),\n\t};\n}\n\nexport function bridgePayloadError(payload: unknown, fallback: unknown): unknown {\n\tif (\n\t\ttypeof payload === \"object\" &&\n\t\tpayload !== null &&\n\t\t(payload as { readonly kind?: unknown }).kind === \"error\"\n\t) {\n\t\treturn (payload as { readonly error?: unknown }).error;\n\t}\n\treturn fallback;\n}\n\nexport function rethrowGraphRuntimeInvariant(error: unknown): void {\n\tconst message = errorMessage(error);\n\tif (\n\t\tmessage.includes(\"R-reentrancy\") ||\n\t\tmessage.includes(\"R-rewire\") ||\n\t\tmessage.includes(\"R-graph-domain\") ||\n\t\tmessage.includes(\"D37\") ||\n\t\tmessage.includes(\"D22\") ||\n\t\tmessage.includes(\"different graph\") ||\n\t\tmessage.includes(\"cross-graph\") ||\n\t\tmessage.includes(\"wire bridge\") ||\n\t\tmessage.includes(\"mid-fn topology mutation\") ||\n\t\tmessage.includes(\"reentrant dep mutation\") ||\n\t\tmessage.includes(\"feedback cycle\")\n\t) {\n\t\tthrow error;\n\t}\n}\n\nexport function errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n","/**\n * Graph-visible wire bridge envelope helpers (D134).\n *\n * This first slice is transport-free: commands become outbound envelope facts,\n * remote receipts enter only through the inbound fact node, and retry/ack timeout\n * state is surfaced through graph-visible attempts/status/errors nodes.\n */\n\nimport { depBatch } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type {\n\tRemoteCallBundle,\n\tRemoteCallError,\n\tRemoteCallOptions,\n\tRemoteCallRequest,\n\tRemoteCallResponse,\n\tRemoteCallResult,\n\tRemoteCallStatus,\n\tRemoteCallTimeout,\n\tWireBridgeBundle,\n\tWireBridgeEnvelope,\n\tWireBridgeEvent,\n} from \"./bridge-types.js\";\nimport {\n\tremoteMalformedResponseOperation,\n\tremoteMalformedResponseRequestId,\n\tvalidateRemoteCallRequest,\n\tvalidateRemoteCallResponse,\n} from \"./bridge-validation.js\";\n\n/** D147 remote dispatcher call helper over explicit wireBridge request/response facts. */\nexport function remoteCall<TRequest = unknown, TResponse = unknown>(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>,\n\topts: RemoteCallOptions = {},\n): RemoteCallBundle<TRequest, TResponse> {\n\tconst name = opts.name ?? \"remoteCall\";\n\tconst timeouts = graph.node<RemoteCallTimeout>([], null, {\n\t\tname: `${name}/timeouts`,\n\t\tfactory: \"remoteCallTimeouts\",\n\t\tcompleteWhenDepsComplete: false,\n\t\terrorWhenDepsError: false,\n\t});\n\tconst responses = remoteCallResponsesNode(graph, bridge.events, timeouts, name);\n\tconst results = remoteCallResultsNode(graph, responses, name);\n\tconst status = remoteCallStatusNode(graph, bridge.events, timeouts, name);\n\tconst errors = remoteCallErrorsNode(graph, timeouts, bridge.events, name);\n\treturn {\n\t\tresponses,\n\t\tresults,\n\t\tstatus,\n\t\terrors,\n\t\ttimeouts,\n\t\tcall(operation, requestId, payload, callOpts) {\n\t\t\tconst request = remoteCallRequest(operation, requestId, payload);\n\t\t\tbridge.command.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"send\",\n\t\t\t\t\t\tpayload: request,\n\t\t\t\t\t\tidempotencyKey: callOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]);\n\t\t\treturn request;\n\t\t},\n\t\ttimeout(requestId, operation, error) {\n\t\t\tconst timeout = remoteCallTimeout(requestId, operation, error);\n\t\t\ttimeouts.down([[\"DATA\", timeout]]);\n\t\t\treturn timeout;\n\t\t},\n\t};\n}\n\nfunction remoteCallRequest<TRequest>(\n\toperation: string,\n\trequestId: string,\n\tpayload: TRequest,\n): RemoteCallRequest<TRequest> {\n\tif (operation.length === 0) throw new RangeError(\"remoteCall: operation must be non-empty\");\n\tif (requestId.length === 0) throw new RangeError(\"remoteCall: requestId must be non-empty\");\n\treturn { operation, requestId, payload };\n}\n\nfunction remoteCallTimeout(\n\trequestId: string,\n\toperation: string | undefined,\n\terror: string,\n): RemoteCallTimeout {\n\tif (requestId.length === 0)\n\t\tthrow new RangeError(\"remoteCall: timeout requestId must be non-empty\");\n\tif (error.length === 0) throw new RangeError(\"remoteCall: timeout error must be non-empty\");\n\treturn { ...(operation === undefined ? {} : { operation }), requestId, error };\n}\n\ninterface RemotePendingRequest {\n\toperation: string;\n\trequestId: string;\n\tseq: number;\n}\n\ninterface RemotePendingState {\n\trequestIds: Set<string>;\n\tbySeq: Map<number, RemotePendingRequest>;\n}\n\nfunction remotePendingState(): RemotePendingState {\n\treturn { requestIds: new Set(), bySeq: new Map() };\n}\n\nfunction remotePendingContains(state: RemotePendingState, requestId: string): boolean {\n\treturn state.requestIds.has(requestId);\n}\n\nfunction remotePendingDuplicate(state: RemotePendingState, request: RemotePendingRequest): boolean {\n\tconst current = remotePendingTakeBySeqPreview(state, request.seq);\n\treturn current?.requestId !== request.requestId && state.requestIds.has(request.requestId);\n}\n\nfunction remotePendingTakeBySeqPreview(\n\tstate: RemotePendingState,\n\tseq: number,\n): RemotePendingRequest | undefined {\n\treturn state.bySeq.get(seq);\n}\n\nfunction remotePendingPeekByRequestId(\n\tstate: RemotePendingState,\n\trequestId: string,\n): RemotePendingRequest | undefined {\n\tfor (const request of state.bySeq.values()) {\n\t\tif (request.requestId === requestId) return request;\n\t}\n\treturn undefined;\n}\n\nfunction remotePendingInsert(state: RemotePendingState, request: RemotePendingRequest): void {\n\tconst existingBySeq = state.bySeq.get(request.seq);\n\tif (existingBySeq !== undefined) {\n\t\tstate.requestIds.delete(existingBySeq.requestId);\n\t}\n\tfor (const [seq, pending] of state.bySeq) {\n\t\tif (pending.requestId === request.requestId && seq !== request.seq) {\n\t\t\tstate.bySeq.delete(seq);\n\t\t\tbreak;\n\t\t}\n\t}\n\tstate.requestIds.add(request.requestId);\n\tstate.bySeq.set(request.seq, request);\n}\n\nfunction remotePendingTakeByRequestId(\n\tstate: RemotePendingState,\n\trequestId: string,\n): RemotePendingRequest | undefined {\n\tif (!state.requestIds.delete(requestId)) return undefined;\n\tlet seq: number | undefined;\n\tlet found: RemotePendingRequest | undefined;\n\tfor (const [candidateSeq, request] of state.bySeq) {\n\t\tif (request.requestId === requestId) {\n\t\t\tseq = candidateSeq;\n\t\t\tfound = request;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (seq !== undefined) state.bySeq.delete(seq);\n\treturn found;\n}\n\nfunction remotePendingTakeBySeq(\n\tstate: RemotePendingState,\n\tseq: number,\n): RemotePendingRequest | undefined {\n\tconst request = state.bySeq.get(seq);\n\tif (request === undefined) return undefined;\n\tstate.bySeq.delete(seq);\n\tstate.requestIds.delete(request.requestId);\n\treturn request;\n}\n\nfunction remotePendingFromReceipt<T>(\n\tstate: RemotePendingState,\n\tenvelope: WireBridgeEnvelope<RemoteCallRequest<T>>,\n): RemotePendingRequest | undefined {\n\tconst bySeq = remotePendingTakeBySeq(state, envelope.metadata.seq);\n\tif (bySeq !== undefined) return bySeq;\n\tconst fallback = pendingRequestFromEnvelope(envelope);\n\tif (fallback === undefined || remotePendingContains(state, fallback.requestId)) {\n\t\treturn undefined;\n\t}\n\treturn fallback;\n}\n\nfunction pendingRequestFromEnvelope<T>(\n\tenvelope: WireBridgeEnvelope<RemoteCallRequest<T>>,\n): RemotePendingRequest | undefined {\n\tif (envelope.payload?.kind !== \"data\") return undefined;\n\tconst request = validateRemoteCallRequest(envelope.payload.value);\n\tif (request === undefined) return undefined;\n\treturn {\n\t\toperation: request.operation,\n\t\trequestId: request.requestId,\n\t\tseq: envelope.metadata.seq,\n\t};\n}\n\nfunction remoteCallResponseRequestId<T>(response: RemoteCallResponse<T>): string {\n\treturn response.requestId;\n}\n\nfunction remoteCallResponseIsTerminal<T>(response: RemoteCallResponse<T>): boolean {\n\treturn response.kind === \"result\" || response.kind === \"error\";\n}\n\nfunction remoteCallResponseOperation<T>(response: RemoteCallResponse<T>): string {\n\treturn response.operation;\n}\n\nfunction remoteCallResponseMatchesPending<T>(\n\tresponse: RemoteCallResponse<T>,\n\trequest: RemotePendingRequest,\n): boolean {\n\treturn remoteCallResponseOperation(response) === request.operation;\n}\n\nfunction remoteCallResponsesNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>>,\n\ttimeouts: Node<RemoteCallTimeout>,\n\tname: string,\n): Node<RemoteCallResponse<TResponse>> {\n\treturn graph.node<RemoteCallResponse<TResponse>>(\n\t\t[events, timeouts],\n\t\t(ctx) => {\n\t\t\ttype State = {\n\t\t\t\tpending: RemotePendingState;\n\t\t\t};\n\t\t\tconst state = ctx.state.get<State>() ?? {\n\t\t\t\tpending: remotePendingState(),\n\t\t\t};\n\t\t\tconst ready: RemoteCallResponse<TResponse>[] = [];\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst request = pendingRequestFromEnvelope(event.envelope);\n\t\t\t\t\tif (request === undefined) continue;\n\t\t\t\t\tif (remotePendingDuplicate(state.pending, request)) continue;\n\t\t\t\t\tremotePendingInsert(state.pending, request);\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.payload?.kind === \"data\") {\n\t\t\t\t\tconst response = validateRemoteCallResponse<TResponse>(event.envelope.payload.value);\n\t\t\t\t\tif (response === undefined) {\n\t\t\t\t\t\tconst requestId = remoteMalformedResponseRequestId(event.envelope.payload.value);\n\t\t\t\t\t\tconst operation = remoteMalformedResponseOperation(event.envelope.payload.value);\n\t\t\t\t\t\tconst request =\n\t\t\t\t\t\t\trequestId === undefined\n\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t: remotePendingPeekByRequestId(state.pending, requestId);\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\trequest !== undefined &&\n\t\t\t\t\t\t\toperation !== undefined &&\n\t\t\t\t\t\t\toperation === request.operation\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, request.requestId);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tconst requestId = remoteCallResponseRequestId(response);\n\t\t\t\t\tconst request = remotePendingPeekByRequestId(state.pending, requestId);\n\t\t\t\t\tif (request !== undefined && remoteCallResponseMatchesPending(response, request)) {\n\t\t\t\t\t\tif (remoteCallResponseIsTerminal(response)) {\n\t\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, requestId);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tready.push(response);\n\t\t\t\t\t}\n\t\t\t\t} else if (event.kind === \"nack\") {\n\t\t\t\t\tremotePendingFromReceipt(state.pending, event.outbound);\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tremotePendingTakeBySeq(state.pending, event.seq);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst timeout = raw as RemoteCallTimeout;\n\t\t\t\tremotePendingTakeByRequestId(state.pending, timeout.requestId);\n\t\t\t}\n\t\t\tctx.state.set(state);\n\t\t\tfor (const response of ready) ctx.down([[\"DATA\", response]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/responses`,\n\t\t\tfactory: \"remoteCallResponses\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallResultsNode<TResponse>(\n\tgraph: Graph,\n\tresponses: Node<RemoteCallResponse<TResponse>>,\n\tname: string,\n): Node<RemoteCallResult<TResponse>> {\n\treturn graph.node<RemoteCallResult<TResponse>>(\n\t\t[responses],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst response = raw as RemoteCallResponse<TResponse>;\n\t\t\t\tif (response.kind === \"result\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\t\tpayload: response.payload,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/results`, factory: \"remoteCallResults\", completeWhenDepsComplete: false },\n\t);\n}\n\nfunction remoteCallStatusNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>>,\n\ttimeouts: Node<RemoteCallTimeout>,\n\tname: string,\n): Node<RemoteCallStatus> {\n\treturn graph.node<RemoteCallStatus>(\n\t\t[events, timeouts],\n\t\t(ctx) => {\n\t\t\ttype State = { status: RemoteCallStatus; pending: RemotePendingState };\n\t\t\tconst state =\n\t\t\t\tctx.state.get<State>() ??\n\t\t\t\t({\n\t\t\t\t\tstatus: { state: \"idle\", pending: 0, completed: 0, errors: 0, timeouts: 0 },\n\t\t\t\t\tpending: remotePendingState(),\n\t\t\t\t} satisfies State);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst request = pendingRequestFromEnvelope(event.envelope);\n\t\t\t\t\tif (request !== undefined) {\n\t\t\t\t\t\tif (remotePendingDuplicate(state.pending, request)) {\n\t\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tremotePendingInsert(state.pending, request);\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"requested\",\n\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t} else if (\n\t\t\t\t\tevent.kind === \"invalid\" ||\n\t\t\t\t\tevent.kind === \"session-mismatch\" ||\n\t\t\t\t\tevent.kind === \"out-of-order\" ||\n\t\t\t\t\tevent.kind === \"late-receipt\"\n\t\t\t\t) {\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"bridge-errored\",\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"nack\") {\n\t\t\t\t\tconst request = remotePendingFromReceipt(state.pending, event.outbound);\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"bridge-errored\",\n\t\t\t\t\t\t...(request === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { operation: request.operation, requestId: request.requestId }),\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tconst request = remotePendingTakeBySeq(state.pending, event.seq);\n\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\tstate: \"bridge-errored\",\n\t\t\t\t\t\t...(request === undefined\n\t\t\t\t\t\t\t? {}\n\t\t\t\t\t\t\t: { operation: request.operation, requestId: request.requestId }),\n\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.payload?.kind === \"data\") {\n\t\t\t\t\tconst response = validateRemoteCallResponse<TResponse>(event.envelope.payload.value);\n\t\t\t\t\tif (response === undefined) {\n\t\t\t\t\t\tconst requestId = remoteMalformedResponseRequestId(event.envelope.payload.value);\n\t\t\t\t\t\tconst operation = remoteMalformedResponseOperation(event.envelope.payload.value);\n\t\t\t\t\t\tconst request =\n\t\t\t\t\t\t\trequestId === undefined || operation === undefined\n\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t: remotePendingPeekByRequestId(state.pending, requestId);\n\t\t\t\t\t\tconst matchedRequest =\n\t\t\t\t\t\t\trequest !== undefined && request.operation === operation ? request : undefined;\n\t\t\t\t\t\tif (matchedRequest === undefined) continue;\n\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, matchedRequest.requestId);\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\toperation: matchedRequest.operation,\n\t\t\t\t\t\t\trequestId: matchedRequest.requestId,\n\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tconst request = remotePendingPeekByRequestId(state.pending, response.requestId);\n\t\t\t\t\tif (request === undefined) {\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (!remoteCallResponseMatchesPending(response, request)) {\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tif (response.kind === \"result\") {\n\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, request.requestId);\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"responded\",\n\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\tcompleted: state.status.completed + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t} else if (response.kind === \"error\") {\n\t\t\t\t\t\tremotePendingTakeByRequestId(state.pending, request.requestId);\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstate.status = {\n\t\t\t\t\t\t\t...state.status,\n\t\t\t\t\t\t\tstate: \"requested\",\n\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t};\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst timeout = raw as RemoteCallTimeout;\n\t\t\t\tremotePendingTakeByRequestId(state.pending, timeout.requestId);\n\t\t\t\tstate.status = {\n\t\t\t\t\t...state.status,\n\t\t\t\t\tstate: \"timed-out\",\n\t\t\t\t\toperation: timeout.operation,\n\t\t\t\t\trequestId: timeout.requestId,\n\t\t\t\t\terrors: state.status.errors + 1,\n\t\t\t\t\ttimeouts: state.status.timeouts + 1,\n\t\t\t\t};\n\t\t\t}\n\t\t\tstate.status = { ...state.status, pending: state.pending.requestIds.size };\n\t\t\tctx.state.set(state);\n\t\t\tctx.down([[\"DATA\", state.status]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/status`,\n\t\t\tfactory: \"remoteCallStatus\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallErrorsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\ttimeouts: Node<RemoteCallTimeout>,\n\tevents: Node<WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>>,\n\tname: string,\n): Node<RemoteCallError> {\n\treturn graph.node<RemoteCallError>(\n\t\t[timeouts, events],\n\t\t(ctx) => {\n\t\t\tconst pending = ctx.state.get<RemotePendingState>() ?? remotePendingState();\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst timeout = raw as RemoteCallTimeout;\n\t\t\t\tremotePendingTakeByRequestId(pending, timeout.requestId);\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{ operation: timeout.operation, requestId: timeout.requestId, error: timeout.error },\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<\n\t\t\t\t\tRemoteCallRequest<TRequest>,\n\t\t\t\t\tRemoteCallResponse<TResponse>\n\t\t\t\t>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst request = pendingRequestFromEnvelope(event.envelope);\n\t\t\t\t\tif (request !== undefined) {\n\t\t\t\t\t\tif (remotePendingDuplicate(pending, request)) {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\t\t\terror: `remoteCall: duplicate in-flight requestId '${request.requestId}'`,\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tremotePendingInsert(pending, request);\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (event.kind === \"inbound\" && event.envelope.payload?.kind === \"data\") {\n\t\t\t\t\tconst response = validateRemoteCallResponse<TResponse>(event.envelope.payload.value);\n\t\t\t\t\tif (response === undefined) {\n\t\t\t\t\t\tconst requestId = remoteMalformedResponseRequestId(event.envelope.payload.value);\n\t\t\t\t\t\tconst operation = remoteMalformedResponseOperation(event.envelope.payload.value);\n\t\t\t\t\t\tconst request =\n\t\t\t\t\t\t\trequestId === undefined || operation === undefined\n\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t: remotePendingPeekByRequestId(pending, requestId);\n\t\t\t\t\t\tif (request === undefined || request.operation !== operation) continue;\n\t\t\t\t\t\tremotePendingTakeByRequestId(pending, request.requestId);\n\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t...(operation === undefined ? {} : { operation }),\n\t\t\t\t\t\t\t\t\t...(requestId === undefined ? {} : { requestId }),\n\t\t\t\t\t\t\t\t\terror: \"remoteCall: response payload is malformed\",\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tconst request = remotePendingPeekByRequestId(pending, response.requestId);\n\t\t\t\t\t\tif (request === undefined) {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\t\t\t\terror: \"remoteCall: orphan response for unknown or completed request\",\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t} else if (!remoteCallResponseMatchesPending(response, request)) {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\t\t\terror: `remoteCall: response operation '${response.operation}' did not match pending operation '${request.operation}'`,\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t} else if (response.kind === \"error\") {\n\t\t\t\t\t\t\tremotePendingTakeByRequestId(pending, request.requestId);\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\toperation: response.operation,\n\t\t\t\t\t\t\t\t\t\trequestId: response.requestId,\n\t\t\t\t\t\t\t\t\t\terror: response.error,\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t} else if (response.kind === \"result\") {\n\t\t\t\t\t\t\tremotePendingTakeByRequestId(pending, request.requestId);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (event.kind === \"nack\") {\n\t\t\t\t\tconst request = remotePendingFromReceipt(pending, event.outbound);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: request?.operation,\n\t\t\t\t\t\t\t\trequestId: request?.requestId,\n\t\t\t\t\t\t\t\terror: String(event.error),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tconst request = remotePendingTakeBySeq(pending, event.seq);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\toperation: request?.operation,\n\t\t\t\t\t\t\t\trequestId: request?.requestId,\n\t\t\t\t\t\t\t\terror: String(event.error),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", { error: event.error }]]);\n\t\t\t\t} else if (\n\t\t\t\t\tevent.kind === \"session-mismatch\" ||\n\t\t\t\t\tevent.kind === \"out-of-order\" ||\n\t\t\t\t\tevent.kind === \"late-receipt\"\n\t\t\t\t) {\n\t\t\t\t\tctx.down([[\"DATA\", { error: remoteCallBridgeErrorMessage(event) }]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(pending);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/errors`,\n\t\t\tfactory: \"remoteCallErrors\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallBridgeErrorMessage<TRequest, TResponse>(\n\tevent: WireBridgeEvent<RemoteCallRequest<TRequest>, RemoteCallResponse<TResponse>>,\n): string {\n\tif (event.kind === \"session-mismatch\") {\n\t\treturn `remoteCall: inbound session ${event.actual} did not match expected ${event.expected}`;\n\t}\n\tif (event.kind === \"out-of-order\") {\n\t\treturn `remoteCall: inbound seq ${event.seq} arrived before expected seq ${event.expected}`;\n\t}\n\tif (event.kind === \"late-receipt\") {\n\t\treturn `remoteCall: late ${event.receipt} for unknown or completed ackForSeq ${event.ackForSeq}`;\n\t}\n\treturn \"remoteCall: bridge error\";\n}\n","/**\n * Graph-visible wire bridge envelope helpers (D134).\n *\n * This first slice is transport-free: commands become outbound envelope facts,\n * remote receipts enter only through the inbound fact node, and retry/ack timeout\n * state is surfaced through graph-visible attempts/status/errors nodes.\n */\n\nimport { depBatch } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport { errorPayload, type Wave } from \"../protocol/messages.js\";\nimport type {\n\tWireBridgeAck,\n\tWireBridgeAttempt,\n\tWireBridgeEnvelope,\n\tWireBridgeEvent,\n\tWireBridgeInvalidIngress,\n\tWireBridgeNack,\n\tWireBridgeStatus,\n} from \"./bridge-types.js\";\nimport { bridgePayloadError, shouldTrackAck } from \"./bridge-validation.js\";\n\nexport function projectOutbound<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeEnvelope<TOutbound>> {\n\treturn graph.node<WireBridgeEnvelope<TOutbound>>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"outbound\") ctx.down([[\"DATA\", event.envelope]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/outbound`, factory: \"wireBridgeOutbound\" },\n\t);\n}\n\nexport function projectAcks<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeAck> {\n\treturn graph.node<WireBridgeAck>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"ack\") {\n\t\t\t\t\tctx.down([[\"DATA\", { ackForSeq: event.ackForSeq, envelope: event.envelope }]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/acks`, factory: \"wireBridgeAcks\" },\n\t);\n}\n\nexport function projectNacks<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeNack> {\n\treturn graph.node<WireBridgeNack>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"nack\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\"DATA\", { ackForSeq: event.ackForSeq, envelope: event.envelope, error: event.error }],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/nacks`, factory: \"wireBridgeNacks\" },\n\t);\n}\n\nexport function projectStatus<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n\tsessionId: string,\n): Node<WireBridgeStatus> {\n\treturn graph.node<WireBridgeStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet next =\n\t\t\t\tctx.state.get<WireBridgeStatus>() ??\n\t\t\t\t({\n\t\t\t\t\tsessionId,\n\t\t\t\t\tstate: \"idle\",\n\t\t\t\t\tcursor: 0,\n\t\t\t\t\tnextSeq: 1,\n\t\t\t\t\tpending: 0,\n\t\t\t\t\tattempts: 0,\n\t\t\t\t\tacked: 0,\n\t\t\t\t\tnacked: 0,\n\t\t\t\t\terrors: 0,\n\t\t\t\t} satisfies WireBridgeStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"outbound\") {\n\t\t\t\t\tconst { seq, attempt } = event.envelope.metadata;\n\t\t\t\t\tconst trackAck = shouldTrackAck(event.envelope.type);\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate:\n\t\t\t\t\t\t\tevent.envelope.type === \"start\"\n\t\t\t\t\t\t\t\t? \"started\"\n\t\t\t\t\t\t\t\t: event.envelope.type === \"close\"\n\t\t\t\t\t\t\t\t\t? \"closed\"\n\t\t\t\t\t\t\t\t\t: \"open\",\n\t\t\t\t\t\tnextSeq: Math.max(next.nextSeq, seq + 1),\n\t\t\t\t\t\tpending:\n\t\t\t\t\t\t\tevent.envelope.type === \"close\"\n\t\t\t\t\t\t\t\t? 1\n\t\t\t\t\t\t\t\t: trackAck && attempt === 1\n\t\t\t\t\t\t\t\t\t? next.pending + 1\n\t\t\t\t\t\t\t\t\t: next.pending,\n\t\t\t\t\t\tattempts: trackAck ? next.attempts + 1 : next.attempts,\n\t\t\t\t\t\tlastSeq: seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"ack\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: event.outbound.type === \"close\" ? \"closed\" : \"open\",\n\t\t\t\t\t\tpending: Math.max(0, next.pending - 1),\n\t\t\t\t\t\tacked: next.acked + 1,\n\t\t\t\t\t\tlastSeq: event.envelope.metadata.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"nack\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\tpending: Math.max(0, next.pending - 1),\n\t\t\t\t\t\tnacked: next.nacked + 1,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastSeq: event.envelope.metadata.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"retry\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"waiting\",\n\t\t\t\t\t\tlastSeq: event.seq,\n\t\t\t\t\t\tlastDelayMs: event.delayMs,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"exhausted\",\n\t\t\t\t\t\tpending: Math.max(0, next.pending - 1),\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastSeq: event.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"cursor\") {\n\t\t\t\t\tnext = { ...next, cursor: event.cursor };\n\t\t\t\t} else if (event.kind === \"out-of-order\") {\n\t\t\t\t\tnext = { ...next, state: \"errored\", errors: next.errors + 1, lastSeq: event.seq };\n\t\t\t\t} else if (event.kind === \"session-mismatch\") {\n\t\t\t\t\tnext = { ...next, state: \"errored\", errors: next.errors + 1 };\n\t\t\t\t} else if (event.kind === \"late-receipt\" || event.kind === \"invalid\") {\n\t\t\t\t\tnext = { ...next, state: \"errored\", errors: next.errors + 1 };\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.type === \"error\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastSeq: event.envelope.metadata.seq,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.type === \"close\") {\n\t\t\t\t\tnext = { ...next, state: \"closed\", lastSeq: event.envelope.metadata.seq };\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"wireBridgeStatus\" },\n\t);\n}\n\nexport function projectErrors<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<unknown> {\n\treturn graph.node<unknown>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"nack\") ctx.down([[\"DATA\", event.error]]);\n\t\t\t\telse if (event.kind === \"exhausted\") ctx.down([[\"DATA\", event.error]]);\n\t\t\t\telse if (event.kind === \"out-of-order\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t`${name}: inbound seq ${event.seq} arrived before expected seq ${event.expected}`,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"inbound\" && event.envelope.type === \"error\") {\n\t\t\t\t\tctx.down([[\"DATA\", bridgePayloadError(event.envelope.payload, \"remote error envelope\")]]);\n\t\t\t\t} else if (event.kind === \"session-mismatch\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t`${name}: inbound session ${event.actual} did not match expected ${event.expected}`,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"late-receipt\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t`${name}: late ${event.receipt} for unknown or completed ackForSeq ${event.ackForSeq}`,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", event.error]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"wireBridgeErrors\" },\n\t);\n}\n\nexport function projectCursor<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<number> {\n\treturn graph.node<number>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"cursor\") ctx.down([[\"DATA\", event.cursor]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/cursor`, factory: \"wireBridgeCursor\" },\n\t);\n}\n\nexport function projectAttempts<TOutbound, TInbound>(\n\tgraph: Graph,\n\tevents: Node<WireBridgeEvent<TOutbound, TInbound>>,\n\tname: string,\n): Node<WireBridgeAttempt> {\n\treturn graph.node<WireBridgeAttempt>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeEvent<TOutbound, TInbound>;\n\t\t\t\tif (event.kind === \"outbound\" && shouldTrackAck(event.envelope.type)) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tseq: event.envelope.metadata.seq,\n\t\t\t\t\t\t\t\tattempt: event.envelope.metadata.attempt,\n\t\t\t\t\t\t\t\tmaxAttempts: event.envelope.metadata.maxAttempts,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/attempts`, factory: \"wireBridgeAttempts\" },\n\t);\n}\n\nexport function guardedInboundNode<TInbound>(\n\tnode: Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>,\n\tsessionId: string,\n): Node<WireBridgeEnvelope<TInbound>> {\n\treturn new Proxy(node, {\n\t\tget(target, property) {\n\t\t\tif (property === \"down\") {\n\t\t\t\treturn (msgs: Wave) => target.down(guardInboundWave(msgs, sessionId));\n\t\t\t}\n\t\t\tconst value = Reflect.get(target, property, target);\n\t\t\treturn typeof value === \"function\" ? value.bind(target) : value;\n\t\t},\n\t}) as Node<WireBridgeEnvelope<TInbound>>;\n}\n\nexport function guardInboundWave(msgs: Wave, sessionId: string): Wave {\n\treturn msgs.map((msg) => {\n\t\tif (msg[0] === \"DATA\") return msg;\n\t\tif (msg[0] === \"ERROR\") {\n\t\t\treturn [\n\t\t\t\t\"DATA\",\n\t\t\t\tinvalidIngress(\n\t\t\t\t\t`${sessionId}: inbound protocol ERROR ${String(\n\t\t\t\t\t\terrorPayload(msg[1]),\n\t\t\t\t\t)} is local misuse; remote errors must arrive as DATA envelope facts`,\n\t\t\t\t),\n\t\t\t];\n\t\t}\n\t\tif (msg[0] === \"COMPLETE\") {\n\t\t\treturn [\n\t\t\t\t\"DATA\",\n\t\t\t\tinvalidIngress(\n\t\t\t\t\t`${sessionId}: inbound protocol COMPLETE is local misuse; remote completion must arrive as a DATA envelope fact`,\n\t\t\t\t),\n\t\t\t];\n\t\t}\n\t\treturn [\n\t\t\t\"DATA\",\n\t\t\tinvalidIngress(\n\t\t\t\t`${sessionId}: inbound port accepts DATA envelope facts only; ${msg[0]} is local protocol traffic`,\n\t\t\t),\n\t\t];\n\t});\n}\n\nexport function invalidIngress(error: string): WireBridgeInvalidIngress {\n\treturn { __wireBridgeInvalidIngress: true, error };\n}\n\nexport function isInvalidIngress(value: unknown): value is WireBridgeInvalidIngress {\n\treturn (\n\t\ttypeof value === \"object\" &&\n\t\tvalue !== null &&\n\t\t(value as WireBridgeInvalidIngress).__wireBridgeInvalidIngress === true &&\n\t\ttypeof (value as WireBridgeInvalidIngress).error === \"string\"\n\t);\n}\n","/**\n * Graph-visible wire bridge envelope helpers (D134).\n *\n * This first slice is transport-free: commands become outbound envelope facts,\n * remote receipts enter only through the inbound fact node, and retry/ack timeout\n * state is surfaced through graph-visible attempts/status/errors nodes.\n */\n\nimport { depBatch } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type {\n\tRemoteCallError,\n\tRemoteCallRequest,\n\tRemoteCallResponse,\n\tRemoteResponderEvent,\n\tRemoteResponderHandler,\n\tRemoteResponderHandlerDefinition,\n\tRemoteResponderStatus,\n\tWireBridgeCommand,\n\tWireBridgeEnvelope,\n\tWireBridgeInvalidIngress,\n} from \"./bridge-types.js\";\nimport {\n\terrorMessage,\n\tisThenable,\n\trethrowGraphRuntimeInvariant,\n\tvalidateInboundEnvelope,\n\tvalidateRemoteCallRequest,\n} from \"./bridge-validation.js\";\n\nexport function normalizeRemoteHandlers<TRequest, TResponse>(\n\thandlers: readonly RemoteResponderHandlerDefinition<TRequest, TResponse>[],\n): Map<string, RemoteResponderHandler<TRequest, TResponse>> {\n\tconst out = new Map<string, RemoteResponderHandler<TRequest, TResponse>>();\n\tfor (const handler of handlers) {\n\t\tif (handler.operation.length === 0) {\n\t\t\tthrow new RangeError(\"remoteResponder: operation must be non-empty\");\n\t\t}\n\t\tif (out.has(handler.operation)) {\n\t\t\tthrow new RangeError(`remoteResponder: duplicate operation '${handler.operation}'`);\n\t\t}\n\t\tout.set(handler.operation, handler.handle);\n\t}\n\treturn out;\n}\n\ninterface RemoteResponderCursor {\n\tcursor: number;\n\tremoteCursor: number;\n}\n\ntype RemoteResponderInbound<T> =\n\t| { readonly kind: \"request\"; readonly request: RemoteCallRequest<T>; readonly seq: number }\n\t| { readonly kind: \"consumed\" }\n\t| { readonly kind: \"invalid\"; readonly error: string };\n\nfunction reduceRemoteResponderInbound<T>(\n\tcursor: RemoteResponderCursor,\n\tenvelope: WireBridgeEnvelope<RemoteCallRequest<T>>,\n\texpectedSessionId: string,\n): RemoteResponderInbound<T> {\n\tconst envelopeError = validateInboundEnvelope(envelope);\n\tif (envelopeError !== undefined) {\n\t\treturn { kind: \"invalid\", error: envelopeError };\n\t}\n\tif (envelope.sessionId !== expectedSessionId) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `remoteResponder: inbound session ${envelope.sessionId} did not match expected ${expectedSessionId}`,\n\t\t};\n\t}\n\tconst seq = envelope.metadata.seq;\n\tconst expected = cursor.cursor + 1;\n\tif (seq <= cursor.cursor) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `remoteResponder: duplicate request seq ${seq} at cursor ${cursor.cursor}`,\n\t\t};\n\t}\n\tif (seq > expected) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `remoteResponder: out-of-order request seq ${seq}, expected ${expected}`,\n\t\t};\n\t}\n\tif (envelope.metadata.cursor < cursor.remoteCursor) {\n\t\treturn {\n\t\t\tkind: \"invalid\",\n\t\t\terror: `${envelope.sessionId}: remoteResponder inbound cursor ${envelope.metadata.cursor} regressed below ${cursor.remoteCursor}`,\n\t\t};\n\t}\n\tcursor.cursor = seq;\n\tcursor.remoteCursor = envelope.metadata.cursor;\n\tif (envelope.type !== \"data\") return { kind: \"consumed\" };\n\tif (envelope.payload?.kind !== \"data\") {\n\t\treturn { kind: \"invalid\", error: \"remoteResponder: request envelope must carry request DATA\" };\n\t}\n\tconst request = validateRemoteCallRequest<T>(envelope.payload.value);\n\tif (request === undefined) {\n\t\treturn { kind: \"invalid\", error: \"remoteResponder: request payload is malformed\" };\n\t}\n\treturn { kind: \"request\", request, seq };\n}\n\nexport function remoteResponderEventsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tinbound: Node<WireBridgeEnvelope<RemoteCallRequest<TRequest>> | WireBridgeInvalidIngress>,\n\tname: string,\n\texpectedSessionId: string,\n\thandlers: Map<string, RemoteResponderHandler<TRequest, TResponse>>,\n\trejectUnknown: boolean,\n): Node<RemoteResponderEvent<TRequest, TResponse>> {\n\treturn graph.node<RemoteResponderEvent<TRequest, TResponse>>(\n\t\t[inbound],\n\t\t(ctx) => {\n\t\t\tconst cursor = ctx.state.get<RemoteResponderCursor>() ?? { cursor: 0, remoteCursor: 0 };\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst envelope = raw as WireBridgeEnvelope<RemoteCallRequest<TRequest>>;\n\t\t\t\tconst received = reduceRemoteResponderInbound(cursor, envelope, expectedSessionId);\n\t\t\t\tif (received.kind === \"consumed\") continue;\n\t\t\t\tif (received.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: received.error }]]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst { request, seq } = received;\n\t\t\t\tctx.down([[\"DATA\", { kind: \"request\", request, seq }]]);\n\t\t\t\tconst handler = handlers.get(request.operation);\n\t\t\t\tif (handler === undefined) {\n\t\t\t\t\tif (!rejectUnknown) continue;\n\t\t\t\t\tconst error = `remoteResponder: unknown operation '${request.operation}'`;\n\t\t\t\t\tconst response = remoteCallErrorResponse(request, error);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\terror,\n\t\t\t\t\t\t\t\tcommand: { kind: \"send\", payload: response, requestId: request.requestId },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\ttry {\n\t\t\t\t\tconst payload = handler(request);\n\t\t\t\t\tif (isThenable(payload)) {\n\t\t\t\t\t\tthrow new Error(\"remoteResponder: async handler results require a later adapter shape\");\n\t\t\t\t\t}\n\t\t\t\t\tconst response = {\n\t\t\t\t\t\tkind: \"result\",\n\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\tpayload,\n\t\t\t\t\t} satisfies RemoteCallResponse<TResponse>;\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"response\",\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\tcommand: { kind: \"send\", payload: response, requestId: request.requestId },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} catch (error) {\n\t\t\t\t\trethrowGraphRuntimeInvariant(error);\n\t\t\t\t\tconst message = errorMessage(error);\n\t\t\t\t\tconst response = remoteCallErrorResponse(request, message);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\t\trequestId: request.requestId,\n\t\t\t\t\t\t\t\toperation: request.operation,\n\t\t\t\t\t\t\t\terror: message,\n\t\t\t\t\t\t\t\tcommand: { kind: \"send\", payload: response, requestId: request.requestId },\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(cursor);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/events`,\n\t\t\tfactory: \"remoteResponderEvents\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction remoteCallErrorResponse<TRequest, TResponse>(\n\trequest: RemoteCallRequest<TRequest>,\n\terror: string,\n): RemoteCallResponse<TResponse> {\n\treturn {\n\t\tkind: \"error\",\n\t\toperation: request.operation,\n\t\trequestId: request.requestId,\n\t\terror,\n\t};\n}\n\nexport function remoteResponderResponseCommandsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<WireBridgeCommand<RemoteCallResponse<TResponse>>> {\n\treturn graph.node<WireBridgeCommand<RemoteCallResponse<TResponse>>>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (\n\t\t\t\t\t(event.kind === \"response\" || event.kind === \"rejected\") &&\n\t\t\t\t\tevent.command !== undefined\n\t\t\t\t) {\n\t\t\t\t\tctx.down([[\"DATA\", event.command]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/responseCommands`,\n\t\t\tfactory: \"remoteResponderResponseCommands\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nexport function remoteResponderRequestsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<RemoteCallRequest<TRequest>> {\n\treturn graph.node<RemoteCallRequest<TRequest>>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (event.kind === \"request\") ctx.down([[\"DATA\", event.request]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/requests`,\n\t\t\tfactory: \"remoteResponderRequests\",\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t},\n\t);\n}\n\nexport function remoteResponderStatusNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<RemoteResponderStatus> {\n\treturn graph.node<RemoteResponderStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet status =\n\t\t\t\tctx.state.get<RemoteResponderStatus>() ??\n\t\t\t\t({ state: \"idle\", handled: 0, rejected: 0, errors: 0 } satisfies RemoteResponderStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (event.kind === \"response\") {\n\t\t\t\t\tstatus = {\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tstate: \"responded\",\n\t\t\t\t\t\toperation: event.operation,\n\t\t\t\t\t\trequestId: event.requestId,\n\t\t\t\t\t\thandled: status.handled + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"rejected\") {\n\t\t\t\t\tstatus = {\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tstate: \"rejected\",\n\t\t\t\t\t\toperation: event.operation,\n\t\t\t\t\t\trequestId: event.requestId,\n\t\t\t\t\t\trejected: status.rejected + 1,\n\t\t\t\t\t\terrors: status.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tstatus = { ...status, state: \"errored\", errors: status.errors + 1 };\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(status);\n\t\t\tctx.down([[\"DATA\", status]]);\n\t\t},\n\t\t{\n\t\t\tname: `${name}/status`,\n\t\t\tfactory: \"remoteResponderStatus\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nexport function remoteResponderErrorsNode<TRequest, TResponse>(\n\tgraph: Graph,\n\tevents: Node<RemoteResponderEvent<TRequest, TResponse>>,\n\tname: string,\n): Node<RemoteCallError> {\n\treturn graph.node<RemoteCallError>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as RemoteResponderEvent<TRequest, TResponse>;\n\t\t\t\tif (event.kind === \"rejected\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{ operation: event.operation, requestId: event.requestId, error: event.error },\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"invalid\") {\n\t\t\t\t\tctx.down([[\"DATA\", { error: event.error }]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"remoteResponderErrors\", completeWhenDepsComplete: false },\n\t);\n}\n","/**\n * Graph-visible wire bridge envelope helpers (D134).\n *\n * This first slice is transport-free: commands become outbound envelope facts,\n * remote receipts enter only through the inbound fact node, and retry/ack timeout\n * state is surfaced through graph-visible attempts/status/errors nodes.\n */\n\nimport { type Ctx, depBatch } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport {\n\tnextRetryDelayMs,\n\ttype RetryPolicy,\n\tretryPolicy,\n\tshouldRetry,\n} from \"../graph/resilience.js\";\nimport type { Node } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport type {\n\tCanonicalWireBridgeDataBody,\n\tCanonicalWireBridgeEnvelope,\n\tCanonicalWireBridgeMetadata,\n\tCanonicalWireBridgePayload,\n\tCanonicalWireEdgeFrame,\n} from \"./bridge-protobuf.js\";\nimport {\n\tCanonicalProtobufError,\n\tdecodeCanonicalWireBridgeEnvelope,\n\tencodeCanonicalWireBridgeEnvelope,\n} from \"./bridge-protobuf.js\";\nimport type {\n\tAttachedCommandSources,\n\tBridgeState,\n\tRemoteCallRequest,\n\tRemoteCallResponse,\n\tRemoteResponderBundle,\n\tRemoteResponderHandler,\n\tRemoteResponderHandlerDefinition,\n\tRemoteResponderOptions,\n\tWireBridgeAckDriverBundle,\n\tWireBridgeAckDriverIssue,\n\tWireBridgeAckDriverOptions,\n\tWireBridgeAckDriverStatus,\n\tWireBridgeBundle,\n\tWireBridgeCommand,\n\tWireBridgeEnvelope,\n\tWireBridgeEnvelopeType,\n\tWireBridgeEvent,\n\tWireBridgeInvalidIngress,\n\tWireBridgeMetadata,\n\tWireBridgeOptions,\n\tWireBridgePayload,\n\tWireBridgeProtobufBundle,\n\tWireBridgeProtobufData,\n\tWireBridgeProtobufIssue,\n\tWireBridgeProtobufOptions,\n\tWireBridgeProtobufStatus,\n} from \"./bridge-types.js\";\n\nexport type {\n\tCanonicalProtobufErrorCategory,\n\tCanonicalWireBridgeDataBody,\n\tCanonicalWireBridgeEnvelope,\n\tCanonicalWireBridgeMetadata,\n\tCanonicalWireBridgePayload,\n\tCanonicalWireEdgeFrame,\n} from \"./bridge-protobuf.js\";\nexport {\n\tCanonicalProtobufError,\n\tdecodeCanonicalWireBridgeEnvelope,\n\tdecodeCanonicalWireEdgeFrame,\n\tencodeCanonicalWireBridgeEnvelope,\n\tencodeCanonicalWireEdgeFrame,\n} from \"./bridge-protobuf.js\";\nexport { remoteCall } from \"./bridge-remote-call.js\";\nexport type {\n\tRemoteCallBundle,\n\tRemoteCallError,\n\tRemoteCallOptions,\n\tRemoteCallRequest,\n\tRemoteCallResponse,\n\tRemoteCallResult,\n\tRemoteCallStatus,\n\tRemoteCallStatusState,\n\tRemoteCallTimeout,\n\tRemoteResponderBundle,\n\tRemoteResponderEvent,\n\tRemoteResponderHandler,\n\tRemoteResponderHandlerDefinition,\n\tRemoteResponderOptions,\n\tRemoteResponderStatus,\n\tRemoteResponderStatusState,\n\tWireBridgeAck,\n\tWireBridgeAckDriverBundle,\n\tWireBridgeAckDriverIssue,\n\tWireBridgeAckDriverOptions,\n\tWireBridgeAckDriverStatus,\n\tWireBridgeAttempt,\n\tWireBridgeBundle,\n\tWireBridgeCommand,\n\tWireBridgeEnvelope,\n\tWireBridgeEnvelopeType,\n\tWireBridgeEvent,\n\tWireBridgeMetadata,\n\tWireBridgeNack,\n\tWireBridgeOptions,\n\tWireBridgePayload,\n\tWireBridgeProtobufBundle,\n\tWireBridgeProtobufData,\n\tWireBridgeProtobufIssue,\n\tWireBridgeProtobufOptions,\n\tWireBridgeProtobufStatus,\n\tWireBridgeStatus,\n} from \"./bridge-types.js\";\n\nimport {\n\tguardedInboundNode,\n\tinvalidIngress,\n\tisInvalidIngress,\n\tprojectAcks,\n\tprojectAttempts,\n\tprojectCursor,\n\tprojectErrors,\n\tprojectNacks,\n\tprojectOutbound,\n\tprojectStatus,\n} from \"./bridge-projections.js\";\nimport {\n\tnormalizeRemoteHandlers,\n\tremoteResponderErrorsNode,\n\tremoteResponderEventsNode,\n\tremoteResponderRequestsNode,\n\tremoteResponderResponseCommandsNode,\n\tremoteResponderStatusNode,\n} from \"./bridge-remote-responder.js\";\nimport {\n\tbridgePayloadError,\n\tenvelopeTypes,\n\tisSafeNonNegativeInteger,\n\tisSafePositiveInteger,\n\tnormalizeWireBridgePayload,\n\tshouldTrackAck,\n\tvalidateCommand,\n\tvalidateInboundEnvelope,\n\tvalidatePayloadForType,\n} from \"./bridge-validation.js\";\n\nconst bridgeCommandSources = new WeakMap<\n\tWireBridgeBundle<unknown, unknown>,\n\tAttachedCommandSources<unknown>\n>();\nconst bridgeInboundTargets = new WeakMap<\n\tWireBridgeBundle<unknown, unknown>,\n\tNode<WireBridgeEnvelope<unknown> | WireBridgeInvalidIngress>\n>();\nconst bridgeInboundSources = new WeakMap<\n\tWireBridgeBundle<unknown, unknown>,\n\t{ sources: Node<WireBridgeEnvelope<unknown> | WireBridgeInvalidIngress>[] }\n>();\n\n/** Stable D134 idempotency key helper scoped to one bridge session and sequence. */\nexport function wireBridgeIdempotencyKey(sessionId: string, seq: number): string {\n\treturn `${sessionId}:${seq}`;\n}\n\n/** Create a D134 wire bridge envelope with ordered metadata. */\nexport function wireBridgeEnvelope<TData = unknown>(input: {\n\treadonly sessionId: string;\n\treadonly type: WireBridgeEnvelopeType;\n\treadonly seq: number;\n\treadonly cursor?: number;\n\treadonly payload?: WireBridgePayload<TData>;\n\treadonly idempotencyKey?: string;\n\treadonly attempt?: number;\n\treadonly maxAttempts?: number;\n\treadonly timestampMs?: number;\n\treadonly ackForSeq?: number;\n\treadonly requestId?: string;\n}): WireBridgeEnvelope<TData> {\n\tif (typeof input.sessionId !== \"string\" || input.sessionId.length === 0) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: sessionId must be a non-empty string\");\n\t}\n\tif (!envelopeTypes.has(input.type)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: type is not recognized\");\n\t}\n\tif (!isSafePositiveInteger(input.seq)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: seq must be a positive integer\");\n\t}\n\tconst cursor = input.cursor ?? 0;\n\tif (!isSafeNonNegativeInteger(cursor)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: cursor must be a non-negative integer\");\n\t}\n\tconst attempt = input.attempt ?? 1;\n\tif (!isSafePositiveInteger(attempt)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: attempt must be a positive integer\");\n\t}\n\tconst maxAttempts = input.maxAttempts ?? attempt;\n\tif (!isSafePositiveInteger(maxAttempts) || maxAttempts < attempt) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: maxAttempts must be >= attempt\");\n\t}\n\tif (input.ackForSeq !== undefined && !isSafePositiveInteger(input.ackForSeq)) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: ackForSeq must be a positive integer\");\n\t}\n\tif ((input.type === \"ack\" || input.type === \"nack\") && input.ackForSeq === undefined) {\n\t\tthrow new RangeError(`wireBridgeEnvelope: ${input.type} envelope requires ackForSeq`);\n\t}\n\tif (input.idempotencyKey !== undefined && input.idempotencyKey.length === 0) {\n\t\tthrow new RangeError(\"wireBridgeEnvelope: idempotencyKey must be a non-empty string\");\n\t}\n\tconst payloadError = validatePayloadForType(input.type, input.payload, \"wireBridgeEnvelope\");\n\tif (payloadError !== undefined) {\n\t\tthrow new RangeError(payloadError);\n\t}\n\tconst payload = normalizeWireBridgePayload(\n\t\tinput.payload,\n\t\t`wireBridgeEnvelope ${input.type} envelope`,\n\t) as WireBridgePayload<TData> | undefined;\n\treturn {\n\t\tsessionId: input.sessionId,\n\t\ttype: input.type,\n\t\tpayload,\n\t\tmetadata: {\n\t\t\tseq: input.seq,\n\t\t\tcursor,\n\t\t\tidempotencyKey: input.idempotencyKey ?? wireBridgeIdempotencyKey(input.sessionId, input.seq),\n\t\t\tattempt,\n\t\t\tmaxAttempts,\n\t\t\ttimestampMs: input.timestampMs,\n\t\t\tackForSeq: input.ackForSeq,\n\t\t\trequestId: input.requestId,\n\t\t},\n\t};\n}\n\nexport function wireBridge<TOutbound = unknown, TInbound = unknown>(\n\tgraph: Graph,\n\topts: WireBridgeOptions,\n): WireBridgeBundle<TOutbound, TInbound> {\n\tconst name = opts.name ?? \"wireBridge\";\n\tconst policy = opts.retry ?? retryPolicy();\n\tconst command = graph.node<WireBridgeCommand<TOutbound>>([], null, {\n\t\tname: `${name}/command`,\n\t\tfactory: \"wireBridgeCommand\",\n\t});\n\tconst inboundCore = graph.node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>(\n\t\t[],\n\t\tnull,\n\t\t{\n\t\t\tname: `${name}/inbound`,\n\t\t\tfactory: \"wireBridgeInbound\",\n\t\t},\n\t);\n\tconst inbound = guardedInboundNode(inboundCore, opts.sessionId);\n\tconst events = wireBridgeEventsNode<TOutbound, TInbound>(\n\t\tgraph,\n\t\tcommand,\n\t\tinboundCore,\n\t\tname,\n\t\topts,\n\t\tpolicy,\n\t);\n\tconst outbound = projectOutbound(graph, events, name);\n\tconst acks = projectAcks(graph, events, name);\n\tconst nacks = projectNacks(graph, events, name);\n\tconst status = projectStatus(graph, events, name, opts.sessionId);\n\tconst errors = projectErrors(graph, events, name);\n\tconst cursor = projectCursor(graph, events, name);\n\tconst attempts = projectAttempts(graph, events, name);\n\tconst bundle: WireBridgeBundle<TOutbound, TInbound> = {\n\t\tsessionId: opts.sessionId,\n\t\tcommand,\n\t\toutbound,\n\t\tinbound,\n\t\tevents,\n\t\tacks,\n\t\tnacks,\n\t\tstatus,\n\t\terrors,\n\t\tcursor,\n\t\tattempts,\n\t\tstart: () => command.down([[\"DATA\", { kind: \"start\" }]]),\n\t\tsend: (payload, sendOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"send\",\n\t\t\t\t\t\tpayload,\n\t\t\t\t\t\tidempotencyKey: sendOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId: sendOpts?.requestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tack: (ackForSeq, ackOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"ack\",\n\t\t\t\t\t\tackForSeq,\n\t\t\t\t\t\tidempotencyKey: ackOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId: ackOpts?.requestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tnack: (ackForSeq, error, nackOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"nack\",\n\t\t\t\t\t\tackForSeq,\n\t\t\t\t\t\terror,\n\t\t\t\t\t\tidempotencyKey: nackOpts?.idempotencyKey,\n\t\t\t\t\t\trequestId: nackOpts?.requestId,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tclose: (reason, closeOpts) =>\n\t\t\tcommand.down([\n\t\t\t\t[\"DATA\", { kind: \"close\", reason, idempotencyKey: closeOpts?.idempotencyKey }],\n\t\t\t]),\n\t};\n\tbridgeCommandSources.set(bundle as WireBridgeBundle<unknown, unknown>, { sources: [] });\n\tbridgeInboundTargets.set(bundle as WireBridgeBundle<unknown, unknown>, inboundCore);\n\tbridgeInboundSources.set(bundle as WireBridgeBundle<unknown, unknown>, { sources: [] });\n\treturn bundle;\n}\n\ntype WireBridgeAckTimeoutCommand = Extract<\n\tWireBridgeCommand<never>,\n\t{ readonly kind: \"ack-timeout\" }\n>;\n\ntype WireBridgeAckDriverEvent =\n\t| {\n\t\t\treadonly kind: \"command\";\n\t\t\treadonly command: WireBridgeAckTimeoutCommand;\n\t\t\treadonly pending: number;\n\t\t\treadonly nowMs: number;\n\t  }\n\t| {\n\t\t\treadonly kind: \"issue\";\n\t\t\treadonly issue: WireBridgeAckDriverIssue;\n\t\t\treadonly pending: number;\n\t\t\treadonly nowMs?: number;\n\t  }\n\t| { readonly kind: \"state\"; readonly pending: number; readonly nowMs?: number };\n\ninterface AckDriverPendingAttempt {\n\treadonly seq: number;\n\tattempt: number;\n\tobservedAtMs?: number;\n\ttimedOutAttempt?: number;\n\ttimedOutAtMs?: number;\n\tretryDueAtMs?: number;\n\tretryReleasedAttempt?: number;\n}\n\ninterface AckDriverState {\n\tnowMs?: number;\n\tpending: Map<number, AckDriverPendingAttempt>;\n}\n\n/** D502 explicit graph-visible ack-timeout command driver for a wireBridge. */\nexport function wireBridgeAckDriver<TOutbound = unknown, TInbound = unknown>(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\topts: WireBridgeAckDriverOptions,\n): WireBridgeAckDriverBundle {\n\tconst name = opts.name ?? `${bridge.sessionId}/wireBridgeAckDriver`;\n\tif (!Number.isFinite(opts.timeoutMs) || opts.timeoutMs < 0) {\n\t\tthrow new RangeError(\"wireBridgeAckDriver: timeoutMs must be a non-negative finite number\");\n\t}\n\tconst topology = graph.topologyGroup({ name: `${name}.wireBridgeAckDriver` });\n\tconst active = { current: true };\n\tconst events = topology.add(wireBridgeAckDriverEventsNode(graph, bridge, opts, name, active));\n\tconst commands = topology.add(\n\t\tgraph.node<WireBridgeCommand<never>>([events], wireBridgeAckDriverCommandsFn(), {\n\t\t\tname: `${name}/commands`,\n\t\t\tfactory: \"wireBridgeAckDriverCommands\",\n\t\t}),\n\t);\n\tconst issues = topology.add(wireBridgeAckDriverIssuesNode(graph, events, name));\n\tconst status = topology.add(wireBridgeAckDriverStatusNode(graph, events, name));\n\tlet released = false;\n\treturn {\n\t\tcommands,\n\t\tstatus,\n\t\tissues,\n\t\trelease() {\n\t\t\tif (released) return;\n\t\t\tactive.current = false;\n\t\t\ttry {\n\t\t\t\ttopology.release({ reason: `${name}.wireBridgeAckDriver.release` });\n\t\t\t\treleased = true;\n\t\t\t} catch (error) {\n\t\t\t\tactive.current = true;\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t},\n\t};\n}\n\nfunction wireBridgeAckDriverEventsNode<TOutbound, TInbound>(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\topts: WireBridgeAckDriverOptions,\n\tname: string,\n\tactive: { current: boolean },\n): Node<WireBridgeAckDriverEvent> {\n\treturn graph.node<WireBridgeAckDriverEvent>(\n\t\t[opts.clock, bridge.attempts, bridge.acks, bridge.nacks, bridge.status],\n\t\t(ctx) => {\n\t\t\tlet state = ctx.state.get<AckDriverState>();\n\t\t\tif (state === undefined) {\n\t\t\t\tstate = { pending: new Map() };\n\t\t\t\tctx.state.set(state);\n\t\t\t}\n\t\t\tlet touched = false;\n\t\t\tfor (const rawClock of depBatch(ctx, 0) ?? []) {\n\t\t\t\tif (!Number.isFinite(rawClock) || (rawClock as number) < 0) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"issue\",\n\t\t\t\t\t\t\t\tissue: {\n\t\t\t\t\t\t\t\t\tcode: \"wire-bridge-ack-driver-clock-invalid\",\n\t\t\t\t\t\t\t\t\tmessage: \"wireBridgeAckDriver: clock facts must be non-negative finite numbers\",\n\t\t\t\t\t\t\t\t\tnowMs: rawClock as number,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tpending: state.pending.size,\n\t\t\t\t\t\t\t\tnowMs: state.nowMs,\n\t\t\t\t\t\t\t} satisfies WireBridgeAckDriverEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\ttouched = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst nowMs = rawClock as number;\n\t\t\t\tif (state.nowMs !== undefined && nowMs < state.nowMs) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"issue\",\n\t\t\t\t\t\t\t\tissue: {\n\t\t\t\t\t\t\t\t\tcode: \"wire-bridge-ack-driver-clock-regressed\",\n\t\t\t\t\t\t\t\t\tmessage: \"wireBridgeAckDriver: clock facts must be monotonic\",\n\t\t\t\t\t\t\t\t\tnowMs,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tpending: state.pending.size,\n\t\t\t\t\t\t\t\tnowMs: state.nowMs,\n\t\t\t\t\t\t\t} satisfies WireBridgeAckDriverEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\ttouched = true;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstate.nowMs = nowMs;\n\t\t\t\ttouched = true;\n\t\t\t}\n\t\t\tfor (const rawAttempt of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst attempt = rawAttempt as { readonly seq: number; readonly attempt: number };\n\t\t\t\tstate.pending.set(attempt.seq, {\n\t\t\t\t\tseq: attempt.seq,\n\t\t\t\t\tattempt: attempt.attempt,\n\t\t\t\t\tobservedAtMs: state.nowMs,\n\t\t\t\t});\n\t\t\t\ttouched = true;\n\t\t\t}\n\t\t\tfor (const rawAck of depBatch(ctx, 2) ?? []) {\n\t\t\t\tstate.pending.delete((rawAck as { readonly ackForSeq: number }).ackForSeq);\n\t\t\t\ttouched = true;\n\t\t\t}\n\t\t\tfor (const rawNack of depBatch(ctx, 3) ?? []) {\n\t\t\t\tstate.pending.delete((rawNack as { readonly ackForSeq: number }).ackForSeq);\n\t\t\t\ttouched = true;\n\t\t\t}\n\t\t\tfor (const rawStatus of depBatch(ctx, 4) ?? []) {\n\t\t\t\tconst status = rawStatus as {\n\t\t\t\t\treadonly state?: string;\n\t\t\t\t\treadonly pending?: number;\n\t\t\t\t\treadonly lastSeq?: number;\n\t\t\t\t\treadonly lastDelayMs?: number;\n\t\t\t\t};\n\t\t\t\tif (status.pending === 0) state.pending.clear();\n\t\t\t\telse if (status.state === \"exhausted\" && status.lastSeq !== undefined) {\n\t\t\t\t\tstate.pending.delete(status.lastSeq);\n\t\t\t\t} else if (\n\t\t\t\t\tstatus.state === \"waiting\" &&\n\t\t\t\t\tstatus.lastSeq !== undefined &&\n\t\t\t\t\tstatus.lastDelayMs !== undefined\n\t\t\t\t) {\n\t\t\t\t\tconst pending = state.pending.get(status.lastSeq);\n\t\t\t\t\tif (\n\t\t\t\t\t\tpending?.timedOutAtMs !== undefined &&\n\t\t\t\t\t\tpending.retryReleasedAttempt !== pending.attempt\n\t\t\t\t\t) {\n\t\t\t\t\t\tpending.retryDueAtMs = pending.timedOutAtMs + status.lastDelayMs;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ttouched = true;\n\t\t\t}\n\t\t\tconst nowMs = state.nowMs;\n\t\t\tlet emittedCommand = false;\n\t\t\tif (active.current && nowMs !== undefined) {\n\t\t\t\tfor (const pending of state.pending.values()) {\n\t\t\t\t\tif (pending.observedAtMs === undefined) {\n\t\t\t\t\t\tpending.observedAtMs = nowMs;\n\t\t\t\t\t\ttouched = true;\n\t\t\t\t\t}\n\t\t\t\t\tif (\n\t\t\t\t\t\tpending.observedAtMs !== undefined &&\n\t\t\t\t\t\tnowMs - pending.observedAtMs >= opts.timeoutMs &&\n\t\t\t\t\t\tpending.timedOutAttempt !== pending.attempt\n\t\t\t\t\t) {\n\t\t\t\t\t\tconst command: WireBridgeAckTimeoutCommand = {\n\t\t\t\t\t\t\tkind: \"ack-timeout\",\n\t\t\t\t\t\t\tseq: pending.seq,\n\t\t\t\t\t\t\tattempt: pending.attempt,\n\t\t\t\t\t\t\tobservedAtMs: nowMs,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tpending.timedOutAttempt = pending.attempt;\n\t\t\t\t\t\tpending.timedOutAtMs = nowMs;\n\t\t\t\t\t\tctx.down([[\"DATA\", { kind: \"command\", command, pending: state.pending.size, nowMs }]]);\n\t\t\t\t\t\temittedCommand = true;\n\t\t\t\t\t\ttouched = true;\n\t\t\t\t\t} else if (\n\t\t\t\t\t\tpending.retryDueAtMs !== undefined &&\n\t\t\t\t\t\tnowMs >= pending.retryDueAtMs &&\n\t\t\t\t\t\tpending.retryReleasedAttempt !== pending.attempt\n\t\t\t\t\t) {\n\t\t\t\t\t\tconst command: WireBridgeAckTimeoutCommand = {\n\t\t\t\t\t\t\tkind: \"ack-timeout\",\n\t\t\t\t\t\t\tseq: pending.seq,\n\t\t\t\t\t\t\tattempt: pending.attempt,\n\t\t\t\t\t\t\tobservedAtMs: nowMs,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tpending.retryReleasedAttempt = pending.attempt;\n\t\t\t\t\t\tctx.down([[\"DATA\", { kind: \"command\", command, pending: state.pending.size, nowMs }]]);\n\t\t\t\t\t\temittedCommand = true;\n\t\t\t\t\t\ttouched = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (touched && !emittedCommand) {\n\t\t\t\tctx.down([[\"DATA\", { kind: \"state\", pending: state.pending.size, nowMs }]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/events`,\n\t\t\tfactory: \"wireBridgeAckDriverEvents\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n}\n\nfunction wireBridgeAckDriverCommandsFn(): (ctx: Ctx) => void {\n\treturn (ctx) => {\n\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\tconst event = raw as WireBridgeAckDriverEvent;\n\t\t\tif (event.kind === \"command\") ctx.down([[\"DATA\", event.command]]);\n\t\t}\n\t};\n}\n\nfunction wireBridgeAckDriverIssuesNode(\n\tgraph: Graph,\n\tevents: Node<WireBridgeAckDriverEvent>,\n\tname: string,\n): Node<WireBridgeAckDriverIssue> {\n\treturn graph.node<WireBridgeAckDriverIssue>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeAckDriverEvent;\n\t\t\t\tif (event.kind === \"issue\") ctx.down([[\"DATA\", event.issue]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/issues`, factory: \"wireBridgeAckDriverIssues\" },\n\t);\n}\n\nfunction wireBridgeAckDriverStatusNode(\n\tgraph: Graph,\n\tevents: Node<WireBridgeAckDriverEvent>,\n\tname: string,\n): Node<WireBridgeAckDriverStatus> {\n\treturn graph.node<WireBridgeAckDriverStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet next =\n\t\t\t\tctx.state.get<WireBridgeAckDriverStatus>() ??\n\t\t\t\t({\n\t\t\t\t\tstate: \"idle\",\n\t\t\t\t\tpending: 0,\n\t\t\t\t\tcommands: 0,\n\t\t\t\t\tissues: 0,\n\t\t\t\t} satisfies WireBridgeAckDriverStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeAckDriverEvent;\n\t\t\t\tif (event.kind === \"command\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"timed-out\",\n\t\t\t\t\t\tpending: event.pending,\n\t\t\t\t\t\tcommands: next.commands + 1,\n\t\t\t\t\t\tnowMs: event.nowMs,\n\t\t\t\t\t\tlastCommand: event.command,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"issue\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"issues\",\n\t\t\t\t\t\tpending: event.pending,\n\t\t\t\t\t\tissues: next.issues + 1,\n\t\t\t\t\t\tnowMs: event.nowMs,\n\t\t\t\t\t\tlastIssue: event.issue,\n\t\t\t\t\t};\n\t\t\t\t} else {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: event.pending > 0 ? \"active\" : \"idle\",\n\t\t\t\t\t\tpending: event.pending,\n\t\t\t\t\t\tnowMs: event.nowMs,\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"wireBridgeAckDriverStatus\" },\n\t);\n}\n\ntype WireBridgeProtobufInboundResult =\n\t| { readonly kind: \"decoded\"; readonly envelope: WireBridgeEnvelope<WireBridgeProtobufData> }\n\t| {\n\t\t\treadonly kind: \"issue\";\n\t\t\treadonly issue: WireBridgeProtobufIssue;\n\t\t\treadonly invalid: WireBridgeInvalidIngress;\n\t  };\n\ntype WireBridgeProtobufOutboundResult =\n\t| { readonly kind: \"encoded\"; readonly bytes: Uint8Array }\n\t| { readonly kind: \"issue\"; readonly issue: WireBridgeProtobufIssue };\n\ntype WireBridgeProtobufEvent =\n\t| {\n\t\t\treadonly kind: \"inbound\";\n\t\t\treadonly result: WireBridgeProtobufInboundResult;\n\t  }\n\t| {\n\t\t\treadonly kind: \"outbound\";\n\t\t\treadonly result: WireBridgeProtobufOutboundResult;\n\t  };\n\ntype WireBridgeProtobufInboundEvent = Extract<\n\tWireBridgeProtobufEvent,\n\t{ readonly kind: \"inbound\" }\n>;\ntype WireBridgeProtobufOutboundEvent = Extract<\n\tWireBridgeProtobufEvent,\n\t{ readonly kind: \"outbound\" }\n>;\n\n/**\n * D498 focused canonical protobuf byte adapter over an existing semantic wireBridge bundle.\n *\n * This helper owns no transport/session/retry policy and does not add wireBridge core options.\n * Malformed bytes become graph-visible issue/invalid facts, never local protocol terminals.\n */\nexport function wireBridgeProtobuf(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<WireBridgeProtobufData, WireBridgeProtobufData>,\n\topts: WireBridgeProtobufOptions = {},\n): WireBridgeProtobufBundle {\n\tconst name = opts.name ?? \"wireBridgeProtobuf\";\n\tconst topology = graph.topologyGroup({ name: `${name}.wireBridgeProtobuf` });\n\tconst inboundBytes = topology.node<Uint8Array>([], null, {\n\t\tname: `${name}/inboundBytes`,\n\t\tfactory: \"wireBridgeProtobufInboundBytes\",\n\t});\n\tconst inboundResults = topology.node<WireBridgeProtobufInboundResult>(\n\t\t[inboundBytes],\n\t\t(ctx) => {\n\t\t\tfor (const bytes of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst result = wireBridgeProtobufInboundResult(bytes as Uint8Array, bridge.sessionId);\n\t\t\t\tctx.down([[\"DATA\", result]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/inboundResults`,\n\t\t\tfactory: \"wireBridgeProtobufInboundResults\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst outboundResults = topology.node<WireBridgeProtobufOutboundResult>(\n\t\t[bridge.outbound],\n\t\t(ctx) => {\n\t\t\tfor (const envelope of depBatch(ctx, 0) ?? []) {\n\t\t\t\tlet result: WireBridgeProtobufOutboundResult;\n\t\t\t\ttry {\n\t\t\t\t\tconst canonical = canonicalEnvelopeFromSemantic(\n\t\t\t\t\t\tenvelope as WireBridgeEnvelope<WireBridgeProtobufData>,\n\t\t\t\t\t);\n\t\t\t\t\tresult = { kind: \"encoded\", bytes: encodeCanonicalWireBridgeEnvelope(canonical) };\n\t\t\t\t} catch (error) {\n\t\t\t\t\tconst issue = protobufIssue(\"outbound\", \"encode\", error);\n\t\t\t\t\tresult = { kind: \"issue\", issue };\n\t\t\t\t}\n\t\t\t\tctx.down([[\"DATA\", result]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/outboundResults`,\n\t\t\tfactory: \"wireBridgeProtobufOutboundResults\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst inboundEvents = topology.node<WireBridgeProtobufInboundEvent>(\n\t\t[inboundResults],\n\t\t(ctx) => {\n\t\t\tfor (const result of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", { kind: \"inbound\", result: result as WireBridgeProtobufInboundResult }],\n\t\t\t\t]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/inboundEvents`,\n\t\t\tfactory: \"wireBridgeProtobufInboundEvents\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst outboundEvents = topology.node<WireBridgeProtobufOutboundEvent>(\n\t\t[outboundResults],\n\t\t(ctx) => {\n\t\t\tfor (const result of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", { kind: \"outbound\", result: result as WireBridgeProtobufOutboundResult }],\n\t\t\t\t]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/outboundEvents`,\n\t\t\tfactory: \"wireBridgeProtobufOutboundEvents\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst inboundDecoded = topology.node<\n\t\tWireBridgeEnvelope<WireBridgeProtobufData> | WireBridgeInvalidIngress\n\t>(\n\t\t[inboundEvents],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeProtobufInboundEvent;\n\t\t\t\tconst result = event.result;\n\t\t\t\tctx.down([[\"DATA\", result.kind === \"decoded\" ? result.envelope : result.invalid]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/inboundDecoded`,\n\t\t\tfactory: \"wireBridgeProtobufInboundDecoded\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst outboundBytes = topology.node<Uint8Array>(\n\t\t[outboundEvents],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeProtobufOutboundEvent;\n\t\t\t\tif (event.result.kind === \"encoded\") {\n\t\t\t\t\tctx.down([[\"DATA\", event.result.bytes]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/outboundBytes`,\n\t\t\tfactory: \"wireBridgeProtobufOutboundBytes\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst issues = topology.node<WireBridgeProtobufIssue>(\n\t\t[inboundEvents, outboundEvents],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeProtobufInboundEvent;\n\t\t\t\tconst result = event.result;\n\t\t\t\tif (result.kind === \"issue\") ctx.down([[\"DATA\", result.issue]]);\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeProtobufOutboundEvent;\n\t\t\t\tconst result = event.result;\n\t\t\t\tif (result.kind === \"issue\") ctx.down([[\"DATA\", result.issue]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/issues`,\n\t\t\tfactory: \"wireBridgeProtobufIssues\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst status = topology.node<WireBridgeProtobufStatus>(\n\t\t[inboundEvents, outboundEvents],\n\t\t(ctx) => {\n\t\t\tlet status =\n\t\t\t\tctx.state.get<WireBridgeProtobufStatus>() ??\n\t\t\t\t({ decoded: 0, encoded: 0, issues: 0, state: \"idle\" } satisfies WireBridgeProtobufStatus);\n\t\t\tconst emitStatus = (next: WireBridgeProtobufStatus) => {\n\t\t\t\tstatus = next;\n\t\t\t\tctx.state.set(status);\n\t\t\t\tctx.down([[\"DATA\", status]]);\n\t\t\t};\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeProtobufInboundEvent;\n\t\t\t\tconst result = event.result;\n\t\t\t\tif (result.kind === \"decoded\") {\n\t\t\t\t\temitStatus({\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tdecoded: status.decoded + 1,\n\t\t\t\t\t\tstate: status.issues > 0 ? \"issues\" : \"active\",\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\temitStatus({\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tissues: status.issues + 1,\n\t\t\t\t\t\tstate: \"issues\",\n\t\t\t\t\t\tlastIssue: result.issue,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst event = raw as WireBridgeProtobufOutboundEvent;\n\t\t\t\tconst result = event.result;\n\t\t\t\tif (result.kind === \"encoded\") {\n\t\t\t\t\temitStatus({\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tencoded: status.encoded + 1,\n\t\t\t\t\t\tstate: status.issues > 0 ? \"issues\" : \"active\",\n\t\t\t\t\t});\n\t\t\t\t} else {\n\t\t\t\t\temitStatus({\n\t\t\t\t\t\t...status,\n\t\t\t\t\t\tissues: status.issues + 1,\n\t\t\t\t\t\tstate: \"issues\",\n\t\t\t\t\t\tlastIssue: result.issue,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/status`,\n\t\t\tfactory: \"wireBridgeProtobufStatus\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\ttry {\n\t\tattachWireBridgeInboundSource(bridge, inboundDecoded);\n\t} catch (error) {\n\t\ttopology.release({ reason: `${name}.wireBridgeProtobuf.failedAttach` });\n\t\tthrow error;\n\t}\n\tlet released = false;\n\treturn {\n\t\tinboundBytes,\n\t\toutboundBytes,\n\t\tissues,\n\t\tstatus,\n\t\trelease() {\n\t\t\tif (released) return;\n\t\t\tdetachWireBridgeInboundSource(bridge, inboundDecoded);\n\t\t\ttry {\n\t\t\t\ttopology.release({ reason: `${name}.wireBridgeProtobuf.release` });\n\t\t\t\treleased = true;\n\t\t\t} catch (error) {\n\t\t\t\tattachWireBridgeInboundSource(bridge, inboundDecoded);\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t},\n\t};\n}\n\nexport function remoteResponderHandler<TRequest = unknown, TResponse = unknown>(\n\toperation: string,\n\thandle: RemoteResponderHandler<TRequest, TResponse>,\n): RemoteResponderHandlerDefinition<TRequest, TResponse> {\n\tif (operation.length === 0) {\n\t\tthrow new RangeError(\"remoteResponderHandler: operation must be non-empty\");\n\t}\n\tif (typeof handle !== \"function\") {\n\t\tthrow new TypeError(\"remoteResponderHandler: handle must be a function\");\n\t}\n\treturn { operation, handle };\n}\n\n/** D147 remote responder over inbound wireBridge request facts and outbound command facts. */\nexport function remoteResponder<TRequest = unknown, TResponse = unknown>(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<RemoteCallResponse<TResponse>, RemoteCallRequest<TRequest>>,\n\topts: RemoteResponderOptions<TRequest, TResponse> = {},\n): RemoteResponderBundle<TRequest, TResponse> {\n\tconst name = opts.name ?? \"remoteResponder\";\n\tconst handlers = normalizeRemoteHandlers(opts.handlers ?? []);\n\tconst topology = graph.topologyGroup({ name: `${name}.remoteResponder` });\n\tconst events = topology.add(\n\t\tremoteResponderEventsNode(\n\t\t\tgraph,\n\t\t\twireBridgeInboundTarget(bridge),\n\t\t\tname,\n\t\t\tbridge.sessionId,\n\t\t\thandlers,\n\t\t\topts.rejectUnknown === true,\n\t\t),\n\t);\n\tconst responseCommands = topology.add(remoteResponderResponseCommandsNode(graph, events, name));\n\tconst requests = topology.add(remoteResponderRequestsNode(graph, events, name));\n\tconst status = topology.add(remoteResponderStatusNode(graph, events, name));\n\tconst errors = topology.add(remoteResponderErrorsNode(graph, events, name));\n\ttry {\n\t\tattachWireBridgeCommandSource(bridge, responseCommands);\n\t} catch (error) {\n\t\ttopology.release({ reason: `${name}.remoteResponder.failedAttach` });\n\t\tthrow error;\n\t}\n\tlet released = false;\n\treturn {\n\t\tevents,\n\t\tresponseCommands,\n\t\trequests,\n\t\tstatus,\n\t\terrors,\n\t\trelease() {\n\t\t\tif (released) return;\n\t\t\tdetachWireBridgeCommandSource(bridge, responseCommands);\n\t\t\ttry {\n\t\t\t\ttopology.release({ reason: `${name}.remoteResponder.release` });\n\t\t\t\treleased = true;\n\t\t\t} catch (error) {\n\t\t\t\tattachWireBridgeCommandSource(bridge, responseCommands);\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t},\n\t};\n}\n\nfunction wireBridgeEventsNode<TOutbound, TInbound>(\n\tgraph: Graph,\n\tcommand: Node<WireBridgeCommand<TOutbound>>,\n\tinbound: Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>,\n\tname: string,\n\topts: WireBridgeOptions,\n\tpolicy: RetryPolicy,\n): Node<WireBridgeEvent<TOutbound, TInbound>> {\n\tconst now = opts.now ?? Date.now;\n\treturn graph.node<WireBridgeEvent<TOutbound, TInbound>>(\n\t\t[command, inbound],\n\t\t(ctx) => {\n\t\t\tconst state = initBridgeState<TOutbound>(ctx);\n\n\t\t\tconst emitOutbound = (\n\t\t\t\ttype: WireBridgeEnvelopeType,\n\t\t\t\tpayload: WireBridgePayload<TOutbound> | undefined,\n\t\t\t\tcommandOpts: { idempotencyKey?: string; requestId?: string; ackForSeq?: number } = {},\n\t\t\t\tbeforeEmit?: () => void,\n\t\t\t) => {\n\t\t\t\tif (!isSafePositiveInteger(state.nextSeq)) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"invalid\",\n\t\t\t\t\t\t\t\terror: `${opts.sessionId}: next outbound seq exceeded Number.MAX_SAFE_INTEGER`,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst seq = state.nextSeq;\n\t\t\t\tlet envelope: WireBridgeEnvelope<TOutbound>;\n\t\t\t\ttry {\n\t\t\t\t\tconst normalizedPayload = normalizeWireBridgePayload(\n\t\t\t\t\t\tpayload,\n\t\t\t\t\t\t`wireBridge: outbound ${type} envelope`,\n\t\t\t\t\t) as WireBridgePayload<TOutbound> | undefined;\n\t\t\t\t\tenvelope = wireBridgeEnvelope<TOutbound>({\n\t\t\t\t\t\tsessionId: opts.sessionId,\n\t\t\t\t\t\ttype,\n\t\t\t\t\t\tseq,\n\t\t\t\t\t\tcursor: state.cursor,\n\t\t\t\t\t\tpayload: normalizedPayload,\n\t\t\t\t\t\tidempotencyKey: commandOpts.idempotencyKey,\n\t\t\t\t\t\tattempt: 1,\n\t\t\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\t\t\ttimestampMs: now(),\n\t\t\t\t\t\tackForSeq: commandOpts.ackForSeq,\n\t\t\t\t\t\trequestId: commandOpts.requestId,\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"invalid\",\n\t\t\t\t\t\t\t\terror: error instanceof Error ? error.message : String(error),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tstate.nextSeq++;\n\t\t\t\tbeforeEmit?.();\n\t\t\t\tctx.down([[\"DATA\", { kind: \"outbound\", envelope }]]);\n\t\t\t\tif (shouldTrackAck(type)) state.pending.set(envelope.metadata.seq, { envelope });\n\t\t\t};\n\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tprocessInbound(ctx, state, raw, opts.sessionId);\n\t\t\t}\n\t\t\tconst inboundTerminal = ctx.terminal[1];\n\t\t\tif (inboundTerminal !== false && inboundTerminal !== undefined && !state.terminalReported) {\n\t\t\t\tstate.terminalReported = true;\n\t\t\t\tconst error =\n\t\t\t\t\tinboundTerminal === true\n\t\t\t\t\t\t? `${opts.sessionId}: inbound protocol COMPLETE is local misuse; remote completion must arrive as a DATA envelope fact`\n\t\t\t\t\t\t: `${opts.sessionId}: inbound protocol ERROR ${String(\n\t\t\t\t\t\t\t\terrorPayload(inboundTerminal),\n\t\t\t\t\t\t\t)} is local misuse; remote errors must arrive as DATA envelope facts`;\n\t\t\t\tctx.down([[\"DATA\", { kind: \"invalid\", error }]]);\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst invalid = validateCommand(raw);\n\t\t\t\tif (invalid !== undefined) {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: invalid }]]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tconst commandValue = raw as WireBridgeCommand<TOutbound>;\n\t\t\t\tswitch (commandValue.kind) {\n\t\t\t\t\tcase \"start\":\n\t\t\t\t\t\temitOutbound(\"start\", undefined, commandValue);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"send\":\n\t\t\t\t\t\temitOutbound(\"data\", { kind: \"data\", value: commandValue.payload }, commandValue);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"ack\":\n\t\t\t\t\t\temitOutbound(\"ack\", undefined, {\n\t\t\t\t\t\t\tidempotencyKey: commandValue.idempotencyKey,\n\t\t\t\t\t\t\trequestId: commandValue.requestId,\n\t\t\t\t\t\t\tackForSeq: commandValue.ackForSeq,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"nack\":\n\t\t\t\t\t\temitOutbound(\n\t\t\t\t\t\t\t\"nack\",\n\t\t\t\t\t\t\t{ kind: \"error\", error: errorPayload(commandValue.error) },\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tidempotencyKey: commandValue.idempotencyKey,\n\t\t\t\t\t\t\t\trequestId: commandValue.requestId,\n\t\t\t\t\t\t\t\tackForSeq: commandValue.ackForSeq,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"ack-timeout\":\n\t\t\t\t\t\tprocessAckTimeoutCommand(ctx, state, commandValue, opts, policy, now);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase \"close\":\n\t\t\t\t\t\temitOutbound(\n\t\t\t\t\t\t\t\"close\",\n\t\t\t\t\t\t\tcommandValue.reason === undefined\n\t\t\t\t\t\t\t\t? { kind: \"close\" }\n\t\t\t\t\t\t\t\t: { kind: \"close\", reason: commandValue.reason },\n\t\t\t\t\t\t\tcommandValue,\n\t\t\t\t\t\t\t() => {\n\t\t\t\t\t\t\t\tstate.pending.clear();\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t);\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/events`,\n\t\t\tfactory: \"wireBridgeEvents\",\n\t\t\tpartial: true,\n\t\t\terrorWhenDepsError: false,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t);\n}\n\nfunction initBridgeState<TPayload>(ctx: Ctx): BridgeState<TPayload> {\n\tlet state = ctx.state.get<BridgeState<TPayload>>();\n\tif (state === undefined) {\n\t\tstate = {\n\t\t\tcleanupInstalled: false,\n\t\t\tnextSeq: 1,\n\t\t\tcursor: 0,\n\t\t\tremoteCursor: 0,\n\t\t\tterminalReported: false,\n\t\t\tpending: new Map(),\n\t\t};\n\t\tctx.state.set(state);\n\t}\n\tif (!state.cleanupInstalled) {\n\t\tstate.cleanupInstalled = true;\n\t\tctx.onDeactivation(() => {\n\t\t\tstate.cleanupInstalled = false;\n\t\t\tstate.pending.clear();\n\t\t});\n\t}\n\treturn state;\n}\n\nfunction attachWireBridgeCommandSource<TOutbound, TInbound>(\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\tsource: Node<WireBridgeCommand<TOutbound>>,\n): void {\n\tconst attached = bridgeCommandSources.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (attached === undefined) {\n\t\tthrow new Error(\"remoteResponder: bridge command source registry missing\");\n\t}\n\tconst sources = attached.sources as Node<WireBridgeCommand<TOutbound>>[];\n\tconst previousSources = [...sources];\n\tif (!sources.includes(source)) sources.push(source);\n\ttry {\n\t\tbridge.command.replaceDeps([...sources], wireBridgeCommandSourceFn(sources.length));\n\t} catch (error) {\n\t\tsources.splice(0, sources.length, ...previousSources);\n\t\tbridge.command.replaceDeps(\n\t\t\t[...previousSources],\n\t\t\twireBridgeCommandSourceFn(previousSources.length),\n\t\t);\n\t\tthrow error;\n\t}\n}\n\nfunction detachWireBridgeCommandSource<TOutbound, TInbound>(\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\tsource: Node<WireBridgeCommand<TOutbound>>,\n): void {\n\tconst attached = bridgeCommandSources.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (attached === undefined) {\n\t\tthrow new Error(\"remoteResponder: bridge command source registry missing\");\n\t}\n\tconst sources = attached.sources as Node<WireBridgeCommand<TOutbound>>[];\n\tif (!sources.includes(source)) return;\n\tconst previousSources = [...sources];\n\tconst nextSources = sources.filter((candidate) => candidate !== source);\n\tsources.splice(0, sources.length, ...nextSources);\n\ttry {\n\t\tbridge.command.replaceDeps([...nextSources], wireBridgeCommandSourceFn(nextSources.length));\n\t} catch (error) {\n\t\tsources.splice(0, sources.length, ...previousSources);\n\t\tbridge.command.replaceDeps(\n\t\t\t[...previousSources],\n\t\t\twireBridgeCommandSourceFn(previousSources.length),\n\t\t);\n\t\tthrow error;\n\t}\n}\n\nfunction attachWireBridgeInboundSource<TOutbound, TInbound>(\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\tsource: Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>,\n): void {\n\tconst attached = bridgeInboundSources.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (attached === undefined) {\n\t\tthrow new Error(\"wireBridgeProtobuf: bridge inbound source registry missing\");\n\t}\n\tconst sources = attached.sources as Node<\n\t\tWireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress\n\t>[];\n\tconst previousSources = [...sources];\n\tif (!sources.includes(source)) sources.push(source);\n\ttry {\n\t\twireBridgeInboundTarget(bridge).replaceDeps(\n\t\t\t[...sources],\n\t\t\twireBridgeInboundSourceFn(sources.length),\n\t\t);\n\t} catch (error) {\n\t\tsources.splice(0, sources.length, ...previousSources);\n\t\twireBridgeInboundTarget(bridge).replaceDeps(\n\t\t\t[...previousSources],\n\t\t\twireBridgeInboundSourceFn(previousSources.length),\n\t\t);\n\t\tthrow error;\n\t}\n}\n\nfunction detachWireBridgeInboundSource<TOutbound, TInbound>(\n\tbridge: WireBridgeBundle<TOutbound, TInbound>,\n\tsource: Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>,\n): void {\n\tconst attached = bridgeInboundSources.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (attached === undefined) {\n\t\tthrow new Error(\"wireBridgeProtobuf: bridge inbound source registry missing\");\n\t}\n\tconst sources = attached.sources as Node<\n\t\tWireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress\n\t>[];\n\tif (!sources.includes(source)) return;\n\tconst previousSources = [...sources];\n\tconst nextSources = sources.filter((candidate) => candidate !== source);\n\tsources.splice(0, sources.length, ...nextSources);\n\ttry {\n\t\twireBridgeInboundTarget(bridge).replaceDeps(\n\t\t\t[...nextSources],\n\t\t\twireBridgeInboundSourceFn(nextSources.length),\n\t\t);\n\t} catch (error) {\n\t\tsources.splice(0, sources.length, ...previousSources);\n\t\twireBridgeInboundTarget(bridge).replaceDeps(\n\t\t\t[...previousSources],\n\t\t\twireBridgeInboundSourceFn(previousSources.length),\n\t\t);\n\t\tthrow error;\n\t}\n}\n\nfunction wireBridgeInboundTarget<TInbound>(\n\tbridge: WireBridgeBundle<unknown, TInbound>,\n): Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress> {\n\tconst target = bridgeInboundTargets.get(bridge as WireBridgeBundle<unknown, unknown>);\n\tif (target === undefined) {\n\t\tthrow new Error(\"remoteResponder: bridge inbound target registry missing\");\n\t}\n\treturn target as Node<WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress>;\n}\n\nfunction wireBridgeCommandSourceFn<TOutbound>(sourceCount: number): (ctx: Ctx) => void {\n\treturn (ctx) => {\n\t\tfor (let i = 0; i < sourceCount; i += 1) {\n\t\t\tfor (const command of depBatch(ctx, i) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", command as WireBridgeCommand<TOutbound>]]);\n\t\t\t}\n\t\t}\n\t};\n}\n\nfunction wireBridgeInboundSourceFn<TInbound>(sourceCount: number): (ctx: Ctx) => void {\n\treturn (ctx) => {\n\t\tfor (let i = 0; i < sourceCount; i += 1) {\n\t\t\tfor (const envelope of depBatch(ctx, i) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", envelope as WireBridgeEnvelope<TInbound> | WireBridgeInvalidIngress]]);\n\t\t\t}\n\t\t}\n\t};\n}\n\nfunction wireBridgeProtobufInboundResult(\n\tbytes: Uint8Array,\n\tsessionId: string,\n): WireBridgeProtobufInboundResult {\n\ttry {\n\t\tconst envelope = semanticEnvelopeFromCanonical(decodeCanonicalWireBridgeEnvelope(bytes));\n\t\treturn { kind: \"decoded\", envelope };\n\t} catch (error) {\n\t\tconst issue = protobufIssue(\"inbound\", \"decode\", error);\n\t\treturn {\n\t\t\tkind: \"issue\",\n\t\t\tissue,\n\t\t\tinvalid: invalidIngress(`${sessionId}: ${issue.message}`),\n\t\t};\n\t}\n}\n\nfunction semanticEnvelopeFromCanonical(\n\tenvelope: CanonicalWireBridgeEnvelope,\n): WireBridgeEnvelope<WireBridgeProtobufData> {\n\tconst metadata = semanticMetadataFromCanonical(envelope.metadata);\n\tswitch (envelope.payload.kind) {\n\t\tcase \"start\":\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"start\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t\tcase \"ack\":\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"ack\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\tackForSeq: metadata.ackForSeq,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t\tcase \"data\":\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"data\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tpayload: { kind: \"data\", value: envelope.payload.body },\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t\tcase \"nack\":\n\t\t\tif (envelope.payload.error === undefined) {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"missing_required\",\n\t\t\t\t\t\"semantic wireBridge nack requires error bytes\",\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"nack\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tpayload: { kind: \"error\", error: envelope.payload.error },\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\tackForSeq: metadata.ackForSeq,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t\tcase \"status\":\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"status\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tpayload: { kind: \"status\", status: envelope.payload.status },\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t\tcase \"error\":\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"error\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tpayload: { kind: \"error\", error: envelope.payload.error },\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t\tcase \"close\":\n\t\t\treturn wireBridgeEnvelope({\n\t\t\t\tsessionId: envelope.sessionId,\n\t\t\t\ttype: \"close\",\n\t\t\t\tseq: metadata.seq,\n\t\t\t\tcursor: metadata.cursor,\n\t\t\t\tpayload:\n\t\t\t\t\tenvelope.payload.reason === undefined\n\t\t\t\t\t\t? { kind: \"close\" }\n\t\t\t\t\t\t: { kind: \"close\", reason: envelope.payload.reason },\n\t\t\t\tidempotencyKey: metadata.idempotencyKey,\n\t\t\t\tattempt: metadata.attempt,\n\t\t\t\tmaxAttempts: metadata.maxAttempts,\n\t\t\t\ttimestampMs: metadata.timestampMs,\n\t\t\t\trequestId: metadata.requestId,\n\t\t\t});\n\t}\n}\n\nfunction canonicalEnvelopeFromSemantic(\n\tenvelope: WireBridgeEnvelope<WireBridgeProtobufData>,\n): CanonicalWireBridgeEnvelope {\n\treturn {\n\t\tsessionId: envelope.sessionId,\n\t\tmetadata: {\n\t\t\tseq: BigInt(envelope.metadata.seq),\n\t\t\tcursor: BigInt(envelope.metadata.cursor),\n\t\t\tidempotencyKey: envelope.metadata.idempotencyKey,\n\t\t\tattempt: envelope.metadata.attempt,\n\t\t\tmaxAttempts: envelope.metadata.maxAttempts,\n\t\t\ttimestampMs:\n\t\t\t\tenvelope.metadata.timestampMs === undefined\n\t\t\t\t\t? undefined\n\t\t\t\t\t: BigInt(envelope.metadata.timestampMs),\n\t\t\tackForSeq:\n\t\t\t\tenvelope.metadata.ackForSeq === undefined ? undefined : BigInt(envelope.metadata.ackForSeq),\n\t\t\trequestId: envelope.metadata.requestId,\n\t\t},\n\t\tpayload: canonicalPayloadFromSemantic(envelope),\n\t};\n}\n\nfunction canonicalPayloadFromSemantic(\n\tenvelope: WireBridgeEnvelope<WireBridgeProtobufData>,\n): CanonicalWireBridgePayload {\n\tconst payload = envelope.payload;\n\tswitch (envelope.type) {\n\t\tcase \"start\":\n\t\t\treturn { kind: \"start\" };\n\t\tcase \"ack\":\n\t\t\treturn { kind: \"ack\" };\n\t\tcase \"data\":\n\t\t\tif (payload?.kind !== \"data\") {\n\t\t\t\tthrow new CanonicalProtobufError(\"missing_required\", \"data envelope requires data payload\");\n\t\t\t}\n\t\t\treturn { kind: \"data\", body: canonicalDataBody(payload.value) };\n\t\tcase \"nack\":\n\t\t\tif (payload?.kind !== \"error\") {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"missing_required\",\n\t\t\t\t\t\"nack envelope requires error payload\",\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn { kind: \"nack\", error: requiredBytes(payload.error, \"nack error\") };\n\t\tcase \"status\":\n\t\t\tif (payload?.kind !== \"status\") {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"missing_required\",\n\t\t\t\t\t\"status envelope requires status payload\",\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn { kind: \"status\", status: requiredBytes(payload.status, \"status\") };\n\t\tcase \"error\":\n\t\t\tif (payload?.kind !== \"error\") {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"missing_required\",\n\t\t\t\t\t\"error envelope requires error payload\",\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn { kind: \"error\", error: requiredBytes(payload.error, \"error\") };\n\t\tcase \"close\":\n\t\t\tif (payload?.kind !== \"close\") {\n\t\t\t\tthrow new CanonicalProtobufError(\n\t\t\t\t\t\"missing_required\",\n\t\t\t\t\t\"close envelope requires close payload\",\n\t\t\t\t);\n\t\t\t}\n\t\t\treturn { kind: \"close\", reason: optionalBytes(payload.reason, \"close reason\") };\n\t}\n}\n\nfunction canonicalDataBody(value: unknown): CanonicalWireBridgeDataBody {\n\tif (value instanceof Uint8Array) return { kind: \"value\", value };\n\tif (\n\t\ttypeof value === \"object\" &&\n\t\tvalue !== null &&\n\t\t(value as { readonly kind?: unknown }).kind === \"value\"\n\t) {\n\t\tconst bytes = (value as { readonly value?: unknown }).value;\n\t\tif (bytes instanceof Uint8Array) return { kind: \"value\", value: bytes };\n\t}\n\tif (\n\t\ttypeof value === \"object\" &&\n\t\tvalue !== null &&\n\t\t(value as { readonly kind?: unknown }).kind === \"wire_edge\"\n\t) {\n\t\tconst frame = (value as { readonly frame?: unknown }).frame;\n\t\treturn { kind: \"wire_edge\", frame: frame as CanonicalWireEdgeFrame };\n\t}\n\tthrow new CanonicalProtobufError(\n\t\t\"malformed\",\n\t\t\"wireBridgeProtobuf data payload must be Uint8Array or CanonicalWireBridgeDataBody\",\n\t);\n}\n\nfunction semanticMetadataFromCanonical(metadata: CanonicalWireBridgeMetadata): WireBridgeMetadata {\n\treturn {\n\t\tseq: safeSemanticNumber(metadata.seq, \"seq\"),\n\t\tcursor: safeSemanticNumber(metadata.cursor, \"cursor\"),\n\t\tidempotencyKey: metadata.idempotencyKey,\n\t\tattempt: metadata.attempt,\n\t\tmaxAttempts: metadata.maxAttempts,\n\t\ttimestampMs:\n\t\t\tmetadata.timestampMs === undefined\n\t\t\t\t? undefined\n\t\t\t\t: safeSemanticNumber(metadata.timestampMs, \"timestamp_ms\"),\n\t\tackForSeq:\n\t\t\tmetadata.ackForSeq === undefined\n\t\t\t\t? undefined\n\t\t\t\t: safeSemanticNumber(metadata.ackForSeq, \"ack_for_seq\"),\n\t\trequestId: metadata.requestId,\n\t};\n}\n\nfunction safeSemanticNumber(value: bigint, field: string): number {\n\tif (value > BigInt(Number.MAX_SAFE_INTEGER)) {\n\t\tthrow new CanonicalProtobufError(\n\t\t\t\"malformed\",\n\t\t\t`${field} exceeds semantic wireBridge Number.MAX_SAFE_INTEGER range`,\n\t\t);\n\t}\n\treturn Number(value);\n}\n\nfunction requiredBytes(value: unknown, field: string): Uint8Array {\n\tif (value instanceof Uint8Array) return value;\n\tthrow new CanonicalProtobufError(\"malformed\", `wireBridgeProtobuf ${field} must be Uint8Array`);\n}\n\nfunction optionalBytes(value: unknown, field: string): Uint8Array | undefined {\n\tif (value === undefined) return undefined;\n\tif (value instanceof Uint8Array) return value;\n\tthrow new CanonicalProtobufError(\"malformed\", `wireBridgeProtobuf ${field} must be Uint8Array`);\n}\n\nfunction protobufIssue(\n\tdirection: WireBridgeProtobufIssue[\"direction\"],\n\toperation: WireBridgeProtobufIssue[\"operation\"],\n\terror: unknown,\n): WireBridgeProtobufIssue {\n\treturn {\n\t\tdirection,\n\t\toperation,\n\t\tmessage: error instanceof Error ? error.message : String(error),\n\t\tcategory: error instanceof CanonicalProtobufError ? error.category : undefined,\n\t};\n}\n\nfunction processAckTimeoutCommand<TPayload>(\n\tctx: Ctx,\n\tstate: BridgeState<TPayload>,\n\tcommand: Extract<WireBridgeCommand<TPayload>, { readonly kind: \"ack-timeout\" }>,\n\topts: WireBridgeOptions,\n\tpolicy: RetryPolicy,\n\tnow: () => number,\n): void {\n\tconst pending = state.pending.get(command.seq);\n\tif (pending === undefined || pending.envelope.metadata.attempt !== command.attempt) return;\n\tconst current = pending.envelope;\n\tconst emitRetryOutbound = () => {\n\t\tconst attempt = current.metadata.attempt + 1;\n\t\tconst retry = wireBridgeEnvelope<TPayload>({\n\t\t\tsessionId: current.sessionId,\n\t\t\ttype: current.type,\n\t\t\tseq: current.metadata.seq,\n\t\t\tcursor: state.cursor,\n\t\t\tpayload: current.payload,\n\t\t\tidempotencyKey: current.metadata.idempotencyKey,\n\t\t\tattempt,\n\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\ttimestampMs: now(),\n\t\t\trequestId: current.metadata.requestId,\n\t\t});\n\t\tpending.envelope = retry;\n\t\tpending.timeoutReportedAttempt = undefined;\n\t\tpending.retryDueAtMs = undefined;\n\t\tctx.down([[\"DATA\", { kind: \"outbound\", envelope: retry }]]);\n\t};\n\tif (pending.timeoutReportedAttempt === current.metadata.attempt) {\n\t\tif (\n\t\t\tpending.retryDueAtMs !== undefined &&\n\t\t\tcommand.observedAtMs !== undefined &&\n\t\t\tcommand.observedAtMs < pending.retryDueAtMs\n\t\t) {\n\t\t\treturn;\n\t\t}\n\t\temitRetryOutbound();\n\t\treturn;\n\t}\n\tctx.down([\n\t\t[\n\t\t\t\"DATA\",\n\t\t\t{\n\t\t\t\tkind: \"timeout\",\n\t\t\t\tseq: current.metadata.seq,\n\t\t\t\tattempt: current.metadata.attempt,\n\t\t\t} satisfies WireBridgeEvent<TPayload, unknown>,\n\t\t],\n\t]);\n\tif (!shouldRetry(policy, current.metadata.attempt)) {\n\t\tconst error = `${opts.sessionId}: ack timeout for seq ${current.metadata.seq}`;\n\t\tstate.pending.delete(current.metadata.seq);\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"exhausted\",\n\t\t\t\t\tseq: current.metadata.seq,\n\t\t\t\t\tattempt: current.metadata.attempt,\n\t\t\t\t\terror,\n\t\t\t\t} satisfies WireBridgeEvent<TPayload, unknown>,\n\t\t\t],\n\t\t]);\n\t\treturn;\n\t}\n\tconst attempt = current.metadata.attempt + 1;\n\tconst delayMs = nextRetryDelayMs(policy, attempt) ?? 0;\n\tconst error = `${opts.sessionId}: ack timeout for seq ${current.metadata.seq}`;\n\tpending.timeoutReportedAttempt = current.metadata.attempt;\n\tif (delayMs > 0 && command.observedAtMs !== undefined) {\n\t\tpending.retryDueAtMs = command.observedAtMs + delayMs;\n\t}\n\tctx.down([\n\t\t[\n\t\t\t\"DATA\",\n\t\t\t{\n\t\t\t\tkind: \"retry\",\n\t\t\t\tseq: current.metadata.seq,\n\t\t\t\tattempt,\n\t\t\t\tdelayMs,\n\t\t\t\terror,\n\t\t\t} satisfies WireBridgeEvent<TPayload, unknown>,\n\t\t],\n\t]);\n\tif (pending.retryDueAtMs !== undefined) return;\n\temitRetryOutbound();\n}\n\nfunction processInbound<TOutbound, TInbound>(\n\tctx: Ctx,\n\tstate: BridgeState<TOutbound>,\n\tinput: unknown,\n\tsessionId: string,\n): void {\n\tif (isInvalidIngress(input)) {\n\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: input.error }]]);\n\t\treturn;\n\t}\n\tconst invalid = validateInboundEnvelope(input);\n\tif (invalid !== undefined) {\n\t\tctx.down([[\"DATA\", { kind: \"invalid\", error: invalid }]]);\n\t\treturn;\n\t}\n\tconst envelope = input as WireBridgeEnvelope<TInbound>;\n\tif (envelope.sessionId !== sessionId) {\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"session-mismatch\",\n\t\t\t\t\texpected: sessionId,\n\t\t\t\t\tactual: envelope.sessionId,\n\t\t\t\t} satisfies WireBridgeEvent<TOutbound, TInbound>,\n\t\t\t],\n\t\t]);\n\t\treturn;\n\t}\n\tconst seq = envelope.metadata.seq;\n\tconst expected = state.cursor + 1;\n\tif (seq <= state.cursor) {\n\t\tctx.down([[\"DATA\", { kind: \"duplicate\", seq, cursor: state.cursor }]]);\n\t\treturn;\n\t}\n\tif (seq > expected) {\n\t\tctx.down([[\"DATA\", { kind: \"out-of-order\", seq, expected }]]);\n\t\treturn;\n\t}\n\tif (envelope.metadata.cursor < state.remoteCursor) {\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"invalid\",\n\t\t\t\t\terror: `${sessionId}: inbound cursor ${envelope.metadata.cursor} regressed below ${state.remoteCursor}`,\n\t\t\t\t},\n\t\t\t],\n\t\t]);\n\t\treturn;\n\t}\n\tstate.remoteCursor = envelope.metadata.cursor;\n\tstate.cursor = seq;\n\tctx.down([[\"DATA\", { kind: \"cursor\", cursor: state.cursor }]]);\n\tctx.down([[\"DATA\", { kind: \"inbound\", envelope }]]);\n\tif (envelope.type === \"ack\" && envelope.metadata.ackForSeq !== undefined) {\n\t\tconst pending = state.pending.get(envelope.metadata.ackForSeq);\n\t\tif (pending === undefined) {\n\t\t\tctx.down([\n\t\t\t\t[\"DATA\", { kind: \"late-receipt\", receipt: \"ack\", ackForSeq: envelope.metadata.ackForSeq }],\n\t\t\t]);\n\t\t\treturn;\n\t\t}\n\t\tstate.pending.delete(envelope.metadata.ackForSeq);\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"ack\",\n\t\t\t\t\tackForSeq: envelope.metadata.ackForSeq,\n\t\t\t\t\tenvelope,\n\t\t\t\t\toutbound: pending.envelope,\n\t\t\t\t} satisfies WireBridgeEvent<TOutbound, TInbound>,\n\t\t\t],\n\t\t]);\n\t} else if (envelope.type === \"nack\" && envelope.metadata.ackForSeq !== undefined) {\n\t\tconst pending = state.pending.get(envelope.metadata.ackForSeq);\n\t\tif (pending === undefined) {\n\t\t\tctx.down([\n\t\t\t\t[\"DATA\", { kind: \"late-receipt\", receipt: \"nack\", ackForSeq: envelope.metadata.ackForSeq }],\n\t\t\t]);\n\t\t\treturn;\n\t\t}\n\t\tstate.pending.delete(envelope.metadata.ackForSeq);\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"nack\",\n\t\t\t\t\tackForSeq: envelope.metadata.ackForSeq,\n\t\t\t\t\tenvelope,\n\t\t\t\t\toutbound: pending.envelope,\n\t\t\t\t\terror: bridgePayloadError(envelope.payload, \"remote nack\"),\n\t\t\t\t} satisfies WireBridgeEvent<TOutbound, TInbound>,\n\t\t\t],\n\t\t]);\n\t}\n}\n","import { type Ctx, depBatch } from \"../ctx/types.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { CanonicalWireEdgeFrame } from \"./bridge-protobuf.js\";\nimport type {\n\tWireBridgeBundle,\n\tWireBridgeCommand,\n\tWireBridgeEnvelope,\n\tWireBridgeProtobufData,\n} from \"./bridge-types.js\";\n\nexport interface WireEdgeGroupEdge {\n\treadonly edgeId: string;\n\treadonly outbound?: Node<Uint8Array>;\n}\nexport type WireEdgeGroupIssueCode =\n\t| \"wire-edge-group-missing-snapshot\"\n\t| \"wire-edge-group-unknown-edge\"\n\t| \"wire-edge-group-duplicate-dirty\"\n\t| \"wire-edge-group-duplicate-data\"\n\t| \"wire-edge-group-data-before-dirty\"\n\t| \"wire-edge-group-competing-cause\"\n\t| \"wire-edge-group-malformed-frame\"\n\t| \"wire-edge-group-incomplete-cause\";\nexport interface WireEdgeGroupIssue {\n\treadonly code: WireEdgeGroupIssueCode;\n\treadonly message: string;\n\treadonly edgeId?: string;\n\treadonly causeId?: string;\n\treadonly activeCauseId?: string;\n}\nexport interface WireEdgeGroupStatus {\n\treadonly state: \"idle\" | \"collecting\" | \"released\" | \"issues\";\n\treadonly expectedEdges: readonly string[];\n\treadonly dirty: number;\n\treadonly data: number;\n\treadonly released: number;\n\treadonly issues: number;\n\treadonly activeCauseId?: string;\n\treadonly lastIssue?: WireEdgeGroupIssue;\n}\nexport interface WireEdgeGroupOptions {\n\treadonly name?: string;\n\treadonly edges: readonly WireEdgeGroupEdge[];\n}\nexport interface WireEdgeGroupBundle {\n\treadonly inbound: ReadonlyMap<string, Node<Uint8Array>>;\n\treadonly status: Node<WireEdgeGroupStatus>;\n\treadonly issues: Node<WireEdgeGroupIssue>;\n\trelease(): void;\n}\n\ntype Command = WireBridgeCommand<WireBridgeProtobufData>;\ntype Event =\n\t| { kind: \"outbound\"; command: Command }\n\t| { kind: \"frame\"; frame: CanonicalWireEdgeFrame }\n\t| { kind: \"bridge-end\" }\n\t| { kind: \"issue\"; issue: WireEdgeGroupIssue };\ntype Gate =\n\t| { kind: \"release\"; causeId: string; edgeId: string; value: Uint8Array }\n\t| { kind: \"progress\"; causeId: string; dirty: number; data: number }\n\t| { kind: \"issue\"; issue: WireEdgeGroupIssue };\ninterface OutState {\n\tnextCause: number;\n\tsnapshots: Map<string, Uint8Array>;\n}\ninterface GateState {\n\tactiveCauseId?: string;\n\tdirty: Set<string>;\n\tdata: Map<string, Uint8Array>;\n\tfailed: CauseTombstones;\n\treleased: CauseTombstones;\n}\n\nconst WIRE_EDGE_GROUP_CAUSE_TOMBSTONE_LIMIT = 1024;\n\nclass CauseTombstones {\n\tprivate readonly seen = new Set<string>();\n\tprivate readonly order: string[] = [];\n\n\thas(causeId: string): boolean {\n\t\treturn this.seen.has(causeId);\n\t}\n\n\tadd(causeId: string): void {\n\t\tif (this.seen.has(causeId)) return;\n\t\tthis.seen.add(causeId);\n\t\tthis.order.push(causeId);\n\t\twhile (this.order.length > WIRE_EDGE_GROUP_CAUSE_TOMBSTONE_LIMIT) {\n\t\t\tconst evicted = this.order.shift();\n\t\t\tif (evicted !== undefined) this.seen.delete(evicted);\n\t\t}\n\t}\n}\n\nexport function wireEdgeGroup(\n\tgraph: Graph,\n\tbridge: WireBridgeBundle<WireBridgeProtobufData, WireBridgeProtobufData>,\n\topts: WireEdgeGroupOptions,\n): WireEdgeGroupBundle {\n\tconst name = opts.name ?? \"wireEdgeGroup\";\n\tconst edges = normalize(opts.edges);\n\tconst expected = edges.map((edge) => edge.edgeId);\n\tconst outbound = edges\n\t\t.map((edge, index) => ({ edge, index }))\n\t\t.filter(\n\t\t\t(entry): entry is { edge: { edgeId: string; outbound: Node<Uint8Array> }; index: number } =>\n\t\t\t\tentry.edge.outbound !== undefined,\n\t\t);\n\tconst topology = graph.topologyGroup({ name: `${name}.wireEdgeGroup` });\n\tconst events = topology.node<Event>(\n\t\t[...outbound.map((entry) => entry.edge.outbound), bridge.inbound],\n\t\teventsFn(\n\t\t\tname,\n\t\t\tedges,\n\t\t\toutbound.map((entry) => entry.index),\n\t\t),\n\t\t{\n\t\t\tname: `${name}/events`,\n\t\t\tfactory: \"wireEdgeGroupEvents\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t\tterminalAsRealInput: true,\n\t\t},\n\t);\n\tconst gate = topology.node<Gate>([events], gateFn(name, expected), {\n\t\tname: `${name}/gate`,\n\t\tfactory: \"wireEdgeGroupGate\",\n\t\tpartial: true,\n\t\tcompleteWhenDepsComplete: false,\n\t\terrorWhenDepsError: false,\n\t});\n\tconst commands = topology.node<Command>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as Event;\n\t\t\t\tif (event.kind === \"outbound\") ctx.down([[\"DATA\", event.command]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/commands`,\n\t\t\tfactory: \"wireEdgeGroupCommands\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst issues = topology.node<WireEdgeGroupIssue>(\n\t\t[events, gate],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as Event;\n\t\t\t\tif (event.kind === \"issue\") ctx.down([[\"DATA\", event.issue]]);\n\t\t\t}\n\t\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\t\tconst event = raw as Gate;\n\t\t\t\tif (event.kind === \"issue\") ctx.down([[\"DATA\", event.issue]]);\n\t\t\t}\n\t\t},\n\t\t{\n\t\t\tname: `${name}/issues`,\n\t\t\tfactory: \"wireEdgeGroupIssues\",\n\t\t\tpartial: true,\n\t\t\tcompleteWhenDepsComplete: false,\n\t\t\terrorWhenDepsError: false,\n\t\t},\n\t);\n\tconst status = topology.node<WireEdgeGroupStatus>([events, gate], statusFn(expected), {\n\t\tname: `${name}/status`,\n\t\tfactory: \"wireEdgeGroupStatus\",\n\t\tpartial: true,\n\t\tcompleteWhenDepsComplete: false,\n\t\terrorWhenDepsError: false,\n\t});\n\tconst inbound = new Map(\n\t\tedges.map(\n\t\t\t(edge) =>\n\t\t\t\t[\n\t\t\t\t\tedge.edgeId,\n\t\t\t\t\ttopology.node<Uint8Array>(\n\t\t\t\t\t\t[gate],\n\t\t\t\t\t\t(ctx) => {\n\t\t\t\t\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\t\t\t\t\tconst event = raw as Gate;\n\t\t\t\t\t\t\t\tif (event.kind === \"release\" && event.edgeId === edge.edgeId)\n\t\t\t\t\t\t\t\t\tctx.down([[\"DATA\", Uint8Array.from(event.value)]]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t},\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tname: `${name}/inbound/${edge.edgeId}`,\n\t\t\t\t\t\t\tfactory: \"wireEdgeGroupInboundEdge\",\n\t\t\t\t\t\t\tpartial: true,\n\t\t\t\t\t\t\tcompleteWhenDepsComplete: false,\n\t\t\t\t\t\t\terrorWhenDepsError: false,\n\t\t\t\t\t\t\tmeta: { edgeId: edge.edgeId },\n\t\t\t\t\t\t},\n\t\t\t\t\t),\n\t\t\t\t] as const,\n\t\t),\n\t);\n\tbridge.command.replaceDeps([commands], commandSourceFn());\n\tlet released = false;\n\treturn {\n\t\tinbound,\n\t\tstatus,\n\t\tissues,\n\t\trelease() {\n\t\t\tif (released) return;\n\t\t\tbridge.command.replaceDeps([], commandSourceFn());\n\t\t\ttry {\n\t\t\t\ttopology.release({ reason: `${name}.wireEdgeGroup.release` });\n\t\t\t\treleased = true;\n\t\t\t} catch (error) {\n\t\t\t\tbridge.command.replaceDeps([commands], commandSourceFn());\n\t\t\t\tthrow error;\n\t\t\t}\n\t\t},\n\t};\n}\n\nfunction commandSourceFn(): (ctx: Ctx) => void {\n\treturn (ctx) => {\n\t\tfor (const command of depBatch(ctx, 0) ?? []) ctx.down([[\"DATA\", command as Command]]);\n\t};\n}\nfunction normalize(edges: readonly WireEdgeGroupEdge[]) {\n\tconst seen = new Set<string>();\n\tif (edges.length === 0) throw new RangeError(\"wireEdgeGroup: edges must be non-empty\");\n\treturn edges.map((edge) => {\n\t\tif (!edge.edgeId) throw new RangeError(\"wireEdgeGroup: edgeId must be a non-empty string\");\n\t\tif (seen.has(edge.edgeId))\n\t\t\tthrow new RangeError(`wireEdgeGroup: duplicate edgeId ${edge.edgeId}`);\n\t\tseen.add(edge.edgeId);\n\t\treturn edge;\n\t});\n}\nfunction issue(\n\tcode: WireEdgeGroupIssueCode,\n\tmessage: string,\n\textra: Omit<WireEdgeGroupIssue, \"code\" | \"message\"> = {},\n): WireEdgeGroupIssue {\n\treturn { code, message, ...extra };\n}\nfunction send(frame: CanonicalWireEdgeFrame): Command {\n\treturn { kind: \"send\", payload: { kind: \"wire_edge\", frame: clone(frame) } };\n}\nfunction clone(frame: CanonicalWireEdgeFrame): CanonicalWireEdgeFrame {\n\treturn frame.kind === \"data\"\n\t\t? {\n\t\t\t\tkind: \"data\",\n\t\t\t\tedgeId: frame.edgeId,\n\t\t\t\tcauseId: frame.causeId,\n\t\t\t\tvalue: Uint8Array.from(frame.value ?? new Uint8Array()),\n\t\t\t}\n\t\t: { kind: \"dirty\", edgeId: frame.edgeId, causeId: frame.causeId };\n}\nfunction eventsFn(\n\tname: string,\n\tedges: readonly WireEdgeGroupEdge[],\n\toutboundIndexes: readonly number[],\n): (ctx: Ctx) => void {\n\tconst byDep = new Map<number, WireEdgeGroupEdge>();\n\toutboundIndexes.forEach((edgeIndex, depIndex) => {\n\t\tbyDep.set(depIndex, edges[edgeIndex]);\n\t});\n\tconst inboundIndex = outboundIndexes.length;\n\treturn (ctx) => {\n\t\tlet st = ctx.state.get<OutState>();\n\t\tif (!st) {\n\t\t\tst = { nextCause: 1, snapshots: new Map() };\n\t\t\tctx.state.set(st);\n\t\t}\n\t\tlet trigger = false;\n\t\tfor (let i = 0; i < outboundIndexes.length; i++) {\n\t\t\tconst edge = byDep.get(i);\n\t\t\tif (!edge) continue;\n\t\t\tfor (const raw of depBatch(ctx, i) ?? []) {\n\t\t\t\tif (!(raw instanceof Uint8Array))\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"issue\",\n\t\t\t\t\t\t\t\tissue: issue(\n\t\t\t\t\t\t\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t\t\t\t\t\t\t`${name}: outbound edge ${edge.edgeId} must emit Uint8Array bytes`,\n\t\t\t\t\t\t\t\t\t{ edgeId: edge.edgeId },\n\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t} satisfies Event,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\telse {\n\t\t\t\t\tst.snapshots.set(edge.edgeId, Uint8Array.from(raw));\n\t\t\t\t\ttrigger = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (trigger) emitOutbound(ctx, name, edges, st);\n\t\tfor (const rawEnvelope of depBatch(ctx, inboundIndex) ?? []) {\n\t\t\tconst ev = frameEvent(name, rawEnvelope as WireBridgeEnvelope<unknown>);\n\t\t\tif (ev) ctx.down([[\"DATA\", ev]]);\n\t\t}\n\t};\n}\nfunction emitOutbound(\n\tctx: Ctx,\n\tname: string,\n\tedges: readonly WireEdgeGroupEdge[],\n\tst: OutState,\n): void {\n\tconst missing = edges.filter((edge) => !st.snapshots.has(edge.edgeId));\n\tif (missing.length) {\n\t\tfor (const edge of missing)\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"issue\",\n\t\t\t\t\t\tissue: issue(\n\t\t\t\t\t\t\t\"wire-edge-group-missing-snapshot\",\n\t\t\t\t\t\t\t`${name}: missing outbound snapshot for edge ${edge.edgeId}`,\n\t\t\t\t\t\t\t{ edgeId: edge.edgeId },\n\t\t\t\t\t\t),\n\t\t\t\t\t} satisfies Event,\n\t\t\t\t],\n\t\t\t]);\n\t\treturn;\n\t}\n\tconst causeId = `${name}:cause:${st.nextCause++}`;\n\tfor (const edge of edges)\n\t\tctx.down([\n\t\t\t[\n\t\t\t\t\"DATA\",\n\t\t\t\t{\n\t\t\t\t\tkind: \"outbound\",\n\t\t\t\t\tcommand: send({ kind: \"dirty\", edgeId: edge.edgeId, causeId }),\n\t\t\t\t} satisfies Event,\n\t\t\t],\n\t\t]);\n\tfor (const edge of edges) {\n\t\tconst value = st.snapshots.get(edge.edgeId);\n\t\tif (value)\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"outbound\",\n\t\t\t\t\t\tcommand: send({ kind: \"data\", edgeId: edge.edgeId, causeId, value }),\n\t\t\t\t\t} satisfies Event,\n\t\t\t\t],\n\t\t\t]);\n\t}\n}\nfunction frameEvent(name: string, envelope: WireBridgeEnvelope<unknown>): Event | undefined {\n\tif (envelope.type === \"close\" || envelope.type === \"error\") return { kind: \"bridge-end\" };\n\tif (envelope.type !== \"data\") return undefined;\n\tconst value = envelope.payload?.kind === \"data\" ? envelope.payload.value : undefined;\n\tif (\n\t\tvalue instanceof Uint8Array ||\n\t\t(typeof value === \"object\" && value !== null && (value as { kind?: unknown }).kind === \"value\")\n\t)\n\t\treturn undefined;\n\tif (\n\t\ttypeof value !== \"object\" ||\n\t\tvalue === null ||\n\t\t(value as { kind?: unknown }).kind !== \"wire_edge\"\n\t)\n\t\treturn {\n\t\t\tkind: \"issue\",\n\t\t\tissue: issue(\n\t\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t\t`${name}: wire-edge payload must be a wire_edge frame`,\n\t\t\t),\n\t\t};\n\tconst frame = (value as { frame?: unknown }).frame;\n\tconst bad = validate(name, frame);\n\treturn bad\n\t\t? { kind: \"issue\", issue: bad }\n\t\t: { kind: \"frame\", frame: clone(frame as CanonicalWireEdgeFrame) };\n}\nfunction validate(name: string, frame: unknown): WireEdgeGroupIssue | undefined {\n\tif (typeof frame !== \"object\" || frame === null)\n\t\treturn issue(\"wire-edge-group-malformed-frame\", `${name}: wire-edge frame must be an object`);\n\tconst f = frame as Partial<CanonicalWireEdgeFrame>;\n\tif (f.kind !== \"dirty\" && f.kind !== \"data\")\n\t\treturn issue(\n\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t`${name}: wire-edge frame kind must be dirty or data`,\n\t\t);\n\tif (!f.edgeId)\n\t\treturn issue(\n\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t`${name}: wire-edge frame edgeId must be non-empty`,\n\t\t\t{ causeId: f.causeId },\n\t\t);\n\tif (!f.causeId)\n\t\treturn issue(\n\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t`${name}: wire-edge frame causeId must be non-empty`,\n\t\t\t{ edgeId: f.edgeId },\n\t\t);\n\tif (f.kind === \"dirty\" && f.value !== undefined)\n\t\treturn issue(\n\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t`${name}: DIRTY wire-edge frame must not carry value bytes`,\n\t\t\t{ edgeId: f.edgeId, causeId: f.causeId },\n\t\t);\n\tif (f.kind === \"data\" && !(f.value instanceof Uint8Array))\n\t\treturn issue(\n\t\t\t\"wire-edge-group-malformed-frame\",\n\t\t\t`${name}: DATA wire-edge frame requires Uint8Array value bytes`,\n\t\t\t{ edgeId: f.edgeId, causeId: f.causeId },\n\t\t);\n\treturn undefined;\n}\nfunction gateFn(name: string, expectedIds: readonly string[]): (ctx: Ctx) => void {\n\tconst expected = new Set(expectedIds);\n\treturn (ctx) => {\n\t\tlet st = ctx.state.get<GateState>();\n\t\tif (!st) {\n\t\t\tst = {\n\t\t\t\tdirty: new Set(),\n\t\t\t\tdata: new Map(),\n\t\t\t\tfailed: new CauseTombstones(),\n\t\t\t\treleased: new CauseTombstones(),\n\t\t\t};\n\t\t\tctx.state.set(st);\n\t\t}\n\t\tconst emitIssue = (i: WireEdgeGroupIssue) =>\n\t\t\tctx.down([[\"DATA\", { kind: \"issue\", issue: i } satisfies Gate]]);\n\t\tconst reset = () => {\n\t\t\tst.activeCauseId = undefined;\n\t\t\tst.dirty.clear();\n\t\t\tst.data.clear();\n\t\t};\n\t\tconst fail = (causeId?: string) => {\n\t\t\tif (causeId) st.failed.add(causeId);\n\t\t\treset();\n\t\t};\n\t\tconst progress = (causeId: string) =>\n\t\t\tctx.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{ kind: \"progress\", causeId, dirty: st.dirty.size, data: st.data.size } satisfies Gate,\n\t\t\t\t],\n\t\t\t]);\n\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\tconst ev = raw as Event;\n\t\t\tif (ev.kind === \"issue\") {\n\t\t\t\temitIssue(ev.issue);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (ev.kind === \"outbound\") continue;\n\t\t\tif (ev.kind === \"bridge-end\") {\n\t\t\t\tif (st.activeCauseId) {\n\t\t\t\t\temitIssue(\n\t\t\t\t\t\tissue(\n\t\t\t\t\t\t\t\"wire-edge-group-incomplete-cause\",\n\t\t\t\t\t\t\t`${name}: cause ${st.activeCauseId} ended before all expected edge frames arrived`,\n\t\t\t\t\t\t\t{ causeId: st.activeCauseId },\n\t\t\t\t\t\t),\n\t\t\t\t\t);\n\t\t\t\t\tfail(st.activeCauseId);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst f = ev.frame;\n\t\t\tif (st.failed.has(f.causeId)) {\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\n\t\t\t\t\t\t\"wire-edge-group-incomplete-cause\",\n\t\t\t\t\t\t`${name}: cause ${f.causeId} was already failed closed`,\n\t\t\t\t\t\t{ edgeId: f.edgeId, causeId: f.causeId },\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (st.released.has(f.causeId)) {\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\n\t\t\t\t\t\tf.kind === \"dirty\"\n\t\t\t\t\t\t\t? \"wire-edge-group-duplicate-dirty\"\n\t\t\t\t\t\t\t: \"wire-edge-group-duplicate-data\",\n\t\t\t\t\t\t`${name}: cause ${f.causeId} was already released`,\n\t\t\t\t\t\t{ edgeId: f.edgeId, causeId: f.causeId },\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!expected.has(f.edgeId)) {\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\"wire-edge-group-unknown-edge\", `${name}: unknown edge ${f.edgeId}`, {\n\t\t\t\t\t\tedgeId: f.edgeId,\n\t\t\t\t\t\tcauseId: f.causeId,\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\tfail(f.causeId);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!st.activeCauseId) st.activeCauseId = f.causeId;\n\t\t\tif (st.activeCauseId !== f.causeId) {\n\t\t\t\tconst activeCauseId = st.activeCauseId;\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\n\t\t\t\t\t\t\"wire-edge-group-competing-cause\",\n\t\t\t\t\t\t`${name}: competing cause ${f.causeId} arrived while ${activeCauseId} is active`,\n\t\t\t\t\t\t{ edgeId: f.edgeId, causeId: f.causeId, activeCauseId },\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\n\t\t\t\t\t\t\"wire-edge-group-incomplete-cause\",\n\t\t\t\t\t\t`${name}: active cause ${activeCauseId} is incomplete`,\n\t\t\t\t\t\t{ causeId: activeCauseId },\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tfail(activeCauseId);\n\t\t\t\tst.failed.add(f.causeId);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (f.kind === \"dirty\") {\n\t\t\t\tif (st.dirty.has(f.edgeId)) {\n\t\t\t\t\temitIssue(\n\t\t\t\t\t\tissue(\n\t\t\t\t\t\t\t\"wire-edge-group-duplicate-dirty\",\n\t\t\t\t\t\t\t`${name}: duplicate DIRTY for edge ${f.edgeId}`,\n\t\t\t\t\t\t\t{ edgeId: f.edgeId, causeId: f.causeId },\n\t\t\t\t\t\t),\n\t\t\t\t\t);\n\t\t\t\t\tfail(f.causeId);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tst.dirty.add(f.edgeId);\n\t\t\t\tprogress(f.causeId);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!st.dirty.has(f.edgeId)) {\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\n\t\t\t\t\t\t\"wire-edge-group-data-before-dirty\",\n\t\t\t\t\t\t`${name}: DATA for edge ${f.edgeId} arrived before DIRTY`,\n\t\t\t\t\t\t{ edgeId: f.edgeId, causeId: f.causeId },\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tfail(f.causeId);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (st.data.has(f.edgeId)) {\n\t\t\t\temitIssue(\n\t\t\t\t\tissue(\"wire-edge-group-duplicate-data\", `${name}: duplicate DATA for edge ${f.edgeId}`, {\n\t\t\t\t\t\tedgeId: f.edgeId,\n\t\t\t\t\t\tcauseId: f.causeId,\n\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\tfail(f.causeId);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tst.data.set(f.edgeId, Uint8Array.from(f.value ?? new Uint8Array()));\n\t\t\tif (st.dirty.size === expectedIds.length && st.data.size === expectedIds.length) {\n\t\t\t\tfor (const edgeId of expectedIds) {\n\t\t\t\t\tconst value = st.data.get(edgeId);\n\t\t\t\t\tif (value)\n\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tkind: \"release\",\n\t\t\t\t\t\t\t\t\tcauseId: f.causeId,\n\t\t\t\t\t\t\t\t\tedgeId,\n\t\t\t\t\t\t\t\t\tvalue: Uint8Array.from(value),\n\t\t\t\t\t\t\t\t} satisfies Gate,\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t\tst.released.add(f.causeId);\n\t\t\t\treset();\n\t\t\t} else progress(f.causeId);\n\t\t}\n\t};\n}\nfunction statusFn(expectedIds: readonly string[]): (ctx: Ctx) => void {\n\treturn (ctx) => {\n\t\tlet next =\n\t\t\tctx.state.get<WireEdgeGroupStatus>() ??\n\t\t\t({\n\t\t\t\tstate: \"idle\",\n\t\t\t\texpectedEdges: [...expectedIds],\n\t\t\t\tdirty: 0,\n\t\t\t\tdata: 0,\n\t\t\t\treleased: 0,\n\t\t\t\tissues: 0,\n\t\t\t} satisfies WireEdgeGroupStatus);\n\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\tconst ev = raw as Event;\n\t\t\tif (ev.kind === \"issue\")\n\t\t\t\tnext = { ...next, state: \"issues\", issues: next.issues + 1, lastIssue: ev.issue };\n\t\t}\n\t\tfor (const raw of depBatch(ctx, 1) ?? []) {\n\t\t\tconst ev = raw as Gate;\n\t\t\tif (ev.kind === \"issue\")\n\t\t\t\tnext = { ...next, state: \"issues\", issues: next.issues + 1, lastIssue: ev.issue };\n\t\t\telse if (ev.kind === \"progress\")\n\t\t\t\tnext = {\n\t\t\t\t\t...next,\n\t\t\t\t\tstate: \"collecting\",\n\t\t\t\t\tactiveCauseId: ev.causeId,\n\t\t\t\t\tdirty: ev.dirty,\n\t\t\t\t\tdata: ev.data,\n\t\t\t\t};\n\t\t\telse\n\t\t\t\tnext = {\n\t\t\t\t\t...next,\n\t\t\t\t\tstate: \"released\",\n\t\t\t\t\tactiveCauseId: ev.causeId,\n\t\t\t\t\tdirty: expectedIds.length,\n\t\t\t\t\tdata: expectedIds.length,\n\t\t\t\t\treleased: next.released + 1,\n\t\t\t\t};\n\t\t}\n\t\tctx.state.set(next);\n\t\tctx.down([[\"DATA\", next]]);\n\t};\n}\n","/**\n * Graph-visible outbound environment adapters (D130/D132).\n *\n * Async transport work is confined to graph-local EnvironmentDrivers. Each\n * helper returns declared nodes for events/status/attempts/errors instead of a\n * hidden sink side channel.\n */\n\nimport { type Ctx, depBatch } from \"../ctx/types.js\";\nimport type {\n\tDriverCancel,\n\tHttpResponse,\n\tProcessResult,\n\tWebSocketRequest,\n\tWebSocketSendResult,\n} from \"../graph/environment.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport { nextRetryDelayMs, retryPolicy, shouldRetry } from \"../graph/resilience.js\";\nimport type { Node } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport type {\n\tHttpRequestOf,\n\tOutboundAdapterOptions,\n\tOutboundBundle,\n\tOutboundEvent,\n\tOutboundStatus,\n\tProcessCommandOf,\n\tWebSocketSendOf,\n} from \"./environment-types.js\";\n\ninterface SendState {\n\tseq: number;\n\tcancels: Map<number, DriverCancel>;\n\ttimers: Map<number, ReturnType<typeof setTimeout>>;\n\tactive: boolean;\n\tcleanupInstalled: boolean;\n}\n\nfunction assertSourceLocal<T>(source: Node<T>): Node<T> {\n\treturn source;\n}\n\nfunction initSendState(ctx: Ctx): SendState {\n\tlet state = ctx.state.get<SendState>();\n\tif (state === undefined) {\n\t\tstate = {\n\t\t\tseq: 0,\n\t\t\tcancels: new Map(),\n\t\t\ttimers: new Map(),\n\t\t\tactive: true,\n\t\t\tcleanupInstalled: false,\n\t\t};\n\t\tctx.state.set(state);\n\t}\n\tstate.active = true;\n\tif (!state.cleanupInstalled) {\n\t\tstate.cleanupInstalled = true;\n\t\tctx.onDeactivation(() => {\n\t\t\tstate.active = false;\n\t\t\tstate.cleanupInstalled = false;\n\t\t\tfor (const cancel of state.cancels.values()) runCancel(cancel);\n\t\t\tfor (const timer of state.timers.values()) clearTimeout(timer);\n\t\t\tstate.cancels.clear();\n\t\t\tstate.timers.clear();\n\t\t});\n\t}\n\treturn state;\n}\n\nexport function runCancel(cancel: DriverCancel): void {\n\ttry {\n\t\tcancel();\n\t} catch {\n\t\t// Driver cancellation is best-effort and must not hide graph-visible outcomes.\n\t}\n}\n\nfunction outboundNodes<TValue, TResult>(\n\tgraph: Graph,\n\tevents: Node<OutboundEvent<TValue, TResult>>,\n\tname: string,\n): OutboundBundle<TValue, TResult> {\n\tconst status = graph.node<OutboundStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tconst current =\n\t\t\t\tctx.state.get<OutboundStatus>() ??\n\t\t\t\t({ state: \"idle\", inFlight: 0, attempt: 0, sent: 0, failed: 0 } satisfies OutboundStatus);\n\t\t\tlet next = current;\n\t\t\tfor (const event of depBatch(ctx, 0) ?? []) {\n\t\t\t\tnext = reduceStatus(next, event as OutboundEvent<TValue, TResult>);\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"outboundStatus\" },\n\t);\n\tconst attempts = graph.node<number>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const event of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst typed = event as OutboundEvent<TValue, TResult>;\n\t\t\t\tif (\"attempt\" in typed) ctx.down([[\"DATA\", typed.attempt]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/attempts`, factory: \"outboundAttempts\" },\n\t);\n\tconst errors = graph.node<unknown>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const event of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst typed = event as OutboundEvent<TValue, TResult>;\n\t\t\t\tif (\"error\" in typed) ctx.down([[\"DATA\", typed.error]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"outboundErrors\" },\n\t);\n\treturn { events, status, attempts, errors };\n}\n\nfunction reduceStatus<TValue, TResult>(\n\tcurrent: OutboundStatus,\n\tevent: OutboundEvent<TValue, TResult>,\n): OutboundStatus {\n\tswitch (event.kind) {\n\t\tcase \"attempt\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"running\",\n\t\t\t\tinFlight: current.inFlight + 1,\n\t\t\t\tattempt: event.attempt,\n\t\t\t};\n\t\tcase \"retry\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"waiting\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tlastDelayMs: event.delayMs,\n\t\t\t};\n\t\tcase \"sent\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"succeeded\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tsent: current.sent + 1,\n\t\t\t\tlastDelayMs: undefined,\n\t\t\t};\n\t\tcase \"failed\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"failed\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tfailed: current.failed + 1,\n\t\t\t};\n\t\tcase \"exhausted\":\n\t\t\treturn {\n\t\t\t\t...current,\n\t\t\t\tstate: \"exhausted\",\n\t\t\t\tinFlight: Math.max(0, current.inFlight - 1),\n\t\t\t\tattempt: event.attempt,\n\t\t\t\tfailed: current.failed + 1,\n\t\t\t};\n\t\tcase \"upstream-complete\":\n\t\t\treturn { ...current, state: \"completed\" };\n\t\tcase \"upstream-error\":\n\t\t\treturn { ...current, state: \"failed\", failed: current.failed + 1 };\n\t}\n}\n\nfunction outboundNode<TValue, TResult>(\n\tgraph: Graph,\n\tsource: Node<TValue>,\n\tname: string,\n\tsend: (\n\t\tctx: Ctx,\n\t\tvalue: TValue,\n\t\tcallback: (result: { ok: true; value: TResult } | { ok: false; error: unknown }) => void,\n\t) => DriverCancel | undefined,\n\topts: OutboundAdapterOptions,\n): Node<OutboundEvent<TValue, TResult>> {\n\tconst policy = opts.retry ?? retryPolicy();\n\treturn graph.node<OutboundEvent<TValue, TResult>>(\n\t\t[assertSourceLocal(source)],\n\t\t(ctx) => {\n\t\t\tconst state = initSendState(ctx);\n\t\t\tconst start = (value: TValue, attempt: number) => {\n\t\t\t\tif (!state.active) return;\n\t\t\t\tconst id = state.seq++;\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", { kind: \"attempt\", value, attempt } satisfies OutboundEvent<TValue, TResult>],\n\t\t\t\t]);\n\t\t\t\tconst failTerminal = (error: unknown) => {\n\t\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{ kind: \"exhausted\", value, attempt, error: payload } satisfies OutboundEvent<\n\t\t\t\t\t\t\t\tTValue,\n\t\t\t\t\t\t\t\tTResult\n\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tctx.down([[\"ERROR\", payload]]);\n\t\t\t\t};\n\t\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\t\tlet done = false;\n\t\t\t\ttry {\n\t\t\t\t\tcancel = send(ctx, value, (result) => {\n\t\t\t\t\t\tif (done || !state.active) return;\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tstate.cancels.delete(id);\n\t\t\t\t\t\tif (result.ok) {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{ kind: \"sent\", value, attempt, result: result.value } satisfies OutboundEvent<\n\t\t\t\t\t\t\t\t\t\tTValue,\n\t\t\t\t\t\t\t\t\t\tTResult\n\t\t\t\t\t\t\t\t\t>,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (shouldRetry(policy, attempt)) {\n\t\t\t\t\t\t\tconst nextAttempt = attempt + 1;\n\t\t\t\t\t\t\tconst delayMs = nextRetryDelayMs(policy, nextAttempt) ?? 0;\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tkind: \"retry\",\n\t\t\t\t\t\t\t\t\t\tvalue,\n\t\t\t\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\t\t\t\tdelayMs,\n\t\t\t\t\t\t\t\t\t\terror: errorPayload(result.error),\n\t\t\t\t\t\t\t\t\t} satisfies OutboundEvent<TValue, TResult>,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\tconst timer = setTimeout(() => {\n\t\t\t\t\t\t\t\tstate.timers.delete(id);\n\t\t\t\t\t\t\t\tif (!state.active) return;\n\t\t\t\t\t\t\t\tstart(value, nextAttempt);\n\t\t\t\t\t\t\t}, delayMs);\n\t\t\t\t\t\t\tstate.timers.set(id, timer);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tkind: \"exhausted\",\n\t\t\t\t\t\t\t\t\t\tvalue,\n\t\t\t\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\t\t\t\terror: errorPayload(result.error),\n\t\t\t\t\t\t\t\t\t} satisfies OutboundEvent<TValue, TResult>,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tif (!done) {\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tstate.cancels.delete(id);\n\t\t\t\t\t\tfailTerminal(error);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (cancel === undefined) {\n\t\t\t\t\tif (!done) {\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tfailTerminal(`${name}: missing environment driver capability`);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (!done && state.active) {\n\t\t\t\t\tstate.cancels.set(id, cancel);\n\t\t\t\t} else if (!state.active) {\n\t\t\t\t\trunCancel(cancel);\n\t\t\t\t}\n\t\t\t};\n\t\t\tfor (const value of depBatch(ctx, 0) ?? []) start(value as TValue, 1);\n\t\t\tconst terminal = ctx.terminal[0];\n\t\t\tif (terminal === true) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\"DATA\", { kind: \"upstream-complete\" } satisfies OutboundEvent<TValue, TResult>],\n\t\t\t\t]);\n\t\t\t} else if (terminal !== false && terminal !== undefined) {\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{ kind: \"upstream-error\", error: terminal } satisfies OutboundEvent<TValue, TResult>,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t}\n\t\t},\n\t\t{ name, factory: name },\n\t);\n}\n\nexport function toHttp<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\trequestOf: HttpRequestOf<T>,\n\topts: OutboundAdapterOptions = {},\n): OutboundBundle<T, HttpResponse> {\n\tconst name = opts.name ?? \"toHttp\";\n\tconst events = outboundNode<T, HttpResponse>(\n\t\tgraph,\n\t\tsource,\n\t\tname,\n\t\t(ctx, value, callback) => {\n\t\t\tconst request = requestOf(value);\n\t\t\treturn ctx.environment().httpDriver()?.request(request, callback);\n\t\t},\n\t\topts,\n\t);\n\treturn outboundNodes(graph, events, name);\n}\n\nexport function toProcess<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\tcommandOf: ProcessCommandOf<T>,\n\topts: OutboundAdapterOptions = {},\n): OutboundBundle<T, ProcessResult> {\n\tconst name = opts.name ?? \"toProcess\";\n\tconst events = outboundNode<T, ProcessResult>(\n\t\tgraph,\n\t\tsource,\n\t\tname,\n\t\t(ctx, value, callback) => {\n\t\t\tconst command = commandOf(value);\n\t\t\treturn ctx.environment().processDriver()?.run(command, callback);\n\t\t},\n\t\topts,\n\t);\n\treturn outboundNodes(graph, events, name);\n}\n\nexport function toWebSocket<T>(\n\tgraph: Graph,\n\tsource: Node<T>,\n\trequest: WebSocketRequest,\n\tsendOf: WebSocketSendOf<T>,\n\topts: OutboundAdapterOptions = {},\n): OutboundBundle<T, WebSocketSendResult> {\n\tconst name = opts.name ?? \"toWebSocket\";\n\tconst events = outboundNode<T, WebSocketSendResult>(\n\t\tgraph,\n\t\tsource,\n\t\tname,\n\t\t(ctx, value, callback) => {\n\t\t\tconst driver = ctx.environment().webSocketDriver();\n\t\t\treturn driver?.send?.(request, sendOf(value), callback);\n\t\t},\n\t\topts,\n\t);\n\treturn outboundNodes(graph, events, name);\n}\n","/**\n * Graph-visible outbound environment adapters (D130/D132).\n *\n * Async transport work is confined to graph-local EnvironmentDrivers. Each\n * helper returns declared nodes for events/status/attempts/errors instead of a\n * hidden sink side channel.\n */\n\nimport { type Ctx, depBatch } from \"../ctx/types.js\";\nimport type {\n\tDriverCancel,\n\tWebSocketRequest,\n\tWebSocketSend,\n\tWebSocketSessionHandle,\n} from \"../graph/environment.js\";\nimport type { Graph } from \"../graph/graph.js\";\nimport {\n\tnextRetryDelayMs,\n\ttype RetryPolicy,\n\tretryPolicy,\n\tshouldRetry,\n} from \"../graph/resilience.js\";\nimport type { Node } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport { runCancel } from \"./environment-outbound.js\";\nimport type {\n\tWebSocketSessionBundle,\n\tWebSocketSessionCommand,\n\tWebSocketSessionInbound,\n\tWebSocketSessionLifecycle,\n\tWebSocketSessionOptions,\n\tWebSocketSessionOutbound,\n\tWebSocketSessionSendPolicy,\n\tWebSocketSessionStatus,\n} from \"./environment-types.js\";\n\ntype WebSocketSessionEvent =\n\t| { readonly kind: \"attempt\"; readonly attempt: number; readonly maxAttempts: number }\n\t| { readonly kind: \"open\"; readonly attempt: number }\n\t| { readonly kind: \"message\"; readonly message: WebSocketSessionInbound }\n\t| { readonly kind: \"sent\"; readonly message: WebSocketSend }\n\t| { readonly kind: \"closing\"; readonly code?: number; readonly reason?: string }\n\t| { readonly kind: \"closed\"; readonly code?: number; readonly reason?: string }\n\t| {\n\t\t\treadonly kind: \"retry\";\n\t\t\treadonly attempt: number;\n\t\t\treadonly nextAttempt: number;\n\t\t\treadonly delayMs: number;\n\t\t\treadonly error: unknown;\n\t  }\n\t| { readonly kind: \"outbound\"; readonly fact: WebSocketSessionOutbound }\n\t| { readonly kind: \"error\"; readonly error: unknown; readonly attempt?: number }\n\t| { readonly kind: \"exhausted\"; readonly attempt: number; readonly error: unknown };\n\ninterface WebSocketSessionState {\n\tactive: boolean;\n\tconnected: boolean;\n\tcleanupInstalled: boolean;\n\tcurrentAttempt: number;\n\tcurrentSession: WebSocketSessionHandle | undefined;\n\tsendCancels: Map<number, DriverCancel>;\n\tliveSends: Map<number, PendingWebSocketOutbound>;\n\tpendingOutbound: PendingWebSocketOutbound[];\n\ttimers: Map<number, ReturnType<typeof setTimeout>>;\n\tseq: number;\n\toutboundSeq: number;\n}\n\ninterface PendingWebSocketOutbound {\n\treadonly seq: number;\n\treadonly message: WebSocketSend;\n}\n\nfunction initWebSocketSessionState(ctx: Ctx): WebSocketSessionState {\n\tlet state = ctx.state.get<WebSocketSessionState>();\n\tif (state === undefined) {\n\t\tstate = {\n\t\t\tactive: true,\n\t\t\tconnected: false,\n\t\t\tcleanupInstalled: false,\n\t\t\tcurrentAttempt: 0,\n\t\t\tcurrentSession: undefined,\n\t\t\tsendCancels: new Map(),\n\t\t\tliveSends: new Map(),\n\t\t\tpendingOutbound: [],\n\t\t\ttimers: new Map(),\n\t\t\tseq: 0,\n\t\t\toutboundSeq: 0,\n\t\t};\n\t\tctx.state.set(state);\n\t}\n\tstate.active = true;\n\tif (!state.cleanupInstalled) {\n\t\tstate.cleanupInstalled = true;\n\t\tctx.onDeactivation(() => {\n\t\t\tconst sendCancels = [...state.sendCancels.values()];\n\t\t\tconst timers = [...state.timers.values()];\n\t\t\tconst session = state.currentSession;\n\t\t\tstate.active = false;\n\t\t\tstate.cleanupInstalled = false;\n\t\t\tstate.connected = false;\n\t\t\tstate.currentAttempt = 0;\n\t\t\tstate.currentSession = undefined;\n\t\t\tstate.sendCancels.clear();\n\t\t\tstate.liveSends.clear();\n\t\t\tstate.pendingOutbound = [];\n\t\t\tstate.timers.clear();\n\t\t\tfor (const cancel of sendCancels) runCancel(cancel);\n\t\t\tfor (const timer of timers) clearTimeout(timer);\n\t\t\tsession?.cancel();\n\t\t});\n\t}\n\treturn state;\n}\n\nfunction closeWebSocketSessionState(\n\tstate: WebSocketSessionState,\n\tdriverAction: \"cancel\" | \"none\" = \"cancel\",\n): {\n\treadonly canceled: PendingWebSocketOutbound[];\n\treadonly session: WebSocketSessionHandle | undefined;\n} {\n\tconst session = state.currentSession;\n\tconst timers = [...state.timers.values()];\n\tconst sendCancels = [...state.sendCancels.values()];\n\tconst canceled = [...state.pendingOutbound, ...state.liveSends.values()];\n\tstate.connected = false;\n\tstate.currentAttempt = 0;\n\tstate.currentSession = undefined;\n\tstate.timers.clear();\n\tstate.sendCancels.clear();\n\tstate.pendingOutbound = [];\n\tstate.liveSends.clear();\n\tfor (const timer of timers) clearTimeout(timer);\n\tfor (const cancelSend of sendCancels) runCancel(cancelSend);\n\tif (driverAction === \"cancel\") session?.cancel();\n\treturn { canceled, session };\n}\n\nfunction cancelRetryTimers(state: WebSocketSessionState): void {\n\tfor (const timer of state.timers.values()) clearTimeout(timer);\n\tstate.timers.clear();\n}\n\nfunction cleanupWebSocketConnection(\n\tstate: WebSocketSessionState,\n\tdriverAction: \"cancel\" | \"none\" = \"cancel\",\n): PendingWebSocketOutbound[] {\n\tconst session = state.currentSession;\n\tconst sendCancels = [...state.sendCancels.values()];\n\tconst canceled = [...state.liveSends.values()];\n\tstate.connected = false;\n\tstate.currentAttempt = 0;\n\tstate.currentSession = undefined;\n\tstate.sendCancels.clear();\n\tstate.liveSends.clear();\n\tfor (const cancelSend of sendCancels) runCancel(cancelSend);\n\tif (driverAction === \"cancel\") session?.cancel();\n\treturn canceled;\n}\n\nfunction normalizeWebSocketSessionSendPolicy(\n\tpolicy: WebSocketSessionSendPolicy | undefined,\n): { readonly kind: \"reject\" } | { readonly kind: \"buffer\"; readonly maxPending: number } {\n\tif (policy?.kind !== \"buffer\") return { kind: \"reject\" };\n\tif (!Number.isFinite(policy.maxPending) || policy.maxPending < 1) {\n\t\tthrow new Error(\"webSocketSession: buffer sendPolicy requires finite maxPending >= 1\");\n\t}\n\treturn { kind: \"buffer\", maxPending: Math.floor(policy.maxPending) };\n}\n\nfunction webSocketSessionEventNode(\n\tgraph: Graph,\n\tcommand: Node<WebSocketSessionCommand>,\n\trequest: WebSocketRequest,\n\tname: string,\n\tpolicy: RetryPolicy,\n\tsendPolicy: ReturnType<typeof normalizeWebSocketSessionSendPolicy>,\n): Node<WebSocketSessionEvent> {\n\treturn graph.node<WebSocketSessionEvent>(\n\t\t[command],\n\t\t(ctx) => {\n\t\t\tconst state = initWebSocketSessionState(ctx);\n\n\t\t\tconst emitOutbound = (fact: WebSocketSessionOutbound) => {\n\t\t\t\tctx.down([[\"DATA\", { kind: \"outbound\", fact } satisfies WebSocketSessionEvent]]);\n\t\t\t};\n\n\t\t\tconst emitOutboundCanceled = (\n\t\t\t\titems: readonly PendingWebSocketOutbound[],\n\t\t\t\treason: unknown,\n\t\t\t) => {\n\t\t\t\tfor (const item of items) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"canceled\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\treason,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst emitOutboundRejected = (items: readonly PendingWebSocketOutbound[], error: unknown) => {\n\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\tfor (const item of items) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: payload,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst retryOrExhaust = (attempt: number, error: unknown) => {\n\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\tconst canceled = cleanupWebSocketConnection(state);\n\t\t\t\temitOutboundCanceled(canceled, `${name}: connection cleanup`);\n\t\t\t\tif (shouldRetry(policy, attempt)) {\n\t\t\t\t\tconst nextAttempt = attempt + 1;\n\t\t\t\t\tconst delayMs = nextRetryDelayMs(policy, nextAttempt) ?? 0;\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"retry\",\n\t\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\t\tnextAttempt,\n\t\t\t\t\t\t\t\tdelayMs,\n\t\t\t\t\t\t\t\terror: payload,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tconst timerId = state.seq++;\n\t\t\t\t\tconst timer = setTimeout(() => {\n\t\t\t\t\t\tstate.timers.delete(timerId);\n\t\t\t\t\t\tif (!state.active) return;\n\t\t\t\t\t\tstart(nextAttempt);\n\t\t\t\t\t}, delayMs);\n\t\t\t\t\tstate.timers.set(timerId, timer);\n\t\t\t\t} else {\n\t\t\t\t\temitOutboundRejected(state.pendingOutbound, payload);\n\t\t\t\t\tstate.pendingOutbound = [];\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{ kind: \"exhausted\", attempt, error: payload } satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tconst start = (attempt: number) => {\n\t\t\t\tif (\n\t\t\t\t\t!state.active ||\n\t\t\t\t\tstate.connected ||\n\t\t\t\t\tstate.currentAttempt !== 0 ||\n\t\t\t\t\tstate.timers.size > 0\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst driver = ctx.environment().webSocketDriver();\n\t\t\t\tstate.currentAttempt = attempt;\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: \"attempt\",\n\t\t\t\t\t\t\tattempt,\n\t\t\t\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t\tconst connectSession = driver?.connectSession;\n\t\t\t\tif (connectSession === undefined) {\n\t\t\t\t\tretryOrExhaust(attempt, `${name}: missing WebSocket session capability`);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet session: WebSocketSessionHandle | undefined;\n\t\t\t\ttry {\n\t\t\t\t\tsession = connectSession.call(driver, request, (event) => {\n\t\t\t\t\t\tif (!state.active || state.currentAttempt !== attempt) return;\n\t\t\t\t\t\tif (event.kind === \"event\") {\n\t\t\t\t\t\t\tconst ws = event.event;\n\t\t\t\t\t\t\tif (ws.kind === \"open\") {\n\t\t\t\t\t\t\t\tstate.connected = true;\n\t\t\t\t\t\t\t\tctx.down([[\"DATA\", { kind: \"open\", attempt } satisfies WebSocketSessionEvent]]);\n\t\t\t\t\t\t\t\tflushPending();\n\t\t\t\t\t\t\t} else if (ws.kind === \"text\" || ws.kind === \"binary\") {\n\t\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tkind: \"message\",\n\t\t\t\t\t\t\t\t\t\t\tmessage: ws satisfies WebSocketSessionInbound,\n\t\t\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\t} else if (ws.kind === \"close\") {\n\t\t\t\t\t\t\t\tconst normalClose = ws.code === 1000;\n\t\t\t\t\t\t\t\tconst canceled = cleanupWebSocketConnection(state);\n\t\t\t\t\t\t\t\temitOutboundCanceled(canceled, `${name}: session closed`);\n\t\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tkind: \"closed\",\n\t\t\t\t\t\t\t\t\t\t\tcode: ws.code,\n\t\t\t\t\t\t\t\t\t\t\treason: ws.reason,\n\t\t\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t\t\tif (!normalClose) {\n\t\t\t\t\t\t\t\t\tretryOrExhaust(attempt, {\n\t\t\t\t\t\t\t\t\t\tkind: \"close\",\n\t\t\t\t\t\t\t\t\t\tcode: ws.code,\n\t\t\t\t\t\t\t\t\t\treason: ws.reason,\n\t\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else if (event.kind === \"error\") {\n\t\t\t\t\t\t\tretryOrExhaust(attempt, event.error);\n\t\t\t\t\t\t} else if (event.kind === \"complete\") {\n\t\t\t\t\t\t\tretryOrExhaust(attempt, `${name}: connection completed`);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tretryOrExhaust(attempt, error);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (session === undefined) {\n\t\t\t\t\tretryOrExhaust(attempt, `${name}: missing WebSocket session capability`);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (state.active && state.currentAttempt === attempt) {\n\t\t\t\t\tstate.currentSession = session;\n\t\t\t\t} else {\n\t\t\t\t\tsession.cancel();\n\t\t\t\t}\n\t\t\t};\n\n\t\t\tfunction sendNow(item: PendingWebSocketOutbound): void {\n\t\t\t\tif (!state.connected) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t\t});\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst session = state.currentSession;\n\t\t\t\tif (session === undefined) {\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: `${name}: missing WebSocket session capability`,\n\t\t\t\t\t});\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\terror: `${name}: missing WebSocket session capability`,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tconst sendId = state.seq++;\n\t\t\t\tstate.liveSends.set(sendId, item);\n\t\t\t\temitOutbound({ kind: \"sending\", seq: item.seq, message: item.message });\n\t\t\t\tlet done = false;\n\t\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\t\ttry {\n\t\t\t\t\tcancel = session.send(item.message, (result) => {\n\t\t\t\t\t\tif (done || !state.active || !state.liveSends.has(sendId)) return;\n\t\t\t\t\t\tdone = true;\n\t\t\t\t\t\tstate.liveSends.delete(sendId);\n\t\t\t\t\t\tstate.sendCancels.delete(sendId);\n\t\t\t\t\t\tif (result.ok) {\n\t\t\t\t\t\t\temitOutbound({ kind: \"sent\", seq: item.seq, message: item.message });\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\"DATA\", { kind: \"sent\", message: item.message } satisfies WebSocketSessionEvent],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tconst payload = errorPayload(result.error);\n\t\t\t\t\t\t\temitOutbound({\n\t\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\t\t\terror: payload,\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\t\t\terror: payload,\n\t\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t]);\n\t\t\t\t\t\t}\n\t\t\t\t\t});\n\t\t\t\t} catch (error) {\n\t\t\t\t\tstate.liveSends.delete(sendId);\n\t\t\t\t\tconst payload = errorPayload(error);\n\t\t\t\t\temitOutbound({\n\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\tmessage: item.message,\n\t\t\t\t\t\terror: payload,\n\t\t\t\t\t});\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"error\", error: payload } satisfies WebSocketSessionEvent]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (cancel !== undefined && !done && state.active && state.liveSends.has(sendId)) {\n\t\t\t\t\tstate.sendCancels.set(sendId, cancel);\n\t\t\t\t} else if (cancel !== undefined && !state.active) runCancel(cancel);\n\t\t\t}\n\n\t\t\tfunction flushPending(): void {\n\t\t\t\tconst pending = state.pendingOutbound;\n\t\t\t\tstate.pendingOutbound = [];\n\t\t\t\tfor (let index = 0; index < pending.length; index++) {\n\t\t\t\t\tconst item = pending[index];\n\t\t\t\t\tif (!state.connected || state.currentSession === undefined) {\n\t\t\t\t\t\temitOutboundCanceled(pending.slice(index), `${name}: session closed`);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tsendNow(item);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst send = (message: WebSocketSend) => {\n\t\t\t\tconst item = { seq: state.outboundSeq++, message } satisfies PendingWebSocketOutbound;\n\t\t\t\tif (state.connected) {\n\t\t\t\t\tsendNow(item);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (sendPolicy.kind === \"buffer\") {\n\t\t\t\t\tif (state.pendingOutbound.length >= sendPolicy.maxPending) {\n\t\t\t\t\t\temitOutbound({\n\t\t\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\t\t\tseq: item.seq,\n\t\t\t\t\t\t\tmessage,\n\t\t\t\t\t\t\terror: `${name}: outbound buffer full`,\n\t\t\t\t\t\t});\n\t\t\t\t\t\tctx.down([\n\t\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\t\t\terror: `${name}: outbound buffer full`,\n\t\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tstate.pendingOutbound.push(item);\n\t\t\t\t\temitOutbound({ kind: \"queued\", seq: item.seq, message });\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\temitOutbound({\n\t\t\t\t\tkind: \"rejected\",\n\t\t\t\t\tseq: item.seq,\n\t\t\t\t\tmessage,\n\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t});\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tkind: \"error\",\n\t\t\t\t\t\t\terror: `${name}: session is not open`,\n\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\t};\n\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst commandValue = raw as WebSocketSessionCommand;\n\t\t\t\tif (commandValue.kind === \"start\") start(1);\n\t\t\t\telse if (commandValue.kind === \"send\") send(commandValue.message);\n\t\t\t\telse {\n\t\t\t\t\tcancelRetryTimers(state);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"closing\",\n\t\t\t\t\t\t\t\tcode: commandValue.code,\n\t\t\t\t\t\t\t\treason: commandValue.reason,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t\tconst { canceled, session } = closeWebSocketSessionState(state, \"none\");\n\t\t\t\t\temitOutboundCanceled(canceled, `${name}: session closed`);\n\t\t\t\t\tsession?.close(commandValue.code, commandValue.reason);\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"closed\",\n\t\t\t\t\t\t\t\tcode: commandValue.code,\n\t\t\t\t\t\t\t\treason: commandValue.reason,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionEvent,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/events`, factory: \"webSocketSessionEvents\" },\n\t);\n}\n\nfunction webSocketSessionNodes(\n\tgraph: Graph,\n\tcommand: Node<WebSocketSessionCommand>,\n\tevents: Node<WebSocketSessionEvent>,\n\tname: string,\n\tpolicy: RetryPolicy,\n): WebSocketSessionBundle {\n\tconst inbound = graph.node<WebSocketSessionInbound>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"message\") ctx.down([[\"DATA\", event.message]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/inbound`, factory: \"webSocketSessionInbound\" },\n\t);\n\tconst lifecycle = graph.node<WebSocketSessionLifecycle>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"attempt\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"starting\",\n\t\t\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\t\t\tmaxAttempts: event.maxAttempts,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionLifecycle,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"open\") {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"open\", attempt: event.attempt }]]);\n\t\t\t\t} else if (event.kind === \"sent\") {\n\t\t\t\t\tctx.down([[\"DATA\", { kind: \"sent\", message: event.message }]]);\n\t\t\t\t} else if (event.kind === \"closing\" || event.kind === \"closed\") {\n\t\t\t\t\tctx.down([[\"DATA\", event]]);\n\t\t\t\t} else if (event.kind === \"retry\") {\n\t\t\t\t\tctx.down([\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tkind: \"retrying\",\n\t\t\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\t\t\tnextAttempt: event.nextAttempt,\n\t\t\t\t\t\t\t\tdelayMs: event.delayMs,\n\t\t\t\t\t\t\t\terror: event.error,\n\t\t\t\t\t\t\t} satisfies WebSocketSessionLifecycle,\n\t\t\t\t\t\t],\n\t\t\t\t\t]);\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tctx.down([[\"DATA\", event]]);\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/lifecycle`, factory: \"webSocketSessionLifecycle\" },\n\t);\n\tconst outbound = graph.node<WebSocketSessionOutbound>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"outbound\") ctx.down([[\"DATA\", event.fact]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/outbound`, factory: \"webSocketSessionOutbound\" },\n\t);\n\tconst status = graph.node<WebSocketSessionStatus>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tlet next =\n\t\t\t\tctx.state.get<WebSocketSessionStatus>() ??\n\t\t\t\t({\n\t\t\t\t\tstate: \"idle\",\n\t\t\t\t\tattempt: 0,\n\t\t\t\t\tmaxAttempts: policy.maxAttempts,\n\t\t\t\t\tsent: 0,\n\t\t\t\t\treceived: 0,\n\t\t\t\t\terrors: 0,\n\t\t\t\t} satisfies WebSocketSessionStatus);\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"attempt\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"connecting\",\n\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\tmaxAttempts: event.maxAttempts,\n\t\t\t\t\t\tlastDelayMs: undefined,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"open\") {\n\t\t\t\t\tnext = { ...next, state: \"open\", attempt: event.attempt, lastDelayMs: undefined };\n\t\t\t\t} else if (event.kind === \"message\") {\n\t\t\t\t\tnext = { ...next, received: next.received + 1 };\n\t\t\t\t} else if (event.kind === \"sent\") {\n\t\t\t\t\tnext = { ...next, sent: next.sent + 1 };\n\t\t\t\t} else if (event.kind === \"closing\") {\n\t\t\t\t\tnext = { ...next, state: \"closing\" };\n\t\t\t\t} else if (event.kind === \"closed\") {\n\t\t\t\t\tnext = { ...next, state: \"closed\" };\n\t\t\t\t} else if (event.kind === \"retry\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"waiting\",\n\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t\tlastDelayMs: event.delayMs,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"error\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"errored\",\n\t\t\t\t\t\tattempt: event.attempt ?? next.attempt,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t} else if (event.kind === \"exhausted\") {\n\t\t\t\t\tnext = {\n\t\t\t\t\t\t...next,\n\t\t\t\t\t\tstate: \"exhausted\",\n\t\t\t\t\t\tattempt: event.attempt,\n\t\t\t\t\t\terrors: next.errors + 1,\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(next);\n\t\t\tctx.down([[\"DATA\", next]]);\n\t\t},\n\t\t{ name: `${name}/status`, factory: \"webSocketSessionStatus\" },\n\t);\n\tconst errors = graph.node<unknown>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (\"error\" in event) ctx.down([[\"DATA\", event.error]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/errors`, factory: \"webSocketSessionErrors\" },\n\t);\n\tconst attempts = graph.node<number>(\n\t\t[events],\n\t\t(ctx) => {\n\t\t\tfor (const raw of depBatch(ctx, 0) ?? []) {\n\t\t\t\tconst event = raw as WebSocketSessionEvent;\n\t\t\t\tif (event.kind === \"attempt\") ctx.down([[\"DATA\", event.attempt]]);\n\t\t\t}\n\t\t},\n\t\t{ name: `${name}/attempts`, factory: \"webSocketSessionAttempts\" },\n\t);\n\treturn {\n\t\tcommand,\n\t\tinbound,\n\t\tlifecycle,\n\t\toutbound,\n\t\tstatus,\n\t\terrors,\n\t\tattempts,\n\t\tstart: () => command.down([[\"DATA\", { kind: \"start\" }]]),\n\t\tsend: (message) =>\n\t\t\tcommand.down([\n\t\t\t\t[\n\t\t\t\t\t\"DATA\",\n\t\t\t\t\t{\n\t\t\t\t\t\tkind: \"send\",\n\t\t\t\t\t\tmessage:\n\t\t\t\t\t\t\ttypeof message === \"string\" || message instanceof Uint8Array\n\t\t\t\t\t\t\t\t? { data: message }\n\t\t\t\t\t\t\t\t: message,\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t]),\n\t\tclose: (code, reason) => command.down([[\"DATA\", { kind: \"close\", code, reason }]]),\n\t};\n}\n\n/**\n * Create a graph-visible D133 WebSocket SessionBundle.\n *\n * The convenience start/send/close methods publish command facts only; hidden\n * session state is driven by the command node and graph-local EnvironmentDrivers.\n */\nexport function webSocketSession(\n\tgraph: Graph,\n\trequest: WebSocketRequest,\n\topts: WebSocketSessionOptions = {},\n): WebSocketSessionBundle {\n\tconst name = opts.name ?? \"webSocketSession\";\n\tconst policy = opts.retry ?? retryPolicy();\n\tconst sendPolicy = normalizeWebSocketSessionSendPolicy(opts.sendPolicy);\n\tconst command = graph.node<WebSocketSessionCommand>([], null, {\n\t\tname: `${name}/command`,\n\t\tfactory: \"webSocketSessionCommand\",\n\t});\n\tconst events = webSocketSessionEventNode(graph, command, request, name, policy, sendPolicy);\n\treturn webSocketSessionNodes(graph, command, events, name, policy);\n}\n","/**\n * The shared reactiveCollection core (CSP-2.8, D60).\n *\n * Every reactive data structure (list/map/index/log) is `collectionCore(backend) + a typed method\n * surface` (D60 #5). The core owns the TWO output ports and nothing else:\n *\n *   - BACKEND — the single materialized state (D60 #1): a plain mutable object with a monotonic\n *     `version` + a `snapshot()`. It applies deltas and IS the materialized state; there is NO ACC\n *     node and NO effect bridge re-deriving it (the misdesign D60 rejected — the backend already\n *     integrates, its cost is intrinsic). The backend is a closure object, not a graph node, so its\n *     durability is structural (survives last-subscriber disconnect; node ROM/RAM is moot, D60 #1).\n *\n *   - DELTA port (D60 #2a) — an always-on bare source ({@link CollectionCore.delta}); each mutation\n *     pushes ONE change payload (O(1)/mutation). Downstream watches events anytime. It is the\n *     structure's BACKBONE: the snapshot node declares it as its dep (D60 reactiveList topology).\n *\n *   - SNAPSHOT port (D60 #2b) — a pull-mode node ({@link CollectionCore.snapshot}, R-pull/D269) that\n *     is QUIET by default and, on a cone-routed PULL demand, LAZILY reads `backend.snapshot()`\n *     (one O(n) materialization) and pushes it once, then re-quiets. The O(n) build happens ONLY on\n *     demand — never eagerly per mutation (D60 #2b: lazy is P·O(n), not M·O(n)). It has NO value of\n *     its own — its fn reads the backend on demand, so the backend stays the single source of truth\n *     (D60 #3). Coalesce-on-no-change is free: the delta-dep's DIRTY/DATA arms the pull node via\n *     R-pull's quiet-absorb accounting; a demand with no intervening delta emits no duplicate DATA.\n *\n * Demand path: a downstream consumer issues `ctx.upNext([[\"PULL\", { pullId: core.pullId }]])`\n * (boundary-deferred self-demand, R-up-routing/D269) — it needs the snapshot node upstream in its\n * declared cone, NOT its reference. Cold-start (a demand before any mutation) emits no DATA; for an\n * initial/imperative read use the structure's synchronous quick-read (the deliberately-non-reactive\n * peek, D60) — the reactive pull serves the watch-delta-then-demand pattern.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch } from \"../../ctx/types.js\";\nimport type { Dispatcher } from \"../../dispatcher/index.js\";\nimport { Node, releaseRuntimeOfNode } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport { type GraphCheckpointJson, registerBackendStateContributor } from \"../checkpoint.js\";\nimport type { Graph } from \"../graph.js\";\nimport type { Operator } from \"../operators.js\";\nimport type { ViewCachePolicy } from \"../policies/types.js\";\n\n/** The materialized-state contract a structure's backend must satisfy (D60 #1). */\nexport interface CollectionBackend<S> {\n\t/** Monotonic mutation counter; advances on every visible state change (idempotency, D49). */\n\treadonly version: number;\n\t/** A fresh defensive materialization of the current state (D60: first-cut defensive copy). */\n\tsnapshot(): S;\n}\n\nexport interface CollectionCoreOptions {\n\t/** Debug/inspection name; the delta/snapshot nodes derive `${name}.delta` / `${name}.snapshot`. */\n\tname?: string;\n\t/** Dispatcher for the core's nodes (default = process-global, D26). */\n\tdispatcher?: Dispatcher;\n\t/** Graph funnel for describe-visible input folds (D61). Required by *From/attach methods. */\n\tgraph?: Graph;\n}\n\nexport interface CollectionCore<S, C> {\n\t/** DELTA backbone (D60 #2a): a bare source; every {@link CollectionCore.emit} pushes one change. */\n\treadonly delta: Node<C>;\n\t/** SNAPSHOT pull node (D60 #2b): demand via `ctx.upNext([[\"PULL\", { pullId }]])`; lazy O(n) on demand. */\n\treadonly snapshot: Node<S>;\n\t/** The snapshot node's pullId — the author writes it verbatim into the demander's fn (D269). */\n\treadonly pullId: symbol;\n\t/** Push one delta event (the imperative path: a method mutates the backend, then calls this). */\n\temit(change: C): void;\n\t/**\n\t * D54 widening: fold an in-graph producer `src` into the backend. `apply` mutates the backend +\n\t * `emit`s the change(s). The folder is a DECLARED-dep node (describe shows `src → folder`, NOT a\n\t * D45 island); its emit is the structure's plumbing (D54-sanctioned). Returns a disposer.\n\t */\n\tbindSource<V>(src: Node<V>, apply: (value: V) => void): () => void;\n}\n\n/**\n * Public D121 collection-view surface. A view is a derived surface: `delta` is the pushed update\n * port, `snapshot` is a lazy pull node, and neither port is writable authority.\n */\nexport interface ReactiveView<C, S> {\n\t/** Derived DELTA/update stream for the view. For light views this is recomputed from the parent backend. */\n\treadonly delta: Node<C>;\n\t/** Derived SNAPSHOT pull node: demand via `pullId` to materialize the current view. */\n\treadonly snapshot: Node<S>;\n\t/** The snapshot node's pullId (R-pull/D269), minted per view instance. */\n\treadonly pullId: symbol;\n\t/** Release memoized/light-view resources owned by the parent collection. */\n\tdispose(): void;\n}\n\ninterface LightReactiveViewOptions<S> extends CollectionCoreOptions {\n\treadonly factory: string;\n\treadonly materializeSnapshot: () => S;\n\treadonly onDispose?: () => void;\n}\n\ninterface CollectionRestoreSpec {\n\treadonly deltaRef: string;\n\treadonly snapshotRef: string;\n\treadonly config?: GraphCheckpointJson;\n\treadonly backendState: () => unknown;\n}\n\nfunction validateViewCacheMaxEntries(policy: ViewCachePolicy | undefined): number | undefined {\n\tconst maxEntries = policy?.maxEntries;\n\tif (maxEntries === undefined) return undefined;\n\tif (!Number.isInteger(maxEntries) || maxEntries < 0) {\n\t\tthrow new RangeError(`viewCache.maxEntries must be a non-negative integer (got ${maxEntries})`);\n\t}\n\treturn maxEntries;\n}\n\n/**\n * Internal D80 memo manager for derived views. Eviction drops only the structure's memo lookup;\n * returned ReactiveView handles remain live until explicitly disposed or their parent releases all\n * live views.\n */\nexport class ViewMemoCache<K, V extends { dispose(): void }> {\n\tprivate readonly maxEntries: number | undefined;\n\tprivate readonly equals: (a: K, b: K) => boolean;\n\tprivate readonly memo: Array<{ key: K; value: V }> = [];\n\tprivate readonly live = new Set<V>();\n\n\tconstructor(policy: ViewCachePolicy | undefined, equals: (a: K, b: K) => boolean = Object.is) {\n\t\tthis.maxEntries = validateViewCacheMaxEntries(policy);\n\t\tthis.equals = equals;\n\t}\n\n\tget(key: K): V | undefined {\n\t\tconst index = this.memo.findIndex((entry) => this.equals(entry.key, key));\n\t\tif (index < 0) return undefined;\n\t\tconst [entry] = this.memo.splice(index, 1);\n\t\tif (entry === undefined) return undefined;\n\t\tthis.memo.push(entry);\n\t\treturn entry.value;\n\t}\n\n\tset(key: K, value: V): void {\n\t\tthis.deleteValue(value);\n\t\tthis.live.add(value);\n\t\tif (this.maxEntries === 0) return;\n\t\tthis.memo.push({ key, value });\n\t\twhile (this.maxEntries !== undefined && this.memo.length > this.maxEntries) {\n\t\t\tthis.memo.shift();\n\t\t}\n\t}\n\n\tdeleteValue(value: V): void {\n\t\tfor (let i = this.memo.length - 1; i >= 0; i -= 1) {\n\t\t\tif (this.memo[i]?.value === value) this.memo.splice(i, 1);\n\t\t}\n\t\tthis.live.delete(value);\n\t}\n\n\tdisposeAll(): void {\n\t\tfor (const view of [...this.live]) view.dispose();\n\t\tthis.memo.length = 0;\n\t\tthis.live.clear();\n\t}\n}\n\n/**\n * Build a D121 first-cut light view. The view declares `parent.delta -> view.delta ->\n * view.snapshot`; the pushed `delta` forwards parent delta events as the view's arm/update stream,\n * while `snapshot` reads the parent collection backend through the supplied materializer on demand.\n * No writable state/cache is exposed (D120).\n */\nexport function lightReactiveView<C, S>(\n\tparentDelta: Node<unknown>,\n\topts: LightReactiveViewOptions<S>,\n): ReactiveView<C, S> {\n\tconst { dispatcher, factory, graph, materializeSnapshot, name, onDispose } = opts;\n\tconst base = dispatcher ? { dispatcher } : {};\n\tconst group = graph?.topologyGroup({ name: name ?? factory });\n\tconst deltaBody = (ctx: Ctx): void => {\n\t\tfor (const change of (depBatch(ctx, 0) ?? []) as readonly C[]) {\n\t\t\tctx.down([[\"DATA\", change]]);\n\t\t}\n\t};\n\tconst delta = group\n\t\t? group.node<C>([parentDelta], deltaBody, {\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tmeta: { kind: \"collection_view_delta\", factory },\n\t\t\t\tpartial: true,\n\t\t\t})\n\t\t: new Node<C>([parentDelta], deltaBody, {\n\t\t\t\t...base,\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tpartial: true,\n\t\t\t});\n\n\tconst pullId = Symbol(name ? `${name}.snapshot` : `${factory}.snapshot`);\n\tconst snapshotBody = (ctx: Ctx): void => {\n\t\ttry {\n\t\t\tctx.down([[\"DATA\", materializeSnapshot()]]);\n\t\t} catch (e) {\n\t\t\tctx.down([[\"ERROR\", errorPayload(e, `${factory}.snapshot materializer failed`)]]);\n\t\t}\n\t};\n\tconst snapshot = group\n\t\t? group.node<S>([delta as Node<unknown>], snapshotBody, {\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tmeta: { kind: \"collection_view_snapshot\", factory },\n\t\t\t\tpartial: true,\n\t\t\t\tpullId,\n\t\t\t})\n\t\t: new Node<S>([delta as Node<unknown>], snapshotBody, {\n\t\t\t\t...base,\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tpartial: true,\n\t\t\t\tpullId,\n\t\t\t});\n\n\tlet disposed = false;\n\treturn {\n\t\tdelta,\n\t\tsnapshot,\n\t\tpullId,\n\t\tdispose(): void {\n\t\t\tif (disposed) return;\n\t\t\tif (group) {\n\t\t\t\tgroup.release({ reason: factory });\n\t\t\t} else {\n\t\t\t\treleaseRuntimeOfNode(delta as Node<unknown>);\n\t\t\t\treleaseRuntimeOfNode(snapshot as Node<unknown>);\n\t\t\t}\n\t\t\tdisposed = true;\n\t\t\tonDispose?.();\n\t\t},\n\t};\n}\n\n/**\n * Build the shared core for a reactive structure (D60). `factory` names the nodes for describe\n * (D6/D51 auto-discovery). The structure passes its `backend` (any {@link CollectionBackend}) and\n * layers a typed method surface on top.\n */\nexport function collectionCore<S, C>(\n\tbackend: CollectionBackend<S>,\n\tfactory: string,\n\topts: CollectionCoreOptions = {},\n\trestore?: CollectionRestoreSpec,\n): CollectionCore<S, C> {\n\tconst { name, dispatcher, graph } = opts;\n\tconst base: { dispatcher?: Dispatcher } = dispatcher ? { dispatcher } : {};\n\tlet bindSeq = 0;\n\n\t// DELTA backbone: a bare source (D60 #2a / review #2 — node([], null), no `initial`, so a late\n\t// subscriber gets no fake \"initial change\"; state is the snapshot port's job).\n\tconst delta = graph\n\t\t? graph.node<C>([], null, {\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tmeta: { kind: \"collection_delta\", collection: factory },\n\t\t\t\t...(restore ? { restore: { ref: restore.deltaRef, config: restore.config } } : {}),\n\t\t\t})\n\t\t: new Node<C>([], null, {\n\t\t\t\t...base,\n\t\t\t\tfactory: `${factory}.delta`,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t});\n\n\t// SNAPSHOT pull node: dep=[delta] (the backbone arms it via quiet-absorb so coalesce is free,\n\t// D60). The fn IGNORES the delta value — it reads `backend.snapshot()` on demand (D60 #3). The\n\t// pullId is a unique Symbol (R-pull/D269: matched by identity, zero collision with pause locks).\n\t// `partial:true`: the fn does not need the delta's value, so it must not gate on \"all deps\n\t// settled\" — it fires whenever armed (a mutation since the last delivery).\n\tconst pullId = Symbol(name ? `${name}.snapshot` : `${factory}.snapshot`);\n\tlet deliveredVersion = backend.version;\n\tconst snapFn = (ctx: Ctx): void => {\n\t\tif (ctx.pull !== undefined && backend.version === deliveredVersion) return;\n\t\tdeliveredVersion = backend.version;\n\t\tctx.down([[\"DATA\", backend.snapshot()]]);\n\t};\n\tconst snapshot = graph\n\t\t? graph.node<S>([delta as Node<unknown>], snapFn, {\n\t\t\t\tpullId,\n\t\t\t\tpartial: true,\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tmeta: { kind: \"collection_snapshot\", collection: factory },\n\t\t\t\t...(restore ? { restore: { ref: restore.snapshotRef, config: restore.config } } : {}),\n\t\t\t})\n\t\t: new Node<S>([delta as Node<unknown>], snapFn, {\n\t\t\t\t...base,\n\t\t\t\tpullId,\n\t\t\t\tpartial: true,\n\t\t\t\tfactory: `${factory}.snapshot`,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t});\n\n\tif (restore !== undefined) {\n\t\tregisterBackendStateContributor(delta as Node<unknown>, restore.backendState);\n\t}\n\n\tfunction emit(change: C): void {\n\t\t// External tier-3 emit → the substrate synthesizes the leading DIRTY (R-dirty-before-data),\n\t\t// which the quiet snapshot node absorbs (R-pull) and uses to arm its next demand delivery.\n\t\tdelta.down([[\"DATA\", change]]);\n\t}\n\n\tfunction bindSource<V>(src: Node<V>, apply: (value: V) => void): () => void {\n\t\tif (graph === undefined)\n\t\t\tthrow new Error(\n\t\t\t\t\"collectionCore.bindSource requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t);\n\t\t// A graph-bound declared-dep folder (effect-shaped): reads each src batch value, applies it\n\t\t// to the backend (apply mutates + emits the delta). src → folder is a real edge describe\n\t\t// shows (D54/D61), not an internal subscribe island.\n\t\tconst op: Operator<V, void> = {\n\t\t\tfactory: `${factory}.bindSource`,\n\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\tconst b = depBatch(ctx, 0);\n\t\t\t\ttry {\n\t\t\t\t\tif (b) for (const v of b) apply(v as V);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"collectionCore.bindSource failed\")]]);\n\t\t\t\t}\n\t\t\t},\n\t\t};\n\t\tconst folder = graph.initNode(op, [src], {\n\t\t\tname: name ? `${name}.bind#${bindSeq++}` : undefined,\n\t\t\tmeta: { kind: \"collection_bind_source\", collection: factory },\n\t\t});\n\t\treturn graph.retain(folder, { reason: `${factory}.bindSource` });\n\t}\n\n\treturn { delta, snapshot, pullId, emit, bindSource };\n}\n","/**\n * Reactive dual-key index (CSP-2.8, D54/D60) — unique primary key, rows sorted by (secondary, primary).\n *\n * Shape = the shared {@link collectionCore} two ports over a sorted-array + parallel-Map BACKEND\n * (D60). The SNAPSHOT port delivers the ordered `IndexRow[]`. Secondary/reverse lookup = \"Z\"\n * (review #4): `has`/`get`/`rangeByPrimary` are SYNCHRONOUS point-reads over the backend's parallel\n * Map (NOT topology, like `.cache`); `byPrimary` is an OPTIONAL reactive derived over the delta\n * backbone (a pushed primary→value map), LAZILY created on first access (no default keepalive,\n * R-rom-ram). The two coexist: the derived is the reactive reverse-lookup port; the sync reads are\n * the point query.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch, depCount, depLatest } from \"../../ctx/types.js\";\nimport { Node, node } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport type { Operator } from \"../operators.js\";\nimport type { OrderedCapacityPolicy, ReactiveOpt, ViewCachePolicy } from \"../policies/types.js\";\nimport type { IndexChange } from \"./change.js\";\nimport {\n\ttype CollectionCore,\n\ttype CollectionCoreOptions,\n\tcollectionCore,\n\tlightReactiveView,\n\ttype ReactiveView,\n\tViewMemoCache,\n} from \"./core.js\";\n\nexport type ReactiveIndexOpt<T> = ReactiveOpt<T>;\nexport type ReactiveIndexCapacityOrder = \"secondary\" | \"primary\" | \"lru\";\n\nexport interface ReactiveIndexCapacityPolicy\n\textends OrderedCapacityPolicy<ReactiveIndexCapacityOrder> {}\n\nexport interface ReactiveIndexOptions extends CollectionCoreOptions {\n\t/**\n\t * D73 explicit capacity policy: no implicit eviction default.\n\t * `order` chooses eviction semantics and `maxSize` may be static or node-valued (D68).\n\t */\n\treadonly capacity?: ReactiveIndexCapacityPolicy;\n\t/** Static D80 memo policy for D121 light views. Eviction does not dispose returned views. */\n\treadonly viewCache?: ViewCachePolicy;\n}\n\nexport interface IndexRow<K, V = unknown> {\n\treadonly primary: K;\n\treadonly secondary: unknown;\n\treadonly value: V;\n}\n\nexport interface ReactiveIndex<K, V = unknown> {\n\treadonly delta: Node<IndexChange<K, V>>;\n\t/** SNAPSHOT pull node: demand → rows sorted by (secondary, primary) (lazy O(n)). */\n\treadonly snapshot: Node<readonly IndexRow<K, V>[]>;\n\treadonly pullId: symbol;\n\t/** Row count (O(1)). Sync non-reactive read. */\n\treadonly size: number;\n\t/** O(1) primary-key existence. Sync read (Z). */\n\thas(primary: K): boolean;\n\t/** O(1) value lookup by primary key. Sync read (Z). */\n\tget(primary: K): V | undefined;\n\t/** Values whose primary sorts within `[start, end)`, ascending primary order. Sync read (Z). */\n\trangeByPrimary(start: K, end: K): V[];\n\t/**\n\t * D121 light range view over the primary axis. `delta` forwards parent index mutations, and\n\t * `snapshot` is a pull node that materializes the current range on demand.\n\t */\n\trange(start: K, end: K): ReactiveView<IndexChange<K, V>, readonly V[]>;\n\t/** Ordered rows (fresh copy). Sync non-reactive read (cold-start peek). */\n\ttoArray(): readonly IndexRow<K, V>[];\n\t/** Primary→value map (fresh copy). Sync non-reactive read. */\n\ttoPrimaryMap(): ReadonlyMap<K, V>;\n\t/**\n\t * OPTIONAL reactive reverse-lookup port (Z): a derived primary→value map, pushed on every\n\t * mutation. Lazily created on first access (no keepalive — live only while subscribed). Use the\n\t * synchronous {@link ReactiveIndex.get} for a one-shot point query.\n\t */\n\treadonly byPrimary: Node<ReadonlyMap<K, V>>;\n\t/** Insert/replace a row. Returns `true` if a NEW row was inserted (primary was absent). */\n\tupsert(primary: K, secondary: unknown, value: V): boolean;\n\t/** Bulk upsert; one delta per row. No-op if empty. */\n\tupsertMany(rows: Iterable<{ primary: K; secondary: unknown; value: V }>): void;\n\tdelete(primary: K): void;\n\t/** Bulk delete; one delta event. No-op if nothing removed. */\n\tdeleteMany(primaries: Iterable<K>): void;\n\tclear(): void;\n\t/** D54 widening: every row from `src` is upserted. Returns a disposer. */\n\tupsertFrom(src: Node<{ primary: K; secondary: unknown; value: V }>): () => void;\n\tdispose(): void;\n}\n\n// ── ordering helpers (pure; backend-internal) ──\nfunction cmpOrd(a: unknown, b: unknown): number {\n\tif (a === b) return 0;\n\tconst ta = typeof a;\n\tif (\n\t\tta === typeof b &&\n\t\t(ta === \"number\" || ta === \"string\" || ta === \"boolean\" || ta === \"bigint\")\n\t) {\n\t\tconst ax = a as number | string;\n\t\tconst bx = b as number | string;\n\t\treturn ax < bx ? -1 : ax > bx ? 1 : 0;\n\t}\n\treturn String(a).localeCompare(String(b));\n}\nfunction compareRows<K, V>(a: IndexRow<K, V>, b: IndexRow<K, V>): number {\n\tconst c = cmpOrd(a.secondary, b.secondary);\n\treturn c !== 0 ? c : cmpOrd(a.primary, b.primary);\n}\nfunction bisectLeft<K, V>(rows: readonly IndexRow<K, V>[], row: IndexRow<K, V>): number {\n\tlet lo = 0;\n\tlet hi = rows.length;\n\twhile (lo < hi) {\n\t\tconst mid = (lo + hi) >> 1;\n\t\tif (compareRows(rows[mid] as IndexRow<K, V>, row) < 0) lo = mid + 1;\n\t\telse hi = mid;\n\t}\n\treturn lo;\n}\n\n/** Default sorted-array + parallel-Map backend (D60 first-cut; B-tree/persistent backend deferred). */\nclass IndexBackend<K, V> {\n\tprivate _version = 0;\n\tprivate readonly buf: IndexRow<K, V>[] = [];\n\tprivate readonly byKey = new Map<K, IndexRow<K, V>>();\n\tprivate readonly trackLru: boolean;\n\n\tconstructor(trackLru: boolean, initialRows: readonly IndexRow<K, V>[] = []) {\n\t\tthis.trackLru = trackLru;\n\t\tfor (const row of initialRows) {\n\t\t\tthis.upsert(row.primary, row.secondary, row.value);\n\t\t}\n\t\tthis._version = 0;\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\tget size(): number {\n\t\treturn this.buf.length;\n\t}\n\thas(primary: K): boolean {\n\t\tconst row = this.byKey.get(primary);\n\t\tif (row === undefined) return false;\n\t\tthis.touchLru(row);\n\t\treturn true;\n\t}\n\tget(primary: K): V | undefined {\n\t\tconst row = this.byKey.get(primary);\n\t\tif (row === undefined) return undefined;\n\t\tthis.touchLru(row);\n\t\treturn row.value;\n\t}\n\n\tprivate touchLru(row: IndexRow<K, V>): void {\n\t\tif (!this.trackLru) return;\n\t\tthis.byKey.delete(row.primary);\n\t\tthis.byKey.set(row.primary, row);\n\t}\n\n\tprivate removeRow(row: IndexRow<K, V>): void {\n\t\tconst start = bisectLeft(this.buf, row);\n\t\tfor (\n\t\t\tlet i = start;\n\t\t\ti < this.buf.length && compareRows(this.buf[i] as IndexRow<K, V>, row) === 0;\n\t\t\ti++\n\t\t) {\n\t\t\tif (this.buf[i] === row) {\n\t\t\t\tthis.buf.splice(i, 1);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tconst fallback = this.buf.indexOf(row);\n\t\tif (fallback >= 0) {\n\t\t\tthis.buf.splice(fallback, 1);\n\t\t\treturn;\n\t\t}\n\t\tthrow new Error(\"reactiveIndex: internal row index desynchronized\");\n\t}\n\n\tupsert(primary: K, secondary: unknown, value: V): boolean {\n\t\tconst existing = this.byKey.get(primary);\n\t\tconst row: IndexRow<K, V> = { primary, secondary, value };\n\t\tif (existing !== undefined) {\n\t\t\tthis.removeRow(existing);\n\t\t\tthis.byKey.delete(primary);\n\t\t}\n\t\tthis.buf.splice(bisectLeft(this.buf, row), 0, row);\n\t\tthis.byKey.set(primary, row);\n\t\tthis._version += 1;\n\t\treturn existing === undefined;\n\t}\n\n\tdelete(primary: K): boolean {\n\t\tconst existing = this.byKey.get(primary);\n\t\tif (existing === undefined) return false;\n\t\tthis.removeRow(existing);\n\t\tthis.byKey.delete(primary);\n\t\tthis._version += 1;\n\t\treturn true;\n\t}\n\n\tclear(): number {\n\t\tconst n = this.buf.length;\n\t\tif (n === 0) return 0;\n\t\tthis.buf.length = 0;\n\t\tthis.byKey.clear();\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\n\trangeByPrimary(start: K, end: K): V[] {\n\t\tif (cmpOrd(start, end) >= 0) return [];\n\t\tconst rows = [...this.byKey.entries()].filter(\n\t\t\t([p]) => cmpOrd(p, start) >= 0 && cmpOrd(p, end) < 0,\n\t\t);\n\t\trows.sort(([a], [b]) => cmpOrd(a, b));\n\t\treturn rows.map(([, r]) => r.value);\n\t}\n\n\tevictOneForCapacity(order: ReactiveIndexCapacityOrder, maxSize?: number): K | undefined {\n\t\tif (maxSize === undefined) return undefined;\n\t\tif (!Number.isInteger(maxSize) || maxSize < 1)\n\t\t\tthrow new RangeError(`reactiveIndex: maxSize must be a positive integer (got ${maxSize})`);\n\t\tconst overflow = this.buf.length - maxSize;\n\t\tif (overflow <= 0) return undefined;\n\n\t\tswitch (order) {\n\t\t\tcase \"secondary\": {\n\t\t\t\tconst row = this.buf[0] as IndexRow<K, V> | undefined;\n\t\t\t\tif (row === undefined) return undefined;\n\t\t\t\tthis.buf.shift();\n\t\t\t\tthis.byKey.delete(row.primary);\n\t\t\t\tthis._version += 1;\n\t\t\t\treturn row.primary;\n\t\t\t}\n\t\t\tcase \"primary\": {\n\t\t\t\tlet victim: K | undefined;\n\t\t\t\tfor (const key of this.byKey.keys()) {\n\t\t\t\t\tif (victim === undefined || cmpOrd(key, victim) < 0) victim = key;\n\t\t\t\t}\n\t\t\t\tif (victim === undefined) return undefined;\n\t\t\t\tconst row = this.byKey.get(victim);\n\t\t\t\tif (row !== undefined) this.removeRow(row);\n\t\t\t\tthis.byKey.delete(victim);\n\t\t\t\tthis._version += 1;\n\t\t\t\treturn victim;\n\t\t\t}\n\t\t\tcase \"lru\": {\n\t\t\t\tconst oldest = this.byKey.keys().next().value as K | undefined;\n\t\t\t\tif (oldest === undefined) return undefined;\n\t\t\t\tconst row = this.byKey.get(oldest);\n\t\t\t\tif (row !== undefined) this.removeRow(row);\n\t\t\t\tthis.byKey.delete(oldest);\n\t\t\t\tthis._version += 1;\n\t\t\t\treturn oldest;\n\t\t\t}\n\t\t\tdefault: {\n\t\t\t\tthrow new Error(`reactiveIndex: unknown capacity order '${String(order)}'`);\n\t\t\t}\n\t\t}\n\t}\n\n\tsnapshot(): readonly IndexRow<K, V>[] {\n\t\treturn [...this.buf];\n\t}\n\ttoPrimaryMap(): ReadonlyMap<K, V> {\n\t\tconst m = new Map<K, V>();\n\t\tfor (const r of this.buf) m.set(r.primary, r.value);\n\t\treturn m;\n\t}\n}\n\nfunction assertCheckpointableIndexRows(rows: readonly IndexRow<unknown, unknown>[]): void {\n\tfor (const [i, row] of rows.entries()) {\n\t\tconst primary = row.primary;\n\t\tif (\n\t\t\tprimary === null ||\n\t\t\ttypeof primary === \"string\" ||\n\t\t\ttypeof primary === \"number\" ||\n\t\t\ttypeof primary === \"boolean\"\n\t\t) {\n\t\t\tcontinue;\n\t\t}\n\t\tthrow new TypeError(\n\t\t\t`reactiveIndex checkpoint backendState[${i}].primary must be a JSON primitive primary key for D160 restore`,\n\t\t);\n\t}\n}\n\n/**\n * Create a reactive dual-key index (D54/D60). DELTA + lazy pull SNAPSHOT + pullId via\n * {@link collectionCore}; this layer adds the sorted backend + Z reverse-lookup surface.\n */\nexport function reactiveIndex<K, V = unknown>(\n\toptions: ReactiveIndexOptions = {},\n): ReactiveIndex<K, V> {\n\treturn createReactiveIndex(options);\n}\n\n/** @internal D160 restore path: seed the backend without replaying public deltas. */\nexport function restoreReactiveIndexFromBackendState<K, V = unknown>(\n\tinitialRows: readonly IndexRow<K, V>[],\n\toptions: ReactiveIndexOptions = {},\n): ReactiveIndex<K, V> {\n\treturn createReactiveIndex(options, initialRows);\n}\n\nfunction createReactiveIndex<K, V = unknown>(\n\toptions: ReactiveIndexOptions = {},\n\tinitialRows: readonly IndexRow<K, V>[] = [],\n): ReactiveIndex<K, V> {\n\tconst { capacity, graph, dispatcher, name } = options;\n\tconst lruEnabled = capacity?.order === \"lru\";\n\tconst backend = new IndexBackend<K, V>(lruEnabled, initialRows);\n\tconst core: CollectionCore<readonly IndexRow<K, V>[], IndexChange<K, V>> = collectionCore(\n\t\tbackend,\n\t\t\"reactiveIndex\",\n\t\toptions,\n\t\tgraph !== undefined && name !== undefined && capacity === undefined\n\t\t\t? {\n\t\t\t\t\tdeltaRef: \"reactiveIndex.delta\",\n\t\t\t\t\tsnapshotRef: \"reactiveIndex.snapshot\",\n\t\t\t\t\tbackendState: () => {\n\t\t\t\t\t\tconst rows = backend.snapshot();\n\t\t\t\t\t\tassertCheckpointableIndexRows(rows);\n\t\t\t\t\t\treturn rows;\n\t\t\t\t\t},\n\t\t\t\t}\n\t\t\t: undefined,\n\t);\n\tconst binds: Array<() => void> = [];\n\tconst base = dispatcher ? { dispatcher } : {};\n\tconst bindDeps = new WeakSet<Node<unknown>>();\n\tconst rangeMemo = new ViewMemoCache<\n\t\treadonly [K, K],\n\t\tReactiveView<IndexChange<K, V>, readonly V[]>\n\t>(options.viewCache, ([aStart, aEnd], [bStart, bEnd]) => {\n\t\treturn cmpOrd(aStart, bStart) === 0 && cmpOrd(aEnd, bEnd) === 0;\n\t});\n\tlet bindSeq = 0;\n\tlet rangeSeq = 0;\n\tlet capacityPolicy: Node<number> | undefined;\n\tlet apply: Node<IndexChange<K, V>> | undefined;\n\tlet releaseApply = () => {};\n\n\tfunction isNodeOpt<T>(x: ReactiveIndexOpt<T>): x is Node<T> {\n\t\treturn x instanceof Node;\n\t}\n\n\tfunction validateMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 1)\n\t\t\tthrow new RangeError(`reactiveIndex: maxSize must be a positive integer (got ${v})`);\n\t\treturn v;\n\t}\n\n\tfunction enforceCapacity(): void {\n\t\tif (currentCapacityOrder === undefined) return;\n\t\tfor (;;) {\n\t\t\tconst primary = backend.evictOneForCapacity(currentCapacityOrder, currentMaxSize);\n\t\t\tif (primary === undefined) return;\n\t\t\tcore.emit({ kind: \"delete\", primary });\n\t\t}\n\t}\n\n\tconst applyBody = (ctx: Ctx): void => {\n\t\tconst deps = apply?.deps ?? [];\n\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\tconst dep = deps[i];\n\t\t\tif (dep === capacityPolicy) {\n\t\t\t\tconst latest = depLatest(ctx, i);\n\t\t\t\tif (latest !== undefined) currentMaxSize = validateMaxSize(latest as number);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (dep && bindDeps.has(dep)) {\n\t\t\t\tfor (const r of (depBatch(ctx, i) ?? []) as readonly {\n\t\t\t\t\tprimary: K;\n\t\t\t\t\tsecondary: unknown;\n\t\t\t\t\tvalue: V;\n\t\t\t\t}[]) {\n\t\t\t\t\tbackend.upsert(r.primary, r.secondary, r.value);\n\t\t\t\t\tcore.emit({ kind: \"upsert\", primary: r.primary, secondary: r.secondary, value: r.value });\n\t\t\t\t\tenforceCapacity();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tenforceCapacity();\n\t};\n\n\tfunction ensureApply(): Node<IndexChange<K, V>> {\n\t\tif (apply !== undefined) return apply;\n\t\tconst op: Operator<unknown, IndexChange<K, V>> = {\n\t\t\tfactory: \"reactiveIndex.capacityPolicy\",\n\t\t\tbody: applyBody,\n\t\t\topts: { partial: true },\n\t\t};\n\t\tconst deps = capacityPolicy ? [capacityPolicy as Node<unknown>] : [];\n\t\tapply = graph\n\t\t\t? graph.initNode(op, deps, {\n\t\t\t\t\tname: name ? `${name}.capacityPolicy` : undefined,\n\t\t\t\t\tmeta: { kind: \"collection_policy_apply\", collection: \"reactiveIndex\" },\n\t\t\t\t})\n\t\t\t: new Node<IndexChange<K, V>>(deps, op.body, {\n\t\t\t\t\t...base,\n\t\t\t\t\tfactory: \"reactiveIndex.capacityPolicy\",\n\t\t\t\t\tpartial: true,\n\t\t\t\t\tname: name ? `${name}.capacityPolicy` : undefined,\n\t\t\t\t});\n\t\treleaseApply = graph\n\t\t\t? graph.retain(apply, { reason: \"reactiveIndex.capacityPolicy\" })\n\t\t\t: apply.subscribe(() => {});\n\t\treturn apply;\n\t}\n\n\tlet currentMaxSize: number | undefined;\n\tconst currentCapacityOrder: ReactiveIndexCapacityOrder | undefined = capacity?.order;\n\tif (capacity !== undefined) {\n\t\tif (\n\t\t\tcurrentCapacityOrder !== \"secondary\" &&\n\t\t\tcurrentCapacityOrder !== \"primary\" &&\n\t\t\tcurrentCapacityOrder !== \"lru\"\n\t\t) {\n\t\t\tthrow new Error(\"reactiveIndex: capacity.order must be one of secondary|primary|lru (D73)\");\n\t\t}\n\n\t\tconst maxSize = capacity.maxSize;\n\t\tif (isNodeOpt(maxSize) && graph === undefined) {\n\t\t\tthrow new Error(\n\t\t\t\t\"reactiveIndex capacity.maxSize Node option requires options.graph so the policy edge is describe-visible (D73)\",\n\t\t\t);\n\t\t}\n\n\t\tcapacityPolicy = isNodeOpt(maxSize)\n\t\t\t? maxSize\n\t\t\t: graph\n\t\t\t\t? graph.initNode<number, number>(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfactory: \"reactiveIndex.maxSizePolicy\",\n\t\t\t\t\t\t\tbody: () => {},\n\t\t\t\t\t\t\topts: { initial: validateMaxSize(maxSize) },\n\t\t\t\t\t\t},\n\t\t\t\t\t\t[],\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tname: name ? `${name}.maxSizePolicy` : undefined,\n\t\t\t\t\t\t\tmeta: { kind: \"collection_policy\", collection: \"reactiveIndex\", policy: \"maxSize\" },\n\t\t\t\t\t\t},\n\t\t\t\t\t)\n\t\t\t\t: undefined;\n\n\t\tif (!isNodeOpt(maxSize)) currentMaxSize = validateMaxSize(maxSize);\n\n\t\tif (capacityPolicy instanceof Node) ensureApply();\n\t}\n\n\t// Lazy reactive reverse-lookup port (Z): a delta-driven pushed primary→value map. Created on\n\t// first access so an index that never uses it pays nothing (no keepalive — R-rom-ram).\n\tlet byPrimaryNode: Node<ReadonlyMap<K, V>> | undefined;\n\tfunction getByPrimary(): Node<ReadonlyMap<K, V>> {\n\t\tif (byPrimaryNode === undefined) {\n\t\t\tbyPrimaryNode = node<ReadonlyMap<K, V>>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\t// pushed reverse-lookup: re-read the backend's primary map on each delta (the\n\t\t\t\t\t// structure's own backend, D60 #1 — not a foreign .cache peek).\n\t\t\t\t\tctx.down([[\"DATA\", backend.toPrimaryMap()]]);\n\t\t\t\t},\n\t\t\t\t{ factory: \"reactiveIndex.byPrimary\", partial: true },\n\t\t\t);\n\t\t}\n\t\treturn byPrimaryNode;\n\t}\n\n\tfunction getRange(start: K, end: K): ReactiveView<IndexChange<K, V>, readonly V[]> {\n\t\tconst key = [start, end] as const;\n\t\tconst hit = rangeMemo.get(key);\n\t\tif (hit !== undefined) return hit;\n\t\tconst materialize = (): readonly V[] => backend.rangeByPrimary(start, end);\n\t\tlet view: ReactiveView<IndexChange<K, V>, readonly V[]>;\n\t\tview = lightReactiveView<IndexChange<K, V>, readonly V[]>(core.delta as Node<unknown>, {\n\t\t\t...options,\n\t\t\tfactory: \"reactiveIndex.range\",\n\t\t\tname: name ? `${name}.range#${rangeSeq++}` : undefined,\n\t\t\tmaterializeSnapshot: materialize,\n\t\t\tonDispose: () => {\n\t\t\t\trangeMemo.deleteValue(view);\n\t\t\t},\n\t\t});\n\t\trangeMemo.set(key, view);\n\t\treturn view;\n\t}\n\n\treturn {\n\t\tdelta: core.delta,\n\t\tsnapshot: core.snapshot,\n\t\tpullId: core.pullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\thas(primary: K): boolean {\n\t\t\treturn backend.has(primary);\n\t\t},\n\t\tget(primary: K): V | undefined {\n\t\t\treturn backend.get(primary);\n\t\t},\n\t\trangeByPrimary(start: K, end: K): V[] {\n\t\t\treturn backend.rangeByPrimary(start, end);\n\t\t},\n\t\trange(start: K, end: K): ReactiveView<IndexChange<K, V>, readonly V[]> {\n\t\t\treturn getRange(start, end);\n\t\t},\n\t\ttoArray(): readonly IndexRow<K, V>[] {\n\t\t\treturn backend.snapshot();\n\t\t},\n\t\ttoPrimaryMap(): ReadonlyMap<K, V> {\n\t\t\treturn backend.toPrimaryMap();\n\t\t},\n\t\tget byPrimary(): Node<ReadonlyMap<K, V>> {\n\t\t\treturn getByPrimary();\n\t\t},\n\n\t\tupsert(primary: K, secondary: unknown, value: V): boolean {\n\t\t\tconst inserted = backend.upsert(primary, secondary, value);\n\t\t\tcore.emit({ kind: \"upsert\", primary, secondary, value });\n\t\t\tenforceCapacity();\n\t\t\treturn inserted;\n\t\t},\n\t\tupsertMany(rows: Iterable<{ primary: K; secondary: unknown; value: V }>): void {\n\t\t\tfor (const r of rows) {\n\t\t\t\tbackend.upsert(r.primary, r.secondary, r.value);\n\t\t\t\tcore.emit({ kind: \"upsert\", primary: r.primary, secondary: r.secondary, value: r.value });\n\t\t\t\tenforceCapacity();\n\t\t\t}\n\t\t},\n\t\tdelete(primary: K): void {\n\t\t\tif (backend.delete(primary)) core.emit({ kind: \"delete\", primary });\n\t\t},\n\t\tdeleteMany(primaries: Iterable<K>): void {\n\t\t\tconst removed: K[] = [];\n\t\t\tfor (const p of primaries) if (backend.delete(p)) removed.push(p);\n\t\t\tif (removed.length > 0) core.emit({ kind: \"deleteMany\", primaries: removed });\n\t\t},\n\t\tclear(): void {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) core.emit({ kind: \"clear\", count });\n\t\t},\n\n\t\tupsertFrom(src: Node<{ primary: K; secondary: unknown; value: V }>): () => void {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"reactiveIndex.upsertFrom requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t\t);\n\t\t\tconst op: Operator<\n\t\t\t\t{ primary: K; secondary: unknown; value: V },\n\t\t\t\t{ primary: K; secondary: unknown; value: V }\n\t\t\t> = {\n\t\t\t\tfactory: \"reactiveIndex.bindSource\",\n\t\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfor (const r of (depBatch(ctx, 0) ?? []) as readonly {\n\t\t\t\t\t\t\tprimary: K;\n\t\t\t\t\t\t\tsecondary: unknown;\n\t\t\t\t\t\t\tvalue: V;\n\t\t\t\t\t\t}[]) {\n\t\t\t\t\t\t\tctx.down([[\"DATA\", r]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"reactiveIndex.bindSource failed\")]]);\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst folder = graph.initNode(op, [src], {\n\t\t\t\tname: name ? `${name}.bind#${bindSeq++}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_bind_source\", collection: \"reactiveIndex\" },\n\t\t\t});\n\t\t\tbindDeps.add(folder as Node<unknown>);\n\t\t\tconst applyNode = ensureApply();\n\t\t\tapplyNode.subscribeDep(folder as Node<unknown>, applyBody);\n\t\t\tlet active = true;\n\t\t\tconst dispose = () => {\n\t\t\t\tif (!active) return;\n\t\t\t\tactive = false;\n\t\t\t\tapplyNode.unsubscribeDep(folder as Node<unknown>, applyBody);\n\t\t\t};\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\treleaseApply();\n\t\t\trangeMemo.disposeAll();\n\t\t},\n\t};\n}\n","/**\n * Internal graph-layer policy helpers (D70).\n *\n * This module is deliberately NOT exported from the package index. It centralizes policy plumbing\n * shared by collection structures while each structure still owns backend mutation + delta emission\n * in its apply/mutation path (D60/D61/D68/D69).\n */\n\nimport { type Ctx, depLatest } from \"../../ctx/types.js\";\nimport type { Node } from \"../../node/node.js\";\n\nexport type PolicyOpt<T> = T | Node<T>;\n\nexport interface PolicyReader<T> {\n\treadonly index: number;\n\tread(ctx: Ctx, current: T | undefined): T | undefined;\n}\n\nexport class PolicyInputs {\n\treadonly deps: Node<unknown>[];\n\n\tconstructor(initial: readonly Node<unknown>[] = []) {\n\t\tthis.deps = [...initial];\n\t}\n\n\tadd<T>(node: Node<T> | undefined): PolicyReader<T> {\n\t\tif (node === undefined) return missingPolicyReader<T>();\n\t\tconst index = this.deps.push(node as Node<unknown>) - 1;\n\t\treturn policyReader<T>(index);\n\t}\n}\n\nfunction missingPolicyReader<T>(): PolicyReader<T> {\n\treturn {\n\t\tindex: -1,\n\t\tread: (_ctx, current) => current,\n\t};\n}\n\nfunction policyReader<T>(index: number): PolicyReader<T> {\n\treturn {\n\t\tindex,\n\t\tread(ctx, current) {\n\t\t\tconst latest = depLatest(ctx, index);\n\t\t\treturn latest === undefined ? current : (latest as T);\n\t\t},\n\t};\n}\n\nexport interface KeyOrderPolicy<K> {\n\tkeys(): Iterable<K>;\n}\n\nexport function lruKeys<K>(keys: Iterable<K>): KeyOrderPolicy<K> {\n\treturn {\n\t\tkeys: () => keys,\n\t};\n}\n\nexport interface CapacityConfig {\n\treadonly maxSize?: number;\n}\n\nexport interface SizedCapacityConfig extends CapacityConfig {\n\treadonly size: number;\n}\n\nexport function trimHeadOverflow<T>(items: T[], config: CapacityConfig): T[];\nexport function trimHeadOverflow<T>(items: Iterable<T>, config: SizedCapacityConfig): T[];\nexport function trimHeadOverflow<T>(\n\titems: T[] | Iterable<T>,\n\tconfig: CapacityConfig | SizedCapacityConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 1)\n\t\tthrow new RangeError(`maxSize must be a positive integer (got ${maxSize})`);\n\n\tconst size = \"size\" in config ? config.size : Array.isArray(items) ? items.length : undefined;\n\tif (size === undefined) throw new Error(\"trimHeadOverflow requires size for non-array iterables\");\n\tconst overflow = size - maxSize;\n\tif (overflow <= 0) return [];\n\n\tif (Array.isArray(items) && !(\"size\" in config)) return items.splice(0, overflow);\n\n\tconst victims: T[] = [];\n\tfor (const item of items) {\n\t\tvictims.push(item);\n\t\tif (victims.length === overflow) break;\n\t}\n\treturn victims;\n}\n\nexport interface DeadlineEntry<K> {\n\treadonly key: K;\n\treadonly expiresAt: number;\n}\n\nexport interface DeadlinePolicy<K> {\n\treadonly size: number;\n\tpush(item: DeadlineEntry<K>): void;\n\tpeek(): DeadlineEntry<K> | undefined;\n\tpop(): DeadlineEntry<K> | undefined;\n}\n\nexport function deadlines<K>(): DeadlinePolicy<K> {\n\treturn new MinDeadlineHeap<K>();\n}\n\nclass MinDeadlineHeap<K> implements DeadlinePolicy<K> {\n\tprivate readonly items: DeadlineEntry<K>[] = [];\n\n\tget size(): number {\n\t\treturn this.items.length;\n\t}\n\n\tpush(item: DeadlineEntry<K>): void {\n\t\tthis.items.push(item);\n\t\tthis.up(this.items.length - 1);\n\t}\n\n\tpeek(): DeadlineEntry<K> | undefined {\n\t\treturn this.items[0];\n\t}\n\n\tpop(): DeadlineEntry<K> | undefined {\n\t\tconst top = this.items[0];\n\t\tconst last = this.items.pop();\n\t\tif (top !== undefined && last !== undefined && this.items.length > 0) {\n\t\t\tthis.items[0] = last;\n\t\t\tthis.down(0);\n\t\t}\n\t\treturn top;\n\t}\n\n\tprivate up(i: number): void {\n\t\twhile (i > 0) {\n\t\t\tconst p = (i - 1) >> 1;\n\t\t\tif (\n\t\t\t\t(this.items[p] as DeadlineEntry<K>).expiresAt <=\n\t\t\t\t(this.items[i] as DeadlineEntry<K>).expiresAt\n\t\t\t)\n\t\t\t\treturn;\n\t\t\t[this.items[p], this.items[i]] = [\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t\tthis.items[p] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = p;\n\t\t}\n\t}\n\n\tprivate down(i: number): void {\n\t\tfor (;;) {\n\t\t\tconst left = i * 2 + 1;\n\t\t\tconst right = left + 1;\n\t\t\tlet smallest = i;\n\t\t\tif (left < this.items.length && this.expiresAt(left) < this.expiresAt(smallest))\n\t\t\t\tsmallest = left;\n\t\t\tif (right < this.items.length && this.expiresAt(right) < this.expiresAt(smallest))\n\t\t\t\tsmallest = right;\n\t\t\tif (smallest === i) return;\n\t\t\t[this.items[i], this.items[smallest]] = [\n\t\t\t\tthis.items[smallest] as DeadlineEntry<K>,\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = smallest;\n\t\t}\n\t}\n\n\tprivate expiresAt(i: number): number {\n\t\treturn (this.items[i] as DeadlineEntry<K>).expiresAt;\n\t}\n}\n\nexport interface ScoredEntry<T> {\n\treadonly entry: T;\n\treadonly score: number;\n}\n\nexport interface RetentionSelectionConfig {\n\treadonly maxSize?: number;\n}\n\nexport function selectRetentionVictims<T>(\n\tscoredEntries: readonly ScoredEntry<T>[],\n\tconfig: RetentionSelectionConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 0)\n\t\tthrow new RangeError(`retention maxSize must be a non-negative integer (got ${maxSize})`);\n\tconst overflow = scoredEntries.length - maxSize;\n\tif (overflow <= 0) return [];\n\n\treturn scoredEntries\n\t\t.map((item, index) => {\n\t\t\tif (!Number.isFinite(item.score))\n\t\t\t\tthrow new RangeError(`retention score must be finite (got ${item.score})`);\n\t\t\treturn { ...item, index };\n\t\t})\n\t\t.sort((a, b) => a.score - b.score || a.index - b.index)\n\t\t.slice(0, overflow)\n\t\t.map((item) => item.entry);\n}\n","/**\n * Reactive positional list (CSP-2.8, D54/D60) — the two-port collection template.\n *\n * Shape (D60 + review #2): a mutable array BACKEND (the single materialized state) + the shared\n * {@link collectionCore} two ports — a DELTA stream ({@link ReactiveList.delta}, one event per\n * mutation, O(1)) and a lazy pull SNAPSHOT ({@link ReactiveList.snapshot}, materialized only on a\n * cone-routed PULL demand). Mutation input is D54 A3 hybrid: ergonomic imperative methods (the\n * external boundary, state-verb-legitimate, D4) + `appendFrom(src)` widening (an in-graph producer\n * drives the list with zero imperative glue). Synchronous quick-reads (`at`/`size`/`toArray`) are\n * the deliberately-non-reactive peek for cold/imperative reads (D60).\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch, depCount, depLatest } from \"../../ctx/types.js\";\nimport { Node } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport type { Operator } from \"../operators.js\";\nimport { trimHeadOverflow } from \"../policies/collection.js\";\nimport type { ReactiveOpt } from \"../policies/types.js\";\nimport type { ListChange } from \"./change.js\";\nimport { type CollectionCore, type CollectionCoreOptions, collectionCore } from \"./core.js\";\n\nexport type ReactiveListOpt<T> = ReactiveOpt<T>;\n\nexport interface ReactiveListOptions extends CollectionCoreOptions {\n\t/**\n\t * Head-trim capacity policy (D72). A static number caps the list locally; a Node-valued maxSize\n\t * must be graph-bound and becomes a declared policy dep that trims on policy changes.\n\t */\n\tmaxSize?: ReactiveListOpt<number>;\n}\n\nexport interface ReactiveList<T> {\n\t/** DELTA stream: one {@link ListChange} per mutation (O(1)). Subscribe to observe events. */\n\treadonly delta: Node<ListChange<T>>;\n\t/** SNAPSHOT pull node: demand via `ctx.upNext([[\"PULL\", { pullId }]])` → one `readonly T[]` (lazy O(n)). */\n\treadonly snapshot: Node<readonly T[]>;\n\t/** The snapshot node's pullId — write it verbatim into the demander's fn (D269). */\n\treadonly pullId: symbol;\n\t/** Current entry count (O(1), synchronous non-reactive read). */\n\treadonly size: number;\n\t/** Positional access (O(1)); negative indices Python-style; `undefined` out of range. Sync read. */\n\tat(index: number): T | undefined;\n\t/** Full current contents (O(n), fresh defensive copy). Sync non-reactive read (cold-start peek). */\n\ttoArray(): readonly T[];\n\tappend(value: T): void;\n\t/** Append all values; one delta event + one snapshot-arm. No-op if `values` is empty. */\n\tappendMany(values: readonly T[]): void;\n\t/** Insert at `index` (0..size). Throws `RangeError` out of range. */\n\tinsert(index: number, value: T): void;\n\t/** Insert all at `index` as one op. No-op if `values` is empty. Throws out of range. */\n\tinsertMany(index: number, values: readonly T[]): void;\n\t/** Remove and return the value at `index` (default last; negative Python-style). Throws if empty/out of range. */\n\tpop(index?: number): T;\n\tclear(): void;\n\t/** D54 widening: every value from `src` is appended. Returns a disposer. */\n\tappendFrom(src: Node<T>): () => void;\n\t/** Release the widening subscriptions (idempotent). */\n\tdispose(): void;\n}\n\n/** Default mutable-array backend (D60 first-cut; pluggable persistent/immutable backend deferred). */\nclass ListBackend<T> {\n\tprivate _version = 0;\n\tprivate readonly buf: T[];\n\n\tconstructor(initial?: readonly T[], maxSize?: number) {\n\t\tthis.buf = initial ? [...initial] : [];\n\t\ttrimHeadOverflow(this.buf, { maxSize });\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\n\tget size(): number {\n\t\treturn this.buf.length;\n\t}\n\n\tat(index: number): T | undefined {\n\t\tif (!Number.isInteger(index)) return undefined;\n\t\tconst i = index >= 0 ? index : this.buf.length + index;\n\t\treturn i < 0 || i >= this.buf.length ? undefined : this.buf[i];\n\t}\n\n\tsnapshot(): readonly T[] {\n\t\treturn [...this.buf];\n\t}\n\n\tappend(value: T): void {\n\t\tthis.buf.push(value);\n\t\tthis._version += 1;\n\t}\n\n\tappendMany(values: readonly T[]): void {\n\t\tif (values.length === 0) return;\n\t\tfor (const v of values) this.buf.push(v);\n\t\tthis._version += 1;\n\t}\n\n\tinsert(index: number, value: T): void {\n\t\tif (!Number.isInteger(index) || index < 0 || index > this.buf.length)\n\t\t\tthrow new RangeError(`insert: index ${index} out of range [0, ${this.buf.length}]`);\n\t\tthis.buf.splice(index, 0, value);\n\t\tthis._version += 1;\n\t}\n\n\tinsertMany(index: number, values: readonly T[]): void {\n\t\tif (!Number.isInteger(index) || index < 0 || index > this.buf.length)\n\t\t\tthrow new RangeError(`insertMany: index ${index} out of range [0, ${this.buf.length}]`);\n\t\tif (values.length === 0) return;\n\t\tthis.buf.splice(index, 0, ...values);\n\t\tthis._version += 1;\n\t}\n\n\tpop(index: number): T {\n\t\tif (this.buf.length === 0) throw new RangeError(\"pop from empty list\");\n\t\tif (!Number.isInteger(index)) throw new RangeError(`pop: index ${index} must be an integer`);\n\t\tconst i = index >= 0 ? index : this.buf.length + index;\n\t\tif (i < 0 || i >= this.buf.length) throw new RangeError(`pop: index ${index} out of range`);\n\t\tconst [v] = this.buf.splice(i, 1);\n\t\tthis._version += 1;\n\t\treturn v as T;\n\t}\n\n\tclear(): number {\n\t\tconst n = this.buf.length;\n\t\tif (n === 0) return 0;\n\t\tthis.buf.length = 0;\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\n\tenforceMaxSize(maxSize?: number): number {\n\t\tconst removed = trimHeadOverflow(this.buf, { maxSize }).length;\n\t\tif (removed > 0) this._version += 1;\n\t\treturn removed;\n\t}\n}\n\n/**\n * Create a reactive list (D54/D60). The DELTA + SNAPSHOT ports + pullId come from the shared\n * {@link collectionCore}; this layer adds the typed list method surface + backend.\n *\n * @example\n * ```ts\n * const list = reactiveList<number>([1]);\n * // observe events:\n * list.delta.subscribe((m) => { if (m[0] === \"DATA\") console.log(\"Δ\", m[1]); });\n * list.append(2);                 // delta: {kind:\"append\", value:2}\n * // demand the snapshot (a downstream consumer, holding `list.snapshot` upstream, runs):\n * //   ctx.upNext([[\"PULL\", { pullId: list.pullId }]]);  → SNAPSHOT delivers [1, 2]\n * list.toArray();                 // [1, 2]   (synchronous non-reactive read)\n * ```\n * @param initial - Optional initial list contents.\n * @param options - Optional graph binding, dispatcher, name, and capacity policy.\n * @returns A reactive list with DELTA and lazy SNAPSHOT ports plus imperative mutation helpers.\n * @category data-structures\n */\nexport function reactiveList<T>(\n\tinitial?: readonly T[],\n\toptions: ReactiveListOptions = {},\n): ReactiveList<T> {\n\tconst { maxSize, graph, dispatcher } = options;\n\tconst base = dispatcher ? { dispatcher } : {};\n\n\tfunction isNodeOpt(x: ReactiveListOpt<number> | undefined): x is Node<number> {\n\t\treturn x instanceof Node;\n\t}\n\n\tfunction validateMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 1)\n\t\t\tthrow new RangeError(`reactiveList: maxSize must be a positive integer (got ${v})`);\n\t\treturn v;\n\t}\n\n\tconst initialMaxSize = isNodeOpt(maxSize) ? undefined : maxSize;\n\tconst backend = new ListBackend<T>(\n\t\tinitial,\n\t\tinitialMaxSize === undefined ? undefined : validateMaxSize(initialMaxSize),\n\t);\n\tconst restorable = graph !== undefined && options.name !== undefined && maxSize === undefined;\n\tconst core: CollectionCore<readonly T[], ListChange<T>> = collectionCore(\n\t\tbackend,\n\t\t\"reactiveList\",\n\t\toptions,\n\t\trestorable\n\t\t\t? {\n\t\t\t\t\tdeltaRef: \"reactiveList.delta\",\n\t\t\t\t\tsnapshotRef: \"reactiveList.snapshot\",\n\t\t\t\t\tbackendState: () => backend.snapshot(),\n\t\t\t\t}\n\t\t\t: undefined,\n\t);\n\tconst binds: Array<() => void> = [];\n\tconst bindDeps = new WeakSet<Node<unknown>>();\n\tlet bindSeq = 0;\n\tlet capacityPolicy: Node<number> | undefined;\n\tlet apply: Node<ListChange<T>> | undefined;\n\tlet releaseApply = () => {};\n\tlet currentMaxSize = initialMaxSize;\n\n\tfunction emitTrimmed(n: number): void {\n\t\tif (n > 0) core.emit({ kind: \"trimHead\", n });\n\t}\n\n\tfunction enforceCapacity(): void {\n\t\temitTrimmed(backend.enforceMaxSize(currentMaxSize));\n\t}\n\n\tconst applyBody = (ctx: Ctx): void => {\n\t\tconst deps = apply?.deps ?? [];\n\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\tconst dep = deps[i];\n\t\t\tif (dep === capacityPolicy) {\n\t\t\t\tconst latest = depLatest(ctx, i);\n\t\t\t\tif (latest !== undefined) currentMaxSize = validateMaxSize(latest as number);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (dep && bindDeps.has(dep)) {\n\t\t\t\tfor (const value of (depBatch(ctx, i) ?? []) as readonly T[]) {\n\t\t\t\t\tbackend.append(value);\n\t\t\t\t\tcore.emit({ kind: \"append\", value });\n\t\t\t\t\tenforceCapacity();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tenforceCapacity();\n\t};\n\n\tfunction ensureApply(): Node<ListChange<T>> {\n\t\tif (apply !== undefined) return apply;\n\t\tconst op: Operator<unknown, ListChange<T>> = {\n\t\t\tfactory: \"reactiveList.capacityPolicy\",\n\t\t\tbody: applyBody,\n\t\t\topts: { partial: true },\n\t\t};\n\t\tconst deps = capacityPolicy ? [capacityPolicy as Node<unknown>] : [];\n\t\tapply = graph\n\t\t\t? graph.initNode(op, deps, {\n\t\t\t\t\tname: options.name ? `${options.name}.capacityPolicy` : undefined,\n\t\t\t\t\tmeta: { kind: \"collection_policy_apply\", collection: \"reactiveList\" },\n\t\t\t\t})\n\t\t\t: new Node<ListChange<T>>(deps, op.body, {\n\t\t\t\t\t...base,\n\t\t\t\t\tfactory: \"reactiveList.capacityPolicy\",\n\t\t\t\t\tpartial: true,\n\t\t\t\t\tname: options.name ? `${options.name}.capacityPolicy` : undefined,\n\t\t\t\t});\n\t\treleaseApply = graph\n\t\t\t? graph.retain(apply, { reason: \"reactiveList.capacityPolicy\" })\n\t\t\t: apply.subscribe(() => {});\n\t\treturn apply;\n\t}\n\n\tfunction constPolicyNode(value: number): Node<number> {\n\t\tconst op: Operator<never, number> = {\n\t\t\tfactory: \"reactiveList.maxSizePolicy\",\n\t\t\tbody: () => {},\n\t\t\topts: { initial: value },\n\t\t};\n\t\tif (graph) {\n\t\t\treturn graph.initNode(op, [], {\n\t\t\t\tname: options.name ? `${options.name}.maxSizePolicy` : undefined,\n\t\t\t\tmeta: { kind: \"collection_policy\", collection: \"reactiveList\", policy: \"maxSize\" },\n\t\t\t});\n\t\t}\n\t\treturn new Node<number>([], null, {\n\t\t\t...base,\n\t\t\tinitial: value,\n\t\t\tfactory: \"reactiveList.maxSizePolicy\",\n\t\t\tname: options.name ? `${options.name}.maxSizePolicy` : undefined,\n\t\t});\n\t}\n\n\tif (maxSize !== undefined) {\n\t\tif (isNodeOpt(maxSize) && graph === undefined)\n\t\t\tthrow new Error(\n\t\t\t\t\"reactiveList maxSize Node option requires options.graph so the policy edge is describe-visible (D72)\",\n\t\t\t);\n\t\tcapacityPolicy = isNodeOpt(maxSize)\n\t\t\t? maxSize\n\t\t\t: graph\n\t\t\t\t? constPolicyNode(validateMaxSize(maxSize))\n\t\t\t\t: undefined;\n\t\tif (capacityPolicy !== undefined) ensureApply();\n\t}\n\n\treturn {\n\t\tdelta: core.delta,\n\t\tsnapshot: core.snapshot,\n\t\tpullId: core.pullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\tat(index: number): T | undefined {\n\t\t\treturn backend.at(index);\n\t\t},\n\t\ttoArray(): readonly T[] {\n\t\t\treturn backend.snapshot();\n\t\t},\n\n\t\tappend(value: T): void {\n\t\t\tbackend.append(value);\n\t\t\tcore.emit({ kind: \"append\", value });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tappendMany(values: readonly T[]): void {\n\t\t\tif (values.length === 0) return;\n\t\t\tconst copy = [...values];\n\t\t\tbackend.appendMany(copy);\n\t\t\tcore.emit({ kind: \"appendMany\", values: copy });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tinsert(index: number, value: T): void {\n\t\t\tbackend.insert(index, value);\n\t\t\tcore.emit({ kind: \"insert\", index, value });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tinsertMany(index: number, values: readonly T[]): void {\n\t\t\tif (values.length === 0) {\n\t\t\t\t// still validate the index (mirror backend) so an out-of-range empty insert throws\n\t\t\t\tbackend.insertMany(index, values);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst copy = [...values];\n\t\t\tbackend.insertMany(index, copy);\n\t\t\tcore.emit({ kind: \"insertMany\", index, values: copy });\n\t\t\tenforceCapacity();\n\t\t},\n\t\tpop(index = -1): T {\n\t\t\tconst resolved = index < 0 ? backend.size + index : index;\n\t\t\tconst value = backend.pop(index);\n\t\t\tcore.emit({ kind: \"pop\", index: resolved, value });\n\t\t\treturn value;\n\t\t},\n\t\tclear(): void {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) core.emit({ kind: \"clear\", count });\n\t\t},\n\n\t\tappendFrom(src: Node<T>): () => void {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"reactiveList.appendFrom requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t\t);\n\t\t\tconst op: Operator<T, T> = {\n\t\t\t\tfactory: \"reactiveList.bindSource\",\n\t\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfor (const value of (depBatch(ctx, 0) ?? []) as readonly T[]) {\n\t\t\t\t\t\t\tctx.down([[\"DATA\", value]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"reactiveList.bindSource failed\")]]);\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst folder = graph.initNode(op, [src], {\n\t\t\t\tname: options.name ? `${options.name}.bind#${bindSeq++}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_bind_source\", collection: \"reactiveList\" },\n\t\t\t});\n\t\t\tbindDeps.add(folder as Node<unknown>);\n\t\t\tconst applyNode = ensureApply();\n\t\t\tapplyNode.subscribeDep(folder as Node<unknown>, applyBody);\n\t\t\tlet active = true;\n\t\t\tconst dispose = () => {\n\t\t\t\tif (!active) return;\n\t\t\t\tactive = false;\n\t\t\t\tapplyNode.unsubscribeDep(folder as Node<unknown>, applyBody);\n\t\t\t};\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\treleaseApply();\n\t\t},\n\t};\n}\n","/**\n * Reactive append-only log (CSP-2.8, D54/D60) — two-port collection with incremental views.\n *\n * Shape = the shared {@link collectionCore} two ports over an array (or ring-buffer if `maxSize`)\n * BACKEND (D60). Specializations (D60 #5 / review #5):\n *   - SNAPSHOT (the full `readonly T[]`) is the lazy pull port like the others, BUT the log's main\n *     consumption is INCREMENTAL: `tail()` / `slice()` / `scan()` re-derive on the DELTA backbone\n *     (dep=[delta]), folding each appended value as it arrives — NOT re-scanning a pushed full array.\n *   - `append(undefined)` throws: `undefined` is the substrate SENTINEL (R-data-payload / R-sentinel),\n *     not a valid value.\n *   - empty log: the snapshot is `[]` (a real empty array); a never-appended `scan` seeds its initial.\n *     There is NO `[[RESOLVED]]`-for-empty dual role (D49 narrowed RESOLVED to undirty-only, D60 #5b).\n *   - `attach(upstream)` = the D54 widening (a declared input-fold dep), NOT an imperative subscribe.\n *   - {@link mergeReactiveLogs} is a DECLARED-DEP merge (deps=[...delta streams]), NOT the old\n *     internal-subscribe island (D45 must-fix, D60 #5e).\n *   - storage persistence = D57 (binding-layer observe-sink), out of scope here.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport { type Ctx, depBatch, depCount } from \"../../ctx/types.js\";\nimport { type Node, node } from \"../../node/node.js\";\nimport type { GraphCheckpointJson } from \"../checkpoint.js\";\nimport { trimHeadOverflow } from \"../policies/collection.js\";\nimport type { ViewCachePolicy } from \"../policies/types.js\";\nimport type { LogChange } from \"./change.js\";\nimport {\n\ttype CollectionCore,\n\ttype CollectionCoreOptions,\n\tcollectionCore,\n\tlightReactiveView,\n\ttype ReactiveView,\n\tViewMemoCache,\n} from \"./core.js\";\n\nexport interface ReactiveLogOptions extends CollectionCoreOptions {\n\t/** Ring-buffer cap: appends past `maxSize` evict the oldest (head-trim, append-only-safe). */\n\tmaxSize?: number;\n\t/** Static D80 memo policy for D121 light views. Eviction does not dispose returned views. */\n\tviewCache?: ViewCachePolicy;\n}\n\nexport interface ReactiveLog<T> {\n\treadonly delta: Node<LogChange<T>>;\n\t/** SNAPSHOT pull node: demand → full `readonly T[]` (lazy O(n)). For incremental use {@link tail}, {@link slice}, or {@link scan}. */\n\treadonly snapshot: Node<readonly T[]>;\n\treadonly pullId: symbol;\n\t/** Entry count (O(1)). Sync non-reactive read. */\n\treadonly size: number;\n\t/** Positional access (O(1)); negative Python-style; `undefined` out of range. Sync read. */\n\tat(index: number): T | undefined;\n\t/** Full contents (O(n) fresh copy). Sync non-reactive read (cold-start peek). */\n\ttoArray(): readonly T[];\n\t/** Append one value. Throws on `undefined` (substrate SENTINEL, R-data-payload). */\n\tappend(value: T): void;\n\t/** Append many; one delta event. No-op if empty. Throws if any value is `undefined`. */\n\tappendMany(values: readonly T[]): void;\n\tclear(): void;\n\t/** Remove the first `n` entries (clamped to size). */\n\ttrimHead(n: number): void;\n\t/**\n\t * Incremental tail view: a derived node emitting the last `n` entries, recomputed on each delta\n\t * (dep=[delta], D60 #5a). Memoized per `n` until {@link dispose}; use stable ranges for\n\t * long-lived logs. Subscribe to keep it live.\n\t */\n\ttail(n: number): Node<readonly T[]>;\n\t/**\n\t * Incremental positional view: a derived node emitting `toArray().slice(start, stop)`,\n\t * recomputed on each delta (dep=[delta], D60 #5a). Memoized per `[start, stop]` until\n\t * {@link dispose}; use stable ranges for long-lived logs.\n\t */\n\tslice(start: number, stop?: number): Node<readonly T[]>;\n\t/**\n\t * D121 light page view: `delta` forwards parent log mutations, and `snapshot` is a pull node\n\t * that materializes the current page on demand.\n\t */\n\tpage(offset: number, limit: number): ReactiveView<LogChange<T>, readonly T[]>;\n\t/**\n\t * Incremental running aggregate over appended values (dep=[delta], D60 #5a). O(1) per append —\n\t * folds only the new values each delta; resets on `clear`/`trimHead` (a non-append delta) via a\n\t * full re-fold. Emits the current accumulator on every mutation; seeds `initial` on an empty log.\n\t */\n\tscan<A>(initial: A, step: (acc: A, value: T) => A): Node<A>;\n\t/** D54 widening: every value from `src` is appended. Returns a disposer. */\n\tattach(src: Node<T>): () => void;\n\tdispose(): void;\n}\n\n/** Default array / ring-buffer backend (D60 first-cut; persistent backend deferred). */\nclass LogBackend<T> {\n\tprivate _version = 0;\n\tprivate buf: T[];\n\tprivate readonly maxSize?: number;\n\n\tconstructor(initial?: readonly T[], maxSize?: number) {\n\t\tif (maxSize !== undefined && maxSize < 1)\n\t\t\tthrow new RangeError(\"reactiveLog: maxSize must be >= 1\");\n\t\tthis.maxSize = maxSize;\n\t\tthis.buf = initial ? [...initial] : [];\n\t\ttrimHeadOverflow(this.buf, { maxSize });\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\tget size(): number {\n\t\treturn this.buf.length;\n\t}\n\tat(index: number): T | undefined {\n\t\tif (!Number.isInteger(index)) return undefined;\n\t\tconst i = index >= 0 ? index : this.buf.length + index;\n\t\treturn i < 0 || i >= this.buf.length ? undefined : this.buf[i];\n\t}\n\tsnapshot(): readonly T[] {\n\t\treturn [...this.buf];\n\t}\n\n\tappend(value: T): void {\n\t\tthis.buf.push(value);\n\t\ttrimHeadOverflow(this.buf, { maxSize: this.maxSize });\n\t\tthis._version += 1;\n\t}\n\tappendMany(values: readonly T[]): void {\n\t\tif (values.length === 0) return;\n\t\tfor (const v of values) this.buf.push(v);\n\t\ttrimHeadOverflow(this.buf, { maxSize: this.maxSize });\n\t\tthis._version += 1;\n\t}\n\tclear(): number {\n\t\tconst n = this.buf.length;\n\t\tif (n === 0) return 0;\n\t\tthis.buf.length = 0;\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\ttrimHead(n: number): number {\n\t\tif (!Number.isInteger(n) || n < 0)\n\t\t\tthrow new RangeError(`trimHead: n must be a non-negative integer (got ${n})`);\n\t\tif (n === 0 || this.buf.length === 0) return 0;\n\t\tconst removed = Math.min(n, this.buf.length);\n\t\tthis.buf.splice(0, removed);\n\t\tthis._version += 1;\n\t\treturn removed;\n\t}\n}\n\nfunction rejectUndefined<T>(value: T, ctx: string): void {\n\t// R-data-payload / R-sentinel (D60 #5): undefined is the substrate SENTINEL, not a valid value.\n\tif (value === undefined)\n\t\tthrow new TypeError(\n\t\t\t`${ctx}: undefined is the substrate SENTINEL, not a valid value — use null`,\n\t\t);\n}\n\n/**\n * Create an append-only reactive log (D54/D60). DELTA + lazy pull SNAPSHOT + pullId via\n * {@link collectionCore}; this layer adds the typed append surface + incremental view/scan.\n */\nexport function reactiveLog<T>(\n\tinitial?: readonly T[],\n\toptions: ReactiveLogOptions = {},\n): ReactiveLog<T> {\n\tconst { maxSize, viewCache, ...coreOpts } = options;\n\tconst base = coreOpts.dispatcher ? { dispatcher: coreOpts.dispatcher } : {};\n\tconst backend = new LogBackend<T>(initial, maxSize);\n\tconst restoreConfig =\n\t\tcoreOpts.graph !== undefined && coreOpts.name !== undefined\n\t\t\t? ({\n\t\t\t\t\t...(maxSize !== undefined ? { maxSize } : {}),\n\t\t\t\t} as GraphCheckpointJson)\n\t\t\t: undefined;\n\tconst core: CollectionCore<readonly T[], LogChange<T>> = collectionCore(\n\t\tbackend,\n\t\t\"reactiveLog\",\n\t\tcoreOpts,\n\t\trestoreConfig !== undefined\n\t\t\t? {\n\t\t\t\t\tdeltaRef: \"reactiveLog.delta\",\n\t\t\t\t\tsnapshotRef: \"reactiveLog.snapshot\",\n\t\t\t\t\tconfig: restoreConfig,\n\t\t\t\t\tbackendState: () => backend.snapshot(),\n\t\t\t\t}\n\t\t\t: undefined,\n\t);\n\tconst binds: Array<() => void> = [];\n\tconst tailMemo = new Map<number, Node<readonly T[]>>();\n\tconst sliceMemo = new Map<string, Node<readonly T[]>>();\n\tconst pageMemo = new ViewMemoCache<string, ReactiveView<LogChange<T>, readonly T[]>>(viewCache);\n\tlet pageSeq = 0;\n\n\treturn {\n\t\tdelta: core.delta,\n\t\tsnapshot: core.snapshot,\n\t\tpullId: core.pullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\tat(index: number): T | undefined {\n\t\t\treturn backend.at(index);\n\t\t},\n\t\ttoArray(): readonly T[] {\n\t\t\treturn backend.snapshot();\n\t\t},\n\n\t\tappend(value: T): void {\n\t\t\trejectUndefined(value, \"reactiveLog.append\");\n\t\t\tbackend.append(value);\n\t\t\tcore.emit({ kind: \"append\", value });\n\t\t},\n\t\tappendMany(values: readonly T[]): void {\n\t\t\tif (values.length === 0) return;\n\t\t\tfor (const v of values) rejectUndefined(v, \"reactiveLog.appendMany\");\n\t\t\tconst copy = [...values];\n\t\t\tbackend.appendMany(copy);\n\t\t\tcore.emit({ kind: \"appendMany\", values: copy });\n\t\t},\n\t\tclear(): void {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) core.emit({ kind: \"clear\", count });\n\t\t},\n\t\ttrimHead(n: number): void {\n\t\t\tconst removed = backend.trimHead(n);\n\t\t\tif (removed > 0) core.emit({ kind: \"trimHead\", n: removed });\n\t\t},\n\n\t\ttail(n: number): Node<readonly T[]> {\n\t\t\tif (!Number.isInteger(n) || n < 0)\n\t\t\t\tthrow new RangeError(`tail: n must be a non-negative integer (got ${n})`);\n\t\t\tconst hit = tailMemo.get(n);\n\t\t\tif (hit !== undefined) return hit;\n\t\t\t// Incremental on the DELTA backbone (D60 #5a): each delta re-reads the backend's current\n\t\t\t// tail (the backend is this structure's own materialized state, D60 #1 — not a foreign\n\t\t\t// .cache peek). `partial:true` — the tail does not consume the delta value, it fires on arm.\n\t\t\tconst tnode = node<readonly T[]>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\tconst all = backend.snapshot();\n\t\t\t\t\tctx.down([[\"DATA\", n === 0 ? [] : all.slice(Math.max(0, all.length - n))]]);\n\t\t\t\t},\n\t\t\t\t{ ...base, factory: \"reactiveLog.tail\", partial: true },\n\t\t\t);\n\t\t\ttailMemo.set(n, tnode);\n\t\t\treturn tnode;\n\t\t},\n\n\t\tslice(start: number, stop?: number): Node<readonly T[]> {\n\t\t\tif (!Number.isInteger(start) || start < 0) {\n\t\t\t\tthrow new RangeError(`slice: start must be a non-negative integer (got ${start})`);\n\t\t\t}\n\t\t\tif (stop !== undefined && (!Number.isInteger(stop) || stop < 0)) {\n\t\t\t\tthrow new RangeError(`slice: stop must be a non-negative integer (got ${stop})`);\n\t\t\t}\n\t\t\tconst key = `${start}:${stop ?? \"\"}`;\n\t\t\tconst hit = sliceMemo.get(key);\n\t\t\tif (hit !== undefined) return hit;\n\t\t\t// Incremental on the DELTA backbone (D60 #5a): each delta re-reads this log's own\n\t\t\t// backend slice. The backend is the single materialized state (D60), not a dep cache.\n\t\t\tconst snode = node<readonly T[]>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\tctx.down([[\"DATA\", backend.snapshot().slice(start, stop)]]);\n\t\t\t\t},\n\t\t\t\t{ ...base, factory: \"reactiveLog.slice\", partial: true },\n\t\t\t);\n\t\t\tsliceMemo.set(key, snode);\n\t\t\treturn snode;\n\t\t},\n\n\t\tpage(offset: number, limit: number): ReactiveView<LogChange<T>, readonly T[]> {\n\t\t\tif (!Number.isInteger(offset) || offset < 0) {\n\t\t\t\tthrow new RangeError(`page: offset must be a non-negative integer (got ${offset})`);\n\t\t\t}\n\t\t\tif (!Number.isInteger(limit) || limit < 0) {\n\t\t\t\tthrow new RangeError(`page: limit must be a non-negative integer (got ${limit})`);\n\t\t\t}\n\t\t\tconst key = `${offset}:${limit}`;\n\t\t\tconst hit = pageMemo.get(key);\n\t\t\tif (hit !== undefined) return hit;\n\t\t\tconst materialize = (): readonly T[] => backend.snapshot().slice(offset, offset + limit);\n\t\t\tlet view: ReactiveView<LogChange<T>, readonly T[]>;\n\t\t\tview = lightReactiveView<LogChange<T>, readonly T[]>(core.delta as Node<unknown>, {\n\t\t\t\t...coreOpts,\n\t\t\t\tfactory: \"reactiveLog.page\",\n\t\t\t\tname: coreOpts.name ? `${coreOpts.name}.page#${pageSeq++}` : undefined,\n\t\t\t\tmaterializeSnapshot: materialize,\n\t\t\t\tonDispose: () => {\n\t\t\t\t\tpageMemo.deleteValue(view);\n\t\t\t\t},\n\t\t\t});\n\t\t\tpageMemo.set(key, view);\n\t\t\treturn view;\n\t\t},\n\n\t\tscan<A>(initial: A, step: (acc: A, value: T) => A): Node<A> {\n\t\t\t// Incremental fold on the delta backbone: keep the accumulator + processed-count in\n\t\t\t// ctx.state; fold only the new tail each append; full re-fold on a shrink (clear/trimHead).\n\t\t\treturn node<A>(\n\t\t\t\t[core.delta as Node<unknown>],\n\t\t\t\t(ctx: Ctx) => {\n\t\t\t\t\tconst st = ctx.state.get<{ acc: A; processed: number }>() ?? {\n\t\t\t\t\t\tacc: initial,\n\t\t\t\t\t\tprocessed: 0,\n\t\t\t\t\t};\n\t\t\t\t\tconst all = backend.snapshot();\n\t\t\t\t\tif (all.length < st.processed || (maxSize !== undefined && all.length <= st.processed)) {\n\t\t\t\t\t\t// Shrink or ring-buffer overwrite: re-fold from the current backend snapshot.\n\t\t\t\t\t\tlet acc = initial;\n\t\t\t\t\t\tfor (const v of all) acc = step(acc, v);\n\t\t\t\t\t\tst.acc = acc;\n\t\t\t\t\t\tst.processed = all.length;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = st.processed; i < all.length; i++) st.acc = step(st.acc, all[i] as T);\n\t\t\t\t\t\tst.processed = all.length;\n\t\t\t\t\t}\n\t\t\t\t\tctx.state.set(st);\n\t\t\t\t\tctx.down([[\"DATA\", st.acc]]);\n\t\t\t\t},\n\t\t\t\t{ ...base, factory: \"reactiveLog.scan\", partial: true },\n\t\t\t);\n\t\t},\n\n\t\tattach(src: Node<T>): () => void {\n\t\t\tconst dispose = core.bindSource(src, (value: T) => {\n\t\t\t\trejectUndefined(value, \"reactiveLog.attach\");\n\t\t\t\tbackend.append(value);\n\t\t\t\tcore.emit({ kind: \"append\", value });\n\t\t\t});\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\ttailMemo.clear();\n\t\t\tsliceMemo.clear();\n\t\t\tpageMemo.disposeAll();\n\t\t},\n\t};\n}\n\n/**\n * Fan-in N reactive logs into one merged DELTA stream (D60 #5e — a DECLARED-DEP merge, NOT the old\n * internal-subscribe island). The returned node declares each log's `delta` as a dep (`partial`)\n * and re-emits every change it sees — describe shows `log[i].delta → merged` truthfully (D45).\n * For the merged SNAPSHOT, fold the merged delta with {@link ReactiveLog.scan}-style logic, or\n * demand each source's snapshot independently.\n */\nexport function mergeReactiveLogs<T>(logs: readonly ReactiveLog<T>[]): Node<LogChange<T>> {\n\tconst deps = logs.map((l) => l.delta as Node<unknown>);\n\treturn node<LogChange<T>>(\n\t\tdeps,\n\t\t(ctx: Ctx) => {\n\t\t\tfor (let i = 0; i < depCount(ctx); i++) {\n\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\tif (b) for (const c of b) ctx.down([[\"DATA\", c as LogChange<T>]]);\n\t\t\t}\n\t\t},\n\t\t{ factory: \"mergeReactiveLogs\", partial: true },\n\t);\n}\n\n/**\n * Standalone incremental scan over a reactive log. Equivalent to `log.scan(initial, step)`;\n * provided for pipe-builder and helper-composition call sites.\n */\nexport function scanLog<T, A>(\n\tlog: ReactiveLog<T>,\n\tinitial: A,\n\tstep: (acc: A, value: T) => A,\n): Node<A> {\n\treturn log.scan(initial, step);\n}\n","/**\n * Async + sync sources (binding-layer sugar, D43 / D40 / feedback_async_sources_binding_layer).\n *\n * Sources are depless {@link Operator}`<never, T>` specs built on the `producer`/`node` path:\n * the body runs ONCE on activation (node `_activate`), schedules its work, and emits later via\n * the captured `ctx.down` (an external tier-3 emit → the leading DIRTY is synthesized for it,\n * R-dirty-before-data). Async lives ONLY here (R-no-raw-async / F-SYNC-CORE): `setTimeout` /\n * `Promise` / `for await` are confined to source bodies; the wave core stays sync. Cleanup is\n * `ctx.onDeactivation` (D28), NOT a returned object. Per-language (D6/D24), never in parity.\n *\n * Instantiate via `g.initNode(timer(1000), [])` (graph-bound, inspectable) or\n * {@link initNode}(timer(1000), []) (bare). Pool/pause defaults (D43): timer/interval =\n * sync + pausable:false (keep producing through PAUSE); fromPromise/fromAsyncIter = async\n * (default pausable, so a paused source buffers its late emits — R-async-paused).\n */\n\nimport type { Ctx } from \"../ctx/types.js\";\nimport type { Node, NodeOptions } from \"../node/node.js\";\nimport { errorPayload } from \"../protocol/messages.js\";\nimport { toCheckpointJson } from \"./checkpoint.js\";\nimport type {\n\tDriverCancel,\n\tDriverResult,\n\tHttpRequest,\n\tHttpResponse,\n\tProcessCommand,\n\tProcessResult,\n\tSseDriverEvent,\n\tSseEvent,\n\tSseRequest,\n\tWebhookDriverEvent,\n\tWebhookEvent,\n\tWebhookRegistration,\n\tWebSocketDriverEvent,\n\tWebSocketEvent,\n\tWebSocketRequest,\n} from \"./environment.js\";\nimport { initNode, type Operator } from \"./operators.js\";\n\n/**\n * Values accepted by {@link fromAny}: an existing Node, a Promise, an (a)sync iterable, or a\n * bare scalar. The universal coercion target for higher-order operators (CSP-2.7).\n */\nexport type NodeInput<T> = Node<T> | PromiseLike<T> | AsyncIterable<T> | Iterable<T> | T;\n\n/** Host-boundary options for {@link singleFromAny}. */\nexport interface SingleFromAnyOptions<K> {\n\t/**\n\t * Map a caller key to the in-flight dedupe key. Defaults to key identity; object keys dedupe only\n\t * when the same object reference is reused. Return a stable string/canonical value for structural\n\t * object-key dedupe.\n\t */\n\tkeyOf?: (key: K) => unknown;\n\t/** Treat a sync iterable result as a stream and take its first item. Defaults to scalar value. */\n\titer?: boolean;\n}\n\n/**\n * Internal: build a depless source spec. `setup` runs once on activation; its returned fn (if\n * any) is registered as the deactivation cleanup (clear timers / abort). `setup` schedules the\n * async work and emits via `ctx.down` — synchronously (sync sources) or later (async sources).\n */\nfunction source<T>(\n\tfactory: string,\n\t// biome-ignore lint/suspicious/noConfusingVoidType: setup returns a cleanup fn OR nothing — the void arm keeps no-return source bodies (e.g. `of`/`fromIter`) ergonomic, same idiom as EffectFn.\n\tsetup: (ctx: Ctx) => void | (() => void),\n\topts?: Partial<NodeOptions<T>>,\n): Operator<never, T> {\n\treturn {\n\t\tfactory,\n\t\topts,\n\t\tbody: (ctx) => {\n\t\t\tlet cleanup: undefined | (() => void);\n\t\t\tlet deactivated = false;\n\t\t\tctx.onDeactivation(() => {\n\t\t\t\tdeactivated = true;\n\t\t\t\tif (typeof cleanup === \"function\") cleanup();\n\t\t\t});\n\t\t\tconst maybeCleanup = setup(ctx);\n\t\t\tcleanup = typeof maybeCleanup === \"function\" ? maybeCleanup : undefined;\n\t\t\tif (deactivated && typeof cleanup === \"function\") cleanup();\n\t\t},\n\t};\n}\n\nfunction assertNonEmptyString(value: string, label: string): void {\n\tif (typeof value !== \"string\" || value.length === 0) {\n\t\tthrow new TypeError(`${label} must be a non-empty string`);\n\t}\n}\n\nfunction cleanupDriverWork(\n\tactive: { value: boolean },\n\tcancelSlot: { value: DriverCancel | undefined },\n): void {\n\tactive.value = false;\n\tconst cancel = cancelSlot.value;\n\tcancelSlot.value = undefined;\n\tif (cancel !== undefined) runDriverCancel(cancel);\n}\n\nfunction installDriverCancel(\n\tactive: { value: boolean },\n\tcancelSlot: { value: DriverCancel | undefined },\n\tcancel: DriverCancel,\n): void {\n\tif (active.value) cancelSlot.value = cancel;\n\telse runDriverCancel(cancel);\n}\n\nfunction runDriverCancel(cancel: DriverCancel): void {\n\ttry {\n\t\tcancel();\n\t} catch {\n\t\t// Driver cleanup is best-effort: it must not suppress graph-visible terminal delivery.\n\t}\n}\n\nfunction driverOneShotSource<T>(\n\tfactory: string,\n\tmissing: string,\n\tstart: (ctx: Ctx, callback: (result: DriverResult<T>) => void) => DriverCancel | undefined,\n): Operator<never, T> {\n\treturn source<T>(\n\t\tfactory,\n\t\t(ctx) => {\n\t\t\tconst active = { value: true };\n\t\t\tconst cancelSlot: { value: DriverCancel | undefined } = { value: undefined };\n\t\t\tconst callback = (result: DriverResult<T>) => {\n\t\t\t\tif (!active.value) return;\n\t\t\t\tcleanupDriverWork(active, cancelSlot);\n\t\t\t\tif (result.ok) ctx.down([[\"DATA\", result.value], [\"COMPLETE\"]]);\n\t\t\t\telse ctx.down([[\"ERROR\", errorPayload(result.error)]]);\n\t\t\t};\n\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\ttry {\n\t\t\t\tcancel = start(ctx, callback);\n\t\t\t} catch (e) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (cancel === undefined) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", missing]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tinstallDriverCancel(active, cancelSlot, cancel);\n\t\t\treturn () => cleanupDriverWork(active, cancelSlot);\n\t\t},\n\t\t{ pool: \"async\", pausable: false },\n\t);\n}\n\nfunction driverStreamSource<T, E extends { readonly kind: string }>(\n\tfactory: string,\n\tmissing: string,\n\tstart: (ctx: Ctx, callback: (event: E) => void) => DriverCancel | undefined,\n\tdataOf: (event: E) => T | undefined,\n\terrorOf: (event: E) => unknown,\n): Operator<never, T> {\n\treturn source<T>(\n\t\tfactory,\n\t\t(ctx) => {\n\t\t\tconst active = { value: true };\n\t\t\tconst cancelSlot: { value: DriverCancel | undefined } = { value: undefined };\n\t\t\tconst callback = (event: E) => {\n\t\t\t\tif (!active.value) return;\n\t\t\t\tif (event.kind === \"event\") {\n\t\t\t\t\tconst value = dataOf(event);\n\t\t\t\t\tif (value !== undefined) ctx.down([[\"DATA\", value]]);\n\t\t\t\t} else if (event.kind === \"error\") {\n\t\t\t\t\tcleanupDriverWork(active, cancelSlot);\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(errorOf(event))]]);\n\t\t\t\t} else if (event.kind === \"complete\") {\n\t\t\t\t\tcleanupDriverWork(active, cancelSlot);\n\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t}\n\t\t\t};\n\t\t\tlet cancel: DriverCancel | undefined;\n\t\t\ttry {\n\t\t\t\tcancel = start(ctx, callback);\n\t\t\t} catch (e) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (cancel === undefined) {\n\t\t\t\tactive.value = false;\n\t\t\t\tctx.down([[\"ERROR\", missing]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tinstallDriverCancel(active, cancelSlot, cancel);\n\t\t\treturn () => cleanupDriverWork(active, cancelSlot);\n\t\t},\n\t\t{ pool: \"async\", pausable: false },\n\t);\n}\n\nfunction isNode(x: unknown): x is Node {\n\treturn (\n\t\tx != null &&\n\t\ttypeof x === \"object\" &&\n\t\t\"cache\" in x &&\n\t\ttypeof (x as Node).subscribe === \"function\"\n\t);\n}\n\nfunction isThenable(x: unknown): x is PromiseLike<unknown> {\n\treturn x != null && typeof (x as PromiseLike<unknown>).then === \"function\";\n}\n\nfunction isAsyncIterable<T>(x: unknown): x is AsyncIterable<T> {\n\treturn (\n\t\tx !== null &&\n\t\tx !== undefined &&\n\t\ttypeof (x as { [Symbol.asyncIterator]?: unknown })[Symbol.asyncIterator] === \"function\"\n\t);\n}\n\nfunction isIterable<T>(x: unknown): x is Iterable<T> {\n\treturn (\n\t\tx !== null &&\n\t\tx !== undefined &&\n\t\ttypeof (x as { [Symbol.iterator]?: unknown })[Symbol.iterator] === \"function\"\n\t);\n}\n\n/** Options shared by async/timer sources: an optional AbortSignal → ERROR on abort. */\nexport interface AsyncSourceOpts {\n\tsignal?: AbortSignal;\n}\n\nexport interface TimerSourceOpts extends AsyncSourceOpts {\n\tperiod?: number;\n}\n\n/** Options for {@link fromCron}. */\nexport interface FromCronOptions extends AsyncSourceOpts {\n\t/** Cron matcher polling interval in milliseconds. Default: 60_000. */\n\ttickMs?: number;\n\t/** IANA timezone used for wall-clock cron matching. Defaults to the host-local timezone. */\n\ttimezone?: string;\n\t/**\n\t * DST policy for timezone-aware matching. Current D484 defaults are explicit: nonexistent\n\t * wall-clock minutes are skipped, and repeated wall-clock minutes fire at most once.\n\t */\n\tdst?: {\n\t\treadonly nonexistent?: \"skip\";\n\t\treadonly repeated?: \"once\";\n\t};\n\t/**\n\t * Emitted value shape. `timestamp_ns` is a decimal string so it cannot lose precision as a\n\t * JavaScript number; use `timestamp_ms` when numeric millisecond precision is enough.\n\t */\n\toutput?: \"date\" | \"timestamp_ms\" | \"timestamp_ns\";\n}\n\n/** Minimal five-field cron schedule: minute hour day-of-month month day-of-week. */\nexport interface CronSchedule {\n\treadonly minutes: ReadonlySet<number>;\n\treadonly hours: ReadonlySet<number>;\n\treadonly daysOfMonth: ReadonlySet<number>;\n\treadonly months: ReadonlySet<number>;\n\treadonly daysOfWeek: ReadonlySet<number>;\n}\n\n/** DOM/EventEmitter-style target accepted by {@link fromEvent}. */\nexport interface EventTargetLike {\n\taddEventListener(\n\t\ttype: string,\n\t\tlistener: (event: unknown) => void,\n\t\toptions?: EventListenerOptionsLike,\n\t): void;\n\tremoveEventListener(\n\t\ttype: string,\n\t\tlistener: (event: unknown) => void,\n\t\toptions?: EventListenerOptionsLike,\n\t): void;\n}\n\nexport interface EventListenerOptionsLike {\n\tcapture?: boolean;\n\tpassive?: boolean;\n\tonce?: boolean;\n}\n\nexport type FromEventOptions = EventListenerOptionsLike;\n\n/** Host push registration callback accepted by {@link fromPushNotification}. */\nexport type PushUnsubscribe = () => void;\nexport type PushRegister<T> = (deliver: (payload: T) => void) => PushUnsubscribe | undefined;\n\nfunction parseCronField(field: string, min: number, max: number): Set<number> {\n\tif (field.length === 0) throw new Error(\"Invalid cron field: empty\");\n\tconst out = new Set<number>();\n\tfor (const part of field.split(\",\")) {\n\t\tif (part.length === 0) throw new Error(`Invalid cron field: ${field}`);\n\t\tconst stepParts = part.split(\"/\");\n\t\tif (stepParts.length > 2) throw new Error(`Invalid cron step: ${part}`);\n\t\tconst [range, stepText] = stepParts;\n\t\tif (range == null || range.length === 0) throw new Error(`Invalid cron field: ${field}`);\n\t\tif (stepText === \"\") throw new Error(`Invalid cron step: ${part}`);\n\t\tconst step = stepText == null ? 1 : parseCronInt(stepText, `Invalid cron step: ${part}`);\n\t\tif (step < 1) throw new Error(`Invalid cron step: ${part}`);\n\n\t\tlet start: number;\n\t\tlet end: number;\n\t\tif (range === \"*\") {\n\t\t\tstart = min;\n\t\t\tend = max;\n\t\t} else if (range.includes(\"-\")) {\n\t\t\tconst [a, b, extra] = range.split(\"-\");\n\t\t\tif (extra !== undefined || a === \"\" || b === \"\")\n\t\t\t\tthrow new Error(`Invalid cron field: ${field}`);\n\t\t\tstart = parseCronInt(a, `Invalid cron field: ${field}`);\n\t\t\tend = parseCronInt(b, `Invalid cron field: ${field}`);\n\t\t} else {\n\t\t\tstart = parseCronInt(range, `Invalid cron field: ${field}`);\n\t\t\tend = start;\n\t\t}\n\n\t\tif (!Number.isInteger(start) || !Number.isInteger(end)) {\n\t\t\tthrow new Error(`Invalid cron field: ${field}`);\n\t\t}\n\t\tif (start < min || end > max) {\n\t\t\tthrow new RangeError(`Cron field out of range: ${field} (${min}-${max})`);\n\t\t}\n\t\tif (start > end) throw new Error(`Invalid cron range: ${start}-${end} in ${field}`);\n\t\tfor (let i = start; i <= end; i += step) out.add(i);\n\t}\n\treturn out;\n}\n\nfunction parseCronInt(text: string, message: string): number {\n\tif (!/^\\d+$/.test(text)) throw new Error(message);\n\tconst value = Number.parseInt(text, 10);\n\tif (!Number.isSafeInteger(value)) throw new Error(message);\n\treturn value;\n}\n\n/** Parse a standard five-field cron expression. */\nexport function parseCron(expr: string): CronSchedule {\n\tconst parts = expr.trim().split(/\\s+/);\n\tif (parts.length !== 5 || parts.some((part) => part.length === 0)) {\n\t\tthrow new Error(`Invalid cron: expected 5 fields, got ${parts.length}`);\n\t}\n\treturn {\n\t\tminutes: parseCronField(parts[0], 0, 59),\n\t\thours: parseCronField(parts[1], 0, 23),\n\t\tdaysOfMonth: parseCronField(parts[2], 1, 31),\n\t\tmonths: parseCronField(parts[3], 1, 12),\n\t\tdaysOfWeek: parseCronField(parts[4], 0, 6),\n\t};\n}\n\nexport interface CronMatchOptions {\n\t/** IANA timezone used for wall-clock projection. Defaults to the host-local timezone. */\n\ttimezone?: string;\n}\n\ninterface CronWallClockFields {\n\treadonly year: number;\n\treadonly month: number;\n\treadonly day: number;\n\treadonly hour: number;\n\treadonly minute: number;\n\treadonly dayOfWeek: number;\n}\n\n/** Test whether a Date matches a parsed cron schedule in host-local time or an IANA timezone. */\nexport function matchesCron(\n\tschedule: CronSchedule,\n\tdate: Date,\n\topts: CronMatchOptions = {},\n): boolean {\n\tconst fields = cronWallClockFields(date, opts.timezone);\n\treturn (\n\t\tschedule.minutes.has(fields.minute) &&\n\t\tschedule.hours.has(fields.hour) &&\n\t\tschedule.daysOfMonth.has(fields.day) &&\n\t\tschedule.months.has(fields.month) &&\n\t\tschedule.daysOfWeek.has(fields.dayOfWeek)\n\t);\n}\n\nfunction cronMinuteKey(date: Date, timezone?: string): string {\n\tconst fields = cronWallClockFields(date, timezone);\n\treturn `${fields.year}-${fields.month}-${fields.day}-${fields.hour}-${fields.minute}`;\n}\n\nfunction cronDayKey(date: Date, timezone?: string): string {\n\tconst fields = cronWallClockFields(date, timezone);\n\treturn `${fields.year}-${fields.month}-${fields.day}`;\n}\n\nfunction cronWallClockFields(date: Date, timezone?: string): CronWallClockFields {\n\tif (timezone === undefined) {\n\t\treturn {\n\t\t\tyear: date.getFullYear(),\n\t\t\tmonth: date.getMonth() + 1,\n\t\t\tday: date.getDate(),\n\t\t\thour: date.getHours(),\n\t\t\tminute: date.getMinutes(),\n\t\t\tdayOfWeek: date.getDay(),\n\t\t};\n\t}\n\tconst parts = timezoneFormatter(timezone).formatToParts(date);\n\tconst values: Record<string, number> = {};\n\tfor (const part of parts) {\n\t\tif (\n\t\t\tpart.type === \"year\" ||\n\t\t\tpart.type === \"month\" ||\n\t\t\tpart.type === \"day\" ||\n\t\t\tpart.type === \"hour\" ||\n\t\t\tpart.type === \"minute\"\n\t\t) {\n\t\t\tvalues[part.type] = Number.parseInt(part.value, 10);\n\t\t}\n\t}\n\tconst year = values.year;\n\tconst month = values.month;\n\tconst day = values.day;\n\tconst hour = values.hour;\n\tconst minute = values.minute;\n\tif (\n\t\tyear === undefined ||\n\t\tmonth === undefined ||\n\t\tday === undefined ||\n\t\thour === undefined ||\n\t\tminute === undefined\n\t) {\n\t\tthrow new Error(`fromCron: timezone projection failed for ${timezone}`);\n\t}\n\treturn {\n\t\tyear,\n\t\tmonth,\n\t\tday,\n\t\thour,\n\t\tminute,\n\t\tdayOfWeek: new Date(Date.UTC(year, month - 1, day)).getUTCDay(),\n\t};\n}\n\nconst TIMEZONE_FORMATTERS = new Map<string, Intl.DateTimeFormat>();\n\nfunction timezoneFormatter(timezone: string): Intl.DateTimeFormat {\n\tconst existing = TIMEZONE_FORMATTERS.get(timezone);\n\tif (existing !== undefined) return existing;\n\tassertNonEmptyString(timezone, \"fromCron: timezone\");\n\ttry {\n\t\tconst formatter = new Intl.DateTimeFormat(\"en-US-u-ca-gregory-nu-latn\", {\n\t\t\ttimeZone: timezone,\n\t\t\tyear: \"numeric\",\n\t\t\tmonth: \"2-digit\",\n\t\t\tday: \"2-digit\",\n\t\t\thour: \"2-digit\",\n\t\t\tminute: \"2-digit\",\n\t\t\thourCycle: \"h23\",\n\t\t});\n\t\tformatter.format(new Date(0));\n\t\tTIMEZONE_FORMATTERS.set(timezone, formatter);\n\t\treturn formatter;\n\t} catch (error) {\n\t\tthrow new RangeError(\n\t\t\t`fromCron: unsupported IANA timezone '${timezone}' (${error instanceof Error ? error.message : String(error)})`,\n\t\t);\n\t}\n}\n\nfunction dateToTimestampNs(date: Date): string {\n\treturn (BigInt(date.getTime()) * 1_000_000n).toString();\n}\n\nexport function fromCron(\n\texpr: string,\n\topts: FromCronOptions & { output: \"date\" },\n): Operator<never, Date>;\nexport function fromCron(\n\texpr: string,\n\topts: FromCronOptions & { output: \"timestamp_ms\" },\n): Operator<never, number>;\nexport function fromCron(\n\texpr: string,\n\topts?: FromCronOptions & { output?: \"timestamp_ns\" },\n): Operator<never, string>;\nexport function fromCron(\n\texpr: string,\n\topts?: FromCronOptions,\n): Operator<never, Date | number | string>;\nexport function fromCron(\n\texpr: string,\n\topts: FromCronOptions = {},\n): Operator<never, Date | number | string> {\n\tconst schedule = parseCron(expr);\n\tconst { tickMs = 60_000, output = \"timestamp_ns\", signal, timezone } = opts;\n\tif (opts.dst?.nonexistent !== undefined && opts.dst.nonexistent !== \"skip\") {\n\t\tthrow new RangeError(\"fromCron: dst.nonexistent currently supports only 'skip'\");\n\t}\n\tif (opts.dst?.repeated !== undefined && opts.dst.repeated !== \"once\") {\n\t\tthrow new RangeError(\"fromCron: dst.repeated currently supports only 'once'\");\n\t}\n\tif (timezone !== undefined) timezoneFormatter(timezone);\n\tif (!Number.isFinite(tickMs) || tickMs <= 0) {\n\t\tthrow new RangeError(\"fromCron: tickMs must be a positive finite number\");\n\t}\n\treturn source<Date | number | string>(\n\t\t\"fromCron\",\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tlet lastFiredKey: string | undefined;\n\t\t\tlet firedTimezoneDay: string | undefined;\n\t\t\tconst firedTimezoneMinutes = new Set<string>();\n\t\t\tlet intervalId: ReturnType<typeof setInterval> | undefined;\n\t\t\tconst cleanup = () => {\n\t\t\t\tdone = true;\n\t\t\t\tif (intervalId !== undefined) clearInterval(intervalId);\n\t\t\t\tintervalId = undefined;\n\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t};\n\t\t\tconst onAbort = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tcleanup();\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(signal?.reason)]]);\n\t\t\t};\n\t\t\tconst emitNow = (now: Date) => {\n\t\t\t\tif (output === \"date\") ctx.down([[\"DATA\", now]]);\n\t\t\t\telse if (output === \"timestamp_ms\") ctx.down([[\"DATA\", now.getTime()]]);\n\t\t\t\telse ctx.down([[\"DATA\", dateToTimestampNs(now)]]);\n\t\t\t};\n\t\t\tconst check = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tconst now = new Date();\n\t\t\t\tconst key = cronMinuteKey(now, timezone);\n\t\t\t\tconst alreadyFired =\n\t\t\t\t\ttimezone === undefined ? key === lastFiredKey : firedTimezoneMinutes.has(key);\n\t\t\t\tif (!alreadyFired && matchesCron(schedule, now, { timezone })) {\n\t\t\t\t\tlastFiredKey = key;\n\t\t\t\t\tif (timezone !== undefined) {\n\t\t\t\t\t\tconst dayKey = cronDayKey(now, timezone);\n\t\t\t\t\t\tif (dayKey !== firedTimezoneDay) {\n\t\t\t\t\t\t\tfiredTimezoneDay = dayKey;\n\t\t\t\t\t\t\tfiredTimezoneMinutes.clear();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfiredTimezoneMinutes.add(key);\n\t\t\t\t\t}\n\t\t\t\t\temitNow(now);\n\t\t\t\t}\n\t\t\t};\n\t\t\tif (signal?.aborted) {\n\t\t\t\tonAbort();\n\t\t\t\treturn cleanup;\n\t\t\t}\n\t\t\tsignal?.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tcheck();\n\t\t\tintervalId = setInterval(check, tickMs);\n\t\t\treturn cleanup;\n\t\t},\n\t\t{ pool: \"sync\", pausable: false },\n\t);\n}\n\nexport function runProcess(\n\tprogram: string,\n\targs: readonly string[] = [],\n): Operator<never, ProcessResult> {\n\treturn runProcessWithOptions({ program, args });\n}\n\nexport function fromProcess(\n\tprogram: string,\n\targs: readonly string[] = [],\n): Operator<never, ProcessResult> {\n\treturn processSource(\"fromProcess\", { program, args });\n}\n\nexport function runProcessWithOptions(command: ProcessCommand): Operator<never, ProcessResult> {\n\treturn processSource(\"runProcess\", command);\n}\n\nfunction processSource(factory: string, command: ProcessCommand): Operator<never, ProcessResult> {\n\tassertNonEmptyString(command.program, `${factory}: program`);\n\treturn driverOneShotSource<ProcessResult>(\n\t\tfactory,\n\t\t`${factory}: missing process driver`,\n\t\t(ctx, callback) => ctx.environment().processDriver()?.run(command, callback),\n\t);\n}\n\nexport function fromHttp(url: string): Operator<never, HttpResponse> {\n\treturn fromHttpWithOptions({ method: \"GET\", url });\n}\n\nexport function fromHttpWithOptions(request: HttpRequest): Operator<never, HttpResponse> {\n\tassertNonEmptyString(request.url, \"fromHttp: url\");\n\tassertNonEmptyString(request.method, \"fromHttp: method\");\n\treturn driverOneShotSource<HttpResponse>(\n\t\t\"fromHttp\",\n\t\t\"fromHttp: missing http driver\",\n\t\t(ctx, callback) => ctx.environment().httpDriver()?.request(request, callback),\n\t);\n}\n\nexport function fromSSE(url: string): Operator<never, SseEvent> {\n\treturn fromSSEWithOptions({ url });\n}\n\nexport function fromSSEWithOptions(request: SseRequest): Operator<never, SseEvent> {\n\tassertNonEmptyString(request.url, \"fromSSE: url\");\n\treturn driverStreamSource<SseEvent, SseDriverEvent>(\n\t\t\"fromSSE\",\n\t\t\"fromSSE: missing sse driver\",\n\t\t(ctx, callback) => ctx.environment().sseDriver()?.connect(request, callback),\n\t\t(event) => (event.kind === \"event\" ? event.event : undefined),\n\t\t(event) => (event.kind === \"error\" ? event.error : undefined),\n\t);\n}\n\nexport function fromWebSocket(url: string): Operator<never, WebSocketEvent> {\n\treturn fromWebSocketWithOptions({ url });\n}\n\nexport function fromWebSocketWithOptions(\n\trequest: WebSocketRequest,\n): Operator<never, WebSocketEvent> {\n\tassertNonEmptyString(request.url, \"fromWebSocket: url\");\n\treturn driverStreamSource<WebSocketEvent, WebSocketDriverEvent>(\n\t\t\"fromWebSocket\",\n\t\t\"fromWebSocket: missing websocket driver\",\n\t\t(ctx, callback) => ctx.environment().webSocketDriver()?.connect(request, callback),\n\t\t(event) => (event.kind === \"event\" ? event.event : undefined),\n\t\t(event) => (event.kind === \"error\" ? event.error : undefined),\n\t);\n}\n\nexport function fromWebhook(id: string): Operator<never, WebhookEvent> {\n\treturn fromWebhookWithOptions({ id });\n}\n\nexport function fromWebhookWithOptions(\n\tregistration: WebhookRegistration,\n): Operator<never, WebhookEvent> {\n\tassertNonEmptyString(registration.id, \"fromWebhook: id\");\n\treturn driverStreamSource<WebhookEvent, WebhookDriverEvent>(\n\t\t\"fromWebhook\",\n\t\t\"fromWebhook: missing webhook driver\",\n\t\t(ctx, callback) => ctx.environment().webhookDriver()?.register(registration, callback),\n\t\t(event) => (event.kind === \"event\" ? event.event : undefined),\n\t\t(event) => (event.kind === \"error\" ? event.error : undefined),\n\t);\n}\n\nfunction timerSource(factory: string, ms: number, opts?: TimerSourceOpts): Operator<never, number> {\n\tconst { period, signal } = opts ?? {};\n\tconst op = source<number>(\n\t\tfactory,\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tlet count = 0;\n\t\t\tlet t: ReturnType<typeof setTimeout> | undefined;\n\t\t\tlet iv: ReturnType<typeof setInterval> | undefined;\n\t\t\tconst cleanup = () => {\n\t\t\t\tdone = true;\n\t\t\t\tif (t !== undefined) clearTimeout(t);\n\t\t\t\tif (iv !== undefined) clearInterval(iv);\n\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t};\n\t\t\tconst onAbort = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tcleanup();\n\t\t\t\tctx.down([[\"ERROR\", errorPayload(signal?.reason)]]);\n\t\t\t};\n\t\t\tconst finish = () => {\n\t\t\t\tif (done) return;\n\t\t\t\tif (period != null) {\n\t\t\t\t\tctx.down([[\"DATA\", count++]]);\n\t\t\t\t\tiv = setInterval(() => {\n\t\t\t\t\t\tif (done) return;\n\t\t\t\t\t\tctx.down([[\"DATA\", count++]]);\n\t\t\t\t\t}, period);\n\t\t\t\t} else {\n\t\t\t\t\t// One-shot: DATA then COMPLETE in one wave (terminal-is-forever).\n\t\t\t\t\tdone = true;\n\t\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t\t\tctx.down([[\"DATA\", count++], [\"COMPLETE\"]]);\n\t\t\t\t}\n\t\t\t};\n\t\t\tif (signal?.aborted) {\n\t\t\t\tonAbort();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tsignal?.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tt = setTimeout(finish, ms);\n\t\t\treturn cleanup;\n\t\t},\n\t\t{ pool: \"sync\", pausable: false },\n\t);\n\tif (factory === \"timer\" && period === undefined && signal === undefined) {\n\t\treturn { ...op, restore: { ref: \"timer\", config: { ms: toCheckpointJson(ms, \"timer.ms\") } } };\n\t}\n\treturn op;\n}\n\n/**\n * Timer source: one-shot (first tick then COMPLETE) or periodic (`{period}` → 0, 1, 2, …).\n * sync pool + pausable:false (a timer keeps producing through PAUSE, R-pause-modes). Emits the\n * tick counter from 0; deactivation clears the timers.\n *\n * @param ms - Delay before the first tick in milliseconds.\n * @param opts - Optional period and source options.\n * @returns A source operator that emits tick counters.\n * @example\n * ```ts\n * import { graph, timer } from \"@graphrefly/ts\";\n *\n * const tick = graph().initNode(timer(100), []);\n * ```\n * @category sources\n */\nexport function timer(ms: number, opts?: TimerSourceOpts): Operator<never, number> {\n\treturn timerSource(\"timer\", ms, opts);\n}\n\n/**\n * Create a timer source with the legacy `fromTimer` factory name.\n *\n * @param ms - Delay before the first tick in milliseconds.\n * @param opts - Optional period and source options.\n * @returns A source operator that emits tick counters.\n * @example\n * ```ts\n * import { fromTimer, graph } from \"@graphrefly/ts\";\n *\n * const tick = graph().initNode(fromTimer(100), []);\n * ```\n * @remarks **Factory name:** This preserves the real `fromTimer` factory name in `describe()`.\n * @category sources\n */\nexport function fromTimer(ms: number, opts?: TimerSourceOpts): Operator<never, number> {\n\treturn timerSource(\"fromTimer\", ms, opts);\n}\n\n/**\n * Emit periodic tick counters.\n *\n * @param ms - Delay before the first tick and between later ticks in milliseconds.\n * @returns A source operator that emits `0`, `1`, `2`, and so on.\n * @example\n * ```ts\n * import { graph, interval } from \"@graphrefly/ts\";\n *\n * const ticks = graph().initNode(interval(1000), []);\n * ```\n * @category sources\n */\nexport function interval(ms: number): Operator<never, number> {\n\treturn timerSource(\"interval\", ms, { period: ms });\n}\n\n/**\n * Lift a Promise (or thenable) to a single-value stream: one DATA then COMPLETE, or ERROR on\n * rejection. async pool (default pausable → a paused source buffers its late emit). Optional\n * `signal` aborts to ERROR.\n *\n * @param p - Promise or thenable to lift into the graph.\n * @param opts - Optional abort signal and async source options.\n * @returns A source operator that emits one DATA value and COMPLETE, or ERROR on rejection/abort.\n * @example\n * ```ts\n * import { fromPromise, graph } from \"@graphrefly/ts\";\n *\n * const user = graph().initNode(fromPromise(fetch(\"/user\").then((res) => res.json())), []);\n * ```\n * @category sources\n */\nexport function fromPromise<T>(\n\tp: Promise<T> | PromiseLike<T>,\n\topts?: AsyncSourceOpts,\n): Operator<never, T> {\n\tconst signal = opts?.signal;\n\treturn source<T>(\n\t\t\"fromPromise\",\n\t\t(ctx) => {\n\t\t\tlet settled = false;\n\t\t\tconst onAbort = () => {\n\t\t\t\tif (settled) return;\n\t\t\t\tsettled = true;\n\t\t\t\t// onAbort only runs from a `signal` listener / the `signal.aborted` guard → signal is defined.\n\t\t\t\tctx.down([[\"ERROR\", errorPayload((signal as AbortSignal).reason)]]);\n\t\t\t};\n\t\t\tif (signal?.aborted) {\n\t\t\t\tonAbort();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tsignal?.addEventListener(\"abort\", onAbort, { once: true });\n\t\t\tvoid Promise.resolve(p).then(\n\t\t\t\t(v) => {\n\t\t\t\t\tif (settled) return;\n\t\t\t\t\tsettled = true;\n\t\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t\t\tctx.down([[\"DATA\", v], [\"COMPLETE\"]]);\n\t\t\t\t},\n\t\t\t\t(e) => {\n\t\t\t\t\tif (settled) return;\n\t\t\t\t\tsettled = true;\n\t\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\t},\n\t\t\t);\n\t\t\treturn () => {\n\t\t\t\tsettled = true;\n\t\t\t\tsignal?.removeEventListener(\"abort\", onAbort);\n\t\t\t};\n\t\t},\n\t\t{ pool: \"async\" },\n\t);\n}\n\n/**\n * Read an async iterable: each value → DATA; COMPLETE when done; ERROR on failure. async pool.\n * Optional `signal` aborts the pump.\n *\n * @param iterable - Async iterable to pump into the graph.\n * @param opts - Optional abort signal and async source options.\n * @returns A source operator that emits every iterable value and then COMPLETE.\n * @example\n * ```ts\n * import { fromAsyncIter, graph } from \"@graphrefly/ts\";\n *\n * const stream = graph().initNode(fromAsyncIter(events()), []);\n * ```\n * @category sources\n */\nexport function fromAsyncIter<T>(\n\titerable: AsyncIterable<T>,\n\topts?: AsyncSourceOpts,\n): Operator<never, T> {\n\tconst outerSignal = opts?.signal;\n\treturn source<T>(\n\t\t\"fromAsyncIter\",\n\t\t(ctx) => {\n\t\t\tconst ac = new AbortController();\n\t\t\tconst onOuterAbort = () => ac.abort(outerSignal?.reason);\n\t\t\touterSignal?.addEventListener(\"abort\", onOuterAbort, { once: true });\n\t\t\tlet done = false;\n\t\t\tconst pump = async () => {\n\t\t\t\ttry {\n\t\t\t\t\tfor await (const v of iterable) {\n\t\t\t\t\t\tif (ac.signal.aborted) break;\n\t\t\t\t\t\tctx.down([[\"DATA\", v]]);\n\t\t\t\t\t}\n\t\t\t\t\tif (!ac.signal.aborted) ctx.down([[\"COMPLETE\"]]);\n\t\t\t\t} catch (e) {\n\t\t\t\t\tif (!ac.signal.aborted) ctx.down([[\"ERROR\", errorPayload(e)]]);\n\t\t\t\t} finally {\n\t\t\t\t\tdone = true;\n\t\t\t\t}\n\t\t\t};\n\t\t\tvoid pump();\n\t\t\treturn () => {\n\t\t\t\tif (!done) ac.abort();\n\t\t\t\touterSignal?.removeEventListener(\"abort\", onOuterAbort);\n\t\t\t};\n\t\t},\n\t\t{ pool: \"async\" },\n\t);\n}\n\n/**\n * of: synchronous values — each argument as DATA, then COMPLETE. `of()` is the EMPTY source.\n *\n * @param values - Values to emit synchronously on activation.\n * @returns A source operator that emits each value and then COMPLETE.\n * @example\n * ```ts\n * import { graph, of } from \"@graphrefly/ts\";\n *\n * const values = graph().initNode(of(1, 2, 3), []);\n * ```\n * @category sources\n */\nexport function of<T = never>(...values: T[]): Operator<never, T> {\n\treturn source<T>(\n\t\t\"of\",\n\t\t(ctx) => {\n\t\t\tfor (const value of values) ctx.down([[\"DATA\", value]]);\n\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Emit every value from a synchronous iterable.\n *\n * @param iterable - Iterable whose values are emitted in order.\n * @returns A source operator that emits every iterable value and then COMPLETE.\n * @example\n * ```ts\n * import { fromIter, graph } from \"@graphrefly/ts\";\n *\n * const values = graph().initNode(fromIter([1, 2, 3]), []);\n * ```\n * @category sources\n */\nexport function fromIter<T>(iterable: Iterable<T>): Operator<never, T> {\n\treturn source<T>(\n\t\t\"fromIter\",\n\t\t(ctx) => {\n\t\t\tfor (const v of iterable) ctx.down([[\"DATA\", v]]);\n\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Complete immediately without emitting DATA.\n *\n * @returns A source operator that emits COMPLETE on activation.\n * @example\n * ```ts\n * import { empty, graph } from \"@graphrefly/ts\";\n *\n * const done = graph().initNode(empty(), []);\n * ```\n * @category sources\n */\nexport function empty<T = never>(): Operator<never, T> {\n\treturn source<T>(\n\t\t\"empty\",\n\t\t(ctx) => {\n\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Activate and remain silent until deactivation.\n *\n * @returns A source operator that never emits DATA or terminal messages by itself.\n * @example\n * ```ts\n * import { graph, never } from \"@graphrefly/ts\";\n *\n * const quiet = graph().initNode(never(), []);\n * ```\n * @category sources\n */\nexport function never<T = never>(): Operator<never, T> {\n\treturn source<T>(\"never\", () => undefined, { pool: \"sync\" });\n}\n\n/**\n * Terminate with ERROR on activation.\n *\n * @param err - Host-language error payload to normalize into a protocol ERROR payload.\n * @returns A source operator that emits ERROR.\n * @example\n * ```ts\n * import { graph, throwError } from \"@graphrefly/ts\";\n *\n * const failed = graph().initNode(throwError(new Error(\"boom\")), []);\n * ```\n * @category sources\n */\nexport function throwError(err: unknown): Operator<never, never> {\n\treturn source<never>(\n\t\t\"throwError\",\n\t\t(ctx) => {\n\t\t\tctx.down([[\"ERROR\", errorPayload(err)]]);\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Wrap a DOM-style event target. Each event becomes DATA; deactivation removes the listener.\n * External callbacks are source boundaries (D43), so no polling or operator-level async leaks in.\n *\n * @param target - Event target implementing `addEventListener` and `removeEventListener`.\n * @param type - Event type to subscribe to.\n * @param opts - Optional listener options and source options.\n * @returns A source operator that emits each event as DATA.\n * @example\n * ```ts\n * import { fromEvent, graph } from \"@graphrefly/ts\";\n *\n * const clicks = graph().initNode(fromEvent<MouseEvent>(button, \"click\"), []);\n * ```\n * @category sources\n */\nexport function fromEvent<T = unknown>(\n\ttarget: EventTargetLike,\n\ttype: string,\n\topts: FromEventOptions = {},\n): Operator<never, T> {\n\tif (target == null || typeof target.addEventListener !== \"function\") {\n\t\tthrow new TypeError(\"fromEvent: target must implement addEventListener\");\n\t}\n\tif (typeof target.removeEventListener !== \"function\") {\n\t\tthrow new TypeError(\"fromEvent: target must implement removeEventListener\");\n\t}\n\tif (typeof type !== \"string\" || type.length === 0) {\n\t\tthrow new TypeError(\"fromEvent: event type must be a non-empty string\");\n\t}\n\treturn source<T>(\n\t\t\"fromEvent\",\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tconst handler = (event: unknown) => {\n\t\t\t\tif (!done) ctx.down([[\"DATA\", event as T]]);\n\t\t\t};\n\t\t\ttarget.addEventListener(type, handler, opts);\n\t\t\treturn () => {\n\t\t\t\tdone = true;\n\t\t\t\ttarget.removeEventListener(type, handler, opts);\n\t\t\t};\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Wrap a host push transport. The host owns network/native setup; this factory owns reactive\n * delivery and teardown only, preserving async-at-source-boundary discipline.\n */\nexport function fromPushNotification<T = unknown>(register: PushRegister<T>): Operator<never, T> {\n\tif (typeof register !== \"function\") {\n\t\tthrow new TypeError(\"fromPushNotification: register must be a function\");\n\t}\n\treturn source<T>(\n\t\t\"fromPushNotification\",\n\t\t(ctx) => {\n\t\t\tlet done = false;\n\t\t\tconst deliver = (payload: T) => {\n\t\t\t\tif (!done) ctx.down([[\"DATA\", payload]]);\n\t\t\t};\n\t\t\tconst unsubscribe = register(deliver);\n\t\t\treturn () => {\n\t\t\t\tdone = true;\n\t\t\t\tif (typeof unsubscribe === \"function\") unsubscribe();\n\t\t\t};\n\t\t},\n\t\t{ pool: \"sync\" },\n\t);\n}\n\n/**\n * Coerce a {@link NodeInput}`<T>` to a `Node<T>` (D43 — coercion prerequisite for the CSP-2.7\n * higher-order operators). An existing Node passes through; a thenable → {@link fromPromise};\n * an async iterable → {@link fromAsyncIter}; with `{iter:true}` a sync iterable →\n * {@link fromIter}; everything else → {@link of}. Coerced nodes are bare (use\n * `opts.dispatcher` to bind one, default = process-global D26).\n */\nexport function fromAny<T>(\n\tinput: NodeInput<T>,\n\topts: NodeOptions<T> & { iter?: boolean } = {},\n): Node<T> {\n\tif (isNode(input)) return input as Node<T>;\n\tconst { iter, ...nodeOpts } = opts;\n\tif (isThenable(input)) {\n\t\treturn initNode(fromPromise(input as PromiseLike<T>), [], nodeOpts);\n\t}\n\tif (input !== null && input !== undefined) {\n\t\tconst candidate = input as {\n\t\t\t[Symbol.asyncIterator]?: unknown;\n\t\t\t[Symbol.iterator]?: unknown;\n\t\t};\n\t\tif (typeof candidate[Symbol.asyncIterator] === \"function\") {\n\t\t\treturn initNode(fromAsyncIter(input as AsyncIterable<T>), [], nodeOpts);\n\t\t}\n\t\tif (iter === true && typeof candidate[Symbol.iterator] === \"function\") {\n\t\t\treturn initNode(fromIter(input as Iterable<T>), [], nodeOpts);\n\t\t}\n\t}\n\treturn initNode(of(input as T), [], nodeOpts);\n}\n\n/**\n * Resolve the first DATA from a Node as a Promise. This is a host-boundary escape hatch, not a\n * graph operator; do not call it from reactive node bodies. ERROR rejects, and COMPLETE before DATA\n * rejects because no value exists.\n */\nexport function firstValueFrom<T>(source: Node<T>): Promise<T> {\n\treturn new Promise<T>((resolve, reject) => {\n\t\tlet settled = false;\n\t\tlet shouldUnsub = false;\n\t\tlet unsub: (() => void) | undefined;\n\t\tconst finish = (f: () => void): void => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tf();\n\t\t\tif (unsub) {\n\t\t\t\tunsub();\n\t\t\t\tunsub = undefined;\n\t\t\t} else {\n\t\t\t\tshouldUnsub = true;\n\t\t\t}\n\t\t};\n\t\tunsub = source.subscribe((msg) => {\n\t\t\tif (msg[0] === \"DATA\") {\n\t\t\t\tfinish(() => resolve(msg[1] as T));\n\t\t\t} else if (msg[0] === \"ERROR\") {\n\t\t\t\tfinish(() => reject(msg[1]));\n\t\t\t} else if (msg[0] === \"COMPLETE\") {\n\t\t\t\tfinish(() => reject(new Error(\"firstValueFrom: completed without DATA\")));\n\t\t\t} else if (msg[0] === \"TEARDOWN\") {\n\t\t\t\tfinish(() => reject(new Error(\"firstValueFrom: torn down without DATA\")));\n\t\t\t}\n\t\t});\n\t\tif (shouldUnsub) {\n\t\t\tunsub?.();\n\t\t\tunsub = undefined;\n\t\t}\n\t});\n}\n\nfunction singleFromAnyValue<T>(value: T): T {\n\tif (value === undefined) {\n\t\tthrow new TypeError(\"singleFromAny: undefined is the substrate SENTINEL\");\n\t}\n\treturn value;\n}\n\nasync function firstFromAsyncIterable<T>(input: AsyncIterable<T>): Promise<T> {\n\tconst iter = input[Symbol.asyncIterator]();\n\tconst { value, done } = await iter.next();\n\tif (done) {\n\t\tawait iter.return?.();\n\t\tthrow new Error(\"singleFromAny: factory returned empty async iterable\");\n\t}\n\ttry {\n\t\tawait iter.return?.();\n\t} catch {\n\t\t// The first value is the bridge result; close failures after that are cleanup-only.\n\t}\n\treturn value as T;\n}\n\nfunction firstFromIterable<T>(input: Iterable<T>): Promise<T> {\n\tconst iter = input[Symbol.iterator]();\n\tconst { value, done } = iter.next();\n\tif (done) {\n\t\titer.return?.();\n\t\treturn Promise.reject(new Error(\"singleFromAny: factory returned empty iterable\"));\n\t}\n\ttry {\n\t\titer.return?.();\n\t} catch {\n\t\t// The first value is the bridge result; close failures after that are cleanup-only.\n\t}\n\treturn Promise.resolve(value as T);\n}\n\nfunction nodeInputToPromise<T>(input: NodeInput<T>, opts: { iter?: boolean }): Promise<T> {\n\tif (isThenable(input)) return Promise.resolve(input as PromiseLike<T>).then(singleFromAnyValue);\n\tif (isNode(input)) return firstValueFrom(input as Node<T>).then(singleFromAnyValue);\n\tif (isAsyncIterable<T>(input)) return firstFromAsyncIterable(input).then(singleFromAnyValue);\n\tif (opts.iter === true && isIterable<T>(input)) {\n\t\treturn firstFromIterable(input).then(singleFromAnyValue);\n\t}\n\tif (input === undefined) {\n\t\treturn Promise.reject(new TypeError(\"singleFromAny: undefined is the substrate SENTINEL\"));\n\t}\n\treturn Promise.resolve(singleFromAnyValue(input as T));\n}\n\n/**\n * Keyed singleflight over {@link NodeInput}. Concurrent calls with the same key share one Promise;\n * once that input resolves/rejects, the in-flight entry is cleared and a later call re-runs the\n * factory. Host-boundary helper only; it does not create graph topology.\n */\nexport function singleFromAny<K, T>(\n\tfactory: (key: K) => NodeInput<T>,\n\topts: SingleFromAnyOptions<K> = {},\n): (key: K) => Promise<T> {\n\tconst keyOf = opts.keyOf ?? ((key: K): unknown => key);\n\tconst inFlight = new Map<unknown, Promise<T>>();\n\n\treturn (key: K): Promise<T> => {\n\t\tconst dedupeKey = keyOf(key);\n\t\tconst existing = inFlight.get(dedupeKey);\n\t\tif (existing) return existing;\n\n\t\tlet resolvePending!: (value: T) => void;\n\t\tlet rejectPending!: (reason: unknown) => void;\n\t\tlet tracked!: Promise<T>;\n\t\tconst cleanup = (): void => {\n\t\t\tif (inFlight.get(dedupeKey) === tracked) inFlight.delete(dedupeKey);\n\t\t};\n\t\tconst pending = new Promise<T>((resolve, reject) => {\n\t\t\tresolvePending = resolve;\n\t\t\trejectPending = reject;\n\t\t});\n\t\ttracked = pending.then(\n\t\t\t(value) => {\n\t\t\t\tcleanup();\n\t\t\t\treturn value;\n\t\t\t},\n\t\t\t(error) => {\n\t\t\t\tcleanup();\n\t\t\t\tthrow error;\n\t\t\t},\n\t\t);\n\t\tinFlight.set(dedupeKey, tracked);\n\t\ttry {\n\t\t\tnodeInputToPromise(factory(key), opts).then(resolvePending, rejectPending);\n\t\t} catch (e) {\n\t\t\trejectPending(e);\n\t\t}\n\t\treturn tracked;\n\t};\n}\n","/**\n * Reactive key–value map (CSP-2.8, D54/D60/D68) — two-port collection with policy opts.\n *\n * Shape = the shared {@link collectionCore} two ports over a `Map` BACKEND (D60). Specializations\n * (D60 #3 / review #3):\n *   - TTL/LRU are node-as-opt policies (D68). Static `maxSize` / `defaultTtl` values become constant\n *     policy deps; Node-valued opts are declared deps. The graph-visible `reactiveMap.apply` node is\n *     the normal backend mutation path and emits the public delta payloads it materializes.\n *   - LAZY TTL (no background timer): expiry is checked at read (`get`/`has`) + at synchronous\n *     snapshot materialization (`toMap`/`pruneExpired`). A read/prune that deletes an expired key\n *     emits the normal delta `delete{reason:\"expired\"}` (D61). Snapshot demand uses an internal pull\n *     `snapshotPrep` node: it prunes expired entries and reads the backend once, then public\n *     `snapshot` and `delta` derive from that declared prep payload. No snapshot fn drives its own\n *     dep (D37).\n *   - delete-reason enum {expired|lru-evict|archived|explicit} on the delta (D60 #3c).\n *   - LRU `maxSize`: an over-cap `set` evicts the oldest, emitting a `delete{reason:\"lru-evict\"}`.\n *     A live-key `get`/`has` touches LRU order WITHOUT a version bump (internal, D60 #3d).\n *   - retention (score-archive, D72): `retention.maxSize` is a value-or-Node numeric policy and\n *     the static scorer selects archive victims through the normal `reactiveMap.apply` path.\n *\n * Per-language (D6/D24, never in parity, no conformance — the substrate pull is already C-16).\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepCount,\n\tdepTerminal,\n\tisTerminalComplete,\n\ttype NodeFn,\n} from \"../../ctx/types.js\";\nimport { strictCanonicalJsonBytes } from \"../../json/codec.js\";\nimport { Node } from \"../../node/node.js\";\nimport { errorPayload } from \"../../protocol/messages.js\";\nimport { registerBackendStateContributor } from \"../checkpoint.js\";\nimport { initNode, type Operator } from \"../operators.js\";\nimport {\n\tdeadlines,\n\tlruKeys,\n\tPolicyInputs,\n\ttype PolicyOpt,\n\ttype ScoredEntry,\n\tselectRetentionVictims,\n\ttrimHeadOverflow,\n} from \"../policies/collection.js\";\nimport type { ReactiveOpt, RetentionPolicy, ViewCachePolicy } from \"../policies/types.js\";\nimport { timer } from \"../sources.js\";\nimport type { MapChange } from \"./change.js\";\nimport {\n\ttype CollectionCoreOptions,\n\tlightReactiveView,\n\ttype ReactiveView,\n\tViewMemoCache,\n} from \"./core.js\";\n\nexport type ReactiveMapOpt<T> = ReactiveOpt<T>;\n\nexport interface ReactiveMapRetentionEntry<K, V> {\n\treadonly key: K;\n\treadonly value: V;\n}\n\nexport interface ReactiveMapRetentionPolicy<K, V>\n\textends RetentionPolicy<ReactiveMapRetentionEntry<K, V>> {\n\t/** Archive capacity. Unlike LRU, zero is allowed and archives every live entry. */\n\treadonly maxSize?: ReactiveMapOpt<number>;\n\t/** Higher scores are retained; lowest finite scores are archived first. */\n\tscore(entry: ReactiveMapRetentionEntry<K, V>): number;\n}\n\ninterface ResolvedRetentionPolicy<K, V> {\n\treadonly maxSize?: number;\n\tscore(entry: ReactiveMapRetentionEntry<K, V>): number;\n}\n\nexport interface ReactiveMapOptions<K = unknown, V = unknown> extends CollectionCoreOptions {\n\t/**\n\t * LRU cap as a node-as-opt policy (D68). A static number is a constant policy config; a Node must\n\t * be graph-bound and becomes a declared dep of `reactiveMap.apply`.\n\t */\n\tmaxSize?: ReactiveMapOpt<number>;\n\t/**\n\t * Default TTL in milliseconds as a node-as-opt policy (D68). Per-call `set(...,{ttl})` overrides.\n\t * Lazy expiry only; no active timer in this cut.\n\t */\n\tdefaultTtl?: ReactiveMapOpt<number>;\n\t/**\n\t * Score-based retention/archive policy (D72). The scorer is static local code; only maxSize can be\n\t * a Node-valued policy, keeping graph describe data serializable while apply owns the mutation.\n\t */\n\tretention?: ReactiveMapRetentionPolicy<K, V>;\n\t/** Static D80 memo policy for D121 light views. Eviction does not dispose returned views. */\n\tviewCache?: ViewCachePolicy;\n\t/** Injectable monotonic-ish clock for TTL (default `Date.now`). Graph-local clock = follow-up (D26). */\n\tnow?: () => number;\n}\n\nexport interface ReactiveMap<K, V> {\n\treadonly delta: Node<MapChange<K, V>>;\n\treadonly snapshot: Node<ReadonlyMap<K, V>>;\n\treadonly pullId: symbol;\n\t/** Raw entry count (O(1)); may include not-yet-pruned expired entries. Sync non-reactive read. */\n\treadonly size: number;\n\t/** Get a live value (prunes the key if expired). Sync read. */\n\tget(key: K): V | undefined;\n\t/** Live-key existence (prunes if expired). Sync read. */\n\thas(key: K): boolean;\n\t/** Current live (non-expired) entries (fresh copy). Sync non-reactive read (cold-start peek). */\n\ttoMap(): ReadonlyMap<K, V>;\n\t/**\n\t * D121 light selected-map view. `delta` forwards parent map mutations, and `snapshot` is a pull\n\t * node that materializes the currently matching live entries on demand.\n\t */\n\tselect(\n\t\tpredicate: (value: V, key: K) => boolean,\n\t): ReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>;\n\tset(key: K, value: V, opts?: { ttl?: number }): void;\n\t/** Bulk set; one delta event per entry, one snapshot-arm. No-op if empty. */\n\tsetMany(entries: Iterable<readonly [K, V]>, opts?: { ttl?: number }): void;\n\tdelete(key: K): void;\n\t/** Bulk delete; one delta per removed key. No-op if none present. */\n\tdeleteMany(keys: Iterable<K>): void;\n\tclear(): void;\n\t/** Explicitly prune expired entries; every removed key emits `delete{reason:\"expired\"}` (D61). */\n\tpruneExpired(): void;\n\t/** D54 widening: every `[key, value]` from `src` is set. Returns a disposer. */\n\tsetFrom(src: Node<readonly [K, V]>): () => void;\n\tdispose(): void;\n}\n\ninterface Entry<V> {\n\tvalue: V;\n\texpiresAt?: number;\n}\n\nfunction strictJsonIdentity(value: unknown): string {\n\treturn Array.from(strictCanonicalJsonBytes(value)).join(\",\");\n}\n\ntype Lookup<V> =\n\t| { found: true; value: V }\n\t| { found: false; expired?: false }\n\t| { found: false; expired: true; previous: V };\n\ninterface SnapshotPrep<K, V> {\n\treadonly snapshot: ReadonlyMap<K, V>;\n\treadonly expired: readonly MapChange<K, V>[];\n}\n\ntype MapIntent<K, V> =\n\t| { kind: \"set\"; key: K; value: V; ttl?: number }\n\t| { kind: \"delete\"; key: K }\n\t| { kind: \"clear\" }\n\t| { kind: \"pruneExpired\" }\n\t| { kind: \"pruneKey\"; key: K };\n\n/** Default `Map`-backed store. TTL/LRU policy lives in graph-visible policy/apply nodes (D68). */\nclass MapBackend<K, V> {\n\tprivate _version = 0;\n\tprivate readonly store = new Map<K, Entry<V>>();\n\tprivate readonly now: () => number;\n\n\tconstructor(opts: { now?: () => number }) {\n\t\tthis.now = opts.now ?? Date.now;\n\t}\n\n\tget version(): number {\n\t\treturn this._version;\n\t}\n\n\tget size(): number {\n\t\treturn this.store.size;\n\t}\n\n\tnowMs(): number {\n\t\treturn this.now();\n\t}\n\n\texpiresAtOf(key: K): number | undefined {\n\t\treturn this.store.get(key)?.expiresAt;\n\t}\n\n\tprivate isExpired(e: Entry<V>): boolean {\n\t\treturn e.expiresAt !== undefined && this.now() >= e.expiresAt;\n\t}\n\n\tresolveExpiresAt(ttl?: number): number | undefined {\n\t\tif (ttl === undefined) return undefined;\n\t\tif (!Number.isFinite(ttl) || ttl <= 0)\n\t\t\tthrow new RangeError(`reactiveMap: ttl must be a positive finite number (got ${ttl})`);\n\t\treturn this.now() + ttl;\n\t}\n\n\tprivate deleteExpired(key: K, e: Entry<V>): Array<[K, V]> {\n\t\tthis.store.delete(key);\n\t\tthis._version += 1;\n\t\treturn [[key, e.value]];\n\t}\n\n\t/** Read without materializing expiry. Caller routes expired deletes through the apply node (D68). */\n\tlookup(key: K): Lookup<V> {\n\t\tconst e = this.store.get(key);\n\t\tif (e === undefined) return { found: false };\n\t\tif (this.isExpired(e)) return { found: false, expired: true, previous: e.value };\n\t\t// LRU touch (no version bump — internal, D60 #3d).\n\t\tthis.store.delete(key);\n\t\tthis.store.set(key, e);\n\t\treturn { found: true, value: e.value };\n\t}\n\n\t/** Set; returns the entries evicted by LRU overflow (the caller emits their delete deltas). */\n\tset(key: K, value: V, expiresAt?: number): void {\n\t\tif (this.store.has(key)) this.store.delete(key); // re-insert at LRU end\n\t\tthis.store.set(key, { value, expiresAt });\n\t\tthis._version += 1;\n\t}\n\n\tenforceLru(maxSize?: number): Array<[K, V]> {\n\t\tconst evicted: Array<[K, V]> = [];\n\t\tfor (const oldest of trimHeadOverflow(lruKeys(this.store.keys()).keys(), {\n\t\t\tmaxSize,\n\t\t\tsize: this.store.size,\n\t\t})) {\n\t\t\tconst e = this.store.get(oldest);\n\t\t\tif (e !== undefined) evicted.push([oldest, e.value]);\n\t\t\tthis.store.delete(oldest);\n\t\t}\n\t\tif (evicted.length > 0) this._version += 1;\n\t\treturn evicted;\n\t}\n\n\tenforceRetention(policy?: ResolvedRetentionPolicy<K, V>): Array<[K, V]> {\n\t\tif (policy === undefined || policy.maxSize === undefined) return [];\n\t\tconst scored: ScoredEntry<readonly [K, V]>[] = [];\n\t\tfor (const [key, entry] of this.store) {\n\t\t\tif (!this.isExpired(entry)) {\n\t\t\t\tscored.push({\n\t\t\t\t\tentry: [key, entry.value] as const,\n\t\t\t\t\tscore: policy.score({ key, value: entry.value }),\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\tconst archived = selectRetentionVictims(scored, { maxSize: policy.maxSize });\n\t\tfor (const [key] of archived) this.store.delete(key);\n\t\tif (archived.length > 0) this._version += 1;\n\t\treturn archived.map(([key, value]) => [key, value]);\n\t}\n\n\tdelete(key: K): Lookup<V> {\n\t\tconst e = this.store.get(key);\n\t\tif (e === undefined) return { found: false };\n\t\tthis.store.delete(key);\n\t\tthis._version += 1;\n\t\treturn { found: true, value: e.value };\n\t}\n\n\tclear(): number {\n\t\tconst n = this.store.size;\n\t\tif (n === 0) return 0;\n\t\tthis.store.clear();\n\t\tthis._version += 1;\n\t\treturn n;\n\t}\n\n\tpruneExpired(): Array<[K, V]> {\n\t\tconst removed: Array<[K, V]> = [];\n\t\tfor (const [k, e] of this.store) {\n\t\t\tif (this.isExpired(e)) {\n\t\t\t\tthis.store.delete(k);\n\t\t\t\tremoved.push([k, e.value]);\n\t\t\t}\n\t\t}\n\t\tif (removed.length > 0) this._version += 1;\n\t\treturn removed;\n\t}\n\n\tpruneKeyIfExpired(key: K): Array<[K, V]> {\n\t\tconst e = this.store.get(key);\n\t\tif (e === undefined || !this.isExpired(e)) return [];\n\t\treturn this.deleteExpired(key, e);\n\t}\n\n\t/** Fresh snapshot of live entries. Does not prune; callers choose whether to materialize expiry. */\n\tsnapshot(): ReadonlyMap<K, V> {\n\t\tconst out = new Map<K, V>();\n\t\tfor (const [k, e] of this.store) if (!this.isExpired(e)) out.set(k, e.value);\n\t\treturn out;\n\t}\n\n\t/** D160 checkpoint payload: exact restorable map entries, excluding TTL-bearing state. */\n\tcheckpointEntries(): readonly (readonly [K, V])[] {\n\t\tconst out: Array<readonly [K, V]> = [];\n\t\tconst seen = new Set<string>();\n\t\tfor (const [key, entry] of this.store) {\n\t\t\tif (entry.expiresAt !== undefined) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t\"reactiveMap checkpoint backendState cannot preserve per-entry TTL; persist the map externally or clear TTL state before graph checkpoint (D160)\",\n\t\t\t\t);\n\t\t\t}\n\t\t\tconst stableKey = strictJsonIdentity(key);\n\t\t\tif (seen.has(stableKey)) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t\"reactiveMap checkpoint backendState contains duplicate strict-JSON keys (D160)\",\n\t\t\t\t);\n\t\t\t}\n\t\t\tseen.add(stableKey);\n\t\t\tout.push([key, entry.value] as const);\n\t\t}\n\t\treturn out;\n\t}\n}\n\n/**\n * Create a reactive map (D54/D60). DELTA stream of {@link MapChange} + lazy pull SNAPSHOT (a\n * `ReadonlyMap`) + pullId via {@link collectionCore}; this layer adds the typed map surface.\n */\nexport function reactiveMap<K, V>(options: ReactiveMapOptions<K, V> = {}): ReactiveMap<K, V> {\n\treturn createReactiveMap(options);\n}\n\n/** @internal D161 restore path: seed the backend without replaying public deltas. */\nexport function restoreReactiveMapFromBackendState<K, V>(\n\tinitialEntries: readonly (readonly [K, V])[],\n\toptions: ReactiveMapOptions<K, V> = {},\n): ReactiveMap<K, V> {\n\treturn createReactiveMap(options, initialEntries);\n}\n\nfunction createReactiveMap<K, V>(\n\toptions: ReactiveMapOptions<K, V> = {},\n\tinitialEntries: readonly (readonly [K, V])[] = [],\n): ReactiveMap<K, V> {\n\tconst { maxSize, defaultTtl, retention, viewCache, now, name, dispatcher, graph } = options;\n\tconst backend = new MapBackend<K, V>({ now });\n\tfor (const [key, value] of initialEntries) backend.set(key, value);\n\tconst base = dispatcher ? { dispatcher } : {};\n\tconst restorable =\n\t\tgraph !== undefined &&\n\t\tname !== undefined &&\n\t\tmaxSize === undefined &&\n\t\tdefaultTtl === undefined &&\n\t\tretention === undefined;\n\n\tfunction isNodeOpt<T>(x: PolicyOpt<T> | undefined): x is Node<T> {\n\t\treturn x instanceof Node;\n\t}\n\n\tfunction validateMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 1)\n\t\t\tthrow new RangeError(`reactiveMap: maxSize must be a positive integer (got ${v})`);\n\t\treturn v;\n\t}\n\n\tfunction validateTtl(v: number): number {\n\t\tif (!Number.isFinite(v) || v <= 0)\n\t\t\tthrow new RangeError(`reactiveMap: defaultTtl must be a positive finite number (got ${v})`);\n\t\treturn v;\n\t}\n\n\tfunction validateRetentionMaxSize(v: number): number {\n\t\tif (!Number.isFinite(v) || !Number.isInteger(v) || v < 0)\n\t\t\tthrow new RangeError(\n\t\t\t\t`reactiveMap: retention.maxSize must be a non-negative integer (got ${v})`,\n\t\t\t);\n\t\treturn v;\n\t}\n\n\tif (retention !== undefined && typeof retention.score !== \"function\")\n\t\tthrow new TypeError(\"reactiveMap: retention.score must be a function\");\n\n\ttype PolicyLabel = \"lruPolicy\" | \"ttlPolicy\" | \"retentionPolicy\";\n\n\tfunction constPolicyNode(label: PolicyLabel, value: number): Node<number> {\n\t\tconst op: Operator<never, number> = {\n\t\t\tfactory: `reactiveMap.${label}`,\n\t\t\tbody: () => {},\n\t\t\topts: { initial: value },\n\t\t};\n\t\tif (graph) {\n\t\t\treturn graph.initNode(op, [], {\n\t\t\t\tname: name ? `${name}.${label}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_policy\", collection: \"reactiveMap\", policy: label },\n\t\t\t});\n\t\t}\n\t\treturn new Node<number>([], null, {\n\t\t\t...base,\n\t\t\tinitial: value,\n\t\t\tfactory: `reactiveMap.${label}`,\n\t\t\tname: name ? `${name}.${label}` : undefined,\n\t\t});\n\t}\n\n\tfunction policyNode(\n\t\tlabel: PolicyLabel,\n\t\topt: PolicyOpt<number> | undefined,\n\t\tvalidate: (v: number) => number,\n\t): Node<number> | undefined {\n\t\tif (opt === undefined) return undefined;\n\t\tif (isNodeOpt(opt)) {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t`reactiveMap ${label} Node option requires options.graph so the policy edge is describe-visible (${label === \"retentionPolicy\" ? \"D72\" : \"D68\"})`,\n\t\t\t\t);\n\t\t\treturn opt;\n\t\t}\n\t\treturn constPolicyNode(label, validate(opt));\n\t}\n\n\tconst intentOp: Operator<never, MapIntent<K, V>> = {\n\t\tfactory: \"reactiveMap.intent\",\n\t\tbody: () => {},\n\t};\n\tconst intent = graph\n\t\t? graph.initNode(intentOp, [], {\n\t\t\t\tname: name ? `${name}.intent` : undefined,\n\t\t\t\tmeta: { kind: \"collection_intent\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.intent\" } } : {}),\n\t\t\t})\n\t\t: new Node<MapIntent<K, V>>([], null, {\n\t\t\t\t...base,\n\t\t\t\tfactory: \"reactiveMap.intent\",\n\t\t\t\tname: name ? `${name}.intent` : undefined,\n\t\t\t});\n\tconst lruPolicy = policyNode(\"lruPolicy\", maxSize, validateMaxSize);\n\tconst ttlPolicy = policyNode(\"ttlPolicy\", defaultTtl, validateTtl);\n\tconst retentionPolicy = policyNode(\n\t\t\"retentionPolicy\",\n\t\tretention?.maxSize,\n\t\tvalidateRetentionMaxSize,\n\t);\n\n\tlet currentMaxSize = isNodeOpt(maxSize) ? undefined : maxSize;\n\tlet currentDefaultTtl = isNodeOpt(defaultTtl) ? undefined : defaultTtl;\n\tlet currentRetentionMaxSize = isNodeOpt(retention?.maxSize)\n\t\t? undefined\n\t\t: retention?.maxSize === undefined\n\t\t\t? undefined\n\t\t\t: validateRetentionMaxSize(retention.maxSize);\n\tconst ttlHeap = deadlines<K>();\n\tlet ttlTimer: Node<unknown> | null = null;\n\tlet ttlTimerDue: number | undefined;\n\tconst bindDeps = new WeakSet<Node<unknown>>();\n\tlet bindSeq = 0;\n\tlet apply: Node<MapChange<K, V>>;\n\tconst selectMemo = new ViewMemoCache<\n\t\t(value: V, key: K) => boolean,\n\t\tReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>\n\t>(viewCache);\n\tlet selectSeq = 0;\n\n\tconst policyInputs = new PolicyInputs([intent as Node<unknown>]);\n\tconst lruReader = policyInputs.add(lruPolicy);\n\tconst ttlReader = policyInputs.add(ttlPolicy);\n\tconst retentionReader = policyInputs.add(retentionPolicy);\n\n\tfunction emitExpired(ctx: Ctx, entries: Array<[K, V]>): void {\n\t\tfor (const [key, previous] of entries)\n\t\t\tctx.down([[\"DATA\", { kind: \"delete\", key, previous, reason: \"expired\" }]]);\n\t}\n\n\tfunction emitLruEvicted(ctx: Ctx, entries: Array<[K, V]>): void {\n\t\tfor (const [key, previous] of entries)\n\t\t\tctx.down([[\"DATA\", { kind: \"delete\", key, previous, reason: \"lru-evict\" }]]);\n\t}\n\n\tfunction emitArchived(ctx: Ctx, entries: Array<[K, V]>): void {\n\t\tfor (const [key, previous] of entries)\n\t\t\tctx.down([[\"DATA\", { kind: \"delete\", key, previous, reason: \"archived\" }]]);\n\t}\n\n\tfunction nextValidExpiry(): { readonly key: K; readonly expiresAt: number } | undefined {\n\t\tfor (;;) {\n\t\t\tconst top = ttlHeap.peek();\n\t\t\tif (top === undefined) return undefined;\n\t\t\tif (backend.expiresAtOf(top.key) === top.expiresAt) return top;\n\t\t\tttlHeap.pop();\n\t\t}\n\t}\n\n\tfunction scheduleTtl(ctx: Ctx, body: NodeFn): void {\n\t\tfor (;;) {\n\t\t\tconst next = nextValidExpiry();\n\t\t\tif (next === undefined) {\n\t\t\t\tif (ttlTimer) ctx.rewireNext.unsubscribeDep(ttlTimer, body);\n\t\t\t\tttlTimer = null;\n\t\t\t\tttlTimerDue = undefined;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (next.expiresAt <= backend.nowMs()) {\n\t\t\t\temitExpired(ctx, backend.pruneExpired());\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (ttlTimerDue === next.expiresAt) return;\n\t\t\tif (ttlTimer) ctx.rewireNext.unsubscribeDep(ttlTimer, body);\n\t\t\tttlTimerDue = next.expiresAt;\n\t\t\tttlTimer = initNode(timer(Math.max(0, next.expiresAt - backend.nowMs())), [], base);\n\t\t\tctx.rewireNext.subscribeDep(ttlTimer, body);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tfunction applyIntent(ctx: Ctx, intentValue: MapIntent<K, V>): void {\n\t\tif (intentValue.kind === \"set\") {\n\t\t\tconst ttl = intentValue.ttl ?? currentDefaultTtl;\n\t\t\tconst expiresAt = backend.resolveExpiresAt(ttl);\n\t\t\tbackend.set(intentValue.key, intentValue.value, expiresAt);\n\t\t\tif (expiresAt !== undefined) ttlHeap.push({ key: intentValue.key, expiresAt });\n\t\t\tctx.down([[\"DATA\", { kind: \"set\", key: intentValue.key, value: intentValue.value }]]);\n\t\t\temitLruEvicted(ctx, backend.enforceLru(currentMaxSize));\n\t\t\temitArchived(\n\t\t\t\tctx,\n\t\t\t\tbackend.enforceRetention(\n\t\t\t\t\tretention ? { maxSize: currentRetentionMaxSize, score: retention.score } : undefined,\n\t\t\t\t),\n\t\t\t);\n\t\t\treturn;\n\t\t}\n\t\tif (intentValue.kind === \"delete\") {\n\t\t\tconst previous = backend.delete(intentValue.key);\n\t\t\tif (previous.found)\n\t\t\t\tctx.down([\n\t\t\t\t\t[\n\t\t\t\t\t\t\"DATA\",\n\t\t\t\t\t\t{ kind: \"delete\", key: intentValue.key, previous: previous.value, reason: \"explicit\" },\n\t\t\t\t\t],\n\t\t\t\t]);\n\t\t\treturn;\n\t\t}\n\t\tif (intentValue.kind === \"clear\") {\n\t\t\tconst count = backend.clear();\n\t\t\tif (count > 0) ctx.down([[\"DATA\", { kind: \"clear\", count }]]);\n\t\t\treturn;\n\t\t}\n\t\tif (intentValue.kind === \"pruneExpired\") {\n\t\t\temitExpired(ctx, backend.pruneExpired());\n\t\t\treturn;\n\t\t}\n\t\temitExpired(ctx, backend.pruneKeyIfExpired(intentValue.key));\n\t}\n\n\tconst applyBody: NodeFn = (ctx: Ctx) => {\n\t\tconst nextMaxSize = lruReader.read(ctx, currentMaxSize);\n\t\tcurrentMaxSize = nextMaxSize === undefined ? undefined : validateMaxSize(nextMaxSize);\n\t\tconst nextTtl = ttlReader.read(ctx, currentDefaultTtl);\n\t\tcurrentDefaultTtl = nextTtl === undefined ? undefined : validateTtl(nextTtl);\n\t\tconst nextRetentionMaxSize = retentionReader.read(ctx, currentRetentionMaxSize);\n\t\tcurrentRetentionMaxSize =\n\t\t\tnextRetentionMaxSize === undefined\n\t\t\t\t? undefined\n\t\t\t\t: validateRetentionMaxSize(nextRetentionMaxSize);\n\n\t\tfor (const item of (depBatch(ctx, 0) ?? []) as readonly MapIntent<K, V>[]) {\n\t\t\tapplyIntent(ctx, item);\n\t\t}\n\t\tconst deps = apply.deps;\n\t\tfor (let i = 1; i < depCount(ctx); i++) {\n\t\t\tif (i === lruReader.index || i === ttlReader.index || i === retentionReader.index) continue;\n\t\t\tconst dep = deps[i];\n\t\t\tif (dep && bindDeps.has(dep)) {\n\t\t\t\tfor (const item of (depBatch(ctx, i) ?? []) as readonly MapIntent<K, V>[]) {\n\t\t\t\t\tapplyIntent(ctx, item);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (\n\t\t\t\tdep === ttlTimer &&\n\t\t\t\t((depBatch(ctx, i)?.length ?? 0) > 0 || isTerminalComplete(depTerminal(ctx, i)))\n\t\t\t) {\n\t\t\t\tif (ttlTimer) ctx.rewireNext.unsubscribeDep(ttlTimer, applyBody);\n\t\t\t\tttlTimer = null;\n\t\t\t\tttlTimerDue = undefined;\n\t\t\t\temitExpired(ctx, backend.pruneExpired());\n\t\t\t}\n\t\t}\n\t\t// Lowering a reactive maxSize is itself a policy-driven backend mutation (D68).\n\t\temitLruEvicted(ctx, backend.enforceLru(currentMaxSize));\n\t\temitArchived(\n\t\t\tctx,\n\t\t\tbackend.enforceRetention(\n\t\t\t\tretention ? { maxSize: currentRetentionMaxSize, score: retention.score } : undefined,\n\t\t\t),\n\t\t);\n\t\tscheduleTtl(ctx, applyBody);\n\t};\n\n\tconst applyOp: Operator<unknown, MapChange<K, V>> = {\n\t\tfactory: \"reactiveMap.apply\",\n\t\tbody: applyBody,\n\t\topts: { partial: true },\n\t};\n\tapply = graph\n\t\t? graph.initNode(applyOp, policyInputs.deps as readonly Node<unknown>[], {\n\t\t\t\tname: name ? `${name}.apply` : undefined,\n\t\t\t\tmeta: { kind: \"collection_policy_apply\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.apply\" } } : {}),\n\t\t\t})\n\t\t: initNode(applyOp, policyInputs.deps, {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.apply` : undefined,\n\t\t\t});\n\n\tconst pullId = Symbol(name ? `${name}.snapshot` : \"reactiveMap.snapshot\");\n\tconst snapshotPrepOp: Operator<unknown, SnapshotPrep<K, V>> = {\n\t\tfactory: \"reactiveMap.snapshotPrep\",\n\t\tbody: (ctx: Ctx) => {\n\t\t\tconst expired = backend.pruneExpired().map(\n\t\t\t\t([key, previous]): MapChange<K, V> => ({\n\t\t\t\t\tkind: \"delete\",\n\t\t\t\t\tkey,\n\t\t\t\t\tprevious,\n\t\t\t\t\treason: \"expired\",\n\t\t\t\t}),\n\t\t\t);\n\t\t\tctx.down([[\"DATA\", { snapshot: backend.snapshot(), expired }]]);\n\t\t},\n\t\topts: {\n\t\t\t...base,\n\t\t\tpullId,\n\t\t\tpartial: true,\n\t\t},\n\t};\n\tconst snapshotPrep = graph\n\t\t? graph.initNode(snapshotPrepOp, [apply as Node<unknown>], {\n\t\t\t\tname: name ? `${name}.snapshotPrep` : undefined,\n\t\t\t\tmeta: { kind: \"collection_snapshot_prep\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.snapshotPrep\" } } : {}),\n\t\t\t})\n\t\t: initNode(snapshotPrepOp, [apply as Node<unknown>], {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.snapshotPrep` : undefined,\n\t\t\t});\n\tconst deltaOp: Operator<unknown, MapChange<K, V>> = {\n\t\tfactory: \"reactiveMap.delta\",\n\t\tbody: (ctx: Ctx) => {\n\t\t\tfor (const change of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", change as MapChange<K, V>]]);\n\t\t\t}\n\t\t\tfor (const prep of depBatch(ctx, 1) ?? []) {\n\t\t\t\tfor (const change of (prep as SnapshotPrep<K, V>).expired) ctx.down([[\"DATA\", change]]);\n\t\t\t}\n\t\t},\n\t\topts: { partial: true },\n\t};\n\tconst delta = graph\n\t\t? graph.initNode(deltaOp, [apply as Node<unknown>, snapshotPrep as Node<unknown>], {\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t\tmeta: { kind: \"collection_delta\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.delta\" } } : {}),\n\t\t\t})\n\t\t: initNode(deltaOp, [apply as Node<unknown>, snapshotPrep as Node<unknown>], {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.delta` : undefined,\n\t\t\t});\n\tconst snapshotOp: Operator<unknown, ReadonlyMap<K, V>> = {\n\t\tfactory: \"reactiveMap.snapshot\",\n\t\tbody: (ctx: Ctx) => {\n\t\t\tfor (const prep of depBatch(ctx, 0) ?? []) {\n\t\t\t\tctx.down([[\"DATA\", (prep as SnapshotPrep<K, V>).snapshot]]);\n\t\t\t}\n\t\t},\n\t\topts: { partial: true },\n\t};\n\tconst snapshot = graph\n\t\t? graph.initNode(snapshotOp, [snapshotPrep as Node<unknown>], {\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t\tmeta: { kind: \"collection_snapshot\", collection: \"reactiveMap\" },\n\t\t\t\t...(restorable ? { restore: { ref: \"reactiveMap.snapshot\" } } : {}),\n\t\t\t})\n\t\t: initNode(snapshotOp, [snapshotPrep as Node<unknown>], {\n\t\t\t\t...base,\n\t\t\t\tname: name ? `${name}.snapshot` : undefined,\n\t\t\t});\n\tif (restorable) {\n\t\tregisterBackendStateContributor(intent as Node<unknown>, () => backend.checkpointEntries());\n\t}\n\tconst releaseApply = graph\n\t\t? graph.retain(apply, { reason: \"reactiveMap.apply\" })\n\t\t: apply.subscribe(() => {});\n\tconst binds: Array<() => void> = [];\n\n\tfunction doSet(key: K, value: V, ttl?: number): void {\n\t\tif (ttl !== undefined) validateTtl(ttl);\n\t\tintent.down([\n\t\t\t[\"DATA\", ttl === undefined ? { kind: \"set\", key, value } : { kind: \"set\", key, value, ttl }],\n\t\t]);\n\t}\n\n\tfunction read(key: K): Lookup<V> {\n\t\tconst r = backend.lookup(key);\n\t\tif (!r.found && r.expired) intent.down([[\"DATA\", { kind: \"pruneKey\", key }]]);\n\t\treturn r;\n\t}\n\n\tfunction selectedSnapshot(predicate: (value: V, key: K) => boolean): ReadonlyMap<K, V> {\n\t\tconst out = new Map<K, V>();\n\t\tfor (const [key, value] of backend.snapshot()) {\n\t\t\tif (predicate(value, key)) out.set(key, value);\n\t\t}\n\t\treturn out;\n\t}\n\n\tfunction select(\n\t\tpredicate: (value: V, key: K) => boolean,\n\t): ReactiveView<MapChange<K, V>, ReadonlyMap<K, V>> {\n\t\tif (typeof predicate !== \"function\")\n\t\t\tthrow new TypeError(\"reactiveMap.select: predicate must be a function\");\n\t\tconst cached = selectMemo.get(predicate);\n\t\tif (cached !== undefined) return cached;\n\t\tlet view: ReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>;\n\t\tview = lightReactiveView<MapChange<K, V>, ReadonlyMap<K, V>>(delta as Node<unknown>, {\n\t\t\tdispatcher,\n\t\t\tgraph,\n\t\t\tfactory: \"reactiveMap.select\",\n\t\t\tname: name ? `${name}.select#${selectSeq++}` : undefined,\n\t\t\tmaterializeSnapshot: () => selectedSnapshot(predicate),\n\t\t\tonDispose: () => {\n\t\t\t\tselectMemo.deleteValue(view);\n\t\t\t},\n\t\t});\n\t\tselectMemo.set(predicate, view);\n\t\treturn view;\n\t}\n\n\treturn {\n\t\tdelta,\n\t\tsnapshot,\n\t\tpullId,\n\n\t\tget size(): number {\n\t\t\treturn backend.size;\n\t\t},\n\t\tget(key: K): V | undefined {\n\t\t\tconst r = read(key);\n\t\t\treturn r.found ? r.value : undefined;\n\t\t},\n\t\thas(key: K): boolean {\n\t\t\treturn read(key).found;\n\t\t},\n\t\ttoMap(): ReadonlyMap<K, V> {\n\t\t\tintent.down([[\"DATA\", { kind: \"pruneExpired\" }]]);\n\t\t\treturn backend.snapshot();\n\t\t},\n\t\tselect,\n\n\t\tset(key: K, value: V, opts?: { ttl?: number }): void {\n\t\t\tdoSet(key, value, opts?.ttl);\n\t\t},\n\t\tsetMany(entries: Iterable<readonly [K, V]>, opts?: { ttl?: number }): void {\n\t\t\tfor (const [k, v] of entries) doSet(k, v, opts?.ttl);\n\t\t},\n\t\tdelete(key: K): void {\n\t\t\tintent.down([[\"DATA\", { kind: \"delete\", key }]]);\n\t\t},\n\t\tdeleteMany(keys: Iterable<K>): void {\n\t\t\tfor (const k of keys) {\n\t\t\t\tintent.down([[\"DATA\", { kind: \"delete\", key: k }]]);\n\t\t\t}\n\t\t},\n\t\tclear(): void {\n\t\t\tintent.down([[\"DATA\", { kind: \"clear\" }]]);\n\t\t},\n\t\tpruneExpired(): void {\n\t\t\tintent.down([[\"DATA\", { kind: \"pruneExpired\" }]]);\n\t\t},\n\n\t\tsetFrom(src: Node<readonly [K, V]>): () => void {\n\t\t\tif (graph === undefined)\n\t\t\t\tthrow new Error(\n\t\t\t\t\t\"reactiveMap.setFrom requires options.graph so the input fold is describe-visible (D61)\",\n\t\t\t\t);\n\t\t\tconst op: Operator<readonly [K, V], MapIntent<K, V>> = {\n\t\t\t\tfactory: \"reactiveMap.bindSource\",\n\t\t\t\tbody: (ctx: Ctx) => {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfor (const [k, v] of (depBatch(ctx, 0) ?? []) as readonly (readonly [K, V])[]) {\n\t\t\t\t\t\t\tctx.down([[\"DATA\", { kind: \"set\", key: k, value: v }]]);\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\tctx.down([[\"ERROR\", errorPayload(e, \"reactiveMap.bindSource failed\")]]);\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst folder = graph.initNode(op, [src], {\n\t\t\t\tname: name ? `${name}.bind#${bindSeq++}` : undefined,\n\t\t\t\tmeta: { kind: \"collection_bind_source\", collection: \"reactiveMap\" },\n\t\t\t});\n\t\t\tbindDeps.add(folder as Node<unknown>);\n\t\t\tapply.subscribeDep(folder as Node<unknown>, applyBody);\n\t\t\tlet active = true;\n\t\t\tconst dispose = () => {\n\t\t\t\tif (!active) return;\n\t\t\t\tactive = false;\n\t\t\t\tapply.unsubscribeDep(folder as Node<unknown>, applyBody);\n\t\t\t};\n\t\t\tbinds.push(dispose);\n\t\t\treturn dispose;\n\t\t},\n\t\tdispose(): void {\n\t\t\tselectMemo.disposeAll();\n\t\t\tfor (const d of binds) d();\n\t\t\tbinds.length = 0;\n\t\t\treleaseApply();\n\t\t},\n\t};\n}\n","import type {\n\tIndexRow,\n\tReactiveIndex,\n\tReactiveIndexOptions,\n} from \"../graph/data-structures/reactive-index.js\";\nimport { restoreReactiveIndexFromBackendState } from \"../graph/data-structures/reactive-index.js\";\nimport type { ReactiveListOptions } from \"../graph/data-structures/reactive-list.js\";\nimport { type ReactiveList, reactiveList } from \"../graph/data-structures/reactive-list.js\";\nimport type { ReactiveLogOptions } from \"../graph/data-structures/reactive-log.js\";\nimport { type ReactiveLog, reactiveLog } from \"../graph/data-structures/reactive-log.js\";\nimport type { ReactiveMap, ReactiveMapOptions } from \"../graph/data-structures/reactive-map.js\";\nimport { restoreReactiveMapFromBackendState } from \"../graph/data-structures/reactive-map.js\";\nimport type {\n\tReactiveIndexRestoreState,\n\tReactiveListRestoreState,\n\tReactiveLogRestoreState,\n\tReactiveMapRestoreState,\n} from \"../storage/index.js\";\n\nfunction isListRestoreState<T>(\n\tstate: ReactiveListRestoreState<T> | readonly T[],\n): state is ReactiveListRestoreState<T> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreListValues<T>(state: ReactiveListRestoreState<T> | readonly T[]): readonly T[] {\n\tif (!isListRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveList\") throw new TypeError(\"restore state kind must be reactiveList\");\n\treturn state.state;\n}\n\nfunction isLogRestoreState<T>(\n\tstate: ReactiveLogRestoreState<T> | readonly T[],\n): state is ReactiveLogRestoreState<T> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreLogValues<T>(state: ReactiveLogRestoreState<T> | readonly T[]): readonly T[] {\n\tif (!isLogRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveLog\") throw new TypeError(\"restore state kind must be reactiveLog\");\n\treturn state.state;\n}\n\nfunction isMapRestoreState<K, V>(\n\tstate: ReactiveMapRestoreState<K, V> | readonly (readonly [K, V])[],\n): state is ReactiveMapRestoreState<K, V> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreMapEntries<K, V>(\n\tstate: ReactiveMapRestoreState<K, V> | readonly (readonly [K, V])[],\n): readonly (readonly [K, V])[] {\n\tif (!isMapRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveMap\") throw new TypeError(\"restore state kind must be reactiveMap\");\n\treturn state.state;\n}\n\nfunction isIndexRestoreState<K, V>(\n\tstate: ReactiveIndexRestoreState<K, V> | readonly IndexRow<K, V>[],\n): state is ReactiveIndexRestoreState<K, V> {\n\treturn !Array.isArray(state);\n}\n\nfunction restoreIndexRows<K, V>(\n\tstate: ReactiveIndexRestoreState<K, V> | readonly IndexRow<K, V>[],\n): readonly IndexRow<K, V>[] {\n\tif (!isIndexRestoreState(state)) return state;\n\tif (state.kind !== \"reactiveIndex\") {\n\t\tthrow new TypeError(\"restore state kind must be reactiveIndex\");\n\t}\n\treturn state.state;\n}\n\n/** D161 synchronous collection-owned restore. This helper never reads storage. */\nexport function restoreReactiveList<T = unknown>(\n\tstate: ReactiveListRestoreState<T> | readonly T[],\n\toptions: ReactiveListOptions = {},\n): ReactiveList<T> {\n\tconst values = restoreListValues(state);\n\treturn reactiveList<T>(values, options);\n}\n\n/** D161 synchronous collection-owned restore. This helper never reads storage. */\nexport function restoreReactiveLog<T = unknown>(\n\tstate: ReactiveLogRestoreState<T> | readonly T[],\n\toptions: ReactiveLogOptions = {},\n): ReactiveLog<T> {\n\tconst values = restoreLogValues(state);\n\treturn reactiveLog<T>(values, options);\n}\n\n/** D161 synchronous collection-owned restore for map entries; policy config still comes from options. */\nexport function restoreReactiveMap<K = unknown, V = unknown>(\n\tstate: ReactiveMapRestoreState<K, V> | readonly (readonly [K, V])[],\n\toptions: ReactiveMapOptions<K, V> = {},\n): ReactiveMap<K, V> {\n\tconst entries = restoreMapEntries(state);\n\treturn restoreReactiveMapFromBackendState<K, V>(entries, options);\n}\n\n/** D161 synchronous collection-owned restore for sorted index rows; key-codec I/O stays outside. */\nexport function restoreReactiveIndex<K = unknown, V = unknown>(\n\tstate: ReactiveIndexRestoreState<K, V> | readonly IndexRow<K, V>[],\n\toptions: ReactiveIndexOptions = {},\n): ReactiveIndex<K, V> {\n\tconst rows = restoreIndexRows(state);\n\treturn restoreReactiveIndexFromBackendState<K, V>(rows, options);\n}\n","import type {\n\tIndexChange,\n\tListChange,\n\tLogChange,\n\tMapChange,\n} from \"../graph/data-structures/change.js\";\nimport type { IndexRow } from \"../graph/data-structures/reactive-index.js\";\nimport { strictCanonicalJsonBytes, strictJsonCodecFor } from \"../json/codec.js\";\nimport type { AppendLogStorageTier } from \"./append-log.js\";\nimport type { Codec } from \"./codec.js\";\nimport type { KvStorageTier } from \"./kv.js\";\n\n/** D161 strict-JSON snapshot frame format tag for reactive collection persistence. */\nexport const REACTIVE_COLLECTION_SNAPSHOT_FORMAT =\n\t\"graphrefly.reactive-collection.snapshot.v1\" as const;\n/** D161 strict-JSON change frame format tag for reactive collection persistence. */\nexport const REACTIVE_COLLECTION_CHANGE_FORMAT =\n\t\"graphrefly.reactive-collection.change.v1\" as const;\n/** D161 v1 frame version for reactive collection snapshot/change storage. */\nexport const REACTIVE_COLLECTION_FRAME_VERSION = 1 as const;\n\n/** D161 collection kinds recognized by the unified persistence frame envelope. */\nexport type ReactiveCollectionStorageKind =\n\t| \"reactiveList\"\n\t| \"reactiveLog\"\n\t| \"reactiveMap\"\n\t| \"reactiveIndex\";\n\n/** D161 durable baseline frame; storage is passive and does not own graph restore. */\nexport interface ReactiveCollectionSnapshotFrame<\n\tK extends ReactiveCollectionStorageKind = ReactiveCollectionStorageKind,\n\tS = unknown,\n> {\n\treadonly format: typeof REACTIVE_COLLECTION_SNAPSHOT_FORMAT;\n\treadonly version: typeof REACTIVE_COLLECTION_FRAME_VERSION;\n\treadonly kind: K;\n\t/** Last append-log seq reflected by this snapshot; -1 means no change-log entry. */\n\treadonly changeCursor: number;\n\treadonly snapshot: S;\n}\n\n/** D161 append-log change frame; change-log replay is collection-state folding, not graph restore. */\nexport interface ReactiveCollectionChangeFrame<\n\tK extends ReactiveCollectionStorageKind = ReactiveCollectionStorageKind,\n\tC = unknown,\n> {\n\treadonly format: typeof REACTIVE_COLLECTION_CHANGE_FORMAT;\n\treadonly version: typeof REACTIVE_COLLECTION_FRAME_VERSION;\n\treadonly kind: K;\n\treadonly change: C;\n}\n\n/** D161 passive load/fold result consumed by synchronous restoreReactive* helpers. */\nexport interface ReactiveCollectionRestoreState<\n\tK extends ReactiveCollectionStorageKind = ReactiveCollectionStorageKind,\n\tS = unknown,\n> {\n\treadonly kind: K;\n\treadonly state: S;\n\treadonly source: \"empty\" | \"changes\" | \"snapshot\" | \"snapshot+changes\";\n\treadonly snapshot: { readonly found: boolean; readonly changeCursor: number };\n\treadonly changes: { readonly applied: number; readonly cursor: number };\n}\n\n/** D161 restore state for a reactiveList materialized as a strict-JSON array snapshot. */\nexport type ReactiveListRestoreState<T = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveList\",\n\treadonly T[]\n>;\n\n/** D161 restore state for a reactiveLog materialized as a strict-JSON array snapshot. */\nexport type ReactiveLogRestoreState<T = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveLog\",\n\treadonly T[]\n>;\n\n/** D161 passive restore-state shape for reactiveMap; policy-aware restore remains deferred. */\nexport type ReactiveMapRestoreState<K = unknown, V = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveMap\",\n\treadonly (readonly [K, V])[]\n>;\n\n/** D161 passive restore-state shape for reactiveIndex; key-codec restore remains deferred. */\nexport type ReactiveIndexRestoreState<K = unknown, V = unknown> = ReactiveCollectionRestoreState<\n\t\"reactiveIndex\",\n\treadonly IndexRow<K, V>[]\n>;\n\n/** D161 passive storage inputs for collection load/fold helpers. */\nexport interface LoadReactiveCollectionStateOptions {\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n}\n\nfunction isRecord(value: unknown): value is Record<string, unknown> {\n\treturn value !== null && typeof value === \"object\" && !Array.isArray(value);\n}\n\nfunction ownKeys(value: Record<string, unknown>): readonly string[] {\n\treturn Object.keys(value).sort();\n}\n\nfunction assertKeys(\n\tvalue: Record<string, unknown>,\n\texpected: readonly string[],\n\tlabel: string,\n): void {\n\tconst actual = ownKeys(value);\n\tconst want = [...expected].sort();\n\tif (actual.length !== want.length || actual.some((key, i) => key !== want[i])) {\n\t\tthrow new TypeError(`${label}: unexpected frame fields ${actual.join(\",\")}`);\n\t}\n}\n\nfunction assertSafeInteger(value: unknown, label: string, min = 0): number {\n\tif (!Number.isSafeInteger(value) || (value as number) < min) {\n\t\tthrow new TypeError(`${label} must be a safe integer >= ${min}`);\n\t}\n\treturn value as number;\n}\n\nfunction assertKind<K extends ReactiveCollectionStorageKind>(\n\tvalue: unknown,\n\texpected: K,\n\tlabel: string,\n): K {\n\tif (value !== expected) throw new TypeError(`${label}: kind must be ${expected}`);\n\treturn expected;\n}\n\nfunction assertArray<T = unknown>(value: unknown, label: string): readonly T[] {\n\tif (!Array.isArray(value)) throw new TypeError(`${label}: snapshot must be an array`);\n\treturn value as readonly T[];\n}\n\nfunction strictJsonIdentity(value: unknown): string {\n\treturn Array.from(strictCanonicalJsonBytes(value)).join(\",\");\n}\n\nfunction assertEntryArray<K = unknown, V = unknown>(\n\tvalue: unknown,\n\tlabel: string,\n): readonly (readonly [K, V])[] {\n\tconst entries = assertArray<unknown>(value, label);\n\tconst seen = new Set<string>();\n\tfor (const [i, entry] of entries.entries()) {\n\t\tif (!Array.isArray(entry) || entry.length !== 2) {\n\t\t\tthrow new TypeError(`${label}: entry ${i} must be [key,value]`);\n\t\t}\n\t\tconst key = strictJsonIdentity(entry[0]);\n\t\tif (seen.has(key)) throw new TypeError(`${label}: entry ${i} duplicates an earlier key`);\n\t\tseen.add(key);\n\t}\n\treturn entries as readonly (readonly [K, V])[];\n}\n\nfunction assertIndexRows<K = unknown, V = unknown>(\n\tvalue: unknown,\n\tlabel: string,\n): readonly IndexRow<K, V>[] {\n\tconst rows = assertArray<unknown>(value, label);\n\tconst seen = new Set<string>();\n\tfor (const [i, row] of rows.entries()) {\n\t\tif (!isRecord(row)) throw new TypeError(`${label}: row ${i} must be an object`);\n\t\tassertKeys(row, [\"primary\", \"secondary\", \"value\"], `${label} row`);\n\t\tconst primary = strictJsonIdentity(row.primary);\n\t\tif (seen.has(primary)) {\n\t\t\tthrow new TypeError(`${label}: row ${i} duplicates an earlier primary`);\n\t\t}\n\t\tseen.add(primary);\n\t}\n\treturn rows as readonly IndexRow<K, V>[];\n}\n\n/** Build the default D161 snapshot key for a storage prefix. */\nexport function collectionSnapshotKey(storagePrefix = \"reactive-collection\"): string {\n\tif (storagePrefix.length === 0) throw new TypeError(\"storagePrefix must be non-empty\");\n\treturn `${storagePrefix}/snapshot`;\n}\n\n/** Build a D161 strict-JSON snapshot frame before validation/encoding. */\nexport function reactiveCollectionSnapshotFrame<K extends ReactiveCollectionStorageKind, S>(\n\tkind: K,\n\tsnapshot: S,\n\topts: { readonly changeCursor?: number } = {},\n): ReactiveCollectionSnapshotFrame<K, S> {\n\tconst changeCursor = opts.changeCursor ?? -1;\n\tif (!Number.isSafeInteger(changeCursor) || changeCursor < -1) {\n\t\tthrow new RangeError(\"reactive collection snapshot changeCursor must be a safe integer >= -1\");\n\t}\n\treturn {\n\t\tformat: REACTIVE_COLLECTION_SNAPSHOT_FORMAT,\n\t\tversion: REACTIVE_COLLECTION_FRAME_VERSION,\n\t\tkind,\n\t\tchangeCursor,\n\t\tsnapshot,\n\t};\n}\n\n/** Build a D161 strict-JSON change frame before validation/encoding. */\nexport function reactiveCollectionChangeFrame<K extends ReactiveCollectionStorageKind, C>(\n\tkind: K,\n\tchange: C,\n): ReactiveCollectionChangeFrame<K, C> {\n\treturn {\n\t\tformat: REACTIVE_COLLECTION_CHANGE_FORMAT,\n\t\tversion: REACTIVE_COLLECTION_FRAME_VERSION,\n\t\tkind,\n\t\tchange,\n\t};\n}\n\n/** Validate a D161 snapshot frame and reject non-strict-JSON payloads honestly. */\nexport function assertReactiveCollectionSnapshotFrame<\n\tK extends ReactiveCollectionStorageKind,\n\tS = unknown,\n>(value: unknown, expectedKind: K): ReactiveCollectionSnapshotFrame<K, S> {\n\tif (!isRecord(value)) throw new TypeError(\"reactive collection snapshot frame must be an object\");\n\tassertKeys(value, [\"changeCursor\", \"format\", \"kind\", \"snapshot\", \"version\"], \"snapshot frame\");\n\tif (value.format !== REACTIVE_COLLECTION_SNAPSHOT_FORMAT) {\n\t\tthrow new TypeError(\"snapshot frame: invalid format\");\n\t}\n\tif (value.version !== REACTIVE_COLLECTION_FRAME_VERSION) {\n\t\tthrow new TypeError(\"snapshot frame: invalid version\");\n\t}\n\tassertKind(value.kind, expectedKind, \"snapshot frame\");\n\tassertSafeInteger(value.changeCursor, \"snapshot frame changeCursor\", -1);\n\tstrictJsonCodecFor<unknown>().encode(value);\n\treturn value as unknown as ReactiveCollectionSnapshotFrame<K, S>;\n}\n\n/** Validate a D161 change frame and reject non-strict-JSON payloads honestly. */\nexport function assertReactiveCollectionChangeFrame<\n\tK extends ReactiveCollectionStorageKind,\n\tC = unknown,\n>(value: unknown, expectedKind: K): ReactiveCollectionChangeFrame<K, C> {\n\tif (!isRecord(value)) throw new TypeError(\"reactive collection change frame must be an object\");\n\tassertKeys(value, [\"change\", \"format\", \"kind\", \"version\"], \"change frame\");\n\tif (value.format !== REACTIVE_COLLECTION_CHANGE_FORMAT) {\n\t\tthrow new TypeError(\"change frame: invalid format\");\n\t}\n\tif (value.version !== REACTIVE_COLLECTION_FRAME_VERSION) {\n\t\tthrow new TypeError(\"change frame: invalid version\");\n\t}\n\tassertKind(value.kind, expectedKind, \"change frame\");\n\tif (!Object.hasOwn(value, \"change\")) throw new TypeError(\"change frame: change is required\");\n\tstrictJsonCodecFor<unknown>().encode(value);\n\treturn value as unknown as ReactiveCollectionChangeFrame<K, C>;\n}\n\n/** Codec for D161 snapshot frames with strict JSON validation on both encode and decode. */\nexport function reactiveCollectionSnapshotFrameCodec<\n\tK extends ReactiveCollectionStorageKind,\n\tS = unknown,\n>(kind: K): Codec<ReactiveCollectionSnapshotFrame<K, S>> {\n\tconst codec = strictJsonCodecFor<unknown>();\n\treturn {\n\t\tencode(value) {\n\t\t\treturn codec.encode(assertReactiveCollectionSnapshotFrame<K, S>(value, kind));\n\t\t},\n\t\tdecode(bytes) {\n\t\t\treturn assertReactiveCollectionSnapshotFrame<K, S>(codec.decode(bytes), kind);\n\t\t},\n\t};\n}\n\n/** Codec for D161 change frames with strict JSON validation on both encode and decode. */\nexport function reactiveCollectionChangeFrameCodec<\n\tK extends ReactiveCollectionStorageKind,\n\tC = unknown,\n>(kind: K): Codec<ReactiveCollectionChangeFrame<K, C>> {\n\tconst codec = strictJsonCodecFor<unknown>();\n\treturn {\n\t\tencode(value) {\n\t\t\treturn codec.encode(assertReactiveCollectionChangeFrame<K, C>(value, kind));\n\t\t},\n\t\tdecode(bytes) {\n\t\t\treturn assertReactiveCollectionChangeFrame<K, C>(codec.decode(bytes), kind);\n\t\t},\n\t};\n}\n\nfunction assertListChange<T>(value: unknown): ListChange<T> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveList change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"append\":\n\t\t\tif (!Object.hasOwn(value, \"value\")) throw new TypeError(\"reactiveList append.value required\");\n\t\t\tassertKeys(value, [\"kind\", \"value\"], \"reactiveList append\");\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"appendMany\":\n\t\t\tassertKeys(value, [\"kind\", \"values\"], \"reactiveList appendMany\");\n\t\t\tassertArray<T>(value.values, \"reactiveList appendMany.values\");\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"insert\":\n\t\t\tassertKeys(value, [\"index\", \"kind\", \"value\"], \"reactiveList insert\");\n\t\t\tassertSafeInteger(value.index, \"reactiveList insert.index\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"insertMany\":\n\t\t\tassertKeys(value, [\"index\", \"kind\", \"values\"], \"reactiveList insertMany\");\n\t\t\tassertSafeInteger(value.index, \"reactiveList insertMany.index\", 0);\n\t\t\tassertArray<T>(value.values, \"reactiveList insertMany.values\");\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"pop\":\n\t\t\tassertKeys(value, [\"index\", \"kind\", \"value\"], \"reactiveList pop\");\n\t\t\tassertSafeInteger(value.index, \"reactiveList pop.index\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"trimHead\":\n\t\t\tassertKeys(value, [\"kind\", \"n\"], \"reactiveList trimHead\");\n\t\t\tassertSafeInteger(value.n, \"reactiveList trimHead.n\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveList clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveList clear.count\", 0);\n\t\t\treturn value as unknown as ListChange<T>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveList change kind ${value.kind}`);\n\t}\n}\n\nfunction assertLogChange<T>(value: unknown): LogChange<T> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveLog change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"append\":\n\t\t\tif (!Object.hasOwn(value, \"value\")) throw new TypeError(\"reactiveLog append.value required\");\n\t\t\tassertKeys(value, [\"kind\", \"value\"], \"reactiveLog append\");\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tcase \"appendMany\":\n\t\t\tassertKeys(value, [\"kind\", \"values\"], \"reactiveLog appendMany\");\n\t\t\tassertArray<T>(value.values, \"reactiveLog appendMany.values\");\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tcase \"trimHead\":\n\t\t\tassertKeys(value, [\"kind\", \"n\"], \"reactiveLog trimHead\");\n\t\t\tassertSafeInteger(value.n, \"reactiveLog trimHead.n\", 0);\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveLog clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveLog clear.count\", 0);\n\t\t\treturn value as unknown as LogChange<T>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveLog change kind ${value.kind}`);\n\t}\n}\n\nfunction assertMapChange<K, V>(value: unknown): MapChange<K, V> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveMap change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"set\":\n\t\t\tif (!Object.hasOwn(value, \"key\")) throw new TypeError(\"reactiveMap set.key required\");\n\t\t\tif (!Object.hasOwn(value, \"value\")) throw new TypeError(\"reactiveMap set.value required\");\n\t\t\tassertKeys(value, [\"key\", \"kind\", \"value\"], \"reactiveMap set\");\n\t\t\treturn value as unknown as MapChange<K, V>;\n\t\tcase \"delete\":\n\t\t\tif (!Object.hasOwn(value, \"key\")) throw new TypeError(\"reactiveMap delete.key required\");\n\t\t\tif (!Object.hasOwn(value, \"previous\")) {\n\t\t\t\tthrow new TypeError(\"reactiveMap delete.previous required\");\n\t\t\t}\n\t\t\tassertKeys(value, [\"key\", \"kind\", \"previous\", \"reason\"], \"reactiveMap delete\");\n\t\t\tif (\n\t\t\t\tvalue.reason !== \"expired\" &&\n\t\t\t\tvalue.reason !== \"lru-evict\" &&\n\t\t\t\tvalue.reason !== \"archived\" &&\n\t\t\t\tvalue.reason !== \"explicit\"\n\t\t\t) {\n\t\t\t\tthrow new TypeError(\"reactiveMap delete.reason is invalid\");\n\t\t\t}\n\t\t\treturn value as unknown as MapChange<K, V>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveMap clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveMap clear.count\", 0);\n\t\t\treturn value as unknown as MapChange<K, V>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveMap change kind ${value.kind}`);\n\t}\n}\n\nfunction assertIndexChange<K, V>(value: unknown): IndexChange<K, V> {\n\tif (!isRecord(value) || typeof value.kind !== \"string\") {\n\t\tthrow new TypeError(\"reactiveIndex change must be an object with kind\");\n\t}\n\tswitch (value.kind) {\n\t\tcase \"upsert\":\n\t\t\tif (!Object.hasOwn(value, \"primary\")) {\n\t\t\t\tthrow new TypeError(\"reactiveIndex upsert.primary required\");\n\t\t\t}\n\t\t\tif (!Object.hasOwn(value, \"secondary\")) {\n\t\t\t\tthrow new TypeError(\"reactiveIndex upsert.secondary required\");\n\t\t\t}\n\t\t\tif (!Object.hasOwn(value, \"value\"))\n\t\t\t\tthrow new TypeError(\"reactiveIndex upsert.value required\");\n\t\t\tassertKeys(value, [\"kind\", \"primary\", \"secondary\", \"value\"], \"reactiveIndex upsert\");\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tcase \"delete\":\n\t\t\tif (!Object.hasOwn(value, \"primary\")) {\n\t\t\t\tthrow new TypeError(\"reactiveIndex delete.primary required\");\n\t\t\t}\n\t\t\tassertKeys(value, [\"kind\", \"primary\"], \"reactiveIndex delete\");\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tcase \"deleteMany\":\n\t\t\tassertKeys(value, [\"kind\", \"primaries\"], \"reactiveIndex deleteMany\");\n\t\t\tassertArray<K>(value.primaries, \"reactiveIndex deleteMany.primaries\");\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tcase \"clear\":\n\t\t\tassertKeys(value, [\"count\", \"kind\"], \"reactiveIndex clear\");\n\t\t\tassertSafeInteger(value.count, \"reactiveIndex clear.count\", 0);\n\t\t\treturn value as unknown as IndexChange<K, V>;\n\t\tdefault:\n\t\t\tthrow new TypeError(`unsupported reactiveIndex change kind ${value.kind}`);\n\t}\n}\n\nfunction applyListChange<T>(state: T[], change: ListChange<T>): void {\n\tswitch (change.kind) {\n\t\tcase \"append\":\n\t\t\tstate.push(change.value);\n\t\t\treturn;\n\t\tcase \"appendMany\":\n\t\t\tstate.push(...change.values);\n\t\t\treturn;\n\t\tcase \"insert\":\n\t\t\tif (change.index > state.length)\n\t\t\t\tthrow new Error(\"reactiveList insert change is out of range\");\n\t\t\tstate.splice(change.index, 0, change.value);\n\t\t\treturn;\n\t\tcase \"insertMany\":\n\t\t\tif (change.index > state.length) {\n\t\t\t\tthrow new Error(\"reactiveList insertMany change is out of range\");\n\t\t\t}\n\t\t\tstate.splice(change.index, 0, ...change.values);\n\t\t\treturn;\n\t\tcase \"pop\":\n\t\t\tif (change.index >= state.length) throw new Error(\"reactiveList pop change is out of range\");\n\t\t\tif (!strictJsonEquals(state[change.index], change.value)) {\n\t\t\t\tthrow new Error(\"reactiveList pop change value does not match current state\");\n\t\t\t}\n\t\t\tstate.splice(change.index, 1);\n\t\t\treturn;\n\t\tcase \"trimHead\":\n\t\t\tif (change.n > state.length) throw new Error(\"reactiveList trimHead change is out of range\");\n\t\t\tstate.splice(0, change.n);\n\t\t\treturn;\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveList clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction strictJsonEquals(a: unknown, b: unknown): boolean {\n\tconst left = strictCanonicalJsonBytes(a);\n\tconst right = strictCanonicalJsonBytes(b);\n\tif (left.byteLength !== right.byteLength) return false;\n\tfor (let i = 0; i < left.byteLength; i += 1) if (left[i] !== right[i]) return false;\n\treturn true;\n}\n\nfunction findJsonIndex<T>(\n\tvalues: readonly T[],\n\tmatch: (value: T) => unknown,\n\tkey: unknown,\n\tlabel: string,\n): number {\n\tlet found = -1;\n\tfor (let i = 0; i < values.length; i += 1) {\n\t\tif (strictJsonEquals(match(values[i] as T), key)) {\n\t\t\tif (found !== -1) throw new Error(`${label} duplicate JSON key in restore state`);\n\t\t\tfound = i;\n\t\t}\n\t}\n\treturn found;\n}\n\nfunction cmpOrd(a: unknown, b: unknown): number {\n\tif (a === b) return 0;\n\tconst ta = typeof a;\n\tif (\n\t\tta === typeof b &&\n\t\t(ta === \"number\" || ta === \"string\" || ta === \"boolean\" || ta === \"bigint\")\n\t) {\n\t\tconst ax = a as number | string | bigint | boolean;\n\t\tconst bx = b as number | string | bigint | boolean;\n\t\treturn ax < bx ? -1 : ax > bx ? 1 : 0;\n\t}\n\treturn String(a).localeCompare(String(b));\n}\n\nfunction applyLogChange<T>(state: T[], change: LogChange<T>): void {\n\tswitch (change.kind) {\n\t\tcase \"append\":\n\t\t\tstate.push(change.value);\n\t\t\treturn;\n\t\tcase \"appendMany\":\n\t\t\tstate.push(...change.values);\n\t\t\treturn;\n\t\tcase \"trimHead\":\n\t\t\tif (change.n > state.length) throw new Error(\"reactiveLog trimHead change is out of range\");\n\t\t\tstate.splice(0, change.n);\n\t\t\treturn;\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveLog clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction applyMapChange<K, V>(state: Array<readonly [K, V]>, change: MapChange<K, V>): void {\n\tswitch (change.kind) {\n\t\tcase \"set\": {\n\t\t\tconst index = findJsonIndex(state, ([key]) => key, change.key, \"reactiveMap\");\n\t\t\tif (index === -1) state.push([change.key, change.value] as const);\n\t\t\telse state[index] = [change.key, change.value] as const;\n\t\t\treturn;\n\t\t}\n\t\tcase \"delete\": {\n\t\t\tconst index = findJsonIndex(state, ([key]) => key, change.key, \"reactiveMap\");\n\t\t\tif (index === -1) throw new Error(\"reactiveMap delete change key is missing\");\n\t\t\tif (!strictJsonEquals(state[index]?.[1], change.previous)) {\n\t\t\t\tthrow new Error(\"reactiveMap delete change previous value does not match current state\");\n\t\t\t}\n\t\t\tstate.splice(index, 1);\n\t\t\treturn;\n\t\t}\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveMap clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction sortIndexRows<K, V>(state: Array<IndexRow<K, V>>): void {\n\tstate.sort((a, b) => {\n\t\tconst bySecondary = cmpOrd(a.secondary, b.secondary);\n\t\treturn bySecondary === 0 ? cmpOrd(a.primary, b.primary) : bySecondary;\n\t});\n}\n\nfunction applyIndexChange<K, V>(state: Array<IndexRow<K, V>>, change: IndexChange<K, V>): void {\n\tswitch (change.kind) {\n\t\tcase \"upsert\": {\n\t\t\tconst index = findJsonIndex(state, (row) => row.primary, change.primary, \"reactiveIndex\");\n\t\t\tconst row: IndexRow<K, V> = {\n\t\t\t\tprimary: change.primary,\n\t\t\t\tsecondary: change.secondary,\n\t\t\t\tvalue: change.value,\n\t\t\t};\n\t\t\tif (index === -1) state.push(row);\n\t\t\telse state[index] = row;\n\t\t\tsortIndexRows(state);\n\t\t\treturn;\n\t\t}\n\t\tcase \"delete\": {\n\t\t\tconst index = findJsonIndex(state, (row) => row.primary, change.primary, \"reactiveIndex\");\n\t\t\tif (index === -1) throw new Error(\"reactiveIndex delete change primary is missing\");\n\t\t\tstate.splice(index, 1);\n\t\t\treturn;\n\t\t}\n\t\tcase \"deleteMany\": {\n\t\t\tfor (const primary of change.primaries) {\n\t\t\t\tconst index = findJsonIndex(state, (row) => row.primary, primary, \"reactiveIndex\");\n\t\t\t\tif (index === -1) {\n\t\t\t\t\tthrow new Error(\"reactiveIndex deleteMany change primary is missing\");\n\t\t\t\t}\n\t\t\t\tstate.splice(index, 1);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tcase \"clear\":\n\t\t\tif (change.count !== state.length) {\n\t\t\t\tthrow new Error(\"reactiveIndex clear change count does not match current state\");\n\t\t\t}\n\t\t\tstate.length = 0;\n\t\t\treturn;\n\t}\n}\n\nfunction finishState<K extends ReactiveCollectionStorageKind, T>(\n\tkind: K,\n\tstate: T[],\n\tsnapshotFound: boolean,\n\tsnapshotCursor: number,\n\tapplied: number,\n\tcursor: number,\n): ReactiveCollectionRestoreState<K, readonly T[]> {\n\treturn {\n\t\tkind,\n\t\tstate,\n\t\tsource: snapshotFound\n\t\t\t? applied > 0\n\t\t\t\t? \"snapshot+changes\"\n\t\t\t\t: \"snapshot\"\n\t\t\t: applied > 0\n\t\t\t\t? \"changes\"\n\t\t\t\t: \"empty\",\n\t\tsnapshot: { found: snapshotFound, changeCursor: snapshotCursor },\n\t\tchanges: { applied, cursor },\n\t};\n}\n\nfunction loadState<K extends ReactiveCollectionStorageKind, T, C>(\n\tkind: K,\n\topts: LoadReactiveCollectionStateOptions,\n\tassertSnapshot: (value: unknown) => readonly T[],\n\tassertChange: (value: unknown) => C,\n\tapplyChange: (state: T[], change: C) => void,\n): Promise<ReactiveCollectionRestoreState<K, readonly T[]>> {\n\tconst key = opts.snapshotKey ?? collectionSnapshotKey(opts.storagePrefix);\n\treturn opts.snapshotStore.get(key).then((snapshotValue) => {\n\t\tlet snapshotFound = false;\n\t\tlet snapshotCursor = -1;\n\t\tlet state: T[] = [];\n\n\t\tif (snapshotValue !== undefined) {\n\t\t\tconst frame = assertReactiveCollectionSnapshotFrame<K, readonly T[]>(snapshotValue, kind);\n\t\t\tstate = [...assertSnapshot(frame.snapshot)];\n\t\t\tsnapshotFound = true;\n\t\t\tsnapshotCursor = frame.changeCursor;\n\t\t}\n\n\t\tif (opts.changeLog === undefined) {\n\t\t\treturn finishState(kind, state, snapshotFound, snapshotCursor, 0, snapshotCursor);\n\t\t}\n\n\t\treturn opts.changeLog.read({ after: snapshotCursor }).then((entries) => {\n\t\t\tlet applied = 0;\n\t\t\tlet cursor = snapshotCursor;\n\t\t\tfor (const entry of entries) {\n\t\t\t\tconst expectedSeq = cursor + 1;\n\t\t\t\tif (!Number.isSafeInteger(entry.seq) || entry.seq !== expectedSeq) {\n\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t`reactive collection change log is non-contiguous: expected seq ${expectedSeq}, got ${entry.seq}`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t\tconst frame = assertReactiveCollectionChangeFrame<K, C>(entry.value, kind);\n\t\t\t\tconst change = assertChange(frame.change);\n\t\t\t\tapplyChange(state, change);\n\t\t\t\tapplied += 1;\n\t\t\t\tcursor = entry.seq;\n\t\t\t}\n\t\t\treturn finishState(kind, state, snapshotFound, snapshotCursor, applied, cursor);\n\t\t});\n\t});\n}\n\n/** D161 passive load/fold for reactiveList; reads storage but never mutates graph topology. */\nexport function loadReactiveListState<T = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveListRestoreState<T>> {\n\treturn loadState<\"reactiveList\", T, ListChange<T>>(\n\t\t\"reactiveList\",\n\t\topts,\n\t\t(value) => assertArray<T>(value, \"reactiveList snapshot\"),\n\t\tassertListChange,\n\t\tapplyListChange,\n\t);\n}\n\n/** D161 passive load/fold for reactiveLog; reads storage but never mutates graph topology. */\nexport function loadReactiveLogState<T = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveLogRestoreState<T>> {\n\treturn loadState<\"reactiveLog\", T, LogChange<T>>(\n\t\t\"reactiveLog\",\n\t\topts,\n\t\t(value) => assertArray<T>(value, \"reactiveLog snapshot\"),\n\t\tassertLogChange,\n\t\tapplyLogChange,\n\t);\n}\n\n/** D161 passive load/fold scaffold for reactiveMap; synchronous policy restore is deferred. */\nexport function loadReactiveMapState<K = unknown, V = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveMapRestoreState<K, V>> {\n\treturn loadState<\"reactiveMap\", readonly [K, V], MapChange<K, V>>(\n\t\t\"reactiveMap\",\n\t\topts,\n\t\t(value) => assertEntryArray<K, V>(value, \"reactiveMap snapshot\"),\n\t\tassertMapChange,\n\t\tapplyMapChange,\n\t);\n}\n\n/** D161 passive load/fold scaffold for reactiveIndex; key-codec restore is deferred. */\nexport function loadReactiveIndexState<K = unknown, V = unknown>(\n\topts: LoadReactiveCollectionStateOptions,\n): Promise<ReactiveIndexRestoreState<K, V>> {\n\treturn loadState<\"reactiveIndex\", IndexRow<K, V>, IndexChange<K, V>>(\n\t\t\"reactiveIndex\",\n\t\topts,\n\t\t(value) => assertIndexRows<K, V>(value, \"reactiveIndex snapshot\"),\n\t\tassertIndexChange,\n\t\tapplyIndexChange,\n\t);\n}\n","import type { DeliveryMeta } from \"../ctx/types.js\";\nimport {\n\ttype ReactiveIndex,\n\ttype ReactiveIndexOptions,\n\ttype ReactiveList,\n\ttype ReactiveListOptions,\n\ttype ReactiveLog,\n\ttype ReactiveLogOptions,\n\ttype ReactiveMap,\n\ttype ReactiveMapOptions,\n\trestoreReactiveIndex,\n\trestoreReactiveList,\n\trestoreReactiveLog,\n\trestoreReactiveMap,\n} from \"../data-structures/index.js\";\nimport type {\n\tIndexChange,\n\tListChange,\n\tLogChange,\n\tMapChange,\n} from \"../graph/data-structures/change.js\";\nimport type { IndexRow } from \"../graph/data-structures/reactive-index.js\";\nimport { assertGraphLocalNode, type Graph, type StateNode } from \"../graph/graph.js\";\nimport type { Node } from \"../node/node.js\";\nimport type { Message } from \"../protocol/messages.js\";\nimport type {\n\tAppendLogEntry,\n\tAppendLogStorageTier,\n\tKvStorageTier,\n\tLoadReactiveCollectionStateOptions,\n\tReactiveCollectionChangeFrame,\n\tReactiveCollectionSnapshotFrame,\n\tReactiveIndexRestoreState,\n\tReactiveListRestoreState,\n\tReactiveLogRestoreState,\n\tReactiveMapRestoreState,\n} from \"../storage/index.js\";\nimport {\n\tassertReactiveCollectionChangeFrame,\n\tassertReactiveCollectionSnapshotFrame,\n\tcollectionSnapshotKey,\n\tloadReactiveIndexState,\n\tloadReactiveListState,\n\tloadReactiveLogState,\n\tloadReactiveMapState,\n\treactiveCollectionChangeFrame,\n\treactiveCollectionSnapshotFrame,\n} from \"../storage/index.js\";\n\ntype PersistableKind = \"reactiveList\" | \"reactiveLog\" | \"reactiveMap\" | \"reactiveIndex\";\ntype PersistableChange<T, K extends PersistableKind> = K extends \"reactiveList\"\n\t? ListChange<T>\n\t: K extends \"reactiveLog\"\n\t\t? LogChange<T>\n\t\t: K extends \"reactiveMap\"\n\t\t\t? MapChange<unknown, T>\n\t\t\t: IndexChange<unknown, T>;\ntype PersistableCollection<T, K extends PersistableKind> = K extends \"reactiveList\"\n\t? ReactiveList<T>\n\t: K extends \"reactiveLog\"\n\t\t? ReactiveLog<T>\n\t\t: K extends \"reactiveMap\"\n\t\t\t? ReactiveMap<unknown, T>\n\t\t\t: ReactiveIndex<unknown, T>;\n\n/** D161 adapter write-progress cursor; this is not a domain replay or wire-bridge cursor. */\nexport interface ReactiveCollectionPersistenceCursor {\n\treadonly kind: \"persistence.cursor\";\n\treadonly collection: PersistableKind;\n\treadonly changeSeq: number;\n\treadonly snapshotWrites: number;\n\treadonly changeWrites: number;\n}\n\n/** D161 graph-visible persistence sidecar status fact. */\nexport interface ReactiveCollectionPersistenceStatus {\n\treadonly state: \"starting\" | \"ready\" | \"flushing\" | \"errored\" | \"disposed\";\n\treadonly pending: number;\n\treadonly writes: number;\n\treadonly errors: number;\n\treadonly cursor: ReactiveCollectionPersistenceCursor;\n}\n\n/** D161 graph-visible persistence sidecar error fact. */\nexport interface ReactiveCollectionPersistenceError {\n\treadonly phase: \"snapshot\" | \"change\";\n\treadonly message: string;\n\treadonly cursor: ReactiveCollectionPersistenceCursor;\n}\n\n/** Options for the D161 graph-bound persistence sidecar over a reactive collection. */\nexport interface PersistReactiveCollectionOptions<K extends PersistableKind = PersistableKind> {\n\treadonly kind: K;\n\treadonly name?: string;\n\treadonly snapshotStore: KvStorageTier<unknown>;\n\treadonly snapshotKey?: string;\n\treadonly storagePrefix?: string;\n\treadonly changeLog?: AppendLogStorageTier<unknown>;\n\t/** Adapter write cursor seed for wrappers that already folded a change log. */\n\treadonly initialChangeCursor?: number;\n\t/** Default true: write one durable baseline when the adapter attaches. */\n\treadonly snapshotOnAttach?: boolean;\n\t/** Optional snapshot cadence. Manual snapshots remain available via handle.snapshot(). */\n\treadonly snapshotEveryChanges?: number;\n}\n\n/** D161 sidecar controls; flush waits for queued storage promises to settle, not fsync. */\nexport interface ReactiveCollectionPersistenceHandle {\n\treadonly ready: StateNode<boolean>;\n\treadonly status: StateNode<ReactiveCollectionPersistenceStatus>;\n\treadonly error: StateNode<ReactiveCollectionPersistenceError | null>;\n\treadonly cursor: StateNode<ReactiveCollectionPersistenceCursor>;\n\tflush(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n\tsnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n\tdispose(done?: (status: ReactiveCollectionPersistenceStatus) => void): void;\n}\n\ninterface QueueItem {\n\treadonly phase: \"snapshot\" | \"change\" | \"flush\" | \"dispose\";\n\treadonly done?: (status: ReactiveCollectionPersistenceStatus) => void;\n\trun(): void | PromiseLike<void>;\n}\n\nfunction emptyCursor(collection: PersistableKind): ReactiveCollectionPersistenceCursor {\n\treturn {\n\t\tkind: \"persistence.cursor\",\n\t\tcollection,\n\t\tchangeSeq: -1,\n\t\tsnapshotWrites: 0,\n\t\tchangeWrites: 0,\n\t};\n}\n\nfunction errorMessage(error: unknown): string {\n\treturn error instanceof Error ? error.message : String(error);\n}\n\nfunction validateSnapshotEveryChanges(value: number | undefined): number | undefined {\n\tif (value === undefined) return undefined;\n\tif (!Number.isSafeInteger(value) || value < 1) {\n\t\tthrow new RangeError(\"snapshotEveryChanges must be a positive safe integer\");\n\t}\n\treturn value;\n}\n\nfunction validateInitialChangeCursor(value: number | undefined): number {\n\tif (value === undefined) return -1;\n\tif (!Number.isSafeInteger(value) || value < -1) {\n\t\tthrow new RangeError(\"initialChangeCursor must be a safe integer >= -1\");\n\t}\n\treturn value;\n}\n\nfunction statusOf(\n\tstate: ReactiveCollectionPersistenceStatus[\"state\"],\n\tpending: number,\n\twrites: number,\n\terrors: number,\n\tcursor: ReactiveCollectionPersistenceCursor,\n): ReactiveCollectionPersistenceStatus {\n\treturn { state, pending, writes, errors, cursor };\n}\n\nfunction dataOf<C>(msg: Message): C | undefined {\n\treturn msg[0] === \"DATA\" ? (msg[1] as C) : undefined;\n}\n\n/**\n * D161 graph-bound sidecar over an existing collection. It writes passive storage frames and\n * exposes adapter progress as graph-visible DATA facts; it never restores or mutates the collection.\n */\nexport function persistReactiveCollection<T, K extends PersistableKind>(\n\tgraph: Graph,\n\tcollection: PersistableCollection<T, K>,\n\topts: PersistReactiveCollectionOptions<K>,\n): ReactiveCollectionPersistenceHandle {\n\tconst kind = opts.kind;\n\tconst name = opts.name ?? `${kind}.persistence`;\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(opts.storagePrefix ?? name);\n\tconst snapshotEveryChanges = validateSnapshotEveryChanges(opts.snapshotEveryChanges);\n\tassertGraphLocalNode(graph, collection.delta as Node<unknown>, `${name}.collection.delta`);\n\tassertGraphLocalNode(graph, collection.snapshot as Node<unknown>, `${name}.collection.snapshot`);\n\n\tlet cursorValue = {\n\t\t...emptyCursor(kind),\n\t\tchangeSeq: validateInitialChangeCursor(opts.initialChangeCursor),\n\t};\n\tlet statusValue = statusOf(\"starting\", 0, 0, 0, cursorValue);\n\tlet errorCount = 0;\n\tlet writes = 0;\n\tlet observedChangesSinceSnapshot = 0;\n\tlet running = false;\n\tlet disposed = false;\n\tlet disposeRequested = false;\n\tlet subscribing = true;\n\tlet stop: (() => void) | undefined;\n\tconst queue: QueueItem[] = [];\n\n\tconst ready = graph.state(false, { name: `${name}/ready` });\n\tconst status = graph.state<ReactiveCollectionPersistenceStatus>(statusValue, {\n\t\tname: `${name}/status`,\n\t});\n\tconst error = graph.state<ReactiveCollectionPersistenceError | null>(null, {\n\t\tname: `${name}/error`,\n\t});\n\tconst cursor = graph.state<ReactiveCollectionPersistenceCursor>(cursorValue, {\n\t\tname: `${name}/cursor`,\n\t});\n\n\tfunction publish(state: ReactiveCollectionPersistenceStatus[\"state\"]): void {\n\t\tconst nextState = statusValue.state === \"errored\" && state !== \"disposed\" ? \"errored\" : state;\n\t\tstatusValue = statusOf(\n\t\t\tnextState,\n\t\t\tqueue.length + (running ? 1 : 0),\n\t\t\twrites,\n\t\t\terrorCount,\n\t\t\tcursorValue,\n\t\t);\n\t\tcursor.set(cursorValue);\n\t\tstatus.set(statusValue);\n\t\tif (nextState === \"ready\") ready.set(true);\n\t\tif (nextState === \"errored\" || nextState === \"disposed\") ready.set(false);\n\t}\n\n\tfunction report(phase: \"snapshot\" | \"change\", caught: unknown): void {\n\t\terrorCount += 1;\n\t\tconst fact = { phase, message: errorMessage(caught), cursor: cursorValue };\n\t\terror.set(fact);\n\t}\n\n\tfunction callDone(done: QueueItem[\"done\"]): void {\n\t\ttry {\n\t\t\tdone?.(statusValue);\n\t\t} catch {\n\t\t\t// Done callbacks are advisory barriers; user code must not wedge the adapter queue.\n\t\t}\n\t}\n\n\tfunction finish(item: QueueItem): void {\n\t\tif (item.phase === \"dispose\") {\n\t\t\tdisposed = true;\n\t\t\trunning = false;\n\t\t\tpublish(\"disposed\");\n\t\t} else if (statusValue.state !== \"errored\") {\n\t\t\trunning = false;\n\t\t\tpublish(\"ready\");\n\t\t} else {\n\t\t\trunning = false;\n\t\t\tpublish(\"errored\");\n\t\t}\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction fail(item: QueueItem, caught: unknown): void {\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") report(item.phase, caught);\n\t\trunning = false;\n\t\tif (item.phase === \"snapshot\" || item.phase === \"change\") publish(\"errored\");\n\t\tcallDone(item.done);\n\t\tdrain();\n\t}\n\n\tfunction chainThenable(item: QueueItem, value: unknown): boolean {\n\t\tif ((typeof value !== \"object\" && typeof value !== \"function\") || value === null) return false;\n\t\tlet then: unknown;\n\t\ttry {\n\t\t\tthen = (value as { then?: unknown }).then;\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn true;\n\t\t}\n\t\tif (typeof then !== \"function\") return false;\n\t\tlet settled = false;\n\t\tconst settle = (next: () => void) => {\n\t\t\tif (settled) return;\n\t\t\tsettled = true;\n\t\t\tnext();\n\t\t};\n\t\ttry {\n\t\t\t(then as (onFulfilled: () => void, onRejected: (error: unknown) => void) => unknown).call(\n\t\t\t\tvalue,\n\t\t\t\t() => settle(() => finish(item)),\n\t\t\t\t(caught) => settle(() => fail(item, caught)),\n\t\t\t);\n\t\t} catch (caught) {\n\t\t\tsettle(() => fail(item, caught));\n\t\t}\n\t\treturn true;\n\t}\n\n\tfunction enqueue(item: QueueItem): void {\n\t\tif (disposed || (disposeRequested && item.phase !== \"dispose\" && item.phase !== \"flush\")) {\n\t\t\tcallDone(item.done);\n\t\t\treturn;\n\t\t}\n\t\tqueue.push(item);\n\t\tdrain();\n\t}\n\n\tfunction drain(): void {\n\t\tif (running) return;\n\t\tconst item = queue.shift();\n\t\tif (item === undefined) return;\n\t\trunning = true;\n\t\tpublish(\n\t\t\titem.phase === \"flush\" ? \"flushing\" : statusValue.state === \"starting\" ? \"starting\" : \"ready\",\n\t\t);\n\t\tlet result: void | PromiseLike<void>;\n\t\ttry {\n\t\t\tresult = item.run();\n\t\t} catch (caught) {\n\t\t\tfail(item, caught);\n\t\t\treturn;\n\t\t}\n\t\tif (chainThenable(item, result)) return;\n\t\tfinish(item);\n\t}\n\n\tfunction enqueueSnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\tconst snapshot = collectionSnapshot(collection, kind);\n\t\tobservedChangesSinceSnapshot = 0;\n\t\tenqueue({\n\t\t\tphase: \"snapshot\",\n\t\t\tdone,\n\t\t\trun() {\n\t\t\t\tconst frame: ReactiveCollectionSnapshotFrame<K, readonly unknown[]> =\n\t\t\t\t\treactiveCollectionSnapshotFrame(kind, snapshot, {\n\t\t\t\t\t\tchangeCursor: cursorValue.changeSeq,\n\t\t\t\t\t});\n\t\t\t\tassertReactiveCollectionSnapshotFrame(frame, kind);\n\t\t\t\treturn opts.snapshotStore.set(snapshotKey, frame).then(() => {\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tsnapshotWrites: cursorValue.snapshotWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction enqueueChange(change: PersistableChange<T, K>): void {\n\t\tconst changeLog = opts.changeLog;\n\t\tif (changeLog === undefined) return;\n\t\tenqueue({\n\t\t\tphase: \"change\",\n\t\t\trun() {\n\t\t\t\tconst frame: ReactiveCollectionChangeFrame<\n\t\t\t\t\tPersistableKind,\n\t\t\t\t\tPersistableChange<T, K>\n\t\t\t\t> = reactiveCollectionChangeFrame(kind, change);\n\t\t\t\tassertReactiveCollectionChangeFrame(frame, kind);\n\t\t\t\treturn changeLog.append(frame).then((written) => {\n\t\t\t\t\tconst entry = written as AppendLogEntry<\n\t\t\t\t\t\tReactiveCollectionChangeFrame<PersistableKind, PersistableChange<T, K>>\n\t\t\t\t\t>;\n\t\t\t\t\tcursorValue = {\n\t\t\t\t\t\t...cursorValue,\n\t\t\t\t\t\tchangeSeq: entry.seq,\n\t\t\t\t\t\tchangeWrites: cursorValue.changeWrites + 1,\n\t\t\t\t\t};\n\t\t\t\t\twrites += 1;\n\t\t\t\t\tpublish(\"ready\");\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t}\n\n\tfunction cancelQueuedForDispose(): void {\n\t\tconst pending = queue.splice(0);\n\t\tfor (const item of pending) callDone(item.done);\n\t}\n\n\tstop = (collection.delta as Node<PersistableChange<T, K>>).subscribe(\n\t\t(msg: Message, delivery?: DeliveryMeta) => {\n\t\t\tif (disposeRequested) return;\n\t\t\tconst change = dataOf<PersistableChange<T, K>>(msg);\n\t\t\tif (change === undefined) return;\n\t\t\tif (subscribing && delivery === undefined) return;\n\t\t\tobservedChangesSinceSnapshot += 1;\n\t\t\tenqueueChange(change);\n\t\t\tif (\n\t\t\t\tsnapshotEveryChanges !== undefined &&\n\t\t\t\tobservedChangesSinceSnapshot >= snapshotEveryChanges\n\t\t\t) {\n\t\t\t\tenqueueSnapshot();\n\t\t\t}\n\t\t},\n\t);\n\tsubscribing = false;\n\n\tif (opts.snapshotOnAttach !== false) enqueueSnapshot();\n\telse publish(\"ready\");\n\n\treturn {\n\t\tready,\n\t\tstatus,\n\t\terror,\n\t\tcursor,\n\t\tflush(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueue({ phase: \"flush\", done, run: () => undefined });\n\t\t},\n\t\tsnapshot(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed || disposeRequested) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tenqueueSnapshot(done);\n\t\t},\n\t\tdispose(done?: (status: ReactiveCollectionPersistenceStatus) => void): void {\n\t\t\tif (disposed) {\n\t\t\t\tcallDone(done);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tdisposeRequested = true;\n\t\t\tstop?.();\n\t\t\tcancelQueuedForDispose();\n\t\t\tenqueue({ phase: \"dispose\", done, run: () => undefined });\n\t\t},\n\t};\n}\n\nfunction collectionSnapshot<T, K extends PersistableKind>(\n\tcollection: PersistableCollection<T, K>,\n\tkind: K,\n): readonly unknown[] {\n\tif (kind === \"reactiveMap\") {\n\t\treturn [...(collection as ReactiveMap<unknown, unknown>).toMap()];\n\t}\n\tif (kind === \"reactiveIndex\") {\n\t\treturn (collection as ReactiveIndex<unknown, unknown>).toArray();\n\t}\n\treturn (collection as ReactiveList<T> | ReactiveLog<T>).toArray();\n}\n\ntype CollectionOptionsWithoutGraphName<T> = Omit<T, \"graph\" | \"name\">;\n\n/** Options for D161 load -> restore -> persist composition for reactiveList. */\nexport interface OpenPersistentReactiveListOptions<T>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveList\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly T[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveListOptions>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveLog. */\nexport interface OpenPersistentReactiveLogOptions<T>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveLog\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly T[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveLogOptions>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveMap. */\nexport interface OpenPersistentReactiveMapOptions<K, V>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveMap\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly (readonly [K, V])[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveMapOptions<K, V>>;\n}\n\n/** Options for D161 load -> restore -> persist composition for reactiveIndex. */\nexport interface OpenPersistentReactiveIndexOptions<K, V>\n\textends LoadReactiveCollectionStateOptions,\n\t\tOmit<\n\t\t\tPersistReactiveCollectionOptions<\"reactiveIndex\">,\n\t\t\t\"kind\" | \"snapshotStore\" | \"changeLog\" | \"initialChangeCursor\"\n\t\t> {\n\treadonly graph: Graph;\n\treadonly name?: string;\n\treadonly initial?: readonly IndexRow<K, V>[];\n\treadonly collection?: CollectionOptionsWithoutGraphName<ReactiveIndexOptions>;\n}\n\n/** Return value for D161 persistent reactiveList composition. */\nexport interface PersistentReactiveList<T> {\n\treadonly collection: ReactiveList<T>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveListRestoreState<T>;\n}\n\n/** Return value for D161 persistent reactiveLog composition. */\nexport interface PersistentReactiveLog<T> {\n\treadonly collection: ReactiveLog<T>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveLogRestoreState<T>;\n}\n\n/** Return value for D161 persistent reactiveMap composition. */\nexport interface PersistentReactiveMap<K, V> {\n\treadonly collection: ReactiveMap<K, V>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveMapRestoreState<K, V>;\n}\n\n/** Return value for D161 persistent reactiveIndex composition. */\nexport interface PersistentReactiveIndex<K, V> {\n\treadonly collection: ReactiveIndex<K, V>;\n\treadonly persistence: ReactiveCollectionPersistenceHandle;\n\treadonly loaded: ReactiveIndexRestoreState<K, V>;\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveList, then sidecar persist. */\nexport function openPersistentReactiveList<T = unknown>(\n\topts: OpenPersistentReactiveListOptions<T>,\n): Promise<PersistentReactiveList<T>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveListState<T>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveList<T>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<T, \"reactiveList\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveList\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveLog, then sidecar persist. */\nexport function openPersistentReactiveLog<T = unknown>(\n\topts: OpenPersistentReactiveLogOptions<T>,\n): Promise<PersistentReactiveLog<T>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveLogState<T>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveLog<T>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<T, \"reactiveLog\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveLog\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveMap, then sidecar persist. */\nexport function openPersistentReactiveMap<K = unknown, V = unknown>(\n\topts: OpenPersistentReactiveMapOptions<K, V>,\n): Promise<PersistentReactiveMap<K, V>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveMapState<K, V>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveMap<K, V>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<V, \"reactiveMap\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveMap\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n\n/** D161 convenience wrapper: passive load, sync restoreReactiveIndex, then sidecar persist. */\nexport function openPersistentReactiveIndex<K = unknown, V = unknown>(\n\topts: OpenPersistentReactiveIndexOptions<K, V>,\n): Promise<PersistentReactiveIndex<K, V>> {\n\tconst storagePrefix = opts.storagePrefix ?? opts.name ?? \"reactive-collection\";\n\tconst snapshotKey = opts.snapshotKey ?? collectionSnapshotKey(storagePrefix);\n\tconst loadOpts = { ...opts, snapshotKey, storagePrefix };\n\treturn loadReactiveIndexState<K, V>(loadOpts).then((loaded) => {\n\t\tconst state =\n\t\t\tloaded.source === \"empty\" && opts.initial !== undefined\n\t\t\t\t? { ...loaded, state: opts.initial }\n\t\t\t\t: loaded;\n\t\tconst collection = restoreReactiveIndex<K, V>(state, {\n\t\t\t...(opts.collection ?? {}),\n\t\t\tgraph: opts.graph,\n\t\t\tname: opts.name,\n\t\t});\n\t\tconst persistence = persistReactiveCollection<V, \"reactiveIndex\">(opts.graph, collection, {\n\t\t\t...opts,\n\t\t\tkind: \"reactiveIndex\",\n\t\t\tname: opts.name ? `${opts.name}/persistence` : undefined,\n\t\t\tsnapshotKey,\n\t\t\tstoragePrefix,\n\t\t\tinitialChangeCursor: loaded.changes.cursor,\n\t\t});\n\t\treturn { collection, persistence, loaded };\n\t});\n}\n","/**\n * Framework-neutral store adapters.\n *\n * Focused framework bindings build on this tiny Node-facing layer without\n * importing framework packages into the dependency-free adapters barrel\n * (D125/D238).\n */\n\nimport type { DeliveryMeta, Sink } from \"../ctx/types.js\";\nimport type { Node } from \"../node/node.js\";\n\n/** A minimal readable store contract shared by Svelte/Nanostores-style adapters. */\nexport interface ReadableStore<T> {\n\tget(): T | undefined;\n\tsubscribe(run: (value: T | undefined) => void): () => void;\n}\n\n/** A minimal writable store contract over a clean-slate writable node. */\nexport interface WritableStore<T> extends ReadableStore<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\n/** React `useSyncExternalStore`-compatible shape, without importing React. */\nexport interface ExternalStore<T> {\n\tgetSnapshot(): T | undefined;\n\tgetServerSnapshot(): T | undefined;\n\tsubscribe(onStoreChange: () => void): () => void;\n}\n\n/** Object-of-nodes factory used by record subscription adapters. */\nexport type NodeRecordFactory<K extends string, R extends Record<string, unknown>> = (key: K) => {\n\t[P in keyof R]: Node<R[P]>;\n};\n\n/** Zustand-compatible store API over a caller-owned clean-slate state node. */\nexport interface ZustandStoreApi<T extends object> {\n\tgetState(): T;\n\tsetState(partial: T | Partial<T> | ((state: T) => T | Partial<T>), replace?: boolean): void;\n\tgetInitialState(): T;\n\tsubscribe(listener: (state: T, prevState: T) => void): () => void;\n\tdestroy(): void;\n}\n\n/** Jotai-style atom facade over a caller-owned node. */\nexport interface JotaiAtom<T> {\n\tget(): T | undefined;\n\tsubscribe(callback: (value: T | undefined) => void): () => void;\n\treadonly _node: Node<T>;\n}\n\n/** Writable Jotai-style atom facade over a caller-owned writable node. */\nexport interface WritableJotaiAtom<T> extends JotaiAtom<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\n/** Nanostores-style atom facade over a caller-owned node. */\nexport interface NanoAtom<T> {\n\tget(): T | undefined;\n\tsubscribe(callback: (value: T | undefined) => void): () => void;\n\tlisten(callback: (value: T | undefined) => void): () => void;\n\treadonly _node: Node<T>;\n}\n\n/** Writable Nanostores-style atom facade over a caller-owned writable node. */\nexport interface WritableNanoAtom<T> extends NanoAtom<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\n/** TC39-Signals-style facade over a caller-owned node. */\nexport interface SignalLike<T> {\n\tget(): T | undefined;\n\tsubscribe(callback: (value: T | undefined) => void): () => void;\n\treadonly _node: Node<T>;\n}\n\n/** Writable TC39-Signals-style facade over a caller-owned writable node. */\nexport interface WritableSignalLike<T> extends SignalLike<T> {\n\tset(value: T): void;\n\tupdate(fn: (value: T | undefined) => T): void;\n}\n\nexport interface SubscribeValuesOptions<T> {\n\t/** Emit the current cache snapshot immediately. `undefined` means SENTINEL/no DATA. */\n\timmediate?: boolean;\n\t/** Suppress synchronous push-on-subscribe/replay DATA. Useful for change-only store listeners. */\n\tchangesOnly?: boolean;\n\tonError?: (error: unknown) => void;\n\tonComplete?: () => void;\n\t/** Custom cache reader for wrappers that keep their own snapshot object. */\n\tgetSnapshot?: () => T | undefined;\n}\n\nexport interface WritableNode<T> extends Node<T> {\n\tset(value: T): void;\n}\n\nexport interface WritableStoreOptions<T> extends SubscribeValuesOptions<T> {\n\t/** Override writes for adapters that need a framework-owned reducer. */\n\twrite?: (node: WritableNode<T>, value: T) => void;\n}\n\n/** Read a node cache without activating it. */\nexport function nodeSnapshot<T>(node: Node<T>): T | undefined {\n\treturn node.cache as T | undefined;\n}\n\n/**\n * Subscribe to DATA values from a Node. Protocol internals stay below the adapter boundary:\n * DATA drives value listeners, ERROR/COMPLETE route to optional lifecycle callbacks.\n */\nexport function subscribeNodeValues<T>(\n\tnode: Node<T>,\n\trun: (value: T | undefined) => void,\n\topts: SubscribeValuesOptions<T> = {},\n): () => void {\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\tif (opts.immediate) run(read());\n\n\tlet subscribing = true;\n\tconst skipSynchronousHandshakeData = opts.changesOnly || opts.immediate;\n\tconst sink: Sink = (msg, delivery?: DeliveryMeta) => {\n\t\tswitch (msg[0]) {\n\t\t\tcase \"DATA\":\n\t\t\t\tif (skipSynchronousHandshakeData && subscribing && delivery === undefined) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\trun(msg[1] as T);\n\t\t\t\treturn;\n\t\t\tcase \"ERROR\":\n\t\t\t\topts.onError?.(msg[1]);\n\t\t\t\treturn;\n\t\t\tcase \"COMPLETE\":\n\t\t\t\topts.onComplete?.();\n\t\t\t\treturn;\n\t\t}\n\t};\n\tconst unsubscribe = node.subscribe(sink);\n\tsubscribing = false;\n\treturn unsubscribe;\n}\n\n/** Build a Svelte/Nanostores-style readable store from a clean-slate Node. */\nexport function readableStore<T>(\n\tnode: Node<T>,\n\topts: SubscribeValuesOptions<T> = {},\n): ReadableStore<T> {\n\treturn {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (run) => subscribeNodeValues(node, run, { immediate: true, ...opts }),\n\t};\n}\n\nfunction hasWritableSet<T>(node: Node<T>): node is WritableNode<T> {\n\treturn typeof (node as { set?: unknown }).set === \"function\";\n}\n\nfunction defaultWrite<T>(node: WritableNode<T>, value: T): void {\n\tnode.set(value);\n}\n\n/** Build a writable store over a StateNode or compatible clean-slate writable Node. */\nexport function writableStore<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableStore<T>;\nexport function writableStore<T>(\n\tnode: Node<T>,\n\topts: WritableStoreOptions<T> & { write: (node: WritableNode<T>, value: T) => void },\n): WritableStore<T>;\nexport function writableStore<T>(\n\tnode: Node<T>,\n\topts: WritableStoreOptions<T> = {},\n): WritableStore<T> {\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\tconst write = opts.write ?? (hasWritableSet(node) ? defaultWrite : undefined);\n\tif (!write) {\n\t\tthrow new TypeError(\"writableStore: node must expose set(value) or opts.write\");\n\t}\n\tconst writable = node as WritableNode<T>;\n\treturn {\n\t\tget: read,\n\t\tsubscribe: (run) => subscribeNodeValues(node, run, { immediate: true, ...opts }),\n\t\tset: (value) => write(writable, value),\n\t\tupdate: (fn) => write(writable, fn(read())),\n\t};\n}\n\n/** Build the tiny shape React's `useSyncExternalStore` expects, without importing React. */\nexport function externalStore<T>(\n\tnode: Node<T>,\n\topts: Pick<SubscribeValuesOptions<T>, \"getSnapshot\" | \"onError\" | \"onComplete\"> = {},\n): ExternalStore<T> {\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\treturn {\n\t\tgetSnapshot: read,\n\t\tgetServerSnapshot: read,\n\t\tsubscribe: (onStoreChange) =>\n\t\t\tsubscribeNodeValues(node, () => onStoreChange(), {\n\t\t\t\tchangesOnly: true,\n\t\t\t\tonError: opts.onError,\n\t\t\t\tonComplete: opts.onComplete,\n\t\t\t}),\n\t};\n}\n\n/** Build a framework-neutral keyed record store for focused framework record bindings. */\nexport function recordReadableStore<K extends string, R extends Record<string, unknown>>(\n\tkeysNode: Node<readonly K[]>,\n\tfactory: NodeRecordFactory<K, R>,\n\topts: SubscribeValuesOptions<Record<K, R>> = {},\n): ReadableStore<Record<K, R>> {\n\tconst read = () => {\n\t\tconst keys = keysNode.cache ?? [];\n\t\tconst out = {} as Record<K, R>;\n\t\tfor (const key of keys) {\n\t\t\tconst nodes = factory(key);\n\t\t\tconst values = {} as R;\n\t\t\tfor (const field of Object.keys(nodes) as Array<keyof R>) {\n\t\t\t\tvalues[field] = nodes[field].cache as R[keyof R];\n\t\t\t}\n\t\t\tout[key] = values;\n\t\t}\n\t\treturn out;\n\t};\n\n\treturn {\n\t\tget: read,\n\t\tsubscribe(run) {\n\t\t\tconst entryUnsubs: Array<() => void> = [];\n\t\t\tconst cleanupEntries = () => {\n\t\t\t\tfor (const unsub of entryUnsubs.splice(0)) unsub();\n\t\t\t};\n\t\t\tconst sync = () => {\n\t\t\t\tcleanupEntries();\n\t\t\t\tfor (const key of keysNode.cache ?? []) {\n\t\t\t\t\tconst nodes = factory(key);\n\t\t\t\t\tfor (const field of Object.keys(nodes) as Array<keyof R>) {\n\t\t\t\t\t\tentryUnsubs.push(\n\t\t\t\t\t\t\tsubscribeNodeValues(nodes[field], () => run(read()), {\n\t\t\t\t\t\t\t\tchangesOnly: true,\n\t\t\t\t\t\t\t\tonError: opts.onError,\n\t\t\t\t\t\t\t\tonComplete: opts.onComplete,\n\t\t\t\t\t\t\t}),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trun(read());\n\t\t\t};\n\t\t\tconst keysUnsub = subscribeNodeValues(keysNode, sync, {\n\t\t\t\tchangesOnly: true,\n\t\t\t\tonError: opts.onError,\n\t\t\t\tonComplete: opts.onComplete,\n\t\t\t});\n\t\t\tsync();\n\t\t\treturn () => {\n\t\t\t\tkeysUnsub();\n\t\t\t\tcleanupEntries();\n\t\t\t};\n\t\t},\n\t};\n}\n\n/** Build a Zustand-compatible StoreApi over a caller-owned clean-slate state node. */\nexport function zustandStore<T extends object>(\n\tnode: WritableNode<T>,\n\tinitialState?: T,\n\topts?: WritableStoreOptions<T>,\n): ZustandStoreApi<T>;\nexport function zustandStore<T extends object>(\n\tnode: Node<T>,\n\tinitialState: T | undefined,\n\topts: WritableStoreOptions<T> & { write: (node: WritableNode<T>, value: T) => void },\n): ZustandStoreApi<T>;\nexport function zustandStore<T extends object>(\n\tnode: Node<T>,\n\tinitialState: T = nodeSnapshot(node) as T,\n\topts: WritableStoreOptions<T> = {},\n): ZustandStoreApi<T> {\n\tconst listeners = new Set<() => void>();\n\tconst read = opts.getSnapshot ?? (() => nodeSnapshot(node));\n\tconst write = opts.write ?? (hasWritableSet(node) ? defaultWrite : undefined);\n\tif (!write) {\n\t\tthrow new TypeError(\"zustandStore: node must expose set(value) or opts.write\");\n\t}\n\tconst writable = node as WritableNode<T>;\n\tconst api: ZustandStoreApi<T> = {\n\t\tgetState: () => read() as T,\n\t\tsetState(partial, replace) {\n\t\t\tconst prev = api.getState();\n\t\t\tconst next = typeof partial === \"function\" ? partial(prev) : partial;\n\t\t\twrite(writable, replace ? (next as T) : ({ ...prev, ...next } as T));\n\t\t},\n\t\tgetInitialState: () => initialState,\n\t\tsubscribe(listener) {\n\t\t\tlet prev = api.getState();\n\t\t\tconst unsub = subscribeNodeValues(\n\t\t\t\tnode,\n\t\t\t\t() => {\n\t\t\t\t\tconst next = api.getState();\n\t\t\t\t\tlistener(next, prev);\n\t\t\t\t\tprev = next;\n\t\t\t\t},\n\t\t\t\t{ changesOnly: true, onError: opts.onError, onComplete: opts.onComplete },\n\t\t\t);\n\t\t\tlisteners.add(unsub);\n\t\t\treturn () => {\n\t\t\t\tif (!listeners.delete(unsub)) return;\n\t\t\t\tunsub();\n\t\t\t};\n\t\t},\n\t\tdestroy() {\n\t\t\tfor (const unsub of [...listeners]) {\n\t\t\t\tlisteners.delete(unsub);\n\t\t\t\tunsub();\n\t\t\t}\n\t\t},\n\t};\n\treturn api;\n}\n\n/** Build a Jotai-style atom facade over a caller-owned node. */\nexport function jotaiAtom<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableJotaiAtom<T>;\nexport function jotaiAtom<T>(node: Node<T>, opts?: SubscribeValuesOptions<T>): JotaiAtom<T>;\nexport function jotaiAtom<T>(\n\tnode: Node<T> | WritableNode<T>,\n\topts: SubscribeValuesOptions<T> | WritableStoreOptions<T> = {},\n): JotaiAtom<T> | WritableJotaiAtom<T> {\n\tconst base: JotaiAtom<T> = {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (callback) => subscribeNodeValues(node, callback, { changesOnly: true, ...opts }),\n\t\t_node: node,\n\t};\n\tif (hasWritableSet(node) || typeof (opts as WritableStoreOptions<T>).write === \"function\") {\n\t\tconst writable = writableStore(\n\t\t\tnode,\n\t\t\topts as WritableStoreOptions<T> & {\n\t\t\t\twrite: (node: WritableNode<T>, value: T) => void;\n\t\t\t},\n\t\t);\n\t\treturn { ...base, set: writable.set, update: writable.update };\n\t}\n\treturn base;\n}\n\n/** Build a Nanostores-style atom facade over a caller-owned node. */\nexport function nanoAtom<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableNanoAtom<T>;\nexport function nanoAtom<T>(node: Node<T>, opts?: SubscribeValuesOptions<T>): NanoAtom<T>;\nexport function nanoAtom<T>(\n\tnode: Node<T> | WritableNode<T>,\n\topts: SubscribeValuesOptions<T> | WritableStoreOptions<T> = {},\n): NanoAtom<T> | WritableNanoAtom<T> {\n\tconst base: NanoAtom<T> = {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (callback) => subscribeNodeValues(node, callback, { immediate: true, ...opts }),\n\t\tlisten: (callback) => subscribeNodeValues(node, callback, { changesOnly: true, ...opts }),\n\t\t_node: node,\n\t};\n\tif (hasWritableSet(node) || typeof (opts as WritableStoreOptions<T>).write === \"function\") {\n\t\tconst writable = writableStore(\n\t\t\tnode,\n\t\t\topts as WritableStoreOptions<T> & {\n\t\t\t\twrite: (node: WritableNode<T>, value: T) => void;\n\t\t\t},\n\t\t);\n\t\treturn { ...base, set: writable.set, update: writable.update };\n\t}\n\treturn base;\n}\n\n/** Build a TC39-Signals-style facade over a caller-owned node. */\nexport function signalFromNode<T>(\n\tnode: WritableNode<T>,\n\topts?: WritableStoreOptions<T>,\n): WritableSignalLike<T>;\nexport function signalFromNode<T>(node: Node<T>, opts?: SubscribeValuesOptions<T>): SignalLike<T>;\nexport function signalFromNode<T>(\n\tnode: Node<T> | WritableNode<T>,\n\topts: SubscribeValuesOptions<T> | WritableStoreOptions<T> = {},\n): SignalLike<T> | WritableSignalLike<T> {\n\tconst base: SignalLike<T> = {\n\t\tget: () => (opts.getSnapshot ?? (() => nodeSnapshot(node)))(),\n\t\tsubscribe: (callback) => subscribeNodeValues(node, callback, { changesOnly: true, ...opts }),\n\t\t_node: node,\n\t};\n\tif (hasWritableSet(node) || typeof (opts as WritableStoreOptions<T>).write === \"function\") {\n\t\tconst writable = writableStore(\n\t\t\tnode,\n\t\t\topts as WritableStoreOptions<T> & {\n\t\t\t\twrite: (node: WritableNode<T>, value: T) => void;\n\t\t\t},\n\t\t);\n\t\treturn { ...base, set: writable.set, update: writable.update };\n\t}\n\treturn base;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACkCA,IAAI,QAAQ;AACZ,IAAM,eAA2B,CAAC;AAClC,IAAI,cAAc;AAGX,SAAS,YAAkB;AACjC;AACD;AAGO,SAAS,WAAiB;AAChC;AACA,MAAI,UAAU,KAAK,cAAc,aAAa,OAAQ,OAAM;AAC7D;AAWO,SAAS,YACf,MACA,OACA,UAAmC,CAAC,GAC7B;AACP,OAAK,oBAAoB,EAAE,OAAO,YAAY,QAAQ,YAAY,SAAS,QAAQ,QAAQ,CAAC;AAC5F,eAAa,KAAK,IAAI;AACvB;AAGO,SAAS,sBAAsB,MAAsB;AAC3D,WAAS,IAAI,GAAG,IAAI,KAAK,kBAAkB,GAAG,IAAK,cAAa,KAAK,IAAI;AACzE,MAAI,UAAU,KAAK,cAAc,aAAa,OAAQ,OAAM;AAC7D;AAaA,SAAS,QAAc;AAatB,MAAI,UAAiC;AACrC,SAAO,cAAc,aAAa,QAAQ;AACzC,UAAM,OAAO,aAAa,aAAa;AACvC,UAAM,OAAO,KAAK,kBAAkB;AACpC,QAAI,SAAS,OAAW;AACxB,QAAI,KAAK,eAAe,QAAW;AAIlC,YAAM,YAAa,KAAK,WAAuC,cAAc;AAC7E,UAAI,CAAC,UAAW;AAAA,IACjB;AACA,QAAI,KAAK,YAAY,UAAa,CAAC,KAAK,QAAQ,GAAG;AAClD,WAAK,oBAAoB,IAAI;AAC7B;AAAA,IACD;AACA;AACA,QAAI;AACH,WAAK,MAAM;AAAA,IACZ,SAAS,GAAG;AACX,UAAI,YAAY,KAAM,WAAU,EAAE,EAAE;AAAA,IACrC,UAAE;AACD;AAAA,IACD;AAAA,EACD;AACA,eAAa,SAAS;AACtB,gBAAc;AACd,MAAI,YAAY,KAAM,OAAM,QAAQ;AACrC;;;ACzFA,IAAI,SAA6B;AACjC,IAAI,gBAAoC;AAEjC,SAAS,eAAwB;AACvC,SAAO,WAAW;AACnB;AAEO,SAAS,4BAAgD;AAC/D,SAAO,UAAU,iBAAiB;AACnC;AAMO,SAAS,aAAa,QAAqB,WAA0B;AAC3E,MAAI,WAAW,KAAM,QAAO;AAC5B,MAAI,CAAC,OAAO,SAAS,IAAI,MAAM,EAAG,QAAO,MAAM,KAAK,MAAM;AAC1D,SAAO,SAAS,IAAI,QAAQ,SAAS;AACrC,SAAO;AACR;AAMO,SAAS,yBAAyB,QAAqB,IAAyB;AACtF,MAAI,WAAW,QAAQ,CAAC,OAAO,SAAS,IAAI,MAAM,EAAG,QAAO;AAC5D,QAAM,QAAQ;AACd,SAAO,gBAAgB,MAAM;AAC5B,QAAI,MAAM,UAAW,IAAG;AAAA,EACzB,GAAG,KAAK;AACR,SAAO;AACR;;;AC1BO,IAAM,WAAW;AAGjB,SAAS,sBAAsB,GAAqB;AAC1D,SAAO,MAAM,YAAY,OAAO,MAAM;AACvC;AAGO,SAAS,aAAa,QAAiB,WAAW,iCAA0C;AAClG,SAAO,sBAAsB,MAAM,IAAI,IAAI,MAAM,QAAQ,IAAI;AAC9D;AAEO,IAAM,aAAa;AACnB,IAAM,eAAe;AACrB,IAAM,oBAAoB;AAC1B,IAAM,aAAa;AACnB,IAAM,cAAc;AACpB,IAAM,gBAAgB;AACtB,IAAM,gBAAgB;AAM7B,IAAM,OAAoC;AAAA,EACzC,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,OAAO;AAAA,EACP,MAAM;AAAA,EACN,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,OAAO;AAAA,EACP,UAAU;AACX;AAEO,SAAS,YAAY,GAAwB;AACnD,SAAO,KAAK,CAAC;AACd;AAGO,SAAS,eAAe,GAAyB;AACvD,SAAO,KAAK,CAAC,KAAK;AACnB;AAGO,SAAS,YAAY,GAAyB;AACpD,SAAO,KAAK,CAAC,MAAM;AACpB;AAGO,SAAS,oBAAoB,GAAyB;AAC5D,QAAM,OAAO,KAAK,CAAC;AACnB,SAAO,SAAS,cAAc,SAAS;AACxC;AAQO,SAAS,WAAW,GAAyB;AACnD,SAAO,KAAK,CAAC,MAAM;AACpB;AAOO,SAAS,YAAY,GAAyB;AACpD,QAAM,OAAO,KAAK,CAAC;AACnB,SAAO,SAAS,cAAc,SAAS;AACxC;;;AC9FO,IAAM,gBAA+B,uBAAO,yBAAyB;AAOrE,IAAM,mBAAkC,uBAAO,4BAA4B;AAiB3E,SAAS,mBAAmB,GAAuB;AACzD,SAAO,MAAM;AACd;AAuGO,SAAS,SAAS,KAAkB;AAC1C,SAAO,IAAI,SAAS;AACrB;AAGO,SAAS,SAAS,KAAU,UAAmD;AACrF,SAAO,IAAI,SAAS,QAAQ,KAAK,CAAC;AACnC;AAGO,SAAS,SAAS,KAAU,UAA6C;AAC/E,QAAM,QAAQ,SAAS,KAAK,QAAQ;AACpC,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,YAAY,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,MAAM,QAAQ;AAC3D,SAAO,UAAU,WAAW,IAAI,CAAC,IAAI;AACtC;AAGO,SAAS,UAAU,KAAU,UAA2B;AAC9D,SAAO,IAAI,aAAa,GAAG,OAAO,QAAQ;AAC3C;AAGO,SAAS,YAAY,KAAU,UAA2B;AAChE,QAAM,IAAI,IAAI,SAAS,QAAQ;AAC/B,SAAO,MAAM,SAAY,QAAQ;AAClC;;;ACvIA,IAAM,YAAN,MAAgC;AAAA,EAC/B,YAAqB,MAAgB;AAAhB;AAAA,EAAiB;AAAA,EAC9B,MAA8B,CAAC;AAAA,EAC/B,OAAiB,CAAC;AAAA,EAC1B,SAAS,IAAoB;AAC5B,UAAM,SAAS,KAAK,KAAK,IAAI;AAC7B,QAAI,WAAW,QAAW;AACzB,WAAK,IAAI,MAAM,IAAI;AACnB,aAAO;AAAA,IACR;AACA,UAAM,KAAK,KAAK,IAAI;AACpB,SAAK,IAAI,KAAK,EAAE;AAChB,WAAO;AAAA,EACR;AAAA,EACA,WAAW,UAAwB;AAClC,QAAI,KAAK,IAAI,QAAQ,MAAM,OAAW;AACtC,SAAK,IAAI,QAAQ,IAAI;AACrB,SAAK,KAAK,KAAK,QAAQ;AAAA,EACxB;AAAA,EACA,OAAO,UAAkB,KAAgB;AAIxC,IAAC,KAAK,IAAI,QAAQ,EAAa,GAAG;AAAA,EACnC;AACD;AAcA,IAAM,UAAU,CAAC,MAAsB,GAAG,EAAE,MAAM,IAAI,EAAE,QAAQ;AAEzD,IAAM,aAAN,MAAiB;AAAA,EACf,QAAgB,CAAC;AAAA,EAChB;AAAA,EACA;AAAA;AAAA,EAGD,aAAa;AAAA,EACb,SAAS,oBAAI,IAAwB;AAAA,EACrC,gBAAgB;AAAA,EAExB,cAAc;AACb,SAAK,aAAa,KAAK,QAAQ,IAAI,UAAU,MAAM,CAAC;AACpD,SAAK,cAAc,KAAK,QAAQ,IAAI,UAAU,OAAO,CAAC;AAAA,EACvD;AAAA;AAAA,EAGA,aAAa,IAAmB;AAC/B,SAAK,aAAa;AAAA,EACnB;AAAA;AAAA,EAEA,aAAmB;AAClB,SAAK,OAAO,MAAM;AAClB,SAAK,gBAAgB;AAAA,EACtB;AAAA;AAAA,EAEA,QAAQ,QAAwC;AAC/C,WAAO,KAAK,OAAO,IAAI,QAAQ,MAAM,CAAC;AAAA,EACvC;AAAA;AAAA,EAEA,IAAI,eAAuB;AAC1B,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,QAAQ,MAAoB;AAC3B,UAAM,KAAK,KAAK,MAAM;AACtB,SAAK,MAAM,KAAK,IAAI;AACpB,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,SAAS,IAAY,OAA0B,QAAgB;AAC9D,UAAM,SAAS,SAAS,SAAS,KAAK,aAAa,SAAS,UAAU,KAAK,cAAc;AACzF,UAAM,WAAW,KAAK,MAAM,MAAM,EAAE,SAAS,EAAE;AAC/C,WAAO,EAAE,QAAQ,SAAS;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,WAAW,QAAsB;AAChC,SAAK,MAAM,OAAO,MAAM,EAAE,WAAW,OAAO,QAAQ;AAKpD,SAAK,OAAO,OAAO,QAAQ,MAAM,CAAC;AAAA,EACnC;AAAA;AAAA,EAGA,OAAO,QAAgB,KAAgB;AACtC,QAAI,CAAC,KAAK,YAAY;AACrB,WAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,UAAU,GAAG;AACrD;AAAA,IACD;AACA,SAAK;AACL,UAAM,KAAK,YAAY,IAAI;AAC3B,QAAI;AACH,WAAK,MAAM,OAAO,MAAM,EAAE,OAAO,OAAO,UAAU,GAAG;AAAA,IACtD,UAAE;AACD,YAAM,OAAO,YAAY,IAAI,IAAI,MAAM;AACvC,YAAM,MAAM,QAAQ,MAAM;AAC1B,YAAM,IAAI,KAAK,OAAO,IAAI,GAAG,KAAK;AAAA,QACjC,SAAS;AAAA,QACT,iBAAiB;AAAA,QACjB,gBAAgB;AAAA,MACjB;AACA,QAAE;AACF,QAAE,iBAAiB;AACnB,QAAE,mBAAmB;AACrB,WAAK,OAAO,IAAI,KAAK,CAAC;AAAA,IACvB;AAAA,EACD;AAAA,EAEA,SAAS,QAA0B;AAClC,WAAO,KAAK,MAAM,MAAM,EAAE;AAAA,EAC3B;AACD;AAGO,IAAM,oBAAoB,IAAI,WAAW;;;ACzDzC,IAAM,WAAN,MAAe;AAAA,EACb,SAAS;AAAA,EACA,QAA8C,CAAC;AAAA,EAC/C,SAAiD,CAAC;AAAA,EAClD,QAAsC,CAAC;AAAA,EACvC,WAA4C,CAAC;AAAA,EAC7C,aAAgD,CAAC;AAAA,EACjD,YAA+C,CAAC;AAAA,EAChD,gBAAiD,CAAC;AAAA,EAClD,QAAyC,CAAC;AAAA,EAC1C,WAA4C,CAAC;AAAA,EAC7C,gBAAiD,CAAC;AAAA,EAClD,WAA0B,EAAE,OAAO,CAAC,GAAG,MAAM,EAAE;AAAA,EAEhE,WACC,MACA,OACoC;AACpC,UAAM,KAAK,KAAK;AAChB,UAAM,OAAO,EAAE,GAAG,MAAM,GAAG;AAC3B,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,UAAU,EAAE,IAAI,MAAM;AAC3B,SAAK,WAAW,EAAE,IAAI,MAAM;AAC5B,SAAK,OAAO,EAAE,IAAI,MAAM;AACxB,SAAK,MAAM,EAAE,IAAI,MAAM;AACvB,SAAK,SAAS,EAAE,IAAI,MAAM;AAC1B,SAAK,cAAc,EAAE,IAAI,MAAM;AAC/B,SAAK,MAAM,EAAE,IAAI,MAAM;AACvB,SAAK,SAAS,EAAE,IAAI,MAAM;AAC1B,SAAK,cAAc,EAAE,IAAI,MAAM;AAC/B,WAAO,EAAE,IAAI,MAAM,KAAK;AAAA,EACzB;AAAA,EAEA,IAAO,IAAyB;AAC/B,UAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,QAAI,SAAS,OAAW,OAAM,IAAI,MAAM,6BAA6B;AACrE,WAAO;AAAA,EACR;AAAA,EAEA,SAAY,IAA2B;AACtC,UAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,oCAAoC;AAC7E,WAAO;AAAA,EACR;AAAA,EAEA,QAAQ,IAAuB;AAC9B,UAAM,OAAO,KAAK,MAAM,EAAE;AAC1B,QAAI,SAAS,OAAW,OAAM,IAAI,MAAM,mCAAmC;AAC3E,WAAO;AAAA,EACR;AAAA,EAEA,WAAW,IAA0B;AACpC,UAAM,UAAU,KAAK,SAAS,EAAE;AAChC,QAAI,YAAY,OAAW,OAAM,IAAI,MAAM,sCAAsC;AACjF,WAAO;AAAA,EACR;AAAA,EAEA,aAAa,IAA4B;AACxC,UAAM,YAAY,KAAK,WAAW,EAAE;AACpC,QAAI,cAAc,OAAW,OAAM,IAAI,MAAM,wCAAwC;AACrF,WAAO;AAAA,EACR;AAAA,EAEA,OAAO,IAA4B;AAClC,UAAM,MAAM,KAAK,UAAU,EAAE;AAC7B,QAAI,QAAQ,OAAW,OAAM,IAAI,MAAM,kCAAkC;AACzE,WAAO;AAAA,EACR;AAAA,EAEA,gBAAgB,IAA0B;AACzC,UAAM,QAAQ,KAAK,cAAc,EAAE;AACnC,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,sCAAsC;AAC/E,WAAO;AAAA,EACR;AAAA,EAEA,SAAS,IAA0B;AAClC,UAAM,QAAQ,KAAK,MAAM,EAAE;AAC3B,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,sCAAsC;AAC/E,WAAO;AAAA,EACR;AAAA,EAEA,WAAW,IAA0B;AACpC,UAAM,QAAQ,KAAK,SAAS,EAAE;AAC9B,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,kCAAkC;AAC3E,WAAO;AAAA,EACR;AAAA,EAEA,WAAW,IAA0B;AACpC,UAAM,QAAQ,KAAK,cAAc,EAAE;AACnC,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,sCAAsC;AAC/E,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,YAAY,IAAkB;AAC7B,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,UAAU,EAAE,IAAI;AACrB,SAAK,WAAW,EAAE,IAAI;AACtB,SAAK,OAAO,EAAE,IAAI;AAClB,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,SAAS,EAAE,IAAI;AACpB,SAAK,cAAc,EAAE,IAAI;AACzB,SAAK,MAAM,EAAE,IAAI;AACjB,SAAK,SAAS,EAAE,IAAI;AACpB,SAAK,cAAc,EAAE,IAAI;AAAA,EAC1B;AAAA;AAAA,EAGA,oBAAoB,MAA0B;AAC7C,SAAK,SAAS,MAAM,KAAK,IAAI;AAAA,EAC9B;AAAA;AAAA,EAGA,mBAA4B;AAC3B,WAAO,KAAK,SAAS,OAAO,KAAK,SAAS,MAAM;AAAA,EACjD;AAAA;AAAA,EAGA,oBAA4B;AAC3B,WAAO,KAAK,SAAS,MAAM,SAAS,KAAK,SAAS;AAAA,EACnD;AAAA;AAAA,EAGA,oBAA8C;AAC7C,QAAI,CAAC,KAAK,iBAAiB,GAAG;AAC7B,WAAK,SAAS,QAAQ,CAAC;AACvB,WAAK,SAAS,OAAO;AACrB,aAAO;AAAA,IACR;AACA,UAAM,OAAO,KAAK,SAAS,MAAM,KAAK,SAAS,MAAM;AACrD,QAAI,CAAC,KAAK,iBAAiB,GAAG;AAC7B,WAAK,SAAS,QAAQ,CAAC;AACvB,WAAK,SAAS,OAAO;AAAA,IACtB;AACA,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,oBAAoB,MAA0B;AAC7C,UAAM,YAAY,KAAK,SAAS,MAAM,MAAM,KAAK,SAAS,IAAI;AAC9D,SAAK,SAAS,QAAQ,CAAC,MAAM,GAAG,SAAS;AACzC,SAAK,SAAS,OAAO;AAAA,EACtB;AAAA;AAAA,EAGA,0BAA0B,YAA0B;AACnD,UAAM,YAAY,KAAK,SAAS,MAC9B,MAAM,KAAK,SAAS,IAAI,EACxB,OAAO,CAAC,SAAS,KAAK,eAAe,UAAU;AACjD,SAAK,SAAS,QAAQ;AACtB,SAAK,SAAS,OAAO;AAAA,EACtB;AACD;AAEO,SAAS,mBAAmBA,WAAkC;AACpE,SAAO;AAAA,IACN,OAAO,IAAI,MAAMA,SAAQ,EAAE,KAAK,IAAI;AAAA,IACpC,UAAU,MAAM,KAAK,EAAE,QAAQA,UAAS,GAAG,MAAM,CAAC,CAAC;AAAA,IACnD,YAAY,IAAI,MAAMA,SAAQ,EAAE,KAAK,MAAS;AAAA,IAC9C,MAAM,IAAI,MAAMA,SAAQ,EAAE,KAAK,QAAQ;AAAA,IACvC,SAAS,IAAI,MAAMA,SAAQ,EAAE,KAAK,KAAK;AAAA,IACvC,OAAO,IAAI,MAAMA,SAAQ,EAAE,KAAK,KAAK;AAAA,IACrC,MAAM,IAAI,MAAMA,SAAQ,EAAE,KAAK,CAAC;AAAA,IAChC,UAAU,IAAI,MAAMA,SAAQ,EAAE,KAAK,MAAS;AAAA,IAC5C,eAAe,IAAI,MAAMA,SAAQ,EAAE,KAAK,MAAS;AAAA,IACjD,QAAQ,CAAC;AAAA,IACT,UAAU,CAAC;AAAA,EACZ;AACD;;;ACrGO,IAAM,qBAAN,MAAM,oBAAmB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,OAA+B,CAAC,GAAG;AAC9C,SAAK,UAAU,KAAK;AACpB,SAAK,OAAO,KAAK;AACjB,SAAK,MAAM,KAAK;AAChB,SAAK,YAAY,KAAK;AACtB,SAAK,UAAU,KAAK;AACpB,WAAO,OAAO,IAAI;AAAA,EACnB;AAAA,EAEA,OAAO,QAA4B;AAClC,WAAO;AAAA,EACR;AAAA,EAEA,YAAY,QAAgD;AAC3D,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,SAAS,OAAO,CAAC;AAAA,EAC3D;AAAA,EAEA,SAAS,QAA6C;AACrD,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,MAAM,OAAO,CAAC;AAAA,EACxD;AAAA,EAEA,QAAQ,QAA4C;AACnD,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,KAAK,OAAO,CAAC;AAAA,EACvD;AAAA,EAEA,cAAc,QAAkD;AAC/D,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,WAAW,OAAO,CAAC;AAAA,EAC7D;AAAA,EAEA,YAAY,QAAgD;AAC3D,WAAO,IAAI,oBAAmB,EAAE,GAAG,MAAM,SAAS,OAAO,CAAC;AAAA,EAC3D;AAAA,EAEA,gBAAgD;AAC/C,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,aAA0C;AACzC,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,YAAwC;AACvC,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,kBAAoD;AACnD,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,gBAAgD;AAC/C,WAAO,KAAK;AAAA,EACb;AACD;AAEA,IAAM,oBAAoB,IAAI,mBAAmB;;;ACxP1C,SAAS,aAAa,GAAqB;AACjD,SAAO,MAAM,SAAY,QAAQ;AAClC;AAEO,SAAS,oBAAoB,QAAgC;AACnE,MAAI,OAAO,WAAW,YAAY,WAAW,QAAQ,MAAM,QAAQ,MAAM,GAAG;AAC3E,UAAM,IAAI,MAAM,iEAAiE;AAAA,EAClF;AACA,QAAM,SAAU,OAAgC;AAChD,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,UAAU;AAC7D,UAAM,IAAI,MAAM,+DAA+D;AAAA,EAChF;AACA,QAAM,SAAU,OAAgC;AAChD,SAAO,WAAW,SAAY,EAAE,OAAO,IAAI,EAAE,QAAQ,OAAO;AAC7D;AAEO,SAAS,qBAAqB,MAAkB;AACtD,aAAW,KAAK,MAAM;AACrB,QAAI,EAAE,CAAC,MAAM,UAAU,EAAE,CAAC,MAAM,QAAW;AAC1C,YAAM,IAAI,MAAM,6DAA6D;AAAA,IAC9E;AACA,QAAI,EAAE,CAAC,MAAM,WAAW,sBAAsB,EAAE,CAAC,CAAC,GAAG;AACpD,YAAM,IAAI,MAAM,2EAA2E;AAAA,IAC5F;AAAA,EACD;AACD;;;AChBA,IAAI;AACJ,IAAI;AACG,IAAM,cAAc,oBAAI,QAAgC;AACxD,IAAM,+BAA+B,oBAAI,QAG9C;AACK,IAAM,oBAAoB,oBAAI,QAAkD;AAChF,IAAM,iBAAiB,oBAAI,QAA0D;AACrF,IAAM,mBAAmB,oBAAI,QAAmC;AAChE,IAAM,2BAA2B,oBAAI,QAAsC;AAC3E,IAAM,yBAAyB,oBAAI,QAAqC;AACxE,IAAM,oBAAoB,oBAAI,QAAsC;AACpE,IAAM,gBAAgB,oBAAI,QAAuB;AAGjD,SAAS,aACf,MACA,QACQ;AACR,QAAM,OAAO;AACb,qBAAmB;AACnB,MAAI;AACH,WAAO,OAAO;AAAA,EACf,UAAE;AACD,uBAAmB;AAAA,EACpB;AACD;AAGO,SAAS,2BAAiD;AAChE,QAAM,OAAO;AACb,qBAAmB;AACnB,SAAO;AACR;AAGO,SAAS,uBACf,aACA,QACQ;AACR,QAAM,OAAO;AACb,4BAA0B;AAC1B,MAAI;AACH,WAAO,OAAO;AAAA,EACf,UAAE;AACD,8BAA0B;AAAA,EAC3B;AACD;AAGO,SAAS,qCAAqE;AACpF,QAAM,cAAc;AACpB,4BAA0B;AAC1B,SAAO;AACR;AAGO,SAAS,aAAa,GAA2B;AACvD,SAAO,YAAY,IAAI,CAAC;AACzB;AAeO,SAAS,0BACfC,OACA,UACA,MACO;AACP,+BAA6B,IAAIA,KAAI,IAAIA,OAAM,UAAU,IAAI;AAC9D;AAiBO,SAAS,qBAAqB,GAAwB;AAC5D,mBAAiB,IAAI,CAAC,IAAI;AAC3B;AAkBO,SAAS,sBAAsB,GAA2B;AAChE,SAAO,cAAc,IAAI,CAAC;AAC3B;;;ACpHO,SAAS,aAAgB,MAA+B;AAC9D,QAAM,OAAO,KAAK,MAAM,SACrB,KAAK,MAAM,WAAW,SAAS,KAAK,MAAM,OAAO,MAAM,IACvD;AACH,MAAI,SAAS,QAAQ;AACpB,QAAI,KAAK,aAAa,KAAM,MAAK,WAAW,KAAK,SAAS;AAC1D,SAAK,YAAY,KAAK,QAAQ;AAC9B,WAAO,KAAK;AAAA,EACb;AAEA,SAAO,KAAK,SAAS;AAAA,IACpB,UAAU,KAAK,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AAAA,IACpE,UAAU,KAAK,KAAK,cAAc,IAAI,YAAY;AAAA,IAClD,QAAQ,CAAC,GAAG,KAAK,KAAK,IAAI;AAAA,EAC3B,CAAC;AACF;AAEO,SAAS,YACf,MACA,UACM;AACN,QAAM,MAAW;AAAA;AAAA;AAAA;AAAA,IAIhB,IAAI,CAAC,MAAM,cAAc;AACxB,UAAI,KAAK,UAAW;AACpB,gBAAU;AACV,UAAI;AACH,aAAK,IAAI,MAAM,SAAS;AAAA,MACzB,UAAE;AACD,iBAAS;AAAA,MACV;AAAA,IACD;AAAA,IACA,MAAM,CAAC,SAAS;AACf,UAAI,KAAK,UAAW;AACpB,gBAAU;AACV,UAAI;AACH,aAAK,MAAM,IAAI;AAAA,MAChB,UAAE;AACD,iBAAS;AAAA,MACV;AAAA,IACD;AAAA,IACA,UAAU,UAAU,YAAY,KAAK,KAAK;AAAA,IAC1C,UAAU,UAAU,YAAY,KAAK,KAAK,cAAc,IAAI,YAAY;AAAA,IACxE,OAAO,KAAK,WAAW;AAAA,IACvB,gBAAgB,CAAC,OAAO;AACvB,UAAI,KAAK,UAAW;AACpB,WAAK,OAAO,eAAe,KAAK,EAAE;AAAA,IACnC;AAAA,IACA,cAAc,CAAC,OAAO;AACrB,UAAI,KAAK,UAAW;AACpB,WAAK,OAAO,aAAa,KAAK,EAAE;AAAA,IACjC;AAAA,IACA,aAAa,MAAM,KAAK,MAAM;AAAA;AAAA,IAE9B,YAAY;AAAA,MACX,cAAc,CAAC,KAAK,OAAO,KAAK,mBAAmB,EAAE,MAAM,OAAO,KAAK,GAAG,CAAC;AAAA,MAC3E,gBAAgB,CAAC,KAAK,OAAO,KAAK,mBAAmB,EAAE,MAAM,UAAU,KAAK,GAAG,CAAC;AAAA,MAChF,aAAa,CAAC,MAAM,OAAO,KAAK,mBAAmB,EAAE,MAAM,OAAO,MAAM,GAAG,CAAC;AAAA,IAC7E;AAAA;AAAA;AAAA;AAAA,IAIA,QAAQ,CAAC,MAAM,cAAc,KAAK,eAAe,MAAM,SAAS;AAAA,IAChE,GAAI,KAAK,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,MAAM,KAAK,SAAS,WAAW;AAAA,IACnF,CAAC,aAAa,GAAG,EAAE,QAAQ,UAAU,UAAU,KAAK,KAAK,KAAK;AAAA,IAC9D,CAAC,gBAAgB,GAAG;AAAA,MACnB,YAAY,KAAK,MAAM;AAAA,MACvB,QAAQ,CAAI,YACX,uBAAuB,KAAK,MAAM,aAAa,MAAM,aAAa,KAAK,OAAO,OAAO,CAAC;AAAA,IACxF;AAAA,EACD;AACA,MAAI,KAAK,MAAM,SAAS;AAIvB,QAAI,QAAQ,CAAC,MAAc,IAAI,aAAa,GAAG,OAAO,CAAC;AAAA,EACxD;AACA,SAAO;AACR;AAEO,SAAS,eAAkB,MAA0B,KAAgB;AAC3E,EAAC,IAA+B,WAAW,KAAK,KAAK;AACrD,EAAC,IAAmC,WAAW,KAAK,KAAK,cAAc,IAAI,YAAY;AACvF,MAAI,KAAK,SAAS,eAAe,QAAW;AAC3C,WAAQ,IAA8B;AAAA,EACvC,OAAO;AACN,IAAC,IAA8B,OAAO,KAAK,SAAS;AAAA,EACrD;AACA,MAAI,aAAa,IAAI,EAAE,QAAQ,KAAK,KAAK,KAAK;AAC/C;AAEO,SAAS,cAAiB,MAAoC;AACpE,SAAO;AAAA,IACN,KAAK,MAAS,KAAK,cAAc;AAAA,IACjC,KAAK,CAAI,MAAS;AACjB,WAAK,cAAc,QAAQ;AAAA,IAC5B;AAAA,IACA,SAAS,CAAC,KAAK,SAAS;AACvB,WAAK,cAAc,UAAU;AAAA,IAC9B;AAAA,EACD;AACD;;;AChHO,SAAS,wBACf,MACA,KACA,UACY;AACZ,QAAM,QAAQ,UAAU,QAAQ,CAAC;AACjC,MAAI,KAAK,KAAK,WAAW,GAAG,MAAM,OAAO;AACxC,SAAK,KAAK,SAAS,GAAG,EAAE,KAAK,CAAC,CAAC;AAC/B,SAAK,KAAK,WAAW,GAAG,IAAI;AAAA,EAC7B;AACA,SAAO,KAAK,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,SAAS,GAAG,EAAE,SAAS,CAAC;AAClE;AAEO,SAAS,yBAA4B,MAA0B,KAAsB;AAC3F,QAAM,aAAa,KAAK,KAAK,SAAS,GAAG,EAAE,KAAK,KAAK,SAAS,GAAG,EAAE,SAAS,CAAC;AAC7E,SAAO,YAAY,KAAK,CAAC,MAAM,MAAM,QAAQ,KAAK;AACnD;AAEO,SAAS,mBACf,MACA,KACA,KACA,UACO;AACP,MAAI,KAAK,UAAW;AACpB,QAAM,IAAI,IAAI,CAAC;AACf,MAAI,MAAM,QAAS;AACnB,QAAM,wBAAwB,UAAU,QAAQ;AAGhD,MAAI,KAAK,OAAO,aAAa,QAAW;AACvC,QAAI,MAAM,WAAY,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAC/C;AAAA,EACD;AAEA,MAAI,MAAM,cAAc;AACvB,UAAM,aAAa,KAAK,qBAAqB,KAAK,QAAQ;AAC1D,eAAW,KAAK,QAAQ;AACxB,QAAI,WAAW,KAAK,CAAC,MAAM,MAAM,QAAQ,KAAK,sBAAuB,MAAK,UAAU;AAGpF,SAAK,KAAK,KAAK,GAAG,IAAI;AACtB,SAAK,KAAK,QAAQ,GAAG,IAAI;AACzB,SAAK,KAAK,MAAM,GAAG,IAAI;AAIvB,QAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,WAAK,KAAK,MAAM,GAAG,IAAI;AACvB,WAAK,MAAM;AAAA,IACZ;AAOA,QAAI,KAAK,SAAS,yBAAyB,KAAK,KAAK,MAAM,MAAM,CAAC,MAAM,MAAM,IAAI,GAAG;AACpF,WAAK,SAAS,wBAAwB;AAAA,IACvC;AACA,UAAM,UAAU,KAAK,OAAO;AAC5B,SAAK,YAAY;AAIjB,QAAI,KAAK,MAAM,YAAY,KAAK,KAAK,MAAM,sBAAsB;AAChE,UAAI,CAAC,QAAS,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,UAClC,MAAK,MAAM,uBAAuB;AAAA,IACxC;AACA,SAAK,uBAAuB;AAC5B;AAAA,EACD;AAEA,MAAI,WAAW,CAAC,GAAG;AAKlB,UAAM,UAAU,MAAM;AACtB,UAAM,aAAa,UAAW,IAAoC,CAAC,IAAI;AACvE,SAAK,KAAK,SAAS,GAAG,IAAI,UAAU,aAAa;AACjD,SAAK,KAAK,cAAc,GAAG,IAAI,UAAU,aAAa;AAKtD,SAAK,iBAAiB,GAAG;AACzB,UAAM,yBAAyB,KAAK,sBAAsB,GAAG,KAAK;AAClE,QAAI,uBAAwB,MAAK,UAAU;AAC3C,QAAI,WAAW,KAAK,MAAM,oBAAoB;AAC7C,WAAK,MAAM,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC;AAAA,IACnC,WAAW,KAAK,MAAM,qBAAqB;AAC1C,UAAI,wBAAwB;AAC3B,aAAK,uBAAuB;AAC5B;AAAA,MACD;AACA,WAAK,UAAU;AAAA,IAChB,WAAW,KAAK,MAAM,4BAA4B,KAAK,iBAAiB,GAAG;AAK1E,WAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IAC1B,OAAO;AAGN,WAAK,6BAA6B;AAAA,IACnC;AACA,SAAK,uBAAuB;AAC5B;AAAA,EACD;AAEA,MAAI,MAAM,YAAY;AACrB,SAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AACzB;AAAA,EACD;AAEA,MAAI,MAAM,SAAS;AAClB,QAAI,CAAC,KAAK,KAAK,MAAM,GAAG,GAAG;AAC1B,WAAK,KAAK,MAAM,GAAG,IAAI;AACvB,WAAK,MAAM;AACX,WAAK,KAAK,KAAK,GAAG,IAAI;AACtB,WAAK,WAAW;AAAA,IACjB;AACA;AAAA,EACD;AAEA,MAAI,MAAM,QAAQ;AACjB,UAAM,IAAI,IAAI,CAAC;AACf,SAAK,qBAAqB,KAAK,QAAQ,EAAE,KAAK,CAAC;AAC/C,UAAM,IAAI,KAAK,KAAK,MAAM,GAAG;AAC7B,QAAI,MAAM,KAAM,MAAK,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC;AAAA,QACpC,GAAE,KAAK,CAAC;AACb,SAAK,KAAK,KAAK,GAAG,IAAI;AACtB,SAAK,KAAK,QAAQ,GAAG,IAAI;AACzB,SAAK,KAAK,KAAK,GAAG,IAAI;AACtB,QAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,WAAK,KAAK,MAAM,GAAG,IAAI;AACvB,WAAK,MAAM;AAAA,IACZ;AACA,QAAI,sBAAuB,MAAK,UAAU;AAC1C,SAAK,uBAAuB;AAC5B;AAAA,EACD;AAEA,MAAI,MAAM,YAAY;AACrB,SAAK,qBAAqB,KAAK,QAAQ;AACvC,SAAK,KAAK,KAAK,GAAG,IAAI;AACtB,QAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,WAAK,KAAK,MAAM,GAAG,IAAI;AACvB,WAAK,MAAM;AAAA,IACZ;AACA,QAAI,sBAAuB,MAAK,UAAU;AAC1C,SAAK,uBAAuB;AAC5B;AAAA,EACD;AAGD;AAEO,SAAS,oBAAuB,MAA0B,KAAmB;AACnF,MAAI,KAAK,KAAK,MAAM,GAAG,GAAG;AACzB,SAAK,KAAK,MAAM,GAAG,IAAI;AACvB,SAAK,MAAM;AAAA,EACZ;AACD;AAEO,SAAS,gCAAmC,MAAgC;AAClF,MAAI,KAAK,MAAM,YAAY,KAAK,CAAC,KAAK,MAAM,qBAAsB;AAIlE,QAAM,UAAU,KAAK,KAAK,MAAM,KAAK,CAAC,MAAM,MAAM,QAAQ,EAAE,SAAS,CAAC;AACtE,MAAI,QAAS,MAAK,UAAU;AAO5B,MAAI,KAAK,MAAM,qBAAsB,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAC/D;AAEO,SAAS,cAAiB,MAAgC;AAChE,OAAK,OAAO,SAAS;AAMrB,MAAI,KAAK,aAAa,EAAG;AACzB,MAAI,CAAC,KAAK,MAAM,sBAAsB;AACrC,SAAK,MAAM,uBAAuB;AAClC,SAAK,YAAY,CAAC,OAAO,CAAC;AAAA,EAC3B;AACD;AAEO,SAAS,aAAgB,MAAgC;AAK/D,MAAI,KAAK,MAAM,eAAe;AAC7B,SAAK,MAAM,mBAAmB;AAC9B;AAAA,EACD;AAGA,MAAI,KAAK,MAAM,aAAa,SAAS,KAAK,UAAU,KAAK,KAAK,aAAa,IAAI;AAC9E,SAAK,SAAS,wBAAwB;AACtC;AAAA,EACD;AACA,OAAK,QAAQ;AACd;AAEO,SAAS,iBAAoB,MAAgC;AACnE,MAAI,KAAK,MAAM,aAAa,QAAQ,KAAK,UAAU,GAAG;AACrD,SAAK,SAAS,wBAAwB;AACtC;AAAA,EACD;AACA,MAAI,KAAK,MAAM,UAAU,EAAG;AAC5B,MAAI,KAAK,MAAM,WAAW,MAAM;AAC/B,SAAK,iBAAiB;AACtB;AAAA,EACD;AACA,MAAI,CAAC,KAAK,MAAM,mBAAmB,EAAE,KAAK,MAAM,WAAW,KAAK,gBAAgB,GAAI;AACpF,OAAK,WAAW;AAChB,OAAK,SAAS;AACf;AAEO,SAAS,WAAc,MAAgC;AAC7D,MAAI,KAAK,MAAM,UAAU,EAAG;AAC5B,MAAI,KAAK,MAAM,WAAW,MAAM;AAE/B,SAAK,iBAAiB;AACtB;AAAA,EACD;AACA,MAAI,CAAC,KAAK,MAAM,iBAAiB;AAChC,QAAI,KAAK,MAAM,WAAW,KAAK,gBAAgB,EAAG,MAAK,SAAS;AAEhE;AAAA,EACD;AACA,OAAK,SAAS;AACf;AAEO,SAAS,mBAAsB,MAAmC;AACxE,WAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK,QAAQ,KAAK;AAChD,QAAI,KAAK,KAAK,QAAQ,CAAC,EAAG;AAC1B,QAAI,KAAK,MAAM,uBAAuB,KAAK,KAAK,SAAS,CAAC,MAAM,OAAW;AAC3E,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAEO,SAAS,oBAAuB,MAAgC;AAEtE,QAAM,IAAI,KAAK,KAAK,MAAM,CAAC;AAC3B,MAAI,MAAM,QAAQ,EAAE,SAAS,GAAG;AAC/B,SAAK,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;AAAA,EACvC,WAAW,KAAK,MAAM,sBAAsB;AAO3C,SAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,EAC1B;AACA,OAAK,KAAK,MAAM,CAAC,IAAI;AACrB,OAAK,MAAM,uBAAuB;AACnC;AAEO,SAAS,YAAe,MAAgC;AAO9D,MAAI,KAAK,MAAM;AACd,UAAM,IAAI;AAAA,MACT;AAAA,IACD;AACD,OAAK,MAAM,kBAAkB;AAM7B,OAAK,OAAO,eAAe,CAAC;AAC5B,OAAK,OAAO,iBAAiB,CAAC;AAC9B,QAAM,MAAM,KAAK,UAAU;AAC3B,QAAM,WAAW,KAAK,MAAM;AAC5B,OAAK,MAAM,wBAAwB;AACnC,OAAK,MAAM,gBAAgB;AAC3B,MAAI;AACH,SAAK,MAAM,WAAW,OAAO,KAAK,MAAM,QAAkB,GAAG;AAAA,EAC9D,UAAE;AACD,SAAK,MAAM,gBAAgB;AAAA,EAC5B;AAWA,MACC,YACA,CAAC,KAAK,MAAM,yBACZ,KAAK,OAAO,aAAa,UACzB,CAAC,KAAK,aAAa,GAClB;AACD,SAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,EAC1B;AAGA,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK,MAAM,QAAQ,KAAK;AAChD,SAAK,KAAK,MAAM,CAAC,IAAI;AACrB,SAAK,KAAK,SAAS,CAAC,IAAI,CAAC;AACzB,SAAK,KAAK,WAAW,CAAC,IAAI;AAC1B,SAAK,KAAK,cAAc,CAAC,IAAI;AAAA,EAC9B;AACA,OAAK,MAAM,uBAAuB;AACnC;;;AChPO,SAAS,gBAAmBC,OAAmC;AACrE,SAAOA;AACR;;;AChFO,SAAS,aAAgB,MAAgC;AAC/D,OAAK,WAAW,YAAY;AAC5B,QAAM,mBAAmB,KAAK;AAC9B,OAAK,6BAA6B;AAGlC,OAAK,KAAK,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK,MAAM;AACnD,OAAK,KAAK,WAAW,IAAI,MAAM,KAAK,MAAM,KAAK,MAAM;AACrD,aAAW,OAAO,KAAK,MAAM,KAAM,MAAK,gBAAgB,KAAK,EAAE,cAAc,iBAAiB,CAAC;AAE/F,MAAI,KAAK,MAAM,KAAK,WAAW,KAAK,KAAK,MAAM,WAAW,QAAQ,CAAC,KAAK,MAAM,iBAAiB;AAC9F,SAAK,SAAS;AAAA,EACf;AACD;AAEO,SAAS,mBACf,MACA,SACA,OAAmC,CAAC,GAC7B;AACP,QAAM,OAAO,KAAK,MAAM,KAAK,QAAQ,OAAO;AAC5C,QAAM,MAAM,EAAE,GAAG,KAAK;AACtB,MAAI,oBAAoB,KAAK,iBAAiB;AAC9C,MAAI,qBAAqB,SAAS,IAAI;AACrC,SAAK,mBAAmB,MAAM,OAAO;AACrC,UAAM,MAAM,gBAAgB,OAAO;AACnC,QAAI,IAAI,OAAO,aAAa,UAAa,CAAC,IAAI,MAAM,gBAAgB;AACnE,WAAK,KAAK,OAAO,IAAI,IAAI,MAAM;AAAA,MAAC;AAChC,WAAK,KAAK,SAAS,IAAI,IAAI;AAC3B;AAAA,IACD;AAAA,EACD;AACA,QAAM,QAAQ,QAAQ,UAAU,CAAC,KAAK,aAAa;AAClD,QAAI,qBAAqB,aAAa,OAAW;AACjD,QAAI,kBAAmB,qBAAoB;AAC3C,QAAI,IAAI,MAAM,GAAI;AAClB,SAAK,gBAAgB,IAAI,GAAG,KAAK,QAAQ;AAAA,EAC1C,CAAC;AACD,MAAI,qBAAqB,SAAS,MAAM,IAAI,MAAM,GAAI,MAAK,mBAAmB,MAAM,OAAO;AAC3F,sBAAoB;AACpB,MAAI,SAAS,IAAI;AAChB,SAAK,KAAK,OAAO,IAAI,IAAI;AACzB,SAAK,KAAK,SAAS,IAAI,IAAI;AAAA,EAC5B;AACD;AAEO,SAAS,sBACf,MACA,KACA,SACO;AACP,QAAM,MAAM,gBAAgB,OAAO;AACnC,QAAM,WAAW,IAAI,OAAO,WAAW,CAAC,IAAI,MAAM;AAClD,OAAK,KAAK,MAAM,GAAG,IAAI;AACvB,OAAK,KAAK,SAAS,GAAG,IAAI,CAAC;AAC3B,OAAK,KAAK,WAAW,GAAG,IAAI;AAC5B,OAAK,KAAK,KAAK,GAAG,IAAI,WAAW,IAAI,OAAO,QAAQ;AACpD,OAAK,KAAK,QAAQ,GAAG,IAAI;AACzB,OAAK,KAAK,MAAM,GAAG,IAAI;AACvB,OAAK,KAAK,KAAK,GAAG,IAAI,WAAW,IAAI;AACrC,OAAK,KAAK,SAAS,GAAG,IAAI,IAAI,OAAO;AACrC,OAAK,KAAK,cAAc,GAAG,IAAI;AAChC;AAEO,SAAS,eAAkB,MAAgC;AACjE,OAAK,WAAW,YAAY;AAC5B,aAAW,KAAK,KAAK,KAAK,OAAQ,KAAI,EAAG,GAAE;AAC3C,OAAK,KAAK,SAAS,CAAC;AACpB,OAAK,KAAK,WAAW,CAAC;AACtB,aAAW,MAAM,KAAK,OAAO,eAAgB,IAAG;AAChD,OAAK,OAAO,iBAAiB,CAAC;AAC9B,OAAK,OAAO,eAAe,CAAC;AAE5B,QAAM,YAAY,KAAK,MAAM,WAAW,QAAQ,KAAK,MAAM,KAAK,SAAS;AACzE,MAAI,WAAW;AAEd,SAAK,OAAO,QAAQ;AACpB,SAAK,OAAO,UAAU;AACtB,SAAK,OAAO,SAAS;AAAA,EACtB;AACA,OAAK,eAAe;AACpB,OAAK,MAAM,kBAAkB;AAC7B,OAAK,SAAS,aAAa,MAAM;AACjC,OAAK,SAAS,cAAc,CAAC;AAC7B,OAAK,SAAS,wBAAwB;AACtC,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,gBAAgB;AAC9B,OAAK,OAAO,aAAa,CAAC;AAC1B,MAAI,CAAC,KAAK,cAAc,QAAS,MAAK,cAAc,QAAQ;AAC7D;AAEO,SAAS,oBAAuB,MAAkC;AACxE,SAAO,KAAK,WAAW,YAAY;AACpC;AAEO,SAAS,iCAAoC,MAAmC;AACtF,SACC,CAAC,KAAK,aACN,KAAK,OAAO,WAAW,WACvB,KAAK,OAAO,WAAW,aACvB,KAAK,MAAM,YAAY,KACvB,CAAC,KAAK,MAAM,iBACZ,CAAC,KAAK,MAAM,iBACZ,CAAC,KAAK,MAAM,oBACZ,CAAC,KAAK,MAAM,kBACZ,KAAK,KAAK,MAAM,MAAM,CAAC,UAAU,CAAC,KAAK,KACvC,KAAK,SAAS,YAAY,WAAW,KACrC,CAAC,KAAK,SAAS,yBACf,KAAK,SAAS,eAAe,UAC7B,KAAK,SAAS,eAAe,UAC7B,CAAC,KAAK,SAAS,mBACf,KAAK,SAAS,aAAa,SAAS;AAEtC;AAEO,SAAS,mBAAsB,MAAgC;AACrE,MAAI,KAAK,UAAW;AACpB,OAAK,YAAY;AACjB,QAAMC,QAAO;AACb,gBAAc,IAAIA,KAAI;AACtB,MAAI;AACJ,QAAM,qBAAqB,CAAC,UAAyB;AACpD,QAAI,iBAAiB,OAAW,gBAAe;AAAA,EAChD;AACA,OAAK,WAAW,YAAY;AAC5B,aAAW,KAAK,KAAK,KAAK,QAAQ;AACjC,QAAI;AACH,QAAE;AAAA,IACH,SAAS,OAAO;AACf,yBAAmB,KAAK;AAAA,IAEzB;AAAA,EACD;AACA,aAAW,MAAM,KAAK,OAAO,gBAAgB;AAC5C,QAAI;AACH,SAAG;AAAA,IACJ,SAAS,OAAO;AACf,yBAAmB,KAAK;AAAA,IAEzB;AAAA,EACD;AACA,OAAK,KAAK,SAAS,CAAC;AACpB,OAAK,KAAK,WAAW,CAAC;AACtB,OAAK,WAAW,YAAY,MAAM;AAClC,MAAI,KAAK,MAAM,WAAW,MAAM;AAC/B,SAAK,MAAM,WAAW,WAAW,KAAK,MAAM,MAAM;AAClD,SAAK,MAAM,SAAS;AAAA,EACrB;AACA,OAAK,MAAM,OAAO,CAAC;AACnB,OAAK,KAAK,QAAQ,CAAC;AACnB,OAAK,KAAK,WAAW,CAAC;AACtB,OAAK,KAAK,aAAa,CAAC;AACxB,OAAK,KAAK,OAAO,CAAC;AAClB,OAAK,KAAK,UAAU,CAAC;AACrB,OAAK,KAAK,QAAQ,CAAC;AACnB,OAAK,KAAK,OAAO,CAAC;AAClB,OAAK,KAAK,WAAW,CAAC;AACtB,OAAK,KAAK,gBAAgB,CAAC;AAC3B,OAAK,OAAO,QAAQ;AACpB,OAAK,OAAO,UAAU;AACtB,OAAK,OAAO,SAAS;AACrB,OAAK,OAAO,WAAW;AACvB,OAAK,OAAO,aAAa,CAAC;AAC1B,OAAK,cAAc,QAAQ;AAC3B,OAAK,cAAc,UAAU;AAC7B,OAAK,WAAW;AAChB,OAAK,eAAe;AACpB,OAAK,OAAO,iBAAiB,CAAC;AAC9B,OAAK,OAAO,eAAe,CAAC;AAC5B,OAAK,SAAS,aAAa,MAAM;AACjC,OAAK,SAAS,cAAc,CAAC;AAC7B,OAAK,SAAS,wBAAwB;AACtC,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,gBAAgB;AAC9B,OAAK,6BAA6B;AAClC,oBAAkB,OAAOA,KAAI;AAC7B,iBAAe,OAAOA,KAAI;AAC1B,mBAAiB,OAAOA,KAAI;AAC5B,2BAAyB,OAAOA,KAAI;AACpC,yBAAuB,OAAOA,KAAI;AAClC,oBAAkB,OAAOA,KAAI;AAC7B,cAAY,OAAOA,KAAI;AACvB,+BAA6B,OAAOA,KAAI;AACxC,OAAK,MAAM,YAAY,KAAK,GAAG;AAC/B,MAAI,iBAAiB,OAAW,OAAM;AACvC;AAEO,SAAS,kBAAqB,MAAgC;AACpE,QAAM,IAAI,KAAK,MAAM,KAAK;AAC1B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,SAAK,KAAK,MAAM,CAAC,IAAI;AACrB,SAAK,KAAK,SAAS,CAAC,IAAI,CAAC;AACzB,SAAK,KAAK,WAAW,CAAC,IAAI;AAC1B,SAAK,KAAK,KAAK,CAAC,IAAI;AACpB,SAAK,KAAK,QAAQ,CAAC,IAAI;AACvB,SAAK,KAAK,MAAM,CAAC,IAAI;AACrB,SAAK,KAAK,KAAK,CAAC,IAAI;AACpB,SAAK,KAAK,SAAS,CAAC,IAAI;AACxB,SAAK,KAAK,cAAc,CAAC,IAAI;AAAA,EAC9B;AACA,OAAK,MAAM,UAAU;AACrB,OAAK,MAAM,uBAAuB;AACnC;;;ACrMA,IAAM,uBAAuB,KAAK;AAElC,SAAS,uBAAuB,OAAe,MAAoB;AAClE,MAAI,CAAC,OAAO,SAAS,KAAK,GAAG;AAC5B,UAAM,IAAI,UAAU,0CAA0C,IAAI,EAAE;AAAA,EACrE;AACD;AAEA,SAAS,uBAAuB,OAAe,MAAoB;AAClE,yBAAuB,OAAO,IAAI;AAClC,MAAI,OAAO,GAAG,OAAO,EAAE,GAAG;AACzB,UAAM,IAAI,UAAU,6CAA6C,IAAI,EAAE;AAAA,EACxE;AACA,QAAM,MAAM,KAAK,IAAI,KAAK;AAC1B,MAAI,MAAM,KAAK,MAAM,sBAAsB;AAC1C,UAAM,IAAI,UAAU,yCAAyC,IAAI,EAAE;AAAA,EACpE;AACA,MAAI,OAAO,UAAU,KAAK,KAAK,CAAC,OAAO,cAAc,KAAK,GAAG;AAC5D,UAAM,IAAI,UAAU,mDAAmD,IAAI,EAAE;AAAA,EAC9E;AACD;AAEA,SAAS,gBACR,OACA,OAAO,oBAAI,IAAY,GACvB,OAAO,KACP,gBAAgB,OACJ;AACZ,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAAW,QAAO;AACpE,MAAI,OAAO,UAAU,UAAU;AAC9B,QAAI,cAAe,wBAAuB,OAAO,IAAI;AAAA,QAChD,wBAAuB,OAAO,IAAI;AACvC,WAAO;AAAA,EACR;AACA,MAAI,OAAO,UAAU,UAAU;AAC9B,UAAM,IAAI,UAAU,8BAA8B,IAAI,wBAAwB;AAAA,EAC/E;AACA,MAAI,KAAK,IAAI,KAAK,EAAG,OAAM,IAAI,UAAU,2CAA2C,IAAI,EAAE;AAC1F,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,MAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,UAAU,OAAO,aAAa,UAAU,MAAM;AAC1E,UAAM,IAAI,UAAU,yCAAyC,IAAI,EAAE;AAAA,EACpE;AACA,OAAK,IAAI,KAAK;AACd,MAAI;AACH,QAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,UAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,GAAG;AACnD,cAAM,IAAI,UAAU,gDAAgD,IAAI,EAAE;AAAA,MAC3E;AACA,iBAAW,OAAO,OAAO,oBAAoB,KAAK,GAAG;AACpD,cAAM,UACL,iBAAiB,KAAK,GAAG,KACzB,OAAO,cAAc,OAAO,GAAG,CAAC,KAChC,OAAO,GAAG,IAAI,MAAM;AACrB,cAAM,aAAa,OAAO,yBAAyB,OAAO,GAAG;AAC7D,YAAI,eAAe,WAAc,SAAS,cAAc,SAAS,aAAa;AAC7E,gBAAM,IAAI,UAAU,0CAA0C,IAAI,IAAI,GAAG,EAAE;AAAA,QAC5E;AACA,YAAI,QAAQ,YAAY,CAAC,SAAS;AACjC,gBAAM,IAAI,UAAU,iDAAiD,IAAI,IAAI,GAAG,EAAE;AAAA,QACnF;AACA,YAAI,QAAQ,YAAY,eAAe,UAAa,CAAC,WAAW,YAAY;AAC3E,gBAAM,IAAI,UAAU,sDAAsD,IAAI,IAAI,GAAG,EAAE;AAAA,QACxF;AAAA,MACD;AACA,YAAMC,OAAmB,CAAC;AAC1B,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,YAAI,EAAE,KAAK,QAAQ;AAClB,gBAAM,IAAI,UAAU,0CAA0C,IAAI,IAAI,CAAC,GAAG;AAAA,QAC3E;AACA,QAAAA,KAAI,KAAK,gBAAgB,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,aAAa,CAAC;AAAA,MACzE;AACA,aAAOA;AAAA,IACR;AACA,QAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,GAAG;AACnD,YAAM,IAAI,UAAU,gDAAgD,IAAI,EAAE;AAAA,IAC3E;AACA,eAAW,OAAO,OAAO,oBAAoB,KAAK,GAAG;AACpD,YAAM,aAAa,OAAO,yBAAyB,OAAO,GAAG;AAC7D,UAAI,eAAe,WAAc,SAAS,cAAc,SAAS,aAAa;AAC7E,cAAM,IAAI,UAAU,0CAA0C,IAAI,IAAI,GAAG,EAAE;AAAA,MAC5E;AACA,UAAI,eAAe,UAAa,CAAC,WAAW,YAAY;AACvD,cAAM,IAAI,UAAU,gDAAgD,IAAI,IAAI,GAAG,EAAE;AAAA,MAClF;AAAA,IACD;AACA,UAAM,MAAiC,uBAAO,OAAO,IAAI;AACzD,eAAW,OAAO,OAAO,KAAK,KAAgC,EAAE,KAAK,GAAG;AACvE,UAAI,GAAG,IAAI;AAAA,QACT,MAAkC,GAAG;AAAA,QACtC;AAAA,QACA,GAAG,IAAI,IAAI,GAAG;AAAA,QACd;AAAA,MACD;AAAA,IACD;AACA,WAAO;AAAA,EACR,UAAE;AACD,SAAK,OAAO,KAAK;AAAA,EAClB;AACD;AAGO,SAAS,iBAAiB,OAAwB;AACxD,SAAO,KAAK,UAAU,gBAAgB,KAAK,CAAC;AAC7C;AAEA,SAAS,uBAAuB,OAAwB;AACvD,SAAO,KAAK,UAAU,gBAAgB,OAAO,oBAAI,IAAY,GAAG,KAAK,IAAI,CAAC;AAC3E;AAGO,SAAS,eAA4B;AAC3C,QAAM,UAAU,IAAI,YAAY;AAChC,QAAM,UAAU,IAAI,YAAY;AAChC,SAAO;AAAA,IACN,OAAO,OAAsB;AAC5B,aAAO,QAAQ,OAAO,iBAAiB,KAAK,CAAC;AAAA,IAC9C;AAAA,IACA,OAAO,OAAsB;AAC5B,aAAO,KAAK,MAAM,QAAQ,OAAO,KAAK,CAAC;AAAA,IACxC;AAAA,EACD;AACD;AAGO,IAAM,YAA4B,aAAsB;AAE/D,SAAS,WAAW,GAAe,GAAwB;AAC1D,MAAI,EAAE,eAAe,EAAE,WAAY,QAAO;AAC1C,WAAS,IAAI,GAAG,IAAI,EAAE,YAAY,KAAK,GAAG;AACzC,QAAI,EAAE,CAAC,MAAM,EAAE,CAAC,EAAG,QAAO;AAAA,EAC3B;AACA,SAAO;AACR;AAEA,SAAS,qBAAqB,OAAwB;AACrD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,UAAM,OAAO,MAAM,WAAW,CAAC;AAC/B,QAAI,QAAQ,SAAU,QAAQ,OAAQ;AACrC,YAAM,OAAO,MAAM,WAAW,IAAI,CAAC;AACnC,UAAI,QAAQ,SAAU,QAAQ,OAAQ;AACrC,aAAK;AACL;AAAA,MACD;AACA,aAAO;AAAA,IACR;AACA,QAAI,QAAQ,SAAU,QAAQ,MAAQ,QAAO;AAAA,EAC9C;AACA,SAAO;AACR;AAEA,SAAS,2BAA2B,OAAgB,OAAO,oBAAI,IAAY,GAAG,OAAO,KAAW;AAC/F,MAAI,OAAO,UAAU,UAAU;AAC9B,QAAI,qBAAqB,KAAK,GAAG;AAChC,YAAM,IAAI,UAAU,0CAA0C,IAAI,EAAE;AAAA,IACrE;AACA;AAAA,EACD;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,SAAU;AACjD,MAAI,KAAK,IAAI,KAAK,EAAG;AACrB,OAAK,IAAI,KAAK;AACd,MAAI;AACH,QAAI,MAAM,QAAQ,KAAK,GAAG;AACzB,eAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,mCAA2B,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI,IAAI,CAAC,GAAG;AAAA,MAC3D;AACA;AAAA,IACD;AACA,eAAW,OAAO,OAAO,KAAK,KAAgC,GAAG;AAChE,UAAI,qBAAqB,GAAG,GAAG;AAC9B,cAAM,IAAI,UAAU,0CAA0C,IAAI,IAAI,GAAG,EAAE;AAAA,MAC5E;AACA,iCAA4B,MAAkC,GAAG,GAAG,MAAM,GAAG,IAAI,IAAI,GAAG,EAAE;AAAA,IAC3F;AAAA,EACD,UAAE;AACD,SAAK,OAAO,KAAK;AAAA,EAClB;AACD;AAEA,SAAS,gCAAgC,MAAoB;AAC5D,MAAI,QAAQ;AAEZ,WAAS,KAAK,SAAwB;AACrC,UAAM,IAAI,UAAU,oBAAoB,OAAO,EAAE;AAAA,EAClD;AAEA,WAAS,iBAAuB;AAC/B,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,EAAG,UAAS;AAAA,EAC/C;AAEA,WAAS,iBAAyB;AACjC,UAAM,QAAQ;AACd,aAAS;AACT,WAAO,QAAQ,KAAK,QAAQ;AAC3B,YAAM,KAAK,KAAK,KAAK;AACrB,UAAI,OAAO,KAAK;AACf,iBAAS;AACT,YAAI;AACH,iBAAO,KAAK,MAAM,KAAK,MAAM,OAAO,KAAK,CAAC;AAAA,QAC3C,QAAQ;AACP,eAAK,uBAAuB;AAAA,QAC7B;AAAA,MACD;AACA,UAAI,OAAO,MAAM;AAChB,iBAAS;AACT;AAAA,MACD;AACA,eAAS;AAAA,IACV;AACA,SAAK,0BAA0B;AAAA,EAChC;AAEA,WAAS,eAAe,SAAuB;AAC9C,QAAI,KAAK,MAAM,OAAO,QAAQ,QAAQ,MAAM,MAAM,SAAS;AAC1D,WAAK,4BAA4B,KAAK,EAAE;AAAA,IACzC;AACA,aAAS,QAAQ;AAAA,EAClB;AAEA,WAAS,gBAAsB;AAC9B,UAAM,QAAQ,yCAAyC,KAAK,KAAK,MAAM,KAAK,CAAC;AAC7E,QAAI,CAAC,MAAO,MAAK,mCAAmC,KAAK,EAAE;AAC3D,aAAS,MAAM,CAAC,EAAE;AAAA,EACnB;AAEA,WAAS,WAAW,MAAoB;AACvC,mBAAe;AACf,UAAM,KAAK,KAAK,KAAK;AACrB,QAAI,OAAO,KAAK;AACf,kBAAY,IAAI;AAChB;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,iBAAW,IAAI;AACf;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe;AACf;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe,MAAM;AACrB;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe,OAAO;AACtB;AAAA,IACD;AACA,QAAI,OAAO,KAAK;AACf,qBAAe,MAAM;AACrB;AAAA,IACD;AACA,QAAI,OAAO,OAAQ,OAAO,UAAa,MAAM,OAAO,MAAM,KAAM;AAC/D,oBAAc;AACd;AAAA,IACD;AACA,SAAK,4BAA4B,KAAK,EAAE;AAAA,EACzC;AAEA,WAAS,YAAY,MAAoB;AACxC,UAAM,OAAO,oBAAI,IAAY;AAC7B,aAAS;AACT,mBAAe;AACf,QAAI,KAAK,KAAK,MAAM,KAAK;AACxB,eAAS;AACT;AAAA,IACD;AACA,WAAO,QAAQ,KAAK,QAAQ;AAC3B,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,IAAK,MAAK,iCAAiC,KAAK,EAAE;AACtE,YAAM,MAAM,eAAe;AAC3B,UAAI,KAAK,IAAI,GAAG,GAAG;AAClB,cAAM,IAAI;AAAA,UACT,yCAAyC,KAAK,UAAU,GAAG,CAAC,OAAO,IAAI;AAAA,QACxE;AAAA,MACD;AACA,WAAK,IAAI,GAAG;AACZ,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,IAAK,MAAK,2CAA2C,KAAK,EAAE;AAChF,eAAS;AACT,iBAAW,GAAG,IAAI,IAAI,GAAG,EAAE;AAC3B,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,WAAK,iCAAiC,KAAK,EAAE;AAAA,IAC9C;AACA,SAAK,0BAA0B;AAAA,EAChC;AAEA,WAAS,WAAW,MAAoB;AACvC,aAAS;AACT,mBAAe;AACf,QAAI,KAAK,KAAK,MAAM,KAAK;AACxB,eAAS;AACT;AAAA,IACD;AACA,QAAI,OAAO;AACX,WAAO,QAAQ,KAAK,QAAQ;AAC3B,iBAAW,GAAG,IAAI,IAAI,IAAI,GAAG;AAC7B,cAAQ;AACR,qBAAe;AACf,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,UAAI,KAAK,KAAK,MAAM,KAAK;AACxB,iBAAS;AACT;AAAA,MACD;AACA,WAAK,iCAAiC,KAAK,EAAE;AAAA,IAC9C;AACA,SAAK,yBAAyB;AAAA,EAC/B;AAEA,aAAW,GAAG;AACd,iBAAe;AACf,MAAI,UAAU,KAAK,OAAQ,MAAK,iCAAiC,KAAK,EAAE;AACzE;AAOO,SAAS,qBAAkC;AACjD,QAAM,UAAU,IAAI,YAAY;AAChC,QAAM,UAAU,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC;AACxD,SAAO;AAAA,IACN,OAAO,OAAsB;AAC5B,iCAA2B,KAAK;AAChC,aAAO,QAAQ,OAAO,uBAAuB,KAAK,CAAC;AAAA,IACpD;AAAA,IACA,OAAO,OAAsB;AAC5B,YAAM,OAAO,QAAQ,OAAO,KAAK;AACjC,sCAAgC,IAAI;AACpC,YAAM,UAAU,KAAK,MAAM,IAAI;AAC/B,iCAA2B,OAAO;AAClC,YAAM,YAAY,QAAQ,OAAO,uBAAuB,OAAO,CAAC;AAChE,UAAI,CAAC,WAAW,OAAO,SAAS,GAAG;AAClC,cAAM,IAAI,UAAU,sDAAsD;AAAA,MAC3E;AACA,aAAO;AAAA,IACR;AAAA,EACD;AACD;AAGO,IAAM,kBAAkC,mBAA4B;AAGpE,SAAS,yBAAyB,OAA4B;AACpE,SAAO,gBAAgB,OAAO,KAAK;AACpC;AAGO,SAAS,sBAAsB,OAAgB,QAAQ,mBAAoC;AACjG,MAAI;AACH,WAAO,gBAAgB,OAAO,gBAAgB,OAAO,KAAK,CAAC;AAAA,EAC5D,SAAS,OAAO;AACf,UAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,UAAM,IAAI,UAAU,GAAG,KAAK,0CAA0C,OAAO,IAAI,EAAE,MAAM,CAAC;AAAA,EAC3F;AACD;;;AC5VA,IAAM,iBAAiB,OAAO,OAAO;AAAA,EACpC,4BAA4B;AAC7B,CAAC;AAED,SAAS,QAAQ,OAA2B;AAC3C,MAAI,OAAO;AACX,QAAM,QAAQ;AACd,aAAW,QAAQ,OAAO;AACzB,YAAQ,OAAO,IAAI;AACnB,WAAO,OAAO,QAAQ,IAAI,OAAO,KAAK;AAAA,EACvC;AACA,SAAO,KAAK,SAAS,EAAE,EAAE,SAAS,IAAI,GAAG;AAC1C;AAQO,SAAS,uBAAuB,OAA2B;AACjE,SAAO,WAAW,QAAQ,KAAK,CAAC;AACjC;AAEA,SAAS,aACR,QACA,OACS;AACT,SAAO,OAAO,KAAK,yBAAyB,KAAK,CAAC;AACnD;AAEO,SAAS,gCACf,QACA,OACO;AACP,MAAI,CAAC,OAAO,WAAW,OAAO,UAAU,EAAG;AAC3C,2BAAyB,KAAK;AAC/B;AAEO,SAAS,wBACf,QACA,OACU;AACV,MAAI,CAAC,OAAO,WAAW,OAAO,UAAU,EAAG,QAAO;AAClD,QAAM,QAAQ,yBAAyB,KAAK;AAC5C,SAAO,gBAAgB,OAAO,KAAK;AACpC;AAEO,SAAS,4BACf,QAC+B;AAC/B,MAAI,WAAW,MAAO,QAAO,EAAE,SAAS,MAAM;AAC9C,MAAI,WAAW,UAAa,WAAW,EAAG,QAAO,EAAE,SAAS,MAAM,OAAO,EAAE;AAC3E,MAAI,WAAW,EAAG,QAAO,EAAE,SAAS,MAAM,OAAO,GAAG,MAAM,uBAAuB;AACjF,MAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AAClD,QAAI,OAAO,UAAU,EAAG,QAAO,EAAE,SAAS,MAAM,OAAO,EAAE;AACzD,QAAI,OAAO,UAAU,GAAG;AACvB,aAAO,EAAE,SAAS,MAAM,OAAO,GAAG,MAAM,OAAO,QAAQ,uBAAuB;AAAA,IAC/E;AAAA,EACD;AACA,QAAM,IAAI,MAAM,wEAAwE;AACzF;AAEO,SAAS,kBACf,QACA,eAAwB,gBACE;AAC1B,MAAI,CAAC,OAAO,QAAS,QAAO;AAC5B,MAAI,OAAO,UAAU,EAAG,QAAO,OAAO,OAAO,EAAE,OAAO,GAAG,SAAS,EAAE,CAAC;AACrE,SAAO,OAAO,OAAO;AAAA,IACpB,OAAO;AAAA,IACP,SAAS;AAAA,IACT,KAAK,aAAa,QAAQ,YAAY;AAAA,IACtC,MAAM;AAAA,EACP,CAAC;AACF;AAEO,SAAS,mBACf,SACA,QACA,OAC0B;AAC1B,MAAI,CAAC,OAAO,QAAS,QAAO;AAC5B,MAAI,YAAY,OAAW,QAAO,kBAAkB,QAAQ,KAAK;AACjE,MAAI,OAAO,UAAU,GAAG;AACvB,WAAO,OAAO,OAAO,EAAE,OAAO,GAAG,SAAS,QAAQ,UAAU,EAAE,CAAC;AAAA,EAChE;AACA,QAAM,WAAW,QAAQ,UAAU,IAAI,QAAQ,MAAM;AACrD,SAAO,OAAO,OAAO;AAAA,IACpB,OAAO;AAAA,IACP,SAAS,QAAQ,UAAU;AAAA,IAC3B,KAAK,aAAa,QAAQ,KAAK;AAAA,IAC/B,MAAM;AAAA,EACP,CAAC;AACF;AAEO,SAAS,iBAAiB,SAA2D;AAC3F,MAAI,YAAY,OAAW,QAAO;AAClC,MAAI,QAAQ,UAAU,EAAG,QAAO,OAAO,OAAO,EAAE,OAAO,GAAG,SAAS,QAAQ,QAAQ,CAAC;AACpF,SAAO,OAAO,OAAO;AAAA,IACpB,OAAO;AAAA,IACP,SAAS,QAAQ;AAAA,IACjB,KAAK,QAAQ;AAAA,IACb,MAAM,QAAQ;AAAA,EACf,CAAC;AACF;AAEO,SAAS,cACf,QACA,SACA,OACS;AACT,SAAO,aAAa,QAAQ,UAAU,QAAQ,cAAc;AAC7D;;;ACrIO,SAAS,SAAY,MAA0B,MAAkB;AACvE,MAAI,KAAK,UAAW;AACpB,uBAAqB,IAAI;AACzB,QAAM,eAAe,CAAC;AACtB,QAAM,8BAA8B,CAAC,SAA6B;AACjE,eAAW,KAAK,MAAM;AACrB,UAAI,EAAE,CAAC,MAAM,OAAQ,iCAAgC,KAAK,SAAS,QAAQ,EAAE,CAAC,CAAC;AAAA,IAChF;AAAA,EACD;AACA,QAAM,sBAAsB,CAAC,SAC5B,KAAK;AAAA,IAAI,CAAC,MACT,EAAE,CAAC,MAAM,SACL,CAAC,QAAQ,wBAAwB,KAAK,SAAS,QAAQ,EAAE,CAAC,CAAC,CAAC,IAC7D;AAAA,EACJ;AACD,8BAA4B,IAAI;AAUhC,MAAI,KAAK,OAAO,aAAa,QAAW;AACvC,QAAI,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,UAAU,EAAG;AAC5C,SAAK,OAAO,cAAc;AAC1B,QAAI,KAAK,MAAM,iBAAiB;AAC/B,WAAK,OAAO,QAAQ;AACpB,WAAK,OAAO,UAAU;AAAA,IACvB;AACA,SAAK,YAAY,CAAC,UAAU,GAAG,EAAE,MAAM,cAAc,MAAM,KAAK,CAAC;AACjE;AAAA,EACD;AACA,MAAI,SAAoB,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,YAAY,EAAE,CAAC,CAAC,IAAI,YAAY,EAAE,CAAC,CAAC,CAAC;AAGtF,QAAM,kBAAkB,OAAO,UAAU,CAAC,MAAM,EAAE,CAAC,MAAM,YAAY;AACrE,MAAI,oBAAoB,IAAI;AAC3B,aAAS,OAAO,OAAO,CAAC,GAAG,MAAM,EAAE,CAAC,MAAM,gBAAgB,MAAM,eAAe;AAAA,EAChF;AAIA,QAAM,cAAc,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,UAAU;AAC1D,QAAM,cAAc,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,cAAc,EAAE,CAAC,MAAM,OAAO;AAC9E,MACC,eACA,CAAC,eACD,KAAK,OAAO,aAAa,UACzB,CAAC,KAAK,OAAO,aACZ;AACD,aAAS,CAAC,CAAC,UAAU,GAAG,GAAG,MAAM;AAAA,EAClC;AAIA,MAAI,CAAC,KAAK,MAAM,iBAAiB,aAAa,GAAG;AAChD,UAAM,WAAW,oBAAoB,OAAO,OAAO,CAAC,MAAM,eAAe,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/E,QAAI,SAAS,SAAS,GAAG;AACxB,UAAI,CAAC,KAAK,MAAM,sBAAsB;AACrC,aAAK,MAAM,uBAAuB;AAClC,aAAK,OAAO,SAAS;AACrB,aAAK,YAAY,CAAC,OAAO,GAAG,EAAE,MAAM,cAAc,MAAM,MAAM,CAAC;AAAA,MAChE;AACA,WAAK,MAAM,iBAAiB;AAC5B,mBAAa,MAAkC,QAAQ;AACvD;AAAA,IACD;AAAA,EACD;AAIA,MAAI,KAAK,qBAAqB,GAAG;AAChC,UAAM,WAAW,oBAAoB,OAAO,OAAO,CAAC,MAAM,oBAAoB,EAAE,CAAC,CAAC,CAAC,CAAC;AACpF,QAAI,SAAS,SAAS,GAAG;AAIxB,WAAK,MAAM,wBAAwB;AACnC,WAAK,SAAS,YAAY,KAAK,QAAQ;AAAA,IACxC;AACA,aAAS,OAAO,OAAO,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC,CAAC,CAAC;AACxD,QAAI,OAAO,WAAW,EAAG;AAAA,EAC1B;AACA,MAAI,YAAY;AAChB,MAAI,WAAW;AACf,MAAI,cAAc;AAClB,aAAW,KAAK,QAAQ;AACvB,QAAI,EAAE,CAAC,MAAM,OAAQ;AACrB,QAAI,EAAE,CAAC,MAAM,WAAY,eAAc;AACvC,QAAI,YAAY,EAAE,CAAC,CAAC,EAAG,YAAW;AAAA,EACnC;AAGA,MAAI,aAAa,KAAK,aAAa;AAClC,UAAM,IAAI;AAAA,MACT;AAAA,IACD;AAAA,EACD;AACA,QAAM,kBAAkD,IAAI,MAAM,OAAO,MAAM;AAC/E,MAAI,YAAY,GAAG;AAClB,QAAI,iBAAiB,KAAK,SAAS;AACnC,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,YAAM,IAAI,OAAO,CAAC;AAClB,UAAI,EAAE,CAAC,MAAM,OAAQ;AACrB,uBAAiB,mBAAmB,gBAAgB,KAAK,SAAS,QAAQ,EAAE,CAAC,CAAC;AAC9E,sBAAgB,CAAC,IAAI;AAAA,IACtB;AAAA,EACD;AAIA,MACC,aACC,CAAC,KAAK,MAAM,iBAAiB,KAAK,SAAS,kBAC5C,CAAC,KAAK,MAAM,sBACX;AACD,SAAK,MAAM,uBAAuB;AAClC,SAAK,OAAO,SAAS;AACrB,SAAK,YAAY,CAAC,OAAO,GAAG,EAAE,MAAM,cAAc,MAAM,MAAM,CAAC;AAAA,EAChE;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACvC,UAAM,IAAI,OAAO,CAAC;AAClB,UAAM,WAAW,EAAE,MAAM,cAAc,MAAM,MAAM,OAAO,SAAS,EAAE;AAGrE,QAAI,eAAe,EAAE,CAAC,CAAC,EAAG,MAAK,MAAM,wBAAwB;AAC7D,QAAI,EAAE,CAAC,MAAM,SAAS;AACrB,UAAI,CAAC,KAAK,MAAM,sBAAsB;AACrC,aAAK,MAAM,uBAAuB;AAClC,aAAK,OAAO,SAAS;AACrB,aAAK,YAAY,CAAC,OAAO,GAAG,QAAQ;AAAA,MACrC;AACA;AAAA,IACD;AACA,QAAI,EAAE,CAAC,MAAM,QAAQ;AACpB,YAAM,IAAI,EAAE,CAAC;AAIb,WAAK,OAAO,QAAQ;AACpB,WAAK,OAAO,UAAU;AACtB,WAAK,OAAO,SAAS;AACrB,WAAK,SAAS,QAAQ,gBAAgB,CAAC;AACvC,UAAI,KAAK,MAAM,UAAU,GAAG;AAC3B,aAAK,OAAO,WAAW,KAAK,CAAC;AAC7B,YAAI,KAAK,OAAO,WAAW,SAAS,KAAK,MAAM,QAAS,MAAK,OAAO,WAAW,MAAM;AAAA,MACtF;AACA,WAAK,YAAY,CAAC,QAAQ,CAAC,GAAG,QAAQ;AACtC;AAAA,IACD;AACA,QAAI,EAAE,CAAC,MAAM,YAAY;AACxB,WAAK,OAAO,SAAS,KAAK,OAAO,UAAU,aAAa;AACxD,WAAK,YAAY,CAAC,UAAU,GAAG,QAAQ;AACvC;AAAA,IACD;AACA,QAAI,EAAE,CAAC,MAAM,cAAc;AAC1B,WAAK,YAAY,QAAQ;AACzB;AAAA,IACD;AACA,QAAI,EAAE,CAAC,MAAM,YAAY;AACxB,UAAI,KAAK,OAAO,aAAa,OAAW;AACxC,WAAK,OAAO,WAAW;AACvB,WAAK,SAAS,cAAc,CAAC;AAC7B,WAAK,OAAO,SAAS;AACrB,WAAK,YAAY,CAAC,UAAU,GAAG,QAAQ;AACvC;AAAA,IACD;AACA,QAAI,EAAE,CAAC,MAAM,SAAS;AACrB,UAAI,KAAK,OAAO,aAAa,OAAW;AACxC,WAAK,OAAO,WAAW,EAAE,CAAC;AAC1B,WAAK,SAAS,cAAc,CAAC;AAC7B,WAAK,OAAO,SAAS;AACrB,WAAK,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,GAAG,QAAQ;AAC1C;AAAA,IACD;AACA,QAAI,EAAE,CAAC,MAAM,YAAY;AACxB,WAAK,OAAO,cAAc;AAC1B,UAAI,KAAK,MAAM,iBAAiB;AAC/B,aAAK,OAAO,QAAQ;AACpB,aAAK,OAAO,UAAU;AAAA,MACvB;AACA,WAAK,YAAY,CAAC,UAAU,GAAG,QAAQ;AAAA,IACxC;AAAA,EAED;AAEA,MAAI,CAAC,KAAK,MAAM,cAAe,MAAK,MAAM,uBAAuB;AAClE;AAEO,SAAS,OACf,MACA,MACA,WACA,OACO;AACP,MAAI,KAAK,UAAW;AACpB,QAAM,aAAa,SAAS,EAAE,aAAa,oBAAI,IAAI,EAAE;AACrD,aAAW,KAAK,MAAM;AACrB,QAAI,CAAC,YAAY,EAAE,CAAC,CAAC,GAAG;AACvB,YAAM,IAAI;AAAA,QACT,WAAW,EAAE,CAAC,CAAC,uBAAuB,YAAY,EAAE,CAAC,CAAC,CAAC;AAAA,MACxD;AAAA,IACD;AAAA,EACD;AACA,aAAW,KAAK,MAAM;AACrB,QAAI,EAAE,CAAC,MAAM,SAAS;AAGrB,WAAK,cAAc,EAAE,CAAC,CAAC;AAAA,IACxB,WAAW,EAAE,CAAC,MAAM,UAAU;AAE7B,UAAI,KAAK,SAAS,aAAa,IAAI,EAAE,CAAC,CAAC,GAAG;AAEzC,aAAK,cAAc,EAAE,CAAC,CAAC;AAAA,MACxB,OAAO;AAEN,aAAK,WAAW,GAAG,WAAW,UAAU;AAAA,MACzC;AAAA,IACD,WAAW,EAAE,CAAC,MAAM,QAAQ;AAE3B,YAAM,SAAS,oBAAoB,EAAE,CAAC,CAAC;AACvC,UAAI,KAAK,MAAM,QAAQ,OAAO,WAAW,KAAK,MAAM,UAAU;AAC7D,YAAI,CAAC,KAAK,kBAAkB,OAAO,QAAQ,UAAU,EAAG,MAAK,UAAU,MAAM;AAAA,MAC9E,OAAO;AACN,aAAK,WAAW,CAAC,QAAQ,MAAM,GAAG,WAAW,UAAU;AAAA,MACxD;AAAA,IACD,WAAW,KAAK,MAAM,KAAK,WAAW,GAAG;AASxC,UAAI,EAAE,CAAC,MAAM,aAAc,MAAK,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;AAAA,IACvD,OAAO;AAEN,WAAK,WAAW,GAAG,WAAW,UAAU;AAAA,IACzC;AAAA,EACD;AACD;AAEO,SAAS,qBACf,MACA,QACA,OACU;AACV,MAAI,UAAU,MAAM,YAAY,IAAI,MAAM;AAC1C,MAAI,YAAY,QAAW;AAC1B,cAAU,oBAAI,IAAI;AAClB,UAAM,YAAY,IAAI,QAAQ,OAAO;AAAA,EACtC;AACA,QAAMC,QAAO;AACb,MAAI,QAAQ,IAAIA,KAAI,EAAG,QAAO;AAC9B,UAAQ,IAAIA,KAAI;AAChB,SAAO;AACR;AAEO,SAAS,cACf,MACA,GACA,WACA,OACO;AACP,MAAI,KAAK,MAAM,KAAK,WAAW,EAAG;AAClC,MAAI,cAAc,QAAW;AAC5B,UAAM,IAAI,KAAK,MAAM,KAAK,SAAS;AACnC,QAAI,MAAM,OAAW,iBAAgB,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,QAAW,KAAK;AAAA,EAClE,OAAO;AACN,eAAW,OAAO,KAAK,MAAM,KAAM,iBAAgB,GAAG,EAAE,IAAI,CAAC,CAAC,GAAG,QAAW,KAAK;AAAA,EAClF;AACD;AAEO,SAAS,aAAgB,MAAmC;AAClE,SAAO,KAAK,SAAS,aAAa,OAAO;AAC1C;AAEO,SAAS,yBAA4B,MAAmC;AAC9E,MAAI,KAAK,MAAM,aAAa,MAAO,QAAO;AAC1C,SAAO,KAAK,SAAS,aAAa,OAAO;AAC1C;AAEO,SAAS,gBAAmB,MAAmC;AACrE,SACC,KAAK,MAAM,WAAW,QACtB,KAAK,MAAM,WAAW,SAAS,KAAK,MAAM,OAAO,MAAM,MAAM;AAE/D;AAEO,SAAS,iBAAoB,MAA0B,QAAuB;AACpF,OAAK,SAAS,aAAa,IAAI,MAAM;AACtC;AAEO,SAAS,iBAAoB,MAA0B,QAAuB;AACpF,MAAI,CAAC,KAAK,SAAS,aAAa,IAAI,MAAM,EAAG;AAC7C,OAAK,SAAS,aAAa,OAAO,MAAM;AAGxC,MAAI,KAAK,MAAM,QAAQ,KAAK,SAAS,eAAe,OAAW,MAAK,uBAAuB;AAC3F,MAAI,KAAK,sBAAsB,EAAG;AAClC,wBAAsB,KAAK,KAAK;AAChC,MAAI,KAAK,MAAM,KAAM;AACrB,OAAK,UAAU;AAChB;AAEO,SAAS,aAAgB,MAAgC;AAG/D,MAAI,KAAK,OAAO,aAAa,QAAW;AACvC,SAAK,SAAS,cAAc,CAAC;AAC7B,SAAK,SAAS,wBAAwB;AACtC,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,gBAAgB;AAC9B;AAAA,EACD;AAIA,MAAI,KAAK,SAAS,YAAY,SAAS,GAAG;AACzC,UAAM,MAAM,KAAK,SAAS;AAC1B,SAAK,SAAS,cAAc,CAAC;AAC7B,eAAW,QAAQ,IAAK,MAAK,MAAM,IAAI;AAAA,EACxC;AACA,MAAI,KAAK,SAAS,uBAAuB;AACxC,SAAK,SAAS,wBAAwB;AACtC,SAAK,QAAQ;AAAA,EACd;AACD;AAEO,SAAS,kBAAqB,MAAmC;AACvE,MAAI,KAAK,OAAO,aAAa,UAAa,KAAK,MAAM,UAAU,EAAG,QAAO;AACzE,SAAO,KAAK,SAAS,aAAa,SAAS;AAC5C;AAEO,SAAS,sBAAyB,MAA0B,QAA0B;AAC5F,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,kBAAkB;AAChC,MAAI;AACH,SAAK,gBAAgB;AAAA,EACtB,UAAE;AACD,SAAK,SAAS,aAAa;AAC3B,SAAK,SAAS,kBAAkB;AAAA,EACjC;AACD;AAEO,SAAS,aAAgB,MAA0B,QAA0B;AACnF,MAAI,KAAK,SAAS,gBAAiB;AACnC,MAAI,KAAK,eAAe,EAAG,MAAK,mBAAmB,MAAM;AAAA,MACpD,MAAK,SAAS,aAAa;AACjC;AAEO,SAAS,mBAAsB,MAAgC;AACrE,MAAI,gBAAgB;AACpB,MAAI,KAAK,SAAS,YAAY,SAAS,GAAG;AACzC,UAAM,MAAM,KAAK,SAAS;AAC1B,SAAK,SAAS,cAAc,CAAC;AAC7B,eAAW,QAAQ,IAAK,MAAK,MAAM,IAAI;AACvC,oBAAgB;AAAA,EACjB;AACA,MAAI,cAAe;AACnB,MAAI,KAAK,SAAS,uBAAuB;AAMxC,UAAM,QACL,KAAK,MAAM,WAAW,QACtB,CAAC,KAAK,MAAM,mBACZ,EAAE,KAAK,MAAM,WAAW,KAAK,gBAAgB;AAC9C,QAAI,KAAK,MAAM,UAAU,KAAK,MAAO;AACrC,SAAK,SAAS,wBAAwB;AACtC,SAAK,MAAM,uBAAuB;AAClC,SAAK,SAAS,gBAAgB;AAC9B,QAAI;AACH,WAAK,QAAQ;AAAA,IACd,UAAE;AACD,WAAK,SAAS,gBAAgB;AAAA,IAC/B;AACA;AAAA,EACD;AACA,MAAI,KAAK,MAAM,WAAW,MAAM;AAC/B,QAAI,CAAC,KAAK,MAAM,mBAAmB,EAAE,KAAK,MAAM,WAAW,KAAK,gBAAgB,GAAI;AACpF,SAAK,MAAM,uBAAuB;AAClC,SAAK,SAAS,gBAAgB;AAC9B,QAAI;AACH,WAAK,SAAS;AAAA,IACf,UAAE;AACD,WAAK,SAAS,gBAAgB;AAAA,IAC/B;AAAA,EACD;AACD;AAEO,SAAS,0BAA6B,MAAgC;AAC5E,MAAI,KAAK,SAAS,gBAAiB;AACnC,MAAI,KAAK,MAAM,QAAQ,KAAK,SAAS,eAAe,UAAa,KAAK,eAAe,GAAG;AACvF,SAAK,mBAAmB,KAAK,SAAS,UAAU;AAAA,EACjD;AACD;AAEO,SAAS,wBAA2B,MAAmC;AAG7E,MAAI,KAAK,MAAM,aAAa,MAAO,QAAO;AAC1C,MAAI,CAAC,KAAK,UAAU,KAAK,CAAC,KAAK,aAAa,EAAG,QAAO;AAEtD,MAAI,KAAK,MAAM,aAAa,YAAa,QAAO;AAIhD,MAAI,CAAC,KAAK,MAAM,iBAAiB,KAAK,aAAa,KAAK,KAAK,MAAM,KAAK,SAAS,EAAG,QAAO;AAC3F,SAAO;AACR;AAEO,SAAS,eAAkB,MAA0B,UAA+B;AAC1F,MAAI,CAAC,KAAK,OAAO,QAAS;AAC1B,OAAK,OAAO,QAAQ;AACpB,OAAK,OAAO,UAAU;AACtB,OAAK,OAAO,SAAS;AACrB,OAAK,OAAO,aAAa,CAAC;AAC1B,aAAW,MAAM,KAAK,OAAO,aAAc,IAAG;AAC9C,OAAK,YAAY,CAAC,YAAY,GAAG,QAAQ;AAC1C;AAEO,SAAS,oBAAuB,MAAmC;AACzE,MAAI,KAAK,MAAM,KAAK,WAAW,EAAG,QAAO;AACzC,aAAW,MAAM,KAAK,KAAK,SAAU,KAAI,OAAO,OAAW,QAAO;AAClE,SAAO;AACR;AAEO,SAAS,mBAAsB,MAAgC;AACrE,aAAW,KAAK,KAAK,KAAK,OAAQ,KAAI,EAAG,GAAE;AAC3C,OAAK,KAAK,SAAS,CAAC;AACpB,OAAK,KAAK,WAAW,CAAC;AACtB,OAAK,WAAW,YAAY,MAAM;AAClC,OAAK,WAAW,YAAY;AAC5B,OAAK,OAAO,WAAW;AACvB,OAAK,OAAO,cAAc;AAC1B,OAAK,MAAM,kBAAkB;AAC7B,OAAK,eAAe;AACpB,OAAK,SAAS,aAAa,MAAM;AACjC,OAAK,SAAS,cAAc,CAAC;AAC7B,OAAK,SAAS,wBAAwB;AACtC,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,aAAa;AAC3B,OAAK,SAAS,gBAAgB;AAC9B,OAAK,OAAO,aAAa,CAAC;AAC1B,QAAM,YAAY,KAAK,MAAM,WAAW,QAAQ,KAAK,MAAM,KAAK,SAAS;AACzE,MAAI,WAAW;AACd,SAAK,OAAO,QAAQ;AACpB,SAAK,OAAO,UAAU;AACtB,SAAK,OAAO,SAAS;AAAA,EACtB,OAAO;AACN,SAAK,OAAO,SAAS,KAAK,OAAO,UAAU,YAAY;AAAA,EACxD;AACA,MAAI,CAAC,KAAK,cAAc,QAAS,MAAK,cAAc,QAAQ;AAC7D;AAEO,SAAS,eACf,MACA,KACA,UACO;AACP,MAAI,KAAK,UAAW;AAEpB,QAAM,OAAO,CAAC,GAAG,KAAK,WAAW,WAAW;AAC5C,aAAW,QAAQ,KAAM,MAAK,KAAK,QAAQ;AAC5C;AAEO,SAAS,sBAAyB,MAA0B,MAAkB;AACpF,OAAK,MAAM,iBAAiB;AAC5B,OAAK,MAAM,IAAI;AAChB;AAEO,SAAS,oBAAuB,MAAgC;AAGtE,MAAI,KAAK,MAAM,gBAAgB;AAC9B,SAAK,MAAM,iBAAiB;AAC5B,SAAK,MAAM,uBAAuB;AAClC,SAAK,OAAO,SAAS,KAAK,OAAO,UAAU,YAAY;AACvD,SAAK,YAAY,CAAC,UAAU,CAAC;AAAA,EAC9B;AACD;AAEO,SAAS,kBACf,MACA,IACA,YACO;AACP,cAAY,KAAK,OAAO,IAAI;AAAA,IAC3B;AAAA,IACA,SAAS,MAAM,CAAC,KAAK,sBAAsB;AAAA,EAC5C,CAAC;AACF;;;ACjgBO,SAAS,sBAAyB,MAA0B,IAAoB;AACtF,cAAY,KAAK,OAAO,MAAM,KAAK,iBAAiB,EAAE,GAAG;AAAA,IACxD,YAAY,0BAA0B;AAAA,IACtC,SAAS,MAAM,CAAC,KAAK,sBAAsB;AAAA,EAC5C,CAAC;AACF;AAEO,SAAS,kBACf,MACA,MACA,WACO;AACP;AAAA,IACC,KAAK;AAAA,IACL,MAAM;AACL,UAAI,CAAC,KAAK,UAAW,MAAK,IAAI,MAAM,SAAS;AAAA,IAC9C;AAAA,IACA;AAAA,MACC,YAAY,0BAA0B;AAAA,MACtC,SAAS,MAAM,CAAC,KAAK,sBAAsB;AAAA,IAC5C;AAAA,EACD;AACD;AAEO,SAAS,oBAAuB,MAA0B,IAAoB;AACpF,MAAI,KAAK,UAAW;AACpB,MAAI;AAIH,QAAI,GAAG,SAAS,OAAO;AACtB,YAAM,OAAO,KAAK,MAAM,KAAK,SAAS,GAAG,GAAG,IACzC,CAAC,GAAG,KAAK,MAAM,IAAI,IACnB,CAAC,GAAG,KAAK,MAAM,MAAM,GAAG,GAAG;AAC9B,WAAK,QAAQ,MAAM,GAAG,IAAI,EAAE,oBAAoB,KAAK,CAAC;AAAA,IACvD,WAAW,GAAG,SAAS,UAAU;AAChC,WAAK;AAAA,QACJ,KAAK,MAAM,KAAK,OAAO,CAAC,MAAM,MAAM,GAAG,GAAG;AAAA,QAC1C,GAAG;AAAA,QACH,EAAE,oBAAoB,KAAK;AAAA,MAC5B;AAAA,IACD,OAAO;AACN,WAAK,QAAQ,KAAK,WAAW,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,oBAAoB,KAAK,CAAC;AAAA,IAC3E;AAAA,EACD,SAAS,GAAG;AAMX,SAAK,MAAM,CAAC,CAAC,SAAS,aAAa,GAAG,sBAAsB,CAAC,CAAC,CAAC;AAAA,EAChE;AACD;AAEO,SAAS,WACf,MACA,SACA,IACA,OAAyC,CAAC,GAChC;AACV,QAAMC,QAAO;AAEb,MAAI,KAAK,OAAO,aAAa,UAAa,CAAC,KAAK;AAC/C,UAAM,IAAI;AAAA,MACT;AAAA,IACD;AACD,MAAI,KAAK,MAAM;AACd,UAAM,IAAI;AAAA,MACT;AAAA,IACD;AACD,MAAI,KAAK,MAAM;AACd,UAAM,IAAI;AAAA,MACT;AAAA,IACD;AACD,MAAI,QAAQ,SAASA,KAAI,EAAG,OAAM,IAAI,MAAM,mDAAmD;AAC/F,QAAM,UAAU,KAAK,MAAM;AAC3B,QAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC;AACxD,aAAW,KAAK,OAAO;AACtB,QAAI,KAAK,mBAAmB,GAAGA,KAAI;AAClC,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,UAAM,MAAM,gBAAgB,CAAC;AAC7B,QAAI,IAAI,OAAO,aAAa,UAAa,CAAC,IAAI,MAAM;AACnD,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,SAAK,sBAAsB,CAAC;AAAA,EAC7B;AAEA,MACC,yBAAyBA,OAAM,MAAM;AACpC,SAAK,QAAQ,SAAS,IAAI,EAAE,GAAG,MAAM,oBAAoB,KAAK,CAAC;AAAA,EAChE,CAAC,GACA;AACD,WAAO;AAAA,EACR;AACA,MAAI,CAAC,KAAK,WAAW,UAAW,MAAK,6BAA6B;AAElE,OAAK,MAAM,gBAAgB;AAC3B,OAAK,MAAM,mBAAmB;AAC9B,MAAI,iBAAiB;AACrB,MAAI;AAMH,UAAM,YAAY,KAAK,MAAM;AAC7B,SAAK,MAAM,SAAS,KAAK,MAAM,WAAW,SAAS,IAAI,KAAK,MAAM,IAAI;AACtE,QAAI,cAAc,KAAM,MAAK,MAAM,WAAW,WAAW,SAAS;AAElE,UAAM,UAAU,QAAQ,OAAO,CAAC,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC;AAC1D,QAAI,0BAA0B;AAC9B,eAAW,KAAK,SAAS;AACxB,YAAM,SAAS,QAAQ,QAAQ,CAAC;AAChC,UAAI,KAAK,KAAK,MAAM,MAAM,GAAG;AAC5B,kCAA0B;AAC1B,aAAK,MAAM;AAAA,MACZ;AACA,UAAI,KAAK,WAAW,WAAW;AAC9B,cAAM,MAAM,KAAK,KAAK,SAAS,MAAM;AACrC,YAAI,IAAK,KAAI,IAAI;AACjB,cAAM,QAAQ,KAAK,KAAK,OAAO,MAAM;AACrC,YAAI,MAAO,OAAM;AAAA,MAClB;AAAA,IACD;AAIA,UAAM,IAAI,QAAQ;AAClB,UAAM,WAAoC,IAAI,MAAM,CAAC,EAAE,KAAK,IAAI;AAChE,UAAM,UAAqB,IAAI,MAAM,CAAC,EAAE,KAAK,QAAQ;AACrD,UAAM,aAAwB,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AACrD,UAAM,WAAsB,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AACnD,UAAM,UAAoB,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AAC7C,UAAM,cAAiD,IAAI,MAAM,CAAC,EAAE,KAAK,MAAS;AAClF,UAAM,mBAAsD,IAAI,MAAM,CAAC,EAAE,KAAK,MAAS;AACvF,UAAM,YAA+B,IAAI,MAAM,CAAC;AAChD,UAAM,WAAiC,IAAI,MAAM,CAAC;AAClD,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,YAAM,SAAS,QAAQ,QAAQ,QAAQ,CAAC,CAAC;AACzC,UAAI,WAAW,IAAI;AAClB,iBAAS,CAAC,IAAI,KAAK,KAAK,MAAM,MAAM;AACpC,gBAAQ,CAAC,IAAI,KAAK,KAAK,KAAK,MAAM;AAClC,mBAAW,CAAC,IAAI,KAAK,KAAK,QAAQ,MAAM;AACxC,iBAAS,CAAC,IAAI,KAAK,KAAK,MAAM,MAAM;AACpC,gBAAQ,CAAC,IAAI,KAAK,KAAK,KAAK,MAAM;AAClC,oBAAY,CAAC,IAAI,KAAK,KAAK,SAAS,MAAM;AAC1C,kBAAU,CAAC,IAAI,KAAK,KAAK,OAAO,MAAM;AAEtC,cAAM,MAAM,KAAK,KAAK,SAAS,MAAM;AACrC,YAAI,IAAK,KAAI,IAAI;AACjB,iBAAS,CAAC,IAAI;AAAA,MACf;AAAA,IACD;AACA,SAAK,MAAM,OAAO;AAClB,SAAK,KAAK,QAAQ;AAClB,SAAK,KAAK,OAAO;AACjB,SAAK,KAAK,UAAU;AACpB,SAAK,KAAK,QAAQ;AAClB,SAAK,KAAK,OAAO;AACjB,SAAK,KAAK,WAAW;AACrB,SAAK,KAAK,gBAAgB;AAC1B,SAAK,KAAK,SAAS;AACnB,SAAK,KAAK,WAAW;AACrB,SAAK,KAAK,WAAW,QAAQ,IAAI,MAAM,CAAC,CAAC;AACzC,SAAK,KAAK,aAAa,IAAI,MAAM,QAAQ,MAAM,EAAE,KAAK,MAAS;AAC/D,SAAK,WAAW;AAIhB,QAAI,KAAK,WAAW,WAAW;AAC9B,iBAAW,KAAK,MAAO,MAAK,gBAAgB,CAAC;AAAA,IAC9C;AACA,8BAA0BA,OAAM,SAAS,OAAO;AAOhD,QAAI,2BAA2B,KAAK,MAAM,YAAY,KAAK,KAAK,OAAO,WAAW,SAAS;AAC1F,UAAI,QAAQ,SAAS,EAAG,MAAK,MAAM,mBAAmB;AAAA,UACjD,kBAAiB;AAAA,IACvB;AAAA,EACD,UAAE;AACD,SAAK,MAAM,gBAAgB;AAAA,EAC5B;AAKA,MAAI,KAAK,MAAM,kBAAkB;AAChC,SAAK,MAAM,mBAAmB;AAC9B,SAAK,cAAc;AAAA,EACpB,WAAW,gBAAgB;AAC1B,QAAI,KAAK,MAAM,qBAAsB,MAAK,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,QACzD,MAAK,OAAO,SAAS,KAAK,OAAO,UAAU,YAAY;AAAA,EAC7D;AACA,SAAO;AACR;;;ACzDO,IAAM,OAAN,MAAM,MAAkB;AAAA,EACb;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACT,6BAA6B;AAAA,EAC7B,YAAY;AAAA,EAEpB,IAAY,WAAuB;AAClC,WAAO,KAAK,cAAc;AAAA,EAC3B;AAAA,EAEA,IAAY,SAAS,KAAiB;AACrC,SAAK,cAAc,QAAQ;AAAA,EAC5B;AAAA,EAEA,OAAe,8BAA8BC,OAA2B;AACvE,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AACV,SAAKA,MAAK;AAAA,EACX;AAAA,EAEA,YACC,MACA,YACA,OAAuB,CAAC,GACvB;AACD,UAAM,OAAO,yBAAyB;AACtC,UAAM,aAAa,KAAK,cAAc;AACtC,UAAM,cAAc,mCAAmC,KAAK,mBAAmB,MAAM;AACrF,UAAM,OAAO,KAAK,QAAQ;AAC1B,UAAM,WAAW,KAAK,YAAY;AAClC,UAAM,WAAW,KAAK;AACtB,UAAM,OAAO,KAAK,WAAW;AAI7B,QAAI,QAAQ,aAAa;AACxB,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAED,QAAI;AACJ,QAAI,eAAe,KAAM,UAAS;AAAA,aACzB,OAAO,eAAe,WAAY,UAAS,WAAW,SAAS,YAAY,IAAI;AAAA,QACnF,UAAS;AAEd,UAAM,IAAI,KAAK;AACf,UAAM,MAAM,mBAAmB,CAAC;AAChC,UAAM,aAAa,4BAA4B,KAAK,UAAU;AAC9D,UAAM,QAAQ;AAAA,MACb,OAAO;AAAA,MACP,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,aAAa;AAAA,MACb,YAAY,CAAC;AAAA,IACd;AACA,QAAI,KAAK,YAAY,QAAW;AAC/B,YAAM,QAAQ,KAAK;AACnB,YAAM,UAAU;AAChB,YAAM,SAAS;AAAA,IAChB;AACA,UAAM,eAAe,oBAAI,IAAa;AACtC,SAAK,QAAQ,QAAQ,IAAI,SAAS;AAClC,UAAM,UAAU,KAAK,MAAM;AAAA,MAC1B;AAAA,QACC;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS,KAAK,WAAW;AAAA,QACzB,qBAAqB,KAAK,uBAAuB;AAAA,QACjD,0BAA0B,KAAK,4BAA4B;AAAA,QAC3D,oBAAoB,KAAK,sBAAsB;AAAA,QAC/C,gBAAgB,KAAK,kBAAkB;AAAA,QACvC,iBAAiB,KAAK,mBAAmB;AAAA,QACzC;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS,KAAK,gBAAgB;AAAA,QAC9B,SAAS,KAAK,WAAW;AAAA,QACzB,MAAM,KAAK;AAAA,QACX,SAAS,KAAK;AAAA,MACf;AAAA,MACA;AAAA,QACC;AAAA,QACA,WAAW,EAAE,aAAa,oBAAI,IAAU,GAAG,WAAW,MAAM;AAAA,QAC5D;AAAA,QACA,MAAM;AAAA,UACL,SAAS;AAAA,UACT,iBAAiB;AAAA,UACjB,sBAAsB;AAAA,UACtB,uBAAuB;AAAA,UACvB,eAAe;AAAA,UACf,eAAe;AAAA,UACf,kBAAkB;AAAA,UAClB,gBAAgB;AAAA,QACjB;AAAA,QACA,SAAS;AAAA,UACR;AAAA,UACA,uBAAuB;AAAA,UACvB,aAAa,CAAC;AAAA,UACd,YAAY;AAAA,UACZ,YAAY;AAAA,UACZ,eAAe;AAAA,UACf,iBAAiB;AAAA,QAClB;AAAA,QACA,cAAc,EAAE,OAAO,UAAU,SAAS,MAAM;AAAA,QAChD,OAAO,EAAE,gBAAgB,CAAC,GAAG,cAAc,CAAC,EAAE;AAAA,QAC9C,SAAS,EAAE,OAAO,KAAK;AAAA,QACvB,SAAS;AAAA,UACR,QAAQ;AAAA,UACR,OAAO;AAAA,YACN;AAAA,YACA,KAAK,YAAY,SAAY,KAAK,UAAU;AAAA,UAC7C;AAAA,QACD;AAAA,MACD;AAAA,IACD;AACA,SAAK,MAAM,QAAQ;AACnB,SAAK,QAAQ,KAAK,MAAM,IAAO,KAAK,GAAG;AACvC,SAAK,OAAO,KAAK,MAAM,OAAO,KAAK,GAAG;AACtC,SAAK,SAAS,KAAK,MAAM,SAAY,KAAK,GAAG;AAC7C,SAAK,QAAQ,KAAK,MAAM,QAAQ,KAAK,GAAG;AACxC,SAAK,WAAW,KAAK,MAAM,WAAW,KAAK,GAAG;AAC9C,SAAK,aAAa,KAAK,MAAM,aAAa,KAAK,GAAG;AAClD,SAAK,gBAAgB,KAAK,MAAM,gBAAgB,KAAK,GAAG;AACxD,SAAK,SAAS,KAAK,MAAM,SAAS,KAAK,GAAG;AAC1C,SAAK,gBAAgB,KAAK,MAAM,WAAW,KAAK,GAAG;AACnD,SAAK,WAAW,KAAK,MAAM,WAAW,KAAK,GAAG;AAC9C,sBAAkB,IAAI,MAAuB,OAAO;AAAA,MACnD,OAAO,KAAK,OAAO;AAAA,MACnB,SAAS,KAAK,OAAO;AAAA,MACrB,UAAU,KAAK,OAAO;AAAA,MACtB,WAAW,KAAK,WAAW;AAAA,MAC3B,iBAAiB,KAAK,MAAM;AAAA,MAC5B,UAAU;AAAA,QACT,OAAO,KAAK,cAAc;AAAA,QAC1B,SAAS,KAAK,cAAc;AAAA,MAC7B;AAAA,MACA,SAAS,iBAAiB,KAAK,SAAS,KAAK;AAAA,MAC7C,QAAQ,KAAK,MAAM;AAAA,IACpB,EAAE;AACF,mBAAe,IAAI,MAAuB,CAAC,UAAU;AACpD,WAAK,mBAAmB,cAAc;AACtC,WAAK,OAAO,QAAQ,MAAM;AAC1B,WAAK,OAAO,UAAU,MAAM;AAC5B,WAAK,OAAO,SAAS,MAAM;AAC3B,WAAK,OAAO,WAAW,MAAM;AAC7B,WAAK,OAAO,cAAc;AAC1B,WAAK,OAAO,aAAa,CAAC;AAC1B,WAAK,MAAM,kBAAkB,MAAM;AACnC,WAAK,MAAM,uBAAuB;AAClC,WAAK,MAAM,wBAAwB;AACnC,WAAK,MAAM,UAAU;AACrB,WAAK,MAAM,gBAAgB;AAC3B,WAAK,MAAM,gBAAgB;AAC3B,WAAK,MAAM,mBAAmB;AAC9B,WAAK,MAAM,iBAAiB;AAC5B,WAAK,SAAS,cAAc,CAAC;AAC7B,WAAK,SAAS,wBAAwB;AACtC,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,aAAa;AAC3B,WAAK,SAAS,gBAAgB;AAC9B,WAAK,SAAS,kBAAkB;AAChC,WAAK,SAAS,aAAa,MAAM;AACjC,WAAK,cAAc,QAAQ,MAAM,SAAS;AAC1C,WAAK,cAAc,UAAU,MAAM,SAAS;AAC5C,UAAI,MAAM,YAAY,OAAO;AAC5B,aAAK,SAAS,SAAS,EAAE,SAAS,MAAM;AACxC,aAAK,SAAS,QAAQ;AAAA,MACvB,WAAW,MAAM,QAAQ,UAAU,GAAG;AACrC,aAAK,SAAS,SAAS,EAAE,SAAS,MAAM,OAAO,EAAE;AACjD,aAAK,SAAS,QAAQ,iBAAiB,MAAM,OAAO;AAAA,MACrD,OAAO;AACN,YAAI,CAAC,KAAK,SAAS,OAAO,WAAW,KAAK,SAAS,OAAO,UAAU,GAAG;AACtE,gBAAM,IAAI;AAAA,YACT,+CAA+C,MAAM,QAAQ,KAAK;AAAA,UACnE;AAAA,QACD;AAIA,YAAI,CAAC,MAAM,WAAW,MAAM,QAAQ,UAAU,GAAG;AAChD,gBAAM,IAAI;AAAA,YACT;AAAA,UACD;AAAA,QACD;AACA,cAAM,cAAc,cAAc,KAAK,SAAS,QAAQ,MAAM,SAAS,MAAM,KAAK;AAClF,YAAI,gBAAgB,MAAM,QAAQ,KAAK;AACtC,gBAAM,IAAI;AAAA,YACT;AAAA,UACD;AAAA,QACD;AACA,aAAK,SAAS,QAAQ,iBAAiB,MAAM,OAAO;AAAA,MACrD;AACA,WAAK,WAAW;AAChB,WAAK,eAAe;AAIpB,WAAK,WAAW,YAAY;AAC5B,WAAK,WAAW,YAAY,MAAM;AAClC,WAAK,6BAA6B;AAAA,IACnC,CAAC;AACD,qBAAiB,IAAI,MAAuB,MAAM,KAAK,gBAAgB,CAAC;AACxE,6BAAyB,IAAI,MAAuB,MAAM,KAAK,8BAA8B,CAAC;AAC9F,2BAAuB,IAAI,MAAuB,MAAM,KAAK,iBAAiB,CAAC;AAC/E,sBAAkB,IAAI,MAAuB,MAAM,KAAK,WAAW,SAAS;AAC5E,UAAK,8BAA8B,IAAqB;AAAA,EACzD;AAAA;AAAA,EAGQ,eAAwB;AAC/B,WAAO,KAAK,MAAM,QAAQ,KAAK,SAAS,eAAe;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,SAA6B;AAChC,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,IAAI,QAAuB;AAC1B,WAAO,KAAK,OAAO;AAAA,EACpB;AAAA,EAEA,IAAI,SAAiB;AACpB,WAAO,KAAK,OAAO;AAAA,EACpB;AAAA,EAEA,IAAI,UAAmC;AACtC,WAAO,iBAAiB,KAAK,SAAS,KAAK;AAAA,EAC5C;AAAA,EAEA,IAAI,OAA2B;AAC9B,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA,EAGA,IAAI,UAA8B;AACjC,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,OAAiC;AACpC,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,SAAwB;AAC3B,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA;AAAA,EAGA,UAAU,MAAwB;AACjC,SAAK,mBAAmB,WAAW;AAInC,cAAU;AACV,QAAI;AAGH,UAAI,KAAK,OAAO,aAAa,QAAW;AACvC,YAAI,KAAK,MAAM,gBAAgB;AAC9B,eAAK,6BAA6B;AAClC,eAAK,gBAAgB;AAAA,QACtB;AACC,gBAAM,IAAI;AAAA,YACT;AAAA,UACD;AAAA,MACF;AAEA,WAAK,WAAW,YAAY,IAAI,IAAI;AACpC,WAAK,CAAC,OAAO,CAAC;AACd,UAAI,KAAK,MAAM,UAAU,KAAK,KAAK,OAAO,WAAW,SAAS,GAAG;AAEhE,mBAAW,KAAK,KAAK,OAAO,WAAY,MAAK,CAAC,QAAQ,CAAC,CAAC;AAAA,MACzD,WAAW,KAAK,OAAO,WAAW,CAAC,KAAK,MAAM,MAAM;AAInD,aAAK,CAAC,QAAQ,KAAK,OAAO,KAAK,CAAC;AAAA,MACjC,WAAW,KAAK,OAAO,WAAW,WAAW,CAAC,KAAK,MAAM,MAAM;AAC9D,aAAK,CAAC,OAAO,CAAC;AAAA,MACf;AAEA,UAAI,CAAC,KAAK,WAAW,UAAW,MAAK,UAAU;AAE/C,aAAO,MAAM;AACZ,YAAI,CAAC,KAAK,WAAW,YAAY,OAAO,IAAI,EAAG;AAC/C,YAAI,KAAK,WAAW,YAAY,SAAS,EAAG,MAAK,YAAY;AAAA,MAC9D;AAAA,IACD,UAAE;AACD,eAAS;AAAA,IACV;AAAA,EACD;AAAA;AAAA,EAGA,KAAK,MAAkB;AACtB,SAAK,mBAAmB,MAAM;AAG9B,cAAU;AACV,QAAI;AACH,WAAK,MAAM,IAAI;AAAA,IAChB,UAAE;AACD,eAAS;AAAA,IACV;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,GAAG,MAAY,WAA0B;AACxC,SAAK,mBAAmB,IAAI;AAE5B,cAAU;AACV,QAAI;AACH,WAAK,IAAI,MAAM,SAAS;AAAA,IACzB,UAAE;AACD,eAAS;AAAA,IACV;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,YAAY,SAA0B,IAAkB;AACvD,SAAK,mBAAmB,aAAa;AACrC,SAAK,QAAQ,KAAK,WAAW,OAAO,GAAG,EAAE;AAAA,EAC1C;AAAA;AAAA,EAGA,aAAa,SAAwB,IAAoB;AACxD,SAAK,mBAAmB,cAAc;AACtC,UAAM,OAAO,KAAK,MAAM,KAAK,SAAS,OAAO,IAC1C,CAAC,GAAG,KAAK,MAAM,IAAI,IACnB,CAAC,GAAG,KAAK,MAAM,MAAM,OAAO;AAC/B,UAAM,WAAW,KAAK,QAAQ,MAAM,EAAE;AACtC,WAAO,WAAW,KAAK,QAAQ,OAAO,IAAI,KAAK,MAAM,KAAK,QAAQ,OAAO;AAAA,EAC1E;AAAA;AAAA,EAGA,eAAe,SAAwB,IAAkB;AACxD,SAAK,mBAAmB,gBAAgB;AACxC,SAAK;AAAA,MACJ,KAAK,MAAM,KAAK,OAAO,CAAC,MAAM,MAAM,OAAO;AAAA,MAC3C;AAAA,IACD;AAAA,EACD;AAAA,EAEQ,mBAAmB,IAAoB;AAC9C,0BAAsB,gBAAgB,IAAI,GAAG,EAAE;AAAA,EAChD;AAAA,EAEQ,eAAe,MAAY,WAA0B;AAC5D,sBAAkB,gBAAgB,IAAI,GAAG,MAAM,SAAS;AAAA,EACzD;AAAA,EAEQ,iBAAiB,IAAoB;AAC5C,wBAAoB,gBAAgB,IAAI,GAAG,EAAE;AAAA,EAC9C;AAAA,EAEQ,WAAW,MAAwC;AAC1D,UAAM,OAAO,oBAAI,IAAmB;AACpC,UAAM,MAAuB,CAAC;AAC9B,eAAW,KAAK;AACf,UAAI,CAAC,KAAK,IAAI,CAAC,GAAG;AACjB,aAAK,IAAI,CAAC;AACV,YAAI,KAAK,CAAC;AAAA,MACX;AACD,WAAO;AAAA,EACR;AAAA,EAEQ,mBAAmB,MAAqB,QAAgC;AAC/E,UAAM,OAAO,oBAAI,IAAmB;AACpC,UAAM,QAAyB,CAAC,IAAI;AACpC,WAAO,MAAM,SAAS,GAAG;AACxB,YAAM,IAAI,MAAM,IAAI;AACpB,UAAI,MAAM,OAAW;AACrB,UAAI,MAAM,OAAQ,QAAO;AACzB,UAAI,KAAK,IAAI,CAAC,EAAG;AACjB,WAAK,IAAI,CAAC;AACV,iBAAW,KAAK,gBAAgB,CAAC,EAAE,MAAM,KAAM,OAAM,KAAK,CAAC;AAAA,IAC5D;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,sBAAsB,KAA0B;AACvD,UAAM,YAAY,aAAa,IAAgC;AAC/D,UAAM,WAAW,aAAa,GAAG;AACjC,QAAI,cAAc,UAAa,aAAa,UAAa,cAAc;AACtE,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,EACF;AAAA,EAEQ,QACP,SACA,IACA,OAAyC,CAAC,GAChC;AACV,WAAO,WAAW,gBAAgB,IAAI,GAAG,SAAS,IAAI,IAAI;AAAA,EAC3D;AAAA;AAAA,EAIQ,YAAkB;AACzB,iBAAa,gBAAgB,IAAI,CAAC;AAAA,EACnC;AAAA,EAEQ,cAAoB;AAC3B,mBAAe,gBAAgB,IAAI,CAAC;AAAA,EACrC;AAAA,EAEQ,mBAAmB,IAAkB;AAC5C,QAAI,KAAK;AACR,YAAM,IAAI,MAAM,GAAG,EAAE,0DAA0D;AAAA,EACjF;AAAA,EAEQ,mBAA2B;AAClC,WAAO,oBAAoB,gBAAgB,IAAI,CAAC;AAAA,EACjD;AAAA,EAEQ,gCAAyC;AAChD,WAAO,iCAAiC,gBAAgB,IAAI,CAAC;AAAA,EAC9D;AAAA,EAEQ,kBAAwB;AAC/B,uBAAmB,gBAAgB,IAAI,CAAC;AAAA,EACzC;AAAA,EAEQ,iBAAuB;AAC9B,sBAAkB,gBAAgB,IAAI,CAAC;AAAA,EACxC;AAAA,EAEQ,gBAAgB,SAAwB,OAAmC,CAAC,GAAS;AAC5F,uBAAmB,gBAAgB,IAAI,GAAG,SAAS,IAAI;AAAA,EACxD;AAAA,EAEQ,mBAAmB,KAAa,SAA8B;AACrE,0BAAsB,gBAAgB,IAAI,GAAG,KAAK,OAAO;AAAA,EAC1D;AAAA,EAEQ,qBAAqB,KAAa,UAA+C;AACxF,WAAO,wBAAwB,gBAAgB,IAAI,GAAG,KAAK,QAAQ;AAAA,EACpE;AAAA,EAEQ,sBAAsB,KAAsB;AACnD,WAAO,yBAAyB,gBAAgB,IAAI,GAAG,GAAG;AAAA,EAC3D;AAAA,EAEQ,gBAAgB,KAAa,KAAc,UAA+B;AACjF,uBAAmB,gBAAgB,IAAI,GAAG,KAAK,KAAK,QAAQ;AAAA,EAC7D;AAAA,EAEQ,iBAAiB,KAAmB;AAC3C,wBAAoB,gBAAgB,IAAI,GAAG,GAAG;AAAA,EAC/C;AAAA,EAEQ,+BAAqC;AAC5C,oCAAgC,gBAAgB,IAAI,CAAC;AAAA,EACtD;AAAA,EAEQ,aAAmB;AAC1B,kBAAc,gBAAgB,IAAI,CAAC;AAAA,EACpC;AAAA,EAEQ,YAAkB;AACzB,iBAAa,gBAAgB,IAAI,CAAC;AAAA,EACnC;AAAA,EAEQ,gBAAsB;AAC7B,qBAAiB,gBAAgB,IAAI,CAAC;AAAA,EACvC;AAAA,EAEQ,UAAgB;AACvB,eAAW,gBAAgB,IAAI,CAAC;AAAA,EACjC;AAAA,EAEQ,kBAA2B;AAClC,WAAO,mBAAmB,gBAAgB,IAAI,CAAC;AAAA,EAChD;AAAA,EAEQ,mBAAyB;AAChC,wBAAoB,gBAAgB,IAAI,CAAC;AAAA,EAC1C;AAAA,EAEQ,WAAiB;AACxB,gBAAY,gBAAgB,IAAI,CAAC;AAAA,EAClC;AAAA,EAEQ,YAAiB;AACxB,WAAO,aAAa,gBAAgB,IAAI,CAAC;AAAA,EAC1C;AAAA,EAEQ,SAAS,UAIT;AACP,WAAO,YAAY,gBAAgB,IAAI,GAAG,QAAQ;AAAA,EACnD;AAAA,EAEQ,YAAY,KAAgB;AACnC,mBAAe,gBAAgB,IAAI,GAAG,GAAG;AAAA,EAC1C;AAAA,EAEQ,aAAuB;AAC9B,WAAO,cAAc,gBAAgB,IAAI,CAAC;AAAA,EAC3C;AAAA;AAAA,EAIQ,MAAM,MAAkB;AAC/B,aAAS,gBAAgB,IAAI,GAAG,IAAI;AAAA,EACrC;AAAA,EAEQ,IAAI,MAAY,WAAoB,OAA4B;AACvE,WAAO,gBAAgB,IAAI,GAAG,MAAM,WAAW,KAAK;AAAA,EACrD;AAAA,EAEQ,kBAAkB,QAAgB,OAA8B;AACvE,WAAO,qBAAqB,gBAAgB,IAAI,GAAG,QAAQ,KAAK;AAAA,EACjE;AAAA,EAEQ,WAAW,GAAY,WAA+B,OAA2B;AACxF,kBAAc,gBAAgB,IAAI,GAAG,GAAG,WAAW,KAAK;AAAA,EACzD;AAAA,EAEQ,YAAqB;AAC5B,WAAO,aAAa,gBAAgB,IAAI,CAAC;AAAA,EAC1C;AAAA,EAEQ,wBAAiC;AACxC,WAAO,yBAAyB,gBAAgB,IAAI,CAAC;AAAA,EACtD;AAAA,EAEQ,eAAwB;AAC/B,WAAO,gBAAgB,gBAAgB,IAAI,CAAC;AAAA,EAC7C;AAAA,EAEQ,cAAc,QAAuB;AAC5C,qBAAiB,gBAAgB,IAAI,GAAG,MAAM;AAAA,EAC/C;AAAA,EAEQ,cAAc,QAAuB;AAC5C,qBAAiB,gBAAgB,IAAI,GAAG,MAAM;AAAA,EAC/C;AAAA,EAEQ,YAAkB;AACzB,iBAAa,gBAAgB,IAAI,CAAC;AAAA,EACnC;AAAA,EAEQ,iBAA0B;AACjC,WAAO,kBAAkB,gBAAgB,IAAI,CAAC;AAAA,EAC/C;AAAA,EAEQ,mBAAmB,QAA0B;AACpD,0BAAsB,gBAAgB,IAAI,GAAG,MAAM;AAAA,EACpD;AAAA,EAEQ,UAAU,QAA0B;AAC3C,iBAAa,gBAAgB,IAAI,GAAG,MAAM;AAAA,EAC3C;AAAA,EAEQ,kBAAwB;AAC/B,uBAAmB,gBAAgB,IAAI,CAAC;AAAA,EACzC;AAAA,EAEQ,yBAA+B;AACtC,8BAA0B,gBAAgB,IAAI,CAAC;AAAA,EAChD;AAAA,EAEQ,uBAAgC;AACvC,WAAO,wBAAwB,gBAAgB,IAAI,CAAC;AAAA,EACrD;AAAA,EAEQ,YAAY,UAA+B;AAClD,mBAAe,gBAAgB,IAAI,GAAG,QAAQ;AAAA,EAC/C;AAAA,EAEQ,mBAA4B;AACnC,WAAO,oBAAoB,gBAAgB,IAAI,CAAC;AAAA,EACjD;AAAA,EAEQ,YAAY,KAAc,UAA+B;AAChE,mBAAe,gBAAgB,IAAI,GAAG,KAAK,QAAQ;AAAA,EACpD;AAAA;AAAA,EAGQ,kBAAwB;AAC/B,uBAAmB,gBAAgB,IAAI,CAAC;AAAA,EACzC;AAAA;AAAA,EAGA,oBAAoB,MAAkB;AACrC,0BAAsB,gBAAgB,IAAI,GAAG,IAAI;AAAA,EAClD;AAAA;AAAA,EAGA,oBAA0B;AACzB,wBAAoB,gBAAgB,IAAI,CAAC;AAAA,EAC1C;AAAA;AAAA,EAGA,gBAAgB,IAAgB,YAA2B;AAC1D,sBAAkB,gBAAgB,IAAI,GAAG,IAAI,UAAU;AAAA,EACxD;AACD;AAwBO,SAAS,KACf,OAAwB,CAAC,GACzB,aAAqC,MACrC,OAAuB,CAAC,GACd;AACV,SAAO,IAAI,KAAQ,MAAM,YAAY,IAAI;AAC1C;;;AC/xBO,SAAS,iBAAiB,OAAgB,OAAO,KAA0B;AACjF,MAAI;AACH,WAAO,gBAAgB,OAAO,gBAAgB,OAAO,KAAK,CAAC;AAAA,EAC5D,SAAS,OAAO;AACf,UAAM,IAAI,UAAU,wBAAwB,IAAI,kCAAkC;AAAA,MACjF;AAAA,IACD,CAAC;AAAA,EACF;AACD;AAmBA,IAAM,2BAA2B,oBAAI,QAAgD;AAG9E,SAAS,gCACfC,OACA,aACO;AACP,2BAAyB,IAAIA,OAAM,WAAW;AAC/C;;;AC6CO,SAAS,SACf,IACA,MACA,OAA0B,CAAC,GACd;AACb,SAAO,aAAa,IAAI,MAAM,IAAI;AACnC;AAYA,SAAS,aACR,IACA,MACA,MACa;AACb,QAAM,OAAO,eAAe,EAAE;AAK9B,SAAO,IAAI,KAAW,CAAC,GAAG,IAAI,GAAG,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,GAAG,MAAM,GAAG,KAAK,CAAC;AACpF;AAGO,SAAS,eAA0B,IAAiC;AAC1E,SAAO,CAAC,QAAQ;AACf,QAAI;AACH,SAAG,KAAK,GAAG;AAAA,IACZ,SAAS,GAAG;AACX,UAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,8CAA8C,CAAC,CAAC,CAAC;AAAA,IACtF;AAAA,EACD;AACD;;;AC1EA,SAAS,UAAU,GAAqC;AACvD,SAAO,aAAa,CAAC;AACtB;AAEO,SAAS,qBAAqB,OAAc,GAAkB,OAAqB;AACzF,MAAI,sBAAsB,CAAC,GAAG;AAC7B,UAAM,IAAI,MAAM,GAAG,KAAK,oDAAoD;AAAA,EAC7E;AACA,QAAM,WAAW,UAAU,CAAC;AAC5B,MAAI,aAAa,UAAa,aAAa,OAAO;AACjD,UAAM,IAAI;AAAA,MACT,GAAG,KAAK;AAAA,IACT;AAAA,EACD;AACD;;;AC0HO,SAAS,uBAAuB,OAA0C;AAChF,QAAM,SAAmB,CAAC;AAC1B,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAChD,WAAO,EAAE,IAAI,OAAO,QAAQ,CAAC,4BAA4B,EAAE;AAAA,EAC5D;AACA,QAAM,WAAW;AACjB,MAAI,OAAO,SAAS,OAAO,YAAY,SAAS,GAAG,WAAW,GAAG;AAChE,WAAO,KAAK,+BAA+B;AAAA,EAC5C;AACA,MAAI,CAAC,OAAO,OAAO,UAAU,SAAS,GAAG;AACxC,WAAO,KAAK,yBAAyB;AAAA,EACtC;AACA,MAAI,OAAO,SAAS,QAAQ,UAAU;AACrC,WAAO,KAAK,sBAAsB;AAAA,EACnC;AACA,QAAM,aAAa,SAAS;AAC5B,MACC,CAAC,OAAO,SAAS,UAAU,KAC3B,eAAe,UACf,aAAa,KACb,aAAa,GACZ;AACD,WAAO,KAAK,8CAA8C;AAAA,EAC3D;AACA,MAAI,CAAC,eAAe,SAAS,MAAM,CAAC,QAAuB,OAAO,QAAQ,QAAQ,GAAG;AACpF,WAAO,KAAK,sCAAsC;AAAA,EACnD;AACA,MAAI,CAAC,eAAe,SAAS,SAAS,CAACC,YAA6B,OAAOA,YAAW,QAAQ,GAAG;AAChG,WAAO,KAAK,yCAAyC;AAAA,EACtD;AACA,MAAI,SAAS,cAAc,UAAa,OAAO,SAAS,cAAc,UAAU;AAC/E,WAAO,KAAK,yCAAyC;AAAA,EACtD;AACA,MAAI,SAAS,YAAY,UAAa,OAAO,SAAS,YAAY,UAAU;AAC3E,WAAO,KAAK,uCAAuC;AAAA,EACpD;AACA,MACC,OAAO,SAAS,cAAc,YAC9B,OAAO,SAAS,YAAY,YAC5B,SAAS,aAAa,SAAS,SAC9B;AACD,WAAO,KAAK,wCAAwC;AAAA,EACrD;AACA,MACC,SAAS,cAAc,UACvB,CAAC;AAAA,IAAe,SAAS;AAAA,IAAW,CAAC,cACpC,OAAO,SAAS,SAAS;AAAA,EAC1B,GACC;AACD,WAAO,KAAK,sDAAsD;AAAA,EACnE;AACA,MAAI,SAAS,qBAAqB,UAAa,OAAO,SAAS,qBAAqB,UAAU;AAC7F,WAAO,KAAK,gDAAgD;AAAA,EAC7D;AACA,MAAI,SAAS,eAAe,UAAa,OAAO,SAAS,eAAe,UAAU;AACjF,WAAO,KAAK,0CAA0C;AAAA,EACvD;AACA,SAAO,EAAE,IAAI,OAAO,WAAW,GAAG,OAAO;AAC1C;AA+DA,SAAS,eAAkB,OAAgB,WAAuD;AACjG,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,KAAK,CAAC,UAAU,MAAM,CAAC,CAAC,EAAG,QAAO;AAAA,EAC9D;AACA,SAAO;AACR;;;ACrRO,SAAS,0BACf,OACA,OAIC;AACD,MAAI;AACH,WAAO,+BAAkC,OAAO,KAAK;AAAA,EACtD,SAAS,OAAO;AACf,WAAO;AAAA,MACN,QAAQ;AAAA,QACP;AAAA,UACC,MAAM;AAAA,UACN,SAAS,8CAA8C,aAAa,KAAK,CAAC;AAAA,UAC1E;AAAA,UACA,QAAQ;AAAA,UACR,kBAAkB,OAAO,OAAO,CAAC,sBAAsB,CAAC;AAAA,QACzD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAEO,SAAS,+BACf,OACA,OAIC;AACD,QAAM,SAA+C,CAAC;AACtD,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACxE,WAAO;AAAA,MACN,QAAQ;AAAA,QACP;AAAA,UACC,MAAM;AAAA,UACN,SAAS;AAAA,UACT;AAAA,UACA,QAAQ;AAAA,QACT;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACA,QAAM,SAAS;AACf,QAAM,WAAW,OAAO,OAAO,OAAO,WAAW,OAAO,KAAK;AAC7D,MAAI,aAAa,UAAa,SAAS,WAAW,GAAG;AACpD,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,CAAC,sCAAsC;AAAA,IAC1D,CAAC;AAAA,EACF;AACA,MAAI,CAAC,oBAAoB,OAAO,IAAI,GAAG;AACtC,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,CAAC,sEAAsE;AAAA,IAC1F,CAAC;AAAA,EACF;AACA,MAAI,CAAC,gCAAgC,OAAO,gBAAgB,GAAG;AAC9D,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB;AAAA,QACjB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,EACF;AACA,MAAI,CAAC,4BAA4B,OAAO,YAAY,GAAG;AACtD,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,CAAC,8DAA8D;AAAA,IAClF,CAAC;AAAA,EACF;AACA,QAAM,kBAAkB,cAAc,OAAO,KAAK;AAClD,MAAI,CAAC,gBAAgB,IAAI;AACxB,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,OAAO,OAAO,gBAAgB,MAAM;AAAA,IACvD,CAAC;AAAA,EACF;AACA,QAAM,qBAAqB,uBAAuB,OAAO,QAAQ;AACjE,MAAI,CAAC,mBAAmB,IAAI;AAC3B,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,YACC,OAAO,OAAO,aAAa,YAC3B,OAAO,aAAa,QACpB,OAAQ,OAAO,SAAqC,OAAO,WACvD,OAAO,SAAqC,KAC7C;AAAA,MACJ,QAAQ;AAAA,MACR,kBAAkB,OAAO,OAAO,CAAC,GAAG,mBAAmB,MAAM,CAAC;AAAA,IAC/D,CAAC;AAAA,EACF;AACA,QAAM,kBAAkB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACA,QAAM,mBAAmB,gBAAgB,OAAO,CAAC,UAAU,OAAO,OAAO,QAAQ,KAAK,CAAC;AACvF,MAAI,iBAAiB,SAAS,GAAG;AAChC,WAAO,KAAK;AAAA,MACX,MAAM;AAAA,MACN,SAAS;AAAA,MACT;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,kBAAkB,OAAO;AAAA,QACxB,iBAAiB,IAAI,CAAC,UAAU,GAAG,KAAK,qCAAqC;AAAA,MAC9E;AAAA,IACD,CAAC;AAAA,EACF;AACA,MAAI,OAAO,SAAS,EAAG,QAAO,EAAE,OAAO;AACvC,QAAM,QAAQ,gBAAgB;AAC9B,QAAM,WAAW,iBAAiB,OAAO,QAA6B;AACtE,SAAO;AAAA,IACN,QAAQ,OAAO,OAAO;AAAA,MACrB,IAAI;AAAA,MACJ,MAAM,OAAO;AAAA,MACb,kBAAkB,OAAO;AAAA,MACzB,cAAc,OAAO;AAAA,MACrB,GAAI,UAAU,SAAY,CAAC,IAAI,EAAE,MAAM;AAAA,MACvC;AAAA,IACD,CAAC;AAAA,IACD;AAAA,EACD;AACD;AAEO,SAAS,iBAAoB,UAAgD;AACnF,SAAO,OAAO,OAAO;AAAA,IACpB,IAAI,SAAS;AAAA,IACb,SAAS,SAAS;AAAA,IAClB,KAAK,SAAS;AAAA,IACd,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,SAAS,UAAU;AAAA,IAC5E,GAAI,SAAS,YAAY,SAAY,CAAC,IAAI,EAAE,SAAS,SAAS,QAAQ;AAAA,IACtE,YAAY,SAAS;AAAA,IACrB,MAAM,OAAO,OAAO,CAAC,GAAG,SAAS,IAAI,CAAC;AAAA,IACtC,SAAS,OAAO,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC;AAAA,IAC5C,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,OAAO,OAAO,CAAC,GAAG,SAAS,SAAS,CAAC,EAAE;AAAA,IACvD,GAAI,SAAS,qBAAqB,SAC/B,CAAC,IACD,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,IACjD,GAAI,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,YAAY,SAAS,WAAW;AAAA,EAChF,CAAC;AACF;AAiFO,SAAS,oBAAoB,OAA4C;AAC/E,SACC,UAAU,aACV,UAAU,cACV,UAAU,cACV,UAAU,gBACV,UAAU;AAEZ;AAEO,SAAS,gCACf,OACyC;AACzC,SACC,UAAU,UACV,UAAU,aACV,UAAU,aACV,UAAU,cACV,UAAU,eACV,UAAU;AAEZ;AAEO,SAAS,4BAA4B,OAAoD;AAC/F,SAAO,UAAU,SAAS,UAAU,aAAa,UAAU,aAAa,UAAU;AACnF;AAEO,SAAS,cAAc,OAI5B;AACD,MAAI,UAAU,OAAW,QAAO,EAAE,IAAI,MAAM,QAAQ,CAAC,EAAE;AACvD,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACxE,WAAO,EAAE,IAAI,OAAO,QAAQ,CAAC,sCAAsC,EAAE;AAAA,EACtE;AACA,QAAM,QAAQ;AACd,QAAM,SAAmB,CAAC;AAC1B,QAAM,UAAU,oBAAI,IAAI,CAAC,aAAa,aAAa,UAAU,UAAU,CAAC;AACxE,aAAW,OAAO,OAAO,KAAK,KAAK,GAAG;AACrC,QAAI,CAAC,QAAQ,IAAI,GAAG,EAAG,QAAO,KAAK,SAAS,GAAG,oCAAoC;AAAA,EACpF;AACA,aAAW,OAAO,SAAS;AAC1B,QAAI,MAAM,GAAG,MAAM,WAAc,OAAO,MAAM,GAAG,MAAM,YAAY,MAAM,GAAG,EAAE,WAAW,IAAI;AAC5F,aAAO,KAAK,SAAS,GAAG,0CAA0C;AAAA,IACnE;AAAA,EACD;AACA,MAAI,OAAO,SAAS,EAAG,QAAO,EAAE,IAAI,OAAO,OAAO;AAClD,SAAO;AAAA,IACN,IAAI;AAAA,IACJ;AAAA,IACA,OAAO,OAAO,OAAO;AAAA,MACpB,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,UAAoB;AAAA,MAChF,GAAI,MAAM,cAAc,SAAY,CAAC,IAAI,EAAE,WAAW,MAAM,UAAoB;AAAA,MAChF,GAAI,MAAM,WAAW,SAAY,CAAC,IAAI,EAAE,QAAQ,MAAM,OAAiB;AAAA,MACvE,GAAI,MAAM,aAAa,SAAY,CAAC,IAAI,EAAE,UAAU,MAAM,SAAmB;AAAA,IAC9E,CAAC;AAAA,EACF;AACD;AAEO,SAAS,cAAc,OAAkD;AAC/E,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEO,SAAS,QAAQ,OAAmD;AAC1E,SAAO,OAAO,KAAK,KAAK,EAAE,KAAK;AAChC;AAEO,SAAS,gBACf,OACA,UACA,OACO;AACP,QAAM,SAAS,QAAQ,KAAK;AAC5B,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,uBAAuB,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EACtE;AACD;AAEO,SAAS,oCAAoC,OAAsB;AACzE,MAAI,CAAC,cAAc,KAAK,GAAG;AAC1B,UAAM,IAAI,UAAU,oDAAoD;AAAA,EACzE;AACA,qBAAmB,OAAO,iCAAiC;AAC3D;AAAA,IACC;AAAA,IACA,MAAM,UAAU,SACb,CAAC,gBAAgB,YAAY,MAAM,QAAQ,kBAAkB,IAC7D,CAAC,gBAAgB,YAAY,MAAM,QAAQ,oBAAoB,OAAO;AAAA,IACzE;AAAA,EACD;AACA,QAAM,WAAW,MAAM;AACvB,MAAI,CAAC,cAAc,QAAQ,GAAG;AAC7B,UAAM,IAAI,UAAU,sDAAsD;AAAA,EAC3E;AACA,qBAAmB,UAAU,0CAA0C;AACvE;AAAA,IACC;AAAA,IACA;AAAA,MACC;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MACxD,GAAI,SAAS,YAAY,SAAY,CAAC,IAAI,CAAC,SAAS;AAAA,MACpD;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,SAAS,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MACxD,GAAI,SAAS,qBAAqB,SAAY,CAAC,IAAI,CAAC,kBAAkB;AAAA,MACtE,GAAI,SAAS,eAAe,SAAY,CAAC,IAAI,CAAC,YAAY;AAAA,IAC3D;AAAA,IACA;AAAA,EACD;AACA,EAAAC,uBAAsB,SAAS,MAAM,sBAAsB;AAC3D,EAAAA,uBAAsB,SAAS,SAAS,yBAAyB;AACjE,MAAI,SAAS,cAAc,QAAW;AACrC,IAAAA,uBAAsB,SAAS,WAAW,2BAA2B;AAAA,EACtE;AACA,MAAI,MAAM,UAAU,OAAW,kBAAiB,MAAM,KAAK;AAC5D;AAEO,SAAS,mBAAmB,OAAe,OAAqB;AACtE,MAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,GAAG;AACnD,UAAM,IAAI,UAAU,GAAG,KAAK,4BAA4B;AAAA,EACzD;AACD;AAEO,SAAS,oBAAoB,OAAe,OAAuB;AACzE,QAAM,MAAM,MAAM,SAAS,EAAE;AAC7B,MAAI,CAAC,mBAAmB,KAAK,GAAG,GAAG;AAClC,UAAM,IAAI,UAAU,GAAG,KAAK,mDAAmD;AAAA,EAChF;AACA,SAAO;AACR;AAEO,SAAS,mBAAmB,OAAgB,OAAuB;AACzE,MAAI,OAAO,UAAU,YAAY,CAAC,mBAAmB,KAAK,KAAK,GAAG;AACjE,UAAM,IAAI,UAAU,GAAG,KAAK,4CAA4C;AAAA,EACzE;AACA,SAAO,OAAO,KAAK;AACpB;AAEO,SAASA,uBAAsB,OAAgB,OAAgC;AACrF,MAAI;AACH,oBAAgB,OAAO,KAAK;AAC5B,WAAO;AAAA,EACR,SAAS,OAAO;AACf,UAAM,IAAI,UAAU,GAAG,KAAK,yBAAyB,aAAa,KAAK,CAAC,EAAE;AAAA,EAC3E;AACD;AAEO,SAAS,iBAAiB,OAAoC;AACpE,MAAI,CAAC,cAAc,KAAK,GAAG;AAC1B,UAAM,IAAI,UAAU,gEAAgE;AAAA,EACrF;AACA,EAAAA,uBAAsB,OAAO,cAAc;AAC3C,QAAM,aAAa,cAAc,KAAK;AACtC,MAAI,CAAC,WAAW,MAAM,WAAW,UAAU,QAAW;AACrD,UAAM,IAAI,UAAU,4CAA4C,WAAW,OAAO,KAAK,IAAI,CAAC,EAAE;AAAA,EAC/F;AACA;AAAA,IACC;AAAA,IACA;AAAA,MACC,GAAK,MAAkC,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAClF,GAAK,MAAkC,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAClF,GAAK,MAAkC,WAAW,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,MAC5E,GAAK,MAAkC,aAAa,SAAY,CAAC,IAAI,CAAC,UAAU;AAAA,IACjF;AAAA,IACA;AAAA,EACD;AACA,SAAO,WAAW;AACnB;AAEO,SAAS,gBAAgB,OAAmC;AAClE,MAAI,CAAC,oBAAoB,KAAK,GAAG;AAChC,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACpE;AACA,SAAO;AACR;AAEO,SAAS,4BAA4B,OAA+C;AAC1F,MAAI,CAAC,gCAAgC,KAAK,GAAG;AAC5C,UAAM,IAAI,UAAU,qDAAqD;AAAA,EAC1E;AACA,SAAO;AACR;AAEO,SAAS,wBAAwB,OAA2C;AAClF,MAAI,CAAC,4BAA4B,KAAK,GAAG;AACxC,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACtE;AACA,SAAO;AACR;AAEO,SAAS,qBAAqB,OAAgB,OAAuB;AAC3E,MAAI,CAAC,iBAAiB,KAAK,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;AACvF,SAAO;AACR;AAEO,SAAS,aAAa,OAAgB,OAAuB;AACnE,MAAI,OAAO,UAAU,SAAU,OAAM,IAAI,UAAU,GAAG,KAAK,mBAAmB;AAC9E,SAAO;AACR;AAEO,SAAS,iBAAiB,OAAgB,OAAuB;AACvE,MAAI,CAAC,OAAO,SAAS,KAAK,KAAM,QAAmB,KAAM,QAAmB,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,oCAAoC;AAAA,EACjE;AACA,SAAO;AACR;AAEO,SAAS,kBAAkB,OAAgB,OAAkC;AACnF,MAAI,CAACC,gBAAe,OAAO,CAAC,SAAyB,OAAO,SAAS,QAAQ,GAAG;AAC/E,UAAM,IAAI,UAAU,GAAG,KAAK,kCAAkC;AAAA,EAC/D;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;AAChC;AAEO,SAAS,wBAAwB,OAAgB,OAAkC;AACzF,MAAI,CAACA,gBAAe,OAAO,CAAC,SAAyB,OAAO,SAAS,IAAI,CAAC,GAAG;AAC5E,UAAM,IAAI,UAAU,GAAG,KAAK,gCAAgC;AAAA,EAC7D;AACA,SAAO,OAAO,OAAO,CAAC,GAAG,KAAK,CAAC;AAChC;AAEO,SAAS,iBAAiB,OAAiC;AACjE,SAAO,OAAO,UAAU,YAAY,MAAM,SAAS;AACpD;AAEO,SAASA,gBACf,OACA,WACe;AACf,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,QAAO;AAClC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,KAAK,CAAC,UAAU,MAAM,CAAC,CAAC,EAAG,QAAO;AAAA,EAC9D;AACA,SAAO;AACR;AAqBO,SAAS,aAAa,OAAwB;AACpD,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;AC/lBO,IAAM,qCAAqC;AAC3C,IAAM,sCAAsC;AAE5C,SAAS,yBACf,QACkC;AAClC,QAAM,SAAS,0BAAiC,QAAQ,CAAC;AACzD,MAAI,OAAO,OAAO,SAAS,KAAK,OAAO,WAAW,QAAW;AAC5D,UAAM,IAAI;AAAA,MACT,6CAA6C,OAAO,OAClD,QAAQ,CAAC,UAAU,MAAM,oBAAoB,CAAC,MAAM,OAAO,CAAC,EAC5D,KAAK,IAAI,CAAC;AAAA,IACb;AAAA,EACD;AACA,sCAAoC,MAAM;AAC1C,EAAAC,uBAAsB,OAAO,OAAO,SAAS,SAAS,yBAAyB;AAC/E,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ,OAAO,OAAO;AAAA,MACrB,IAAI,OAAO,OAAO;AAAA,MAClB,MAAM,OAAO,OAAO;AAAA,MACpB,kBAAkB,OAAO,OAAO;AAAA,MAChC,cAAc,OAAO,OAAO;AAAA,MAC5B,GAAI,OAAO,OAAO,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,OAAO,OAAO,MAAM;AAAA,MAC1E,UAAU,cAAc,OAAO,OAAO,QAAiC;AAAA,IACxE,CAAC;AAAA,EACF,CAAC;AACF;AAGO,SAAS,+BACf,OACkC;AAClC,MAAI,CAAC,cAAc,KAAK;AACvB,UAAM,IAAI,UAAU,mDAAmD;AACxE,EAAAA,uBAAsB,OAAO,0BAA0B;AACvD,kBAAgB,OAAO,CAAC,UAAU,UAAU,SAAS,GAAG,0BAA0B;AAClF,MAAI,MAAM,WAAW,oCAAoC;AACxD,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAC/D;AACA,MAAI,MAAM,YAAY,qCAAqC;AAC1D,UAAM,IAAI,UAAU,2CAA2C;AAAA,EAChE;AACA,QAAM,YAAY,MAAM;AACxB,MAAI,CAAC,cAAc,SAAS,GAAG;AAC9B,UAAM,IAAI,UAAU,oDAAoD;AAAA,EACzE;AACA;AAAA,IACC;AAAA,IACA,UAAU,UAAU,SACjB,CAAC,gBAAgB,YAAY,MAAM,QAAQ,kBAAkB,IAC7D,CAAC,gBAAgB,YAAY,MAAM,QAAQ,oBAAoB,OAAO;AAAA,IACzE;AAAA,EACD;AACA,QAAM,cAAc,UAAU;AAC9B,MAAI,CAAC,cAAc,WAAW,GAAG;AAChC,UAAM,IAAI,UAAU,sDAAsD;AAAA,EAC3E;AACA;AAAA,IACC;AAAA,IACA;AAAA,MACC;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,YAAY,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAC3D,GAAI,YAAY,YAAY,SAAY,CAAC,IAAI,CAAC,SAAS;AAAA,MACvD;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,YAAY,cAAc,SAAY,CAAC,IAAI,CAAC,WAAW;AAAA,MAC3D,GAAI,YAAY,qBAAqB,SAAY,CAAC,IAAI,CAAC,kBAAkB;AAAA,MACzE,GAAI,YAAY,eAAe,SAAY,CAAC,IAAI,CAAC,YAAY;AAAA,IAC9D;AAAA,IACA;AAAA,EACD;AACA,MAAI,UAAU,UAAU,OAAW,kBAAiB,UAAU,KAAK;AACnE,QAAM,QAAQ;AACd,QAAM,UAAU,gBAAgB,KAAK;AACrC,QAAM,YAAY,yBAAyB,OAAO;AAClD,SAAO;AACR;AAGO,SAAS,gCAE4B;AAC3C,SAAO;AAAA,IACN,OAAO,OAAoD;AAC1D,aAAO,gBAAgB,OAAO,+BAAsC,KAAK,CAAC;AAAA,IAC3E;AAAA,IACA,OAAO,OAAoD;AAC1D,aAAO,+BAAsC,gBAAgB,OAAO,KAAK,CAAC;AAAA,IAC3E;AAAA,EACD;AACD;AAGO,SAAS,2BAEd;AACD,QAAM,aAAa,8BAAqC;AACxD,SAAO;AAAA,IACN,OAAO,OAA+C;AACrD,aAAO,WAAW,OAAO,yBAAyB,KAAK,CAAC;AAAA,IACzD;AAAA,IACA,OAAO,OAA+C;AACrD,aAAO,gBAAgB,WAAW,OAAO,KAAK,CAAC;AAAA,IAChD;AAAA,EACD;AACD;AASA,SAAS,cACR,UACoC;AACpC,SAAO,OAAO,OAAO;AAAA,IACpB,IAAI,SAAS;AAAA,IACb,SAAS,SAAS;AAAA,IAClB,KAAK,oBAAoB,SAAS,KAAK,cAAc;AAAA,IACrD,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,oBAAoB,SAAS,WAAW,oBAAoB,EAAE;AAAA,IAC9E,GAAI,SAAS,YAAY,SACtB,CAAC,IACD,EAAE,SAAS,oBAAoB,SAAS,SAAS,kBAAkB,EAAE;AAAA,IACxE,YAAY,SAAS;AAAA,IACrB,MAAM,OAAO,OAAO,CAAC,GAAG,SAAS,IAAI,CAAC;AAAA,IACtC,SAAS,OAAO,OAAO,CAAC,GAAG,SAAS,OAAO,CAAC;AAAA,IAC5C,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,OAAO,OAAO,CAAC,GAAG,SAAS,SAAS,CAAC,EAAE;AAAA,IACvD,GAAI,SAAS,qBAAqB,SAC/B,CAAC,IACD,EAAE,kBAAkB,SAAS,iBAAiB;AAAA,IACjD,GAAI,SAAS,eAAe,SAAY,CAAC,IAAI,EAAE,YAAY,SAAS,WAAW;AAAA,EAChF,CAAC;AACF;AAEA,SAAS,gBACR,OAC6B;AAC7B,QAAM,WAAW,MAAM,OAAO;AAC9B,QAAM,SAAqC;AAAA,IAC1C,IAAI,qBAAqB,MAAM,OAAO,IAAI,WAAW;AAAA,IACrD,MAAM,gBAAgB,MAAM,OAAO,IAAI;AAAA,IACvC,kBAAkB,4BAA4B,MAAM,OAAO,gBAAgB;AAAA,IAC3E,cAAc,wBAAwB,MAAM,OAAO,YAAY;AAAA,IAC/D,GAAI,MAAM,OAAO,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,iBAAiB,MAAM,OAAO,KAAK,EAAE;AAAA,IAC1F,UAAU;AAAA,MACT,IAAI,qBAAqB,SAAS,IAAI,aAAa;AAAA,MACnD,SAASA,uBAAsB,SAAS,SAAS,kBAAkB;AAAA,MACnE,KAAK,mBAAmB,SAAS,KAAK,cAAc;AAAA,MACpD,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,mBAAmB,SAAS,WAAW,oBAAoB,EAAE;AAAA,MAC7E,GAAI,SAAS,YAAY,SACtB,CAAC,IACD,EAAE,SAAS,mBAAmB,SAAS,SAAS,kBAAkB,EAAE;AAAA,MACvE,YAAY,iBAAiB,SAAS,YAAY,qBAAqB;AAAA,MACvE,MAAM,kBAAkB,SAAS,MAAM,eAAe;AAAA,MACtD,SAAS,kBAAkB,SAAS,SAAS,kBAAkB;AAAA,MAC/D,GAAI,SAAS,cAAc,SACxB,CAAC,IACD,EAAE,WAAW,wBAAwB,SAAS,WAAW,oBAAoB,EAAE;AAAA,MAClF,GAAI,SAAS,qBAAqB,SAC/B,CAAC,IACD;AAAA,QACA,kBAAkB,qBAAqB,SAAS,kBAAkB,kBAAkB;AAAA,MACrF;AAAA,MACF,GAAI,SAAS,eAAe,SACzB,CAAC,IACD,EAAE,YAAY,aAAa,SAAS,YAAY,YAAY,EAAE;AAAA,IAClE;AAAA,EACD;AACA,QAAM,SAAS,0BAAiC,QAAQ,CAAC;AACzD,MAAI,OAAO,OAAO,SAAS,KAAK,OAAO,WAAW,QAAW;AAC5D,UAAM,IAAI;AAAA,MACT,wDAAwD,OAAO,OAC7D,QAAQ,CAAC,UAAU,MAAM,oBAAoB,CAAC,MAAM,OAAO,CAAC,EAC5D,KAAK,IAAI,CAAC;AAAA,IACb;AAAA,EACD;AACA,SAAO,OAAO;AACf;;;AC1MO,IAAM,wCACZ;AACM,IAAM,sCACZ;AACM,IAAM,8CAA8C;AAwGpD,SAAS,gCAAgC,gBAAgB,kBAA0B;AACzF,MAAI,cAAc,WAAW,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACrF,SAAO,GAAG,aAAa;AACxB;AAEO,SAAS,iCAGf,SACA,OAA2C,CAAC,GACF;AAC1C,QAAM,eAAe,qBAAqB,KAAK,gBAAgB,EAAE;AACjE,SAAO,uCAAuC;AAAA,IAC7C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA,SAAS,QAAQ,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,EAClE,CAAC;AACF;AAEO,SAAS,+BAEd,SAAuF;AACxF,SAAO,qCAAqC;AAAA,IAC3C,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ;AAAA,MACP,MAAM;AAAA,MACN,SAAS,QAAQ,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,IAClE;AAAA,EACD,CAAC;AACF;AAEO,SAAS,uCAEd,OAAyD;AAC1D,MAAI,CAACC,eAAc,KAAK,EAAG,OAAM,IAAI,UAAU,iDAAiD;AAChG;AAAA,IACC;AAAA,IACA,CAAC,gBAAgB,UAAU,WAAW,SAAS;AAAA,IAC/C;AAAA,EACD;AACA,MAAI,MAAM,WAAW,uCAAuC;AAC3D,UAAM,IAAI,UAAU,+CAA+C;AAAA,EACpE;AACA,MAAI,MAAM,YAAY,6CAA6C;AAClE,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,QAAM,eAAe,qBAAqB,MAAM,YAAY;AAC5D,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,GAAG;AAClC,UAAM,IAAI,UAAU,yDAAyD;AAAA,EAC9E;AACA,QAAM,UAAU;AAAA,IACf,MAAM;AAAA,IACN;AAAA,EACD;AACA,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA,SAAS,OAAO,OAAO,OAAO;AAAA,EAC/B,CAAC;AACF;AAEO,SAAS,qCAEd,OAAuD;AACxD,MAAI,CAACA,eAAc,KAAK,EAAG,OAAM,IAAI,UAAU,+CAA+C;AAC9F,aAAW,OAAO,CAAC,UAAU,UAAU,SAAS,GAAG,6BAA6B;AAChF,MAAI,MAAM,WAAW,qCAAqC;AACzD,UAAM,IAAI,UAAU,6CAA6C;AAAA,EAClE;AACA,MAAI,MAAM,YAAY,6CAA6C;AAClE,UAAM,IAAI,UAAU,8CAA8C;AAAA,EACnE;AACA,MAAI,CAACA,eAAc,MAAM,MAAM,GAAG;AACjC,UAAM,IAAI,UAAU,uDAAuD;AAAA,EAC5E;AACA,aAAW,MAAM,QAAQ,CAAC,QAAQ,SAAS,GAAG,oCAAoC;AAClF,MAAI,MAAM,OAAO,SAAS,cAAc;AACvC,UAAM,IAAI,UAAU,6DAA6D;AAAA,EAClF;AACA,MAAI,CAAC,MAAM,QAAQ,MAAM,OAAO,OAAO,GAAG;AACzC,UAAM,IAAI,UAAU,8DAA8D;AAAA,EACnF;AACA,QAAM,UAAU;AAAA,IACf,MAAM,OAAO;AAAA,IACb;AAAA,EACD;AACA,SAAO,OAAO,OAAO;AAAA,IACpB,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,QAAQ,OAAO,OAAO;AAAA,MACrB,MAAM;AAAA,MACN,SAAS,OAAO,OAAO,OAAO;AAAA,IAC/B,CAAC;AAAA,EACF,CAAC;AACF;AAEO,SAAS,8BAEd,MAA8F;AAC/F,QAAM,gBAAgB,KAAK,iBAAiB;AAC5C,QAAM,cAAc,KAAK,eAAe,gCAAgC,aAAa;AACrF,SAAO,KAAK,cAAc,IAAI,WAAW,EAAE,KAAK,CAAC,gBAAgB;AAChE,QAAI,UAAiD,CAAC;AACtD,QAAIC,UAA4D;AAChE,QAAI,eAAe;AACnB,QAAI,gBAAgB,QAAW;AAC9B,YAAM,WAAW,uCAA8C,WAAW;AAC1E,gBAAU,SAAS,QAAQ,IAAIC,gBAAe;AAC9C,qBAAe,SAAS;AACxB,MAAAD,UAAS;AAAA,IACV;AACA,QAAI,KAAK,cAAc,QAAW;AACjC,aAAO;AAAA,QACN;AAAA,QACA,QAAAA;AAAA,QACA,UAAU,EAAE,OAAO,gBAAgB,QAAW,aAAa;AAAA,QAC3D,SAAS,EAAE,SAAS,GAAG,QAAQ,aAAa;AAAA,MAC7C;AAAA,IACD;AACA,WAAO,KAAK,UAAU,KAAK,EAAE,OAAO,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY;AACrE,UAAI,UAAU;AACd,UAAI,SAAS;AACb,iBAAW,SAAS,SAAS;AAC5B,YAAI,MAAM,QAAQ,SAAS,GAAG;AAC7B,gBAAM,IAAI,MAAM,qDAAqD;AAAA,QACtE;AACA,cAAM,SAAS,qCAA4C,MAAM,KAAK;AACtE,kBAAU,OAAO,OAAO,QAAQ,IAAIC,gBAAe;AACnD,iBAAS,MAAM;AACf,mBAAW;AAAA,MACZ;AACA,aAAO;AAAA,QACN;AAAA,QACA,QACC,gBAAgB,UAAa,UAAU,IACpC,qBACA,gBAAgB,SACf,aACA,UAAU,IACT,YACA;AAAA,QACN,UAAU,EAAE,OAAO,gBAAgB,QAAW,aAAa;AAAA,QAC3D,SAAS,EAAE,SAAS,OAAO;AAAA,MAC5B;AAAA,IACD,CAAC;AAAA,EACF,CAAC;AACF;AAEO,SAAS,4BAGf,OACA,SACA,MACwC;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,cACL,KAAK,eAAe,gCAAgC,KAAK,iBAAiB,IAAI;AAC/E,QAAM,uBAAuB,6BAA6B,KAAK,oBAAoB;AACnF,uBAAqB,OAAO,SAA0B,GAAG,IAAI,UAAU;AACvE,MAAI,cAAqD;AAAA,IACxD,MAAM;AAAA,IACN,WAAW,qBAAqB,KAAK,uBAAuB,EAAE;AAAA,IAC9D,gBAAgB;AAAA,IAChB,cAAc;AAAA,EACf;AACA,MAAI,cAAc,SAAS,YAAY,GAAG,GAAG,GAAG,WAAW;AAC3D,MAAI,aAAa;AACjB,MAAI,SAAS;AACb,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,MAAI,+BAA+B;AACnC,MAAI,gBAAuD,QAAQ,SAAS,CAAC;AAC7E,MAAI;AACJ,QAAM,QAAqB,CAAC;AAC5B,QAAM,QAAQ,MAAM,MAAM,OAAO,EAAE,MAAM,GAAG,IAAI,SAAS,CAAC;AAC1D,QAAM,SAAS,MAAM,MAA6C,aAAa;AAAA,IAC9E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,QAAQ,MAAM,MAAmD,MAAM;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,SAAS,MAAM,MAA6C,aAAa;AAAA,IAC9E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AAED,WAAS,QAAQ,OAA6D;AAC7E,UAAM,YAAY,YAAY,UAAU,aAAa,UAAU,aAAa,YAAY;AACxF,kBAAc;AAAA,MACb;AAAA,MACA,MAAM,UAAU,UAAU,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,WAAO,IAAI,WAAW;AACtB,WAAO,IAAI,WAAW;AACtB,QAAI,cAAc,QAAS,OAAM,IAAI,IAAI;AACzC,QAAI,cAAc,aAAa,cAAc,WAAY,OAAM,IAAI,KAAK;AAAA,EACzE;AAEA,WAAS,OAAO,OAA8B,QAAuB;AACpE,kBAAc;AACd,UAAM,IAAI,EAAE,OAAO,SAASC,cAAa,MAAM,GAAG,QAAQ,YAAY,CAAC;AAAA,EACxE;AAEA,WAAS,SAAS,MAA+B;AAChD,QAAI;AACH,aAAO,WAAW;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,WAAS,OAAO,MAAuB;AACtC,QAAI,KAAK,UAAU,WAAW;AAC7B,iBAAW;AACX,gBAAU;AACV,cAAQ,UAAU;AAAA,IACnB,WAAW,YAAY,UAAU,WAAW;AAC3C,gBAAU;AACV,cAAQ,OAAO;AAAA,IAChB,OAAO;AACN,gBAAU;AACV,cAAQ,SAAS;AAAA,IAClB;AACA,aAAS,KAAK,IAAI;AAClB,IAAAC,OAAM;AAAA,EACP;AAEA,WAAS,KAAK,MAAiB,QAAuB;AACrD,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,QAAO,KAAK,OAAO,MAAM;AACnF,cAAU;AACV,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,SAAQ,SAAS;AAC3E,aAAS,KAAK,IAAI;AAClB,IAAAA,OAAM;AAAA,EACP;AAEA,WAAS,cAAc,MAAiB,OAAyB;AAChE,QAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,UAAM,OAAQ,MAA6B;AAC3C,QAAI,OAAO,SAAS,WAAY,QAAO;AACvC,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,SAAqB;AACpC,UAAI,QAAS;AACb,gBAAU;AACV,WAAK;AAAA,IACN;AACA,QAAI;AACH,MAAC,KAAoF;AAAA,QACpF;AAAA,QACA,MAAM,OAAO,MAAM,OAAO,IAAI,CAAC;AAAA,QAC/B,CAAC,WAAW,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5C;AAAA,IACD,SAAS,QAAQ;AAChB,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACR;AAEA,WAAS,QAAQ,MAAuB;AACvC,QAAI,YAAa,oBAAoB,KAAK,UAAU,aAAa,KAAK,UAAU,SAAU;AACzF,eAAS,KAAK,IAAI;AAClB;AAAA,IACD;AACA,UAAM,KAAK,IAAI;AACf,IAAAA,OAAM;AAAA,EACP;AAEA,WAASA,SAAc;AACtB,QAAI,QAAS;AACb,UAAM,OAAO,MAAM,MAAM;AACzB,QAAI,SAAS,OAAW;AACxB,cAAU;AACV;AAAA,MACC,KAAK,UAAU,UAAU,aAAa,YAAY,UAAU,aAAa,aAAa;AAAA,IACvF;AACA,QAAI;AACJ,QAAI;AACH,eAAS,KAAK,IAAI;AAAA,IACnB,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB;AAAA,IACD;AACA,QAAI,cAAc,MAAM,MAAM,EAAG;AACjC,WAAO,IAAI;AAAA,EACZ;AAEA,WAAS,gBAAgB,MAAsE;AAC9F,UAAM,kBAAkB;AACxB,mCAA+B;AAC/B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AACL,cAAMC,WAAU,OAAO;AAAA,UACtB,gBAAgB,IAAI,CAAC,WAAW,yBAAyB,MAAM,CAAC;AAAA,QACjE;AACA,cAAM,QAAQ,uCAA8C;AAAA,UAC3D,QAAQ;AAAA,UACR,SAAS;AAAA,UACT,cAAc,YAAY;AAAA,UAC1B,SAAAA;AAAA,QACD,CAAC;AACD,eAAO,KAAK,cAAc,IAAI,aAAa,KAAK,EAAE,KAAK,MAAM;AAC5D,wBAAc,EAAE,GAAG,aAAa,gBAAgB,YAAY,iBAAiB,EAAE;AAC/E,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,cAAc,aAA0D;AAChF,UAAM,YAAY,KAAK;AACvB,QAAI,cAAc,OAAW;AAC7B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AACL,cAAM,QAAQ,+BAA+B,WAAW;AACxD,eAAO,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,YAAY;AAChD,gBAAM,QAAQ;AACd,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,WAAW,MAAM;AAAA,YACjB,cAAc,YAAY,eAAe;AAAA,UAC1C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,yBAA+B;AACvC,UAAM,UAAU,MAAM,OAAO,CAAC;AAC9B,eAAW,QAAQ,QAAS,UAAS,KAAK,IAAI;AAAA,EAC/C;AAEA,SAAO,QAAQ,UAAU,CAAC,KAAc,aAA4B;AACnE,QAAI,iBAAkB;AACtB,UAAM,cAAc,OAA8C,GAAG;AACrE,QAAI,gBAAgB,OAAW;AAC/B,oBAAgB;AAChB,QAAI,eAAe,aAAa,OAAW;AAC3C,oCAAgC;AAChC,kBAAc,WAAW;AACzB,QACC,yBAAyB,UACzB,gCAAgC,sBAC/B;AACD,sBAAgB;AAAA,IACjB;AAAA,EACD,CAAC;AACD,gBAAc;AACd,MAAI,KAAK,qBAAqB,MAAO,iBAAgB;AAAA,MAChD,SAAQ,OAAO;AAEpB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,MAAsE;AAC3E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,cAAQ,EAAE,OAAO,SAAS,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACvD;AAAA,IACA,SAAS,MAAsE;AAC9E,UAAI,YAAY,kBAAkB;AACjC,iBAAS,IAAI;AACb;AAAA,MACD;AACA,sBAAgB,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,MAAsE;AAC7E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,yBAAmB;AACnB,aAAO;AACP,6BAAuB;AACvB,cAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACzD;AAAA,EACD;AACD;AAEO,SAAS,mCAGf,MACiD;AACjD,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,gCAAgC,aAAa;AACrF,SAAO,8BAAqC,EAAE,GAAG,MAAM,aAAa,cAAc,CAAC,EAAE;AAAA,IACpF,CAAC,WAAW;AACX,YAAM,UACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAAY,KAAK,UAAU,OAAO;AACjF,YAAMC,QAAO,KAAK,MAAM,MAA6C,SAAS;AAAA,QAC7E,MAAM,KAAK;AAAA,MACZ,CAAC;AACD,YAAM,cAAc,4BAA4B,KAAK,OAAOA,OAAM;AAAA,QACjE,GAAG;AAAA,QACH,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,QAC/C;AAAA,QACA;AAAA,QACA,qBAAqB,OAAO,QAAQ;AAAA,MACrC,CAAC;AACD,aAAO,EAAE,SAASA,OAAM,aAAa,OAAO;AAAA,IAC7C;AAAA,EACD;AACD;AAEA,SAASJ,iBACR,OAC6B;AAC7B,SAAO,yBAAgC,EAAE;AAAA,IACxC,8BAAqC,EAAE,OAAO,KAAK;AAAA,EACpD;AACD;AAEA,SAAS,SACR,OACA,SACA,QACA,QACA,QACwC;AACxC,SAAO,EAAE,OAAO,SAAS,QAAQ,QAAQ,OAAO;AACjD;AAEA,SAAS,OAAU,KAA6B;AAC/C,SAAO,IAAI,CAAC,MAAM,SAAU,IAAI,CAAC,IAAU;AAC5C;AAEA,SAAS,qBAAqB,OAAwB;AACrD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,IAAI;AAC5E,UAAM,IAAI,WAAW,2CAA2C;AAAA,EACjE;AACA,SAAO;AACR;AAEA,SAAS,6BAA6B,OAA+C;AACpF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC9C,UAAM,IAAI,WAAW,sDAAsD;AAAA,EAC5E;AACA,SAAO;AACR;AAEA,SAASF,eAAc,OAAkD;AACxE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEA,SAAS,WACR,OACA,UACA,OACO;AACP,QAAM,SAAS,OAAO,KAAK,KAAK,EAAE,KAAK;AACvC,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EAC5E;AACD;AAEA,SAAS,wBACR,OACA,OAC6C;AAC7C,QAAM,UAA6C,CAAC;AACpD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;AACzC,QAAI,CAAC,OAAO,OAAO,OAAO,CAAC,GAAG;AAC7B,YAAM,IAAI,UAAU,GAAG,KAAK,0BAA0B,CAAC,EAAE;AAAA,IAC1D;AACA,YAAQ,KAAK,+BAAsC,MAAM,CAAC,CAAC,CAAC;AAAA,EAC7D;AACA,SAAO,OAAO,OAAO,OAAO;AAC7B;AAEA,SAASG,cAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;AC9jBO,IAAM,YAA2B,OAAO,OAAO,EAAE,MAAM,OAAO,CAAC;AAE/D,SAAS,YAAY,cAAc,GAAG,UAAyB,WAAwB;AAC7F,MAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,GAAG;AACvD,UAAM,IAAI,WAAW,qDAAqD;AAAA,EAC3E;AACA,SAAO,OAAO,OAAO,EAAE,aAAa,QAAQ,CAAC;AAC9C;AAEO,SAAS,YAAY,QAAqB,eAAgC;AAChF,SAAO,gBAAgB,OAAO;AAC/B;AAEO,SAAS,iBAAiB,QAAqB,aAAyC;AAC9F,MAAI,CAAC,OAAO,UAAU,WAAW,KAAK,eAAe,KAAK,cAAc,OAAO,aAAa;AAC3F,WAAO;AAAA,EACR;AACA,SAAO,eAAe,OAAO,SAAS,WAAW;AAClD;AAEO,SAAS,eAAe,QAAuB,SAAyB;AAC9E,QAAM,cAAc,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,CAAC;AACnD,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK;AACJ,aAAO;AAAA,IACR,KAAK;AACJ,aAAO,YAAY,OAAO,OAAO;AAAA,IAClC,KAAK;AACJ,aAAO;AAAA,QACN,YAAY,OAAO,SAAS,IAAI,YAAY,OAAO,MAAM,KAAK,cAAc;AAAA,QAC5E,OAAO;AAAA,MACR;AAAA,IACD,KAAK,eAAe;AACnB,YAAM,SAAS,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,MAAM,CAAC;AACpD,aAAO,IAAI,YAAY,OAAO,SAAS,IAAI,WAAW,cAAc,IAAI,OAAO,KAAK;AAAA,IACrF;AAAA,IACA,KAAK;AACJ,aAAO,IAAI,YAAY,OAAO,MAAM,IAAI,UAAU,WAAW,GAAG,OAAO,KAAK;AAAA,EAC9E;AACD;AAEA,SAAS,IAAI,OAAe,KAAiC;AAC5D,MAAI,QAAQ,OAAW,QAAO;AAC9B,SAAO,KAAK,IAAI,OAAO,YAAY,GAAG,CAAC;AACxC;AAEA,SAAS,YAAY,OAAuB;AAC3C,MAAI,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACpC,SAAO,KAAK,IAAI,GAAG,KAAK;AACzB;AAEA,SAAS,UAAU,GAAmB;AACrC,MAAI,KAAK,EAAG,QAAO;AACnB,MAAI,OAAO;AACX,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG;AAC/B,UAAM,OAAO,OAAO;AACpB,WAAO;AACP,WAAO;AAAA,EACR;AACA,SAAO;AACR;;;ACxFO,IAAM,yBAAN,cAAqC,MAAM;AAAA,EACxC;AAAA,EAET,YAAY,UAA0C,SAAiB;AACtE,UAAM,OAAO;AACb,SAAK,OAAO;AACZ,SAAK,WAAW;AAAA,EACjB;AACD;AA6CA,IAAM,aAAa,MAAM,OAAO;AAChC,IAAM,cAAc,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC;AAC5D,IAAM,cAAc,IAAI,YAAY;AAE7B,SAAS,kCAAkC,OAAgD;AACjG,QAAM,QAAQ,WAAW,KAAK,KAAK;AACnC,QAAM,WAAW,wBAAwB,KAAK;AAC9C,6BAA2B,QAAQ;AACnC,QAAM,YAAY,kCAAkC,QAAQ;AAC5D,MAAI,CAACI,YAAW,OAAO,SAAS,GAAG;AAClC,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAEO,SAAS,6BAA6B,OAA2C;AACvF,QAAM,QAAQ,WAAW,KAAK,KAAK;AACnC,QAAM,QAAQ,mBAAmB,KAAK;AACtC,wBAAsB,KAAK;AAC3B,QAAM,YAAY,oBAAoB,KAAK;AAC3C,MAAI,CAACA,YAAW,OAAO,SAAS,GAAG;AAClC,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAEO,SAAS,6BAA6B,OAA2C;AACvF,wBAAsB,KAAK;AAC3B,SAAO,oBAAoB,KAAK;AACjC;AAEO,SAAS,kCACf,UACa;AACb,6BAA2B,QAAQ;AACnC,QAAM,MAAM,IAAI,WAAW;AAC3B,MAAI,YAAY,GAAG,SAAS,SAAS;AACrC,MAAI,aAAa,GAAG,eAAe,SAAS,QAAQ,CAAC;AACrD,UAAQ,SAAS,QAAQ,MAAM;AAAA,IAC9B,KAAK;AACJ,UAAI,aAAa,GAAG,IAAI,WAAW,CAAC;AACpC;AAAA,IACD,KAAK;AACJ,UAAI,aAAa,GAAG,kBAAkB,SAAS,QAAQ,IAAI,CAAC;AAC5D;AAAA,IACD,KAAK;AACJ,UAAI,aAAa,GAAG,IAAI,WAAW,CAAC;AACpC;AAAA,IACD,KAAK;AACJ,UAAI,aAAa,GAAG,2BAA2B,GAAG,SAAS,QAAQ,KAAK,CAAC;AACzE;AAAA,IACD,KAAK;AACJ,UAAI,aAAa,GAAG,2BAA2B,GAAG,SAAS,QAAQ,MAAM,CAAC;AAC1E;AAAA,IACD,KAAK;AACJ,UAAI,aAAa,GAAG,2BAA2B,GAAG,SAAS,QAAQ,KAAK,CAAC;AACzE;AAAA,IACD,KAAK;AACJ,UAAI,aAAa,GAAG,2BAA2B,GAAG,SAAS,QAAQ,MAAM,CAAC;AAC1E;AAAA,EACF;AACA,SAAO,IAAI,OAAO;AACnB;AAEA,SAAS,wBAAwB,OAAgD;AAChF,QAAM,SAAS;AAAA,IACd;AAAA,IACA,oBAAI,IAAI;AAAA,MACP,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,IACN,CAAC;AAAA,IACD;AAAA,EACD;AACA,QAAM,UAAU,WAAW,QAAQ,CAAC;AACpC,QAAM,gBAAgB,WAAW,QAAQ,CAAC;AAC1C,QAAM,gBAAgB,OAAO,OAAO,CAAC,UAAU,MAAM,MAAM,KAAK,MAAM,MAAM,CAAC;AAC7E,MAAI,YAAY,UAAa,kBAAkB,UAAa,cAAc,WAAW,GAAG;AACvF,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,MAAI,cAAc,WAAW,GAAG;AAC/B,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,QAAM,eAAe,cAAc,CAAC;AACpC,MAAI,EAAE,aAAa,iBAAiB,aAAa;AAChD,UAAM,IAAI,uBAAuB,aAAa,yCAAyC;AAAA,EACxF;AACA,SAAO;AAAA,IACN,WAAW,WAAW,SAAS,YAAY;AAAA,IAC3C,UAAU,cAAc,aAAa;AAAA,IACrC,SAAS,qBAAqB,aAAa,IAAI,aAAa,KAAK;AAAA,EAClE;AACD;AAEA,SAAS,qBAAqB,SAAiB,OAA+C;AAC7F,UAAQ,SAAS;AAAA,IAChB,KAAK;AACJ,0BAAoB,OAAO,OAAO;AAClC,aAAO,EAAE,MAAM,QAAQ;AAAA,IACxB,KAAK;AACJ,aAAO,EAAE,MAAM,QAAQ,MAAM,iBAAiB,KAAK,EAAE;AAAA,IACtD,KAAK;AACJ,0BAAoB,OAAO,KAAK;AAChC,aAAO,EAAE,MAAM,MAAM;AAAA,IACtB,KAAK;AACJ,aAAO,EAAE,MAAM,QAAQ,OAAO,0BAA0B,OAAO,MAAM,EAAE;AAAA,IACxE,KAAK;AACJ,aAAO,EAAE,MAAM,UAAU,QAAQ,0BAA0B,OAAO,QAAQ,EAAE;AAAA,IAC7E,KAAK;AACJ,aAAO,EAAE,MAAM,SAAS,OAAO,0BAA0B,OAAO,OAAO,EAAE;AAAA,IAC1E,KAAK;AACJ,aAAO,EAAE,MAAM,SAAS,QAAQ,0BAA0B,OAAO,OAAO,EAAE;AAAA,IAC3E;AACC,YAAM,IAAI,uBAAuB,iBAAiB,gCAAgC;AAAA,EACpF;AACD;AAEA,SAAS,cAAc,OAAgD;AACtE,QAAM,SAAS;AAAA,IACd;AAAA,IACA,oBAAI,IAAI;AAAA,MACP,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,IACN,CAAC;AAAA,IACD;AAAA,EACD;AACA,QAAM,MAAM,UAAU,QAAQ,CAAC;AAC/B,QAAM,SAAS,UAAU,QAAQ,CAAC;AAClC,QAAM,MAAM,WAAW,QAAQ,CAAC;AAChC,QAAM,UAAU,UAAU,QAAQ,CAAC;AACnC,QAAM,cAAc,UAAU,QAAQ,CAAC;AACvC,MACC,QAAQ,UACR,WAAW,UACX,QAAQ,UACR,YAAY,UACZ,gBAAgB,QACf;AACD,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,QAAM,cAAc,UAAU,QAAQ,CAAC;AACvC,QAAM,YAAY,UAAU,QAAQ,CAAC;AACrC,QAAM,YAAY,WAAW,QAAQ,CAAC;AACtC,MAAI,gBAAgB,MAAM,cAAc,MAAM,WAAW,WAAW,GAAG;AACtE,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,gBAAgB,WAAW,KAAK,iBAAiB;AAAA,IACjD,SAAS,OAAO,SAAS,SAAS;AAAA,IAClC,aAAa,OAAO,aAAa,cAAc;AAAA,IAC/C;AAAA,IACA;AAAA,IACA,WAAW,cAAc,SAAY,SAAY,WAAW,WAAW,YAAY;AAAA,EACpF;AACD;AAEA,SAAS,iBAAiB,OAAgD;AACzE,QAAM,SAAS;AAAA,IACd;AAAA,IACA,oBAAI,IAAI;AAAA,MACP,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,IACN,CAAC;AAAA,IACD;AAAA,EACD;AACA,QAAM,QAAQ,WAAW,QAAQ,CAAC;AAClC,QAAM,WAAW,WAAW,QAAQ,CAAC;AACrC,MAAI,UAAU,UAAa,aAAa,QAAW;AAClD,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,MAAI,UAAU,OAAW,QAAO,EAAE,MAAM,SAAS,MAAM;AACvD,MAAI,aAAa,OAAW,QAAO,EAAE,MAAM,aAAa,OAAO,mBAAmB,QAAQ,EAAE;AAC5F,QAAM,IAAI,uBAAuB,oBAAoB,oCAAoC;AAC1F;AAEA,SAAS,mBAAmB,OAA2C;AACtE,QAAM,SAAS;AAAA,IACd;AAAA,IACA,oBAAI,IAAI;AAAA,MACP,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,MACL,CAAC,GAAG,CAAC;AAAA,IACN,CAAC;AAAA,IACD;AAAA,EACD;AACA,QAAM,OAAO,UAAU,QAAQ,CAAC;AAChC,QAAM,OAAO,WAAW,QAAQ,CAAC;AACjC,QAAM,QAAQ,WAAW,QAAQ,CAAC;AAClC,QAAM,QAAQ,WAAW,QAAQ,CAAC;AAClC,MAAI,SAAS,UAAa,SAAS,UAAa,UAAU,QAAW;AACpE,UAAM,IAAI,uBAAuB,oBAAoB,uCAAuC;AAAA,EAC7F;AACA,MAAI,KAAK,WAAW,KAAK,MAAM,WAAW,GAAG;AAC5C,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,MAAI,SAAS,IAAI;AAChB,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI;AAAA,QACT;AAAA,QACA;AAAA,MACD;AAAA,IACD;AACA,WAAO;AAAA,MACN,MAAM;AAAA,MACN,QAAQ,WAAW,MAAM,SAAS;AAAA,MAClC,SAAS,WAAW,OAAO,UAAU;AAAA,IACtC;AAAA,EACD;AACA,MAAI,SAAS,IAAI;AAChB,QAAI,UAAU,QAAW;AACxB,YAAM,IAAI,uBAAuB,qBAAqB,mCAAmC;AAAA,IAC1F;AACA,WAAO;AAAA,MACN,MAAM;AAAA,MACN,QAAQ,WAAW,MAAM,SAAS;AAAA,MAClC,SAAS,WAAW,OAAO,UAAU;AAAA,MACrC;AAAA,IACD;AAAA,EACD;AACA,QAAM,IAAI,uBAAuB,qBAAqB,+BAA+B;AACtF;AAEA,SAAS,2BAA2B,UAA6C;AAChF,MAAI,CAAC,SAAS,QAAQ,GAAG;AACxB,UAAM,IAAI,uBAAuB,aAAa,0CAA0C;AAAA,EACzF;AACA,MAAI,OAAO,SAAS,cAAc,YAAY,SAAS,UAAU,WAAW,GAAG;AAC9E,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,QAAM,WAAW,SAAS;AAC1B,MAAI,CAAC,SAAS,QAAQ,GAAG;AACxB,UAAM,IAAI,uBAAuB,aAAa,0CAA0C;AAAA,EACzF;AACA,eAAa,SAAS,KAAK,KAAK;AAChC,eAAa,SAAS,QAAQ,QAAQ;AACtC,qBAAmB,SAAS,SAAS,SAAS;AAC9C,qBAAmB,SAAS,aAAa,cAAc;AACvD,MAAI,SAAS,gBAAgB,OAAW,cAAa,SAAS,aAAa,cAAc;AACzF,MAAI,SAAS,cAAc,OAAW,cAAa,SAAS,WAAW,aAAa;AACpF,MAAI,SAAS,QAAQ,MAAM,SAAS,YAAY,KAAK,SAAS,cAAc,SAAS,SAAS;AAC7F,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,MAAI,OAAO,SAAS,mBAAmB,YAAY,SAAS,eAAe,WAAW,GAAG;AACxF,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,MAAI,SAAS,cAAc,UAAa,OAAO,SAAS,cAAc,UAAU;AAC/E,UAAM,IAAI,uBAAuB,aAAa,gDAAgD;AAAA,EAC/F;AACA,MAAI,CAAC,SAAS,SAAS,OAAO,GAAG;AAChC,UAAM,IAAI,uBAAuB,oBAAoB,wCAAwC;AAAA,EAC9F;AACA,qBAAmB,SAAS,OAAO;AACnC,OACE,SAAS,QAAQ,SAAS,SAAS,SAAS,QAAQ,SAAS,WAC9D,SAAS,cAAc,QACtB;AACD,UAAM,IAAI,uBAAuB,oBAAoB,wCAAwC;AAAA,EAC9F;AACA,MAAI,SAAS,gBAAgB,MAAM,SAAS,cAAc,MAAM,SAAS,cAAc,IAAI;AAC1F,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,mBAAmB,SAA2C;AACtE,UAAQ,QAAQ,MAAM;AAAA,IACrB,KAAK;AAAA,IACL,KAAK;AACJ;AAAA,IACD,KAAK;AACJ,UAAI,CAAC,SAAS,QAAQ,IAAI,GAAG;AAC5B,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA,UAAI,QAAQ,KAAK,SAAS,SAAS;AAClC,yBAAiB,QAAQ,KAAK,OAAO,6BAA6B;AAClE;AAAA,MACD;AACA,UAAI,QAAQ,KAAK,SAAS,aAAa;AACtC,8BAAsB,QAAQ,KAAK,KAAK;AACxC;AAAA,MACD;AACA,YAAM,IAAI;AAAA,QACT;AAAA,QACA;AAAA,MACD;AAAA,IACD,KAAK;AACJ,UAAI,QAAQ,UAAU;AACrB,oCAA4B,QAAQ,OAAO,6BAA6B;AACzE;AAAA,IACD,KAAK;AACJ,kCAA4B,QAAQ,QAAQ,gCAAgC;AAC5E;AAAA,IACD,KAAK;AACJ,kCAA4B,QAAQ,OAAO,8BAA8B;AACzE;AAAA,IACD,KAAK;AACJ,UAAI,QAAQ,WAAW;AACtB,oCAA4B,QAAQ,QAAQ,+BAA+B;AAC5E;AAAA,IACD;AACC,YAAM,IAAI;AAAA,QACT;AAAA,QACA;AAAA,MACD;AAAA,EACF;AACD;AAEA,SAAS,sBAAsB,OAAqC;AACnE,MAAI,CAAC,SAAS,KAAK,GAAG;AACrB,UAAM,IAAI,uBAAuB,aAAa,qCAAqC;AAAA,EACpF;AACA,MAAI,OAAO,MAAM,WAAW,YAAY,OAAO,MAAM,YAAY,UAAU;AAC1E,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,MAAI,MAAM,OAAO,WAAW,KAAK,MAAM,QAAQ,WAAW,GAAG;AAC5D,UAAM,IAAI;AAAA,MACT;AAAA,MACA;AAAA,IACD;AAAA,EACD;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,MAAM,UAAU,QAAW;AAC9B,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA;AAAA,IACD,KAAK;AACJ,UAAI,MAAM,UAAU,QAAW;AAC9B,cAAM,IAAI,uBAAuB,qBAAqB,mCAAmC;AAAA,MAC1F;AACA,uBAAiB,MAAM,OAAO,qBAAqB;AACnD;AAAA,IACD;AACC,YAAM,IAAI,uBAAuB,qBAAqB,+BAA+B;AAAA,EACvF;AACD;AAEA,SAAS,eAAe,UAAmD;AAC1E,QAAM,MAAM,IAAI,WAAW;AAC3B,MAAI,YAAY,GAAG,SAAS,GAAG;AAC/B,MAAI,YAAY,GAAG,SAAS,MAAM;AAClC,MAAI,YAAY,GAAG,SAAS,cAAc;AAC1C,MAAI,YAAY,GAAG,OAAO,SAAS,OAAO,CAAC;AAC3C,MAAI,YAAY,GAAG,OAAO,SAAS,WAAW,CAAC;AAC/C,MAAI,SAAS,gBAAgB,OAAW,KAAI,YAAY,GAAG,SAAS,WAAW;AAC/E,MAAI,SAAS,cAAc,OAAW,KAAI,YAAY,GAAG,SAAS,SAAS;AAC3E,MAAI,SAAS,cAAc,OAAW,KAAI,YAAY,GAAG,SAAS,SAAS;AAC3E,SAAO,IAAI,OAAO;AACnB;AAEA,SAAS,kBAAkB,MAA+C;AACzE,QAAM,MAAM,IAAI,WAAW;AAC3B,MAAI,KAAK,SAAS,SAAS;AAC1B,QAAI,WAAW,GAAG,KAAK,KAAK;AAAA,EAC7B,OAAO;AACN,QAAI,aAAa,GAAG,oBAAoB,KAAK,KAAK,CAAC;AAAA,EACpD;AACA,SAAO,IAAI,OAAO;AACnB;AAEA,SAAS,oBAAoB,OAA2C;AACvE,QAAM,MAAM,IAAI,WAAW;AAC3B,MAAI,YAAY,GAAG,MAAM,SAAS,UAAU,KAAK,EAAE;AACnD,MAAI,YAAY,GAAG,MAAM,MAAM;AAC/B,MAAI,YAAY,GAAG,MAAM,OAAO;AAChC,MAAI,MAAM,UAAU,OAAW,KAAI,WAAW,GAAG,MAAM,KAAK;AAC5D,SAAO,IAAI,OAAO;AACnB;AAEA,SAAS,2BAA2B,SAAiB,OAA+B;AACnF,QAAM,MAAM,IAAI,WAAW;AAC3B,MAAI,WAAW,SAAS,KAAK;AAC7B,SAAO,IAAI,OAAO;AACnB;AAEA,SAAS,2BAA2B,SAAiB,OAA2C;AAC/F,QAAM,MAAM,IAAI,WAAW;AAC3B,MAAI,UAAU,QAAW;AACxB,gCAA4B,OAAO,wBAAwB;AAC3D,QAAI,WAAW,SAAS,KAAK;AAAA,EAC9B;AACA,SAAO,IAAI,OAAO;AACnB;AAEA,SAAS,0BAA0B,OAAmB,MAA0B;AAC/E,QAAM,SAAS,WAAW,OAAO,oBAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS;AAC9E,QAAM,QAAQ,WAAW,QAAQ,CAAC;AAClC,MAAI,UAAU,QAAW;AACxB,UAAM,IAAI,uBAAuB,oBAAoB,GAAG,IAAI,iCAAiC;AAAA,EAC9F;AACA,MAAI,MAAM,WAAW,GAAG;AACvB,UAAM,IAAI,uBAAuB,oBAAoB,GAAG,IAAI,kCAAkC;AAAA,EAC/F;AACA,SAAO;AACR;AAEA,SAAS,0BAA0B,OAAmB,MAAsC;AAC3F,QAAM,SAAS,WAAW,OAAO,oBAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS;AAC9E,QAAM,QAAQ,WAAW,QAAQ,CAAC;AAClC,MAAI,OAAO,WAAW,GAAG;AACxB,UAAM,IAAI;AAAA,MACT;AAAA,MACA,GAAG,IAAI;AAAA,IACR;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,oBAAoB,OAAmB,MAAoB;AACnE,MAAI,MAAM,WAAW,GAAG;AACvB,UAAM,IAAI,uBAAuB,iBAAiB,GAAG,IAAI,wBAAwB;AAAA,EAClF;AACD;AAEA,SAAS,WAAW,OAAmB,SAA8B,aAA8B;AAClG,QAAM,SAAS,IAAI,WAAW,KAAK;AACnC,QAAM,SAAkB,CAAC;AACzB,QAAM,OAAO,oBAAI,IAAY;AAC7B,SAAO,CAAC,OAAO,KAAK,GAAG;AACtB,UAAM,MAAM,OAAO,OAAO;AAC1B,UAAM,UAAU,OAAO,OAAO,EAAE;AAChC,UAAM,WAAW,OAAO,MAAM,EAAE;AAChC,UAAM,mBAAmB,QAAQ,IAAI,OAAO;AAC5C,QAAI,WAAW,KAAK,qBAAqB,QAAW;AACnD,YAAM,IAAI;AAAA,QACT;AAAA,QACA,GAAG,WAAW,2BAA2B,OAAO;AAAA,MACjD;AAAA,IACD;AACA,QAAI,aAAa,kBAAkB;AAClC,YAAM,IAAI;AAAA,QACT;AAAA,QACA,GAAG,WAAW,UAAU,OAAO;AAAA,MAChC;AAAA,IACD;AACA,QAAI,KAAK,IAAI,OAAO,GAAG;AACtB,YAAM,IAAI;AAAA,QACT;AAAA,QACA,GAAG,WAAW,UAAU,OAAO;AAAA,MAChC;AAAA,IACD;AACA,SAAK,IAAI,OAAO;AAChB,QAAI,aAAa,GAAG;AACnB,aAAO,KAAK,EAAE,IAAI,SAAS,UAAU,OAAO,OAAO,OAAO,EAAE,CAAC;AAAA,IAC9D,WAAW,aAAa,GAAG;AAC1B,aAAO,KAAK,EAAE,IAAI,SAAS,UAAU,OAAO,OAAO,UAAU,EAAE,CAAC;AAAA,IACjE,OAAO;AACN,YAAM,IAAI,uBAAuB,aAAa,GAAG,WAAW,wBAAwB;AAAA,IACrF;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,UAAU,QAA0B,IAAgC;AAC5E,QAAM,QAAQ,OAAO,KAAK,CAAC,cAAc,UAAU,OAAO,EAAE;AAC5D,SAAO,OAAO,OAAO,UAAU,WAAW,MAAM,QAAQ;AACzD;AAEA,SAAS,WAAW,QAA0B,IAAoC;AACjF,QAAM,QAAQ,OAAO,KAAK,CAAC,cAAc,UAAU,OAAO,EAAE;AAC5D,SAAO,OAAO,iBAAiB,aAAa,MAAM,QAAQ;AAC3D;AAEA,SAAS,WAAW,OAAmB,OAAuB;AAC7D,MAAI;AACJ,MAAI;AACH,WAAO,YAAY,OAAO,KAAK;AAAA,EAChC,SAAS,OAAO;AACf,UAAM,IAAI;AAAA,MACT;AAAA,MACA,GAAG,KAAK,wBAAwB,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,IACvF;AAAA,EACD;AACA,MAAI,KAAK,WAAW,GAAG;AACtB,UAAM,IAAI,uBAAuB,oBAAoB,GAAG,KAAK,oBAAoB;AAAA,EAClF;AACA,SAAO;AACR;AAEA,SAAS,SAAS,OAAkD;AACnE,SAAO,OAAO,UAAU,YAAY,UAAU;AAC/C;AAEA,SAAS,aAAa,OAAgB,OAAwC;AAC7E,MAAI,OAAO,UAAU,YAAY,QAAQ,MAAM,QAAQ,WAAW;AACjE,UAAM,IAAI,uBAAuB,aAAa,GAAG,KAAK,0BAA0B;AAAA,EACjF;AACD;AAEA,SAAS,mBAAmB,OAAgB,OAAwC;AACnF,MAAI,CAAC,OAAO,UAAU,KAAK,KAAM,QAAmB,KAAM,QAAmB,YAAa;AACzF,UAAM,IAAI,uBAAuB,aAAa,GAAG,KAAK,0BAA0B;AAAA,EACjF;AACD;AAEA,SAAS,iBAAiB,OAAgB,OAA4C;AACrF,MAAI,EAAE,iBAAiB,aAAa;AACnC,UAAM,IAAI,uBAAuB,aAAa,GAAG,KAAK,2BAA2B;AAAA,EAClF;AACD;AAEA,SAAS,4BAA4B,OAAgB,OAA4C;AAChG,mBAAiB,OAAO,KAAK;AAC7B,MAAI,MAAM,WAAW,GAAG;AACvB,UAAM,IAAI,uBAAuB,oBAAoB,GAAG,KAAK,gCAAgC;AAAA,EAC9F;AACD;AAEA,SAAS,4BAA4B,OAAgB,OAA4C;AAChG,mBAAiB,OAAO,KAAK;AAC7B,MAAI,MAAM,WAAW,GAAG;AACvB,UAAM,IAAI,uBAAuB,oBAAoB,GAAG,KAAK,oBAAoB;AAAA,EAClF;AACD;AAEA,SAAS,OAAO,OAAe,OAAuB;AACrD,MAAI,QAAQ,aAAc;AACzB,UAAM,IAAI,uBAAuB,aAAa,GAAG,KAAK,iBAAiB;AAAA,EACxE;AACA,SAAO,OAAO,KAAK;AACpB;AAEA,SAASA,YAAW,MAAkB,OAA4B;AACjE,MAAI,KAAK,WAAW,MAAM,OAAQ,QAAO;AACzC,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACrC,QAAI,KAAK,CAAC,MAAM,MAAM,CAAC,EAAG,QAAO;AAAA,EAClC;AACA,SAAO;AACR;AAEA,IAAM,aAAN,MAAiB;AAAA,EAGhB,YAA6B,KAAiB;AAAjB;AAAA,EAAkB;AAAA,EAFvC,SAAS;AAAA,EAIjB,OAAgB;AACf,WAAO,KAAK,WAAW,KAAK,IAAI;AAAA,EACjC;AAAA,EAEA,SAAiB;AAChB,QAAI,QAAQ;AACZ,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC5B,UAAI,KAAK,UAAU,KAAK,IAAI,QAAQ;AACnC,cAAM,IAAI,uBAAuB,aAAa,kBAAkB;AAAA,MACjE;AACA,YAAM,OAAO,KAAK,IAAI,KAAK,QAAQ;AACnC,UAAI,MAAM,MAAM,OAAO,SAAU,GAAG;AACnC,cAAM,IAAI,uBAAuB,aAAa,wBAAwB;AAAA,MACvE;AACA,gBAAU,OAAO,OAAO,GAAI,KAAK;AACjC,WAAK,OAAO,SAAU,EAAG,QAAO;AAChC,eAAS;AAAA,IACV;AACA,UAAM,IAAI,uBAAuB,aAAa,wBAAwB;AAAA,EACvE;AAAA,EAEA,YAAwB;AACvB,UAAM,MAAM,KAAK,OAAO;AACxB,QAAI,MAAM,OAAO,KAAK,IAAI,SAAS,KAAK,MAAM,GAAG;AAChD,YAAM,IAAI,uBAAuB,aAAa,qCAAqC;AAAA,IACpF;AACA,UAAM,QAAQ,KAAK;AACnB,SAAK,UAAU,OAAO,GAAG;AACzB,WAAO,KAAK,IAAI,MAAM,OAAO,KAAK,MAAM;AAAA,EACzC;AACD;AAEA,IAAM,aAAN,MAAiB;AAAA,EACC,SAAmB,CAAC;AAAA,EAErC,YAAY,SAAiB,OAAqB;AACjD,SAAK,IAAI,SAAS,CAAC;AACnB,SAAK,OAAO,KAAK;AAAA,EAClB;AAAA,EAEA,WAAW,SAAiB,OAAyB;AACpD,SAAK,IAAI,SAAS,CAAC;AACnB,SAAK,OAAO,OAAO,MAAM,MAAM,CAAC;AAChC,SAAK,MAAM,KAAK;AAAA,EACjB;AAAA,EAEA,YAAY,SAAiB,OAAqB;AACjD,SAAK,WAAW,SAAS,YAAY,OAAO,KAAK,CAAC;AAAA,EACnD;AAAA,EAEA,aAAa,SAAiB,OAAyB;AACtD,SAAK,WAAW,SAAS,KAAK;AAAA,EAC/B;AAAA,EAEA,SAAqB;AACpB,WAAO,IAAI,WAAW,KAAK,MAAM;AAAA,EAClC;AAAA,EAEQ,IAAI,SAAiB,UAAwB;AACpD,SAAK,OAAO,OAAQ,WAAW,IAAK,QAAQ,CAAC;AAAA,EAC9C;AAAA,EAEQ,OAAO,OAAqB;AACnC,QAAI,QAAQ,MAAM,QAAQ,WAAW;AACpC,YAAM,IAAI,uBAAuB,aAAa,8BAA8B;AAAA,IAC7E;AACA,QAAI,OAAO;AACX,OAAG;AACF,UAAI,OAAO,OAAO,OAAO,KAAK;AAC9B,eAAS;AACT,UAAI,SAAS,GAAI,SAAQ;AACzB,WAAK,OAAO,KAAK,IAAI;AAAA,IACtB,SAAS,SAAS;AAAA,EACnB;AAAA,EAEQ,MAAM,OAAyB;AACtC,eAAW,QAAQ,MAAO,MAAK,OAAO,KAAK,IAAI;AAAA,EAChD;AACD;;;AChtBO,IAAM,gBAAgB,oBAAI,IAA4B;AAAA,EAC5D;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAEM,SAAS,0BAA6B,OAAkD;AAC9F,MAAI,CAACC,UAAS,KAAK,EAAG,QAAO;AAC7B,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,EAAE,aAAa,OAAQ,QAAO;AAClC,SAAO;AAAA,IACN,WAAW,MAAM;AAAA,IACjB,WAAW,MAAM;AAAA,IACjB,SAAS,MAAM;AAAA,EAChB;AACD;AAEO,SAAS,2BAA8B,OAAmD;AAChG,MAAI,CAACA,UAAS,KAAK,EAAG,QAAO;AAC7B,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,EAAG,QAAO;AAChF,MAAI,MAAM,SAAS,YAAY,aAAa,OAAO;AAClD,WAAO;AAAA,MACN,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,SAAS,MAAM;AAAA,IAChB;AAAA,EACD;AACA,MAAI,MAAM,SAAS,WAAW,OAAO,MAAM,UAAU,YAAY,MAAM,MAAM,SAAS,GAAG;AACxF,WAAO;AAAA,MACN,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,OAAO,MAAM;AAAA,IACd;AAAA,EACD;AACA,MAAI,MAAM,SAAS,YAAY,OAAO,MAAM,WAAW,YAAY,MAAM,OAAO,SAAS,GAAG;AAC3F,WAAO;AAAA,MACN,MAAM;AAAA,MACN,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,MACjB,QAAQ,MAAM;AAAA,IACf;AAAA,EACD;AACA,SAAO;AACR;AAEO,SAAS,iCAAiC,OAAoC;AACpF,MAAI,CAACA,UAAS,KAAK,EAAG,QAAO;AAC7B,SAAO,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,SAAS,IACpE,MAAM,YACN;AACJ;AAEO,SAAS,iCAAiC,OAAoC;AACpF,MAAI,CAACA,UAAS,KAAK,EAAG,QAAO;AAC7B,SAAO,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,SAAS,IACpE,MAAM,YACN;AACJ;AAEO,SAASA,UAAS,OAAkD;AAC1E,SAAO,OAAO,UAAU,YAAY,UAAU;AAC/C;AAEO,SAAS,WAAW,OAAyB;AACnD,SAAOA,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS;AACjD;AAEO,SAAS,wBAAwB,UAAuC;AAC9E,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACtD,WAAO;AAAA,EACR;AACA,QAAM,YAAY;AAClB,MAAI,OAAO,UAAU,cAAc,YAAY,UAAU,UAAU,WAAW,GAAG;AAChF,WAAO;AAAA,EACR;AACA,MACC,OAAO,UAAU,SAAS,YAC1B,CAAC,cAAc,IAAI,UAAU,IAA8B,GAC1D;AACD,WAAO;AAAA,EACR;AACA,QAAM,WAAW,UAAU;AAC3B,MAAI,OAAO,aAAa,YAAY,aAAa,MAAM;AACtD,WAAO;AAAA,EACR;AACA,MAAI,CAAC,sBAAsB,SAAS,GAAG,GAAG;AACzC,WAAO;AAAA,EACR;AACA,MAAI,CAAC,yBAAyB,SAAS,MAAM,GAAG;AAC/C,WAAO;AAAA,EACR;AACA,MACC,OAAO,SAAS,mBAAmB,YAClC,SAAS,eAA0B,WAAW,GAC9C;AACD,WAAO;AAAA,EACR;AACA,MAAI,CAAC,sBAAsB,SAAS,OAAO,GAAG;AAC7C,WAAO;AAAA,EACR;AACA,MACC,CAAC,sBAAsB,SAAS,WAAW,KAC1C,SAAS,cAA0B,SAAS,SAC5C;AACD,WAAO;AAAA,EACR;AACA,MAAI,SAAS,cAAc,UAAa,CAAC,sBAAsB,SAAS,SAAS,GAAG;AACnF,WAAO;AAAA,EACR;AACA,OAAK,UAAU,SAAS,SAAS,UAAU,SAAS,WAAW,SAAS,cAAc,QAAW;AAChG,WAAO,uBAAuB,UAAU,IAAI;AAAA,EAC7C;AACA,QAAM,eAAe;AAAA,IACpB,UAAU;AAAA,IACV,UAAU;AAAA,IACV;AAAA,EACD;AACA,MAAI,iBAAiB,OAAW,QAAO;AACvC,SAAO;AACR;AAEO,SAAS,gBAAgB,OAAoC;AACnE,MAAI,OAAO,UAAU,YAAY,UAAU,MAAM;AAChD,WAAO;AAAA,EACR;AACA,QAAM,OAAQ,MAAsC;AACpD,MACC,SAAS,WACT,SAAS,UACT,SAAS,SACT,SAAS,UACT,SAAS,iBACT,SAAS,SACR;AACD,WAAO;AAAA,EACR;AACA,OACE,SAAS,SAAS,SAAS,WAC5B,CAAC,sBAAuB,MAA2C,SAAS,GAC3E;AACD,WAAO,eAAe,IAAI;AAAA,EAC3B;AACA,MAAI,SAAS,eAAe;AAC3B,UAAM,UAAU;AAKhB,QAAI,CAAC,sBAAsB,QAAQ,GAAG,GAAG;AACxC,aAAO;AAAA,IACR;AACA,QAAI,CAAC,sBAAsB,QAAQ,OAAO,GAAG;AAC5C,aAAO;AAAA,IACR;AACA,UAAM,eAAe,QAAQ;AAC7B,QACC,iBAAiB,WAChB,OAAO,iBAAiB,YAAY,CAAC,OAAO,SAAS,YAAY,KAAK,eAAe,IACrF;AACD,aAAO;AAAA,IACR;AAAA,EACD;AACA,SAAO;AACR;AAEO,SAAS,eAAe,MAAuC;AACrE,SAAO,SAAS,WAAW,SAAS,UAAU,SAAS;AACxD;AAEO,SAAS,sBAAsB,OAAiC;AACtE,SAAO,OAAO,cAAc,KAAK,KAAM,QAAmB;AAC3D;AAEO,SAAS,yBAAyB,OAAiC;AACzE,SAAO,OAAO,cAAc,KAAK,KAAM,SAAoB;AAC5D;AAEO,SAAS,uBACf,MACA,SACA,QACqB;AACrB,QAAM,SACL,OAAO,YAAY,YAAY,YAAY,OACvC,UACD;AACJ,QAAM,OAAO,WAAW,SAAY,SAAY,QAAQ,QAAQ,MAAM;AACtE,UAAQ,MAAM;AAAA,IACb,KAAK;AACJ,UAAI,SAAS,UAAU,WAAW,UAAa,CAAC,WAAW,QAAQ,OAAO,GAAG;AAC5E,eAAO,GAAG,MAAM;AAAA,MACjB;AACA,aAAO,2BAA2B,QAAQ,QAAQ,OAAO,GAAG,GAAG,MAAM,gBAAgB;AAAA,IACtF,KAAK;AAAA,IACL,KAAK;AACJ,UAAI,SAAS,WAAW,WAAW,UAAa,CAAC,WAAW,QAAQ,OAAO,GAAG;AAC7E,eAAO,GAAG,MAAM,KAAK,IAAI;AAAA,MAC1B;AACA,aAAO,2BAA2B,QAAQ,QAAQ,OAAO,GAAG,GAAG,MAAM,KAAK,IAAI,UAAU;AAAA,IACzF,KAAK;AACJ,UAAI,SAAS,YAAY,WAAW,UAAa,CAAC,WAAW,QAAQ,QAAQ,GAAG;AAC/E,eAAO,GAAG,MAAM;AAAA,MACjB;AACA,aAAO,2BAA2B,QAAQ,QAAQ,QAAQ,GAAG,GAAG,MAAM,kBAAkB;AAAA,IACzF,KAAK;AACJ,UAAI,SAAS,QAAS,QAAO,GAAG,MAAM;AACtC,UAAI,WAAW,UAAa,EAAE,YAAY,QAAS,QAAO;AAC1D,UAAI,CAAC,WAAW,QAAQ,QAAQ,GAAG;AAClC,eAAO,GAAG,MAAM;AAAA,MACjB;AACA,aAAO,2BAA2B,QAAQ,QAAQ,QAAQ,GAAG,GAAG,MAAM,gBAAgB;AAAA,IACvF,KAAK;AAAA,IACL,KAAK;AACJ,aAAO,YAAY,SAChB,SACA,GAAG,MAAM,KAAK,IAAI;AAAA,EACvB;AACD;AAEO,SAAS,+BAA+B,OAAgB,OAAwB;AACtF,MAAI,iBAAiB,WAAY,QAAO,WAAW,KAAK,KAAK;AAC7D,MAAI,8BAA8B,KAAK,EAAG,QAAO,iCAAiC,KAAK;AACvF,MAAI,yBAAyB,KAAK,EAAG,QAAO,4BAA4B,KAAK;AAC7E,MAAI,kCAAkC,KAAK,KAAK,6BAA6B,KAAK,GAAG;AACpF,UAAM,IAAI,UAAU,GAAG,KAAK,8BAA8B;AAAA,EAC3D;AACA,MAAI;AACH,WAAO,sBAAsB,OAAO,KAAK;AAAA,EAC1C,SAAS,OAAO;AACf,UAAM,IAAI;AAAA,MACT,GAAG,KAAK;AAAA,MACR,EAAE,OAAO,MAAM;AAAA,IAChB;AAAA,EACD;AACD;AAEO,SAAS,2BAA2B,OAAgB,OAAmC;AAC7F,MAAI;AACH,mCAA+B,OAAO,KAAK;AAC3C,WAAO;AAAA,EACR,SAAS,OAAO;AACf,WAAOC,cAAa,KAAK;AAAA,EAC1B;AACD;AAEO,SAAS,2BACf,SAMA,QACiB;AACjB,MAAI,YAAY,OAAW,QAAO;AAClC,MAAI,QAAQ,SAAS,QAAQ;AAC5B,WAAO;AAAA,MACN,GAAG;AAAA,MACH,OAAO,+BAA+B,QAAQ,OAAO,GAAG,MAAM,gBAAgB;AAAA,IAC/E;AAAA,EACD;AACA,MAAI,QAAQ,SAAS,SAAS;AAC7B,WAAO;AAAA,MACN,GAAG;AAAA,MACH,OAAO,+BAA+B,QAAQ,OAAO,GAAG,MAAM,iBAAiB;AAAA,IAChF;AAAA,EACD;AACA,MAAI,QAAQ,SAAS,UAAU;AAC9B,WAAO;AAAA,MACN,GAAG;AAAA,MACH,QAAQ,+BAA+B,QAAQ,QAAQ,GAAG,MAAM,kBAAkB;AAAA,IACnF;AAAA,EACD;AACA,MAAI,YAAY,SAAS;AACxB,QAAI,QAAQ,WAAW,OAAW,QAAO,EAAE,MAAM,QAAQ;AACzD,WAAO;AAAA,MACN,GAAG;AAAA,MACH,QAAQ,+BAA+B,QAAQ,QAAQ,GAAG,MAAM,gBAAgB;AAAA,IACjF;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,8BAA8B,OAAsD;AAC5F,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,QAAM,OAAO,QAAQ,OAAO,MAAM;AAClC,MAAI,SAAS,SAAS;AACrB,WAAO,YAAY,OAAO,CAAC,QAAQ,OAAO,CAAC,KAAK,QAAQ,OAAO,OAAO,aAAa;AAAA,EACpF;AACA,MAAI,SAAS,aAAa;AACzB,WACC,YAAY,OAAO,CAAC,SAAS,MAAM,CAAC,KAAK,yBAAyB,QAAQ,OAAO,OAAO,CAAC;AAAA,EAE3F;AACA,SAAO;AACR;AAEA,SAAS,kCAAkC,OAAyB;AACnE,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,QAAM,OAAO,QAAQ,OAAO,MAAM;AAClC,MAAI,SAAS,YAAa,QAAO,WAAW;AAC5C,MAAI,SAAS,QAAS,QAAO;AAC7B,SAAO,WAAW,SAAS,QAAQ,OAAO,OAAO,aAAa;AAC/D;AAEA,SAAS,yBAAyB,OAAiD;AAClF,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,QAAM,OAAO,QAAQ,OAAO,MAAM;AAClC,QAAM,SAAS,QAAQ,OAAO,QAAQ;AACtC,QAAM,UAAU,QAAQ,OAAO,SAAS;AACxC,MAAI,OAAO,WAAW,YAAY,OAAO,WAAW,EAAG,QAAO;AAC9D,MAAI,OAAO,YAAY,YAAY,QAAQ,WAAW,EAAG,QAAO;AAChE,MAAI,SAAS,QAAS,QAAO,YAAY,OAAO,CAAC,WAAW,UAAU,MAAM,CAAC;AAC7E,MAAI,SAAS,QAAQ;AACpB,WACC,YAAY,OAAO,CAAC,WAAW,UAAU,QAAQ,OAAO,CAAC,KACzD,QAAQ,OAAO,OAAO,aAAa;AAAA,EAErC;AACA,SAAO;AACR;AAEA,SAAS,6BAA6B,OAAyB;AAC9D,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,QAAM,OAAO,QAAQ,OAAO,MAAM;AAClC,MAAI,SAAS,WAAW,SAAS,OAAQ,QAAO;AAChD,SAAO,YAAY,SAAS,aAAa,SAAS,WAAW;AAC9D;AAEA,SAAS,kBAAkB,OAAkD;AAC5E,MAAI,CAACD,UAAS,KAAK,EAAG,QAAO;AAC7B,QAAM,QAAQ,OAAO,eAAe,KAAK;AACzC,MAAI,UAAU,OAAO,aAAa,UAAU,KAAM,QAAO;AACzD,MAAI,OAAO,sBAAsB,KAAK,EAAE,SAAS,EAAG,QAAO;AAC3D,aAAW,OAAO,OAAO,oBAAoB,KAAK,GAAG;AACpD,UAAM,aAAa,OAAO,yBAAyB,OAAO,GAAG;AAC7D,QAAI,eAAe,UAAa,EAAE,WAAW,eAAe,CAAC,WAAW,YAAY;AACnF,aAAO;AAAA,IACR;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAAS,QAAQ,OAAgC,KAAsB;AACtE,QAAM,aAAa,OAAO,yBAAyB,OAAO,GAAG;AAC7D,SAAO,eAAe,UAAa,WAAW,aAAa,WAAW,QAAQ;AAC/E;AAEA,SAAS,WAAW,OAAgC,KAAsB;AACzE,QAAM,aAAa,OAAO,yBAAyB,OAAO,GAAG;AAC7D,SAAO,eAAe,UAAa,WAAW;AAC/C;AAEA,SAAS,YAAY,OAAgC,MAAkC;AACtF,QAAM,UAAU,IAAI,IAAI,IAAI;AAC5B,QAAM,SAAS,OAAO,oBAAoB,KAAK;AAC/C,SAAO,OAAO,WAAW,KAAK,UAAU,OAAO,MAAM,CAAC,QAAQ,QAAQ,IAAI,GAAG,CAAC;AAC/E;AAEA,SAAS,iCACR,OAC8B;AAC9B,MAAI,MAAM,SAAS,QAAS,QAAO,EAAE,MAAM,SAAS,OAAO,WAAW,KAAK,MAAM,KAAK,EAAE;AACxF,SAAO,EAAE,MAAM,aAAa,OAAO,4BAA4B,MAAM,KAAK,EAAE;AAC7E;AAEA,SAAS,4BAA4B,OAAuD;AAC3F,SAAO;AAAA,IACN,MAAM,MAAM;AAAA,IACZ,QAAQ,MAAM;AAAA,IACd,SAAS,MAAM;AAAA,IACf,GAAI,MAAM,UAAU,SAAY,CAAC,IAAI,EAAE,OAAO,WAAW,KAAK,MAAM,KAAK,EAAE;AAAA,EAC5E;AACD;AAEO,SAAS,mBAAmB,SAAkB,UAA4B;AAChF,MACC,OAAO,YAAY,YACnB,YAAY,QACX,QAAwC,SAAS,SACjD;AACD,WAAQ,QAAyC;AAAA,EAClD;AACA,SAAO;AACR;AAEO,SAAS,6BAA6B,OAAsB;AAClE,QAAM,UAAUC,cAAa,KAAK;AAClC,MACC,QAAQ,SAAS,cAAc,KAC/B,QAAQ,SAAS,UAAU,KAC3B,QAAQ,SAAS,gBAAgB,KACjC,QAAQ,SAAS,KAAK,KACtB,QAAQ,SAAS,KAAK,KACtB,QAAQ,SAAS,iBAAiB,KAClC,QAAQ,SAAS,aAAa,KAC9B,QAAQ,SAAS,aAAa,KAC9B,QAAQ,SAAS,0BAA0B,KAC3C,QAAQ,SAAS,wBAAwB,KACzC,QAAQ,SAAS,gBAAgB,GAChC;AACD,UAAM;AAAA,EACP;AACD;AAEO,SAASA,cAAa,OAAwB;AACpD,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;;;ACjZO,SAAS,WACf,OACA,QACA,OAA0B,CAAC,GACa;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,MAAM,KAAwB,CAAC,GAAG,MAAM;AAAA,IACxD,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,IACT,0BAA0B;AAAA,IAC1B,oBAAoB;AAAA,EACrB,CAAC;AACD,QAAM,YAAY,wBAAwB,OAAO,OAAO,QAAQ,UAAU,IAAI;AAC9E,QAAM,UAAU,sBAAsB,OAAO,WAAW,IAAI;AAC5D,QAAM,SAAS,qBAAqB,OAAO,OAAO,QAAQ,UAAU,IAAI;AACxE,QAAM,SAAS,qBAAqB,OAAO,UAAU,OAAO,QAAQ,IAAI;AACxE,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,KAAK,WAAW,WAAW,SAAS,UAAU;AAC7C,YAAM,UAAU,kBAAkB,WAAW,WAAW,OAAO;AAC/D,aAAO,QAAQ,KAAK;AAAA,QACnB;AAAA,UACC;AAAA,UACA;AAAA,YACC,MAAM;AAAA,YACN,SAAS;AAAA,YACT,gBAAgB,UAAU;AAAA,YAC1B;AAAA,UACD;AAAA,QACD;AAAA,MACD,CAAC;AACD,aAAO;AAAA,IACR;AAAA,IACA,QAAQ,WAAW,WAAW,OAAO;AACpC,YAAM,UAAU,kBAAkB,WAAW,WAAW,KAAK;AAC7D,eAAS,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AACjC,aAAO;AAAA,IACR;AAAA,EACD;AACD;AAEA,SAAS,kBACR,WACA,WACA,SAC8B;AAC9B,MAAI,UAAU,WAAW,EAAG,OAAM,IAAI,WAAW,yCAAyC;AAC1F,MAAI,UAAU,WAAW,EAAG,OAAM,IAAI,WAAW,yCAAyC;AAC1F,SAAO,EAAE,WAAW,WAAW,QAAQ;AACxC;AAEA,SAAS,kBACR,WACA,WACA,OACoB;AACpB,MAAI,UAAU,WAAW;AACxB,UAAM,IAAI,WAAW,iDAAiD;AACvE,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,WAAW,6CAA6C;AAC1F,SAAO,EAAE,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,UAAU,GAAI,WAAW,MAAM;AAC9E;AAaA,SAAS,qBAAyC;AACjD,SAAO,EAAE,YAAY,oBAAI,IAAI,GAAG,OAAO,oBAAI,IAAI,EAAE;AAClD;AAEA,SAAS,sBAAsB,OAA2B,WAA4B;AACrF,SAAO,MAAM,WAAW,IAAI,SAAS;AACtC;AAEA,SAAS,uBAAuB,OAA2B,SAAwC;AAClG,QAAM,UAAU,8BAA8B,OAAO,QAAQ,GAAG;AAChE,SAAO,SAAS,cAAc,QAAQ,aAAa,MAAM,WAAW,IAAI,QAAQ,SAAS;AAC1F;AAEA,SAAS,8BACR,OACA,KACmC;AACnC,SAAO,MAAM,MAAM,IAAI,GAAG;AAC3B;AAEA,SAAS,6BACR,OACA,WACmC;AACnC,aAAW,WAAW,MAAM,MAAM,OAAO,GAAG;AAC3C,QAAI,QAAQ,cAAc,UAAW,QAAO;AAAA,EAC7C;AACA,SAAO;AACR;AAEA,SAAS,oBAAoB,OAA2B,SAAqC;AAC5F,QAAM,gBAAgB,MAAM,MAAM,IAAI,QAAQ,GAAG;AACjD,MAAI,kBAAkB,QAAW;AAChC,UAAM,WAAW,OAAO,cAAc,SAAS;AAAA,EAChD;AACA,aAAW,CAAC,KAAK,OAAO,KAAK,MAAM,OAAO;AACzC,QAAI,QAAQ,cAAc,QAAQ,aAAa,QAAQ,QAAQ,KAAK;AACnE,YAAM,MAAM,OAAO,GAAG;AACtB;AAAA,IACD;AAAA,EACD;AACA,QAAM,WAAW,IAAI,QAAQ,SAAS;AACtC,QAAM,MAAM,IAAI,QAAQ,KAAK,OAAO;AACrC;AAEA,SAAS,6BACR,OACA,WACmC;AACnC,MAAI,CAAC,MAAM,WAAW,OAAO,SAAS,EAAG,QAAO;AAChD,MAAI;AACJ,MAAI;AACJ,aAAW,CAAC,cAAc,OAAO,KAAK,MAAM,OAAO;AAClD,QAAI,QAAQ,cAAc,WAAW;AACpC,YAAM;AACN,cAAQ;AACR;AAAA,IACD;AAAA,EACD;AACA,MAAI,QAAQ,OAAW,OAAM,MAAM,OAAO,GAAG;AAC7C,SAAO;AACR;AAEA,SAAS,uBACR,OACA,KACmC;AACnC,QAAM,UAAU,MAAM,MAAM,IAAI,GAAG;AACnC,MAAI,YAAY,OAAW,QAAO;AAClC,QAAM,MAAM,OAAO,GAAG;AACtB,QAAM,WAAW,OAAO,QAAQ,SAAS;AACzC,SAAO;AACR;AAEA,SAAS,yBACR,OACA,UACmC;AACnC,QAAM,QAAQ,uBAAuB,OAAO,SAAS,SAAS,GAAG;AACjE,MAAI,UAAU,OAAW,QAAO;AAChC,QAAM,WAAW,2BAA2B,QAAQ;AACpD,MAAI,aAAa,UAAa,sBAAsB,OAAO,SAAS,SAAS,GAAG;AAC/E,WAAO;AAAA,EACR;AACA,SAAO;AACR;AAEA,SAAS,2BACR,UACmC;AACnC,MAAI,SAAS,SAAS,SAAS,OAAQ,QAAO;AAC9C,QAAM,UAAU,0BAA0B,SAAS,QAAQ,KAAK;AAChE,MAAI,YAAY,OAAW,QAAO;AAClC,SAAO;AAAA,IACN,WAAW,QAAQ;AAAA,IACnB,WAAW,QAAQ;AAAA,IACnB,KAAK,SAAS,SAAS;AAAA,EACxB;AACD;AAEA,SAAS,4BAA+B,UAAyC;AAChF,SAAO,SAAS;AACjB;AAEA,SAAS,6BAAgC,UAA0C;AAClF,SAAO,SAAS,SAAS,YAAY,SAAS,SAAS;AACxD;AAEA,SAAS,4BAA+B,UAAyC;AAChF,SAAO,SAAS;AACjB;AAEA,SAAS,iCACR,UACA,SACU;AACV,SAAO,4BAA4B,QAAQ,MAAM,QAAQ;AAC1D;AAEA,SAAS,wBACR,OACA,QACA,UACA,MACsC;AACtC,SAAO,MAAM;AAAA,IACZ,CAAC,QAAQ,QAAQ;AAAA,IACjB,CAAC,QAAQ;AAIR,YAAM,QAAQ,IAAI,MAAM,IAAW,KAAK;AAAA,QACvC,SAAS,mBAAmB;AAAA,MAC7B;AACA,YAAM,QAAyC,CAAC;AAChD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,UAAU,2BAA2B,MAAM,QAAQ;AACzD,cAAI,YAAY,OAAW;AAC3B,cAAI,uBAAuB,MAAM,SAAS,OAAO,EAAG;AACpD,8BAAoB,MAAM,SAAS,OAAO;AAAA,QAC3C,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS,QAAQ;AAC/E,gBAAM,WAAW,2BAAsC,MAAM,SAAS,QAAQ,KAAK;AACnF,cAAI,aAAa,QAAW;AAC3B,kBAAMC,aAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAMC,WACLD,eAAc,SACX,SACA,6BAA6B,MAAM,SAASA,UAAS;AACzD,gBACCC,aAAY,UACZ,cAAc,UACd,cAAcA,SAAQ,WACrB;AACD,2CAA6B,MAAM,SAASA,SAAQ,SAAS;AAAA,YAC9D;AACA;AAAA,UACD;AACA,gBAAM,YAAY,4BAA4B,QAAQ;AACtD,gBAAM,UAAU,6BAA6B,MAAM,SAAS,SAAS;AACrE,cAAI,YAAY,UAAa,iCAAiC,UAAU,OAAO,GAAG;AACjF,gBAAI,6BAA6B,QAAQ,GAAG;AAC3C,2CAA6B,MAAM,SAAS,SAAS;AAAA,YACtD;AACA,kBAAM,KAAK,QAAQ;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,mCAAyB,MAAM,SAAS,MAAM,QAAQ;AAAA,QACvD,WAAW,MAAM,SAAS,aAAa;AACtC,iCAAuB,MAAM,SAAS,MAAM,GAAG;AAAA,QAChD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU;AAChB,qCAA6B,MAAM,SAAS,QAAQ,SAAS;AAAA,MAC9D;AACA,UAAI,MAAM,IAAI,KAAK;AACnB,iBAAW,YAAY,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,CAAC,CAAC;AAAA,IAC5D;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,sBACR,OACA,WACA,MACoC;AACpC,SAAO,MAAM;AAAA,IACZ,CAAC,SAAS;AAAA,IACV,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,WAAW;AACjB,YAAI,SAAS,SAAS,UAAU;AAC/B,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,SAAS,SAAS;AAAA,cACnB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,YAAY,SAAS,qBAAqB,0BAA0B,MAAM;AAAA,EAC1F;AACD;AAEA,SAAS,qBACR,OACA,QACA,UACA,MACyB;AACzB,SAAO,MAAM;AAAA,IACZ,CAAC,QAAQ,QAAQ;AAAA,IACjB,CAAC,QAAQ;AAER,YAAM,QACL,IAAI,MAAM,IAAW,KACpB;AAAA,QACA,QAAQ,EAAE,OAAO,QAAQ,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,EAAE;AAAA,QAC1E,SAAS,mBAAmB;AAAA,MAC7B;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,UAAU,2BAA2B,MAAM,QAAQ;AACzD,cAAI,YAAY,QAAW;AAC1B,gBAAI,uBAAuB,MAAM,SAAS,OAAO,GAAG;AACnD,oBAAM,SAAS;AAAA,gBACd,GAAG,MAAM;AAAA,gBACT,OAAO;AAAA,gBACP,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB,QAAQ,MAAM,OAAO,SAAS;AAAA,cAC/B;AACA;AAAA,YACD;AACA,gCAAoB,MAAM,SAAS,OAAO;AAC1C,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,QAAQ;AAAA,cACnB,WAAW,QAAQ;AAAA,YACpB;AAAA,UACD;AAAA,QACD,WACC,MAAM,SAAS,aACf,MAAM,SAAS,sBACf,MAAM,SAAS,kBACf,MAAM,SAAS,gBACd;AACD,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,gBAAM,UAAU,yBAAyB,MAAM,SAAS,MAAM,QAAQ;AACtE,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,GAAI,YAAY,SACb,CAAC,IACD,EAAE,WAAW,QAAQ,WAAW,WAAW,QAAQ,UAAU;AAAA,YAChE,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,WAAW,MAAM,SAAS,aAAa;AACtC,gBAAM,UAAU,uBAAuB,MAAM,SAAS,MAAM,GAAG;AAC/D,gBAAM,SAAS;AAAA,YACd,GAAG,MAAM;AAAA,YACT,OAAO;AAAA,YACP,GAAI,YAAY,SACb,CAAC,IACD,EAAE,WAAW,QAAQ,WAAW,WAAW,QAAQ,UAAU;AAAA,YAChE,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC/B;AAAA,QACD,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS,QAAQ;AAC/E,gBAAM,WAAW,2BAAsC,MAAM,SAAS,QAAQ,KAAK;AACnF,cAAI,aAAa,QAAW;AAC3B,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAMA,WACL,cAAc,UAAa,cAAc,SACtC,SACA,6BAA6B,MAAM,SAAS,SAAS;AACzD,kBAAM,iBACLA,aAAY,UAAaA,SAAQ,cAAc,YAAYA,WAAU;AACtE,gBAAI,mBAAmB,OAAW;AAClC,yCAA6B,MAAM,SAAS,eAAe,SAAS;AACpE,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,eAAe;AAAA,cAC1B,WAAW,eAAe;AAAA,cAC1B,QAAQ,MAAM,OAAO,SAAS;AAAA,YAC/B;AACA;AAAA,UACD;AACA,gBAAM,UAAU,6BAA6B,MAAM,SAAS,SAAS,SAAS;AAC9E,cAAI,YAAY,QAAW;AAC1B,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,SAAS;AAAA,cACpB,WAAW,SAAS;AAAA,cACpB,QAAQ,MAAM,OAAO,SAAS;AAAA,YAC/B;AACA;AAAA,UACD;AACA,cAAI,CAAC,iCAAiC,UAAU,OAAO,GAAG;AACzD,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,QAAQ;AAAA,cACnB,WAAW,QAAQ;AAAA,cACnB,QAAQ,MAAM,OAAO,SAAS;AAAA,YAC/B;AACA;AAAA,UACD;AACA,cAAI,SAAS,SAAS,UAAU;AAC/B,yCAA6B,MAAM,SAAS,QAAQ,SAAS;AAC7D,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,SAAS;AAAA,cACpB,WAAW,SAAS;AAAA,cACpB,WAAW,MAAM,OAAO,YAAY;AAAA,YACrC;AAAA,UACD,WAAW,SAAS,SAAS,SAAS;AACrC,yCAA6B,MAAM,SAAS,QAAQ,SAAS;AAC7D,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,SAAS;AAAA,cACpB,WAAW,SAAS;AAAA,cACpB,QAAQ,MAAM,OAAO,SAAS;AAAA,YAC/B;AAAA,UACD,OAAO;AACN,kBAAM,SAAS;AAAA,cACd,GAAG,MAAM;AAAA,cACT,OAAO;AAAA,cACP,WAAW,SAAS;AAAA,cACpB,WAAW,SAAS;AAAA,YACrB;AAAA,UACD;AAAA,QACD;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU;AAChB,qCAA6B,MAAM,SAAS,QAAQ,SAAS;AAC7D,cAAM,SAAS;AAAA,UACd,GAAG,MAAM;AAAA,UACT,OAAO;AAAA,UACP,WAAW,QAAQ;AAAA,UACnB,WAAW,QAAQ;AAAA,UACnB,QAAQ,MAAM,OAAO,SAAS;AAAA,UAC9B,UAAU,MAAM,OAAO,WAAW;AAAA,QACnC;AAAA,MACD;AACA,YAAM,SAAS,EAAE,GAAG,MAAM,QAAQ,SAAS,MAAM,QAAQ,WAAW,KAAK;AACzE,UAAI,MAAM,IAAI,KAAK;AACnB,UAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,MAAM,CAAC,CAAC;AAAA,IAClC;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,qBACR,OACA,UACA,QACA,MACwB;AACxB,SAAO,MAAM;AAAA,IACZ,CAAC,UAAU,MAAM;AAAA,IACjB,CAAC,QAAQ;AACR,YAAM,UAAU,IAAI,MAAM,IAAwB,KAAK,mBAAmB;AAC1E,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU;AAChB,qCAA6B,SAAS,QAAQ,SAAS;AACvD,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA,EAAE,WAAW,QAAQ,WAAW,WAAW,QAAQ,WAAW,OAAO,QAAQ,MAAM;AAAA,UACpF;AAAA,QACD,CAAC;AAAA,MACF;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AAId,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,UAAU,2BAA2B,MAAM,QAAQ;AACzD,cAAI,YAAY,QAAW;AAC1B,gBAAI,uBAAuB,SAAS,OAAO,GAAG;AAC7C,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,WAAW,QAAQ;AAAA,oBACnB,WAAW,QAAQ;AAAA,oBACnB,OAAO,8CAA8C,QAAQ,SAAS;AAAA,kBACvE;AAAA,gBACD;AAAA,cACD,CAAC;AACD;AAAA,YACD;AACA,gCAAoB,SAAS,OAAO;AAAA,UACrC;AACA;AAAA,QACD;AACA,YAAI,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS,QAAQ;AACxE,gBAAM,WAAW,2BAAsC,MAAM,SAAS,QAAQ,KAAK;AACnF,cAAI,aAAa,QAAW;AAC3B,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAM,YAAY,iCAAiC,MAAM,SAAS,QAAQ,KAAK;AAC/E,kBAAM,UACL,cAAc,UAAa,cAAc,SACtC,SACA,6BAA6B,SAAS,SAAS;AACnD,gBAAI,YAAY,UAAa,QAAQ,cAAc,UAAW;AAC9D,yCAA6B,SAAS,QAAQ,SAAS;AACvD,gBAAI,KAAK;AAAA,cACR;AAAA,gBACC;AAAA,gBACA;AAAA,kBACC,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,UAAU;AAAA,kBAC/C,GAAI,cAAc,SAAY,CAAC,IAAI,EAAE,UAAU;AAAA,kBAC/C,OAAO;AAAA,gBACR;AAAA,cACD;AAAA,YACD,CAAC;AAAA,UACF,OAAO;AACN,kBAAM,UAAU,6BAA6B,SAAS,SAAS,SAAS;AACxE,gBAAI,YAAY,QAAW;AAC1B,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,WAAW,SAAS;AAAA,oBACpB,WAAW,SAAS;AAAA,oBACpB,OAAO;AAAA,kBACR;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF,WAAW,CAAC,iCAAiC,UAAU,OAAO,GAAG;AAChE,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,WAAW,QAAQ;AAAA,oBACnB,WAAW,QAAQ;AAAA,oBACnB,OAAO,mCAAmC,SAAS,SAAS,sCAAsC,QAAQ,SAAS;AAAA,kBACpH;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF,WAAW,SAAS,SAAS,SAAS;AACrC,2CAA6B,SAAS,QAAQ,SAAS;AACvD,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,WAAW,SAAS;AAAA,oBACpB,WAAW,SAAS;AAAA,oBACpB,OAAO,SAAS;AAAA,kBACjB;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF,WAAW,SAAS,SAAS,UAAU;AACtC,2CAA6B,SAAS,QAAQ,SAAS;AAAA,YACxD;AAAA,UACD;AACA;AAAA,QACD;AACA,YAAI,MAAM,SAAS,QAAQ;AAC1B,gBAAM,UAAU,yBAAyB,SAAS,MAAM,QAAQ;AAChE,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,OAAO,OAAO,MAAM,KAAK;AAAA,cAC1B;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,aAAa;AACtC,gBAAM,UAAU,uBAAuB,SAAS,MAAM,GAAG;AACzD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,WAAW,SAAS;AAAA,gBACpB,WAAW,SAAS;AAAA,gBACpB,OAAO,OAAO,MAAM,KAAK;AAAA,cAC1B;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC;AAAA,QAC5C,WACC,MAAM,SAAS,sBACf,MAAM,SAAS,kBACf,MAAM,SAAS,gBACd;AACD,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,OAAO,6BAA6B,KAAK,EAAE,CAAC,CAAC,CAAC;AAAA,QACpE;AAAA,MACD;AACA,UAAI,MAAM,IAAI,OAAO;AAAA,IACtB;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,6BACR,OACS;AACT,MAAI,MAAM,SAAS,oBAAoB;AACtC,WAAO,+BAA+B,MAAM,MAAM,2BAA2B,MAAM,QAAQ;AAAA,EAC5F;AACA,MAAI,MAAM,SAAS,gBAAgB;AAClC,WAAO,2BAA2B,MAAM,GAAG,gCAAgC,MAAM,QAAQ;AAAA,EAC1F;AACA,MAAI,MAAM,SAAS,gBAAgB;AAClC,WAAO,oBAAoB,MAAM,OAAO,uCAAuC,MAAM,SAAS;AAAA,EAC/F;AACA,SAAO;AACR;;;ACroBO,SAAS,gBACf,OACA,QACA,MACsC;AACtC,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAY,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,QAAQ,CAAC,CAAC;AAAA,MACnE;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,qBAAqB;AAAA,EAC3D;AACD;AAEO,SAAS,YACf,OACA,QACA,MACsB;AACtB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,OAAO;AACzB,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,WAAW,MAAM,WAAW,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AAAA,QAC9E;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,SAAS,SAAS,iBAAiB;AAAA,EACnD;AACD;AAEO,SAAS,aACf,OACA,QACA,MACuB;AACvB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,QAAQ;AAC1B,cAAI,KAAK;AAAA,YACR,CAAC,QAAQ,EAAE,WAAW,MAAM,WAAW,UAAU,MAAM,UAAU,OAAO,MAAM,MAAM,CAAC;AAAA,UACtF,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,UAAU,SAAS,kBAAkB;AAAA,EACrD;AACD;AAEO,SAAS,cACf,OACA,QACA,MACA,WACyB;AACzB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,OACH,IAAI,MAAM,IAAsB,KAC/B;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,SAAS;AAAA,QACT,SAAS;AAAA,QACT,UAAU;AAAA,QACV,OAAO;AAAA,QACP,QAAQ;AAAA,QACR,QAAQ;AAAA,MACT;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,YAAY;AAC9B,gBAAM,EAAE,KAAK,QAAQ,IAAI,MAAM,SAAS;AACxC,gBAAM,WAAW,eAAe,MAAM,SAAS,IAAI;AACnD,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OACC,MAAM,SAAS,SAAS,UACrB,YACA,MAAM,SAAS,SAAS,UACvB,WACA;AAAA,YACL,SAAS,KAAK,IAAI,KAAK,SAAS,MAAM,CAAC;AAAA,YACvC,SACC,MAAM,SAAS,SAAS,UACrB,IACA,YAAY,YAAY,IACvB,KAAK,UAAU,IACf,KAAK;AAAA,YACV,UAAU,WAAW,KAAK,WAAW,IAAI,KAAK;AAAA,YAC9C,SAAS;AAAA,UACV;AAAA,QACD,WAAW,MAAM,SAAS,OAAO;AAChC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO,MAAM,SAAS,SAAS,UAAU,WAAW;AAAA,YACpD,SAAS,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC;AAAA,YACrC,OAAO,KAAK,QAAQ;AAAA,YACpB,SAAS,MAAM,SAAS,SAAS;AAAA,UAClC;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC;AAAA,YACrC,QAAQ,KAAK,SAAS;AAAA,YACtB,QAAQ,KAAK,SAAS;AAAA,YACtB,SAAS,MAAM,SAAS,SAAS;AAAA,UAClC;AAAA,QACD,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,aAAa;AACtC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,KAAK,IAAI,GAAG,KAAK,UAAU,CAAC;AAAA,YACrC,QAAQ,KAAK,SAAS;AAAA,YACtB,SAAS,MAAM;AAAA,UAChB;AAAA,QACD,WAAW,MAAM,SAAS,UAAU;AACnC,iBAAO,EAAE,GAAG,MAAM,QAAQ,MAAM,OAAO;AAAA,QACxC,WAAW,MAAM,SAAS,gBAAgB;AACzC,iBAAO,EAAE,GAAG,MAAM,OAAO,WAAW,QAAQ,KAAK,SAAS,GAAG,SAAS,MAAM,IAAI;AAAA,QACjF,WAAW,MAAM,SAAS,oBAAoB;AAC7C,iBAAO,EAAE,GAAG,MAAM,OAAO,WAAW,QAAQ,KAAK,SAAS,EAAE;AAAA,QAC7D,WAAW,MAAM,SAAS,kBAAkB,MAAM,SAAS,WAAW;AACrE,iBAAO,EAAE,GAAG,MAAM,OAAO,WAAW,QAAQ,KAAK,SAAS,EAAE;AAAA,QAC7D,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS;AACvE,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,QAAQ,KAAK,SAAS;AAAA,YACtB,SAAS,MAAM,SAAS,SAAS;AAAA,UAClC;AAAA,QACD,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS;AACvE,iBAAO,EAAE,GAAG,MAAM,OAAO,UAAU,SAAS,MAAM,SAAS,SAAS,IAAI;AAAA,QACzE;AAAA,MACD;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,mBAAmB;AAAA,EACvD;AACD;AAEO,SAAS,cACf,OACA,QACA,MACgB;AAChB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,OAAQ,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,iBAClD,MAAM,SAAS,YAAa,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,iBAC5D,MAAM,SAAS,gBAAgB;AACvC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,GAAG,IAAI,iBAAiB,MAAM,GAAG,gCAAgC,MAAM,QAAQ;AAAA,YAChF;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,SAAS,SAAS;AACvE,cAAI,KAAK,CAAC,CAAC,QAAQ,mBAAmB,MAAM,SAAS,SAAS,uBAAuB,CAAC,CAAC,CAAC;AAAA,QACzF,WAAW,MAAM,SAAS,oBAAoB;AAC7C,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,GAAG,IAAI,qBAAqB,MAAM,MAAM,2BAA2B,MAAM,QAAQ;AAAA,YAClF;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,gBAAgB;AACzC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,GAAG,IAAI,UAAU,MAAM,OAAO,uCAAuC,MAAM,SAAS;AAAA,YACrF;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,QACjC;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,mBAAmB;AAAA,EACvD;AACD;AAEO,SAAS,cACf,OACA,QACA,MACe;AACf,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,SAAU,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,MAAM,CAAC,CAAC;AAAA,MAC/D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,mBAAmB;AAAA,EACvD;AACD;AAEO,SAAS,gBACf,OACA,QACA,MAC0B;AAC1B,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,cAAc,eAAe,MAAM,SAAS,IAAI,GAAG;AACrE,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,KAAK,MAAM,SAAS,SAAS;AAAA,gBAC7B,SAAS,MAAM,SAAS,SAAS;AAAA,gBACjC,aAAa,MAAM,SAAS,SAAS;AAAA,cACtC;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,qBAAqB;AAAA,EAC3D;AACD;AAEO,SAAS,mBACfC,OACA,WACqC;AACrC,SAAO,IAAI,MAAMA,OAAM;AAAA,IACtB,IAAI,QAAQ,UAAU;AACrB,UAAI,aAAa,QAAQ;AACxB,eAAO,CAAC,SAAe,OAAO,KAAK,iBAAiB,MAAM,SAAS,CAAC;AAAA,MACrE;AACA,YAAM,QAAQ,QAAQ,IAAI,QAAQ,UAAU,MAAM;AAClD,aAAO,OAAO,UAAU,aAAa,MAAM,KAAK,MAAM,IAAI;AAAA,IAC3D;AAAA,EACD,CAAC;AACF;AAEO,SAAS,iBAAiB,MAAY,WAAyB;AACrE,SAAO,KAAK,IAAI,CAAC,QAAQ;AACxB,QAAI,IAAI,CAAC,MAAM,OAAQ,QAAO;AAC9B,QAAI,IAAI,CAAC,MAAM,SAAS;AACvB,aAAO;AAAA,QACN;AAAA,QACA;AAAA,UACC,GAAG,SAAS,4BAA4B;AAAA,YACvC,aAAa,IAAI,CAAC,CAAC;AAAA,UACpB,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AACA,QAAI,IAAI,CAAC,MAAM,YAAY;AAC1B,aAAO;AAAA,QACN;AAAA,QACA;AAAA,UACC,GAAG,SAAS;AAAA,QACb;AAAA,MACD;AAAA,IACD;AACA,WAAO;AAAA,MACN;AAAA,MACA;AAAA,QACC,GAAG,SAAS,oDAAoD,IAAI,CAAC,CAAC;AAAA,MACvE;AAAA,IACD;AAAA,EACD,CAAC;AACF;AAEO,SAAS,eAAe,OAAyC;AACvE,SAAO,EAAE,4BAA4B,MAAM,MAAM;AAClD;AAEO,SAAS,iBAAiB,OAAmD;AACnF,SACC,OAAO,UAAU,YACjB,UAAU,QACT,MAAmC,+BAA+B,QACnE,OAAQ,MAAmC,UAAU;AAEvD;;;ACzSO,SAAS,wBACf,UAC2D;AAC3D,QAAM,MAAM,oBAAI,IAAyD;AACzE,aAAW,WAAW,UAAU;AAC/B,QAAI,QAAQ,UAAU,WAAW,GAAG;AACnC,YAAM,IAAI,WAAW,8CAA8C;AAAA,IACpE;AACA,QAAI,IAAI,IAAI,QAAQ,SAAS,GAAG;AAC/B,YAAM,IAAI,WAAW,yCAAyC,QAAQ,SAAS,GAAG;AAAA,IACnF;AACA,QAAI,IAAI,QAAQ,WAAW,QAAQ,MAAM;AAAA,EAC1C;AACA,SAAO;AACR;AAYA,SAAS,6BACR,QACA,UACA,mBAC4B;AAC5B,QAAM,gBAAgB,wBAAwB,QAAQ;AACtD,MAAI,kBAAkB,QAAW;AAChC,WAAO,EAAE,MAAM,WAAW,OAAO,cAAc;AAAA,EAChD;AACA,MAAI,SAAS,cAAc,mBAAmB;AAC7C,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,oCAAoC,SAAS,SAAS,2BAA2B,iBAAiB;AAAA,IAC1G;AAAA,EACD;AACA,QAAM,MAAM,SAAS,SAAS;AAC9B,QAAM,WAAW,OAAO,SAAS;AACjC,MAAI,OAAO,OAAO,QAAQ;AACzB,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,0CAA0C,GAAG,cAAc,OAAO,MAAM;AAAA,IAChF;AAAA,EACD;AACA,MAAI,MAAM,UAAU;AACnB,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,6CAA6C,GAAG,cAAc,QAAQ;AAAA,IAC9E;AAAA,EACD;AACA,MAAI,SAAS,SAAS,SAAS,OAAO,cAAc;AACnD,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO,GAAG,SAAS,SAAS,oCAAoC,SAAS,SAAS,MAAM,oBAAoB,OAAO,YAAY;AAAA,IAChI;AAAA,EACD;AACA,SAAO,SAAS;AAChB,SAAO,eAAe,SAAS,SAAS;AACxC,MAAI,SAAS,SAAS,OAAQ,QAAO,EAAE,MAAM,WAAW;AACxD,MAAI,SAAS,SAAS,SAAS,QAAQ;AACtC,WAAO,EAAE,MAAM,WAAW,OAAO,4DAA4D;AAAA,EAC9F;AACA,QAAM,UAAU,0BAA6B,SAAS,QAAQ,KAAK;AACnE,MAAI,YAAY,QAAW;AAC1B,WAAO,EAAE,MAAM,WAAW,OAAO,gDAAgD;AAAA,EAClF;AACA,SAAO,EAAE,MAAM,WAAW,SAAS,IAAI;AACxC;AAEO,SAAS,0BACf,OACA,SACA,MACA,mBACA,UACA,eACkD;AAClD,SAAO,MAAM;AAAA,IACZ,CAAC,OAAO;AAAA,IACR,CAAC,QAAQ;AACR,YAAM,SAAS,IAAI,MAAM,IAA2B,KAAK,EAAE,QAAQ,GAAG,cAAc,EAAE;AACtF,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,WAAW;AACjB,cAAM,WAAW,6BAA6B,QAAQ,UAAU,iBAAiB;AACjF,YAAI,SAAS,SAAS,WAAY;AAClC,YAAI,SAAS,SAAS,WAAW;AAChC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,SAAS,MAAM,CAAC,CAAC,CAAC;AAC/D;AAAA,QACD;AACA,cAAM,EAAE,SAAS,IAAI,IAAI;AACzB,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,SAAS,IAAI,CAAC,CAAC,CAAC;AACtD,cAAM,UAAU,SAAS,IAAI,QAAQ,SAAS;AAC9C,YAAI,YAAY,QAAW;AAC1B,cAAI,CAAC,cAAe;AACpB,gBAAM,QAAQ,uCAAuC,QAAQ,SAAS;AACtE,gBAAM,WAAW,wBAAwB,SAAS,KAAK;AACvD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB;AAAA,gBACA,SAAS,EAAE,MAAM,QAAQ,SAAS,UAAU,WAAW,QAAQ,UAAU;AAAA,cAC1E;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,YAAI;AACH,gBAAM,UAAU,QAAQ,OAAO;AAC/B,cAAI,WAAW,OAAO,GAAG;AACxB,kBAAM,IAAI,MAAM,sEAAsE;AAAA,UACvF;AACA,gBAAM,WAAW;AAAA,YAChB,MAAM;AAAA,YACN,WAAW,QAAQ;AAAA,YACnB,WAAW,QAAQ;AAAA,YACnB;AAAA,UACD;AACA,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB,SAAS,EAAE,MAAM,QAAQ,SAAS,UAAU,WAAW,QAAQ,UAAU;AAAA,cAC1E;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,uCAA6B,KAAK;AAClC,gBAAM,UAAUC,cAAa,KAAK;AAClC,gBAAM,WAAW,wBAAwB,SAAS,OAAO;AACzD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,WAAW,QAAQ;AAAA,gBACnB,WAAW,QAAQ;AAAA,gBACnB,OAAO;AAAA,gBACP,SAAS,EAAE,MAAM,QAAQ,SAAS,UAAU,WAAW,QAAQ,UAAU;AAAA,cAC1E;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AACA,UAAI,MAAM,IAAI,MAAM;AAAA,IACrB;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,wBACR,SACA,OACgC;AAChC,SAAO;AAAA,IACN,MAAM;AAAA,IACN,WAAW,QAAQ;AAAA,IACnB,WAAW,QAAQ;AAAA,IACnB;AAAA,EACD;AACD;AAEO,SAAS,oCACf,OACA,QACA,MACyD;AACzD,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,aACE,MAAM,SAAS,cAAc,MAAM,SAAS,eAC7C,MAAM,YAAY,QACjB;AACD,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,QACnC;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEO,SAAS,4BACf,OACA,QACA,MACoC;AACpC,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,0BAA0B;AAAA,IAC3B;AAAA,EACD;AACD;AAEO,SAAS,0BACf,OACA,QACA,MAC8B;AAC9B,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,SACH,IAAI,MAAM,IAA2B,KACpC,EAAE,OAAO,QAAQ,SAAS,GAAG,UAAU,GAAG,QAAQ,EAAE;AACtD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,YAAY;AAC9B,mBAAS;AAAA,YACR,GAAG;AAAA,YACH,OAAO;AAAA,YACP,WAAW,MAAM;AAAA,YACjB,WAAW,MAAM;AAAA,YACjB,SAAS,OAAO,UAAU;AAAA,UAC3B;AAAA,QACD,WAAW,MAAM,SAAS,YAAY;AACrC,mBAAS;AAAA,YACR,GAAG;AAAA,YACH,OAAO;AAAA,YACP,WAAW,MAAM;AAAA,YACjB,WAAW,MAAM;AAAA,YACjB,UAAU,OAAO,WAAW;AAAA,YAC5B,QAAQ,OAAO,SAAS;AAAA,UACzB;AAAA,QACD,WAAW,MAAM,SAAS,WAAW;AACpC,mBAAS,EAAE,GAAG,QAAQ,OAAO,WAAW,QAAQ,OAAO,SAAS,EAAE;AAAA,QACnE;AAAA,MACD;AACA,UAAI,MAAM,IAAI,MAAM;AACpB,UAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,IAC5B;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEO,SAAS,0BACf,OACA,QACA,MACwB;AACxB,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,YAAY;AAC9B,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,EAAE,WAAW,MAAM,WAAW,WAAW,MAAM,WAAW,OAAO,MAAM,MAAM;AAAA,YAC9E;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC;AAAA,QAC5C;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB,0BAA0B,MAAM;AAAA,EAC7F;AACD;;;ACtLA,IAAM,uBAAuB,oBAAI,QAG/B;AACF,IAAM,uBAAuB,oBAAI,QAG/B;AACF,IAAM,uBAAuB,oBAAI,QAG/B;AAGK,SAAS,yBAAyB,WAAmB,KAAqB;AAChF,SAAO,GAAG,SAAS,IAAI,GAAG;AAC3B;AAGO,SAAS,mBAAoC,OAYtB;AAC7B,MAAI,OAAO,MAAM,cAAc,YAAY,MAAM,UAAU,WAAW,GAAG;AACxE,UAAM,IAAI,WAAW,0DAA0D;AAAA,EAChF;AACA,MAAI,CAAC,cAAc,IAAI,MAAM,IAAI,GAAG;AACnC,UAAM,IAAI,WAAW,4CAA4C;AAAA,EAClE;AACA,MAAI,CAAC,sBAAsB,MAAM,GAAG,GAAG;AACtC,UAAM,IAAI,WAAW,oDAAoD;AAAA,EAC1E;AACA,QAAM,SAAS,MAAM,UAAU;AAC/B,MAAI,CAAC,yBAAyB,MAAM,GAAG;AACtC,UAAM,IAAI,WAAW,2DAA2D;AAAA,EACjF;AACA,QAAM,UAAU,MAAM,WAAW;AACjC,MAAI,CAAC,sBAAsB,OAAO,GAAG;AACpC,UAAM,IAAI,WAAW,wDAAwD;AAAA,EAC9E;AACA,QAAM,cAAc,MAAM,eAAe;AACzC,MAAI,CAAC,sBAAsB,WAAW,KAAK,cAAc,SAAS;AACjE,UAAM,IAAI,WAAW,oDAAoD;AAAA,EAC1E;AACA,MAAI,MAAM,cAAc,UAAa,CAAC,sBAAsB,MAAM,SAAS,GAAG;AAC7E,UAAM,IAAI,WAAW,0DAA0D;AAAA,EAChF;AACA,OAAK,MAAM,SAAS,SAAS,MAAM,SAAS,WAAW,MAAM,cAAc,QAAW;AACrF,UAAM,IAAI,WAAW,uBAAuB,MAAM,IAAI,8BAA8B;AAAA,EACrF;AACA,MAAI,MAAM,mBAAmB,UAAa,MAAM,eAAe,WAAW,GAAG;AAC5E,UAAM,IAAI,WAAW,+DAA+D;AAAA,EACrF;AACA,QAAM,eAAe,uBAAuB,MAAM,MAAM,MAAM,SAAS,oBAAoB;AAC3F,MAAI,iBAAiB,QAAW;AAC/B,UAAM,IAAI,WAAW,YAAY;AAAA,EAClC;AACA,QAAM,UAAU;AAAA,IACf,MAAM;AAAA,IACN,sBAAsB,MAAM,IAAI;AAAA,EACjC;AACA,SAAO;AAAA,IACN,WAAW,MAAM;AAAA,IACjB,MAAM,MAAM;AAAA,IACZ;AAAA,IACA,UAAU;AAAA,MACT,KAAK,MAAM;AAAA,MACX;AAAA,MACA,gBAAgB,MAAM,kBAAkB,yBAAyB,MAAM,WAAW,MAAM,GAAG;AAAA,MAC3F;AAAA,MACA;AAAA,MACA,aAAa,MAAM;AAAA,MACnB,WAAW,MAAM;AAAA,MACjB,WAAW,MAAM;AAAA,IAClB;AAAA,EACD;AACD;AAEO,SAAS,WACf,OACA,MACwC;AACxC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS,KAAK,SAAS,YAAY;AACzC,QAAM,UAAU,MAAM,KAAmC,CAAC,GAAG,MAAM;AAAA,IAClE,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,EACV,CAAC;AACD,QAAM,cAAc,MAAM;AAAA,IACzB,CAAC;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,IACV;AAAA,EACD;AACA,QAAM,UAAU,mBAAmB,aAAa,KAAK,SAAS;AAC9D,QAAM,SAAS;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACA,QAAM,WAAW,gBAAgB,OAAO,QAAQ,IAAI;AACpD,QAAM,OAAO,YAAY,OAAO,QAAQ,IAAI;AAC5C,QAAM,QAAQ,aAAa,OAAO,QAAQ,IAAI;AAC9C,QAAM,SAAS,cAAc,OAAO,QAAQ,MAAM,KAAK,SAAS;AAChE,QAAM,SAAS,cAAc,OAAO,QAAQ,IAAI;AAChD,QAAM,SAAS,cAAc,OAAO,QAAQ,IAAI;AAChD,QAAM,WAAW,gBAAgB,OAAO,QAAQ,IAAI;AACpD,QAAM,SAAgD;AAAA,IACrD,WAAW,KAAK;AAAA,IAChB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IACvD,MAAM,CAAC,SAAS,aACf,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN;AAAA,UACA,gBAAgB,UAAU;AAAA,UAC1B,WAAW,UAAU;AAAA,QACtB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,KAAK,CAAC,WAAW,YAChB,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN;AAAA,UACA,gBAAgB,SAAS;AAAA,UACzB,WAAW,SAAS;AAAA,QACrB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,MAAM,CAAC,WAAW,OAAO,aACxB,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA,gBAAgB,UAAU;AAAA,UAC1B,WAAW,UAAU;AAAA,QACtB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,OAAO,CAAC,QAAQ,cACf,QAAQ,KAAK;AAAA,MACZ,CAAC,QAAQ,EAAE,MAAM,SAAS,QAAQ,gBAAgB,WAAW,eAAe,CAAC;AAAA,IAC9E,CAAC;AAAA,EACH;AACA,uBAAqB,IAAI,QAA8C,EAAE,SAAS,CAAC,EAAE,CAAC;AACtF,uBAAqB,IAAI,QAA8C,WAAW;AAClF,uBAAqB,IAAI,QAA8C,EAAE,SAAS,CAAC,EAAE,CAAC;AACtF,SAAO;AACR;AAsCO,SAAS,oBACf,OACA,QACA,MAC4B;AAC5B,QAAM,OAAO,KAAK,QAAQ,GAAG,OAAO,SAAS;AAC7C,MAAI,CAAC,OAAO,SAAS,KAAK,SAAS,KAAK,KAAK,YAAY,GAAG;AAC3D,UAAM,IAAI,WAAW,qEAAqE;AAAA,EAC3F;AACA,QAAM,WAAW,MAAM,cAAc,EAAE,MAAM,GAAG,IAAI,uBAAuB,CAAC;AAC5E,QAAMC,UAAS,EAAE,SAAS,KAAK;AAC/B,QAAM,SAAS,SAAS,IAAI,8BAA8B,OAAO,QAAQ,MAAM,MAAMA,OAAM,CAAC;AAC5F,QAAM,WAAW,SAAS;AAAA,IACzB,MAAM,KAA+B,CAAC,MAAM,GAAG,8BAA8B,GAAG;AAAA,MAC/E,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,IACV,CAAC;AAAA,EACF;AACA,QAAM,SAAS,SAAS,IAAI,8BAA8B,OAAO,QAAQ,IAAI,CAAC;AAC9E,QAAM,SAAS,SAAS,IAAI,8BAA8B,OAAO,QAAQ,IAAI,CAAC;AAC9E,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AACT,UAAI,SAAU;AACd,MAAAA,QAAO,UAAU;AACjB,UAAI;AACH,iBAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,+BAA+B,CAAC;AAClE,mBAAW;AAAA,MACZ,SAAS,OAAO;AACf,QAAAA,QAAO,UAAU;AACjB,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,8BACR,OACA,QACA,MACA,MACAA,SACiC;AACjC,SAAO,MAAM;AAAA,IACZ,CAAC,KAAK,OAAO,OAAO,UAAU,OAAO,MAAM,OAAO,OAAO,OAAO,MAAM;AAAA,IACtE,CAAC,QAAQ;AACR,UAAI,QAAQ,IAAI,MAAM,IAAoB;AAC1C,UAAI,UAAU,QAAW;AACxB,gBAAQ,EAAE,SAAS,oBAAI,IAAI,EAAE;AAC7B,YAAI,MAAM,IAAI,KAAK;AAAA,MACpB;AACA,UAAI,UAAU;AACd,iBAAW,YAAY,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC9C,YAAI,CAAC,OAAO,SAAS,QAAQ,KAAM,WAAsB,GAAG;AAC3D,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO;AAAA,kBACN,MAAM;AAAA,kBACN,SAAS;AAAA,kBACT,OAAO;AAAA,gBACR;AAAA,gBACA,SAAS,MAAM,QAAQ;AAAA,gBACvB,OAAO,MAAM;AAAA,cACd;AAAA,YACD;AAAA,UACD,CAAC;AACD,oBAAU;AACV;AAAA,QACD;AACA,cAAMC,SAAQ;AACd,YAAI,MAAM,UAAU,UAAaA,SAAQ,MAAM,OAAO;AACrD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO;AAAA,kBACN,MAAM;AAAA,kBACN,SAAS;AAAA,kBACT,OAAAA;AAAA,gBACD;AAAA,gBACA,SAAS,MAAM,QAAQ;AAAA,gBACvB,OAAO,MAAM;AAAA,cACd;AAAA,YACD;AAAA,UACD,CAAC;AACD,oBAAU;AACV;AAAA,QACD;AACA,cAAM,QAAQA;AACd,kBAAU;AAAA,MACX;AACA,iBAAW,cAAc,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAChD,cAAM,UAAU;AAChB,cAAM,QAAQ,IAAI,QAAQ,KAAK;AAAA,UAC9B,KAAK,QAAQ;AAAA,UACb,SAAS,QAAQ;AAAA,UACjB,cAAc,MAAM;AAAA,QACrB,CAAC;AACD,kBAAU;AAAA,MACX;AACA,iBAAW,UAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC5C,cAAM,QAAQ,OAAQ,OAA0C,SAAS;AACzE,kBAAU;AAAA,MACX;AACA,iBAAW,WAAW,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC7C,cAAM,QAAQ,OAAQ,QAA2C,SAAS;AAC1E,kBAAU;AAAA,MACX;AACA,iBAAW,aAAa,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC/C,cAAM,SAAS;AAMf,YAAI,OAAO,YAAY,EAAG,OAAM,QAAQ,MAAM;AAAA,iBACrC,OAAO,UAAU,eAAe,OAAO,YAAY,QAAW;AACtE,gBAAM,QAAQ,OAAO,OAAO,OAAO;AAAA,QACpC,WACC,OAAO,UAAU,aACjB,OAAO,YAAY,UACnB,OAAO,gBAAgB,QACtB;AACD,gBAAM,UAAU,MAAM,QAAQ,IAAI,OAAO,OAAO;AAChD,cACC,SAAS,iBAAiB,UAC1B,QAAQ,yBAAyB,QAAQ,SACxC;AACD,oBAAQ,eAAe,QAAQ,eAAe,OAAO;AAAA,UACtD;AAAA,QACD;AACA,kBAAU;AAAA,MACX;AACA,YAAM,QAAQ,MAAM;AACpB,UAAI,iBAAiB;AACrB,UAAID,QAAO,WAAW,UAAU,QAAW;AAC1C,mBAAW,WAAW,MAAM,QAAQ,OAAO,GAAG;AAC7C,cAAI,QAAQ,iBAAiB,QAAW;AACvC,oBAAQ,eAAe;AACvB,sBAAU;AAAA,UACX;AACA,cACC,QAAQ,iBAAiB,UACzB,QAAQ,QAAQ,gBAAgB,KAAK,aACrC,QAAQ,oBAAoB,QAAQ,SACnC;AACD,kBAAM,UAAuC;AAAA,cAC5C,MAAM;AAAA,cACN,KAAK,QAAQ;AAAA,cACb,SAAS,QAAQ;AAAA,cACjB,cAAc;AAAA,YACf;AACA,oBAAQ,kBAAkB,QAAQ;AAClC,oBAAQ,eAAe;AACvB,gBAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,SAAS,SAAS,MAAM,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC;AACrF,6BAAiB;AACjB,sBAAU;AAAA,UACX,WACC,QAAQ,iBAAiB,UACzB,SAAS,QAAQ,gBACjB,QAAQ,yBAAyB,QAAQ,SACxC;AACD,kBAAM,UAAuC;AAAA,cAC5C,MAAM;AAAA,cACN,KAAK,QAAQ;AAAA,cACb,SAAS,QAAQ;AAAA,cACjB,cAAc;AAAA,YACf;AACA,oBAAQ,uBAAuB,QAAQ;AACvC,gBAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,SAAS,SAAS,MAAM,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC;AACrF,6BAAiB;AACjB,sBAAU;AAAA,UACX;AAAA,QACD;AAAA,MACD;AACA,UAAI,WAAW,CAAC,gBAAgB;AAC/B,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,SAAS,MAAM,QAAQ,MAAM,MAAM,CAAC,CAAC,CAAC;AAAA,MAC3E;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACD;AAEA,SAAS,gCAAoD;AAC5D,SAAO,CAAC,QAAQ;AACf,eAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,YAAM,QAAQ;AACd,UAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,IACjE;AAAA,EACD;AACD;AAEA,SAAS,8BACR,OACA,QACA,MACiC;AACjC,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MAC7D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,4BAA4B;AAAA,EAChE;AACD;AAEA,SAAS,8BACR,OACA,QACA,MACkC;AAClC,SAAO,MAAM;AAAA,IACZ,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,OACH,IAAI,MAAM,IAA+B,KACxC;AAAA,QACA,OAAO;AAAA,QACP,SAAS;AAAA,QACT,UAAU;AAAA,QACV,QAAQ;AAAA,MACT;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAW;AAC7B,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,UAAU,KAAK,WAAW;AAAA,YAC1B,OAAO,MAAM;AAAA,YACb,aAAa,MAAM;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,QAAQ,KAAK,SAAS;AAAA,YACtB,OAAO,MAAM;AAAA,YACb,WAAW,MAAM;AAAA,UAClB;AAAA,QACD,OAAO;AACN,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO,MAAM,UAAU,IAAI,WAAW;AAAA,YACtC,SAAS,MAAM;AAAA,YACf,OAAO,MAAM;AAAA,UACd;AAAA,QACD;AAAA,MACD;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,4BAA4B;AAAA,EAChE;AACD;AAuCO,SAAS,mBACf,OACA,QACA,OAAkC,CAAC,GACR;AAC3B,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,MAAM,cAAc,EAAE,MAAM,GAAG,IAAI,sBAAsB,CAAC;AAC3E,QAAM,eAAe,SAAS,KAAiB,CAAC,GAAG,MAAM;AAAA,IACxD,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,EACV,CAAC;AACD,QAAM,iBAAiB,SAAS;AAAA,IAC/B,CAAC,YAAY;AAAA,IACb,CAAC,QAAQ;AACR,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,cAAM,SAAS,gCAAgC,OAAqB,OAAO,SAAS;AACpF,YAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,MAC5B;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,kBAAkB,SAAS;AAAA,IAChC,CAAC,OAAO,QAAQ;AAAA,IAChB,CAAC,QAAQ;AACR,iBAAW,YAAY,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC9C,YAAI;AACJ,YAAI;AACH,gBAAM,YAAY;AAAA,YACjB;AAAA,UACD;AACA,mBAAS,EAAE,MAAM,WAAW,OAAO,kCAAkC,SAAS,EAAE;AAAA,QACjF,SAAS,OAAO;AACf,gBAAME,SAAQ,cAAc,YAAY,UAAU,KAAK;AACvD,mBAAS,EAAE,MAAM,SAAS,OAAAA,OAAM;AAAA,QACjC;AACA,YAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,MAC5B;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,gBAAgB,SAAS;AAAA,IAC9B,CAAC,cAAc;AAAA,IACf,CAAC,QAAQ;AACR,iBAAW,UAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC5C,YAAI,KAAK;AAAA,UACR,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAkD,CAAC;AAAA,QAChF,CAAC;AAAA,MACF;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,iBAAiB,SAAS;AAAA,IAC/B,CAAC,eAAe;AAAA,IAChB,CAAC,QAAQ;AACR,iBAAW,UAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC5C,YAAI,KAAK;AAAA,UACR,CAAC,QAAQ,EAAE,MAAM,YAAY,OAAmD,CAAC;AAAA,QAClF,CAAC;AAAA,MACF;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,iBAAiB,SAAS;AAAA,IAG/B,CAAC,aAAa;AAAA,IACd,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,cAAM,SAAS,MAAM;AACrB,YAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,SAAS,YAAY,OAAO,WAAW,OAAO,OAAO,CAAC,CAAC;AAAA,MAClF;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,gBAAgB,SAAS;AAAA,IAC9B,CAAC,cAAc;AAAA,IACf,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,OAAO,SAAS,WAAW;AACpC,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,KAAK,CAAC,CAAC;AAAA,QACxC;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,SAAS,SAAS;AAAA,IACvB,CAAC,eAAe,cAAc;AAAA,IAC9B,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,cAAM,SAAS,MAAM;AACrB,YAAI,OAAO,SAAS,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,KAAK,CAAC,CAAC;AAAA,MAC/D;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,cAAM,SAAS,MAAM;AACrB,YAAI,OAAO,SAAS,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,KAAK,CAAC,CAAC;AAAA,MAC/D;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,SAAS,SAAS;AAAA,IACvB,CAAC,eAAe,cAAc;AAAA,IAC9B,CAAC,QAAQ;AACR,UAAIC,UACH,IAAI,MAAM,IAA8B,KACvC,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,GAAG,OAAO,OAAO;AACrD,YAAM,aAAa,CAAC,SAAmC;AACtD,QAAAA,UAAS;AACT,YAAI,MAAM,IAAIA,OAAM;AACpB,YAAI,KAAK,CAAC,CAAC,QAAQA,OAAM,CAAC,CAAC;AAAA,MAC5B;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,cAAM,SAAS,MAAM;AACrB,YAAI,OAAO,SAAS,WAAW;AAC9B,qBAAW;AAAA,YACV,GAAGA;AAAA,YACH,SAASA,QAAO,UAAU;AAAA,YAC1B,OAAOA,QAAO,SAAS,IAAI,WAAW;AAAA,UACvC,CAAC;AAAA,QACF,OAAO;AACN,qBAAW;AAAA,YACV,GAAGA;AAAA,YACH,QAAQA,QAAO,SAAS;AAAA,YACxB,OAAO;AAAA,YACP,WAAW,OAAO;AAAA,UACnB,CAAC;AAAA,QACF;AAAA,MACD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,cAAM,SAAS,MAAM;AACrB,YAAI,OAAO,SAAS,WAAW;AAC9B,qBAAW;AAAA,YACV,GAAGA;AAAA,YACH,SAASA,QAAO,UAAU;AAAA,YAC1B,OAAOA,QAAO,SAAS,IAAI,WAAW;AAAA,UACvC,CAAC;AAAA,QACF,OAAO;AACN,qBAAW;AAAA,YACV,GAAGA;AAAA,YACH,QAAQA,QAAO,SAAS;AAAA,YACxB,OAAO;AAAA,YACP,WAAW,OAAO;AAAA,UACnB,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,MAAI;AACH,kCAA8B,QAAQ,cAAc;AAAA,EACrD,SAAS,OAAO;AACf,aAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,mCAAmC,CAAC;AACtE,UAAM;AAAA,EACP;AACA,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AACT,UAAI,SAAU;AACd,oCAA8B,QAAQ,cAAc;AACpD,UAAI;AACH,iBAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,8BAA8B,CAAC;AACjE,mBAAW;AAAA,MACZ,SAAS,OAAO;AACf,sCAA8B,QAAQ,cAAc;AACpD,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACD;AAEO,SAAS,uBACf,WACA,QACwD;AACxD,MAAI,UAAU,WAAW,GAAG;AAC3B,UAAM,IAAI,WAAW,qDAAqD;AAAA,EAC3E;AACA,MAAI,OAAO,WAAW,YAAY;AACjC,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACxE;AACA,SAAO,EAAE,WAAW,OAAO;AAC5B;AAGO,SAAS,gBACf,OACA,QACA,OAAoD,CAAC,GACR;AAC7C,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,WAAW,wBAAwB,KAAK,YAAY,CAAC,CAAC;AAC5D,QAAM,WAAW,MAAM,cAAc,EAAE,MAAM,GAAG,IAAI,mBAAmB,CAAC;AACxE,QAAM,SAAS,SAAS;AAAA,IACvB;AAAA,MACC;AAAA,MACA,wBAAwB,MAAM;AAAA,MAC9B;AAAA,MACA,OAAO;AAAA,MACP;AAAA,MACA,KAAK,kBAAkB;AAAA,IACxB;AAAA,EACD;AACA,QAAM,mBAAmB,SAAS,IAAI,oCAAoC,OAAO,QAAQ,IAAI,CAAC;AAC9F,QAAM,WAAW,SAAS,IAAI,4BAA4B,OAAO,QAAQ,IAAI,CAAC;AAC9E,QAAM,SAAS,SAAS,IAAI,0BAA0B,OAAO,QAAQ,IAAI,CAAC;AAC1E,QAAM,SAAS,SAAS,IAAI,0BAA0B,OAAO,QAAQ,IAAI,CAAC;AAC1E,MAAI;AACH,kCAA8B,QAAQ,gBAAgB;AAAA,EACvD,SAAS,OAAO;AACf,aAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,gCAAgC,CAAC;AACnE,UAAM;AAAA,EACP;AACA,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AACT,UAAI,SAAU;AACd,oCAA8B,QAAQ,gBAAgB;AACtD,UAAI;AACH,iBAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,2BAA2B,CAAC;AAC9D,mBAAW;AAAA,MACZ,SAAS,OAAO;AACf,sCAA8B,QAAQ,gBAAgB;AACtD,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,qBACR,OACA,SACA,SACA,MACA,MACA,QAC6C;AAC7C,QAAM,MAAM,KAAK,OAAO,KAAK;AAC7B,SAAO,MAAM;AAAA,IACZ,CAAC,SAAS,OAAO;AAAA,IACjB,CAAC,QAAQ;AACR,YAAM,QAAQ,gBAA2B,GAAG;AAE5C,YAAMC,gBAAe,CACpB,MACA,SACA,cAAmF,CAAC,GACpF,eACI;AACJ,YAAI,CAAC,sBAAsB,MAAM,OAAO,GAAG;AAC1C,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,GAAG,KAAK,SAAS;AAAA,cACzB;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM,MAAM,MAAM;AAClB,YAAI;AACJ,YAAI;AACH,gBAAM,oBAAoB;AAAA,YACzB;AAAA,YACA,wBAAwB,IAAI;AAAA,UAC7B;AACA,qBAAW,mBAA8B;AAAA,YACxC,WAAW,KAAK;AAAA,YAChB;AAAA,YACA;AAAA,YACA,QAAQ,MAAM;AAAA,YACd,SAAS;AAAA,YACT,gBAAgB,YAAY;AAAA,YAC5B,SAAS;AAAA,YACT,aAAa,OAAO;AAAA,YACpB,aAAa,IAAI;AAAA,YACjB,WAAW,YAAY;AAAA,YACvB,WAAW,YAAY;AAAA,UACxB,CAAC;AAAA,QACF,SAAS,OAAO;AACf,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,cAC7D;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM;AACN,qBAAa;AACb,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,SAAS,CAAC,CAAC,CAAC;AACnD,YAAI,eAAe,IAAI,EAAG,OAAM,QAAQ,IAAI,SAAS,SAAS,KAAK,EAAE,SAAS,CAAC;AAAA,MAChF;AAEA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,uBAAe,KAAK,OAAO,KAAK,KAAK,SAAS;AAAA,MAC/C;AACA,YAAM,kBAAkB,IAAI,SAAS,CAAC;AACtC,UAAI,oBAAoB,SAAS,oBAAoB,UAAa,CAAC,MAAM,kBAAkB;AAC1F,cAAM,mBAAmB;AACzB,cAAM,QACL,oBAAoB,OACjB,GAAG,KAAK,SAAS,uGACjB,GAAG,KAAK,SAAS,4BAA4B;AAAA,UAC7C,aAAa,eAAe;AAAA,QAC7B,CAAC;AACJ,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,MAAM,CAAC,CAAC,CAAC;AAAA,MAChD;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,UAAU,gBAAgB,GAAG;AACnC,YAAI,YAAY,QAAW;AAC1B,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,QAAQ,CAAC,CAAC,CAAC;AACxD;AAAA,QACD;AACA,cAAM,eAAe;AACrB,gBAAQ,aAAa,MAAM;AAAA,UAC1B,KAAK;AACJ,YAAAA,cAAa,SAAS,QAAW,YAAY;AAC7C;AAAA,UACD,KAAK;AACJ,YAAAA,cAAa,QAAQ,EAAE,MAAM,QAAQ,OAAO,aAAa,QAAQ,GAAG,YAAY;AAChF;AAAA,UACD,KAAK;AACJ,YAAAA,cAAa,OAAO,QAAW;AAAA,cAC9B,gBAAgB,aAAa;AAAA,cAC7B,WAAW,aAAa;AAAA,cACxB,WAAW,aAAa;AAAA,YACzB,CAAC;AACD;AAAA,UACD,KAAK;AACJ,YAAAA;AAAA,cACC;AAAA,cACA,EAAE,MAAM,SAAS,OAAO,aAAa,aAAa,KAAK,EAAE;AAAA,cACzD;AAAA,gBACC,gBAAgB,aAAa;AAAA,gBAC7B,WAAW,aAAa;AAAA,gBACxB,WAAW,aAAa;AAAA,cACzB;AAAA,YACD;AACA;AAAA,UACD,KAAK;AACJ,qCAAyB,KAAK,OAAO,cAAc,MAAM,QAAQ,GAAG;AACpE;AAAA,UACD,KAAK;AACJ,YAAAA;AAAA,cACC;AAAA,cACA,aAAa,WAAW,SACrB,EAAE,MAAM,QAAQ,IAChB,EAAE,MAAM,SAAS,QAAQ,aAAa,OAAO;AAAA,cAChD;AAAA,cACA,MAAM;AACL,sBAAM,QAAQ,MAAM;AAAA,cACrB;AAAA,YACD;AACA;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,oBAAoB;AAAA,MACpB,0BAA0B;AAAA,MAC1B,qBAAqB;AAAA,IACtB;AAAA,EACD;AACD;AAEA,SAAS,gBAA0B,KAAiC;AACnE,MAAI,QAAQ,IAAI,MAAM,IAA2B;AACjD,MAAI,UAAU,QAAW;AACxB,YAAQ;AAAA,MACP,kBAAkB;AAAA,MAClB,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,kBAAkB;AAAA,MAClB,SAAS,oBAAI,IAAI;AAAA,IAClB;AACA,QAAI,MAAM,IAAI,KAAK;AAAA,EACpB;AACA,MAAI,CAAC,MAAM,kBAAkB;AAC5B,UAAM,mBAAmB;AACzB,QAAI,eAAe,MAAM;AACxB,YAAM,mBAAmB;AACzB,YAAM,QAAQ,MAAM;AAAA,IACrB,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,8BACR,QACAC,SACO;AACP,QAAM,WAAW,qBAAqB,IAAI,MAA4C;AACtF,MAAI,aAAa,QAAW;AAC3B,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AACA,QAAM,UAAU,SAAS;AACzB,QAAM,kBAAkB,CAAC,GAAG,OAAO;AACnC,MAAI,CAAC,QAAQ,SAASA,OAAM,EAAG,SAAQ,KAAKA,OAAM;AAClD,MAAI;AACH,WAAO,QAAQ,YAAY,CAAC,GAAG,OAAO,GAAG,0BAA0B,QAAQ,MAAM,CAAC;AAAA,EACnF,SAAS,OAAO;AACf,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,eAAe;AACpD,WAAO,QAAQ;AAAA,MACd,CAAC,GAAG,eAAe;AAAA,MACnB,0BAA0B,gBAAgB,MAAM;AAAA,IACjD;AACA,UAAM;AAAA,EACP;AACD;AAEA,SAAS,8BACR,QACAA,SACO;AACP,QAAM,WAAW,qBAAqB,IAAI,MAA4C;AACtF,MAAI,aAAa,QAAW;AAC3B,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AACA,QAAM,UAAU,SAAS;AACzB,MAAI,CAAC,QAAQ,SAASA,OAAM,EAAG;AAC/B,QAAM,kBAAkB,CAAC,GAAG,OAAO;AACnC,QAAM,cAAc,QAAQ,OAAO,CAAC,cAAc,cAAcA,OAAM;AACtE,UAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,WAAW;AAChD,MAAI;AACH,WAAO,QAAQ,YAAY,CAAC,GAAG,WAAW,GAAG,0BAA0B,YAAY,MAAM,CAAC;AAAA,EAC3F,SAAS,OAAO;AACf,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,eAAe;AACpD,WAAO,QAAQ;AAAA,MACd,CAAC,GAAG,eAAe;AAAA,MACnB,0BAA0B,gBAAgB,MAAM;AAAA,IACjD;AACA,UAAM;AAAA,EACP;AACD;AAEA,SAAS,8BACR,QACAA,SACO;AACP,QAAM,WAAW,qBAAqB,IAAI,MAA4C;AACtF,MAAI,aAAa,QAAW;AAC3B,UAAM,IAAI,MAAM,4DAA4D;AAAA,EAC7E;AACA,QAAM,UAAU,SAAS;AAGzB,QAAM,kBAAkB,CAAC,GAAG,OAAO;AACnC,MAAI,CAAC,QAAQ,SAASA,OAAM,EAAG,SAAQ,KAAKA,OAAM;AAClD,MAAI;AACH,4BAAwB,MAAM,EAAE;AAAA,MAC/B,CAAC,GAAG,OAAO;AAAA,MACX,0BAA0B,QAAQ,MAAM;AAAA,IACzC;AAAA,EACD,SAAS,OAAO;AACf,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,eAAe;AACpD,4BAAwB,MAAM,EAAE;AAAA,MAC/B,CAAC,GAAG,eAAe;AAAA,MACnB,0BAA0B,gBAAgB,MAAM;AAAA,IACjD;AACA,UAAM;AAAA,EACP;AACD;AAEA,SAAS,8BACR,QACAA,SACO;AACP,QAAM,WAAW,qBAAqB,IAAI,MAA4C;AACtF,MAAI,aAAa,QAAW;AAC3B,UAAM,IAAI,MAAM,4DAA4D;AAAA,EAC7E;AACA,QAAM,UAAU,SAAS;AAGzB,MAAI,CAAC,QAAQ,SAASA,OAAM,EAAG;AAC/B,QAAM,kBAAkB,CAAC,GAAG,OAAO;AACnC,QAAM,cAAc,QAAQ,OAAO,CAAC,cAAc,cAAcA,OAAM;AACtE,UAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,WAAW;AAChD,MAAI;AACH,4BAAwB,MAAM,EAAE;AAAA,MAC/B,CAAC,GAAG,WAAW;AAAA,MACf,0BAA0B,YAAY,MAAM;AAAA,IAC7C;AAAA,EACD,SAAS,OAAO;AACf,YAAQ,OAAO,GAAG,QAAQ,QAAQ,GAAG,eAAe;AACpD,4BAAwB,MAAM,EAAE;AAAA,MAC/B,CAAC,GAAG,eAAe;AAAA,MACnB,0BAA0B,gBAAgB,MAAM;AAAA,IACjD;AACA,UAAM;AAAA,EACP;AACD;AAEA,SAAS,wBACR,QACgE;AAChE,QAAM,SAAS,qBAAqB,IAAI,MAA4C;AACpF,MAAI,WAAW,QAAW;AACzB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AACA,SAAO;AACR;AAEA,SAAS,0BAAqC,aAAyC;AACtF,SAAO,CAAC,QAAQ;AACf,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK,GAAG;AACxC,iBAAW,WAAW,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC7C,YAAI,KAAK,CAAC,CAAC,QAAQ,OAAuC,CAAC,CAAC;AAAA,MAC7D;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,0BAAoC,aAAyC;AACrF,SAAO,CAAC,QAAQ;AACf,aAAS,IAAI,GAAG,IAAI,aAAa,KAAK,GAAG;AACxC,iBAAW,YAAY,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC9C,YAAI,KAAK,CAAC,CAAC,QAAQ,QAAmE,CAAC,CAAC;AAAA,MACzF;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,gCACR,OACA,WACkC;AAClC,MAAI;AACH,UAAM,WAAW,8BAA8B,kCAAkC,KAAK,CAAC;AACvF,WAAO,EAAE,MAAM,WAAW,SAAS;AAAA,EACpC,SAAS,OAAO;AACf,UAAMH,SAAQ,cAAc,WAAW,UAAU,KAAK;AACtD,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAAA;AAAA,MACA,SAAS,eAAe,GAAG,SAAS,KAAKA,OAAM,OAAO,EAAE;AAAA,IACzD;AAAA,EACD;AACD;AAEA,SAAS,8BACR,UAC6C;AAC7C,QAAM,WAAW,8BAA8B,SAAS,QAAQ;AAChE,UAAQ,SAAS,QAAQ,MAAM;AAAA,IAC9B,KAAK;AACJ,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,IACF,KAAK;AACJ,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,QACpB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,IACF,KAAK;AACJ,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,SAAS,EAAE,MAAM,QAAQ,OAAO,SAAS,QAAQ,KAAK;AAAA,QACtD,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,IACF,KAAK;AACJ,UAAI,SAAS,QAAQ,UAAU,QAAW;AACzC,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,SAAS,EAAE,MAAM,SAAS,OAAO,SAAS,QAAQ,MAAM;AAAA,QACxD,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,QACpB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,IACF,KAAK;AACJ,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,SAAS,EAAE,MAAM,UAAU,QAAQ,SAAS,QAAQ,OAAO;AAAA,QAC3D,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,IACF,KAAK;AACJ,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,SAAS,EAAE,MAAM,SAAS,OAAO,SAAS,QAAQ,MAAM;AAAA,QACxD,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,IACF,KAAK;AACJ,aAAO,mBAAmB;AAAA,QACzB,WAAW,SAAS;AAAA,QACpB,MAAM;AAAA,QACN,KAAK,SAAS;AAAA,QACd,QAAQ,SAAS;AAAA,QACjB,SACC,SAAS,QAAQ,WAAW,SACzB,EAAE,MAAM,QAAQ,IAChB,EAAE,MAAM,SAAS,QAAQ,SAAS,QAAQ,OAAO;AAAA,QACrD,gBAAgB,SAAS;AAAA,QACzB,SAAS,SAAS;AAAA,QAClB,aAAa,SAAS;AAAA,QACtB,aAAa,SAAS;AAAA,QACtB,WAAW,SAAS;AAAA,MACrB,CAAC;AAAA,EACH;AACD;AAEA,SAAS,8BACR,UAC8B;AAC9B,SAAO;AAAA,IACN,WAAW,SAAS;AAAA,IACpB,UAAU;AAAA,MACT,KAAK,OAAO,SAAS,SAAS,GAAG;AAAA,MACjC,QAAQ,OAAO,SAAS,SAAS,MAAM;AAAA,MACvC,gBAAgB,SAAS,SAAS;AAAA,MAClC,SAAS,SAAS,SAAS;AAAA,MAC3B,aAAa,SAAS,SAAS;AAAA,MAC/B,aACC,SAAS,SAAS,gBAAgB,SAC/B,SACA,OAAO,SAAS,SAAS,WAAW;AAAA,MACxC,WACC,SAAS,SAAS,cAAc,SAAY,SAAY,OAAO,SAAS,SAAS,SAAS;AAAA,MAC3F,WAAW,SAAS,SAAS;AAAA,IAC9B;AAAA,IACA,SAAS,6BAA6B,QAAQ;AAAA,EAC/C;AACD;AAEA,SAAS,6BACR,UAC6B;AAC7B,QAAM,UAAU,SAAS;AACzB,UAAQ,SAAS,MAAM;AAAA,IACtB,KAAK;AACJ,aAAO,EAAE,MAAM,QAAQ;AAAA,IACxB,KAAK;AACJ,aAAO,EAAE,MAAM,MAAM;AAAA,IACtB,KAAK;AACJ,UAAI,SAAS,SAAS,QAAQ;AAC7B,cAAM,IAAI,uBAAuB,oBAAoB,qCAAqC;AAAA,MAC3F;AACA,aAAO,EAAE,MAAM,QAAQ,MAAM,kBAAkB,QAAQ,KAAK,EAAE;AAAA,IAC/D,KAAK;AACJ,UAAI,SAAS,SAAS,SAAS;AAC9B,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA,aAAO,EAAE,MAAM,QAAQ,OAAO,cAAc,QAAQ,OAAO,YAAY,EAAE;AAAA,IAC1E,KAAK;AACJ,UAAI,SAAS,SAAS,UAAU;AAC/B,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA,aAAO,EAAE,MAAM,UAAU,QAAQ,cAAc,QAAQ,QAAQ,QAAQ,EAAE;AAAA,IAC1E,KAAK;AACJ,UAAI,SAAS,SAAS,SAAS;AAC9B,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA,aAAO,EAAE,MAAM,SAAS,OAAO,cAAc,QAAQ,OAAO,OAAO,EAAE;AAAA,IACtE,KAAK;AACJ,UAAI,SAAS,SAAS,SAAS;AAC9B,cAAM,IAAI;AAAA,UACT;AAAA,UACA;AAAA,QACD;AAAA,MACD;AACA,aAAO,EAAE,MAAM,SAAS,QAAQ,cAAc,QAAQ,QAAQ,cAAc,EAAE;AAAA,EAChF;AACD;AAEA,SAAS,kBAAkB,OAA6C;AACvE,MAAI,iBAAiB,WAAY,QAAO,EAAE,MAAM,SAAS,MAAM;AAC/D,MACC,OAAO,UAAU,YACjB,UAAU,QACT,MAAsC,SAAS,SAC/C;AACD,UAAM,QAAS,MAAuC;AACtD,QAAI,iBAAiB,WAAY,QAAO,EAAE,MAAM,SAAS,OAAO,MAAM;AAAA,EACvE;AACA,MACC,OAAO,UAAU,YACjB,UAAU,QACT,MAAsC,SAAS,aAC/C;AACD,UAAM,QAAS,MAAuC;AACtD,WAAO,EAAE,MAAM,aAAa,MAAuC;AAAA,EACpE;AACA,QAAM,IAAI;AAAA,IACT;AAAA,IACA;AAAA,EACD;AACD;AAEA,SAAS,8BAA8B,UAA2D;AACjG,SAAO;AAAA,IACN,KAAK,mBAAmB,SAAS,KAAK,KAAK;AAAA,IAC3C,QAAQ,mBAAmB,SAAS,QAAQ,QAAQ;AAAA,IACpD,gBAAgB,SAAS;AAAA,IACzB,SAAS,SAAS;AAAA,IAClB,aAAa,SAAS;AAAA,IACtB,aACC,SAAS,gBAAgB,SACtB,SACA,mBAAmB,SAAS,aAAa,cAAc;AAAA,IAC3D,WACC,SAAS,cAAc,SACpB,SACA,mBAAmB,SAAS,WAAW,aAAa;AAAA,IACxD,WAAW,SAAS;AAAA,EACrB;AACD;AAEA,SAAS,mBAAmB,OAAe,OAAuB;AACjE,MAAI,QAAQ,OAAO,OAAO,gBAAgB,GAAG;AAC5C,UAAM,IAAI;AAAA,MACT;AAAA,MACA,GAAG,KAAK;AAAA,IACT;AAAA,EACD;AACA,SAAO,OAAO,KAAK;AACpB;AAEA,SAAS,cAAc,OAAgB,OAA2B;AACjE,MAAI,iBAAiB,WAAY,QAAO;AACxC,QAAM,IAAI,uBAAuB,aAAa,sBAAsB,KAAK,qBAAqB;AAC/F;AAEA,SAAS,cAAc,OAAgB,OAAuC;AAC7E,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,iBAAiB,WAAY,QAAO;AACxC,QAAM,IAAI,uBAAuB,aAAa,sBAAsB,KAAK,qBAAqB;AAC/F;AAEA,SAAS,cACR,WACA,WACA,OAC0B;AAC1B,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,IAC9D,UAAU,iBAAiB,yBAAyB,MAAM,WAAW;AAAA,EACtE;AACD;AAEA,SAAS,yBACR,KACA,OACA,SACA,MACA,QACA,KACO;AACP,QAAM,UAAU,MAAM,QAAQ,IAAI,QAAQ,GAAG;AAC7C,MAAI,YAAY,UAAa,QAAQ,SAAS,SAAS,YAAY,QAAQ,QAAS;AACpF,QAAM,UAAU,QAAQ;AACxB,QAAM,oBAAoB,MAAM;AAC/B,UAAMI,WAAU,QAAQ,SAAS,UAAU;AAC3C,UAAM,QAAQ,mBAA6B;AAAA,MAC1C,WAAW,QAAQ;AAAA,MACnB,MAAM,QAAQ;AAAA,MACd,KAAK,QAAQ,SAAS;AAAA,MACtB,QAAQ,MAAM;AAAA,MACd,SAAS,QAAQ;AAAA,MACjB,gBAAgB,QAAQ,SAAS;AAAA,MACjC,SAAAA;AAAA,MACA,aAAa,OAAO;AAAA,MACpB,aAAa,IAAI;AAAA,MACjB,WAAW,QAAQ,SAAS;AAAA,IAC7B,CAAC;AACD,YAAQ,WAAW;AACnB,YAAQ,yBAAyB;AACjC,YAAQ,eAAe;AACvB,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,UAAU,MAAM,CAAC,CAAC,CAAC;AAAA,EAC3D;AACA,MAAI,QAAQ,2BAA2B,QAAQ,SAAS,SAAS;AAChE,QACC,QAAQ,iBAAiB,UACzB,QAAQ,iBAAiB,UACzB,QAAQ,eAAe,QAAQ,cAC9B;AACD;AAAA,IACD;AACA,sBAAkB;AAClB;AAAA,EACD;AACA,MAAI,KAAK;AAAA,IACR;AAAA,MACC;AAAA,MACA;AAAA,QACC,MAAM;AAAA,QACN,KAAK,QAAQ,SAAS;AAAA,QACtB,SAAS,QAAQ,SAAS;AAAA,MAC3B;AAAA,IACD;AAAA,EACD,CAAC;AACD,MAAI,CAAC,YAAY,QAAQ,QAAQ,SAAS,OAAO,GAAG;AACnD,UAAMC,SAAQ,GAAG,KAAK,SAAS,yBAAyB,QAAQ,SAAS,GAAG;AAC5E,UAAM,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACzC,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,KAAK,QAAQ,SAAS;AAAA,UACtB,SAAS,QAAQ,SAAS;AAAA,UAC1B,OAAAA;AAAA,QACD;AAAA,MACD;AAAA,IACD,CAAC;AACD;AAAA,EACD;AACA,QAAM,UAAU,QAAQ,SAAS,UAAU;AAC3C,QAAM,UAAU,iBAAiB,QAAQ,OAAO,KAAK;AACrD,QAAM,QAAQ,GAAG,KAAK,SAAS,yBAAyB,QAAQ,SAAS,GAAG;AAC5E,UAAQ,yBAAyB,QAAQ,SAAS;AAClD,MAAI,UAAU,KAAK,QAAQ,iBAAiB,QAAW;AACtD,YAAQ,eAAe,QAAQ,eAAe;AAAA,EAC/C;AACA,MAAI,KAAK;AAAA,IACR;AAAA,MACC;AAAA,MACA;AAAA,QACC,MAAM;AAAA,QACN,KAAK,QAAQ,SAAS;AAAA,QACtB;AAAA,QACA;AAAA,QACA;AAAA,MACD;AAAA,IACD;AAAA,EACD,CAAC;AACD,MAAI,QAAQ,iBAAiB,OAAW;AACxC,oBAAkB;AACnB;AAEA,SAAS,eACR,KACA,OACA,OACA,WACO;AACP,MAAI,iBAAiB,KAAK,GAAG;AAC5B,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC;AAC5D;AAAA,EACD;AACA,QAAM,UAAU,wBAAwB,KAAK;AAC7C,MAAI,YAAY,QAAW;AAC1B,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,QAAQ,CAAC,CAAC,CAAC;AACxD;AAAA,EACD;AACA,QAAM,WAAW;AACjB,MAAI,SAAS,cAAc,WAAW;AACrC,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,UAAU;AAAA,UACV,QAAQ,SAAS;AAAA,QAClB;AAAA,MACD;AAAA,IACD,CAAC;AACD;AAAA,EACD;AACA,QAAM,MAAM,SAAS,SAAS;AAC9B,QAAM,WAAW,MAAM,SAAS;AAChC,MAAI,OAAO,MAAM,QAAQ;AACxB,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,aAAa,KAAK,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC;AACrE;AAAA,EACD;AACA,MAAI,MAAM,UAAU;AACnB,QAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,gBAAgB,KAAK,SAAS,CAAC,CAAC,CAAC;AAC5D;AAAA,EACD;AACA,MAAI,SAAS,SAAS,SAAS,MAAM,cAAc;AAClD,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,OAAO,GAAG,SAAS,oBAAoB,SAAS,SAAS,MAAM,oBAAoB,MAAM,YAAY;AAAA,QACtG;AAAA,MACD;AAAA,IACD,CAAC;AACD;AAAA,EACD;AACA,QAAM,eAAe,SAAS,SAAS;AACvC,QAAM,SAAS;AACf,MAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC;AAC7D,MAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,WAAW,SAAS,CAAC,CAAC,CAAC;AAClD,MAAI,SAAS,SAAS,SAAS,SAAS,SAAS,cAAc,QAAW;AACzE,UAAM,UAAU,MAAM,QAAQ,IAAI,SAAS,SAAS,SAAS;AAC7D,QAAI,YAAY,QAAW;AAC1B,UAAI,KAAK;AAAA,QACR,CAAC,QAAQ,EAAE,MAAM,gBAAgB,SAAS,OAAO,WAAW,SAAS,SAAS,UAAU,CAAC;AAAA,MAC1F,CAAC;AACD;AAAA,IACD;AACA,UAAM,QAAQ,OAAO,SAAS,SAAS,SAAS;AAChD,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,WAAW,SAAS,SAAS;AAAA,UAC7B;AAAA,UACA,UAAU,QAAQ;AAAA,QACnB;AAAA,MACD;AAAA,IACD,CAAC;AAAA,EACF,WAAW,SAAS,SAAS,UAAU,SAAS,SAAS,cAAc,QAAW;AACjF,UAAM,UAAU,MAAM,QAAQ,IAAI,SAAS,SAAS,SAAS;AAC7D,QAAI,YAAY,QAAW;AAC1B,UAAI,KAAK;AAAA,QACR,CAAC,QAAQ,EAAE,MAAM,gBAAgB,SAAS,QAAQ,WAAW,SAAS,SAAS,UAAU,CAAC;AAAA,MAC3F,CAAC;AACD;AAAA,IACD;AACA,UAAM,QAAQ,OAAO,SAAS,SAAS,SAAS;AAChD,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,WAAW,SAAS,SAAS;AAAA,UAC7B;AAAA,UACA,UAAU,QAAQ;AAAA,UAClB,OAAO,mBAAmB,SAAS,SAAS,aAAa;AAAA,QAC1D;AAAA,MACD;AAAA,IACD,CAAC;AAAA,EACF;AACD;;;ACznDA,IAAM,wCAAwC;AAE9C,IAAM,kBAAN,MAAsB;AAAA,EACJ,OAAO,oBAAI,IAAY;AAAA,EACvB,QAAkB,CAAC;AAAA,EAEpC,IAAI,SAA0B;AAC7B,WAAO,KAAK,KAAK,IAAI,OAAO;AAAA,EAC7B;AAAA,EAEA,IAAI,SAAuB;AAC1B,QAAI,KAAK,KAAK,IAAI,OAAO,EAAG;AAC5B,SAAK,KAAK,IAAI,OAAO;AACrB,SAAK,MAAM,KAAK,OAAO;AACvB,WAAO,KAAK,MAAM,SAAS,uCAAuC;AACjE,YAAM,UAAU,KAAK,MAAM,MAAM;AACjC,UAAI,YAAY,OAAW,MAAK,KAAK,OAAO,OAAO;AAAA,IACpD;AAAA,EACD;AACD;AAEO,SAAS,cACf,OACA,QACA,MACsB;AACtB,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,QAAQ,UAAU,KAAK,KAAK;AAClC,QAAM,WAAW,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM;AAChD,QAAM,WAAW,MACf,IAAI,CAAC,MAAM,WAAW,EAAE,MAAM,MAAM,EAAE,EACtC;AAAA,IACA,CAAC,UACA,MAAM,KAAK,aAAa;AAAA,EAC1B;AACD,QAAM,WAAW,MAAM,cAAc,EAAE,MAAM,GAAG,IAAI,iBAAiB,CAAC;AACtE,QAAM,SAAS,SAAS;AAAA,IACvB,CAAC,GAAG,SAAS,IAAI,CAAC,UAAU,MAAM,KAAK,QAAQ,GAAG,OAAO,OAAO;AAAA,IAChE;AAAA,MACC;AAAA,MACA;AAAA,MACA,SAAS,IAAI,CAAC,UAAU,MAAM,KAAK;AAAA,IACpC;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACtB;AAAA,EACD;AACA,QAAM,OAAO,SAAS,KAAW,CAAC,MAAM,GAAG,OAAO,MAAM,QAAQ,GAAG;AAAA,IAClE,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,IACT,SAAS;AAAA,IACT,0BAA0B;AAAA,IAC1B,oBAAoB;AAAA,EACrB,CAAC;AACD,QAAM,WAAW,SAAS;AAAA,IACzB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAY,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MAClE;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,SAAS,SAAS;AAAA,IACvB,CAAC,QAAQ,IAAI;AAAA,IACb,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MAC7D;AACA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MAC7D;AAAA,IACD;AAAA,IACA;AAAA,MACC,MAAM,GAAG,IAAI;AAAA,MACb,SAAS;AAAA,MACT,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,IACrB;AAAA,EACD;AACA,QAAM,SAAS,SAAS,KAA0B,CAAC,QAAQ,IAAI,GAAG,SAAS,QAAQ,GAAG;AAAA,IACrF,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,IACT,SAAS;AAAA,IACT,0BAA0B;AAAA,IAC1B,oBAAoB;AAAA,EACrB,CAAC;AACD,QAAM,UAAU,IAAI;AAAA,IACnB,MAAM;AAAA,MACL,CAAC,SACA;AAAA,QACC,KAAK;AAAA,QACL,SAAS;AAAA,UACR,CAAC,IAAI;AAAA,UACL,CAAC,QAAQ;AACR,uBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,oBAAM,QAAQ;AACd,kBAAI,MAAM,SAAS,aAAa,MAAM,WAAW,KAAK;AACrD,oBAAI,KAAK,CAAC,CAAC,QAAQ,WAAW,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC;AAAA,YACnD;AAAA,UACD;AAAA,UACA;AAAA,YACC,MAAM,GAAG,IAAI,YAAY,KAAK,MAAM;AAAA,YACpC,SAAS;AAAA,YACT,SAAS;AAAA,YACT,0BAA0B;AAAA,YAC1B,oBAAoB;AAAA,YACpB,MAAM,EAAE,QAAQ,KAAK,OAAO;AAAA,UAC7B;AAAA,QACD;AAAA,MACD;AAAA,IACF;AAAA,EACD;AACA,SAAO,QAAQ,YAAY,CAAC,QAAQ,GAAG,gBAAgB,CAAC;AACxD,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU;AACT,UAAI,SAAU;AACd,aAAO,QAAQ,YAAY,CAAC,GAAG,gBAAgB,CAAC;AAChD,UAAI;AACH,iBAAS,QAAQ,EAAE,QAAQ,GAAG,IAAI,yBAAyB,CAAC;AAC5D,mBAAW;AAAA,MACZ,SAAS,OAAO;AACf,eAAO,QAAQ,YAAY,CAAC,QAAQ,GAAG,gBAAgB,CAAC;AACxD,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACD;AAEA,SAAS,kBAAsC;AAC9C,SAAO,CAAC,QAAQ;AACf,eAAW,WAAW,SAAS,KAAK,CAAC,KAAK,CAAC,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,OAAkB,CAAC,CAAC;AAAA,EACtF;AACD;AACA,SAAS,UAAU,OAAqC;AACvD,QAAM,OAAO,oBAAI,IAAY;AAC7B,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,WAAW,wCAAwC;AACrF,SAAO,MAAM,IAAI,CAAC,SAAS;AAC1B,QAAI,CAAC,KAAK,OAAQ,OAAM,IAAI,WAAW,kDAAkD;AACzF,QAAI,KAAK,IAAI,KAAK,MAAM;AACvB,YAAM,IAAI,WAAW,mCAAmC,KAAK,MAAM,EAAE;AACtE,SAAK,IAAI,KAAK,MAAM;AACpB,WAAO;AAAA,EACR,CAAC;AACF;AACA,SAAS,MACR,MACA,SACA,QAAsD,CAAC,GAClC;AACrB,SAAO,EAAE,MAAM,SAAS,GAAG,MAAM;AAClC;AACA,SAAS,KAAK,OAAwC;AACrD,SAAO,EAAE,MAAM,QAAQ,SAAS,EAAE,MAAM,aAAa,OAAO,MAAM,KAAK,EAAE,EAAE;AAC5E;AACA,SAAS,MAAM,OAAuD;AACrE,SAAO,MAAM,SAAS,SACnB;AAAA,IACA,MAAM;AAAA,IACN,QAAQ,MAAM;AAAA,IACd,SAAS,MAAM;AAAA,IACf,OAAO,WAAW,KAAK,MAAM,SAAS,IAAI,WAAW,CAAC;AAAA,EACvD,IACC,EAAE,MAAM,SAAS,QAAQ,MAAM,QAAQ,SAAS,MAAM,QAAQ;AAClE;AACA,SAAS,SACR,MACA,OACA,iBACqB;AACrB,QAAM,QAAQ,oBAAI,IAA+B;AACjD,kBAAgB,QAAQ,CAAC,WAAW,aAAa;AAChD,UAAM,IAAI,UAAU,MAAM,SAAS,CAAC;AAAA,EACrC,CAAC;AACD,QAAM,eAAe,gBAAgB;AACrC,SAAO,CAAC,QAAQ;AACf,QAAI,KAAK,IAAI,MAAM,IAAc;AACjC,QAAI,CAAC,IAAI;AACR,WAAK,EAAE,WAAW,GAAG,WAAW,oBAAI,IAAI,EAAE;AAC1C,UAAI,MAAM,IAAI,EAAE;AAAA,IACjB;AACA,QAAI,UAAU;AACd,aAAS,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;AAChD,YAAM,OAAO,MAAM,IAAI,CAAC;AACxB,UAAI,CAAC,KAAM;AACX,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,YAAI,EAAE,eAAe;AACpB,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO;AAAA,kBACN;AAAA,kBACA,GAAG,IAAI,mBAAmB,KAAK,MAAM;AAAA,kBACrC,EAAE,QAAQ,KAAK,OAAO;AAAA,gBACvB;AAAA,cACD;AAAA,YACD;AAAA,UACD,CAAC;AAAA,aACG;AACJ,aAAG,UAAU,IAAI,KAAK,QAAQ,WAAW,KAAK,GAAG,CAAC;AAClD,oBAAU;AAAA,QACX;AAAA,MACD;AAAA,IACD;AACA,QAAI,QAAS,cAAa,KAAK,MAAM,OAAO,EAAE;AAC9C,eAAW,eAAe,SAAS,KAAK,YAAY,KAAK,CAAC,GAAG;AAC5D,YAAM,KAAK,WAAW,MAAM,WAA0C;AACtE,UAAI,GAAI,KAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;AAAA,IAChC;AAAA,EACD;AACD;AACA,SAAS,aACR,KACA,MACA,OACA,IACO;AACP,QAAM,UAAU,MAAM,OAAO,CAAC,SAAS,CAAC,GAAG,UAAU,IAAI,KAAK,MAAM,CAAC;AACrE,MAAI,QAAQ,QAAQ;AACnB,eAAW,QAAQ;AAClB,UAAI,KAAK;AAAA,QACR;AAAA,UACC;AAAA,UACA;AAAA,YACC,MAAM;AAAA,YACN,OAAO;AAAA,cACN;AAAA,cACA,GAAG,IAAI,wCAAwC,KAAK,MAAM;AAAA,cAC1D,EAAE,QAAQ,KAAK,OAAO;AAAA,YACvB;AAAA,UACD;AAAA,QACD;AAAA,MACD,CAAC;AACF;AAAA,EACD;AACA,QAAM,UAAU,GAAG,IAAI,UAAU,GAAG,WAAW;AAC/C,aAAW,QAAQ;AAClB,QAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,SAAS,KAAK,EAAE,MAAM,SAAS,QAAQ,KAAK,QAAQ,QAAQ,CAAC;AAAA,QAC9D;AAAA,MACD;AAAA,IACD,CAAC;AACF,aAAW,QAAQ,OAAO;AACzB,UAAM,QAAQ,GAAG,UAAU,IAAI,KAAK,MAAM;AAC1C,QAAI;AACH,UAAI,KAAK;AAAA,QACR;AAAA,UACC;AAAA,UACA;AAAA,YACC,MAAM;AAAA,YACN,SAAS,KAAK,EAAE,MAAM,QAAQ,QAAQ,KAAK,QAAQ,SAAS,MAAM,CAAC;AAAA,UACpE;AAAA,QACD;AAAA,MACD,CAAC;AAAA,EACH;AACD;AACA,SAAS,WAAW,MAAc,UAA0D;AAC3F,MAAI,SAAS,SAAS,WAAW,SAAS,SAAS,QAAS,QAAO,EAAE,MAAM,aAAa;AACxF,MAAI,SAAS,SAAS,OAAQ,QAAO;AACrC,QAAM,QAAQ,SAAS,SAAS,SAAS,SAAS,SAAS,QAAQ,QAAQ;AAC3E,MACC,iBAAiB,cAChB,OAAO,UAAU,YAAY,UAAU,QAAS,MAA6B,SAAS;AAEvF,WAAO;AACR,MACC,OAAO,UAAU,YACjB,UAAU,QACT,MAA6B,SAAS;AAEvC,WAAO;AAAA,MACN,MAAM;AAAA,MACN,OAAO;AAAA,QACN;AAAA,QACA,GAAG,IAAI;AAAA,MACR;AAAA,IACD;AACD,QAAM,QAAS,MAA8B;AAC7C,QAAM,MAAM,SAAS,MAAM,KAAK;AAChC,SAAO,MACJ,EAAE,MAAM,SAAS,OAAO,IAAI,IAC5B,EAAE,MAAM,SAAS,OAAO,MAAM,KAA+B,EAAE;AACnE;AACA,SAAS,SAAS,MAAc,OAAgD;AAC/E,MAAI,OAAO,UAAU,YAAY,UAAU;AAC1C,WAAO,MAAM,mCAAmC,GAAG,IAAI,qCAAqC;AAC7F,QAAM,IAAI;AACV,MAAI,EAAE,SAAS,WAAW,EAAE,SAAS;AACpC,WAAO;AAAA,MACN;AAAA,MACA,GAAG,IAAI;AAAA,IACR;AACD,MAAI,CAAC,EAAE;AACN,WAAO;AAAA,MACN;AAAA,MACA,GAAG,IAAI;AAAA,MACP,EAAE,SAAS,EAAE,QAAQ;AAAA,IACtB;AACD,MAAI,CAAC,EAAE;AACN,WAAO;AAAA,MACN;AAAA,MACA,GAAG,IAAI;AAAA,MACP,EAAE,QAAQ,EAAE,OAAO;AAAA,IACpB;AACD,MAAI,EAAE,SAAS,WAAW,EAAE,UAAU;AACrC,WAAO;AAAA,MACN;AAAA,MACA,GAAG,IAAI;AAAA,MACP,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,QAAQ;AAAA,IACxC;AACD,MAAI,EAAE,SAAS,UAAU,EAAE,EAAE,iBAAiB;AAC7C,WAAO;AAAA,MACN;AAAA,MACA,GAAG,IAAI;AAAA,MACP,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,QAAQ;AAAA,IACxC;AACD,SAAO;AACR;AACA,SAAS,OAAO,MAAc,aAAoD;AACjF,QAAM,WAAW,IAAI,IAAI,WAAW;AACpC,SAAO,CAAC,QAAQ;AACf,QAAI,KAAK,IAAI,MAAM,IAAe;AAClC,QAAI,CAAC,IAAI;AACR,WAAK;AAAA,QACJ,OAAO,oBAAI,IAAI;AAAA,QACf,MAAM,oBAAI,IAAI;AAAA,QACd,QAAQ,IAAI,gBAAgB;AAAA,QAC5B,UAAU,IAAI,gBAAgB;AAAA,MAC/B;AACA,UAAI,MAAM,IAAI,EAAE;AAAA,IACjB;AACA,UAAM,YAAY,CAAC,MAClB,IAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,OAAO,EAAE,CAAgB,CAAC,CAAC;AAChE,UAAM,QAAQ,MAAM;AACnB,SAAG,gBAAgB;AACnB,SAAG,MAAM,MAAM;AACf,SAAG,KAAK,MAAM;AAAA,IACf;AACA,UAAM,OAAO,CAAC,YAAqB;AAClC,UAAI,QAAS,IAAG,OAAO,IAAI,OAAO;AAClC,YAAM;AAAA,IACP;AACA,UAAM,WAAW,CAAC,YACjB,IAAI,KAAK;AAAA,MACR;AAAA,QACC;AAAA,QACA,EAAE,MAAM,YAAY,SAAS,OAAO,GAAG,MAAM,MAAM,MAAM,GAAG,KAAK,KAAK;AAAA,MACvE;AAAA,IACD,CAAC;AACF,eAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,YAAM,KAAK;AACX,UAAI,GAAG,SAAS,SAAS;AACxB,kBAAU,GAAG,KAAK;AAClB;AAAA,MACD;AACA,UAAI,GAAG,SAAS,WAAY;AAC5B,UAAI,GAAG,SAAS,cAAc;AAC7B,YAAI,GAAG,eAAe;AACrB;AAAA,YACC;AAAA,cACC;AAAA,cACA,GAAG,IAAI,WAAW,GAAG,aAAa;AAAA,cAClC,EAAE,SAAS,GAAG,cAAc;AAAA,YAC7B;AAAA,UACD;AACA,eAAK,GAAG,aAAa;AAAA,QACtB;AACA;AAAA,MACD;AACA,YAAM,IAAI,GAAG;AACb,UAAI,GAAG,OAAO,IAAI,EAAE,OAAO,GAAG;AAC7B;AAAA,UACC;AAAA,YACC;AAAA,YACA,GAAG,IAAI,WAAW,EAAE,OAAO;AAAA,YAC3B,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,QAAQ;AAAA,UACxC;AAAA,QACD;AACA;AAAA,MACD;AACA,UAAI,GAAG,SAAS,IAAI,EAAE,OAAO,GAAG;AAC/B;AAAA,UACC;AAAA,YACC,EAAE,SAAS,UACR,oCACA;AAAA,YACH,GAAG,IAAI,WAAW,EAAE,OAAO;AAAA,YAC3B,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,QAAQ;AAAA,UACxC;AAAA,QACD;AACA;AAAA,MACD;AACA,UAAI,CAAC,SAAS,IAAI,EAAE,MAAM,GAAG;AAC5B;AAAA,UACC,MAAM,gCAAgC,GAAG,IAAI,kBAAkB,EAAE,MAAM,IAAI;AAAA,YAC1E,QAAQ,EAAE;AAAA,YACV,SAAS,EAAE;AAAA,UACZ,CAAC;AAAA,QACF;AACA,aAAK,EAAE,OAAO;AACd;AAAA,MACD;AACA,UAAI,CAAC,GAAG,cAAe,IAAG,gBAAgB,EAAE;AAC5C,UAAI,GAAG,kBAAkB,EAAE,SAAS;AACnC,cAAM,gBAAgB,GAAG;AACzB;AAAA,UACC;AAAA,YACC;AAAA,YACA,GAAG,IAAI,qBAAqB,EAAE,OAAO,kBAAkB,aAAa;AAAA,YACpE,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,SAAS,cAAc;AAAA,UACvD;AAAA,QACD;AACA;AAAA,UACC;AAAA,YACC;AAAA,YACA,GAAG,IAAI,kBAAkB,aAAa;AAAA,YACtC,EAAE,SAAS,cAAc;AAAA,UAC1B;AAAA,QACD;AACA,aAAK,aAAa;AAClB,WAAG,OAAO,IAAI,EAAE,OAAO;AACvB;AAAA,MACD;AACA,UAAI,EAAE,SAAS,SAAS;AACvB,YAAI,GAAG,MAAM,IAAI,EAAE,MAAM,GAAG;AAC3B;AAAA,YACC;AAAA,cACC;AAAA,cACA,GAAG,IAAI,8BAA8B,EAAE,MAAM;AAAA,cAC7C,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,QAAQ;AAAA,YACxC;AAAA,UACD;AACA,eAAK,EAAE,OAAO;AACd;AAAA,QACD;AACA,WAAG,MAAM,IAAI,EAAE,MAAM;AACrB,iBAAS,EAAE,OAAO;AAClB;AAAA,MACD;AACA,UAAI,CAAC,GAAG,MAAM,IAAI,EAAE,MAAM,GAAG;AAC5B;AAAA,UACC;AAAA,YACC;AAAA,YACA,GAAG,IAAI,mBAAmB,EAAE,MAAM;AAAA,YAClC,EAAE,QAAQ,EAAE,QAAQ,SAAS,EAAE,QAAQ;AAAA,UACxC;AAAA,QACD;AACA,aAAK,EAAE,OAAO;AACd;AAAA,MACD;AACA,UAAI,GAAG,KAAK,IAAI,EAAE,MAAM,GAAG;AAC1B;AAAA,UACC,MAAM,kCAAkC,GAAG,IAAI,6BAA6B,EAAE,MAAM,IAAI;AAAA,YACvF,QAAQ,EAAE;AAAA,YACV,SAAS,EAAE;AAAA,UACZ,CAAC;AAAA,QACF;AACA,aAAK,EAAE,OAAO;AACd;AAAA,MACD;AACA,SAAG,KAAK,IAAI,EAAE,QAAQ,WAAW,KAAK,EAAE,SAAS,IAAI,WAAW,CAAC,CAAC;AAClE,UAAI,GAAG,MAAM,SAAS,YAAY,UAAU,GAAG,KAAK,SAAS,YAAY,QAAQ;AAChF,mBAAW,UAAU,aAAa;AACjC,gBAAM,QAAQ,GAAG,KAAK,IAAI,MAAM;AAChC,cAAI;AACH,gBAAI,KAAK;AAAA,cACR;AAAA,gBACC;AAAA,gBACA;AAAA,kBACC,MAAM;AAAA,kBACN,SAAS,EAAE;AAAA,kBACX;AAAA,kBACA,OAAO,WAAW,KAAK,KAAK;AAAA,gBAC7B;AAAA,cACD;AAAA,YACD,CAAC;AAAA,QACH;AACA,WAAG,SAAS,IAAI,EAAE,OAAO;AACzB,cAAM;AAAA,MACP,MAAO,UAAS,EAAE,OAAO;AAAA,IAC1B;AAAA,EACD;AACD;AACA,SAAS,SAAS,aAAoD;AACrE,SAAO,CAAC,QAAQ;AACf,QAAI,OACH,IAAI,MAAM,IAAyB,KAClC;AAAA,MACA,OAAO;AAAA,MACP,eAAe,CAAC,GAAG,WAAW;AAAA,MAC9B,OAAO;AAAA,MACP,MAAM;AAAA,MACN,UAAU;AAAA,MACV,QAAQ;AAAA,IACT;AACD,eAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,YAAM,KAAK;AACX,UAAI,GAAG,SAAS;AACf,eAAO,EAAE,GAAG,MAAM,OAAO,UAAU,QAAQ,KAAK,SAAS,GAAG,WAAW,GAAG,MAAM;AAAA,IAClF;AACA,eAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,YAAM,KAAK;AACX,UAAI,GAAG,SAAS;AACf,eAAO,EAAE,GAAG,MAAM,OAAO,UAAU,QAAQ,KAAK,SAAS,GAAG,WAAW,GAAG,MAAM;AAAA,eACxE,GAAG,SAAS;AACpB,eAAO;AAAA,UACN,GAAG;AAAA,UACH,OAAO;AAAA,UACP,eAAe,GAAG;AAAA,UAClB,OAAO,GAAG;AAAA,UACV,MAAM,GAAG;AAAA,QACV;AAAA;AAEA,eAAO;AAAA,UACN,GAAG;AAAA,UACH,OAAO;AAAA,UACP,eAAe,GAAG;AAAA,UAClB,OAAO,YAAY;AAAA,UACnB,MAAM,YAAY;AAAA,UAClB,UAAU,KAAK,WAAW;AAAA,QAC3B;AAAA,IACF;AACA,QAAI,MAAM,IAAI,IAAI;AAClB,QAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,EAC1B;AACD;;;AC1kBA,SAAS,kBAAqBC,SAA0B;AACvD,SAAOA;AACR;AAEA,SAAS,cAAc,KAAqB;AAC3C,MAAI,QAAQ,IAAI,MAAM,IAAe;AACrC,MAAI,UAAU,QAAW;AACxB,YAAQ;AAAA,MACP,KAAK;AAAA,MACL,SAAS,oBAAI,IAAI;AAAA,MACjB,QAAQ,oBAAI,IAAI;AAAA,MAChB,QAAQ;AAAA,MACR,kBAAkB;AAAA,IACnB;AACA,QAAI,MAAM,IAAI,KAAK;AAAA,EACpB;AACA,QAAM,SAAS;AACf,MAAI,CAAC,MAAM,kBAAkB;AAC5B,UAAM,mBAAmB;AACzB,QAAI,eAAe,MAAM;AACxB,YAAM,SAAS;AACf,YAAM,mBAAmB;AACzB,iBAAW,UAAU,MAAM,QAAQ,OAAO,EAAG,WAAU,MAAM;AAC7D,iBAAWC,UAAS,MAAM,OAAO,OAAO,EAAG,cAAaA,MAAK;AAC7D,YAAM,QAAQ,MAAM;AACpB,YAAM,OAAO,MAAM;AAAA,IACpB,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEO,SAAS,UAAU,QAA4B;AACrD,MAAI;AACH,WAAO;AAAA,EACR,QAAQ;AAAA,EAER;AACD;AAEA,SAAS,cACR,OACA,QACA,MACkC;AAClC,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,YAAM,UACL,IAAI,MAAM,IAAoB,KAC7B,EAAE,OAAO,QAAQ,UAAU,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,EAAE;AAC/D,UAAI,OAAO;AACX,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,eAAO,aAAa,MAAM,KAAuC;AAAA,MAClE;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,iBAAiB;AAAA,EACrD;AACA,QAAM,WAAW,MAAM;AAAA,IACtB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,cAAM,QAAQ;AACd,YAAI,aAAa,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MAC3D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,mBAAmB;AAAA,EACzD;AACA,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC3C,cAAM,QAAQ;AACd,YAAI,WAAW,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MACvD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,iBAAiB;AAAA,EACrD;AACA,SAAO,EAAE,QAAQ,QAAQ,UAAU,OAAO;AAC3C;AAEA,SAAS,aACR,SACA,OACiB;AACjB,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,QAAQ,WAAW;AAAA,QAC7B,SAAS,MAAM;AAAA,MAChB;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,aAAa,MAAM;AAAA,MACpB;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,MAAM,QAAQ,OAAO;AAAA,QACrB,aAAa;AAAA,MACd;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,QAAQ,QAAQ,SAAS;AAAA,MAC1B;AAAA,IACD,KAAK;AACJ,aAAO;AAAA,QACN,GAAG;AAAA,QACH,OAAO;AAAA,QACP,UAAU,KAAK,IAAI,GAAG,QAAQ,WAAW,CAAC;AAAA,QAC1C,SAAS,MAAM;AAAA,QACf,QAAQ,QAAQ,SAAS;AAAA,MAC1B;AAAA,IACD,KAAK;AACJ,aAAO,EAAE,GAAG,SAAS,OAAO,YAAY;AAAA,IACzC,KAAK;AACJ,aAAO,EAAE,GAAG,SAAS,OAAO,UAAU,QAAQ,QAAQ,SAAS,EAAE;AAAA,EACnE;AACD;AAEA,SAAS,aACR,OACAD,SACA,MACAE,OAKA,MACuC;AACvC,QAAM,SAAS,KAAK,SAAS,YAAY;AACzC,SAAO,MAAM;AAAA,IACZ,CAAC,kBAAkBF,OAAM,CAAC;AAAA,IAC1B,CAAC,QAAQ;AACR,YAAM,QAAQ,cAAc,GAAG;AAC/B,YAAM,QAAQ,CAAC,OAAe,YAAoB;AACjD,YAAI,CAAC,MAAM,OAAQ;AACnB,cAAM,KAAK,MAAM;AACjB,YAAI,KAAK;AAAA,UACR,CAAC,QAAQ,EAAE,MAAM,WAAW,OAAO,QAAQ,CAA0C;AAAA,QACtF,CAAC;AACD,cAAM,eAAe,CAAC,UAAmB;AACxC,gBAAM,UAAU,aAAa,KAAK;AAClC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,EAAE,MAAM,aAAa,OAAO,SAAS,OAAO,QAAQ;AAAA,YAIrD;AAAA,UACD,CAAC;AACD,cAAI,KAAK,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC;AAAA,QAC9B;AACA,YAAI;AACJ,YAAI,OAAO;AACX,YAAI;AACH,mBAASE,MAAK,KAAK,OAAO,CAAC,WAAW;AACrC,gBAAI,QAAQ,CAAC,MAAM,OAAQ;AAC3B,mBAAO;AACP,kBAAM,QAAQ,OAAO,EAAE;AACvB,gBAAI,OAAO,IAAI;AACd,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA,EAAE,MAAM,QAAQ,OAAO,SAAS,QAAQ,OAAO,MAAM;AAAA,gBAItD;AAAA,cACD,CAAC;AACD;AAAA,YACD;AACA,gBAAI,YAAY,QAAQ,OAAO,GAAG;AACjC,oBAAM,cAAc,UAAU;AAC9B,oBAAM,UAAU,iBAAiB,QAAQ,WAAW,KAAK;AACzD,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,MAAM;AAAA,oBACN;AAAA,oBACA;AAAA,oBACA;AAAA,oBACA,OAAO,aAAa,OAAO,KAAK;AAAA,kBACjC;AAAA,gBACD;AAAA,cACD,CAAC;AACD,oBAAMD,SAAQ,WAAW,MAAM;AAC9B,sBAAM,OAAO,OAAO,EAAE;AACtB,oBAAI,CAAC,MAAM,OAAQ;AACnB,sBAAM,OAAO,WAAW;AAAA,cACzB,GAAG,OAAO;AACV,oBAAM,OAAO,IAAI,IAAIA,MAAK;AAAA,YAC3B,OAAO;AACN,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,MAAM;AAAA,oBACN;AAAA,oBACA;AAAA,oBACA,OAAO,aAAa,OAAO,KAAK;AAAA,kBACjC;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,cAAI,CAAC,MAAM;AACV,mBAAO;AACP,kBAAM,QAAQ,OAAO,EAAE;AACvB,yBAAa,KAAK;AAAA,UACnB;AACA;AAAA,QACD;AACA,YAAI,WAAW,QAAW;AACzB,cAAI,CAAC,MAAM;AACV,mBAAO;AACP,yBAAa,GAAG,IAAI,yCAAyC;AAAA,UAC9D;AACA;AAAA,QACD;AACA,YAAI,CAAC,QAAQ,MAAM,QAAQ;AAC1B,gBAAM,QAAQ,IAAI,IAAI,MAAM;AAAA,QAC7B,WAAW,CAAC,MAAM,QAAQ;AACzB,oBAAU,MAAM;AAAA,QACjB;AAAA,MACD;AACA,iBAAW,SAAS,SAAS,KAAK,CAAC,KAAK,CAAC,EAAG,OAAM,OAAiB,CAAC;AACpE,YAAM,WAAW,IAAI,SAAS,CAAC;AAC/B,UAAI,aAAa,MAAM;AACtB,YAAI,KAAK;AAAA,UACR,CAAC,QAAQ,EAAE,MAAM,oBAAoB,CAA0C;AAAA,QAChF,CAAC;AAAA,MACF,WAAW,aAAa,SAAS,aAAa,QAAW;AACxD,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA,EAAE,MAAM,kBAAkB,OAAO,SAAS;AAAA,UAC3C;AAAA,QACD,CAAC;AAAA,MACF;AAAA,IACD;AAAA,IACA,EAAE,MAAM,SAAS,KAAK;AAAA,EACvB;AACD;AAEO,SAAS,OACf,OACAD,SACA,WACA,OAA+B,CAAC,GACE;AAClC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS;AAAA,IACd;AAAA,IACAA;AAAA,IACA;AAAA,IACA,CAAC,KAAK,OAAO,aAAa;AACzB,YAAM,UAAU,UAAU,KAAK;AAC/B,aAAO,IAAI,YAAY,EAAE,WAAW,GAAG,QAAQ,SAAS,QAAQ;AAAA,IACjE;AAAA,IACA;AAAA,EACD;AACA,SAAO,cAAc,OAAO,QAAQ,IAAI;AACzC;AAEO,SAAS,UACf,OACAA,SACA,WACA,OAA+B,CAAC,GACG;AACnC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS;AAAA,IACd;AAAA,IACAA;AAAA,IACA;AAAA,IACA,CAAC,KAAK,OAAO,aAAa;AACzB,YAAM,UAAU,UAAU,KAAK;AAC/B,aAAO,IAAI,YAAY,EAAE,cAAc,GAAG,IAAI,SAAS,QAAQ;AAAA,IAChE;AAAA,IACA;AAAA,EACD;AACA,SAAO,cAAc,OAAO,QAAQ,IAAI;AACzC;AAEO,SAAS,YACf,OACAA,SACA,SACA,QACA,OAA+B,CAAC,GACS;AACzC,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS;AAAA,IACd;AAAA,IACAA;AAAA,IACA;AAAA,IACA,CAAC,KAAK,OAAO,aAAa;AACzB,YAAM,SAAS,IAAI,YAAY,EAAE,gBAAgB;AACjD,aAAO,QAAQ,OAAO,SAAS,OAAO,KAAK,GAAG,QAAQ;AAAA,IACvD;AAAA,IACA;AAAA,EACD;AACA,SAAO,cAAc,OAAO,QAAQ,IAAI;AACzC;;;AC/RA,SAAS,0BAA0B,KAAiC;AACnE,MAAI,QAAQ,IAAI,MAAM,IAA2B;AACjD,MAAI,UAAU,QAAW;AACxB,YAAQ;AAAA,MACP,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,kBAAkB;AAAA,MAClB,gBAAgB;AAAA,MAChB,gBAAgB;AAAA,MAChB,aAAa,oBAAI,IAAI;AAAA,MACrB,WAAW,oBAAI,IAAI;AAAA,MACnB,iBAAiB,CAAC;AAAA,MAClB,QAAQ,oBAAI,IAAI;AAAA,MAChB,KAAK;AAAA,MACL,aAAa;AAAA,IACd;AACA,QAAI,MAAM,IAAI,KAAK;AAAA,EACpB;AACA,QAAM,SAAS;AACf,MAAI,CAAC,MAAM,kBAAkB;AAC5B,UAAM,mBAAmB;AACzB,QAAI,eAAe,MAAM;AACxB,YAAM,cAAc,CAAC,GAAG,MAAM,YAAY,OAAO,CAAC;AAClD,YAAM,SAAS,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC;AACxC,YAAM,UAAU,MAAM;AACtB,YAAM,SAAS;AACf,YAAM,mBAAmB;AACzB,YAAM,YAAY;AAClB,YAAM,iBAAiB;AACvB,YAAM,iBAAiB;AACvB,YAAM,YAAY,MAAM;AACxB,YAAM,UAAU,MAAM;AACtB,YAAM,kBAAkB,CAAC;AACzB,YAAM,OAAO,MAAM;AACnB,iBAAW,UAAU,YAAa,WAAU,MAAM;AAClD,iBAAWG,UAAS,OAAQ,cAAaA,MAAK;AAC9C,eAAS,OAAO;AAAA,IACjB,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,2BACR,OACA,eAAkC,UAIjC;AACD,QAAM,UAAU,MAAM;AACtB,QAAM,SAAS,CAAC,GAAG,MAAM,OAAO,OAAO,CAAC;AACxC,QAAM,cAAc,CAAC,GAAG,MAAM,YAAY,OAAO,CAAC;AAClD,QAAM,WAAW,CAAC,GAAG,MAAM,iBAAiB,GAAG,MAAM,UAAU,OAAO,CAAC;AACvE,QAAM,YAAY;AAClB,QAAM,iBAAiB;AACvB,QAAM,iBAAiB;AACvB,QAAM,OAAO,MAAM;AACnB,QAAM,YAAY,MAAM;AACxB,QAAM,kBAAkB,CAAC;AACzB,QAAM,UAAU,MAAM;AACtB,aAAWA,UAAS,OAAQ,cAAaA,MAAK;AAC9C,aAAW,cAAc,YAAa,WAAU,UAAU;AAC1D,MAAI,iBAAiB,SAAU,UAAS,OAAO;AAC/C,SAAO,EAAE,UAAU,QAAQ;AAC5B;AAEA,SAAS,kBAAkB,OAAoC;AAC9D,aAAWA,UAAS,MAAM,OAAO,OAAO,EAAG,cAAaA,MAAK;AAC7D,QAAM,OAAO,MAAM;AACpB;AAEA,SAAS,2BACR,OACA,eAAkC,UACL;AAC7B,QAAM,UAAU,MAAM;AACtB,QAAM,cAAc,CAAC,GAAG,MAAM,YAAY,OAAO,CAAC;AAClD,QAAM,WAAW,CAAC,GAAG,MAAM,UAAU,OAAO,CAAC;AAC7C,QAAM,YAAY;AAClB,QAAM,iBAAiB;AACvB,QAAM,iBAAiB;AACvB,QAAM,YAAY,MAAM;AACxB,QAAM,UAAU,MAAM;AACtB,aAAW,cAAc,YAAa,WAAU,UAAU;AAC1D,MAAI,iBAAiB,SAAU,UAAS,OAAO;AAC/C,SAAO;AACR;AAEA,SAAS,oCACR,QACyF;AACzF,MAAI,QAAQ,SAAS,SAAU,QAAO,EAAE,MAAM,SAAS;AACvD,MAAI,CAAC,OAAO,SAAS,OAAO,UAAU,KAAK,OAAO,aAAa,GAAG;AACjE,UAAM,IAAI,MAAM,qEAAqE;AAAA,EACtF;AACA,SAAO,EAAE,MAAM,UAAU,YAAY,KAAK,MAAM,OAAO,UAAU,EAAE;AACpE;AAEA,SAAS,0BACR,OACA,SACA,SACA,MACA,QACA,YAC8B;AAC9B,SAAO,MAAM;AAAA,IACZ,CAAC,OAAO;AAAA,IACR,CAAC,QAAQ;AACR,YAAM,QAAQ,0BAA0B,GAAG;AAE3C,YAAMC,gBAAe,CAAC,SAAmC;AACxD,YAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,KAAK,CAAiC,CAAC,CAAC;AAAA,MAChF;AAEA,YAAM,uBAAuB,CAC5B,OACA,WACI;AACJ,mBAAW,QAAQ,OAAO;AACzB,UAAAA,cAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAEA,YAAM,uBAAuB,CAAC,OAA4C,UAAmB;AAC5F,cAAM,UAAU,aAAa,KAAK;AAClC,mBAAW,QAAQ,OAAO;AACzB,UAAAA,cAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO;AAAA,UACR,CAAC;AAAA,QACF;AAAA,MACD;AAEA,YAAM,iBAAiB,CAAC,SAAiB,UAAmB;AAC3D,cAAM,UAAU,aAAa,KAAK;AAClC,cAAM,WAAW,2BAA2B,KAAK;AACjD,6BAAqB,UAAU,GAAG,IAAI,sBAAsB;AAC5D,YAAI,YAAY,QAAQ,OAAO,GAAG;AACjC,gBAAM,cAAc,UAAU;AAC9B,gBAAM,UAAU,iBAAiB,QAAQ,WAAW,KAAK;AACzD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA,OAAO;AAAA,cACR;AAAA,YACD;AAAA,UACD,CAAC;AACD,gBAAM,UAAU,MAAM;AACtB,gBAAMD,SAAQ,WAAW,MAAM;AAC9B,kBAAM,OAAO,OAAO,OAAO;AAC3B,gBAAI,CAAC,MAAM,OAAQ;AACnB,kBAAM,WAAW;AAAA,UAClB,GAAG,OAAO;AACV,gBAAM,OAAO,IAAI,SAASA,MAAK;AAAA,QAChC,OAAO;AACN,+BAAqB,MAAM,iBAAiB,OAAO;AACnD,gBAAM,kBAAkB,CAAC;AACzB,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA,EAAE,MAAM,aAAa,SAAS,OAAO,QAAQ;AAAA,YAC9C;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAEA,YAAM,QAAQ,CAAC,YAAoB;AAClC,YACC,CAAC,MAAM,UACP,MAAM,aACN,MAAM,mBAAmB,KACzB,MAAM,OAAO,OAAO,GACnB;AACD;AAAA,QACD;AACA,cAAM,SAAS,IAAI,YAAY,EAAE,gBAAgB;AACjD,cAAM,iBAAiB;AACvB,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA;AAAA,cACC,MAAM;AAAA,cACN;AAAA,cACA,aAAa,OAAO;AAAA,YACrB;AAAA,UACD;AAAA,QACD,CAAC;AACD,cAAM,iBAAiB,QAAQ;AAC/B,YAAI,mBAAmB,QAAW;AACjC,yBAAe,SAAS,GAAG,IAAI,wCAAwC;AACvE;AAAA,QACD;AACA,YAAI;AACJ,YAAI;AACH,oBAAU,eAAe,KAAK,QAAQ,SAAS,CAAC,UAAU;AACzD,gBAAI,CAAC,MAAM,UAAU,MAAM,mBAAmB,QAAS;AACvD,gBAAI,MAAM,SAAS,SAAS;AAC3B,oBAAM,KAAK,MAAM;AACjB,kBAAI,GAAG,SAAS,QAAQ;AACvB,sBAAM,YAAY;AAClB,oBAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,QAAQ,CAAiC,CAAC,CAAC;AAC9E,6BAAa;AAAA,cACd,WAAW,GAAG,SAAS,UAAU,GAAG,SAAS,UAAU;AACtD,oBAAI,KAAK;AAAA,kBACR;AAAA,oBACC;AAAA,oBACA;AAAA,sBACC,MAAM;AAAA,sBACN,SAAS;AAAA,oBACV;AAAA,kBACD;AAAA,gBACD,CAAC;AAAA,cACF,WAAW,GAAG,SAAS,SAAS;AAC/B,sBAAM,cAAc,GAAG,SAAS;AAChC,sBAAM,WAAW,2BAA2B,KAAK;AACjD,qCAAqB,UAAU,GAAG,IAAI,kBAAkB;AACxD,oBAAI,KAAK;AAAA,kBACR;AAAA,oBACC;AAAA,oBACA;AAAA,sBACC,MAAM;AAAA,sBACN,MAAM,GAAG;AAAA,sBACT,QAAQ,GAAG;AAAA,oBACZ;AAAA,kBACD;AAAA,gBACD,CAAC;AACD,oBAAI,CAAC,aAAa;AACjB,iCAAe,SAAS;AAAA,oBACvB,MAAM;AAAA,oBACN,MAAM,GAAG;AAAA,oBACT,QAAQ,GAAG;AAAA,kBACZ,CAAC;AAAA,gBACF;AAAA,cACD;AAAA,YACD,WAAW,MAAM,SAAS,SAAS;AAClC,6BAAe,SAAS,MAAM,KAAK;AAAA,YACpC,WAAW,MAAM,SAAS,YAAY;AACrC,6BAAe,SAAS,GAAG,IAAI,wBAAwB;AAAA,YACxD;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,yBAAe,SAAS,KAAK;AAC7B;AAAA,QACD;AACA,YAAI,YAAY,QAAW;AAC1B,yBAAe,SAAS,GAAG,IAAI,wCAAwC;AACvE;AAAA,QACD;AACA,YAAI,MAAM,UAAU,MAAM,mBAAmB,SAAS;AACrD,gBAAM,iBAAiB;AAAA,QACxB,OAAO;AACN,kBAAQ,OAAO;AAAA,QAChB;AAAA,MACD;AAEA,eAAS,QAAQ,MAAsC;AACtD,YAAI,CAAC,MAAM,WAAW;AACrB,UAAAC,cAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO,GAAG,IAAI;AAAA,UACf,CAAC;AACD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,GAAG,IAAI;AAAA,cACf;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM,UAAU,MAAM;AACtB,YAAI,YAAY,QAAW;AAC1B,UAAAA,cAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO,GAAG,IAAI;AAAA,UACf,CAAC;AACD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,OAAO,GAAG,IAAI;AAAA,cACf;AAAA,YACD;AAAA,UACD,CAAC;AACD;AAAA,QACD;AACA,cAAM,SAAS,MAAM;AACrB,cAAM,UAAU,IAAI,QAAQ,IAAI;AAChC,QAAAA,cAAa,EAAE,MAAM,WAAW,KAAK,KAAK,KAAK,SAAS,KAAK,QAAQ,CAAC;AACtE,YAAI,OAAO;AACX,YAAI;AACJ,YAAI;AACH,mBAAS,QAAQ,KAAK,KAAK,SAAS,CAAC,WAAW;AAC/C,gBAAI,QAAQ,CAAC,MAAM,UAAU,CAAC,MAAM,UAAU,IAAI,MAAM,EAAG;AAC3D,mBAAO;AACP,kBAAM,UAAU,OAAO,MAAM;AAC7B,kBAAM,YAAY,OAAO,MAAM;AAC/B,gBAAI,OAAO,IAAI;AACd,cAAAA,cAAa,EAAE,MAAM,QAAQ,KAAK,KAAK,KAAK,SAAS,KAAK,QAAQ,CAAC;AACnE,kBAAI,KAAK;AAAA,gBACR,CAAC,QAAQ,EAAE,MAAM,QAAQ,SAAS,KAAK,QAAQ,CAAiC;AAAA,cACjF,CAAC;AAAA,YACF,OAAO;AACN,oBAAM,UAAU,aAAa,OAAO,KAAK;AACzC,cAAAA,cAAa;AAAA,gBACZ,MAAM;AAAA,gBACN,KAAK,KAAK;AAAA,gBACV,SAAS,KAAK;AAAA,gBACd,OAAO;AAAA,cACR,CAAC;AACD,kBAAI,KAAK;AAAA,gBACR;AAAA,kBACC;AAAA,kBACA;AAAA,oBACC,MAAM;AAAA,oBACN,OAAO;AAAA,kBACR;AAAA,gBACD;AAAA,cACD,CAAC;AAAA,YACF;AAAA,UACD,CAAC;AAAA,QACF,SAAS,OAAO;AACf,gBAAM,UAAU,OAAO,MAAM;AAC7B,gBAAM,UAAU,aAAa,KAAK;AAClC,UAAAA,cAAa;AAAA,YACZ,MAAM;AAAA,YACN,KAAK,KAAK;AAAA,YACV,SAAS,KAAK;AAAA,YACd,OAAO;AAAA,UACR,CAAC;AACD,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,OAAO,QAAQ,CAAiC,CAAC,CAAC;AACtF;AAAA,QACD;AACA,YAAI,WAAW,UAAa,CAAC,QAAQ,MAAM,UAAU,MAAM,UAAU,IAAI,MAAM,GAAG;AACjF,gBAAM,YAAY,IAAI,QAAQ,MAAM;AAAA,QACrC,WAAW,WAAW,UAAa,CAAC,MAAM,OAAQ,WAAU,MAAM;AAAA,MACnE;AAEA,eAAS,eAAqB;AAC7B,cAAM,UAAU,MAAM;AACtB,cAAM,kBAAkB,CAAC;AACzB,iBAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS;AACpD,gBAAM,OAAO,QAAQ,KAAK;AAC1B,cAAI,CAAC,MAAM,aAAa,MAAM,mBAAmB,QAAW;AAC3D,iCAAqB,QAAQ,MAAM,KAAK,GAAG,GAAG,IAAI,kBAAkB;AACpE;AAAA,UACD;AACA,kBAAQ,IAAI;AAAA,QACb;AAAA,MACD;AAEA,YAAMC,QAAO,CAAC,YAA2B;AACxC,cAAM,OAAO,EAAE,KAAK,MAAM,eAAe,QAAQ;AACjD,YAAI,MAAM,WAAW;AACpB,kBAAQ,IAAI;AACZ;AAAA,QACD;AACA,YAAI,WAAW,SAAS,UAAU;AACjC,cAAI,MAAM,gBAAgB,UAAU,WAAW,YAAY;AAC1D,YAAAD,cAAa;AAAA,cACZ,MAAM;AAAA,cACN,KAAK,KAAK;AAAA,cACV;AAAA,cACA,OAAO,GAAG,IAAI;AAAA,YACf,CAAC;AACD,gBAAI,KAAK;AAAA,cACR;AAAA,gBACC;AAAA,gBACA;AAAA,kBACC,MAAM;AAAA,kBACN,OAAO,GAAG,IAAI;AAAA,gBACf;AAAA,cACD;AAAA,YACD,CAAC;AACD;AAAA,UACD;AACA,gBAAM,gBAAgB,KAAK,IAAI;AAC/B,UAAAA,cAAa,EAAE,MAAM,UAAU,KAAK,KAAK,KAAK,QAAQ,CAAC;AACvD;AAAA,QACD;AACA,QAAAA,cAAa;AAAA,UACZ,MAAM;AAAA,UACN,KAAK,KAAK;AAAA,UACV;AAAA,UACA,OAAO,GAAG,IAAI;AAAA,QACf,CAAC;AACD,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA;AAAA,cACC,MAAM;AAAA,cACN,OAAO,GAAG,IAAI;AAAA,YACf;AAAA,UACD;AAAA,QACD,CAAC;AAAA,MACF;AAEA,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,eAAe;AACrB,YAAI,aAAa,SAAS,QAAS,OAAM,CAAC;AAAA,iBACjC,aAAa,SAAS,OAAQ,CAAAC,MAAK,aAAa,OAAO;AAAA,aAC3D;AACJ,4BAAkB,KAAK;AACvB,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,MAAM,aAAa;AAAA,gBACnB,QAAQ,aAAa;AAAA,cACtB;AAAA,YACD;AAAA,UACD,CAAC;AACD,gBAAM,EAAE,UAAU,QAAQ,IAAI,2BAA2B,OAAO,MAAM;AACtE,+BAAqB,UAAU,GAAG,IAAI,kBAAkB;AACxD,mBAAS,MAAM,aAAa,MAAM,aAAa,MAAM;AACrD,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,MAAM,aAAa;AAAA,gBACnB,QAAQ,aAAa;AAAA,cACtB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB;AAAA,EAC7D;AACD;AAEA,SAAS,sBACR,OACA,SACA,QACA,MACA,QACyB;AACzB,QAAM,UAAU,MAAM;AAAA,IACrB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,YAAY,SAAS,0BAA0B;AAAA,EAC/D;AACA,QAAM,YAAY,MAAM;AAAA,IACvB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAW;AAC7B,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,SAAS,MAAM;AAAA,gBACf,aAAa,MAAM;AAAA,cACpB;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,QAAQ;AACjC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,SAAS,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,QAC9D,WAAW,MAAM,SAAS,QAAQ;AACjC,cAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,SAAS,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,QAC9D,WAAW,MAAM,SAAS,aAAa,MAAM,SAAS,UAAU;AAC/D,cAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QAC3B,WAAW,MAAM,SAAS,SAAS;AAClC,cAAI,KAAK;AAAA,YACR;AAAA,cACC;AAAA,cACA;AAAA,gBACC,MAAM;AAAA,gBACN,SAAS,MAAM;AAAA,gBACf,aAAa,MAAM;AAAA,gBACnB,SAAS,MAAM;AAAA,gBACf,OAAO,MAAM;AAAA,cACd;AAAA,YACD;AAAA,UACD,CAAC;AAAA,QACF,WAAW,MAAM,SAAS,aAAa;AACtC,cAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QAC3B;AAAA,MACD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,cAAc,SAAS,4BAA4B;AAAA,EACnE;AACA,QAAM,WAAW,MAAM;AAAA,IACtB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAY,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,IAAI,CAAC,CAAC;AAAA,MAC/D;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,2BAA2B;AAAA,EACjE;AACA,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,UAAI,OACH,IAAI,MAAM,IAA4B,KACrC;AAAA,QACA,OAAO;AAAA,QACP,SAAS;AAAA,QACT,aAAa,OAAO;AAAA,QACpB,MAAM;AAAA,QACN,UAAU;AAAA,QACV,QAAQ;AAAA,MACT;AACD,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,WAAW;AAC7B,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,aAAa,MAAM;AAAA,YACnB,aAAa;AAAA,UACd;AAAA,QACD,WAAW,MAAM,SAAS,QAAQ;AACjC,iBAAO,EAAE,GAAG,MAAM,OAAO,QAAQ,SAAS,MAAM,SAAS,aAAa,OAAU;AAAA,QACjF,WAAW,MAAM,SAAS,WAAW;AACpC,iBAAO,EAAE,GAAG,MAAM,UAAU,KAAK,WAAW,EAAE;AAAA,QAC/C,WAAW,MAAM,SAAS,QAAQ;AACjC,iBAAO,EAAE,GAAG,MAAM,MAAM,KAAK,OAAO,EAAE;AAAA,QACvC,WAAW,MAAM,SAAS,WAAW;AACpC,iBAAO,EAAE,GAAG,MAAM,OAAO,UAAU;AAAA,QACpC,WAAW,MAAM,SAAS,UAAU;AACnC,iBAAO,EAAE,GAAG,MAAM,OAAO,SAAS;AAAA,QACnC,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,QAAQ,KAAK,SAAS;AAAA,YACtB,aAAa,MAAM;AAAA,UACpB;AAAA,QACD,WAAW,MAAM,SAAS,SAAS;AAClC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM,WAAW,KAAK;AAAA,YAC/B,QAAQ,KAAK,SAAS;AAAA,UACvB;AAAA,QACD,WAAW,MAAM,SAAS,aAAa;AACtC,iBAAO;AAAA,YACN,GAAG;AAAA,YACH,OAAO;AAAA,YACP,SAAS,MAAM;AAAA,YACf,QAAQ,KAAK,SAAS;AAAA,UACvB;AAAA,QACD;AAAA,MACD;AACA,UAAI,MAAM,IAAI,IAAI;AAClB,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;AAAA,IAC1B;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB;AAAA,EAC7D;AACA,QAAM,SAAS,MAAM;AAAA,IACpB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,WAAW,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,KAAK,CAAC,CAAC;AAAA,MACvD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,WAAW,SAAS,yBAAyB;AAAA,EAC7D;AACA,QAAM,WAAW,MAAM;AAAA,IACtB,CAAC,MAAM;AAAA,IACP,CAAC,QAAQ;AACR,iBAAW,OAAO,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AACzC,cAAM,QAAQ;AACd,YAAI,MAAM,SAAS,UAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,OAAO,CAAC,CAAC;AAAA,MACjE;AAAA,IACD;AAAA,IACA,EAAE,MAAM,GAAG,IAAI,aAAa,SAAS,2BAA2B;AAAA,EACjE;AACA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,MAAM,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IACvD,MAAM,CAAC,YACN,QAAQ,KAAK;AAAA,MACZ;AAAA,QACC;AAAA,QACA;AAAA,UACC,MAAM;AAAA,UACN,SACC,OAAO,YAAY,YAAY,mBAAmB,aAC/C,EAAE,MAAM,QAAQ,IAChB;AAAA,QACL;AAAA,MACD;AAAA,IACD,CAAC;AAAA,IACF,OAAO,CAAC,MAAM,WAAW,QAAQ,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,MAAM,OAAO,CAAC,CAAC,CAAC;AAAA,EAClF;AACD;AAQO,SAAS,iBACf,OACA,SACA,OAAgC,CAAC,GACR;AACzB,QAAM,OAAO,KAAK,QAAQ;AAC1B,QAAM,SAAS,KAAK,SAAS,YAAY;AACzC,QAAM,aAAa,oCAAoC,KAAK,UAAU;AACtE,QAAM,UAAU,MAAM,KAA8B,CAAC,GAAG,MAAM;AAAA,IAC7D,MAAM,GAAG,IAAI;AAAA,IACb,SAAS;AAAA,EACV,CAAC;AACD,QAAM,SAAS,0BAA0B,OAAO,SAAS,SAAS,MAAM,QAAQ,UAAU;AAC1F,SAAO,sBAAsB,OAAO,SAAS,QAAQ,MAAM,MAAM;AAClE;;;AC3mBA,SAAS,4BAA4B,QAAyD;AAC7F,QAAM,aAAa,QAAQ;AAC3B,MAAI,eAAe,OAAW,QAAO;AACrC,MAAI,CAAC,OAAO,UAAU,UAAU,KAAK,aAAa,GAAG;AACpD,UAAM,IAAI,WAAW,4DAA4D,UAAU,GAAG;AAAA,EAC/F;AACA,SAAO;AACR;AAOO,IAAM,gBAAN,MAAsD;AAAA,EAC3C;AAAA,EACA;AAAA,EACA,OAAoC,CAAC;AAAA,EACrC,OAAO,oBAAI,IAAO;AAAA,EAEnC,YAAY,QAAqC,SAAkC,OAAO,IAAI;AAC7F,SAAK,aAAa,4BAA4B,MAAM;AACpD,SAAK,SAAS;AAAA,EACf;AAAA,EAEA,IAAI,KAAuB;AAC1B,UAAM,QAAQ,KAAK,KAAK,UAAU,CAACC,WAAU,KAAK,OAAOA,OAAM,KAAK,GAAG,CAAC;AACxE,QAAI,QAAQ,EAAG,QAAO;AACtB,UAAM,CAAC,KAAK,IAAI,KAAK,KAAK,OAAO,OAAO,CAAC;AACzC,QAAI,UAAU,OAAW,QAAO;AAChC,SAAK,KAAK,KAAK,KAAK;AACpB,WAAO,MAAM;AAAA,EACd;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC3B,SAAK,YAAY,KAAK;AACtB,SAAK,KAAK,IAAI,KAAK;AACnB,QAAI,KAAK,eAAe,EAAG;AAC3B,SAAK,KAAK,KAAK,EAAE,KAAK,MAAM,CAAC;AAC7B,WAAO,KAAK,eAAe,UAAa,KAAK,KAAK,SAAS,KAAK,YAAY;AAC3E,WAAK,KAAK,MAAM;AAAA,IACjB;AAAA,EACD;AAAA,EAEA,YAAY,OAAgB;AAC3B,aAAS,IAAI,KAAK,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAClD,UAAI,KAAK,KAAK,CAAC,GAAG,UAAU,MAAO,MAAK,KAAK,OAAO,GAAG,CAAC;AAAA,IACzD;AACA,SAAK,KAAK,OAAO,KAAK;AAAA,EACvB;AAAA,EAEA,aAAmB;AAClB,eAAW,QAAQ,CAAC,GAAG,KAAK,IAAI,EAAG,MAAK,QAAQ;AAChD,SAAK,KAAK,SAAS;AACnB,SAAK,KAAK,MAAM;AAAA,EACjB;AACD;AAQO,SAAS,kBACf,aACA,MACqB;AACrB,QAAM,EAAE,YAAY,SAAS,OAAO,qBAAqB,MAAM,UAAU,IAAI;AAC7E,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAC5C,QAAM,QAAQ,OAAO,cAAc,EAAE,MAAM,QAAQ,QAAQ,CAAC;AAC5D,QAAM,YAAY,CAAC,QAAmB;AACrC,eAAW,UAAW,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoB;AAC9D,UAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,IAC5B;AAAA,EACD;AACA,QAAM,QAAQ,QACX,MAAM,KAAQ,CAAC,WAAW,GAAG,WAAW;AAAA,IACxC,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,yBAAyB,QAAQ;AAAA,IAC/C,SAAS;AAAA,EACV,CAAC,IACA,IAAI,KAAQ,CAAC,WAAW,GAAG,WAAW;AAAA,IACtC,GAAG;AAAA,IACH,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,SAAS;AAAA,EACV,CAAC;AAEH,QAAM,SAAS,uBAAO,OAAO,GAAG,IAAI,cAAc,GAAG,OAAO,WAAW;AACvE,QAAM,eAAe,CAAC,QAAmB;AACxC,QAAI;AACH,UAAI,KAAK,CAAC,CAAC,QAAQ,oBAAoB,CAAC,CAAC,CAAC;AAAA,IAC3C,SAAS,GAAG;AACX,UAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,GAAG,OAAO,+BAA+B,CAAC,CAAC,CAAC;AAAA,IACjF;AAAA,EACD;AACA,QAAM,WAAW,QACd,MAAM,KAAQ,CAAC,KAAsB,GAAG,cAAc;AAAA,IACtD,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,MAAM,EAAE,MAAM,4BAA4B,QAAQ;AAAA,IAClD,SAAS;AAAA,IACT;AAAA,EACD,CAAC,IACA,IAAI,KAAQ,CAAC,KAAsB,GAAG,cAAc;AAAA,IACpD,GAAG;AAAA,IACH,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,SAAS;AAAA,IACT;AAAA,EACD,CAAC;AAEH,MAAI,WAAW;AACf,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAgB;AACf,UAAI,SAAU;AACd,UAAI,OAAO;AACV,cAAM,QAAQ,EAAE,QAAQ,QAAQ,CAAC;AAAA,MAClC,OAAO;AACN,6BAAqB,KAAsB;AAC3C,6BAAqB,QAAyB;AAAA,MAC/C;AACA,iBAAW;AACX,kBAAY;AAAA,IACb;AAAA,EACD;AACD;AAOO,SAAS,eACf,SACA,SACA,OAA8B,CAAC,GAC/B,SACuB;AACvB,QAAM,EAAE,MAAM,YAAY,MAAM,IAAI;AACpC,QAAM,OAAoC,aAAa,EAAE,WAAW,IAAI,CAAC;AACzE,MAAI,UAAU;AAId,QAAM,QAAQ,QACX,MAAM,KAAQ,CAAC,GAAG,MAAM;AAAA,IACxB,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,oBAAoB,YAAY,QAAQ;AAAA,IACtD,GAAI,UAAU,EAAE,SAAS,EAAE,KAAK,QAAQ,UAAU,QAAQ,QAAQ,OAAO,EAAE,IAAI,CAAC;AAAA,EACjF,CAAC,IACA,IAAI,KAAQ,CAAC,GAAG,MAAM;AAAA,IACtB,GAAG;AAAA,IACH,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,EAChC,CAAC;AAOH,QAAM,SAAS,uBAAO,OAAO,GAAG,IAAI,cAAc,GAAG,OAAO,WAAW;AACvE,MAAI,mBAAmB,QAAQ;AAC/B,QAAM,SAAS,CAAC,QAAmB;AAClC,QAAI,IAAI,SAAS,UAAa,QAAQ,YAAY,iBAAkB;AACpE,uBAAmB,QAAQ;AAC3B,QAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,SAAS,CAAC,CAAC,CAAC;AAAA,EACxC;AACA,QAAM,WAAW,QACd,MAAM,KAAQ,CAAC,KAAsB,GAAG,QAAQ;AAAA,IAChD;AAAA,IACA,SAAS;AAAA,IACT,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,MAAM,EAAE,MAAM,uBAAuB,YAAY,QAAQ;AAAA,IACzD,GAAI,UAAU,EAAE,SAAS,EAAE,KAAK,QAAQ,aAAa,QAAQ,QAAQ,OAAO,EAAE,IAAI,CAAC;AAAA,EACpF,CAAC,IACA,IAAI,KAAQ,CAAC,KAAsB,GAAG,QAAQ;AAAA,IAC9C,GAAG;AAAA,IACH;AAAA,IACA,SAAS;AAAA,IACT,SAAS,GAAG,OAAO;AAAA,IACnB,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,EACnC,CAAC;AAEH,MAAI,YAAY,QAAW;AAC1B,oCAAgC,OAAwB,QAAQ,YAAY;AAAA,EAC7E;AAEA,WAAS,KAAK,QAAiB;AAG9B,UAAM,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,EAC9B;AAEA,WAAS,WAAc,KAAc,OAAuC;AAC3E,QAAI,UAAU;AACb,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAID,UAAM,KAAwB;AAAA,MAC7B,SAAS,GAAG,OAAO;AAAA,MACnB,MAAM,CAAC,QAAa;AACnB,cAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAI;AACH,cAAI,EAAG,YAAW,KAAK,EAAG,OAAM,CAAM;AAAA,QACvC,SAAS,GAAG;AACX,cAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,kCAAkC,CAAC,CAAC,CAAC;AAAA,QAC1E;AAAA,MACD;AAAA,IACD;AACA,UAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,MACxC,MAAM,OAAO,GAAG,IAAI,SAAS,SAAS,KAAK;AAAA,MAC3C,MAAM,EAAE,MAAM,0BAA0B,YAAY,QAAQ;AAAA,IAC7D,CAAC;AACD,WAAO,MAAM,OAAO,QAAQ,EAAE,QAAQ,GAAG,OAAO,cAAc,CAAC;AAAA,EAChE;AAEA,SAAO,EAAE,OAAO,UAAU,QAAQ,MAAM,WAAW;AACpD;;;AChPA,SAAS,OAAO,GAAY,GAAoB;AAC/C,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,KAAK,OAAO;AAClB,MACC,OAAO,OAAO,MACb,OAAO,YAAY,OAAO,YAAY,OAAO,aAAa,OAAO,WACjE;AACD,UAAM,KAAK;AACX,UAAM,KAAK;AACX,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAAA,EACrC;AACA,SAAO,OAAO,CAAC,EAAE,cAAc,OAAO,CAAC,CAAC;AACzC;AACA,SAAS,YAAkB,GAAmB,GAA2B;AACxE,QAAM,IAAI,OAAO,EAAE,WAAW,EAAE,SAAS;AACzC,SAAO,MAAM,IAAI,IAAI,OAAO,EAAE,SAAS,EAAE,OAAO;AACjD;AACA,SAAS,WAAiB,MAAiC,KAA6B;AACvF,MAAI,KAAK;AACT,MAAI,KAAK,KAAK;AACd,SAAO,KAAK,IAAI;AACf,UAAM,MAAO,KAAK,MAAO;AACzB,QAAI,YAAY,KAAK,GAAG,GAAqB,GAAG,IAAI,EAAG,MAAK,MAAM;AAAA,QAC7D,MAAK;AAAA,EACX;AACA,SAAO;AACR;AAGA,IAAM,eAAN,MAAyB;AAAA,EAChB,WAAW;AAAA,EACF,MAAwB,CAAC;AAAA,EACzB,QAAQ,oBAAI,IAAuB;AAAA,EACnC;AAAA,EAEjB,YAAY,UAAmB,cAAyC,CAAC,GAAG;AAC3E,SAAK,WAAW;AAChB,eAAW,OAAO,aAAa;AAC9B,WAAK,OAAO,IAAI,SAAS,IAAI,WAAW,IAAI,KAAK;AAAA,IAClD;AACA,SAAK,WAAW;AAAA,EACjB;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,OAAe;AAClB,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EACA,IAAI,SAAqB;AACxB,UAAM,MAAM,KAAK,MAAM,IAAI,OAAO;AAClC,QAAI,QAAQ,OAAW,QAAO;AAC9B,SAAK,SAAS,GAAG;AACjB,WAAO;AAAA,EACR;AAAA,EACA,IAAI,SAA2B;AAC9B,UAAM,MAAM,KAAK,MAAM,IAAI,OAAO;AAClC,QAAI,QAAQ,OAAW,QAAO;AAC9B,SAAK,SAAS,GAAG;AACjB,WAAO,IAAI;AAAA,EACZ;AAAA,EAEQ,SAAS,KAA2B;AAC3C,QAAI,CAAC,KAAK,SAAU;AACpB,SAAK,MAAM,OAAO,IAAI,OAAO;AAC7B,SAAK,MAAM,IAAI,IAAI,SAAS,GAAG;AAAA,EAChC;AAAA,EAEQ,UAAU,KAA2B;AAC5C,UAAM,QAAQ,WAAW,KAAK,KAAK,GAAG;AACtC,aACK,IAAI,OACR,IAAI,KAAK,IAAI,UAAU,YAAY,KAAK,IAAI,CAAC,GAAqB,GAAG,MAAM,GAC3E,KACC;AACD,UAAI,KAAK,IAAI,CAAC,MAAM,KAAK;AACxB,aAAK,IAAI,OAAO,GAAG,CAAC;AACpB;AAAA,MACD;AAAA,IACD;AACA,UAAM,WAAW,KAAK,IAAI,QAAQ,GAAG;AACrC,QAAI,YAAY,GAAG;AAClB,WAAK,IAAI,OAAO,UAAU,CAAC;AAC3B;AAAA,IACD;AACA,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACnE;AAAA,EAEA,OAAO,SAAY,WAAoB,OAAmB;AACzD,UAAM,WAAW,KAAK,MAAM,IAAI,OAAO;AACvC,UAAM,MAAsB,EAAE,SAAS,WAAW,MAAM;AACxD,QAAI,aAAa,QAAW;AAC3B,WAAK,UAAU,QAAQ;AACvB,WAAK,MAAM,OAAO,OAAO;AAAA,IAC1B;AACA,SAAK,IAAI,OAAO,WAAW,KAAK,KAAK,GAAG,GAAG,GAAG,GAAG;AACjD,SAAK,MAAM,IAAI,SAAS,GAAG;AAC3B,SAAK,YAAY;AACjB,WAAO,aAAa;AAAA,EACrB;AAAA,EAEA,OAAO,SAAqB;AAC3B,UAAM,WAAW,KAAK,MAAM,IAAI,OAAO;AACvC,QAAI,aAAa,OAAW,QAAO;AACnC,SAAK,UAAU,QAAQ;AACvB,SAAK,MAAM,OAAO,OAAO;AACzB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,QAAgB;AACf,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,IAAI,SAAS;AAClB,SAAK,MAAM,MAAM;AACjB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,eAAe,OAAU,KAAa;AACrC,QAAI,OAAO,OAAO,GAAG,KAAK,EAAG,QAAO,CAAC;AACrC,UAAM,OAAO,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC,EAAE;AAAA,MACtC,CAAC,CAAC,CAAC,MAAM,OAAO,GAAG,KAAK,KAAK,KAAK,OAAO,GAAG,GAAG,IAAI;AAAA,IACpD;AACA,SAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,OAAO,GAAG,CAAC,CAAC;AACpC,WAAO,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,KAAK;AAAA,EACnC;AAAA,EAEA,oBAAoB,OAAmC,SAAiC;AACvF,QAAI,YAAY,OAAW,QAAO;AAClC,QAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,YAAM,IAAI,WAAW,0DAA0D,OAAO,GAAG;AAC1F,UAAM,WAAW,KAAK,IAAI,SAAS;AACnC,QAAI,YAAY,EAAG,QAAO;AAE1B,YAAQ,OAAO;AAAA,MACd,KAAK,aAAa;AACjB,cAAM,MAAM,KAAK,IAAI,CAAC;AACtB,YAAI,QAAQ,OAAW,QAAO;AAC9B,aAAK,IAAI,MAAM;AACf,aAAK,MAAM,OAAO,IAAI,OAAO;AAC7B,aAAK,YAAY;AACjB,eAAO,IAAI;AAAA,MACZ;AAAA,MACA,KAAK,WAAW;AACf,YAAI;AACJ,mBAAW,OAAO,KAAK,MAAM,KAAK,GAAG;AACpC,cAAI,WAAW,UAAa,OAAO,KAAK,MAAM,IAAI,EAAG,UAAS;AAAA,QAC/D;AACA,YAAI,WAAW,OAAW,QAAO;AACjC,cAAM,MAAM,KAAK,MAAM,IAAI,MAAM;AACjC,YAAI,QAAQ,OAAW,MAAK,UAAU,GAAG;AACzC,aAAK,MAAM,OAAO,MAAM;AACxB,aAAK,YAAY;AACjB,eAAO;AAAA,MACR;AAAA,MACA,KAAK,OAAO;AACX,cAAM,SAAS,KAAK,MAAM,KAAK,EAAE,KAAK,EAAE;AACxC,YAAI,WAAW,OAAW,QAAO;AACjC,cAAM,MAAM,KAAK,MAAM,IAAI,MAAM;AACjC,YAAI,QAAQ,OAAW,MAAK,UAAU,GAAG;AACzC,aAAK,MAAM,OAAO,MAAM;AACxB,aAAK,YAAY;AACjB,eAAO;AAAA,MACR;AAAA,MACA,SAAS;AACR,cAAM,IAAI,MAAM,0CAA0C,OAAO,KAAK,CAAC,GAAG;AAAA,MAC3E;AAAA,IACD;AAAA,EACD;AAAA,EAEA,WAAsC;AACrC,WAAO,CAAC,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA,EACA,eAAkC;AACjC,UAAM,IAAI,oBAAI,IAAU;AACxB,eAAW,KAAK,KAAK,IAAK,GAAE,IAAI,EAAE,SAAS,EAAE,KAAK;AAClD,WAAO;AAAA,EACR;AACD;AAEA,SAAS,8BAA8B,MAAmD;AACzF,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACtC,UAAM,UAAU,IAAI;AACpB,QACC,YAAY,QACZ,OAAO,YAAY,YACnB,OAAO,YAAY,YACnB,OAAO,YAAY,WAClB;AACD;AAAA,IACD;AACA,UAAM,IAAI;AAAA,MACT,yCAAyC,CAAC;AAAA,IAC3C;AAAA,EACD;AACD;AAaO,SAAS,qCACf,aACA,UAAgC,CAAC,GACX;AACtB,SAAO,oBAAoB,SAAS,WAAW;AAChD;AAEA,SAAS,oBACR,UAAgC,CAAC,GACjC,cAAyC,CAAC,GACpB;AACtB,QAAM,EAAE,UAAU,OAAO,YAAY,KAAK,IAAI;AAC9C,QAAM,aAAa,UAAU,UAAU;AACvC,QAAM,UAAU,IAAI,aAAmB,YAAY,WAAW;AAC9D,QAAM,OAAqE;AAAA,IAC1E;AAAA,IACA;AAAA,IACA;AAAA,IACA,UAAU,UAAa,SAAS,UAAa,aAAa,SACvD;AAAA,MACA,UAAU;AAAA,MACV,aAAa;AAAA,MACb,cAAc,MAAM;AACnB,cAAM,OAAO,QAAQ,SAAS;AAC9B,sCAA8B,IAAI;AAClC,eAAO;AAAA,MACR;AAAA,IACD,IACC;AAAA,EACJ;AACA,QAAM,QAA2B,CAAC;AAClC,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAC5C,QAAM,WAAW,oBAAI,QAAuB;AAC5C,QAAM,YAAY,IAAI,cAGpB,QAAQ,WAAW,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC,QAAQ,IAAI,MAAM;AACxD,WAAO,OAAO,QAAQ,MAAM,MAAM,KAAK,OAAO,MAAM,IAAI,MAAM;AAAA,EAC/D,CAAC;AACD,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI;AACJ,MAAI;AACJ,MAAI,eAAe,MAAM;AAAA,EAAC;AAE1B,WAAS,UAAa,GAAsC;AAC3D,WAAO,aAAa;AAAA,EACrB;AAEA,WAAS,gBAAgB,GAAmB;AAC3C,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI,WAAW,0DAA0D,CAAC,GAAG;AACpF,WAAO;AAAA,EACR;AAEA,WAAS,kBAAwB;AAChC,QAAI,yBAAyB,OAAW;AACxC,eAAS;AACR,YAAM,UAAU,QAAQ,oBAAoB,sBAAsB,cAAc;AAChF,UAAI,YAAY,OAAW;AAC3B,WAAK,KAAK,EAAE,MAAM,UAAU,QAAQ,CAAC;AAAA,IACtC;AAAA,EACD;AAEA,QAAM,YAAY,CAAC,QAAmB;AACrC,UAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,QAAQ,gBAAgB;AAC3B,cAAM,SAAS,UAAU,KAAK,CAAC;AAC/B,YAAI,WAAW,OAAW,kBAAiB,gBAAgB,MAAgB;AAC3E;AAAA,MACD;AACA,UAAI,OAAO,SAAS,IAAI,GAAG,GAAG;AAC7B,mBAAW,KAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAIjC;AACJ,kBAAQ,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK;AAC9C,eAAK,KAAK,EAAE,MAAM,UAAU,SAAS,EAAE,SAAS,WAAW,EAAE,WAAW,OAAO,EAAE,MAAM,CAAC;AACxF,0BAAgB;AAAA,QACjB;AAAA,MACD;AAAA,IACD;AACA,oBAAgB;AAAA,EACjB;AAEA,WAAS,cAAuC;AAC/C,QAAI,UAAU,OAAW,QAAO;AAChC,UAAM,KAA2C;AAAA,MAChD,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM,EAAE,SAAS,KAAK;AAAA,IACvB;AACA,UAAM,OAAO,iBAAiB,CAAC,cAA+B,IAAI,CAAC;AACnE,YAAQ,QACL,MAAM,SAAS,IAAI,MAAM;AAAA,MACzB,MAAM,OAAO,GAAG,IAAI,oBAAoB;AAAA,MACxC,MAAM,EAAE,MAAM,2BAA2B,YAAY,gBAAgB;AAAA,IACtE,CAAC,IACA,IAAI,KAAwB,MAAM,GAAG,MAAM;AAAA,MAC3C,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS;AAAA,MACT,MAAM,OAAO,GAAG,IAAI,oBAAoB;AAAA,IACzC,CAAC;AACH,mBAAe,QACZ,MAAM,OAAO,OAAO,EAAE,QAAQ,+BAA+B,CAAC,IAC9D,MAAM,UAAU,MAAM;AAAA,IAAC,CAAC;AAC3B,WAAO;AAAA,EACR;AAEA,MAAI;AACJ,QAAM,uBAA+D,UAAU;AAC/E,MAAI,aAAa,QAAW;AAC3B,QACC,yBAAyB,eACzB,yBAAyB,aACzB,yBAAyB,OACxB;AACD,YAAM,IAAI,MAAM,0EAA0E;AAAA,IAC3F;AAEA,UAAM,UAAU,SAAS;AACzB,QAAI,UAAU,OAAO,KAAK,UAAU,QAAW;AAC9C,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AAAA,IACD;AAEA,qBAAiB,UAAU,OAAO,IAC/B,UACA,QACC,MAAM;AAAA,MACN;AAAA,QACC,SAAS;AAAA,QACT,MAAM,MAAM;AAAA,QAAC;AAAA,QACb,MAAM,EAAE,SAAS,gBAAgB,OAAO,EAAE;AAAA,MAC3C;AAAA,MACA,CAAC;AAAA,MACD;AAAA,QACC,MAAM,OAAO,GAAG,IAAI,mBAAmB;AAAA,QACvC,MAAM,EAAE,MAAM,qBAAqB,YAAY,iBAAiB,QAAQ,UAAU;AAAA,MACnF;AAAA,IACD,IACC;AAEJ,QAAI,CAAC,UAAU,OAAO,EAAG,kBAAiB,gBAAgB,OAAO;AAEjE,QAAI,0BAA0B,KAAM,aAAY;AAAA,EACjD;AAIA,MAAI;AACJ,WAAS,eAAwC;AAChD,QAAI,kBAAkB,QAAW;AAChC,sBAAgB;AAAA,QACf,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AAGb,cAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,aAAa,CAAC,CAAC,CAAC;AAAA,QAC5C;AAAA,QACA,EAAE,SAAS,2BAA2B,SAAS,KAAK;AAAA,MACrD;AAAA,IACD;AACA,WAAO;AAAA,EACR;AAEA,WAAS,SAAS,OAAU,KAAuD;AAClF,UAAM,MAAM,CAAC,OAAO,GAAG;AACvB,UAAM,MAAM,UAAU,IAAI,GAAG;AAC7B,QAAI,QAAQ,OAAW,QAAO;AAC9B,UAAM,cAAc,MAAoB,QAAQ,eAAe,OAAO,GAAG;AACzE,QAAI;AACJ,WAAO,kBAAmD,KAAK,OAAwB;AAAA,MACtF,GAAG;AAAA,MACH,SAAS;AAAA,MACT,MAAM,OAAO,GAAG,IAAI,UAAU,UAAU,KAAK;AAAA,MAC7C,qBAAqB;AAAA,MACrB,WAAW,MAAM;AAChB,kBAAU,YAAY,IAAI;AAAA,MAC3B;AAAA,IACD,CAAC;AACD,cAAU,IAAI,KAAK,IAAI;AACvB,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IAEb,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,IAAI,SAAqB;AACxB,aAAO,QAAQ,IAAI,OAAO;AAAA,IAC3B;AAAA,IACA,IAAI,SAA2B;AAC9B,aAAO,QAAQ,IAAI,OAAO;AAAA,IAC3B;AAAA,IACA,eAAe,OAAU,KAAa;AACrC,aAAO,QAAQ,eAAe,OAAO,GAAG;AAAA,IACzC;AAAA,IACA,MAAM,OAAU,KAAuD;AACtE,aAAO,SAAS,OAAO,GAAG;AAAA,IAC3B;AAAA,IACA,UAAqC;AACpC,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IACA,eAAkC;AACjC,aAAO,QAAQ,aAAa;AAAA,IAC7B;AAAA,IACA,IAAI,YAAqC;AACxC,aAAO,aAAa;AAAA,IACrB;AAAA,IAEA,OAAO,SAAY,WAAoB,OAAmB;AACzD,YAAM,WAAW,QAAQ,OAAO,SAAS,WAAW,KAAK;AACzD,WAAK,KAAK,EAAE,MAAM,UAAU,SAAS,WAAW,MAAM,CAAC;AACvD,sBAAgB;AAChB,aAAO;AAAA,IACR;AAAA,IACA,WAAW,MAAoE;AAC9E,iBAAW,KAAK,MAAM;AACrB,gBAAQ,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK;AAC9C,aAAK,KAAK,EAAE,MAAM,UAAU,SAAS,EAAE,SAAS,WAAW,EAAE,WAAW,OAAO,EAAE,MAAM,CAAC;AACxF,wBAAgB;AAAA,MACjB;AAAA,IACD;AAAA,IACA,OAAO,SAAkB;AACxB,UAAI,QAAQ,OAAO,OAAO,EAAG,MAAK,KAAK,EAAE,MAAM,UAAU,QAAQ,CAAC;AAAA,IACnE;AAAA,IACA,WAAW,WAA8B;AACxC,YAAM,UAAe,CAAC;AACtB,iBAAW,KAAK,UAAW,KAAI,QAAQ,OAAO,CAAC,EAAG,SAAQ,KAAK,CAAC;AAChE,UAAI,QAAQ,SAAS,EAAG,MAAK,KAAK,EAAE,MAAM,cAAc,WAAW,QAAQ,CAAC;AAAA,IAC7E;AAAA,IACA,QAAc;AACb,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,MAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD;AAAA,IAEA,WAAW,KAAqE;AAC/E,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,YAAM,KAGF;AAAA,QACH,SAAS;AAAA,QACT,MAAM,CAAC,QAAa;AACnB,cAAI;AACH,uBAAW,KAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAIjC;AACJ,kBAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,YACvB;AAAA,UACD,SAAS,GAAG;AACX,gBAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,iCAAiC,CAAC,CAAC,CAAC;AAAA,UACzE;AAAA,QACD;AAAA,MACD;AACA,YAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,QACxC,MAAM,OAAO,GAAG,IAAI,SAAS,SAAS,KAAK;AAAA,QAC3C,MAAM,EAAE,MAAM,0BAA0B,YAAY,gBAAgB;AAAA,MACrE,CAAC;AACD,eAAS,IAAI,MAAuB;AACpC,YAAM,YAAY,YAAY;AAC9B,gBAAU,aAAa,QAAyB,SAAS;AACzD,UAAIC,UAAS;AACb,YAAM,UAAU,MAAM;AACrB,YAAI,CAACA,QAAQ;AACb,QAAAA,UAAS;AACT,kBAAU,eAAe,QAAyB,SAAS;AAAA,MAC5D;AACA,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,mBAAa;AACb,gBAAU,WAAW;AAAA,IACtB;AAAA,EACD;AACD;;;ACjkBO,IAAM,eAAN,MAAmB;AAAA,EAChB;AAAA,EAET,YAAY,UAAoC,CAAC,GAAG;AACnD,SAAK,OAAO,CAAC,GAAG,OAAO;AAAA,EACxB;AAAA,EAEA,IAAOC,OAA4C;AAClD,QAAIA,UAAS,OAAW,QAAO,oBAAuB;AACtD,UAAM,QAAQ,KAAK,KAAK,KAAKA,KAAqB,IAAI;AACtD,WAAO,aAAgB,KAAK;AAAA,EAC7B;AACD;AAEA,SAAS,sBAA0C;AAClD,SAAO;AAAA,IACN,OAAO;AAAA,IACP,MAAM,CAAC,MAAM,YAAY;AAAA,EAC1B;AACD;AAEA,SAAS,aAAgB,OAAgC;AACxD,SAAO;AAAA,IACN;AAAA,IACA,KAAK,KAAK,SAAS;AAClB,YAAM,SAAS,UAAU,KAAK,KAAK;AACnC,aAAO,WAAW,SAAY,UAAW;AAAA,IAC1C;AAAA,EACD;AACD;AAMO,SAAS,QAAW,MAAsC;AAChE,SAAO;AAAA,IACN,MAAM,MAAM;AAAA,EACb;AACD;AAYO,SAAS,iBACf,OACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,2CAA2C,OAAO,GAAG;AAE3E,QAAM,OAAO,UAAU,SAAS,OAAO,OAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,SAAS;AACpF,MAAI,SAAS,OAAW,OAAM,IAAI,MAAM,wDAAwD;AAChG,QAAM,WAAW,OAAO;AACxB,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,MAAI,MAAM,QAAQ,KAAK,KAAK,EAAE,UAAU,QAAS,QAAO,MAAM,OAAO,GAAG,QAAQ;AAEhF,QAAM,UAAe,CAAC;AACtB,aAAW,QAAQ,OAAO;AACzB,YAAQ,KAAK,IAAI;AACjB,QAAI,QAAQ,WAAW,SAAU;AAAA,EAClC;AACA,SAAO;AACR;AAcO,SAAS,YAAkC;AACjD,SAAO,IAAI,gBAAmB;AAC/B;AAEA,IAAM,kBAAN,MAAsD;AAAA,EACpC,QAA4B,CAAC;AAAA,EAE9C,IAAI,OAAe;AAClB,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,KAAK,MAA8B;AAClC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,GAAG,KAAK,MAAM,SAAS,CAAC;AAAA,EAC9B;AAAA,EAEA,OAAqC;AACpC,WAAO,KAAK,MAAM,CAAC;AAAA,EACpB;AAAA,EAEA,MAAoC;AACnC,UAAM,MAAM,KAAK,MAAM,CAAC;AACxB,UAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,QAAI,QAAQ,UAAa,SAAS,UAAa,KAAK,MAAM,SAAS,GAAG;AACrE,WAAK,MAAM,CAAC,IAAI;AAChB,WAAK,KAAK,CAAC;AAAA,IACZ;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,GAAG,GAAiB;AAC3B,WAAO,IAAI,GAAG;AACb,YAAM,IAAK,IAAI,KAAM;AACrB,UACE,KAAK,MAAM,CAAC,EAAuB,aACnC,KAAK,MAAM,CAAC,EAAuB;AAEpC;AACD,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI;AAAA,QAChC,KAAK,MAAM,CAAC;AAAA,QACZ,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,KAAK,GAAiB;AAC7B,eAAS;AACR,YAAM,OAAO,IAAI,IAAI;AACrB,YAAM,QAAQ,OAAO;AACrB,UAAI,WAAW;AACf,UAAI,OAAO,KAAK,MAAM,UAAU,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,QAAQ;AAC7E,mBAAW;AACZ,UAAI,QAAQ,KAAK,MAAM,UAAU,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,QAAQ;AAC/E,mBAAW;AACZ,UAAI,aAAa,EAAG;AACpB,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC,IAAI;AAAA,QACvC,KAAK,MAAM,QAAQ;AAAA,QACnB,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,UAAU,GAAmB;AACpC,WAAQ,KAAK,MAAM,CAAC,EAAuB;AAAA,EAC5C;AACD;AAWO,SAAS,uBACf,eACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,yDAAyD,OAAO,GAAG;AACzF,QAAM,WAAW,cAAc,SAAS;AACxC,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,SAAO,cACL,IAAI,CAAC,MAAM,UAAU;AACrB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK;AAC9B,YAAM,IAAI,WAAW,uCAAuC,KAAK,KAAK,GAAG;AAC1E,WAAO,EAAE,GAAG,MAAM,MAAM;AAAA,EACzB,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,MAAM,GAAG,QAAQ,EACjB,IAAI,CAAC,SAAS,KAAK,KAAK;AAC3B;;;AC5IA,IAAM,cAAN,MAAqB;AAAA,EACZ,WAAW;AAAA,EACF;AAAA,EAEjB,YAAY,SAAwB,SAAkB;AACrD,SAAK,MAAM,UAAU,CAAC,GAAG,OAAO,IAAI,CAAC;AACrC,qBAAiB,KAAK,KAAK,EAAE,QAAQ,CAAC;AAAA,EACvC;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAI,OAAe;AAClB,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EAEA,GAAG,OAA8B;AAChC,QAAI,CAAC,OAAO,UAAU,KAAK,EAAG,QAAO;AACrC,UAAM,IAAI,SAAS,IAAI,QAAQ,KAAK,IAAI,SAAS;AACjD,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI,SAAS,SAAY,KAAK,IAAI,CAAC;AAAA,EAC9D;AAAA,EAEA,WAAyB;AACxB,WAAO,CAAC,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA,EAEA,OAAO,OAAgB;AACtB,SAAK,IAAI,KAAK,KAAK;AACnB,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,WAAW,QAA4B;AACtC,QAAI,OAAO,WAAW,EAAG;AACzB,eAAW,KAAK,OAAQ,MAAK,IAAI,KAAK,CAAC;AACvC,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,OAAO,OAAe,OAAgB;AACrC,QAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI;AAC7D,YAAM,IAAI,WAAW,iBAAiB,KAAK,qBAAqB,KAAK,IAAI,MAAM,GAAG;AACnF,SAAK,IAAI,OAAO,OAAO,GAAG,KAAK;AAC/B,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,WAAW,OAAe,QAA4B;AACrD,QAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,KAAK,IAAI;AAC7D,YAAM,IAAI,WAAW,qBAAqB,KAAK,qBAAqB,KAAK,IAAI,MAAM,GAAG;AACvF,QAAI,OAAO,WAAW,EAAG;AACzB,SAAK,IAAI,OAAO,OAAO,GAAG,GAAG,MAAM;AACnC,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,IAAI,OAAkB;AACrB,QAAI,KAAK,IAAI,WAAW,EAAG,OAAM,IAAI,WAAW,qBAAqB;AACrE,QAAI,CAAC,OAAO,UAAU,KAAK,EAAG,OAAM,IAAI,WAAW,cAAc,KAAK,qBAAqB;AAC3F,UAAM,IAAI,SAAS,IAAI,QAAQ,KAAK,IAAI,SAAS;AACjD,QAAI,IAAI,KAAK,KAAK,KAAK,IAAI,OAAQ,OAAM,IAAI,WAAW,cAAc,KAAK,eAAe;AAC1F,UAAM,CAAC,CAAC,IAAI,KAAK,IAAI,OAAO,GAAG,CAAC;AAChC,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,QAAgB;AACf,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,IAAI,SAAS;AAClB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,eAAe,SAA0B;AACxC,UAAM,UAAU,iBAAiB,KAAK,KAAK,EAAE,QAAQ,CAAC,EAAE;AACxD,QAAI,UAAU,EAAG,MAAK,YAAY;AAClC,WAAO;AAAA,EACR;AACD;AAqBO,SAAS,aACf,SACA,UAA+B,CAAC,GACd;AAClB,QAAM,EAAE,SAAS,OAAO,WAAW,IAAI;AACvC,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAE5C,WAAS,UAAU,GAA2D;AAC7E,WAAO,aAAa;AAAA,EACrB;AAEA,WAAS,gBAAgB,GAAmB;AAC3C,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI,WAAW,yDAAyD,CAAC,GAAG;AACnF,WAAO;AAAA,EACR;AAEA,QAAM,iBAAiB,UAAU,OAAO,IAAI,SAAY;AACxD,QAAM,UAAU,IAAI;AAAA,IACnB;AAAA,IACA,mBAAmB,SAAY,SAAY,gBAAgB,cAAc;AAAA,EAC1E;AACA,QAAM,aAAa,UAAU,UAAa,QAAQ,SAAS,UAAa,YAAY;AACpF,QAAM,OAAoD;AAAA,IACzD;AAAA,IACA;AAAA,IACA;AAAA,IACA,aACG;AAAA,MACA,UAAU;AAAA,MACV,aAAa;AAAA,MACb,cAAc,MAAM,QAAQ,SAAS;AAAA,IACtC,IACC;AAAA,EACJ;AACA,QAAM,QAA2B,CAAC;AAClC,QAAM,WAAW,oBAAI,QAAuB;AAC5C,MAAI,UAAU;AACd,MAAI;AACJ,MAAI;AACJ,MAAI,eAAe,MAAM;AAAA,EAAC;AAC1B,MAAI,iBAAiB;AAErB,WAAS,YAAY,GAAiB;AACrC,QAAI,IAAI,EAAG,MAAK,KAAK,EAAE,MAAM,YAAY,EAAE,CAAC;AAAA,EAC7C;AAEA,WAAS,kBAAwB;AAChC,gBAAY,QAAQ,eAAe,cAAc,CAAC;AAAA,EACnD;AAEA,QAAM,YAAY,CAAC,QAAmB;AACrC,UAAM,OAAO,OAAO,QAAQ,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,QAAQ,gBAAgB;AAC3B,cAAM,SAAS,UAAU,KAAK,CAAC;AAC/B,YAAI,WAAW,OAAW,kBAAiB,gBAAgB,MAAgB;AAC3E;AAAA,MACD;AACA,UAAI,OAAO,SAAS,IAAI,GAAG,GAAG;AAC7B,mBAAW,SAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoB;AAC7D,kBAAQ,OAAO,KAAK;AACpB,eAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AACnC,0BAAgB;AAAA,QACjB;AAAA,MACD;AAAA,IACD;AACA,oBAAgB;AAAA,EACjB;AAEA,WAAS,cAAmC;AAC3C,QAAI,UAAU,OAAW,QAAO;AAChC,UAAM,KAAuC;AAAA,MAC5C,SAAS;AAAA,MACT,MAAM;AAAA,MACN,MAAM,EAAE,SAAS,KAAK;AAAA,IACvB;AACA,UAAM,OAAO,iBAAiB,CAAC,cAA+B,IAAI,CAAC;AACnE,YAAQ,QACL,MAAM,SAAS,IAAI,MAAM;AAAA,MACzB,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,oBAAoB;AAAA,MACxD,MAAM,EAAE,MAAM,2BAA2B,YAAY,eAAe;AAAA,IACrE,CAAC,IACA,IAAI,KAAoB,MAAM,GAAG,MAAM;AAAA,MACvC,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS;AAAA,MACT,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,oBAAoB;AAAA,IACzD,CAAC;AACH,mBAAe,QACZ,MAAM,OAAO,OAAO,EAAE,QAAQ,8BAA8B,CAAC,IAC7D,MAAM,UAAU,MAAM;AAAA,IAAC,CAAC;AAC3B,WAAO;AAAA,EACR;AAEA,WAAS,gBAAgB,OAA6B;AACrD,UAAM,KAA8B;AAAA,MACnC,SAAS;AAAA,MACT,MAAM,MAAM;AAAA,MAAC;AAAA,MACb,MAAM,EAAE,SAAS,MAAM;AAAA,IACxB;AACA,QAAI,OAAO;AACV,aAAO,MAAM,SAAS,IAAI,CAAC,GAAG;AAAA,QAC7B,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,mBAAmB;AAAA,QACvD,MAAM,EAAE,MAAM,qBAAqB,YAAY,gBAAgB,QAAQ,UAAU;AAAA,MAClF,CAAC;AAAA,IACF;AACA,WAAO,IAAI,KAAa,CAAC,GAAG,MAAM;AAAA,MACjC,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS;AAAA,MACT,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,mBAAmB;AAAA,IACxD,CAAC;AAAA,EACF;AAEA,MAAI,YAAY,QAAW;AAC1B,QAAI,UAAU,OAAO,KAAK,UAAU;AACnC,YAAM,IAAI;AAAA,QACT;AAAA,MACD;AACD,qBAAiB,UAAU,OAAO,IAC/B,UACA,QACC,gBAAgB,gBAAgB,OAAO,CAAC,IACxC;AACJ,QAAI,mBAAmB,OAAW,aAAY;AAAA,EAC/C;AAEA,SAAO;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IAEb,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,GAAG,OAA8B;AAChC,aAAO,QAAQ,GAAG,KAAK;AAAA,IACxB;AAAA,IACA,UAAwB;AACvB,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IAEA,OAAO,OAAgB;AACtB,cAAQ,OAAO,KAAK;AACpB,WAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AACnC,sBAAgB;AAAA,IACjB;AAAA,IACA,WAAW,QAA4B;AACtC,UAAI,OAAO,WAAW,EAAG;AACzB,YAAM,OAAO,CAAC,GAAG,MAAM;AACvB,cAAQ,WAAW,IAAI;AACvB,WAAK,KAAK,EAAE,MAAM,cAAc,QAAQ,KAAK,CAAC;AAC9C,sBAAgB;AAAA,IACjB;AAAA,IACA,OAAO,OAAe,OAAgB;AACrC,cAAQ,OAAO,OAAO,KAAK;AAC3B,WAAK,KAAK,EAAE,MAAM,UAAU,OAAO,MAAM,CAAC;AAC1C,sBAAgB;AAAA,IACjB;AAAA,IACA,WAAW,OAAe,QAA4B;AACrD,UAAI,OAAO,WAAW,GAAG;AAExB,gBAAQ,WAAW,OAAO,MAAM;AAChC;AAAA,MACD;AACA,YAAM,OAAO,CAAC,GAAG,MAAM;AACvB,cAAQ,WAAW,OAAO,IAAI;AAC9B,WAAK,KAAK,EAAE,MAAM,cAAc,OAAO,QAAQ,KAAK,CAAC;AACrD,sBAAgB;AAAA,IACjB;AAAA,IACA,IAAI,QAAQ,IAAO;AAClB,YAAM,WAAW,QAAQ,IAAI,QAAQ,OAAO,QAAQ;AACpD,YAAM,QAAQ,QAAQ,IAAI,KAAK;AAC/B,WAAK,KAAK,EAAE,MAAM,OAAO,OAAO,UAAU,MAAM,CAAC;AACjD,aAAO;AAAA,IACR;AAAA,IACA,QAAc;AACb,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,MAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD;AAAA,IAEA,WAAW,KAA0B;AACpC,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,YAAM,KAAqB;AAAA,QAC1B,SAAS;AAAA,QACT,MAAM,CAAC,QAAa;AACnB,cAAI;AACH,uBAAW,SAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoB;AAC7D,kBAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,YAC3B;AAAA,UACD,SAAS,GAAG;AACX,gBAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,gCAAgC,CAAC,CAAC,CAAC;AAAA,UACxE;AAAA,QACD;AAAA,MACD;AACA,YAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,QACxC,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,SAAS,SAAS,KAAK;AAAA,QAC3D,MAAM,EAAE,MAAM,0BAA0B,YAAY,eAAe;AAAA,MACpE,CAAC;AACD,eAAS,IAAI,MAAuB;AACpC,YAAM,YAAY,YAAY;AAC9B,gBAAU,aAAa,QAAyB,SAAS;AACzD,UAAIC,UAAS;AACb,YAAM,UAAU,MAAM;AACrB,YAAI,CAACA,QAAQ;AACb,QAAAA,UAAS;AACT,kBAAU,eAAe,QAAyB,SAAS;AAAA,MAC5D;AACA,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,mBAAa;AAAA,IACd;AAAA,EACD;AACD;;;ACrSA,IAAM,aAAN,MAAoB;AAAA,EACX,WAAW;AAAA,EACX;AAAA,EACS;AAAA,EAEjB,YAAY,SAAwB,SAAkB;AACrD,QAAI,YAAY,UAAa,UAAU;AACtC,YAAM,IAAI,WAAW,mCAAmC;AACzD,SAAK,UAAU;AACf,SAAK,MAAM,UAAU,CAAC,GAAG,OAAO,IAAI,CAAC;AACrC,qBAAiB,KAAK,KAAK,EAAE,QAAQ,CAAC;AAAA,EACvC;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EACA,IAAI,OAAe;AAClB,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EACA,GAAG,OAA8B;AAChC,QAAI,CAAC,OAAO,UAAU,KAAK,EAAG,QAAO;AACrC,UAAM,IAAI,SAAS,IAAI,QAAQ,KAAK,IAAI,SAAS;AACjD,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI,SAAS,SAAY,KAAK,IAAI,CAAC;AAAA,EAC9D;AAAA,EACA,WAAyB;AACxB,WAAO,CAAC,GAAG,KAAK,GAAG;AAAA,EACpB;AAAA,EAEA,OAAO,OAAgB;AACtB,SAAK,IAAI,KAAK,KAAK;AACnB,qBAAiB,KAAK,KAAK,EAAE,SAAS,KAAK,QAAQ,CAAC;AACpD,SAAK,YAAY;AAAA,EAClB;AAAA,EACA,WAAW,QAA4B;AACtC,QAAI,OAAO,WAAW,EAAG;AACzB,eAAW,KAAK,OAAQ,MAAK,IAAI,KAAK,CAAC;AACvC,qBAAiB,KAAK,KAAK,EAAE,SAAS,KAAK,QAAQ,CAAC;AACpD,SAAK,YAAY;AAAA,EAClB;AAAA,EACA,QAAgB;AACf,UAAM,IAAI,KAAK,IAAI;AACnB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,IAAI,SAAS;AAClB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EACA,SAAS,GAAmB;AAC3B,QAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AAC/B,YAAM,IAAI,WAAW,mDAAmD,CAAC,GAAG;AAC7E,QAAI,MAAM,KAAK,KAAK,IAAI,WAAW,EAAG,QAAO;AAC7C,UAAM,UAAU,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM;AAC3C,SAAK,IAAI,OAAO,GAAG,OAAO;AAC1B,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AACD;AAEA,SAAS,gBAAmB,OAAU,KAAmB;AAExD,MAAI,UAAU;AACb,UAAM,IAAI;AAAA,MACT,GAAG,GAAG;AAAA,IACP;AACF;AAMO,SAAS,YACf,SACA,UAA8B,CAAC,GACd;AACjB,QAAM,EAAE,SAAS,WAAW,GAAG,SAAS,IAAI;AAC5C,QAAM,OAAO,SAAS,aAAa,EAAE,YAAY,SAAS,WAAW,IAAI,CAAC;AAC1E,QAAM,UAAU,IAAI,WAAc,SAAS,OAAO;AAClD,QAAM,gBACL,SAAS,UAAU,UAAa,SAAS,SAAS,SAC9C;AAAA,IACD,GAAI,YAAY,SAAY,EAAE,QAAQ,IAAI,CAAC;AAAA,EAC5C,IACC;AACJ,QAAM,OAAmD;AAAA,IACxD;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB,SACf;AAAA,MACA,UAAU;AAAA,MACV,aAAa;AAAA,MACb,QAAQ;AAAA,MACR,cAAc,MAAM,QAAQ,SAAS;AAAA,IACtC,IACC;AAAA,EACJ;AACA,QAAM,QAA2B,CAAC;AAClC,QAAM,WAAW,oBAAI,IAAgC;AACrD,QAAM,YAAY,oBAAI,IAAgC;AACtD,QAAM,WAAW,IAAI,cAAgE,SAAS;AAC9F,MAAI,UAAU;AAEd,SAAO;AAAA,IACN,OAAO,KAAK;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ,KAAK;AAAA,IAEb,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,GAAG,OAA8B;AAChC,aAAO,QAAQ,GAAG,KAAK;AAAA,IACxB;AAAA,IACA,UAAwB;AACvB,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IAEA,OAAO,OAAgB;AACtB,sBAAgB,OAAO,oBAAoB;AAC3C,cAAQ,OAAO,KAAK;AACpB,WAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AAAA,IACpC;AAAA,IACA,WAAW,QAA4B;AACtC,UAAI,OAAO,WAAW,EAAG;AACzB,iBAAW,KAAK,OAAQ,iBAAgB,GAAG,wBAAwB;AACnE,YAAM,OAAO,CAAC,GAAG,MAAM;AACvB,cAAQ,WAAW,IAAI;AACvB,WAAK,KAAK,EAAE,MAAM,cAAc,QAAQ,KAAK,CAAC;AAAA,IAC/C;AAAA,IACA,QAAc;AACb,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,MAAK,KAAK,EAAE,MAAM,SAAS,MAAM,CAAC;AAAA,IAClD;AAAA,IACA,SAAS,GAAiB;AACzB,YAAM,UAAU,QAAQ,SAAS,CAAC;AAClC,UAAI,UAAU,EAAG,MAAK,KAAK,EAAE,MAAM,YAAY,GAAG,QAAQ,CAAC;AAAA,IAC5D;AAAA,IAEA,KAAK,GAA+B;AACnC,UAAI,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AAC/B,cAAM,IAAI,WAAW,+CAA+C,CAAC,GAAG;AACzE,YAAM,MAAM,SAAS,IAAI,CAAC;AAC1B,UAAI,QAAQ,OAAW,QAAO;AAI9B,YAAM,QAAQ;AAAA,QACb,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AACb,gBAAM,MAAM,QAAQ,SAAS;AAC7B,cAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,IAAI,CAAC,IAAI,IAAI,MAAM,KAAK,IAAI,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,QAC3E;AAAA,QACA,EAAE,GAAG,MAAM,SAAS,oBAAoB,SAAS,KAAK;AAAA,MACvD;AACA,eAAS,IAAI,GAAG,KAAK;AACrB,aAAO;AAAA,IACR;AAAA,IAEA,MAAM,OAAe,MAAmC;AACvD,UAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC1C,cAAM,IAAI,WAAW,oDAAoD,KAAK,GAAG;AAAA,MAClF;AACA,UAAI,SAAS,WAAc,CAAC,OAAO,UAAU,IAAI,KAAK,OAAO,IAAI;AAChE,cAAM,IAAI,WAAW,mDAAmD,IAAI,GAAG;AAAA,MAChF;AACA,YAAM,MAAM,GAAG,KAAK,IAAI,QAAQ,EAAE;AAClC,YAAM,MAAM,UAAU,IAAI,GAAG;AAC7B,UAAI,QAAQ,OAAW,QAAO;AAG9B,YAAM,QAAQ;AAAA,QACb,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AACb,cAAI,KAAK,CAAC,CAAC,QAAQ,QAAQ,SAAS,EAAE,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AAAA,QAC3D;AAAA,QACA,EAAE,GAAG,MAAM,SAAS,qBAAqB,SAAS,KAAK;AAAA,MACxD;AACA,gBAAU,IAAI,KAAK,KAAK;AACxB,aAAO;AAAA,IACR;AAAA,IAEA,KAAK,QAAgB,OAAyD;AAC7E,UAAI,CAAC,OAAO,UAAU,MAAM,KAAK,SAAS,GAAG;AAC5C,cAAM,IAAI,WAAW,oDAAoD,MAAM,GAAG;AAAA,MACnF;AACA,UAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC1C,cAAM,IAAI,WAAW,mDAAmD,KAAK,GAAG;AAAA,MACjF;AACA,YAAM,MAAM,GAAG,MAAM,IAAI,KAAK;AAC9B,YAAM,MAAM,SAAS,IAAI,GAAG;AAC5B,UAAI,QAAQ,OAAW,QAAO;AAC9B,YAAM,cAAc,MAAoB,QAAQ,SAAS,EAAE,MAAM,QAAQ,SAAS,KAAK;AACvF,UAAI;AACJ,aAAO,kBAA8C,KAAK,OAAwB;AAAA,QACjF,GAAG;AAAA,QACH,SAAS;AAAA,QACT,MAAM,SAAS,OAAO,GAAG,SAAS,IAAI,SAAS,SAAS,KAAK;AAAA,QAC7D,qBAAqB;AAAA,QACrB,WAAW,MAAM;AAChB,mBAAS,YAAY,IAAI;AAAA,QAC1B;AAAA,MACD,CAAC;AACD,eAAS,IAAI,KAAK,IAAI;AACtB,aAAO;AAAA,IACR;AAAA,IAEA,KAAQC,UAAY,MAAwC;AAG3D,aAAO;AAAA,QACN,CAAC,KAAK,KAAsB;AAAA,QAC5B,CAAC,QAAa;AACb,gBAAM,KAAK,IAAI,MAAM,IAAmC,KAAK;AAAA,YAC5D,KAAKA;AAAA,YACL,WAAW;AAAA,UACZ;AACA,gBAAM,MAAM,QAAQ,SAAS;AAC7B,cAAI,IAAI,SAAS,GAAG,aAAc,YAAY,UAAa,IAAI,UAAU,GAAG,WAAY;AAEvF,gBAAI,MAAMA;AACV,uBAAW,KAAK,IAAK,OAAM,KAAK,KAAK,CAAC;AACtC,eAAG,MAAM;AACT,eAAG,YAAY,IAAI;AAAA,UACpB,OAAO;AACN,qBAAS,IAAI,GAAG,WAAW,IAAI,IAAI,QAAQ,IAAK,IAAG,MAAM,KAAK,GAAG,KAAK,IAAI,CAAC,CAAM;AACjF,eAAG,YAAY,IAAI;AAAA,UACpB;AACA,cAAI,MAAM,IAAI,EAAE;AAChB,cAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,QAC5B;AAAA,QACA,EAAE,GAAG,MAAM,SAAS,oBAAoB,SAAS,KAAK;AAAA,MACvD;AAAA,IACD;AAAA,IAEA,OAAO,KAA0B;AAChC,YAAM,UAAU,KAAK,WAAW,KAAK,CAAC,UAAa;AAClD,wBAAgB,OAAO,oBAAoB;AAC3C,gBAAQ,OAAO,KAAK;AACpB,aAAK,KAAK,EAAE,MAAM,UAAU,MAAM,CAAC;AAAA,MACpC,CAAC;AACD,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,eAAS,MAAM;AACf,gBAAU,MAAM;AAChB,eAAS,WAAW;AAAA,IACrB;AAAA,EACD;AACD;;;ACrRA,SAAS,OACR,SAEA,OACA,MACqB;AACrB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,MAAM,CAAC,QAAQ;AACd,UAAI;AACJ,UAAI,cAAc;AAClB,UAAI,eAAe,MAAM;AACxB,sBAAc;AACd,YAAI,OAAO,YAAY,WAAY,SAAQ;AAAA,MAC5C,CAAC;AACD,YAAM,eAAe,MAAM,GAAG;AAC9B,gBAAU,OAAO,iBAAiB,aAAa,eAAe;AAC9D,UAAI,eAAe,OAAO,YAAY,WAAY,SAAQ;AAAA,IAC3D;AAAA,EACD;AACD;AAyjBA,SAAS,YAAY,SAAiB,IAAY,MAAiD;AAClG,QAAM,EAAE,QAAQ,OAAO,IAAI,QAAQ,CAAC;AACpC,QAAM,KAAK;AAAA,IACV;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,OAAO;AACX,UAAI,QAAQ;AACZ,UAAI;AACJ,UAAI;AACJ,YAAM,UAAU,MAAM;AACrB,eAAO;AACP,YAAI,MAAM,OAAW,cAAa,CAAC;AACnC,YAAI,OAAO,OAAW,eAAc,EAAE;AACtC,gBAAQ,oBAAoB,SAAS,OAAO;AAAA,MAC7C;AACA,YAAM,UAAU,MAAM;AACrB,YAAI,KAAM;AACV,gBAAQ;AACR,YAAI,KAAK,CAAC,CAAC,SAAS,aAAa,QAAQ,MAAM,CAAC,CAAC,CAAC;AAAA,MACnD;AACA,YAAM,SAAS,MAAM;AACpB,YAAI,KAAM;AACV,YAAI,UAAU,MAAM;AACnB,cAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AAC5B,eAAK,YAAY,MAAM;AACtB,gBAAI,KAAM;AACV,gBAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AAAA,UAC7B,GAAG,MAAM;AAAA,QACV,OAAO;AAEN,iBAAO;AACP,kBAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,GAAG,CAAC,UAAU,CAAC,CAAC;AAAA,QAC3C;AAAA,MACD;AACA,UAAI,QAAQ,SAAS;AACpB,gBAAQ;AACR;AAAA,MACD;AACA,cAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACzD,UAAI,WAAW,QAAQ,EAAE;AACzB,aAAO;AAAA,IACR;AAAA,IACA,EAAE,MAAM,QAAQ,UAAU,MAAM;AAAA,EACjC;AACA,MAAI,YAAY,WAAW,WAAW,UAAa,WAAW,QAAW;AACxE,WAAO,EAAE,GAAG,IAAI,SAAS,EAAE,KAAK,SAAS,QAAQ,EAAE,IAAI,iBAAiB,IAAI,UAAU,EAAE,EAAE,EAAE;AAAA,EAC7F;AACA,SAAO;AACR;AAkBO,SAAS,MAAM,IAAY,MAAiD;AAClF,SAAO,YAAY,SAAS,IAAI,IAAI;AACrC;;;AC1kBA,SAAS,mBAAmB,OAAwB;AACnD,SAAO,MAAM,KAAK,yBAAyB,KAAK,CAAC,EAAE,KAAK,GAAG;AAC5D;AAoBA,IAAM,aAAN,MAAuB;AAAA,EACd,WAAW;AAAA,EACF,QAAQ,oBAAI,IAAiB;AAAA,EAC7B;AAAA,EAEjB,YAAY,MAA8B;AACzC,SAAK,MAAM,KAAK,OAAO,KAAK;AAAA,EAC7B;AAAA,EAEA,IAAI,UAAkB;AACrB,WAAO,KAAK;AAAA,EACb;AAAA,EAEA,IAAI,OAAe;AAClB,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,QAAgB;AACf,WAAO,KAAK,IAAI;AAAA,EACjB;AAAA,EAEA,YAAY,KAA4B;AACvC,WAAO,KAAK,MAAM,IAAI,GAAG,GAAG;AAAA,EAC7B;AAAA,EAEQ,UAAU,GAAsB;AACvC,WAAO,EAAE,cAAc,UAAa,KAAK,IAAI,KAAK,EAAE;AAAA,EACrD;AAAA,EAEA,iBAAiB,KAAkC;AAClD,QAAI,QAAQ,OAAW,QAAO;AAC9B,QAAI,CAAC,OAAO,SAAS,GAAG,KAAK,OAAO;AACnC,YAAM,IAAI,WAAW,0DAA0D,GAAG,GAAG;AACtF,WAAO,KAAK,IAAI,IAAI;AAAA,EACrB;AAAA,EAEQ,cAAc,KAAQ,GAA4B;AACzD,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,YAAY;AACjB,WAAO,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC;AAAA,EACvB;AAAA;AAAA,EAGA,OAAO,KAAmB;AACzB,UAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AAC5B,QAAI,MAAM,OAAW,QAAO,EAAE,OAAO,MAAM;AAC3C,QAAI,KAAK,UAAU,CAAC,EAAG,QAAO,EAAE,OAAO,OAAO,SAAS,MAAM,UAAU,EAAE,MAAM;AAE/E,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,MAAM,IAAI,KAAK,CAAC;AACrB,WAAO,EAAE,OAAO,MAAM,OAAO,EAAE,MAAM;AAAA,EACtC;AAAA;AAAA,EAGA,IAAI,KAAQ,OAAU,WAA0B;AAC/C,QAAI,KAAK,MAAM,IAAI,GAAG,EAAG,MAAK,MAAM,OAAO,GAAG;AAC9C,SAAK,MAAM,IAAI,KAAK,EAAE,OAAO,UAAU,CAAC;AACxC,SAAK,YAAY;AAAA,EAClB;AAAA,EAEA,WAAW,SAAiC;AAC3C,UAAM,UAAyB,CAAC;AAChC,eAAW,UAAU,iBAAiB,QAAQ,KAAK,MAAM,KAAK,CAAC,EAAE,KAAK,GAAG;AAAA,MACxE;AAAA,MACA,MAAM,KAAK,MAAM;AAAA,IAClB,CAAC,GAAG;AACH,YAAM,IAAI,KAAK,MAAM,IAAI,MAAM;AAC/B,UAAI,MAAM,OAAW,SAAQ,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC;AACnD,WAAK,MAAM,OAAO,MAAM;AAAA,IACzB;AACA,QAAI,QAAQ,SAAS,EAAG,MAAK,YAAY;AACzC,WAAO;AAAA,EACR;AAAA,EAEA,iBAAiB,QAAuD;AACvE,QAAI,WAAW,UAAa,OAAO,YAAY,OAAW,QAAO,CAAC;AAClE,UAAM,SAAyC,CAAC;AAChD,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,OAAO;AACtC,UAAI,CAAC,KAAK,UAAU,KAAK,GAAG;AAC3B,eAAO,KAAK;AAAA,UACX,OAAO,CAAC,KAAK,MAAM,KAAK;AAAA,UACxB,OAAO,OAAO,MAAM,EAAE,KAAK,OAAO,MAAM,MAAM,CAAC;AAAA,QAChD,CAAC;AAAA,MACF;AAAA,IACD;AACA,UAAM,WAAW,uBAAuB,QAAQ,EAAE,SAAS,OAAO,QAAQ,CAAC;AAC3E,eAAW,CAAC,GAAG,KAAK,SAAU,MAAK,MAAM,OAAO,GAAG;AACnD,QAAI,SAAS,SAAS,EAAG,MAAK,YAAY;AAC1C,WAAO,SAAS,IAAI,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,KAAK,CAAC;AAAA,EACnD;AAAA,EAEA,OAAO,KAAmB;AACzB,UAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AAC5B,QAAI,MAAM,OAAW,QAAO,EAAE,OAAO,MAAM;AAC3C,SAAK,MAAM,OAAO,GAAG;AACrB,SAAK,YAAY;AACjB,WAAO,EAAE,OAAO,MAAM,OAAO,EAAE,MAAM;AAAA,EACtC;AAAA,EAEA,QAAgB;AACf,UAAM,IAAI,KAAK,MAAM;AACrB,QAAI,MAAM,EAAG,QAAO;AACpB,SAAK,MAAM,MAAM;AACjB,SAAK,YAAY;AACjB,WAAO;AAAA,EACR;AAAA,EAEA,eAA8B;AAC7B,UAAM,UAAyB,CAAC;AAChC,eAAW,CAAC,GAAG,CAAC,KAAK,KAAK,OAAO;AAChC,UAAI,KAAK,UAAU,CAAC,GAAG;AACtB,aAAK,MAAM,OAAO,CAAC;AACnB,gBAAQ,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC;AAAA,MAC1B;AAAA,IACD;AACA,QAAI,QAAQ,SAAS,EAAG,MAAK,YAAY;AACzC,WAAO;AAAA,EACR;AAAA,EAEA,kBAAkB,KAAuB;AACxC,UAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AAC5B,QAAI,MAAM,UAAa,CAAC,KAAK,UAAU,CAAC,EAAG,QAAO,CAAC;AACnD,WAAO,KAAK,cAAc,KAAK,CAAC;AAAA,EACjC;AAAA;AAAA,EAGA,WAA8B;AAC7B,UAAM,MAAM,oBAAI,IAAU;AAC1B,eAAW,CAAC,GAAG,CAAC,KAAK,KAAK,MAAO,KAAI,CAAC,KAAK,UAAU,CAAC,EAAG,KAAI,IAAI,GAAG,EAAE,KAAK;AAC3E,WAAO;AAAA,EACR;AAAA;AAAA,EAGA,oBAAkD;AACjD,UAAM,MAA8B,CAAC;AACrC,UAAM,OAAO,oBAAI,IAAY;AAC7B,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,OAAO;AACtC,UAAI,MAAM,cAAc,QAAW;AAClC,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AAAA,MACD;AACA,YAAM,YAAY,mBAAmB,GAAG;AACxC,UAAI,KAAK,IAAI,SAAS,GAAG;AACxB,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AAAA,MACD;AACA,WAAK,IAAI,SAAS;AAClB,UAAI,KAAK,CAAC,KAAK,MAAM,KAAK,CAAU;AAAA,IACrC;AACA,WAAO;AAAA,EACR;AACD;AAWO,SAAS,mCACf,gBACA,UAAoC,CAAC,GACjB;AACpB,SAAO,kBAAkB,SAAS,cAAc;AACjD;AAEA,SAAS,kBACR,UAAoC,CAAC,GACrC,iBAA+C,CAAC,GAC5B;AACpB,QAAM,EAAE,SAAS,YAAY,WAAW,WAAW,KAAK,MAAM,YAAY,MAAM,IAAI;AACpF,QAAM,UAAU,IAAI,WAAiB,EAAE,IAAI,CAAC;AAC5C,aAAW,CAAC,KAAK,KAAK,KAAK,eAAgB,SAAQ,IAAI,KAAK,KAAK;AACjE,QAAM,OAAO,aAAa,EAAE,WAAW,IAAI,CAAC;AAC5C,QAAM,aACL,UAAU,UACV,SAAS,UACT,YAAY,UACZ,eAAe,UACf,cAAc;AAEf,WAAS,UAAa,GAA2C;AAChE,WAAO,aAAa;AAAA,EACrB;AAEA,WAAS,gBAAgB,GAAmB;AAC3C,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI,WAAW,wDAAwD,CAAC,GAAG;AAClF,WAAO;AAAA,EACR;AAEA,WAAS,YAAY,GAAmB;AACvC,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,KAAK;AAC/B,YAAM,IAAI,WAAW,iEAAiE,CAAC,GAAG;AAC3F,WAAO;AAAA,EACR;AAEA,WAAS,yBAAyB,GAAmB;AACpD,QAAI,CAAC,OAAO,SAAS,CAAC,KAAK,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI;AACtD,YAAM,IAAI;AAAA,QACT,sEAAsE,CAAC;AAAA,MACxE;AACD,WAAO;AAAA,EACR;AAEA,MAAI,cAAc,UAAa,OAAO,UAAU,UAAU;AACzD,UAAM,IAAI,UAAU,iDAAiD;AAItE,WAAS,gBAAgB,OAAoB,OAA6B;AACzE,UAAM,KAA8B;AAAA,MACnC,SAAS,eAAe,KAAK;AAAA,MAC7B,MAAM,MAAM;AAAA,MAAC;AAAA,MACb,MAAM,EAAE,SAAS,MAAM;AAAA,IACxB;AACA,QAAI,OAAO;AACV,aAAO,MAAM,SAAS,IAAI,CAAC,GAAG;AAAA,QAC7B,MAAM,OAAO,GAAG,IAAI,IAAI,KAAK,KAAK;AAAA,QAClC,MAAM,EAAE,MAAM,qBAAqB,YAAY,eAAe,QAAQ,MAAM;AAAA,MAC7E,CAAC;AAAA,IACF;AACA,WAAO,IAAI,KAAa,CAAC,GAAG,MAAM;AAAA,MACjC,GAAG;AAAA,MACH,SAAS;AAAA,MACT,SAAS,eAAe,KAAK;AAAA,MAC7B,MAAM,OAAO,GAAG,IAAI,IAAI,KAAK,KAAK;AAAA,IACnC,CAAC;AAAA,EACF;AAEA,WAAS,WACR,OACA,KACAC,WAC2B;AAC3B,QAAI,QAAQ,OAAW,QAAO;AAC9B,QAAI,UAAU,GAAG,GAAG;AACnB,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT,eAAe,KAAK,+EAA+E,UAAU,oBAAoB,QAAQ,KAAK;AAAA,QAC/I;AACD,aAAO;AAAA,IACR;AACA,WAAO,gBAAgB,OAAOA,UAAS,GAAG,CAAC;AAAA,EAC5C;AAEA,QAAM,WAA6C;AAAA,IAClD,SAAS;AAAA,IACT,MAAM,MAAM;AAAA,IAAC;AAAA,EACd;AACA,QAAM,SAAS,QACZ,MAAM,SAAS,UAAU,CAAC,GAAG;AAAA,IAC7B,MAAM,OAAO,GAAG,IAAI,YAAY;AAAA,IAChC,MAAM,EAAE,MAAM,qBAAqB,YAAY,cAAc;AAAA,IAC7D,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,qBAAqB,EAAE,IAAI,CAAC;AAAA,EAChE,CAAC,IACA,IAAI,KAAsB,CAAC,GAAG,MAAM;AAAA,IACpC,GAAG;AAAA,IACH,SAAS;AAAA,IACT,MAAM,OAAO,GAAG,IAAI,YAAY;AAAA,EACjC,CAAC;AACH,QAAM,YAAY,WAAW,aAAa,SAAS,eAAe;AAClE,QAAM,YAAY,WAAW,aAAa,YAAY,WAAW;AACjE,QAAM,kBAAkB;AAAA,IACvB;AAAA,IACA,WAAW;AAAA,IACX;AAAA,EACD;AAEA,MAAI,iBAAiB,UAAU,OAAO,IAAI,SAAY;AACtD,MAAI,oBAAoB,UAAU,UAAU,IAAI,SAAY;AAC5D,MAAI,0BAA0B,UAAU,WAAW,OAAO,IACvD,SACA,WAAW,YAAY,SACtB,SACA,yBAAyB,UAAU,OAAO;AAC9C,QAAM,UAAU,UAAa;AAC7B,MAAI,WAAiC;AACrC,MAAI;AACJ,QAAM,WAAW,oBAAI,QAAuB;AAC5C,MAAI,UAAU;AACd,MAAI;AACJ,QAAM,aAAa,IAAI,cAGrB,SAAS;AACX,MAAI,YAAY;AAEhB,QAAM,eAAe,IAAI,aAAa,CAAC,MAAuB,CAAC;AAC/D,QAAM,YAAY,aAAa,IAAI,SAAS;AAC5C,QAAM,YAAY,aAAa,IAAI,SAAS;AAC5C,QAAM,kBAAkB,aAAa,IAAI,eAAe;AAExD,WAAS,YAAY,KAAU,SAA8B;AAC5D,eAAW,CAAC,KAAK,QAAQ,KAAK;AAC7B,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,UAAU,QAAQ,UAAU,CAAC,CAAC,CAAC;AAAA,EAC3E;AAEA,WAAS,eAAe,KAAU,SAA8B;AAC/D,eAAW,CAAC,KAAK,QAAQ,KAAK;AAC7B,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,UAAU,QAAQ,YAAY,CAAC,CAAC,CAAC;AAAA,EAC7E;AAEA,WAAS,aAAa,KAAU,SAA8B;AAC7D,eAAW,CAAC,KAAK,QAAQ,KAAK;AAC7B,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,UAAU,QAAQ,WAAW,CAAC,CAAC,CAAC;AAAA,EAC5E;AAEA,WAAS,kBAA+E;AACvF,eAAS;AACR,YAAM,MAAM,QAAQ,KAAK;AACzB,UAAI,QAAQ,OAAW,QAAO;AAC9B,UAAI,QAAQ,YAAY,IAAI,GAAG,MAAM,IAAI,UAAW,QAAO;AAC3D,cAAQ,IAAI;AAAA,IACb;AAAA,EACD;AAEA,WAAS,YAAY,KAAU,MAAoB;AAClD,eAAS;AACR,YAAM,OAAO,gBAAgB;AAC7B,UAAI,SAAS,QAAW;AACvB,YAAI,SAAU,KAAI,WAAW,eAAe,UAAU,IAAI;AAC1D,mBAAW;AACX,sBAAc;AACd;AAAA,MACD;AACA,UAAI,KAAK,aAAa,QAAQ,MAAM,GAAG;AACtC,oBAAY,KAAK,QAAQ,aAAa,CAAC;AACvC;AAAA,MACD;AACA,UAAI,gBAAgB,KAAK,UAAW;AACpC,UAAI,SAAU,KAAI,WAAW,eAAe,UAAU,IAAI;AAC1D,oBAAc,KAAK;AACnB,iBAAW,SAAS,MAAM,KAAK,IAAI,GAAG,KAAK,YAAY,QAAQ,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI;AAClF,UAAI,WAAW,aAAa,UAAU,IAAI;AAC1C;AAAA,IACD;AAAA,EACD;AAEA,WAAS,YAAY,KAAU,aAAoC;AAClE,QAAI,YAAY,SAAS,OAAO;AAC/B,YAAM,MAAM,YAAY,OAAO;AAC/B,YAAM,YAAY,QAAQ,iBAAiB,GAAG;AAC9C,cAAQ,IAAI,YAAY,KAAK,YAAY,OAAO,SAAS;AACzD,UAAI,cAAc,OAAW,SAAQ,KAAK,EAAE,KAAK,YAAY,KAAK,UAAU,CAAC;AAC7E,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,OAAO,KAAK,YAAY,KAAK,OAAO,YAAY,MAAM,CAAC,CAAC,CAAC;AACpF,qBAAe,KAAK,QAAQ,WAAW,cAAc,CAAC;AACtD;AAAA,QACC;AAAA,QACA,QAAQ;AAAA,UACP,YAAY,EAAE,SAAS,yBAAyB,OAAO,UAAU,MAAM,IAAI;AAAA,QAC5E;AAAA,MACD;AACA;AAAA,IACD;AACA,QAAI,YAAY,SAAS,UAAU;AAClC,YAAM,WAAW,QAAQ,OAAO,YAAY,GAAG;AAC/C,UAAI,SAAS;AACZ,YAAI,KAAK;AAAA,UACR;AAAA,YACC;AAAA,YACA,EAAE,MAAM,UAAU,KAAK,YAAY,KAAK,UAAU,SAAS,OAAO,QAAQ,WAAW;AAAA,UACtF;AAAA,QACD,CAAC;AACF;AAAA,IACD;AACA,QAAI,YAAY,SAAS,SAAS;AACjC,YAAM,QAAQ,QAAQ,MAAM;AAC5B,UAAI,QAAQ,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,SAAS,MAAM,CAAC,CAAC,CAAC;AAC5D;AAAA,IACD;AACA,QAAI,YAAY,SAAS,gBAAgB;AACxC,kBAAY,KAAK,QAAQ,aAAa,CAAC;AACvC;AAAA,IACD;AACA,gBAAY,KAAK,QAAQ,kBAAkB,YAAY,GAAG,CAAC;AAAA,EAC5D;AAEA,QAAM,YAAoB,CAAC,QAAa;AACvC,UAAM,cAAc,UAAU,KAAK,KAAK,cAAc;AACtD,qBAAiB,gBAAgB,SAAY,SAAY,gBAAgB,WAAW;AACpF,UAAM,UAAU,UAAU,KAAK,KAAK,iBAAiB;AACrD,wBAAoB,YAAY,SAAY,SAAY,YAAY,OAAO;AAC3E,UAAM,uBAAuB,gBAAgB,KAAK,KAAK,uBAAuB;AAC9E,8BACC,yBAAyB,SACtB,SACA,yBAAyB,oBAAoB;AAEjD,eAAW,QAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAkC;AAC1E,kBAAY,KAAK,IAAI;AAAA,IACtB;AACA,UAAM,OAAO,MAAM;AACnB,aAAS,IAAI,GAAG,IAAI,SAAS,GAAG,GAAG,KAAK;AACvC,UAAI,MAAM,UAAU,SAAS,MAAM,UAAU,SAAS,MAAM,gBAAgB,MAAO;AACnF,YAAM,MAAM,KAAK,CAAC;AAClB,UAAI,OAAO,SAAS,IAAI,GAAG,GAAG;AAC7B,mBAAW,QAAS,SAAS,KAAK,CAAC,KAAK,CAAC,GAAkC;AAC1E,sBAAY,KAAK,IAAI;AAAA,QACtB;AACA;AAAA,MACD;AACA,UACC,QAAQ,cACN,SAAS,KAAK,CAAC,GAAG,UAAU,KAAK,KAAK,mBAAmB,YAAY,KAAK,CAAC,CAAC,IAC7E;AACD,YAAI,SAAU,KAAI,WAAW,eAAe,UAAU,SAAS;AAC/D,mBAAW;AACX,sBAAc;AACd,oBAAY,KAAK,QAAQ,aAAa,CAAC;AAAA,MACxC;AAAA,IACD;AAEA,mBAAe,KAAK,QAAQ,WAAW,cAAc,CAAC;AACtD;AAAA,MACC;AAAA,MACA,QAAQ;AAAA,QACP,YAAY,EAAE,SAAS,yBAAyB,OAAO,UAAU,MAAM,IAAI;AAAA,MAC5E;AAAA,IACD;AACA,gBAAY,KAAK,SAAS;AAAA,EAC3B;AAEA,QAAM,UAA8C;AAAA,IACnD,SAAS;AAAA,IACT,MAAM;AAAA,IACN,MAAM,EAAE,SAAS,KAAK;AAAA,EACvB;AACA,UAAQ,QACL,MAAM,SAAS,SAAS,aAAa,MAAkC;AAAA,IACvE,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,2BAA2B,YAAY,cAAc;AAAA,IACnE,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,oBAAoB,EAAE,IAAI,CAAC;AAAA,EAC/D,CAAC,IACA,SAAS,SAAS,aAAa,MAAM;AAAA,IACrC,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,EAChC,CAAC;AAEH,QAAM,SAAS,uBAAO,OAAO,GAAG,IAAI,cAAc,sBAAsB;AACxE,QAAM,iBAAwD;AAAA,IAC7D,SAAS;AAAA,IACT,MAAM,CAAC,QAAa;AACnB,YAAM,UAAU,QAAQ,aAAa,EAAE;AAAA,QACtC,CAAC,CAAC,KAAK,QAAQ,OAAwB;AAAA,UACtC,MAAM;AAAA,UACN;AAAA,UACA;AAAA,UACA,QAAQ;AAAA,QACT;AAAA,MACD;AACA,UAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,UAAU,QAAQ,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC/D;AAAA,IACA,MAAM;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA,SAAS;AAAA,IACV;AAAA,EACD;AACA,QAAM,eAAe,QAClB,MAAM,SAAS,gBAAgB,CAAC,KAAsB,GAAG;AAAA,IACzD,MAAM,OAAO,GAAG,IAAI,kBAAkB;AAAA,IACtC,MAAM,EAAE,MAAM,4BAA4B,YAAY,cAAc;AAAA,IACpE,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,2BAA2B,EAAE,IAAI,CAAC;AAAA,EACtE,CAAC,IACA,SAAS,gBAAgB,CAAC,KAAsB,GAAG;AAAA,IACnD,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,kBAAkB;AAAA,EACvC,CAAC;AACH,QAAM,UAA8C;AAAA,IACnD,SAAS;AAAA,IACT,MAAM,CAAC,QAAa;AACnB,iBAAW,UAAU,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC5C,YAAI,KAAK,CAAC,CAAC,QAAQ,MAAyB,CAAC,CAAC;AAAA,MAC/C;AACA,iBAAW,QAAQ,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC1C,mBAAW,UAAW,KAA4B,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC;AAAA,MACvF;AAAA,IACD;AAAA,IACA,MAAM,EAAE,SAAS,KAAK;AAAA,EACvB;AACA,QAAM,QAAQ,QACX,MAAM,SAAS,SAAS,CAAC,OAAwB,YAA6B,GAAG;AAAA,IACjF,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,IAC/B,MAAM,EAAE,MAAM,oBAAoB,YAAY,cAAc;AAAA,IAC5D,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,oBAAoB,EAAE,IAAI,CAAC;AAAA,EAC/D,CAAC,IACA,SAAS,SAAS,CAAC,OAAwB,YAA6B,GAAG;AAAA,IAC3E,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,WAAW;AAAA,EAChC,CAAC;AACH,QAAM,aAAmD;AAAA,IACxD,SAAS;AAAA,IACT,MAAM,CAAC,QAAa;AACnB,iBAAW,QAAQ,SAAS,KAAK,CAAC,KAAK,CAAC,GAAG;AAC1C,YAAI,KAAK,CAAC,CAAC,QAAS,KAA4B,QAAQ,CAAC,CAAC;AAAA,MAC3D;AAAA,IACD;AAAA,IACA,MAAM,EAAE,SAAS,KAAK;AAAA,EACvB;AACA,QAAM,WAAW,QACd,MAAM,SAAS,YAAY,CAAC,YAA6B,GAAG;AAAA,IAC5D,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,IAClC,MAAM,EAAE,MAAM,uBAAuB,YAAY,cAAc;AAAA,IAC/D,GAAI,aAAa,EAAE,SAAS,EAAE,KAAK,uBAAuB,EAAE,IAAI,CAAC;AAAA,EAClE,CAAC,IACA,SAAS,YAAY,CAAC,YAA6B,GAAG;AAAA,IACtD,GAAG;AAAA,IACH,MAAM,OAAO,GAAG,IAAI,cAAc;AAAA,EACnC,CAAC;AACH,MAAI,YAAY;AACf,oCAAgC,QAAyB,MAAM,QAAQ,kBAAkB,CAAC;AAAA,EAC3F;AACA,QAAM,eAAe,QAClB,MAAM,OAAO,OAAO,EAAE,QAAQ,oBAAoB,CAAC,IACnD,MAAM,UAAU,MAAM;AAAA,EAAC,CAAC;AAC3B,QAAM,QAA2B,CAAC;AAElC,WAAS,MAAM,KAAQ,OAAU,KAAoB;AACpD,QAAI,QAAQ,OAAW,aAAY,GAAG;AACtC,WAAO,KAAK;AAAA,MACX,CAAC,QAAQ,QAAQ,SAAY,EAAE,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE,MAAM,OAAO,KAAK,OAAO,IAAI,CAAC;AAAA,IAC5F,CAAC;AAAA,EACF;AAEA,WAAS,KAAK,KAAmB;AAChC,UAAM,IAAI,QAAQ,OAAO,GAAG;AAC5B,QAAI,CAAC,EAAE,SAAS,EAAE,QAAS,QAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,YAAY,IAAI,CAAC,CAAC,CAAC;AAC5E,WAAO;AAAA,EACR;AAEA,WAAS,iBAAiB,WAA6D;AACtF,UAAM,MAAM,oBAAI,IAAU;AAC1B,eAAW,CAAC,KAAK,KAAK,KAAK,QAAQ,SAAS,GAAG;AAC9C,UAAI,UAAU,OAAO,GAAG,EAAG,KAAI,IAAI,KAAK,KAAK;AAAA,IAC9C;AACA,WAAO;AAAA,EACR;AAEA,WAAS,OACR,WACmD;AACnD,QAAI,OAAO,cAAc;AACxB,YAAM,IAAI,UAAU,kDAAkD;AACvE,UAAM,SAAS,WAAW,IAAI,SAAS;AACvC,QAAI,WAAW,OAAW,QAAO;AACjC,QAAI;AACJ,WAAO,kBAAsD,OAAwB;AAAA,MACpF;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,MAAM,OAAO,GAAG,IAAI,WAAW,WAAW,KAAK;AAAA,MAC/C,qBAAqB,MAAM,iBAAiB,SAAS;AAAA,MACrD,WAAW,MAAM;AAChB,mBAAW,YAAY,IAAI;AAAA,MAC5B;AAAA,IACD,CAAC;AACD,eAAW,IAAI,WAAW,IAAI;AAC9B,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IAEA,IAAI,OAAe;AAClB,aAAO,QAAQ;AAAA,IAChB;AAAA,IACA,IAAI,KAAuB;AAC1B,YAAM,IAAI,KAAK,GAAG;AAClB,aAAO,EAAE,QAAQ,EAAE,QAAQ;AAAA,IAC5B;AAAA,IACA,IAAI,KAAiB;AACpB,aAAO,KAAK,GAAG,EAAE;AAAA,IAClB;AAAA,IACA,QAA2B;AAC1B,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,eAAe,CAAC,CAAC,CAAC;AAChD,aAAO,QAAQ,SAAS;AAAA,IACzB;AAAA,IACA;AAAA,IAEA,IAAI,KAAQ,OAAU,MAA+B;AACpD,YAAM,KAAK,OAAO,MAAM,GAAG;AAAA,IAC5B;AAAA,IACA,QAAQ,SAAoC,MAA+B;AAC1E,iBAAW,CAAC,GAAG,CAAC,KAAK,QAAS,OAAM,GAAG,GAAG,MAAM,GAAG;AAAA,IACpD;AAAA,IACA,OAAO,KAAc;AACpB,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,IAAI,CAAC,CAAC,CAAC;AAAA,IAChD;AAAA,IACA,WAAW,MAAyB;AACnC,iBAAW,KAAK,MAAM;AACrB,eAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,UAAU,KAAK,EAAE,CAAC,CAAC,CAAC;AAAA,MACnD;AAAA,IACD;AAAA,IACA,QAAc;AACb,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,QAAQ,CAAC,CAAC,CAAC;AAAA,IAC1C;AAAA,IACA,eAAqB;AACpB,aAAO,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,eAAe,CAAC,CAAC,CAAC;AAAA,IACjD;AAAA,IAEA,QAAQ,KAAwC;AAC/C,UAAI,UAAU;AACb,cAAM,IAAI;AAAA,UACT;AAAA,QACD;AACD,YAAM,KAAiD;AAAA,QACtD,SAAS;AAAA,QACT,MAAM,CAAC,QAAa;AACnB,cAAI;AACH,uBAAW,CAAC,GAAG,CAAC,KAAM,SAAS,KAAK,CAAC,KAAK,CAAC,GAAoC;AAC9E,kBAAI,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,OAAO,KAAK,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;AAAA,YACvD;AAAA,UACD,SAAS,GAAG;AACX,gBAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,+BAA+B,CAAC,CAAC,CAAC;AAAA,UACvE;AAAA,QACD;AAAA,MACD;AACA,YAAM,SAAS,MAAM,SAAS,IAAI,CAAC,GAAG,GAAG;AAAA,QACxC,MAAM,OAAO,GAAG,IAAI,SAAS,SAAS,KAAK;AAAA,QAC3C,MAAM,EAAE,MAAM,0BAA0B,YAAY,cAAc;AAAA,MACnE,CAAC;AACD,eAAS,IAAI,MAAuB;AACpC,YAAM,aAAa,QAAyB,SAAS;AACrD,UAAIC,UAAS;AACb,YAAM,UAAU,MAAM;AACrB,YAAI,CAACA,QAAQ;AACb,QAAAA,UAAS;AACT,cAAM,eAAe,QAAyB,SAAS;AAAA,MACxD;AACA,YAAM,KAAK,OAAO;AAClB,aAAO;AAAA,IACR;AAAA,IACA,UAAgB;AACf,iBAAW,WAAW;AACtB,iBAAW,KAAK,MAAO,GAAE;AACzB,YAAM,SAAS;AACf,mBAAa;AAAA,IACd;AAAA,EACD;AACD;;;ACjxBA,SAAS,mBACR,OACuC;AACvC,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,kBAAqB,OAAiE;AAC9F,MAAI,CAAC,mBAAmB,KAAK,EAAG,QAAO;AACvC,MAAI,MAAM,SAAS,eAAgB,OAAM,IAAI,UAAU,yCAAyC;AAChG,SAAO,MAAM;AACd;AAEA,SAAS,kBACR,OACsC;AACtC,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,iBAAoB,OAAgE;AAC5F,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,MAAI,MAAM,SAAS,cAAe,OAAM,IAAI,UAAU,wCAAwC;AAC9F,SAAO,MAAM;AACd;AAEA,SAAS,kBACR,OACyC;AACzC,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,kBACR,OAC+B;AAC/B,MAAI,CAAC,kBAAkB,KAAK,EAAG,QAAO;AACtC,MAAI,MAAM,SAAS,cAAe,OAAM,IAAI,UAAU,wCAAwC;AAC9F,SAAO,MAAM;AACd;AAEA,SAAS,oBACR,OAC2C;AAC3C,SAAO,CAAC,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAS,iBACR,OAC4B;AAC5B,MAAI,CAAC,oBAAoB,KAAK,EAAG,QAAO;AACxC,MAAI,MAAM,SAAS,iBAAiB;AACnC,UAAM,IAAI,UAAU,0CAA0C;AAAA,EAC/D;AACA,SAAO,MAAM;AACd;AAGO,SAAS,oBACf,OACA,UAA+B,CAAC,GACd;AAClB,QAAM,SAAS,kBAAkB,KAAK;AACtC,SAAO,aAAgB,QAAQ,OAAO;AACvC;AAGO,SAAS,mBACf,OACA,UAA8B,CAAC,GACd;AACjB,QAAM,SAAS,iBAAiB,KAAK;AACrC,SAAO,YAAe,QAAQ,OAAO;AACtC;AAGO,SAAS,mBACf,OACA,UAAoC,CAAC,GACjB;AACpB,QAAM,UAAU,kBAAkB,KAAK;AACvC,SAAO,mCAAyC,SAAS,OAAO;AACjE;AAGO,SAAS,qBACf,OACA,UAAgC,CAAC,GACX;AACtB,QAAM,OAAO,iBAAiB,KAAK;AACnC,SAAO,qCAA2C,MAAM,OAAO;AAChE;;;AC9FO,IAAM,sCACZ;AAEM,IAAM,oCACZ;AAEM,IAAM,oCAAoC;AA6EjD,SAASC,UAAS,OAAkD;AACnE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;AAC3E;AAEA,SAASC,SAAQ,OAAmD;AACnE,SAAO,OAAO,KAAK,KAAK,EAAE,KAAK;AAChC;AAEA,SAASC,YACR,OACA,UACA,OACO;AACP,QAAM,SAASD,SAAQ,KAAK;AAC5B,QAAM,OAAO,CAAC,GAAG,QAAQ,EAAE,KAAK;AAChC,MAAI,OAAO,WAAW,KAAK,UAAU,OAAO,KAAK,CAAC,KAAK,MAAM,QAAQ,KAAK,CAAC,CAAC,GAAG;AAC9E,UAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B,OAAO,KAAK,GAAG,CAAC,EAAE;AAAA,EAC5E;AACD;AAEA,SAAS,kBAAkB,OAAgB,OAAe,MAAM,GAAW;AAC1E,MAAI,CAAC,OAAO,cAAc,KAAK,KAAM,QAAmB,KAAK;AAC5D,UAAM,IAAI,UAAU,GAAG,KAAK,8BAA8B,GAAG,EAAE;AAAA,EAChE;AACA,SAAO;AACR;AAEA,SAAS,WACR,OACA,UACA,OACI;AACJ,MAAI,UAAU,SAAU,OAAM,IAAI,UAAU,GAAG,KAAK,kBAAkB,QAAQ,EAAE;AAChF,SAAO;AACR;AAEA,SAAS,YAAyB,OAAgB,OAA6B;AAC9E,MAAI,CAAC,MAAM,QAAQ,KAAK,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;AACpF,SAAO;AACR;AAEA,SAASE,oBAAmB,OAAwB;AACnD,SAAO,MAAM,KAAK,yBAAyB,KAAK,CAAC,EAAE,KAAK,GAAG;AAC5D;AAEA,SAAS,iBACR,OACA,OAC+B;AAC/B,QAAM,UAAU,YAAqB,OAAO,KAAK;AACjD,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,CAAC,GAAG,KAAK,KAAK,QAAQ,QAAQ,GAAG;AAC3C,QAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AAChD,YAAM,IAAI,UAAU,GAAG,KAAK,WAAW,CAAC,sBAAsB;AAAA,IAC/D;AACA,UAAM,MAAMA,oBAAmB,MAAM,CAAC,CAAC;AACvC,QAAI,KAAK,IAAI,GAAG,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,WAAW,CAAC,4BAA4B;AACvF,SAAK,IAAI,GAAG;AAAA,EACb;AACA,SAAO;AACR;AAEA,SAAS,gBACR,OACA,OAC4B;AAC5B,QAAM,OAAO,YAAqB,OAAO,KAAK;AAC9C,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,CAAC,GAAG,GAAG,KAAK,KAAK,QAAQ,GAAG;AACtC,QAAI,CAACH,UAAS,GAAG,EAAG,OAAM,IAAI,UAAU,GAAG,KAAK,SAAS,CAAC,oBAAoB;AAC9E,IAAAE,YAAW,KAAK,CAAC,WAAW,aAAa,OAAO,GAAG,GAAG,KAAK,MAAM;AACjE,UAAM,UAAUC,oBAAmB,IAAI,OAAO;AAC9C,QAAI,KAAK,IAAI,OAAO,GAAG;AACtB,YAAM,IAAI,UAAU,GAAG,KAAK,SAAS,CAAC,gCAAgC;AAAA,IACvE;AACA,SAAK,IAAI,OAAO;AAAA,EACjB;AACA,SAAO;AACR;AAGO,SAAS,sBAAsB,gBAAgB,uBAA+B;AACpF,MAAI,cAAc,WAAW,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACrF,SAAO,GAAG,aAAa;AACxB;AAGO,SAAS,gCACf,MACA,UACA,OAA2C,CAAC,GACJ;AACxC,QAAM,eAAe,KAAK,gBAAgB;AAC1C,MAAI,CAAC,OAAO,cAAc,YAAY,KAAK,eAAe,IAAI;AAC7D,UAAM,IAAI,WAAW,wEAAwE;AAAA,EAC9F;AACA,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,8BACf,MACA,QACsC;AACtC,SAAO;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,sCAGd,OAAgB,cAAwD;AACzE,MAAI,CAACH,UAAS,KAAK,EAAG,OAAM,IAAI,UAAU,sDAAsD;AAChG,EAAAE,YAAW,OAAO,CAAC,gBAAgB,UAAU,QAAQ,YAAY,SAAS,GAAG,gBAAgB;AAC7F,MAAI,MAAM,WAAW,qCAAqC;AACzD,UAAM,IAAI,UAAU,gCAAgC;AAAA,EACrD;AACA,MAAI,MAAM,YAAY,mCAAmC;AACxD,UAAM,IAAI,UAAU,iCAAiC;AAAA,EACtD;AACA,aAAW,MAAM,MAAM,cAAc,gBAAgB;AACrD,oBAAkB,MAAM,cAAc,+BAA+B,EAAE;AACvE,qBAA4B,EAAE,OAAO,KAAK;AAC1C,SAAO;AACR;AAGO,SAAS,oCAGd,OAAgB,cAAsD;AACvE,MAAI,CAACF,UAAS,KAAK,EAAG,OAAM,IAAI,UAAU,oDAAoD;AAC9F,EAAAE,YAAW,OAAO,CAAC,UAAU,UAAU,QAAQ,SAAS,GAAG,cAAc;AACzE,MAAI,MAAM,WAAW,mCAAmC;AACvD,UAAM,IAAI,UAAU,8BAA8B;AAAA,EACnD;AACA,MAAI,MAAM,YAAY,mCAAmC;AACxD,UAAM,IAAI,UAAU,+BAA+B;AAAA,EACpD;AACA,aAAW,MAAM,MAAM,cAAc,cAAc;AACnD,MAAI,CAAC,OAAO,OAAO,OAAO,QAAQ,EAAG,OAAM,IAAI,UAAU,kCAAkC;AAC3F,qBAA4B,EAAE,OAAO,KAAK;AAC1C,SAAO;AACR;AAkCA,SAAS,iBAAoB,OAA+B;AAC3D,MAAI,CAACE,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,iDAAiD;AAAA,EACtE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,oCAAoC;AAC5F,MAAAC,YAAW,OAAO,CAAC,QAAQ,OAAO,GAAG,qBAAqB;AAC1D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,QAAQ,GAAG,yBAAyB;AAC/D,kBAAe,MAAM,QAAQ,gCAAgC;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,QAAQ,OAAO,GAAG,qBAAqB;AACnE,wBAAkB,MAAM,OAAO,6BAA6B,CAAC;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,QAAQ,QAAQ,GAAG,yBAAyB;AACxE,wBAAkB,MAAM,OAAO,iCAAiC,CAAC;AACjE,kBAAe,MAAM,QAAQ,gCAAgC;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,QAAQ,OAAO,GAAG,kBAAkB;AAChE,wBAAkB,MAAM,OAAO,0BAA0B,CAAC;AAC1D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,GAAG,GAAG,uBAAuB;AACxD,wBAAkB,MAAM,GAAG,2BAA2B,CAAC;AACvD,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,oBAAoB;AACzD,wBAAkB,MAAM,OAAO,4BAA4B,CAAC;AAC5D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,wCAAwC,MAAM,IAAI,EAAE;AAAA,EAC1E;AACD;AAEA,SAAS,gBAAmB,OAA8B;AACzD,MAAI,CAACD,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,mCAAmC;AAC3F,MAAAC,YAAW,OAAO,CAAC,QAAQ,OAAO,GAAG,oBAAoB;AACzD,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,QAAQ,GAAG,wBAAwB;AAC9D,kBAAe,MAAM,QAAQ,+BAA+B;AAC5D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,GAAG,GAAG,sBAAsB;AACvD,wBAAkB,MAAM,GAAG,0BAA0B,CAAC;AACtD,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,mBAAmB;AACxD,wBAAkB,MAAM,OAAO,2BAA2B,CAAC;AAC3D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,uCAAuC,MAAM,IAAI,EAAE;AAAA,EACzE;AACD;AAEA,SAAS,gBAAsB,OAAiC;AAC/D,MAAI,CAACD,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,gDAAgD;AAAA,EACrE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,KAAK,EAAG,OAAM,IAAI,UAAU,8BAA8B;AACpF,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO,EAAG,OAAM,IAAI,UAAU,gCAAgC;AACxF,MAAAC,YAAW,OAAO,CAAC,OAAO,QAAQ,OAAO,GAAG,iBAAiB;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,KAAK,EAAG,OAAM,IAAI,UAAU,iCAAiC;AACvF,UAAI,CAAC,OAAO,OAAO,OAAO,UAAU,GAAG;AACtC,cAAM,IAAI,UAAU,sCAAsC;AAAA,MAC3D;AACA,MAAAA,YAAW,OAAO,CAAC,OAAO,QAAQ,YAAY,QAAQ,GAAG,oBAAoB;AAC7E,UACC,MAAM,WAAW,aACjB,MAAM,WAAW,eACjB,MAAM,WAAW,cACjB,MAAM,WAAW,YAChB;AACD,cAAM,IAAI,UAAU,sCAAsC;AAAA,MAC3D;AACA,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,mBAAmB;AACxD,wBAAkB,MAAM,OAAO,2BAA2B,CAAC;AAC3D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,uCAAuC,MAAM,IAAI,EAAE;AAAA,EACzE;AACD;AAEA,SAAS,kBAAwB,OAAmC;AACnE,MAAI,CAACD,UAAS,KAAK,KAAK,OAAO,MAAM,SAAS,UAAU;AACvD,UAAM,IAAI,UAAU,kDAAkD;AAAA,EACvE;AACA,UAAQ,MAAM,MAAM;AAAA,IACnB,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,SAAS,GAAG;AACrC,cAAM,IAAI,UAAU,uCAAuC;AAAA,MAC5D;AACA,UAAI,CAAC,OAAO,OAAO,OAAO,WAAW,GAAG;AACvC,cAAM,IAAI,UAAU,yCAAyC;AAAA,MAC9D;AACA,UAAI,CAAC,OAAO,OAAO,OAAO,OAAO;AAChC,cAAM,IAAI,UAAU,qCAAqC;AAC1D,MAAAC,YAAW,OAAO,CAAC,QAAQ,WAAW,aAAa,OAAO,GAAG,sBAAsB;AACnF,aAAO;AAAA,IACR,KAAK;AACJ,UAAI,CAAC,OAAO,OAAO,OAAO,SAAS,GAAG;AACrC,cAAM,IAAI,UAAU,uCAAuC;AAAA,MAC5D;AACA,MAAAA,YAAW,OAAO,CAAC,QAAQ,SAAS,GAAG,sBAAsB;AAC7D,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,QAAQ,WAAW,GAAG,0BAA0B;AACnE,kBAAe,MAAM,WAAW,oCAAoC;AACpE,aAAO;AAAA,IACR,KAAK;AACJ,MAAAA,YAAW,OAAO,CAAC,SAAS,MAAM,GAAG,qBAAqB;AAC1D,wBAAkB,MAAM,OAAO,6BAA6B,CAAC;AAC7D,aAAO;AAAA,IACR;AACC,YAAM,IAAI,UAAU,yCAAyC,MAAM,IAAI,EAAE;AAAA,EAC3E;AACD;AAEA,SAAS,gBAAmB,OAAY,QAA6B;AACpE,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK;AACJ,YAAM,KAAK,OAAO,KAAK;AACvB;AAAA,IACD,KAAK;AACJ,YAAM,KAAK,GAAG,OAAO,MAAM;AAC3B;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,QAAQ,MAAM;AACxB,cAAM,IAAI,MAAM,4CAA4C;AAC7D,YAAM,OAAO,OAAO,OAAO,GAAG,OAAO,KAAK;AAC1C;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,QAAQ,MAAM,QAAQ;AAChC,cAAM,IAAI,MAAM,gDAAgD;AAAA,MACjE;AACA,YAAM,OAAO,OAAO,OAAO,GAAG,GAAG,OAAO,MAAM;AAC9C;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,SAAS,MAAM,OAAQ,OAAM,IAAI,MAAM,yCAAyC;AAC3F,UAAI,CAAC,iBAAiB,MAAM,OAAO,KAAK,GAAG,OAAO,KAAK,GAAG;AACzD,cAAM,IAAI,MAAM,4DAA4D;AAAA,MAC7E;AACA,YAAM,OAAO,OAAO,OAAO,CAAC;AAC5B;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,IAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,8CAA8C;AAC3F,YAAM,OAAO,GAAG,OAAO,CAAC;AACxB;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,8DAA8D;AAAA,MAC/E;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,iBAAiB,GAAY,GAAqB;AAC1D,QAAM,OAAO,yBAAyB,CAAC;AACvC,QAAM,QAAQ,yBAAyB,CAAC;AACxC,MAAI,KAAK,eAAe,MAAM,WAAY,QAAO;AACjD,WAAS,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK,EAAG,KAAI,KAAK,CAAC,MAAM,MAAM,CAAC,EAAG,QAAO;AAC9E,SAAO;AACR;AAEA,SAAS,cACR,QACA,OACA,KACA,OACS;AACT,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC1C,QAAI,iBAAiB,MAAM,OAAO,CAAC,CAAM,GAAG,GAAG,GAAG;AACjD,UAAI,UAAU,GAAI,OAAM,IAAI,MAAM,GAAG,KAAK,sCAAsC;AAChF,cAAQ;AAAA,IACT;AAAA,EACD;AACA,SAAO;AACR;AAEA,SAASC,QAAO,GAAY,GAAoB;AAC/C,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,KAAK,OAAO;AAClB,MACC,OAAO,OAAO,MACb,OAAO,YAAY,OAAO,YAAY,OAAO,aAAa,OAAO,WACjE;AACD,UAAM,KAAK;AACX,UAAM,KAAK;AACX,WAAO,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AAAA,EACrC;AACA,SAAO,OAAO,CAAC,EAAE,cAAc,OAAO,CAAC,CAAC;AACzC;AAEA,SAAS,eAAkB,OAAY,QAA4B;AAClE,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK;AACJ,YAAM,KAAK,OAAO,KAAK;AACvB;AAAA,IACD,KAAK;AACJ,YAAM,KAAK,GAAG,OAAO,MAAM;AAC3B;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,IAAI,MAAM,OAAQ,OAAM,IAAI,MAAM,6CAA6C;AAC1F,YAAM,OAAO,GAAG,OAAO,CAAC;AACxB;AAAA,IACD,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,6DAA6D;AAAA,MAC9E;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,eAAqB,OAA+B,QAA+B;AAC3F,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK,OAAO;AACX,YAAM,QAAQ,cAAc,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,OAAO,KAAK,aAAa;AAC5E,UAAI,UAAU,GAAI,OAAM,KAAK,CAAC,OAAO,KAAK,OAAO,KAAK,CAAU;AAAA,UAC3D,OAAM,KAAK,IAAI,CAAC,OAAO,KAAK,OAAO,KAAK;AAC7C;AAAA,IACD;AAAA,IACA,KAAK,UAAU;AACd,YAAM,QAAQ,cAAc,OAAO,CAAC,CAAC,GAAG,MAAM,KAAK,OAAO,KAAK,aAAa;AAC5E,UAAI,UAAU,GAAI,OAAM,IAAI,MAAM,0CAA0C;AAC5E,UAAI,CAAC,iBAAiB,MAAM,KAAK,IAAI,CAAC,GAAG,OAAO,QAAQ,GAAG;AAC1D,cAAM,IAAI,MAAM,uEAAuE;AAAA,MACxF;AACA,YAAM,OAAO,OAAO,CAAC;AACrB;AAAA,IACD;AAAA,IACA,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,6DAA6D;AAAA,MAC9E;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,cAAoB,OAAoC;AAChE,QAAM,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,cAAcA,QAAO,EAAE,WAAW,EAAE,SAAS;AACnD,WAAO,gBAAgB,IAAIA,QAAO,EAAE,SAAS,EAAE,OAAO,IAAI;AAAA,EAC3D,CAAC;AACF;AAEA,SAAS,iBAAuB,OAA8B,QAAiC;AAC9F,UAAQ,OAAO,MAAM;AAAA,IACpB,KAAK,UAAU;AACd,YAAM,QAAQ,cAAc,OAAO,CAACC,SAAQA,KAAI,SAAS,OAAO,SAAS,eAAe;AACxF,YAAM,MAAsB;AAAA,QAC3B,SAAS,OAAO;AAAA,QAChB,WAAW,OAAO;AAAA,QAClB,OAAO,OAAO;AAAA,MACf;AACA,UAAI,UAAU,GAAI,OAAM,KAAK,GAAG;AAAA,UAC3B,OAAM,KAAK,IAAI;AACpB,oBAAc,KAAK;AACnB;AAAA,IACD;AAAA,IACA,KAAK,UAAU;AACd,YAAM,QAAQ,cAAc,OAAO,CAAC,QAAQ,IAAI,SAAS,OAAO,SAAS,eAAe;AACxF,UAAI,UAAU,GAAI,OAAM,IAAI,MAAM,gDAAgD;AAClF,YAAM,OAAO,OAAO,CAAC;AACrB;AAAA,IACD;AAAA,IACA,KAAK,cAAc;AAClB,iBAAW,WAAW,OAAO,WAAW;AACvC,cAAM,QAAQ,cAAc,OAAO,CAAC,QAAQ,IAAI,SAAS,SAAS,eAAe;AACjF,YAAI,UAAU,IAAI;AACjB,gBAAM,IAAI,MAAM,oDAAoD;AAAA,QACrE;AACA,cAAM,OAAO,OAAO,CAAC;AAAA,MACtB;AACA;AAAA,IACD;AAAA,IACA,KAAK;AACJ,UAAI,OAAO,UAAU,MAAM,QAAQ;AAClC,cAAM,IAAI,MAAM,+DAA+D;AAAA,MAChF;AACA,YAAM,SAAS;AACf;AAAA,EACF;AACD;AAEA,SAAS,YACR,MACA,OACA,eACA,gBACA,SACA,QACkD;AAClD,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,QAAQ,gBACL,UAAU,IACT,qBACA,aACD,UAAU,IACT,YACA;AAAA,IACJ,UAAU,EAAE,OAAO,eAAe,cAAc,eAAe;AAAA,IAC/D,SAAS,EAAE,SAAS,OAAO;AAAA,EAC5B;AACD;AAEA,SAAS,UACR,MACA,MACA,gBACA,cACA,aAC2D;AAC3D,QAAM,MAAM,KAAK,eAAe,sBAAsB,KAAK,aAAa;AACxE,SAAO,KAAK,cAAc,IAAI,GAAG,EAAE,KAAK,CAAC,kBAAkB;AAC1D,QAAI,gBAAgB;AACpB,QAAI,iBAAiB;AACrB,QAAI,QAAa,CAAC;AAElB,QAAI,kBAAkB,QAAW;AAChC,YAAM,QAAQ,sCAAuD,eAAe,IAAI;AACxF,cAAQ,CAAC,GAAG,eAAe,MAAM,QAAQ,CAAC;AAC1C,sBAAgB;AAChB,uBAAiB,MAAM;AAAA,IACxB;AAEA,QAAI,KAAK,cAAc,QAAW;AACjC,aAAO,YAAY,MAAM,OAAO,eAAe,gBAAgB,GAAG,cAAc;AAAA,IACjF;AAEA,WAAO,KAAK,UAAU,KAAK,EAAE,OAAO,eAAe,CAAC,EAAE,KAAK,CAAC,YAAY;AACvE,UAAI,UAAU;AACd,UAAI,SAAS;AACb,iBAAW,SAAS,SAAS;AAC5B,cAAM,cAAc,SAAS;AAC7B,YAAI,CAAC,OAAO,cAAc,MAAM,GAAG,KAAK,MAAM,QAAQ,aAAa;AAClE,gBAAM,IAAI;AAAA,YACT,kEAAkE,WAAW,SAAS,MAAM,GAAG;AAAA,UAChG;AAAA,QACD;AACA,cAAM,QAAQ,oCAA0C,MAAM,OAAO,IAAI;AACzE,cAAM,SAAS,aAAa,MAAM,MAAM;AACxC,oBAAY,OAAO,MAAM;AACzB,mBAAW;AACX,iBAAS,MAAM;AAAA,MAChB;AACA,aAAO,YAAY,MAAM,OAAO,eAAe,gBAAgB,SAAS,MAAM;AAAA,IAC/E,CAAC;AAAA,EACF,CAAC;AACF;AAGO,SAAS,sBACf,MACuC;AACvC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,YAAe,OAAO,uBAAuB;AAAA,IACxD;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,qBACf,MACsC;AACtC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,YAAe,OAAO,sBAAsB;AAAA,IACvD;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,qBACf,MACyC;AACzC,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,iBAAuB,OAAO,sBAAsB;AAAA,IAC/D;AAAA,IACA;AAAA,EACD;AACD;AAGO,SAAS,uBACf,MAC2C;AAC3C,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,UAAU,gBAAsB,OAAO,wBAAwB;AAAA,IAChE;AAAA,IACA;AAAA,EACD;AACD;;;ACvkBA,SAAS,YAAY,YAAkE;AACtF,SAAO;AAAA,IACN,MAAM;AAAA,IACN;AAAA,IACA,WAAW;AAAA,IACX,gBAAgB;AAAA,IAChB,cAAc;AAAA,EACf;AACD;AAEA,SAASC,cAAa,OAAwB;AAC7C,SAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAC7D;AAEA,SAASC,8BAA6B,OAA+C;AACpF,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,GAAG;AAC9C,UAAM,IAAI,WAAW,sDAAsD;AAAA,EAC5E;AACA,SAAO;AACR;AAEA,SAAS,4BAA4B,OAAmC;AACvE,MAAI,UAAU,OAAW,QAAO;AAChC,MAAI,CAAC,OAAO,cAAc,KAAK,KAAK,QAAQ,IAAI;AAC/C,UAAM,IAAI,WAAW,kDAAkD;AAAA,EACxE;AACA,SAAO;AACR;AAEA,SAASC,UACR,OACA,SACA,QACA,QACA,QACsC;AACtC,SAAO,EAAE,OAAO,SAAS,QAAQ,QAAQ,OAAO;AACjD;AAEA,SAASC,QAAU,KAA6B;AAC/C,SAAO,IAAI,CAAC,MAAM,SAAU,IAAI,CAAC,IAAU;AAC5C;AAMO,SAAS,0BACf,OACA,YACA,MACsC;AACtC,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,KAAK,QAAQ,GAAG,IAAI;AACjC,QAAM,cAAc,KAAK,eAAe,sBAAsB,KAAK,iBAAiB,IAAI;AACxF,QAAM,uBAAuBF,8BAA6B,KAAK,oBAAoB;AACnF,uBAAqB,OAAO,WAAW,OAAwB,GAAG,IAAI,mBAAmB;AACzF,uBAAqB,OAAO,WAAW,UAA2B,GAAG,IAAI,sBAAsB;AAE/F,MAAI,cAAc;AAAA,IACjB,GAAG,YAAY,IAAI;AAAA,IACnB,WAAW,4BAA4B,KAAK,mBAAmB;AAAA,EAChE;AACA,MAAI,cAAcC,UAAS,YAAY,GAAG,GAAG,GAAG,WAAW;AAC3D,MAAI,aAAa;AACjB,MAAI,SAAS;AACb,MAAI,+BAA+B;AACnC,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,mBAAmB;AACvB,MAAI,cAAc;AAClB,MAAI;AACJ,QAAM,QAAqB,CAAC;AAE5B,QAAM,QAAQ,MAAM,MAAM,OAAO,EAAE,MAAM,GAAG,IAAI,SAAS,CAAC;AAC1D,QAAM,SAAS,MAAM,MAA2C,aAAa;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,QAAQ,MAAM,MAAiD,MAAM;AAAA,IAC1E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AACD,QAAM,SAAS,MAAM,MAA2C,aAAa;AAAA,IAC5E,MAAM,GAAG,IAAI;AAAA,EACd,CAAC;AAED,WAAS,QAAQ,OAA2D;AAC3E,UAAM,YAAY,YAAY,UAAU,aAAa,UAAU,aAAa,YAAY;AACxF,kBAAcA;AAAA,MACb;AAAA,MACA,MAAM,UAAU,UAAU,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,IACD;AACA,WAAO,IAAI,WAAW;AACtB,WAAO,IAAI,WAAW;AACtB,QAAI,cAAc,QAAS,OAAM,IAAI,IAAI;AACzC,QAAI,cAAc,aAAa,cAAc,WAAY,OAAM,IAAI,KAAK;AAAA,EACzE;AAEA,WAAS,OAAO,OAA8B,QAAuB;AACpE,kBAAc;AACd,UAAM,OAAO,EAAE,OAAO,SAASF,cAAa,MAAM,GAAG,QAAQ,YAAY;AACzE,UAAM,IAAI,IAAI;AAAA,EACf;AAEA,WAAS,SAAS,MAA+B;AAChD,QAAI;AACH,aAAO,WAAW;AAAA,IACnB,QAAQ;AAAA,IAER;AAAA,EACD;AAEA,WAAS,OAAO,MAAuB;AACtC,QAAI,KAAK,UAAU,WAAW;AAC7B,iBAAW;AACX,gBAAU;AACV,cAAQ,UAAU;AAAA,IACnB,WAAW,YAAY,UAAU,WAAW;AAC3C,gBAAU;AACV,cAAQ,OAAO;AAAA,IAChB,OAAO;AACN,gBAAU;AACV,cAAQ,SAAS;AAAA,IAClB;AACA,aAAS,KAAK,IAAI;AAClB,IAAAI,OAAM;AAAA,EACP;AAEA,WAAS,KAAK,MAAiB,QAAuB;AACrD,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,QAAO,KAAK,OAAO,MAAM;AACnF,cAAU;AACV,QAAI,KAAK,UAAU,cAAc,KAAK,UAAU,SAAU,SAAQ,SAAS;AAC3E,aAAS,KAAK,IAAI;AAClB,IAAAA,OAAM;AAAA,EACP;AAEA,WAAS,cAAc,MAAiB,OAAyB;AAChE,QAAK,OAAO,UAAU,YAAY,OAAO,UAAU,cAAe,UAAU,KAAM,QAAO;AACzF,QAAI;AACJ,QAAI;AACH,aAAQ,MAA6B;AAAA,IACtC,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB,aAAO;AAAA,IACR;AACA,QAAI,OAAO,SAAS,WAAY,QAAO;AACvC,QAAI,UAAU;AACd,UAAM,SAAS,CAAC,SAAqB;AACpC,UAAI,QAAS;AACb,gBAAU;AACV,WAAK;AAAA,IACN;AACA,QAAI;AACH,MAAC,KAAoF;AAAA,QACpF;AAAA,QACA,MAAM,OAAO,MAAM,OAAO,IAAI,CAAC;AAAA,QAC/B,CAAC,WAAW,OAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,MAC5C;AAAA,IACD,SAAS,QAAQ;AAChB,aAAO,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAChC;AACA,WAAO;AAAA,EACR;AAEA,WAAS,QAAQ,MAAuB;AACvC,QAAI,YAAa,oBAAoB,KAAK,UAAU,aAAa,KAAK,UAAU,SAAU;AACzF,eAAS,KAAK,IAAI;AAClB;AAAA,IACD;AACA,UAAM,KAAK,IAAI;AACf,IAAAA,OAAM;AAAA,EACP;AAEA,WAASA,SAAc;AACtB,QAAI,QAAS;AACb,UAAM,OAAO,MAAM,MAAM;AACzB,QAAI,SAAS,OAAW;AACxB,cAAU;AACV;AAAA,MACC,KAAK,UAAU,UAAU,aAAa,YAAY,UAAU,aAAa,aAAa;AAAA,IACvF;AACA,QAAI;AACJ,QAAI;AACH,eAAS,KAAK,IAAI;AAAA,IACnB,SAAS,QAAQ;AAChB,WAAK,MAAM,MAAM;AACjB;AAAA,IACD;AACA,QAAI,cAAc,MAAM,MAAM,EAAG;AACjC,WAAO,IAAI;AAAA,EACZ;AAEA,WAAS,gBAAgB,MAAoE;AAC5F,UAAM,WAAW,mBAAmB,YAAY,IAAI;AACpD,mCAA+B;AAC/B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP;AAAA,MACA,MAAM;AACL,cAAM,QACL,gCAAgC,MAAM,UAAU;AAAA,UAC/C,cAAc,YAAY;AAAA,QAC3B,CAAC;AACF,8CAAsC,OAAO,IAAI;AACjD,eAAO,KAAK,cAAc,IAAI,aAAa,KAAK,EAAE,KAAK,MAAM;AAC5D,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,gBAAgB,YAAY,iBAAiB;AAAA,UAC9C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,cAAc,QAAuC;AAC7D,UAAM,YAAY,KAAK;AACvB,QAAI,cAAc,OAAW;AAC7B,YAAQ;AAAA,MACP,OAAO;AAAA,MACP,MAAM;AACL,cAAM,QAGF,8BAA8B,MAAM,MAAM;AAC9C,4CAAoC,OAAO,IAAI;AAC/C,eAAO,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,YAAY;AAChD,gBAAM,QAAQ;AAGd,wBAAc;AAAA,YACb,GAAG;AAAA,YACH,WAAW,MAAM;AAAA,YACjB,cAAc,YAAY,eAAe;AAAA,UAC1C;AACA,oBAAU;AACV,kBAAQ,OAAO;AAAA,QAChB,CAAC;AAAA,MACF;AAAA,IACD,CAAC;AAAA,EACF;AAEA,WAAS,yBAA+B;AACvC,UAAM,UAAU,MAAM,OAAO,CAAC;AAC9B,eAAW,QAAQ,QAAS,UAAS,KAAK,IAAI;AAAA,EAC/C;AAEA,SAAQ,WAAW,MAAwC;AAAA,IAC1D,CAAC,KAAc,aAA4B;AAC1C,UAAI,iBAAkB;AACtB,YAAM,SAASD,QAAgC,GAAG;AAClD,UAAI,WAAW,OAAW;AAC1B,UAAI,eAAe,aAAa,OAAW;AAC3C,sCAAgC;AAChC,oBAAc,MAAM;AACpB,UACC,yBAAyB,UACzB,gCAAgC,sBAC/B;AACD,wBAAgB;AAAA,MACjB;AAAA,IACD;AAAA,EACD;AACA,gBAAc;AAEd,MAAI,KAAK,qBAAqB,MAAO,iBAAgB;AAAA,MAChD,SAAQ,OAAO;AAEpB,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,MAAM,MAAoE;AACzE,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,cAAQ,EAAE,OAAO,SAAS,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACvD;AAAA,IACA,SAAS,MAAoE;AAC5E,UAAI,YAAY,kBAAkB;AACjC,iBAAS,IAAI;AACb;AAAA,MACD;AACA,sBAAgB,IAAI;AAAA,IACrB;AAAA,IACA,QAAQ,MAAoE;AAC3E,UAAI,UAAU;AACb,iBAAS,IAAI;AACb;AAAA,MACD;AACA,yBAAmB;AACnB,aAAO;AACP,6BAAuB;AACvB,cAAQ,EAAE,OAAO,WAAW,MAAM,KAAK,MAAM,OAAU,CAAC;AAAA,IACzD;AAAA,EACD;AACD;AAEA,SAAS,mBACR,YACA,MACqB;AACrB,MAAI,SAAS,eAAe;AAC3B,WAAO,CAAC,GAAI,WAA6C,MAAM,CAAC;AAAA,EACjE;AACA,MAAI,SAAS,iBAAiB;AAC7B,WAAQ,WAA+C,QAAQ;AAAA,EAChE;AACA,SAAQ,WAAgD,QAAQ;AACjE;AAqFO,SAAS,2BACf,MACqC;AACrC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,sBAAyB,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC1D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,oBAAuB,OAAO;AAAA,MAChD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA6C,KAAK,OAAO,YAAY;AAAA,MACxF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,0BACf,MACoC;AACpC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,qBAAwB,QAAQ,EAAE,KAAK,CAAC,WAAW;AACzD,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,mBAAsB,OAAO;AAAA,MAC/C,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA4C,KAAK,OAAO,YAAY;AAAA,MACvF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,0BACf,MACuC;AACvC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,qBAA2B,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC5D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,mBAAyB,OAAO;AAAA,MAClD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA4C,KAAK,OAAO,YAAY;AAAA,MACvF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;AAGO,SAAS,4BACf,MACyC;AACzC,QAAM,gBAAgB,KAAK,iBAAiB,KAAK,QAAQ;AACzD,QAAM,cAAc,KAAK,eAAe,sBAAsB,aAAa;AAC3E,QAAM,WAAW,EAAE,GAAG,MAAM,aAAa,cAAc;AACvD,SAAO,uBAA6B,QAAQ,EAAE,KAAK,CAAC,WAAW;AAC9D,UAAM,QACL,OAAO,WAAW,WAAW,KAAK,YAAY,SAC3C,EAAE,GAAG,QAAQ,OAAO,KAAK,QAAQ,IACjC;AACJ,UAAM,aAAa,qBAA2B,OAAO;AAAA,MACpD,GAAI,KAAK,cAAc,CAAC;AAAA,MACxB,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACZ,CAAC;AACD,UAAM,cAAc,0BAA8C,KAAK,OAAO,YAAY;AAAA,MACzF,GAAG;AAAA,MACH,MAAM;AAAA,MACN,MAAM,KAAK,OAAO,GAAG,KAAK,IAAI,iBAAiB;AAAA,MAC/C;AAAA,MACA;AAAA,MACA,qBAAqB,OAAO,QAAQ;AAAA,IACrC,CAAC;AACD,WAAO,EAAE,YAAY,aAAa,OAAO;AAAA,EAC1C,CAAC;AACF;;;ACnhBO,SAAS,aAAgBE,OAA8B;AAC7D,SAAOA,MAAK;AACb;AAMO,SAAS,oBACfA,OACA,KACA,OAAkC,CAAC,GACtB;AACb,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,MAAI,KAAK,UAAW,KAAI,KAAK,CAAC;AAE9B,MAAI,cAAc;AAClB,QAAM,+BAA+B,KAAK,eAAe,KAAK;AAC9D,QAAM,OAAa,CAAC,KAAK,aAA4B;AACpD,YAAQ,IAAI,CAAC,GAAG;AAAA,MACf,KAAK;AACJ,YAAI,gCAAgC,eAAe,aAAa,QAAW;AAC1E;AAAA,QACD;AACA,YAAI,IAAI,CAAC,CAAM;AACf;AAAA,MACD,KAAK;AACJ,aAAK,UAAU,IAAI,CAAC,CAAC;AACrB;AAAA,MACD,KAAK;AACJ,aAAK,aAAa;AAClB;AAAA,IACF;AAAA,EACD;AACA,QAAM,cAAcA,MAAK,UAAU,IAAI;AACvC,gBAAc;AACd,SAAO;AACR;AAGO,SAAS,cACfA,OACA,OAAkC,CAAC,GAChB;AACnB,SAAO;AAAA,IACN,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,QAAQ,oBAAoBA,OAAM,KAAK,EAAE,WAAW,MAAM,GAAG,KAAK,CAAC;AAAA,EAChF;AACD;AAEA,SAAS,eAAkBA,OAAwC;AAClE,SAAO,OAAQA,MAA2B,QAAQ;AACnD;AAEA,SAAS,aAAgBA,OAAuB,OAAgB;AAC/D,EAAAA,MAAK,IAAI,KAAK;AACf;AAWO,SAAS,cACfA,OACA,OAAgC,CAAC,GACd;AACnB,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,QAAM,QAAQ,KAAK,UAAU,eAAeA,KAAI,IAAI,eAAe;AACnE,MAAI,CAAC,OAAO;AACX,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAC/E;AACA,QAAM,WAAWA;AACjB,SAAO;AAAA,IACN,KAAK;AAAA,IACL,WAAW,CAAC,QAAQ,oBAAoBA,OAAM,KAAK,EAAE,WAAW,MAAM,GAAG,KAAK,CAAC;AAAA,IAC/E,KAAK,CAAC,UAAU,MAAM,UAAU,KAAK;AAAA,IACrC,QAAQ,CAAC,OAAO,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC;AAAA,EAC3C;AACD;AAGO,SAAS,cACfA,OACA,OAAkF,CAAC,GAChE;AACnB,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,SAAO;AAAA,IACN,aAAa;AAAA,IACb,mBAAmB;AAAA,IACnB,WAAW,CAAC,kBACX,oBAAoBA,OAAM,MAAM,cAAc,GAAG;AAAA,MAChD,aAAa;AAAA,MACb,SAAS,KAAK;AAAA,MACd,YAAY,KAAK;AAAA,IAClB,CAAC;AAAA,EACH;AACD;AAGO,SAAS,oBACf,UACA,SACA,OAA6C,CAAC,GAChB;AAC9B,QAAM,OAAO,MAAM;AAClB,UAAM,OAAO,SAAS,SAAS,CAAC;AAChC,UAAM,MAAM,CAAC;AACb,eAAW,OAAO,MAAM;AACvB,YAAM,QAAQ,QAAQ,GAAG;AACzB,YAAM,SAAS,CAAC;AAChB,iBAAW,SAAS,OAAO,KAAK,KAAK,GAAqB;AACzD,eAAO,KAAK,IAAI,MAAM,KAAK,EAAE;AAAA,MAC9B;AACA,UAAI,GAAG,IAAI;AAAA,IACZ;AACA,WAAO;AAAA,EACR;AAEA,SAAO;AAAA,IACN,KAAK;AAAA,IACL,UAAU,KAAK;AACd,YAAM,cAAiC,CAAC;AACxC,YAAM,iBAAiB,MAAM;AAC5B,mBAAW,SAAS,YAAY,OAAO,CAAC,EAAG,OAAM;AAAA,MAClD;AACA,YAAM,OAAO,MAAM;AAClB,uBAAe;AACf,mBAAW,OAAO,SAAS,SAAS,CAAC,GAAG;AACvC,gBAAM,QAAQ,QAAQ,GAAG;AACzB,qBAAW,SAAS,OAAO,KAAK,KAAK,GAAqB;AACzD,wBAAY;AAAA,cACX,oBAAoB,MAAM,KAAK,GAAG,MAAM,IAAI,KAAK,CAAC,GAAG;AAAA,gBACpD,aAAa;AAAA,gBACb,SAAS,KAAK;AAAA,gBACd,YAAY,KAAK;AAAA,cAClB,CAAC;AAAA,YACF;AAAA,UACD;AAAA,QACD;AACA,YAAI,KAAK,CAAC;AAAA,MACX;AACA,YAAM,YAAY,oBAAoB,UAAU,MAAM;AAAA,QACrD,aAAa;AAAA,QACb,SAAS,KAAK;AAAA,QACd,YAAY,KAAK;AAAA,MAClB,CAAC;AACD,WAAK;AACL,aAAO,MAAM;AACZ,kBAAU;AACV,uBAAe;AAAA,MAChB;AAAA,IACD;AAAA,EACD;AACD;AAaO,SAAS,aACfA,OACA,eAAkB,aAAaA,KAAI,GACnC,OAAgC,CAAC,GACZ;AACrB,QAAM,YAAY,oBAAI,IAAgB;AACtC,QAAM,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI;AACzD,QAAM,QAAQ,KAAK,UAAU,eAAeA,KAAI,IAAI,eAAe;AACnE,MAAI,CAAC,OAAO;AACX,UAAM,IAAI,UAAU,yDAAyD;AAAA,EAC9E;AACA,QAAM,WAAWA;AACjB,QAAM,MAA0B;AAAA,IAC/B,UAAU,MAAM,KAAK;AAAA,IACrB,SAAS,SAAS,SAAS;AAC1B,YAAM,OAAO,IAAI,SAAS;AAC1B,YAAM,OAAO,OAAO,YAAY,aAAa,QAAQ,IAAI,IAAI;AAC7D,YAAM,UAAU,UAAW,OAAc,EAAE,GAAG,MAAM,GAAG,KAAK,CAAO;AAAA,IACpE;AAAA,IACA,iBAAiB,MAAM;AAAA,IACvB,UAAU,UAAU;AACnB,UAAI,OAAO,IAAI,SAAS;AACxB,YAAM,QAAQ;AAAA,QACbA;AAAA,QACA,MAAM;AACL,gBAAM,OAAO,IAAI,SAAS;AAC1B,mBAAS,MAAM,IAAI;AACnB,iBAAO;AAAA,QACR;AAAA,QACA,EAAE,aAAa,MAAM,SAAS,KAAK,SAAS,YAAY,KAAK,WAAW;AAAA,MACzE;AACA,gBAAU,IAAI,KAAK;AACnB,aAAO,MAAM;AACZ,YAAI,CAAC,UAAU,OAAO,KAAK,EAAG;AAC9B,cAAM;AAAA,MACP;AAAA,IACD;AAAA,IACA,UAAU;AACT,iBAAW,SAAS,CAAC,GAAG,SAAS,GAAG;AACnC,kBAAU,OAAO,KAAK;AACtB,cAAM;AAAA,MACP;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAQO,SAAS,UACfA,OACA,OAA4D,CAAC,GACvB;AACtC,QAAM,OAAqB;AAAA,IAC1B,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,aAAa,MAAM,GAAG,KAAK,CAAC;AAAA,IAC3F,OAAOA;AAAA,EACR;AACA,MAAI,eAAeA,KAAI,KAAK,OAAQ,KAAiC,UAAU,YAAY;AAC1F,UAAM,WAAW;AAAA,MAChBA;AAAA,MACA;AAAA,IAGD;AACA,WAAO,EAAE,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,OAAO;AAAA,EAC9D;AACA,SAAO;AACR;AAQO,SAAS,SACfA,OACA,OAA4D,CAAC,GACzB;AACpC,QAAM,OAAoB;AAAA,IACzB,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,WAAW,MAAM,GAAG,KAAK,CAAC;AAAA,IACzF,QAAQ,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,aAAa,MAAM,GAAG,KAAK,CAAC;AAAA,IACxF,OAAOA;AAAA,EACR;AACA,MAAI,eAAeA,KAAI,KAAK,OAAQ,KAAiC,UAAU,YAAY;AAC1F,UAAM,WAAW;AAAA,MAChBA;AAAA,MACA;AAAA,IAGD;AACA,WAAO,EAAE,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,OAAO;AAAA,EAC9D;AACA,SAAO;AACR;AAQO,SAAS,eACfA,OACA,OAA4D,CAAC,GACrB;AACxC,QAAM,OAAsB;AAAA,IAC3B,KAAK,OAAO,KAAK,gBAAgB,MAAM,aAAaA,KAAI,IAAI;AAAA,IAC5D,WAAW,CAAC,aAAa,oBAAoBA,OAAM,UAAU,EAAE,aAAa,MAAM,GAAG,KAAK,CAAC;AAAA,IAC3F,OAAOA;AAAA,EACR;AACA,MAAI,eAAeA,KAAI,KAAK,OAAQ,KAAiC,UAAU,YAAY;AAC1F,UAAM,WAAW;AAAA,MAChBA;AAAA,MACA;AAAA,IAGD;AACA,WAAO,EAAE,GAAG,MAAM,KAAK,SAAS,KAAK,QAAQ,SAAS,OAAO;AAAA,EAC9D;AACA,SAAO;AACR;","names":["depCount","node","node","node","out","node","node","node","node","source","assertStrictJsonValue","isDenseArrayOf","assertStrictJsonValue","isPlainRecord","source","recordFromFrame","errorMessage","drain","records","node","bytesEqual","isRecord","errorMessage","requestId","request","node","errorMessage","active","nowMs","issue","status","emitOutbound","source","attempt","error","source","timer","send","timer","emitOutbound","send","entry","active","node","active","initial","validate","active","isRecord","ownKeys","assertKeys","strictJsonIdentity","isRecord","assertKeys","cmpOrd","row","errorMessage","validateSnapshotEveryChanges","statusOf","dataOf","drain","node"]}