@graphrefly/ts 0.0.0

package/dist/chunk-G4M3NHRJ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/sources.ts"],"sourcesContent":["/**\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"],"mappings":";;;;;;;;;AA8DA,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;AAEA,SAAS,qBAAqB,OAAe,OAAqB;AACjE,MAAI,OAAO,UAAU,YAAY,MAAM,WAAW,GAAG;AACpD,UAAM,IAAI,UAAU,GAAG,KAAK,6BAA6B;AAAA,EAC1D;AACD;AAEA,SAAS,kBACR,QACA,YACO;AACP,SAAO,QAAQ;AACf,QAAM,SAAS,WAAW;AAC1B,aAAW,QAAQ;AACnB,MAAI,WAAW,OAAW,iBAAgB,MAAM;AACjD;AAEA,SAAS,oBACR,QACA,YACA,QACO;AACP,MAAI,OAAO,MAAO,YAAW,QAAQ;AAAA,MAChC,iBAAgB,MAAM;AAC5B;AAEA,SAAS,gBAAgB,QAA4B;AACpD,MAAI;AACH,WAAO;AAAA,EACR,QAAQ;AAAA,EAER;AACD;AAEA,SAAS,oBACR,SACA,SACA,OACqB;AACrB,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,YAAM,SAAS,EAAE,OAAO,KAAK;AAC7B,YAAM,aAAkD,EAAE,OAAO,OAAU;AAC3E,YAAM,WAAW,CAAC,WAA4B;AAC7C,YAAI,CAAC,OAAO,MAAO;AACnB,0BAAkB,QAAQ,UAAU;AACpC,YAAI,OAAO,GAAI,KAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC;AAAA,YACzD,KAAI,KAAK,CAAC,CAAC,SAAS,aAAa,OAAO,KAAK,CAAC,CAAC,CAAC;AAAA,MACtD;AACA,UAAI;AACJ,UAAI;AACH,iBAAS,MAAM,KAAK,QAAQ;AAAA,MAC7B,SAAS,GAAG;AACX,eAAO,QAAQ;AACf,YAAI,KAAK,CAAC,CAAC,SAAS,aAAa,CAAC,CAAC,CAAC,CAAC;AACrC;AAAA,MACD;AACA,UAAI,WAAW,QAAW;AACzB,eAAO,QAAQ;AACf,YAAI,KAAK,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC;AAC7B;AAAA,MACD;AACA,0BAAoB,QAAQ,YAAY,MAAM;AAC9C,aAAO,MAAM,kBAAkB,QAAQ,UAAU;AAAA,IAClD;AAAA,IACA,EAAE,MAAM,SAAS,UAAU,MAAM;AAAA,EAClC;AACD;AAEA,SAAS,mBACR,SACA,SACA,OACA,QACA,SACqB;AACrB,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,YAAM,SAAS,EAAE,OAAO,KAAK;AAC7B,YAAM,aAAkD,EAAE,OAAO,OAAU;AAC3E,YAAM,WAAW,CAAC,UAAa;AAC9B,YAAI,CAAC,OAAO,MAAO;AACnB,YAAI,MAAM,SAAS,SAAS;AAC3B,gBAAM,QAAQ,OAAO,KAAK;AAC1B,cAAI,UAAU,OAAW,KAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AAAA,QACpD,WAAW,MAAM,SAAS,SAAS;AAClC,4BAAkB,QAAQ,UAAU;AACpC,cAAI,KAAK,CAAC,CAAC,SAAS,aAAa,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC;AAAA,QACnD,WAAW,MAAM,SAAS,YAAY;AACrC,4BAAkB,QAAQ,UAAU;AACpC,cAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,QACxB;AAAA,MACD;AACA,UAAI;AACJ,UAAI;AACH,iBAAS,MAAM,KAAK,QAAQ;AAAA,MAC7B,SAAS,GAAG;AACX,eAAO,QAAQ;AACf,YAAI,KAAK,CAAC,CAAC,SAAS,aAAa,CAAC,CAAC,CAAC,CAAC;AACrC;AAAA,MACD;AACA,UAAI,WAAW,QAAW;AACzB,eAAO,QAAQ;AACf,YAAI,KAAK,CAAC,CAAC,SAAS,OAAO,CAAC,CAAC;AAC7B;AAAA,MACD;AACA,0BAAoB,QAAQ,YAAY,MAAM;AAC9C,aAAO,MAAM,kBAAkB,QAAQ,UAAU;AAAA,IAClD;AAAA,IACA,EAAE,MAAM,SAAS,UAAU,MAAM;AAAA,EAClC;AACD;AAEA,SAAS,OAAO,GAAuB;AACtC,SACC,KAAK,QACL,OAAO,MAAM,YACb,WAAW,KACX,OAAQ,EAAW,cAAc;AAEnC;AAEA,SAAS,WAAW,GAAuC;AAC1D,SAAO,KAAK,QAAQ,OAAQ,EAA2B,SAAS;AACjE;AAEA,SAAS,gBAAmB,GAAmC;AAC9D,SACC,MAAM,QACN,MAAM,UACN,OAAQ,EAA2C,OAAO,aAAa,MAAM;AAE/E;AAEA,SAAS,WAAc,GAA8B;AACpD,SACC,MAAM,QACN,MAAM,UACN,OAAQ,EAAsC,OAAO,QAAQ,MAAM;AAErE;AAyDA,SAAS,eAAe,OAAe,KAAa,KAA0B;AAC7E,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,2BAA2B;AACnE,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,QAAQ,MAAM,MAAM,GAAG,GAAG;AACpC,QAAI,KAAK,WAAW,EAAG,OAAM,IAAI,MAAM,uBAAuB,KAAK,EAAE;AACrE,UAAM,YAAY,KAAK,MAAM,GAAG;AAChC,QAAI,UAAU,SAAS,EAAG,OAAM,IAAI,MAAM,sBAAsB,IAAI,EAAE;AACtE,UAAM,CAAC,OAAO,QAAQ,IAAI;AAC1B,QAAI,SAAS,QAAQ,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,uBAAuB,KAAK,EAAE;AACvF,QAAI,aAAa,GAAI,OAAM,IAAI,MAAM,sBAAsB,IAAI,EAAE;AACjE,UAAM,OAAO,YAAY,OAAO,IAAI,aAAa,UAAU,sBAAsB,IAAI,EAAE;AACvF,QAAI,OAAO,EAAG,OAAM,IAAI,MAAM,sBAAsB,IAAI,EAAE;AAE1D,QAAI;AACJ,QAAI;AACJ,QAAI,UAAU,KAAK;AAClB,cAAQ;AACR,YAAM;AAAA,IACP,WAAW,MAAM,SAAS,GAAG,GAAG;AAC/B,YAAM,CAAC,GAAG,GAAG,KAAK,IAAI,MAAM,MAAM,GAAG;AACrC,UAAI,UAAU,UAAa,MAAM,MAAM,MAAM;AAC5C,cAAM,IAAI,MAAM,uBAAuB,KAAK,EAAE;AAC/C,cAAQ,aAAa,GAAG,uBAAuB,KAAK,EAAE;AACtD,YAAM,aAAa,GAAG,uBAAuB,KAAK,EAAE;AAAA,IACrD,OAAO;AACN,cAAQ,aAAa,OAAO,uBAAuB,KAAK,EAAE;AAC1D,YAAM;AAAA,IACP;AAEA,QAAI,CAAC,OAAO,UAAU,KAAK,KAAK,CAAC,OAAO,UAAU,GAAG,GAAG;AACvD,YAAM,IAAI,MAAM,uBAAuB,KAAK,EAAE;AAAA,IAC/C;AACA,QAAI,QAAQ,OAAO,MAAM,KAAK;AAC7B,YAAM,IAAI,WAAW,4BAA4B,KAAK,KAAK,GAAG,IAAI,GAAG,GAAG;AAAA,IACzE;AACA,QAAI,QAAQ,IAAK,OAAM,IAAI,MAAM,uBAAuB,KAAK,IAAI,GAAG,OAAO,KAAK,EAAE;AAClF,aAAS,IAAI,OAAO,KAAK,KAAK,KAAK,KAAM,KAAI,IAAI,CAAC;AAAA,EACnD;AACA,SAAO;AACR;AAEA,SAAS,aAAa,MAAc,SAAyB;AAC5D,MAAI,CAAC,QAAQ,KAAK,IAAI,EAAG,OAAM,IAAI,MAAM,OAAO;AAChD,QAAM,QAAQ,OAAO,SAAS,MAAM,EAAE;AACtC,MAAI,CAAC,OAAO,cAAc,KAAK,EAAG,OAAM,IAAI,MAAM,OAAO;AACzD,SAAO;AACR;AAGO,SAAS,UAAU,MAA4B;AACrD,QAAM,QAAQ,KAAK,KAAK,EAAE,MAAM,KAAK;AACrC,MAAI,MAAM,WAAW,KAAK,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,CAAC,GAAG;AAClE,UAAM,IAAI,MAAM,wCAAwC,MAAM,MAAM,EAAE;AAAA,EACvE;AACA,SAAO;AAAA,IACN,SAAS,eAAe,MAAM,CAAC,GAAG,GAAG,EAAE;AAAA,IACvC,OAAO,eAAe,MAAM,CAAC,GAAG,GAAG,EAAE;AAAA,IACrC,aAAa,eAAe,MAAM,CAAC,GAAG,GAAG,EAAE;AAAA,IAC3C,QAAQ,eAAe,MAAM,CAAC,GAAG,GAAG,EAAE;AAAA,IACtC,YAAY,eAAe,MAAM,CAAC,GAAG,GAAG,CAAC;AAAA,EAC1C;AACD;AAGO,SAAS,YAAY,UAAwB,MAAqB;AACxE,SACC,SAAS,QAAQ,IAAI,KAAK,WAAW,CAAC,KACtC,SAAS,MAAM,IAAI,KAAK,SAAS,CAAC,KAClC,SAAS,YAAY,IAAI,KAAK,QAAQ,CAAC,KACvC,SAAS,OAAO,IAAI,KAAK,SAAS,IAAI,CAAC,KACvC,SAAS,WAAW,IAAI,KAAK,OAAO,CAAC;AAEvC;AAEA,SAAS,cAAc,MAAoB;AAC1C,SAAO,GAAG,KAAK,YAAY,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,KAAK,WAAW,CAAC;AAC9G;AAEA,SAAS,kBAAkB,MAAoB;AAC9C,UAAQ,OAAO,KAAK,QAAQ,CAAC,IAAI,UAAY,SAAS;AACvD;AAkBO,SAAS,SACf,MACA,OAAwB,CAAC,GACiB;AAC1C,QAAM,WAAW,UAAU,IAAI;AAC/B,QAAM,EAAE,SAAS,KAAQ,SAAS,gBAAgB,OAAO,IAAI;AAC7D,MAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG;AAC5C,UAAM,IAAI,WAAW,mDAAmD;AAAA,EACzE;AACA,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,OAAO;AACX,UAAI;AACJ,UAAI;AACJ,YAAM,UAAU,MAAM;AACrB,eAAO;AACP,YAAI,eAAe,OAAW,eAAc,UAAU;AACtD,qBAAa;AACb,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,UAAU,CAAC,QAAc;AAC9B,YAAI,WAAW,OAAQ,KAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC;AAAA,iBACtC,WAAW,eAAgB,KAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC;AAAA,YACjE,KAAI,KAAK,CAAC,CAAC,QAAQ,kBAAkB,GAAG,CAAC,CAAC,CAAC;AAAA,MACjD;AACA,YAAM,QAAQ,MAAM;AACnB,YAAI,KAAM;AACV,cAAM,MAAM,oBAAI,KAAK;AACrB,cAAM,MAAM,cAAc,GAAG;AAC7B,YAAI,QAAQ,gBAAgB,YAAY,UAAU,GAAG,GAAG;AACvD,yBAAe;AACf,kBAAQ,GAAG;AAAA,QACZ;AAAA,MACD;AACA,UAAI,QAAQ,SAAS;AACpB,gBAAQ;AACR,eAAO;AAAA,MACR;AACA,cAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACzD,YAAM;AACN,mBAAa,YAAY,OAAO,MAAM;AACtC,aAAO;AAAA,IACR;AAAA,IACA,EAAE,MAAM,QAAQ,UAAU,MAAM;AAAA,EACjC;AACD;AAEO,SAAS,WACf,SACA,OAA0B,CAAC,GACM;AACjC,SAAO,sBAAsB,EAAE,SAAS,KAAK,CAAC;AAC/C;AAEO,SAAS,YACf,SACA,OAA0B,CAAC,GACM;AACjC,SAAO,cAAc,eAAe,EAAE,SAAS,KAAK,CAAC;AACtD;AAEO,SAAS,sBAAsB,SAAyD;AAC9F,SAAO,cAAc,cAAc,OAAO;AAC3C;AAEA,SAAS,cAAc,SAAiB,SAAyD;AAChG,uBAAqB,QAAQ,SAAS,GAAG,OAAO,WAAW;AAC3D,SAAO;AAAA,IACN;AAAA,IACA,GAAG,OAAO;AAAA,IACV,CAAC,KAAK,aAAa,IAAI,YAAY,EAAE,cAAc,GAAG,IAAI,SAAS,QAAQ;AAAA,EAC5E;AACD;AAEO,SAAS,SAAS,KAA4C;AACpE,SAAO,oBAAoB,EAAE,QAAQ,OAAO,IAAI,CAAC;AAClD;AAEO,SAAS,oBAAoB,SAAqD;AACxF,uBAAqB,QAAQ,KAAK,eAAe;AACjD,uBAAqB,QAAQ,QAAQ,kBAAkB;AACvD,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,KAAK,aAAa,IAAI,YAAY,EAAE,WAAW,GAAG,QAAQ,SAAS,QAAQ;AAAA,EAC7E;AACD;AAEO,SAAS,QAAQ,KAAwC;AAC/D,SAAO,mBAAmB,EAAE,IAAI,CAAC;AAClC;AAEO,SAAS,mBAAmB,SAAgD;AAClF,uBAAqB,QAAQ,KAAK,cAAc;AAChD,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,KAAK,aAAa,IAAI,YAAY,EAAE,UAAU,GAAG,QAAQ,SAAS,QAAQ;AAAA,IAC3E,CAAC,UAAW,MAAM,SAAS,UAAU,MAAM,QAAQ;AAAA,IACnD,CAAC,UAAW,MAAM,SAAS,UAAU,MAAM,QAAQ;AAAA,EACpD;AACD;AAEO,SAAS,cAAc,KAA8C;AAC3E,SAAO,yBAAyB,EAAE,IAAI,CAAC;AACxC;AAEO,SAAS,yBACf,SACkC;AAClC,uBAAqB,QAAQ,KAAK,oBAAoB;AACtD,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,KAAK,aAAa,IAAI,YAAY,EAAE,gBAAgB,GAAG,QAAQ,SAAS,QAAQ;AAAA,IACjF,CAAC,UAAW,MAAM,SAAS,UAAU,MAAM,QAAQ;AAAA,IACnD,CAAC,UAAW,MAAM,SAAS,UAAU,MAAM,QAAQ;AAAA,EACpD;AACD;AAEO,SAAS,YAAY,IAA2C;AACtE,SAAO,uBAAuB,EAAE,GAAG,CAAC;AACrC;AAEO,SAAS,uBACf,cACgC;AAChC,uBAAqB,aAAa,IAAI,iBAAiB;AACvD,SAAO;AAAA,IACN;AAAA,IACA;AAAA,IACA,CAAC,KAAK,aAAa,IAAI,YAAY,EAAE,cAAc,GAAG,SAAS,cAAc,QAAQ;AAAA,IACrF,CAAC,UAAW,MAAM,SAAS,UAAU,MAAM,QAAQ;AAAA,IACnD,CAAC,UAAW,MAAM,SAAS,UAAU,MAAM,QAAQ;AAAA,EACpD;AACD;AAEA,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;AAGO,SAAS,UAAU,IAAY,MAAiD;AACtF,SAAO,YAAY,aAAa,IAAI,IAAI;AACzC;AAGO,SAAS,SAAS,IAAqC;AAC7D,SAAO,YAAY,YAAY,IAAI,EAAE,QAAQ,GAAG,CAAC;AAClD;AAOO,SAAS,YACf,GACA,MACqB;AACrB,QAAM,SAAS,MAAM;AACrB,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,UAAU;AACd,YAAM,UAAU,MAAM;AACrB,YAAI,QAAS;AACb,kBAAU;AAEV,YAAI,KAAK,CAAC,CAAC,SAAS,aAAc,OAAuB,MAAM,CAAC,CAAC,CAAC;AAAA,MACnE;AACA,UAAI,QAAQ,SAAS;AACpB,gBAAQ;AACR;AAAA,MACD;AACA,cAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACzD,WAAK,QAAQ,QAAQ,CAAC,EAAE;AAAA,QACvB,CAAC,MAAM;AACN,cAAI,QAAS;AACb,oBAAU;AACV,kBAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;AAAA,QACrC;AAAA,QACA,CAAC,MAAM;AACN,cAAI,QAAS;AACb,oBAAU;AACV,kBAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAI,KAAK,CAAC,CAAC,SAAS,aAAa,CAAC,CAAC,CAAC,CAAC;AAAA,QACtC;AAAA,MACD;AACA,aAAO,MAAM;AACZ,kBAAU;AACV,gBAAQ,oBAAoB,SAAS,OAAO;AAAA,MAC7C;AAAA,IACD;AAAA,IACA,EAAE,MAAM,QAAQ;AAAA,EACjB;AACD;AAMO,SAAS,cACf,UACA,MACqB;AACrB,QAAM,cAAc,MAAM;AAC1B,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,YAAM,KAAK,IAAI,gBAAgB;AAC/B,YAAM,eAAe,MAAM,GAAG,MAAM,aAAa,MAAM;AACvD,mBAAa,iBAAiB,SAAS,cAAc,EAAE,MAAM,KAAK,CAAC;AACnE,UAAI,OAAO;AACX,YAAM,OAAO,YAAY;AACxB,YAAI;AACH,2BAAiB,KAAK,UAAU;AAC/B,gBAAI,GAAG,OAAO,QAAS;AACvB,gBAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAA,UACvB;AACA,cAAI,CAAC,GAAG,OAAO,QAAS,KAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,QAChD,SAAS,GAAG;AACX,cAAI,CAAC,GAAG,OAAO,QAAS,KAAI,KAAK,CAAC,CAAC,SAAS,aAAa,CAAC,CAAC,CAAC,CAAC;AAAA,QAC9D,UAAE;AACD,iBAAO;AAAA,QACR;AAAA,MACD;AACA,WAAK,KAAK;AACV,aAAO,MAAM;AACZ,YAAI,CAAC,KAAM,IAAG,MAAM;AACpB,qBAAa,oBAAoB,SAAS,YAAY;AAAA,MACvD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,QAAQ;AAAA,EACjB;AACD;AAKO,SAAS,MAAiB,QAAiC;AACjE,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,iBAAW,SAAS,OAAQ,KAAI,KAAK,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC;AACtD,UAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IACxB;AAAA,IACA,EAAE,MAAM,OAAO;AAAA,EAChB;AACD;AAGO,SAAS,SAAY,UAA2C;AACtE,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,iBAAW,KAAK,SAAU,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChD,UAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IACxB;AAAA,IACA,EAAE,MAAM,OAAO;AAAA,EAChB;AACD;AAGO,SAAS,QAAuC;AACtD,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IACxB;AAAA,IACA,EAAE,MAAM,OAAO;AAAA,EAChB;AACD;AAGO,SAAS,QAAuC;AACtD,SAAO,OAAU,SAAS,MAAM,QAAW,EAAE,MAAM,OAAO,CAAC;AAC5D;AAGO,SAAS,WAAW,KAAsC;AAChE,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,KAAK,CAAC,CAAC,SAAS,aAAa,GAAG,CAAC,CAAC,CAAC;AAAA,IACxC;AAAA,IACA,EAAE,MAAM,OAAO;AAAA,EAChB;AACD;AAMO,SAAS,UACf,QACA,MACA,OAAyB,CAAC,GACL;AACrB,MAAI,UAAU,QAAQ,OAAO,OAAO,qBAAqB,YAAY;AACpE,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACxE;AACA,MAAI,OAAO,OAAO,wBAAwB,YAAY;AACrD,UAAM,IAAI,UAAU,sDAAsD;AAAA,EAC3E;AACA,MAAI,OAAO,SAAS,YAAY,KAAK,WAAW,GAAG;AAClD,UAAM,IAAI,UAAU,kDAAkD;AAAA,EACvE;AACA,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,OAAO;AACX,YAAM,UAAU,CAAC,UAAmB;AACnC,YAAI,CAAC,KAAM,KAAI,KAAK,CAAC,CAAC,QAAQ,KAAU,CAAC,CAAC;AAAA,MAC3C;AACA,aAAO,iBAAiB,MAAM,SAAS,IAAI;AAC3C,aAAO,MAAM;AACZ,eAAO;AACP,eAAO,oBAAoB,MAAM,SAAS,IAAI;AAAA,MAC/C;AAAA,IACD;AAAA,IACA,EAAE,MAAM,OAAO;AAAA,EAChB;AACD;AAMO,SAAS,qBAAkC,UAA+C;AAChG,MAAI,OAAO,aAAa,YAAY;AACnC,UAAM,IAAI,UAAU,mDAAmD;AAAA,EACxE;AACA,SAAO;AAAA,IACN;AAAA,IACA,CAAC,QAAQ;AACR,UAAI,OAAO;AACX,YAAM,UAAU,CAAC,YAAe;AAC/B,YAAI,CAAC,KAAM,KAAI,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC;AAAA,MACxC;AACA,YAAM,cAAc,SAAS,OAAO;AACpC,aAAO,MAAM;AACZ,eAAO;AACP,YAAI,OAAO,gBAAgB,WAAY,aAAY;AAAA,MACpD;AAAA,IACD;AAAA,IACA,EAAE,MAAM,OAAO;AAAA,EAChB;AACD;AASO,SAAS,QACf,OACA,OAA4C,CAAC,GACnC;AACV,MAAI,OAAO,KAAK,EAAG,QAAO;AAC1B,QAAM,EAAE,MAAM,GAAG,SAAS,IAAI;AAC9B,MAAI,WAAW,KAAK,GAAG;AACtB,WAAO,SAAS,YAAY,KAAuB,GAAG,CAAC,GAAG,QAAQ;AAAA,EACnE;AACA,MAAI,UAAU,QAAQ,UAAU,QAAW;AAC1C,UAAM,YAAY;AAIlB,QAAI,OAAO,UAAU,OAAO,aAAa,MAAM,YAAY;AAC1D,aAAO,SAAS,cAAc,KAAyB,GAAG,CAAC,GAAG,QAAQ;AAAA,IACvE;AACA,QAAI,SAAS,QAAQ,OAAO,UAAU,OAAO,QAAQ,MAAM,YAAY;AACtE,aAAO,SAAS,SAAS,KAAoB,GAAG,CAAC,GAAG,QAAQ;AAAA,IAC7D;AAAA,EACD;AACA,SAAO,SAAS,GAAG,KAAU,GAAG,CAAC,GAAG,QAAQ;AAC7C;AAOO,SAAS,eAAkBA,SAA6B;AAC9D,SAAO,IAAI,QAAW,CAAC,SAAS,WAAW;AAC1C,QAAI,UAAU;AACd,QAAI,cAAc;AAClB,QAAI;AACJ,UAAM,SAAS,CAAC,MAAwB;AACvC,UAAI,QAAS;AACb,gBAAU;AACV,QAAE;AACF,UAAI,OAAO;AACV,cAAM;AACN,gBAAQ;AAAA,MACT,OAAO;AACN,sBAAc;AAAA,MACf;AAAA,IACD;AACA,YAAQA,QAAO,UAAU,CAAC,QAAQ;AACjC,UAAI,IAAI,CAAC,MAAM,QAAQ;AACtB,eAAO,MAAM,QAAQ,IAAI,CAAC,CAAM,CAAC;AAAA,MAClC,WAAW,IAAI,CAAC,MAAM,SAAS;AAC9B,eAAO,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AAAA,MAC5B,WAAW,IAAI,CAAC,MAAM,YAAY;AACjC,eAAO,MAAM,OAAO,IAAI,MAAM,wCAAwC,CAAC,CAAC;AAAA,MACzE,WAAW,IAAI,CAAC,MAAM,YAAY;AACjC,eAAO,MAAM,OAAO,IAAI,MAAM,wCAAwC,CAAC,CAAC;AAAA,MACzE;AAAA,IACD,CAAC;AACD,QAAI,aAAa;AAChB,cAAQ;AACR,cAAQ;AAAA,IACT;AAAA,EACD,CAAC;AACF;AAEA,SAAS,mBAAsB,OAAa;AAC3C,MAAI,UAAU,QAAW;AACxB,UAAM,IAAI,UAAU,oDAAoD;AAAA,EACzE;AACA,SAAO;AACR;AAEA,eAAe,uBAA0B,OAAqC;AAC7E,QAAM,OAAO,MAAM,OAAO,aAAa,EAAE;AACzC,QAAM,EAAE,OAAO,KAAK,IAAI,MAAM,KAAK,KAAK;AACxC,MAAI,MAAM;AACT,UAAM,KAAK,SAAS;AACpB,UAAM,IAAI,MAAM,sDAAsD;AAAA,EACvE;AACA,MAAI;AACH,UAAM,KAAK,SAAS;AAAA,EACrB,QAAQ;AAAA,EAER;AACA,SAAO;AACR;AAEA,SAAS,kBAAqB,OAAgC;AAC7D,QAAM,OAAO,MAAM,OAAO,QAAQ,EAAE;AACpC,QAAM,EAAE,OAAO,KAAK,IAAI,KAAK,KAAK;AAClC,MAAI,MAAM;AACT,SAAK,SAAS;AACd,WAAO,QAAQ,OAAO,IAAI,MAAM,gDAAgD,CAAC;AAAA,EAClF;AACA,MAAI;AACH,SAAK,SAAS;AAAA,EACf,QAAQ;AAAA,EAER;AACA,SAAO,QAAQ,QAAQ,KAAU;AAClC;AAEA,SAAS,mBAAsB,OAAqB,MAAsC;AACzF,MAAI,WAAW,KAAK,EAAG,QAAO,QAAQ,QAAQ,KAAuB,EAAE,KAAK,kBAAkB;AAC9F,MAAI,OAAO,KAAK,EAAG,QAAO,eAAe,KAAgB,EAAE,KAAK,kBAAkB;AAClF,MAAI,gBAAmB,KAAK,EAAG,QAAO,uBAAuB,KAAK,EAAE,KAAK,kBAAkB;AAC3F,MAAI,KAAK,SAAS,QAAQ,WAAc,KAAK,GAAG;AAC/C,WAAO,kBAAkB,KAAK,EAAE,KAAK,kBAAkB;AAAA,EACxD;AACA,MAAI,UAAU,QAAW;AACxB,WAAO,QAAQ,OAAO,IAAI,UAAU,oDAAoD,CAAC;AAAA,EAC1F;AACA,SAAO,QAAQ,QAAQ,mBAAmB,KAAU,CAAC;AACtD;AAOO,SAAS,cACf,SACA,OAAgC,CAAC,GACR;AACzB,QAAM,QAAQ,KAAK,UAAU,CAAC,QAAoB;AAClD,QAAM,WAAW,oBAAI,IAAyB;AAE9C,SAAO,CAAC,QAAuB;AAC9B,UAAM,YAAY,MAAM,GAAG;AAC3B,UAAM,WAAW,SAAS,IAAI,SAAS;AACvC,QAAI,SAAU,QAAO;AAErB,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,UAAM,UAAU,MAAY;AAC3B,UAAI,SAAS,IAAI,SAAS,MAAM,QAAS,UAAS,OAAO,SAAS;AAAA,IACnE;AACA,UAAM,UAAU,IAAI,QAAW,CAAC,SAAS,WAAW;AACnD,uBAAiB;AACjB,sBAAgB;AAAA,IACjB,CAAC;AACD,cAAU,QAAQ;AAAA,MACjB,CAAC,UAAU;AACV,gBAAQ;AACR,eAAO;AAAA,MACR;AAAA,MACA,CAAC,UAAU;AACV,gBAAQ;AACR,cAAM;AAAA,MACP;AAAA,IACD;AACA,aAAS,IAAI,WAAW,OAAO;AAC/B,QAAI;AACH,yBAAmB,QAAQ,GAAG,GAAG,IAAI,EAAE,KAAK,gBAAgB,aAAa;AAAA,IAC1E,SAAS,GAAG;AACX,oBAAc,CAAC;AAAA,IAChB;AACA,WAAO;AAAA,EACR;AACD;","names":["source"]}

package/dist/chunk-GAJW5I5P.js

@@ -0,0 +1 @@
+//# sourceMappingURL=chunk-GAJW5I5P.js.map

package/dist/chunk-GAJW5I5P.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/chunk-GDL26N2T.js

@@ -0,0 +1,282 @@
+import {
+  depBatch,
+  depCount,
+  depLatest,
+  depTerminal,
+  isTerminalComplete,
+  isTerminalError,
+  isTerminalNone,
+  terminalErrorValue
+} from "./chunk-SWTLEQL6.js";
+
+// src/graph/combinators.ts
+function combine() {
+  return {
+    factory: "combine",
+    opts: { partial: true },
+    body: (ctx) => {
+      const vals = Array.from({ length: depCount(ctx) }, (_, i) => depLatest(ctx, i));
+      if (vals.some((v) => v === void 0)) return;
+      ctx.down([["DATA", vals]]);
+    }
+  };
+}
+var combineLatest = combine;
+function withLatestFrom() {
+  return {
+    factory: "withLatestFrom",
+    opts: { completeWhenDepsComplete: false, terminalAsRealInput: true },
+    body: (ctx) => {
+      if (isTerminalComplete(depTerminal(ctx, 0))) {
+        ctx.down([["COMPLETE"]]);
+        return;
+      }
+      const b0 = depBatch(ctx, 0);
+      if (!b0 || b0.length === 0) return;
+      const sec = depLatest(ctx, 1);
+      if (sec === void 0) return;
+      for (const v of b0) ctx.down([["DATA", [v, sec]]]);
+    }
+  };
+}
+function zip() {
+  return {
+    factory: "zip",
+    opts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },
+    body: (ctx) => {
+      const n = depCount(ctx);
+      if (n === 0) {
+        ctx.down([["COMPLETE"]]);
+        return;
+      }
+      const st = ctx.state.get() ?? {
+        queues: Array.from({ length: n }, () => []),
+        terminal: new Array(n).fill(false)
+      };
+      for (let i = 0; i < n; i++) {
+        const b = depBatch(ctx, i);
+        if (b) for (const v of b) st.queues[i].push(v);
+        if (isTerminalComplete(depTerminal(ctx, i))) st.terminal[i] = true;
+      }
+      while (st.queues.every((q) => q.length > 0)) {
+        ctx.down([["DATA", st.queues.map((q) => q.shift())]]);
+      }
+      ctx.state.set(st);
+      for (let i = 0; i < n; i++) {
+        if (st.terminal[i] && st.queues[i].length === 0) {
+          ctx.down([["COMPLETE"]]);
+          return;
+        }
+      }
+    }
+  };
+}
+function concat() {
+  return {
+    factory: "concat",
+    opts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },
+    body: (ctx) => {
+      const firstBatch = depBatch(ctx, 0);
+      const secondBatch = depBatch(ctx, 1);
+      const firstTerminal = depTerminal(ctx, 0);
+      const secondTerminal = depTerminal(ctx, 1);
+      const st = ctx.state.get() ?? {
+        phase: 0,
+        pending: [],
+        secondDone: false
+      };
+      if (st.phase === 0) {
+        if (firstBatch) for (const v of firstBatch) ctx.down([["DATA", v]]);
+        if (secondBatch) for (const v of secondBatch) st.pending.push(v);
+        if (isTerminalComplete(secondTerminal)) st.secondDone = true;
+        if (isTerminalComplete(firstTerminal)) {
+          st.phase = 1;
+          for (const v of st.pending) ctx.down([["DATA", v]]);
+          st.pending = [];
+          if (st.secondDone) ctx.down([["COMPLETE"]]);
+        }
+      } else {
+        if (secondBatch) for (const v of secondBatch) ctx.down([["DATA", v]]);
+        if (isTerminalComplete(secondTerminal)) ctx.down([["COMPLETE"]]);
+      }
+      ctx.state.set(st);
+    }
+  };
+}
+function race() {
+  return {
+    factory: "race",
+    opts: {
+      partial: true,
+      errorWhenDepsError: false,
+      completeWhenDepsComplete: false,
+      terminalAsRealInput: true
+    },
+    body: (ctx) => {
+      const n = depCount(ctx);
+      const st = ctx.state.get() ?? {
+        winner: null,
+        terminals: new Array(n).fill(false)
+      };
+      for (let i = 0; i < n; i++) {
+        const terminal = depTerminal(ctx, i);
+        if (!isTerminalNone(terminal)) st.terminals[i] = terminal;
+      }
+      if (st.winner === null) {
+        for (let i = 0; i < n; i++) {
+          const b = depBatch(ctx, i);
+          if (b && b.length > 0) {
+            st.winner = i;
+            for (const v of b) ctx.down([["DATA", v]]);
+            break;
+          }
+        }
+        if (st.winner === null) {
+          if (st.terminals.every((t) => !isTerminalNone(t))) {
+            ctx.state.set(st);
+            ctx.down([["COMPLETE"]]);
+            return;
+          }
+        }
+      } else {
+        const b = depBatch(ctx, st.winner);
+        const terminal = depTerminal(ctx, st.winner);
+        if (b) for (const v of b) ctx.down([["DATA", v]]);
+        if (isTerminalComplete(terminal)) {
+          ctx.state.set(st);
+          ctx.down([["COMPLETE"]]);
+          return;
+        }
+        if (isTerminalError(terminal)) {
+          ctx.state.set(st);
+          ctx.down([["ERROR", terminalErrorValue(terminal)]]);
+          return;
+        }
+      }
+      ctx.state.set(st);
+    }
+  };
+}
+function buffer() {
+  return {
+    factory: "buffer",
+    opts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },
+    body: (ctx) => {
+      const sourceBatch = depBatch(ctx, 0);
+      const notifierBatch = depBatch(ctx, 1);
+      const buf = ctx.state.get() ?? [];
+      if (sourceBatch) for (const v of sourceBatch) buf.push(v);
+      if (isTerminalComplete(depTerminal(ctx, 0))) {
+        if (buf.length > 0) ctx.down([["DATA", [...buf]]]);
+        ctx.state.set([]);
+        ctx.down([["COMPLETE"]]);
+        return;
+      }
+      if (notifierBatch && notifierBatch.length > 0) {
+        ctx.down([["DATA", [...buf]]]);
+        ctx.state.set([]);
+        return;
+      }
+      ctx.state.set(buf);
+    }
+  };
+}
+function bufferCount(count) {
+  if (!Number.isInteger(count) || count < 1) {
+    throw new RangeError(`bufferCount: count must be a positive integer (got ${count})`);
+  }
+  return {
+    factory: "bufferCount",
+    opts: { completeWhenDepsComplete: false, terminalAsRealInput: true },
+    body: (ctx) => {
+      const b = depBatch(ctx, 0);
+      const buf = ctx.state.get() ?? [];
+      if (b) {
+        for (const v of b) {
+          buf.push(v);
+          if (buf.length >= count) ctx.down([["DATA", buf.splice(0, buf.length)]]);
+        }
+      }
+      if (isTerminalComplete(depTerminal(ctx, 0))) {
+        if (buf.length > 0) ctx.down([["DATA", [...buf]]]);
+        ctx.state.set([]);
+        ctx.down([["COMPLETE"]]);
+        return;
+      }
+      ctx.state.set(buf);
+    }
+  };
+}
+function sample() {
+  return {
+    factory: "sample",
+    opts: {
+      partial: true,
+      completeWhenDepsComplete: false,
+      errorWhenDepsError: false,
+      terminalAsRealInput: true
+    },
+    body: (ctx) => {
+      const sourceBatch = depBatch(ctx, 0);
+      const notifierBatch = depBatch(ctx, 1);
+      const sourceTerminal = depTerminal(ctx, 0);
+      const notifierTerminal = depTerminal(ctx, 1);
+      const st = ctx.state.get() ?? {
+        last: void 0,
+        sourceDone: false
+      };
+      if (isTerminalError(sourceTerminal)) {
+        ctx.down([["ERROR", terminalErrorValue(sourceTerminal)]]);
+        return;
+      }
+      if (isTerminalError(notifierTerminal)) {
+        ctx.down([["ERROR", terminalErrorValue(notifierTerminal)]]);
+        return;
+      }
+      if (sourceBatch) for (const v of sourceBatch) st.last = { v };
+      if (isTerminalComplete(sourceTerminal)) {
+        st.sourceDone = true;
+        st.last = void 0;
+      }
+      if (isTerminalComplete(notifierTerminal)) {
+        ctx.state.set(st);
+        ctx.down([["COMPLETE"]]);
+        return;
+      }
+      if (notifierBatch && notifierBatch.length > 0 && st.last !== void 0 && !st.sourceDone) {
+        ctx.down([["DATA", st.last.v]]);
+      }
+      ctx.state.set(st);
+    }
+  };
+}
+function takeUntil() {
+  return {
+    factory: "takeUntil",
+    opts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },
+    body: (ctx) => {
+      const sourceBatch = depBatch(ctx, 0);
+      const notifierBatch = depBatch(ctx, 1);
+      if (notifierBatch && notifierBatch.length > 0) {
+        ctx.down([["COMPLETE"]]);
+        return;
+      }
+      if (sourceBatch) for (const v of sourceBatch) ctx.down([["DATA", v]]);
+      if (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([["COMPLETE"]]);
+    }
+  };
+}
+
+export {
+  combine,
+  combineLatest,
+  withLatestFrom,
+  zip,
+  concat,
+  race,
+  buffer,
+  bufferCount,
+  sample,
+  takeUntil
+};
+//# sourceMappingURL=chunk-GDL26N2T.js.map

package/dist/chunk-GDL26N2T.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/combinators.ts"],"sourcesContent":["/**\n * Multi-source combinators + notifier-driven operators (CSP-2.7 catalog re-derive, D40 / D45).\n *\n * Per-language sugar (D6/D24, never in parity). Each forms topology ONLY via DECLARED deps (D45) —\n * the frozen pure-ts reference (D41) builds these as a producer that calls `subscribeOr` on each\n * source INSIDE the fn body, which is the D45-banned describe island (an edge `describe` cannot\n * show). Re-derived here as static-dep nodes with `partial:true` (fire on any dep, R-first-run-gate\n * off) + `ctx.state` (queue / phase / winner) — so every edge is a real subscription `describe`\n * shows truthfully (D3 / R-edges-derived). Multi-source completion / error reads\n * `depTerminal(ctx, i)` (R-deps-terminal) via `completeWhenDepsComplete:false +\n * terminalAsRealInput:true`.\n *\n * Under D49 (no equals-absorption) `combine` emits a fresh tuple on EVERY contributing wave (no\n * substrate tuple-dedup; the pure-ts `equals` tuple comparator is gone) — pair with\n * `distinctUntilChanged` for opt-in dedup. SENTINEL (\"a dep has never delivered DATA\") is detected\n * via `depLatest(ctx, i) === undefined` (R-sentinel: `undefined` is the global sentinel, `null` is a valid\n * value).\n *\n * NOT re-derived in this cut (flagged): the window family (`window`/`windowCount`/`windowTime`)\n * emits `Node<Node<T>>` nested sub-streams — the frozen reference creates child nodes inside the fn\n * body and pushes DATA into them imperatively, which is a describe island AND an open question for\n * how an emitted live sub-stream appears in `describe` (D45/D51). Deferred to a design pass.\n */\n\nimport {\n\ttype Ctx,\n\tdepBatch,\n\tdepCount,\n\tdepLatest,\n\tdepTerminal,\n\tisTerminalComplete,\n\tisTerminalError,\n\tisTerminalNone,\n\tterminalErrorValue,\n} from \"../ctx/types.js\";\nimport type { Operator } from \"./operators.js\";\n\n/**\n * combine (alias `combineLatest`): emit a tuple of every dep's latest value whenever ANY dep\n * delivers, once ALL deps have delivered at least one value. `partial:true`; the all-delivered gate\n * is `depLatest(ctx, i) !== undefined` per dep. Completes when ALL deps complete (default\n * completeWhenDepsComplete); any dep ERROR propagates (default errorWhenDepsError). Emits a fresh\n * tuple per wave (D49 — no dedup; compose `distinctUntilChanged` to suppress unchanged tuples).\n */\nexport function combine<T extends readonly unknown[]>(): Operator<unknown, T> {\n\treturn {\n\t\tfactory: \"combine\",\n\t\topts: { partial: true },\n\t\tbody: (ctx) => {\n\t\t\tconst vals = Array.from({ length: depCount(ctx) }, (_, i) => depLatest(ctx, i));\n\t\t\tif (vals.some((v) => v === undefined)) return; // not all deps delivered → undirty RESOLVED\n\t\t\tctx.down([[\"DATA\", vals as unknown as T]]);\n\t\t},\n\t};\n}\n\n/** combineLatest: RxJS-named alias of {@link combine}. */\nexport const combineLatest = combine;\n\n/**\n * withLatestFrom: on each PRIMARY (dep 0) value, emit `[primary, latestSecondary]`; a secondary-only\n * (dep 1) wave updates the cached secondary but emits nothing. Uses the DEFAULT first-run gate\n * (`partial:false`), NOT partial — the frozen reference's Phase 10.5 W1 fix: with `partial:true` the\n * primary's push-on-subscribe fires the fn BEFORE the secondary has delivered, so the initial pair\n * is dropped. The gate holds the first run until BOTH deps settle, then fires once with both\n * populated; subsequent waves are gate-free and fire on primary-alone. Completes when the PRIMARY\n * completes (not the secondary) — `completeWhenDepsComplete:false + terminalAsRealInput:true` with a\n * primary-terminal check; a secondary terminal is ignored (its last value persists).\n */\nexport function withLatestFrom<A, B>(): Operator<unknown, readonly [A, B]> {\n\treturn {\n\t\tfactory: \"withLatestFrom\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst b0 = depBatch(ctx, 0);\n\t\t\tif (!b0 || b0.length === 0) return; // secondary-only wave → quiet\n\t\t\tconst sec = depLatest(ctx, 1) as B | undefined;\n\t\t\tif (sec === undefined) return; // secondary never delivered → quiet\n\t\t\tfor (const v of b0) ctx.down([[\"DATA\", [v, sec] as readonly [A, B]]]);\n\t\t},\n\t};\n}\n\n/** Internal: per-dep FIFO queues for {@link zip}. */\ninterface ZipState {\n\tqueues: unknown[][];\n\tterminal: boolean[];\n}\n\n/**\n * zip: combine one value from EACH dep, in lockstep, into a tuple — buffering per-dep queues until\n * every dep has at least one queued value, then shifting one from each. `partial:true` +\n * `ctx.state` queues. Completes as soon as ANY dep is terminal AND its queue is empty (no further\n * tuple can form) — `completeWhenDepsComplete:false + terminalAsRealInput:true`. Any dep ERROR\n * propagates (default errorWhenDepsError).\n */\nexport function zip<T extends readonly unknown[]>(): Operator<unknown, T> {\n\treturn {\n\t\tfactory: \"zip\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst n = depCount(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 st = ctx.state.get<ZipState>() ?? {\n\t\t\t\tqueues: Array.from({ length: n }, () => [] as unknown[]),\n\t\t\t\tterminal: new Array(n).fill(false),\n\t\t\t};\n\t\t\tfor (let i = 0; i < n; i++) {\n\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\tif (b) for (const v of b) st.queues[i].push(v);\n\t\t\t\tif (isTerminalComplete(depTerminal(ctx, i))) st.terminal[i] = true;\n\t\t\t}\n\t\t\twhile (st.queues.every((q) => q.length > 0)) {\n\t\t\t\tctx.down([[\"DATA\", st.queues.map((q) => q.shift()) as unknown as T]]);\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t\t// A terminal dep whose queue is now drained can never contribute another tuple → COMPLETE.\n\t\t\tfor (let i = 0; i < n; i++) {\n\t\t\t\tif (st.terminal[i] && st.queues[i].length === 0) {\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/** Internal: phase + buffered second-source values for {@link concat}. */\ninterface ConcatState<S> {\n\tphase: 0 | 1;\n\tpending: S[];\n\tsecondDone: boolean;\n}\n\n/**\n * concat: play ALL of dep 0, then ALL of dep 1. Dep-1 DATA arriving during phase 0 is buffered and\n * flushed at the handoff (dep 0 COMPLETE). `partial:true` + `ctx.state` phase. Completes when dep 1\n * completes (or when dep 0 completes and dep 1 already had). `completeWhenDepsComplete:false +\n * terminalAsRealInput:true`; any dep ERROR propagates (default errorWhenDepsError).\n */\nexport function concat<S>(): Operator<S, S> {\n\treturn {\n\t\tfactory: \"concat\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst firstBatch = depBatch(ctx, 0);\n\t\t\tconst secondBatch = depBatch(ctx, 1);\n\t\t\tconst firstTerminal = depTerminal(ctx, 0);\n\t\t\tconst secondTerminal = depTerminal(ctx, 1);\n\t\t\tconst st: ConcatState<S> = ctx.state.get<ConcatState<S>>() ?? {\n\t\t\t\tphase: 0,\n\t\t\t\tpending: [],\n\t\t\t\tsecondDone: false,\n\t\t\t};\n\t\t\tif (st.phase === 0) {\n\t\t\t\tif (firstBatch) for (const v of firstBatch) ctx.down([[\"DATA\", v]]);\n\t\t\t\tif (secondBatch) for (const v of secondBatch) st.pending.push(v as S);\n\t\t\t\tif (isTerminalComplete(secondTerminal)) st.secondDone = true;\n\t\t\t\tif (isTerminalComplete(firstTerminal)) {\n\t\t\t\t\tst.phase = 1;\n\t\t\t\t\tfor (const v of st.pending) ctx.down([[\"DATA\", v]]);\n\t\t\t\t\tst.pending = [];\n\t\t\t\t\tif (st.secondDone) ctx.down([[\"COMPLETE\"]]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (secondBatch) for (const v of secondBatch) ctx.down([[\"DATA\", v]]);\n\t\t\t\tif (isTerminalComplete(secondTerminal)) ctx.down([[\"COMPLETE\"]]);\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t},\n\t};\n}\n\n/** Internal: which dep won the {@link race} (null until the first DATA). */\ninterface RaceState {\n\twinner: number | null;\n\tterminals: unknown[];\n}\n\n/**\n * race: the FIRST dep to deliver DATA wins; thereafter only the winner's messages flow (losers are\n * dropped, including their terminals). `partial:true` + `ctx.state` winner. `errorWhenDepsError:false`\n * (a LOSER's error must not error the race — only the winner's) + `completeWhenDepsComplete:false +\n * terminalAsRealInput:true`. If every dep terminates before any DATA, COMPLETE.\n */\nexport function race<S>(): Operator<S, S> {\n\treturn {\n\t\tfactory: \"race\",\n\t\topts: {\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\tbody: (ctx) => {\n\t\t\tconst n = depCount(ctx);\n\t\t\tconst st: RaceState = ctx.state.get<RaceState>() ?? {\n\t\t\t\twinner: null,\n\t\t\t\tterminals: new Array(n).fill(false),\n\t\t\t};\n\t\t\tfor (let i = 0; i < n; i++) {\n\t\t\t\tconst terminal = depTerminal(ctx, i);\n\t\t\t\tif (!isTerminalNone(terminal)) st.terminals[i] = terminal;\n\t\t\t}\n\t\t\tif (st.winner === null) {\n\t\t\t\t// Find the first dep that delivered DATA this wave → it wins.\n\t\t\t\tfor (let i = 0; i < n; i++) {\n\t\t\t\t\tconst b = depBatch(ctx, i);\n\t\t\t\t\tif (b && b.length > 0) {\n\t\t\t\t\t\tst.winner = i;\n\t\t\t\t\t\tfor (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (st.winner === null) {\n\t\t\t\t\t// No winner yet — if EVERY dep is terminal (none ever delivered DATA), COMPLETE.\n\t\t\t\t\tif (st.terminals.every((t) => !isTerminalNone(t))) {\n\t\t\t\t\t\tctx.state.set(st);\n\t\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tconst b = depBatch(ctx, st.winner);\n\t\t\t\tconst terminal = depTerminal(ctx, st.winner);\n\t\t\t\tif (b) for (const v of b) ctx.down([[\"DATA\", v]]);\n\t\t\t\tif (isTerminalComplete(terminal)) {\n\t\t\t\t\tctx.state.set(st);\n\t\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (isTerminalError(terminal)) {\n\t\t\t\t\tctx.state.set(st);\n\t\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(terminal)]]);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t},\n\t};\n}\n\n// ── notifier-driven (D46 first-cut: gated on a reactive notifier dep, no wall-clock) ──\n\n/**\n * buffer: accumulate dep 0 (source) DATA; flush the buffer as an array each time dep 1 (notifier)\n * delivers DATA. `partial:true` + `ctx.state` buffer. On source COMPLETE, flush any remainder then\n * COMPLETE (`completeWhenDepsComplete:false + terminalAsRealInput:true`; a notifier terminal is\n * ignored). Source/notifier ERROR propagates (default errorWhenDepsError).\n */\nexport function buffer<S>(): Operator<unknown, S[]> {\n\treturn {\n\t\tfactory: \"buffer\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst sourceBatch = depBatch(ctx, 0);\n\t\t\tconst notifierBatch = depBatch(ctx, 1);\n\t\t\tconst buf = ctx.state.get<S[]>() ?? [];\n\t\t\tif (sourceBatch) for (const v of sourceBatch) buf.push(v as S);\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) {\n\t\t\t\tif (buf.length > 0) ctx.down([[\"DATA\", [...buf]]]);\n\t\t\t\tctx.state.set([]);\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (notifierBatch && notifierBatch.length > 0) {\n\t\t\t\tctx.down([[\"DATA\", [...buf]]]); // flush (may be empty) on each notifier signal\n\t\t\t\tctx.state.set([]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tctx.state.set(buf);\n\t\t},\n\t};\n}\n\n/**\n * bufferCount: batch consecutive source DATA into arrays of length `count`; the remainder flushes on\n * source COMPLETE. Single dep + `ctx.state` buffer + `completeWhenDepsComplete:false +\n * terminalAsRealInput:true`.\n */\nexport function bufferCount<S>(count: number): Operator<S, S[]> {\n\tif (!Number.isInteger(count) || count < 1) {\n\t\tthrow new RangeError(`bufferCount: count must be a positive integer (got ${count})`);\n\t}\n\treturn {\n\t\tfactory: \"bufferCount\",\n\t\topts: { completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx) => {\n\t\t\tconst b = depBatch(ctx, 0);\n\t\t\tconst buf = ctx.state.get<S[]>() ?? [];\n\t\t\tif (b) {\n\t\t\t\tfor (const v of b) {\n\t\t\t\t\tbuf.push(v as S);\n\t\t\t\t\tif (buf.length >= count) ctx.down([[\"DATA\", buf.splice(0, buf.length)]]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) {\n\t\t\t\tif (buf.length > 0) ctx.down([[\"DATA\", [...buf]]]);\n\t\t\t\tctx.state.set([]);\n\t\t\t\tctx.down([[\"COMPLETE\"]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tctx.state.set(buf);\n\t\t},\n\t};\n}\n\n/** Internal: latest sampled source value + whether the source has completed, for {@link sample}. */\ninterface SampleState<S> {\n\tlast: { v: S } | undefined;\n\tsourceDone: boolean;\n}\n\n/**\n * sample: emit the source's (dep 0) most recent value each time the notifier (dep 1) delivers DATA.\n * `partial:true` + `ctx.state`. The notifier completing completes the operator; the source completing\n * stops sampling (clears the held value); an ERROR from either terminates.\n * `completeWhenDepsComplete:false + errorWhenDepsError:false + terminalAsRealInput:true` (manual\n * terminal handling). No flush of the held value on source COMPLETE (RxJS sample semantics).\n */\nexport function sample<S>(): Operator<unknown, S> {\n\treturn {\n\t\tfactory: \"sample\",\n\t\topts: {\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\tbody: (ctx) => {\n\t\t\tconst sourceBatch = depBatch(ctx, 0);\n\t\t\tconst notifierBatch = depBatch(ctx, 1);\n\t\t\tconst sourceTerminal = depTerminal(ctx, 0);\n\t\t\tconst notifierTerminal = depTerminal(ctx, 1);\n\t\t\tconst st: SampleState<S> = ctx.state.get<SampleState<S>>() ?? {\n\t\t\t\tlast: undefined,\n\t\t\t\tsourceDone: false,\n\t\t\t};\n\t\t\t// ERROR from either dep → terminate.\n\t\t\tif (isTerminalError(sourceTerminal)) {\n\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(sourceTerminal)]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (isTerminalError(notifierTerminal)) {\n\t\t\t\tctx.down([[\"ERROR\", terminalErrorValue(notifierTerminal)]]);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (sourceBatch) for (const v of sourceBatch) st.last = { v: v as S };\n\t\t\tif (isTerminalComplete(sourceTerminal)) {\n\t\t\t\tst.sourceDone = true;\n\t\t\t\tst.last = undefined;\n\t\t\t}\n\t\t\tif (isTerminalComplete(notifierTerminal)) {\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\tif (notifierBatch && notifierBatch.length > 0 && st.last !== undefined && !st.sourceDone) {\n\t\t\t\tctx.down([[\"DATA\", st.last.v]]);\n\t\t\t}\n\t\t\tctx.state.set(st);\n\t\t},\n\t};\n}\n\n/**\n * takeUntil: forward dep 0 (source) DATA until dep 1 (notifier) delivers its first DATA, then\n * COMPLETE. `partial:true` + `completeWhenDepsComplete:false + terminalAsRealInput:true`: a source\n * COMPLETE forwards COMPLETE; a notifier DATA triggers COMPLETE. Source/notifier ERROR propagates\n * (default errorWhenDepsError).\n */\nexport function takeUntil<S>(): Operator<unknown, S> {\n\treturn {\n\t\tfactory: \"takeUntil\",\n\t\topts: { partial: true, completeWhenDepsComplete: false, terminalAsRealInput: true },\n\t\tbody: (ctx: Ctx) => {\n\t\t\tconst sourceBatch = depBatch(ctx, 0);\n\t\t\tconst notifierBatch = depBatch(ctx, 1);\n\t\t\tif (notifierBatch && notifierBatch.length > 0) {\n\t\t\t\tctx.down([[\"COMPLETE\"]]); // notifier fired → stop\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (sourceBatch) for (const v of sourceBatch) ctx.down([[\"DATA\", v]]);\n\t\t\tif (isTerminalComplete(depTerminal(ctx, 0))) ctx.down([[\"COMPLETE\"]]);\n\t\t},\n\t};\n}\n"],"mappings":";;;;;;;;;;;;AA4CO,SAAS,UAA8D;AAC7E,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,KAAK;AAAA,IACtB,MAAM,CAAC,QAAQ;AACd,YAAM,OAAO,MAAM,KAAK,EAAE,QAAQ,SAAS,GAAG,EAAE,GAAG,CAAC,GAAG,MAAM,UAAU,KAAK,CAAC,CAAC;AAC9E,UAAI,KAAK,KAAK,CAAC,MAAM,MAAM,MAAS,EAAG;AACvC,UAAI,KAAK,CAAC,CAAC,QAAQ,IAAoB,CAAC,CAAC;AAAA,IAC1C;AAAA,EACD;AACD;AAGO,IAAM,gBAAgB;AAYtB,SAAS,iBAA2D;AAC1E,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IACnE,MAAM,CAAC,QAAQ;AACd,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,GAAG;AAC5C,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,YAAM,KAAK,SAAS,KAAK,CAAC;AAC1B,UAAI,CAAC,MAAM,GAAG,WAAW,EAAG;AAC5B,YAAM,MAAM,UAAU,KAAK,CAAC;AAC5B,UAAI,QAAQ,OAAW;AACvB,iBAAW,KAAK,GAAI,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAoB,CAAC,CAAC;AAAA,IACrE;AAAA,EACD;AACD;AAeO,SAAS,MAA0D;AACzE,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,MAAM,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IAClF,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,GAAG;AACtB,UAAI,MAAM,GAAG;AACZ,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,YAAM,KAAK,IAAI,MAAM,IAAc,KAAK;AAAA,QACvC,QAAQ,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,CAAc;AAAA,QACvD,UAAU,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AAAA,MAClC;AACA,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,cAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAI,EAAG,YAAW,KAAK,EAAG,IAAG,OAAO,CAAC,EAAE,KAAK,CAAC;AAC7C,YAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,EAAG,IAAG,SAAS,CAAC,IAAI;AAAA,MAC/D;AACA,aAAO,GAAG,OAAO,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG;AAC5C,YAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,OAAO,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAiB,CAAC,CAAC;AAAA,MACrE;AACA,UAAI,MAAM,IAAI,EAAE;AAEhB,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,YAAI,GAAG,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC,EAAE,WAAW,GAAG;AAChD,cAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,QACD;AAAA,MACD;AAAA,IACD;AAAA,EACD;AACD;AAeO,SAAS,SAA4B;AAC3C,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,MAAM,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IAClF,MAAM,CAAC,QAAQ;AACd,YAAM,aAAa,SAAS,KAAK,CAAC;AAClC,YAAM,cAAc,SAAS,KAAK,CAAC;AACnC,YAAM,gBAAgB,YAAY,KAAK,CAAC;AACxC,YAAM,iBAAiB,YAAY,KAAK,CAAC;AACzC,YAAM,KAAqB,IAAI,MAAM,IAAoB,KAAK;AAAA,QAC7D,OAAO;AAAA,QACP,SAAS,CAAC;AAAA,QACV,YAAY;AAAA,MACb;AACA,UAAI,GAAG,UAAU,GAAG;AACnB,YAAI,WAAY,YAAW,KAAK,WAAY,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAClE,YAAI,YAAa,YAAW,KAAK,YAAa,IAAG,QAAQ,KAAK,CAAM;AACpE,YAAI,mBAAmB,cAAc,EAAG,IAAG,aAAa;AACxD,YAAI,mBAAmB,aAAa,GAAG;AACtC,aAAG,QAAQ;AACX,qBAAW,KAAK,GAAG,QAAS,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAClD,aAAG,UAAU,CAAC;AACd,cAAI,GAAG,WAAY,KAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,QAC3C;AAAA,MACD,OAAO;AACN,YAAI,YAAa,YAAW,KAAK,YAAa,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AACpE,YAAI,mBAAmB,cAAc,EAAG,KAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,MAChE;AACA,UAAI,MAAM,IAAI,EAAE;AAAA,IACjB;AAAA,EACD;AACD;AAcO,SAAS,OAA0B;AACzC,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM;AAAA,MACL,SAAS;AAAA,MACT,oBAAoB;AAAA,MACpB,0BAA0B;AAAA,MAC1B,qBAAqB;AAAA,IACtB;AAAA,IACA,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,GAAG;AACtB,YAAM,KAAgB,IAAI,MAAM,IAAe,KAAK;AAAA,QACnD,QAAQ;AAAA,QACR,WAAW,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK;AAAA,MACnC;AACA,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,cAAM,WAAW,YAAY,KAAK,CAAC;AACnC,YAAI,CAAC,eAAe,QAAQ,EAAG,IAAG,UAAU,CAAC,IAAI;AAAA,MAClD;AACA,UAAI,GAAG,WAAW,MAAM;AAEvB,iBAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC3B,gBAAM,IAAI,SAAS,KAAK,CAAC;AACzB,cAAI,KAAK,EAAE,SAAS,GAAG;AACtB,eAAG,SAAS;AACZ,uBAAW,KAAK,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AACzC;AAAA,UACD;AAAA,QACD;AACA,YAAI,GAAG,WAAW,MAAM;AAEvB,cAAI,GAAG,UAAU,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,GAAG;AAClD,gBAAI,MAAM,IAAI,EAAE;AAChB,gBAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,UACD;AAAA,QACD;AAAA,MACD,OAAO;AACN,cAAM,IAAI,SAAS,KAAK,GAAG,MAAM;AACjC,cAAM,WAAW,YAAY,KAAK,GAAG,MAAM;AAC3C,YAAI,EAAG,YAAW,KAAK,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChD,YAAI,mBAAmB,QAAQ,GAAG;AACjC,cAAI,MAAM,IAAI,EAAE;AAChB,cAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,QACD;AACA,YAAI,gBAAgB,QAAQ,GAAG;AAC9B,cAAI,MAAM,IAAI,EAAE;AAChB,cAAI,KAAK,CAAC,CAAC,SAAS,mBAAmB,QAAQ,CAAC,CAAC,CAAC;AAClD;AAAA,QACD;AAAA,MACD;AACA,UAAI,MAAM,IAAI,EAAE;AAAA,IACjB;AAAA,EACD;AACD;AAUO,SAAS,SAAoC;AACnD,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,MAAM,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IAClF,MAAM,CAAC,QAAQ;AACd,YAAM,cAAc,SAAS,KAAK,CAAC;AACnC,YAAM,gBAAgB,SAAS,KAAK,CAAC;AACrC,YAAM,MAAM,IAAI,MAAM,IAAS,KAAK,CAAC;AACrC,UAAI,YAAa,YAAW,KAAK,YAAa,KAAI,KAAK,CAAM;AAC7D,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,GAAG;AAC5C,YAAI,IAAI,SAAS,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACjD,YAAI,MAAM,IAAI,CAAC,CAAC;AAChB,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,iBAAiB,cAAc,SAAS,GAAG;AAC9C,YAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAC7B,YAAI,MAAM,IAAI,CAAC,CAAC;AAChB;AAAA,MACD;AACA,UAAI,MAAM,IAAI,GAAG;AAAA,IAClB;AAAA,EACD;AACD;AAOO,SAAS,YAAe,OAAiC;AAC/D,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG;AAC1C,UAAM,IAAI,WAAW,sDAAsD,KAAK,GAAG;AAAA,EACpF;AACA,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IACnE,MAAM,CAAC,QAAQ;AACd,YAAM,IAAI,SAAS,KAAK,CAAC;AACzB,YAAM,MAAM,IAAI,MAAM,IAAS,KAAK,CAAC;AACrC,UAAI,GAAG;AACN,mBAAW,KAAK,GAAG;AAClB,cAAI,KAAK,CAAM;AACf,cAAI,IAAI,UAAU,MAAO,KAAI,KAAK,CAAC,CAAC,QAAQ,IAAI,OAAO,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC;AAAA,QACxE;AAAA,MACD;AACA,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,GAAG;AAC5C,YAAI,IAAI,SAAS,EAAG,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AACjD,YAAI,MAAM,IAAI,CAAC,CAAC;AAChB,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,MAAM,IAAI,GAAG;AAAA,IAClB;AAAA,EACD;AACD;AAeO,SAAS,SAAkC;AACjD,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM;AAAA,MACL,SAAS;AAAA,MACT,0BAA0B;AAAA,MAC1B,oBAAoB;AAAA,MACpB,qBAAqB;AAAA,IACtB;AAAA,IACA,MAAM,CAAC,QAAQ;AACd,YAAM,cAAc,SAAS,KAAK,CAAC;AACnC,YAAM,gBAAgB,SAAS,KAAK,CAAC;AACrC,YAAM,iBAAiB,YAAY,KAAK,CAAC;AACzC,YAAM,mBAAmB,YAAY,KAAK,CAAC;AAC3C,YAAM,KAAqB,IAAI,MAAM,IAAoB,KAAK;AAAA,QAC7D,MAAM;AAAA,QACN,YAAY;AAAA,MACb;AAEA,UAAI,gBAAgB,cAAc,GAAG;AACpC,YAAI,KAAK,CAAC,CAAC,SAAS,mBAAmB,cAAc,CAAC,CAAC,CAAC;AACxD;AAAA,MACD;AACA,UAAI,gBAAgB,gBAAgB,GAAG;AACtC,YAAI,KAAK,CAAC,CAAC,SAAS,mBAAmB,gBAAgB,CAAC,CAAC,CAAC;AAC1D;AAAA,MACD;AACA,UAAI,YAAa,YAAW,KAAK,YAAa,IAAG,OAAO,EAAE,EAAU;AACpE,UAAI,mBAAmB,cAAc,GAAG;AACvC,WAAG,aAAa;AAChB,WAAG,OAAO;AAAA,MACX;AACA,UAAI,mBAAmB,gBAAgB,GAAG;AACzC,YAAI,MAAM,IAAI,EAAE;AAChB,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,iBAAiB,cAAc,SAAS,KAAK,GAAG,SAAS,UAAa,CAAC,GAAG,YAAY;AACzF,YAAI,KAAK,CAAC,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC;AAAA,MAC/B;AACA,UAAI,MAAM,IAAI,EAAE;AAAA,IACjB;AAAA,EACD;AACD;AAQO,SAAS,YAAqC;AACpD,SAAO;AAAA,IACN,SAAS;AAAA,IACT,MAAM,EAAE,SAAS,MAAM,0BAA0B,OAAO,qBAAqB,KAAK;AAAA,IAClF,MAAM,CAAC,QAAa;AACnB,YAAM,cAAc,SAAS,KAAK,CAAC;AACnC,YAAM,gBAAgB,SAAS,KAAK,CAAC;AACrC,UAAI,iBAAiB,cAAc,SAAS,GAAG;AAC9C,YAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AACvB;AAAA,MACD;AACA,UAAI,YAAa,YAAW,KAAK,YAAa,KAAI,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;AACpE,UAAI,mBAAmB,YAAY,KAAK,CAAC,CAAC,EAAG,KAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;AAAA,IACrE;AAAA,EACD;AACD;","names":[]}